1 /* 2 * ModeShape (http://www.modeshape.org) 3 * See the COPYRIGHT.txt file distributed with this work for information 4 * regarding copyright ownership. Some portions may be licensed 5 * to Red Hat, Inc. under one or more contributor license agreements. 6 * See the AUTHORS.txt file in the distribution for a full listing of 7 * individual contributors. 8 * 9 * ModeShape is free software. Unless otherwise indicated, all code in ModeShape 10 * is licensed to you under the terms of the GNU Lesser General Public License as 11 * published by the Free Software Foundation; either version 2.1 of 12 * the License, or (at your option) any later version. 13 * 14 * ModeShape is distributed in the hope that it will be useful, 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 17 * Lesser General Public License for more details. 18 * 19 * You should have received a copy of the GNU Lesser General Public 20 * License along with this software; if not, write to the Free 21 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 22 * 02110-1301 USA, or see the FSF site: http://www.fsf.org. 23 */ 24 package org.modeshape.graph; 25 26 import net.jcip.annotations.NotThreadSafe; 27 28 /** 29 * A class used by this package to manage a single {@link Location} or multiple {@link Location} objects, without having the 30 * overhead of a collection (when only one is needed) and which can grow efficiently as new locations are added. This is achieved 31 * through an effective linked list. 32 */ 33 @NotThreadSafe 34 class Locations { 35 private final Location location; 36 private Locations next; 37 38 /*package*/Locations( Location location ) { 39 this.location = location; 40 } 41 42 /*package*/void add( Location location ) { 43 if (this.next == null) { 44 this.next = new Locations(location); 45 } else { 46 Locations theNextOne = this.next; 47 while (theNextOne != null) { 48 if (theNextOne.next == null) { 49 theNextOne.next = new Locations(location); 50 break; 51 } 52 theNextOne = theNextOne.next; 53 } 54 } 55 } 56 57 /*package*/boolean hasNext() { 58 return this.next != null; 59 } 60 61 /*package*/Locations next() { 62 return this.next; 63 } 64 65 /*package*/Location getLocation() { 66 return this.location; 67 } 68 }