15.28/4.96 YES
15.28/4.98 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
15.28/4.98 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
15.28/4.98
15.28/4.98
15.28/4.98 termination of the given Bare JBC problem could be proven:
15.28/4.98
15.28/4.98 (0) Bare JBC problem
15.28/4.98 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms]
15.28/4.98 (2) JBC problem
15.28/4.98 (3) JBCToGraph [EQUIVALENT, 1949 ms]
15.28/4.98 (4) JBCTerminationGraph
15.28/4.98 (5) TerminationGraphToSCCProof [SOUND, 0 ms]
15.28/4.98 (6) AND
15.28/4.98 (7) JBCTerminationSCC
15.28/4.98 (8) SCCToIRSProof [SOUND, 336 ms]
15.28/4.98 (9) IRSwT
15.28/4.98 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
15.28/4.98 (11) IRSwT
15.28/4.98 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 43 ms]
15.28/4.98 (13) IRSwT
15.28/4.98 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
15.28/4.98 (15) IRSwT
15.28/4.98 (16) TempFilterProof [SOUND, 56 ms]
15.28/4.98 (17) IntTRS
15.28/4.98 (18) RankingReductionPairProof [EQUIVALENT, 0 ms]
15.28/4.98 (19) YES
15.28/4.98 (20) JBCTerminationSCC
15.28/4.98 (21) SCCToIRSProof [SOUND, 74 ms]
15.28/4.98 (22) IRSwT
15.28/4.98 (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
15.28/4.98 (24) IRSwT
15.28/4.98 (25) IRSwTTerminationDigraphProof [EQUIVALENT, 68 ms]
15.28/4.98 (26) AND
15.28/4.98 (27) IRSwT
15.28/4.98 (28) IntTRSCompressionProof [EQUIVALENT, 0 ms]
15.28/4.98 (29) IRSwT
15.28/4.98 (30) TempFilterProof [SOUND, 10 ms]
15.28/4.98 (31) IntTRS
15.28/4.98 (32) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
15.28/4.98 (33) YES
15.28/4.98 (34) IRSwT
15.28/4.98 (35) IntTRSCompressionProof [EQUIVALENT, 0 ms]
15.28/4.98 (36) IRSwT
15.28/4.98 (37) TempFilterProof [SOUND, 8 ms]
15.28/4.98 (38) IntTRS
15.28/4.98 (39) RankingReductionPairProof [EQUIVALENT, 0 ms]
15.28/4.98 (40) YES
15.28/4.98 (41) JBCTerminationSCC
15.28/4.98 (42) SCCToIRSProof [SOUND, 37 ms]
15.28/4.98 (43) IRSwT
15.28/4.98 (44) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
15.28/4.98 (45) IRSwT
15.28/4.98 (46) IRSwTTerminationDigraphProof [EQUIVALENT, 55 ms]
15.28/4.98 (47) AND
15.28/4.98 (48) IRSwT
15.28/4.98 (49) IntTRSCompressionProof [EQUIVALENT, 0 ms]
15.28/4.98 (50) IRSwT
15.28/4.98 (51) TempFilterProof [SOUND, 39 ms]
15.28/4.98 (52) IntTRS
15.28/4.98 (53) PolynomialOrderProcessor [EQUIVALENT, 16 ms]
15.28/4.98 (54) YES
15.28/4.98 (55) IRSwT
15.28/4.98 (56) IntTRSCompressionProof [EQUIVALENT, 0 ms]
15.28/4.98 (57) IRSwT
15.28/4.98 (58) TempFilterProof [SOUND, 14 ms]
15.28/4.98 (59) IntTRS
15.28/4.98 (60) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
15.28/4.98 (61) YES
15.28/4.98
15.28/4.98
15.28/4.98 ----------------------------------------
15.28/4.98
15.28/4.98 (0)
15.28/4.98 Obligation:
15.28/4.98 need to prove termination of the following program:
15.28/4.98 /*
15.28/4.98 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.28/4.98 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.28/4.98 *
15.28/4.98 * This code is free software; you can redistribute it and/or modify it
15.28/4.98 * under the terms of the GNU General Public License version 2 only, as
15.28/4.98 * published by the Free Software Foundation. Sun designates this
15.28/4.98 * particular file as subject to the "Classpath" exception as provided
15.28/4.98 * by Sun in the LICENSE file that accompanied this code.
15.28/4.98 *
15.28/4.98 * This code is distributed in the hope that it will be useful, but WITHOUT
15.28/4.98 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.28/4.98 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.28/4.98 * version 2 for more details (a copy is included in the LICENSE file that
15.28/4.98 * accompanied this code).
15.28/4.98 *
15.28/4.98 * You should have received a copy of the GNU General Public License version
15.28/4.98 * 2 along with this work; if not, write to the Free Software Foundation,
15.28/4.98 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.28/4.98 *
15.28/4.98 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.28/4.98 * CA 95054 USA or visit www.sun.com if you need additional information or
15.28/4.98 * have any questions.
15.28/4.98 */
15.28/4.98
15.28/4.98 package javaUtilEx;
15.28/4.98
15.28/4.98 /**
15.28/4.98 * This class provides a skeletal implementation of the Collection
15.28/4.98 * interface, to minimize the effort required to implement this interface.
15.28/4.98 *
15.28/4.98 * To implement an unmodifiable collection, the programmer needs only to
15.28/4.98 * extend this class and provide implementations for the iterator and
15.28/4.98 * size methods. (The iterator returned by the iterator
15.28/4.98 * method must implement hasNext and next.)
15.28/4.98 *
15.28/4.98 * To implement a modifiable collection, the programmer must additionally
15.28/4.98 * override this class's add method (which otherwise throws an
15.28/4.98 * UnsupportedOperationException), and the iterator returned by the
15.28/4.98 * iterator method must additionally implement its remove
15.28/4.98 * method.
15.28/4.98 *
15.28/4.98 * The programmer should generally provide a void (no argument) and
15.28/4.98 * Collection constructor, as per the recommendation in the
15.28/4.98 * Collection interface specification.
15.28/4.98 *
15.28/4.98 * The documentation for each non-abstract method in this class describes its
15.28/4.98 * implementation in detail. Each of these methods may be overridden if
15.28/4.98 * the collection being implemented admits a more efficient implementation.
15.28/4.98 *
15.28/4.98 * This class is a member of the
15.28/4.98 *
15.28/4.98 * Java Collections Framework.
15.28/4.98 *
15.28/4.98 * @author Josh Bloch
15.28/4.98 * @author Neal Gafter
15.28/4.98 * @see Collection
15.28/4.98 * @since 1.2
15.28/4.98 */
15.28/4.98
15.28/4.98 public abstract class AbstractCollection implements Collection {
15.28/4.98 /**
15.28/4.98 * Sole constructor. (For invocation by subclass constructors, typically
15.28/4.98 * implicit.)
15.28/4.98 */
15.28/4.98 protected AbstractCollection() {
15.28/4.98 }
15.28/4.98
15.28/4.98 // Query Operations
15.28/4.98
15.28/4.98 /**
15.28/4.98 * Returns an iterator over the elements contained in this collection.
15.28/4.98 *
15.28/4.98 * @return an iterator over the elements contained in this collection
15.28/4.98 */
15.28/4.98 public abstract Iterator iterator();
15.28/4.98
15.28/4.98 public abstract int size();
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 * This implementation returns size() == 0.
15.28/4.98 */
15.28/4.98 public boolean isEmpty() {
15.28/4.98 return size() == 0;
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 *
This implementation iterates over the elements in the collection,
15.28/4.98 * checking each element in turn for equality with the specified element.
15.28/4.98 *
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 */
15.28/4.98 public boolean contains(Object o) {
15.28/4.98 Iterator e = iterator();
15.28/4.98 if (o==null) {
15.28/4.98 while (e.hasNext())
15.28/4.98 if (e.next()==null)
15.28/4.98 return true;
15.28/4.98 } else {
15.28/4.98 while (e.hasNext())
15.28/4.98 if (o.equals(e.next()))
15.28/4.98 return true;
15.28/4.98 }
15.28/4.98 return false;
15.28/4.98 }
15.28/4.98
15.28/4.98 // Modification Operations
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 * This implementation always throws an
15.28/4.98 * UnsupportedOperationException.
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 * @throws IllegalArgumentException {@inheritDoc}
15.28/4.98 * @throws IllegalStateException {@inheritDoc}
15.28/4.98 */
15.28/4.98 public boolean add(E e) {
15.28/4.98 throw new UnsupportedOperationException();
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 *
This implementation iterates over the collection looking for the
15.28/4.98 * specified element. If it finds the element, it removes the element
15.28/4.98 * from the collection using the iterator's remove method.
15.28/4.98 *
15.28/4.98 *
Note that this implementation throws an
15.28/4.98 * UnsupportedOperationException if the iterator returned by this
15.28/4.98 * collection's iterator method does not implement the remove
15.28/4.98 * method and this collection contains the specified object.
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 */
15.28/4.98 public boolean remove(Object o) {
15.28/4.98 Iterator e = iterator();
15.28/4.98 if (o==null) {
15.28/4.98 while (e.hasNext()) {
15.28/4.98 if (e.next()==null) {
15.28/4.98 e.remove();
15.28/4.98 return true;
15.28/4.98 }
15.28/4.98 }
15.28/4.98 } else {
15.28/4.98 while (e.hasNext()) {
15.28/4.98 if (o.equals(e.next())) {
15.28/4.98 e.remove();
15.28/4.98 return true;
15.28/4.98 }
15.28/4.98 }
15.28/4.98 }
15.28/4.98 return false;
15.28/4.98 }
15.28/4.98
15.28/4.98
15.28/4.98 // Bulk Operations
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 * This implementation iterates over the specified collection,
15.28/4.98 * checking each element returned by the iterator in turn to see
15.28/4.98 * if it's contained in this collection. If all elements are so
15.28/4.98 * contained true is returned, otherwise false.
15.28/4.98 *
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 * @see #contains(Object)
15.28/4.98 */
15.28/4.98 public boolean containsAll(Collection c) {
15.28/4.98 Iterator e = c.iterator();
15.28/4.98 while (e.hasNext())
15.28/4.98 if (!contains(e.next()))
15.28/4.98 return false;
15.28/4.98 return true;
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 *
This implementation iterates over the specified collection, and adds
15.28/4.98 * each object returned by the iterator to this collection, in turn.
15.28/4.98 *
15.28/4.98 *
Note that this implementation will throw an
15.28/4.98 * UnsupportedOperationException unless add is
15.28/4.98 * overridden (assuming the specified collection is non-empty).
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 * @throws IllegalArgumentException {@inheritDoc}
15.28/4.98 * @throws IllegalStateException {@inheritDoc}
15.28/4.98 *
15.28/4.98 * @see #add(Object)
15.28/4.98 */
15.28/4.98 public boolean addAll(Collection c) {
15.28/4.98 boolean modified = false;
15.28/4.98 Iterator e = c.iterator();
15.28/4.98 while (e.hasNext()) {
15.28/4.98 if (add(e.next()))
15.28/4.98 modified = true;
15.28/4.98 }
15.28/4.98 return modified;
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 *
This implementation iterates over this collection, checking each
15.28/4.98 * element returned by the iterator in turn to see if it's contained
15.28/4.98 * in the specified collection. If it's so contained, it's removed from
15.28/4.98 * this collection with the iterator's remove method.
15.28/4.98 *
15.28/4.98 *
Note that this implementation will throw an
15.28/4.98 * UnsupportedOperationException if the iterator returned by the
15.28/4.98 * iterator method does not implement the remove method
15.28/4.98 * and this collection contains one or more elements in common with the
15.28/4.98 * specified collection.
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 *
15.28/4.98 * @see #remove(Object)
15.28/4.98 * @see #contains(Object)
15.28/4.98 */
15.28/4.98 public boolean removeAll(Collection c) {
15.28/4.98 boolean modified = false;
15.28/4.98 Iterator e = iterator();
15.28/4.98 while (e.hasNext()) {
15.28/4.98 if (c.contains(e.next())) {
15.28/4.98 e.remove();
15.28/4.98 modified = true;
15.28/4.98 }
15.28/4.98 }
15.28/4.98 return modified;
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 *
This implementation iterates over this collection, checking each
15.28/4.98 * element returned by the iterator in turn to see if it's contained
15.28/4.98 * in the specified collection. If it's not so contained, it's removed
15.28/4.98 * from this collection with the iterator's remove method.
15.28/4.98 *
15.28/4.98 *
Note that this implementation will throw an
15.28/4.98 * UnsupportedOperationException if the iterator returned by the
15.28/4.98 * iterator method does not implement the remove method
15.28/4.98 * and this collection contains one or more elements not present in the
15.28/4.98 * specified collection.
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 * @throws ClassCastException {@inheritDoc}
15.28/4.98 * @throws NullPointerException {@inheritDoc}
15.28/4.98 *
15.28/4.98 * @see #remove(Object)
15.28/4.98 * @see #contains(Object)
15.28/4.98 */
15.28/4.98 public boolean retainAll(Collection c) {
15.28/4.98 boolean modified = false;
15.28/4.98 Iterator e = iterator();
15.28/4.98 while (e.hasNext()) {
15.28/4.98 if (!c.contains(e.next())) {
15.28/4.98 e.remove();
15.28/4.98 modified = true;
15.28/4.98 }
15.28/4.98 }
15.28/4.98 return modified;
15.28/4.98 }
15.28/4.98
15.28/4.98 /**
15.28/4.98 * {@inheritDoc}
15.28/4.98 *
15.28/4.98 * This implementation iterates over this collection, removing each
15.28/4.98 * element using the Iterator.remove operation. Most
15.28/4.98 * implementations will probably choose to override this method for
15.28/4.98 * efficiency.
15.28/4.98 *
15.28/4.98 *
Note that this implementation will throw an
15.28/4.98 * UnsupportedOperationException if the iterator returned by this
15.28/4.98 * collection's iterator method does not implement the
15.28/4.98 * remove method and this collection is non-empty.
15.28/4.98 *
15.28/4.98 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.98 */
15.28/4.98 public void clear() {
15.28/4.98 Iterator e = iterator();
15.28/4.98 while (e.hasNext()) {
15.28/4.98 e.next();
15.28/4.98 e.remove();
15.28/4.98 }
15.28/4.98 }
15.28/4.98
15.28/4.98
15.28/4.98 // String conversion
15.28/4.98
15.28/4.98 /**
15.28/4.98 * Returns a string representation of this collection. The string
15.28/4.98 * representation consists of a list of the collection's elements in the
15.28/4.98 * order they are returned by its iterator, enclosed in square brackets
15.28/4.98 * ("[]"). Adjacent elements are separated by the characters
15.28/4.98 * ", " (comma and space). Elements are converted to strings as
15.28/4.98 * by {@link String#valueOf(Object)}.
15.28/4.98 *
15.28/4.98 * @return a string representation of this collection
15.28/4.98 */
15.28/4.98 public String toString() {
15.28/4.98 Iterator i = iterator();
15.28/4.98 if (! i.hasNext())
15.28/4.98 return "[]";
15.28/4.98
15.28/4.98 String sb = "";
15.28/4.98 sb = sb + "[";
15.28/4.98 for (;;) {
15.28/4.98 E e = i.next();
15.28/4.98 sb = sb + (e == this ? "(this Collection)" : e);
15.28/4.98 if (! i.hasNext()) {
15.28/4.98 sb = sb + "]";
15.28/4.98 return sb;
15.28/4.98 }
15.28/4.98 sb = sb + ", ";
15.28/4.98 }
15.28/4.98 }
15.28/4.98
15.28/4.98 }
15.28/4.98
15.28/4.98
15.28/4.98 /*
15.28/4.98 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
15.28/4.98 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.28/4.98 *
15.28/4.98 * This code is free software; you can redistribute it and/or modify it
15.28/4.98 * under the terms of the GNU General Public License version 2 only, as
15.28/4.98 * published by the Free Software Foundation. Sun designates this
15.28/4.98 * particular file as subject to the "Classpath" exception as provided
15.28/4.98 * by Sun in the LICENSE file that accompanied this code.
15.28/4.98 *
15.28/4.98 * This code is distributed in the hope that it will be useful, but WITHOUT
15.28/4.98 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.28/4.98 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.28/4.98 * version 2 for more details (a copy is included in the LICENSE file that
15.28/4.98 * accompanied this code).
15.28/4.98 *
15.28/4.98 * You should have received a copy of the GNU General Public License version
15.28/4.98 * 2 along with this work; if not, write to the Free Software Foundation,
15.28/4.98 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.28/4.98 *
15.28/4.98 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.28/4.98 * CA 95054 USA or visit www.sun.com if you need additional information or
15.28/4.98 * have any questions.
15.28/4.98 */
15.28/4.98
15.28/4.98 package javaUtilEx;
15.28/4.98
15.28/4.98 /**
15.28/4.98 * This class provides a skeletal implementation of the {@link List}
15.28/4.98 * interface to minimize the effort required to implement this interface
15.28/4.98 * backed by a "random access" data store (such as an array). For sequential
15.28/4.98 * access data (such as a linked list), {@link AbstractSequentialList} should
15.28/4.98 * be used in preference to this class.
15.28/4.98 *
15.28/4.98 * To implement an unmodifiable list, the programmer needs only to extend
15.28/4.98 * this class and provide implementations for the {@link #get(int)} and
15.28/4.98 * {@link List#size() size()} methods.
15.28/4.98 *
15.28/4.98 *
To implement a modifiable list, the programmer must additionally
15.28/4.98 * override the {@link #set(int, Object) set(int, E)} method (which otherwise
15.28/4.98 * throws an {@code UnsupportedOperationException}). If the list is
15.28/4.98 * variable-size the programmer must additionally override the
15.28/4.98 * {@link #add(int, Object) add(int, E)} and {@link #remove(int)} methods.
15.28/4.98 *
15.28/4.98 *
The programmer should generally provide a void (no argument) and collection
15.28/4.99 * constructor, as per the recommendation in the {@link Collection} interface
15.28/4.99 * specification.
15.28/4.99 *
15.28/4.99 *
Unlike the other abstract collection implementations, the programmer does
15.28/4.99 * not have to provide an iterator implementation; the iterator and
15.28/4.99 * list iterator are implemented by this class, on top of the "random access"
15.28/4.99 * methods:
15.28/4.99 * {@link #get(int)},
15.28/4.99 * {@link #set(int, Object) set(int, E)},
15.28/4.99 * {@link #add(int, Object) add(int, E)} and
15.28/4.99 * {@link #remove(int)}.
15.28/4.99 *
15.28/4.99 *
The documentation for each non-abstract method in this class describes its
15.28/4.99 * implementation in detail. Each of these methods may be overridden if the
15.28/4.99 * collection being implemented admits a more efficient implementation.
15.28/4.99 *
15.28/4.99 *
This class is a member of the
15.28/4.99 *
15.28/4.99 * Java Collections Framework.
15.28/4.99 *
15.28/4.99 * @author Josh Bloch
15.28/4.99 * @author Neal Gafter
15.28/4.99 * @since 1.2
15.28/4.99 */
15.28/4.99
15.28/4.99 public abstract class AbstractList extends AbstractCollection implements List {
15.28/4.99 /**
15.28/4.99 * Sole constructor. (For invocation by subclass constructors, typically
15.28/4.99 * implicit.)
15.28/4.99 */
15.28/4.99 protected AbstractList() {
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Appends the specified element to the end of this list (optional
15.28/4.99 * operation).
15.28/4.99 *
15.28/4.99 * Lists that support this operation may place limitations on what
15.28/4.99 * elements may be added to this list. In particular, some
15.28/4.99 * lists will refuse to add null elements, and others will impose
15.28/4.99 * restrictions on the type of elements that may be added. List
15.28/4.99 * classes should clearly specify in their documentation any restrictions
15.28/4.99 * on what elements may be added.
15.28/4.99 *
15.28/4.99 *
This implementation calls {@code add(size(), e)}.
15.28/4.99 *
15.28/4.99 *
Note that this implementation throws an
15.28/4.99 * {@code UnsupportedOperationException} unless
15.28/4.99 * {@link #add(int, Object) add(int, E)} is overridden.
15.28/4.99 *
15.28/4.99 * @param e element to be appended to this list
15.28/4.99 * @return {@code true} (as specified by {@link Collection#add})
15.28/4.99 * @throws UnsupportedOperationException if the {@code add} operation
15.28/4.99 * is not supported by this list
15.28/4.99 * @throws ClassCastException if the class of the specified element
15.28/4.99 * prevents it from being added to this list
15.28/4.99 * @throws NullPointerException if the specified element is null and this
15.28/4.99 * list does not permit null elements
15.28/4.99 * @throws IllegalArgumentException if some property of this element
15.28/4.99 * prevents it from being added to this list
15.28/4.99 */
15.28/4.99 public boolean add(E e) {
15.28/4.99 add(size(), e);
15.28/4.99 return true;
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 abstract public E get(int index);
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 *
This implementation always throws an
15.28/4.99 * {@code UnsupportedOperationException}.
15.28/4.99 *
15.28/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.99 * @throws ClassCastException {@inheritDoc}
15.28/4.99 * @throws NullPointerException {@inheritDoc}
15.28/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public E set(int index, E element) {
15.28/4.99 throw new UnsupportedOperationException();
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 *
This implementation always throws an
15.28/4.99 * {@code UnsupportedOperationException}.
15.28/4.99 *
15.28/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.99 * @throws ClassCastException {@inheritDoc}
15.28/4.99 * @throws NullPointerException {@inheritDoc}
15.28/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public void add(int index, E element) {
15.28/4.99 throw new UnsupportedOperationException();
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 *
This implementation always throws an
15.28/4.99 * {@code UnsupportedOperationException}.
15.28/4.99 *
15.28/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public E remove(int index) {
15.28/4.99 throw new UnsupportedOperationException();
15.28/4.99 }
15.28/4.99
15.28/4.99
15.28/4.99 // Search Operations
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 *
This implementation first gets a list iterator (with
15.28/4.99 * {@code listIterator()}). Then, it iterates over the list until the
15.28/4.99 * specified element is found or the end of the list is reached.
15.28/4.99 *
15.28/4.99 * @throws ClassCastException {@inheritDoc}
15.28/4.99 * @throws NullPointerException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public int indexOf(Object o) {
15.28/4.99 ListIterator e = listIterator();
15.28/4.99 if (o==null) {
15.28/4.99 while (e.hasNext())
15.28/4.99 if (e.next()==null)
15.28/4.99 return e.previousIndex();
15.28/4.99 } else {
15.28/4.99 while (e.hasNext())
15.28/4.99 if (o.equals(e.next()))
15.28/4.99 return e.previousIndex();
15.28/4.99 }
15.28/4.99 return -1;
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 * This implementation first gets a list iterator that points to the end
15.28/4.99 * of the list (with {@code listIterator(size())}). Then, it iterates
15.28/4.99 * backwards over the list until the specified element is found, or the
15.28/4.99 * beginning of the list is reached.
15.28/4.99 *
15.28/4.99 * @throws ClassCastException {@inheritDoc}
15.28/4.99 * @throws NullPointerException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public int lastIndexOf(Object o) {
15.28/4.99 ListIterator e = listIterator(size());
15.28/4.99 if (o==null) {
15.28/4.99 while (e.hasPrevious())
15.28/4.99 if (e.previous()==null)
15.28/4.99 return e.nextIndex();
15.28/4.99 } else {
15.28/4.99 while (e.hasPrevious())
15.28/4.99 if (o.equals(e.previous()))
15.28/4.99 return e.nextIndex();
15.28/4.99 }
15.28/4.99 return -1;
15.28/4.99 }
15.28/4.99
15.28/4.99
15.28/4.99 // Bulk Operations
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Removes all of the elements from this list (optional operation).
15.28/4.99 * The list will be empty after this call returns.
15.28/4.99 *
15.28/4.99 * This implementation calls {@code removeRange(0, size())}.
15.28/4.99 *
15.28/4.99 *
Note that this implementation throws an
15.28/4.99 * {@code UnsupportedOperationException} unless {@code remove(int
15.28/4.99 * index)} or {@code removeRange(int fromIndex, int toIndex)} is
15.28/4.99 * overridden.
15.28/4.99 *
15.28/4.99 * @throws UnsupportedOperationException if the {@code clear} operation
15.28/4.99 * is not supported by this list
15.28/4.99 */
15.28/4.99 public void clear() {
15.28/4.99 removeRange(0, size());
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 *
This implementation gets an iterator over the specified collection
15.28/4.99 * and iterates over it, inserting the elements obtained from the
15.28/4.99 * iterator into this list at the appropriate position, one at a time,
15.28/4.99 * using {@code add(int, E)}.
15.28/4.99 * Many implementations will override this method for efficiency.
15.28/4.99 *
15.28/4.99 *
Note that this implementation throws an
15.28/4.99 * {@code UnsupportedOperationException} unless
15.28/4.99 * {@link #add(int, Object) add(int, E)} is overridden.
15.28/4.99 *
15.28/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.28/4.99 * @throws ClassCastException {@inheritDoc}
15.28/4.99 * @throws NullPointerException {@inheritDoc}
15.28/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public boolean addAll(int index, Collection c) {
15.28/4.99 rangeCheckForAdd(index);
15.28/4.99 boolean modified = false;
15.28/4.99 Iterator e = c.iterator();
15.28/4.99 while (e.hasNext()) {
15.28/4.99 add(index++, e.next());
15.28/4.99 modified = true;
15.28/4.99 }
15.28/4.99 return modified;
15.28/4.99 }
15.28/4.99
15.28/4.99
15.28/4.99 // Iterators
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Returns an iterator over the elements in this list in proper sequence.
15.28/4.99 *
15.28/4.99 *
This implementation returns a straightforward implementation of the
15.28/4.99 * iterator interface, relying on the backing list's {@code size()},
15.28/4.99 * {@code get(int)}, and {@code remove(int)} methods.
15.28/4.99 *
15.28/4.99 *
Note that the iterator returned by this method will throw an
15.28/4.99 * {@link UnsupportedOperationException} in response to its
15.28/4.99 * {@code remove} method unless the list's {@code remove(int)} method is
15.28/4.99 * overridden.
15.28/4.99 *
15.28/4.99 *
This implementation can be made to throw runtime exceptions in the
15.28/4.99 * face of concurrent modification, as described in the specification
15.28/4.99 * for the (protected) {@link #modCount} field.
15.28/4.99 *
15.28/4.99 * @return an iterator over the elements in this list in proper sequence
15.28/4.99 */
15.28/4.99 public Iterator iterator() {
15.28/4.99 return new Itr();
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 * This implementation returns {@code listIterator(0)}.
15.28/4.99 *
15.28/4.99 * @see #listIterator(int)
15.28/4.99 */
15.28/4.99 public ListIterator listIterator() {
15.28/4.99 return listIterator(0);
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 * This implementation returns a straightforward implementation of the
15.28/4.99 * {@code ListIterator} interface that extends the implementation of the
15.28/4.99 * {@code Iterator} interface returned by the {@code iterator()} method.
15.28/4.99 * The {@code ListIterator} implementation relies on the backing list's
15.28/4.99 * {@code get(int)}, {@code set(int, E)}, {@code add(int, E)}
15.28/4.99 * and {@code remove(int)} methods.
15.28/4.99 *
15.28/4.99 *
Note that the list iterator returned by this implementation will
15.28/4.99 * throw an {@link UnsupportedOperationException} in response to its
15.28/4.99 * {@code remove}, {@code set} and {@code add} methods unless the
15.28/4.99 * list's {@code remove(int)}, {@code set(int, E)}, and
15.28/4.99 * {@code add(int, E)} methods are overridden.
15.28/4.99 *
15.28/4.99 *
This implementation can be made to throw runtime exceptions in the
15.28/4.99 * face of concurrent modification, as described in the specification for
15.28/4.99 * the (protected) {@link #modCount} field.
15.28/4.99 *
15.28/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.28/4.99 */
15.28/4.99 public ListIterator listIterator(final int index) {
15.28/4.99 rangeCheckForAdd(index);
15.28/4.99
15.28/4.99 return new ListItr(index);
15.28/4.99 }
15.28/4.99
15.28/4.99 private class Itr implements Iterator {
15.28/4.99 /**
15.28/4.99 * Index of element to be returned by subsequent call to next.
15.28/4.99 */
15.28/4.99 int cursor = 0;
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Index of element returned by most recent call to next or
15.28/4.99 * previous. Reset to -1 if this element is deleted by a call
15.28/4.99 * to remove.
15.28/4.99 */
15.28/4.99 int lastRet = -1;
15.28/4.99
15.28/4.99 /**
15.28/4.99 * The modCount value that the iterator believes that the backing
15.28/4.99 * List should have. If this expectation is violated, the iterator
15.28/4.99 * has detected concurrent modification.
15.28/4.99 */
15.28/4.99 int expectedModCount = modCount;
15.28/4.99
15.28/4.99 public boolean hasNext() {
15.28/4.99 return cursor != size();
15.28/4.99 }
15.28/4.99
15.28/4.99 public E next() {
15.28/4.99 checkForComodification();
15.28/4.99 try {
15.28/4.99 int i = cursor;
15.28/4.99 E next = get(i);
15.28/4.99 lastRet = i;
15.28/4.99 cursor = i + 1;
15.28/4.99 return next;
15.28/4.99 } catch (IndexOutOfBoundsException e) {
15.28/4.99 checkForComodification();
15.28/4.99 throw new NoSuchElementException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 public void remove() {
15.28/4.99 if (lastRet < 0)
15.28/4.99 throw new IllegalStateException();
15.28/4.99 checkForComodification();
15.28/4.99
15.28/4.99 try {
15.28/4.99 AbstractList.this.remove(lastRet);
15.28/4.99 if (lastRet < cursor)
15.28/4.99 cursor--;
15.28/4.99 lastRet = -1;
15.28/4.99 expectedModCount = modCount;
15.28/4.99 } catch (IndexOutOfBoundsException e) {
15.28/4.99 throw new ConcurrentModificationException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 final void checkForComodification() {
15.28/4.99 if (modCount != expectedModCount)
15.28/4.99 throw new ConcurrentModificationException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 private class ListItr extends Itr implements ListIterator {
15.28/4.99 ListItr(int index) {
15.28/4.99 cursor = index;
15.28/4.99 }
15.28/4.99
15.28/4.99 public boolean hasPrevious() {
15.28/4.99 return cursor != 0;
15.28/4.99 }
15.28/4.99
15.28/4.99 public E previous() {
15.28/4.99 checkForComodification();
15.28/4.99 try {
15.28/4.99 int i = cursor - 1;
15.28/4.99 E previous = get(i);
15.28/4.99 lastRet = cursor = i;
15.28/4.99 return previous;
15.28/4.99 } catch (IndexOutOfBoundsException e) {
15.28/4.99 checkForComodification();
15.28/4.99 throw new NoSuchElementException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 public int nextIndex() {
15.28/4.99 return cursor;
15.28/4.99 }
15.28/4.99
15.28/4.99 public int previousIndex() {
15.28/4.99 return cursor-1;
15.28/4.99 }
15.28/4.99
15.28/4.99 public void set(E e) {
15.28/4.99 if (lastRet < 0)
15.28/4.99 throw new IllegalStateException();
15.28/4.99 checkForComodification();
15.28/4.99
15.28/4.99 try {
15.28/4.99 AbstractList.this.set(lastRet, e);
15.28/4.99 expectedModCount = modCount;
15.28/4.99 } catch (IndexOutOfBoundsException ex) {
15.28/4.99 throw new ConcurrentModificationException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 public void add(E e) {
15.28/4.99 checkForComodification();
15.28/4.99
15.28/4.99 try {
15.28/4.99 int i = cursor;
15.28/4.99 AbstractList.this.add(i, e);
15.28/4.99 lastRet = -1;
15.28/4.99 cursor = i + 1;
15.28/4.99 expectedModCount = modCount;
15.28/4.99 } catch (IndexOutOfBoundsException ex) {
15.28/4.99 throw new ConcurrentModificationException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * {@inheritDoc}
15.28/4.99 *
15.28/4.99 * This implementation returns a list that subclasses
15.28/4.99 * {@code AbstractList}. The subclass stores, in private fields, the
15.28/4.99 * offset of the subList within the backing list, the size of the subList
15.28/4.99 * (which can change over its lifetime), and the expected
15.28/4.99 * {@code modCount} value of the backing list. There are two variants
15.28/4.99 * of the subclass, one of which implements {@code RandomAccess}.
15.28/4.99 * If this list implements {@code RandomAccess} the returned list will
15.28/4.99 * be an instance of the subclass that implements {@code RandomAccess}.
15.28/4.99 *
15.28/4.99 *
The subclass's {@code set(int, E)}, {@code get(int)},
15.28/4.99 * {@code add(int, E)}, {@code remove(int)}, {@code addAll(int,
15.28/4.99 * Collection)} and {@code removeRange(int, int)} methods all
15.28/4.99 * delegate to the corresponding methods on the backing abstract list,
15.28/4.99 * after bounds-checking the index and adjusting for the offset. The
15.28/4.99 * {@code addAll(Collection c)} method merely returns {@code addAll(size,
15.28/4.99 * c)}.
15.28/4.99 *
15.28/4.99 *
The {@code listIterator(int)} method returns a "wrapper object"
15.28/4.99 * over a list iterator on the backing list, which is created with the
15.28/4.99 * corresponding method on the backing list. The {@code iterator} method
15.28/4.99 * merely returns {@code listIterator()}, and the {@code size} method
15.28/4.99 * merely returns the subclass's {@code size} field.
15.28/4.99 *
15.28/4.99 *
All methods first check to see if the actual {@code modCount} of
15.28/4.99 * the backing list is equal to its expected value, and throw a
15.28/4.99 * {@code ConcurrentModificationException} if it is not.
15.28/4.99 *
15.28/4.99 * @throws IndexOutOfBoundsException if an endpoint index value is out of range
15.28/4.99 * {@code (fromIndex < 0 || toIndex > size)}
15.28/4.99 * @throws IllegalArgumentException if the endpoint indices are out of order
15.28/4.99 * {@code (fromIndex > toIndex)}
15.28/4.99 */
15.28/4.99 public List subList(int fromIndex, int toIndex) {
15.28/4.99 return (this instanceof RandomAccess ?
15.28/4.99 new RandomAccessSubList(this, fromIndex, toIndex) :
15.28/4.99 new SubList(this, fromIndex, toIndex));
15.28/4.99 }
15.28/4.99
15.28/4.99 // Comparison and hashing
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Compares the specified object with this list for equality. Returns
15.28/4.99 * {@code true} if and only if the specified object is also a list, both
15.28/4.99 * lists have the same size, and all corresponding pairs of elements in
15.28/4.99 * the two lists are equal. (Two elements {@code e1} and
15.28/4.99 * {@code e2} are equal if {@code (e1==null ? e2==null :
15.28/4.99 * e1.equals(e2))}.) In other words, two lists are defined to be
15.28/4.99 * equal if they contain the same elements in the same order.
15.28/4.99 *
15.28/4.99 * This implementation first checks if the specified object is this
15.28/4.99 * list. If so, it returns {@code true}; if not, it checks if the
15.28/4.99 * specified object is a list. If not, it returns {@code false}; if so,
15.28/4.99 * it iterates over both lists, comparing corresponding pairs of elements.
15.28/4.99 * If any comparison returns {@code false}, this method returns
15.28/4.99 * {@code false}. If either iterator runs out of elements before the
15.28/4.99 * other it returns {@code false} (as the lists are of unequal length);
15.28/4.99 * otherwise it returns {@code true} when the iterations complete.
15.28/4.99 *
15.28/4.99 * @param o the object to be compared for equality with this list
15.28/4.99 * @return {@code true} if the specified object is equal to this list
15.28/4.99 */
15.28/4.99 public boolean equals(Object o) {
15.28/4.99 if (o == this)
15.28/4.99 return true;
15.28/4.99 if (!(o instanceof List))
15.28/4.99 return false;
15.28/4.99
15.28/4.99 ListIterator e1 = listIterator();
15.28/4.99 ListIterator e2 = ((List) o).listIterator();
15.28/4.99 while(e1.hasNext() && e2.hasNext()) {
15.28/4.99 E o1 = e1.next();
15.28/4.99 Object o2 = e2.next();
15.28/4.99 if (!(o1==null ? o2==null : o1.equals(o2)))
15.28/4.99 return false;
15.28/4.99 }
15.28/4.99 return !(e1.hasNext() || e2.hasNext());
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Returns the hash code value for this list.
15.28/4.99 *
15.28/4.99 * This implementation uses exactly the code that is used to define the
15.28/4.99 * list hash function in the documentation for the {@link List#hashCode}
15.28/4.99 * method.
15.28/4.99 *
15.28/4.99 * @return the hash code value for this list
15.28/4.99 */
15.28/4.99 public int hashCode() {
15.28/4.99 int hashCode = 1;
15.28/4.99 Iterator it = this.iterator();
15.28/4.99 while (it.hasNext()) {
15.28/4.99 E e = it.next();
15.28/4.99 hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());
15.28/4.99 }
15.28/4.99 return hashCode;
15.28/4.99 }
15.28/4.99
15.28/4.99 /**
15.28/4.99 * Removes from this list all of the elements whose index is between
15.28/4.99 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
15.28/4.99 * Shifts any succeeding elements to the left (reduces their index).
15.28/4.99 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
15.28/4.99 * (If {@code toIndex==fromIndex}, this operation has no effect.)
15.28/4.99 *
15.28/4.99 * This method is called by the {@code clear} operation on this list
15.28/4.99 * and its subLists. Overriding this method to take advantage of
15.28/4.99 * the internals of the list implementation can substantially
15.28/4.99 * improve the performance of the {@code clear} operation on this list
15.28/4.99 * and its subLists.
15.28/4.99 *
15.28/4.99 *
This implementation gets a list iterator positioned before
15.28/4.99 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
15.28/4.99 * followed by {@code ListIterator.remove} until the entire range has
15.28/4.99 * been removed. Note: if {@code ListIterator.remove} requires linear
15.28/4.99 * time, this implementation requires quadratic time.
15.28/4.99 *
15.28/4.99 * @param fromIndex index of first element to be removed
15.28/4.99 * @param toIndex index after last element to be removed
15.28/4.99 */
15.28/4.99 protected void removeRange(int fromIndex, int toIndex) {
15.28/4.99 ListIterator it = listIterator(fromIndex);
15.28/4.99 for (int i=0, n=toIndex-fromIndex; istructurally modified.
15.28/4.99 * Structural modifications are those that change the size of the
15.28/4.99 * list, or otherwise perturb it in such a fashion that iterations in
15.28/4.99 * progress may yield incorrect results.
15.28/4.99 *
15.28/4.99 * This field is used by the iterator and list iterator implementation
15.28/4.99 * returned by the {@code iterator} and {@code listIterator} methods.
15.28/4.99 * If the value of this field changes unexpectedly, the iterator (or list
15.28/4.99 * iterator) will throw a {@code ConcurrentModificationException} in
15.28/4.99 * response to the {@code next}, {@code remove}, {@code previous},
15.28/4.99 * {@code set} or {@code add} operations. This provides
15.28/4.99 * fail-fast behavior, rather than non-deterministic behavior in
15.28/4.99 * the face of concurrent modification during iteration.
15.28/4.99 *
15.28/4.99 *
Use of this field by subclasses is optional. If a subclass
15.28/4.99 * wishes to provide fail-fast iterators (and list iterators), then it
15.28/4.99 * merely has to increment this field in its {@code add(int, E)} and
15.28/4.99 * {@code remove(int)} methods (and any other methods that it overrides
15.28/4.99 * that result in structural modifications to the list). A single call to
15.28/4.99 * {@code add(int, E)} or {@code remove(int)} must add no more than
15.28/4.99 * one to this field, or the iterators (and list iterators) will throw
15.28/4.99 * bogus {@code ConcurrentModificationExceptions}. If an implementation
15.28/4.99 * does not wish to provide fail-fast iterators, this field may be
15.28/4.99 * ignored.
15.28/4.99 */
15.28/4.99 protected transient int modCount = 0;
15.28/4.99
15.28/4.99 private void rangeCheckForAdd(int index) {
15.28/4.99 if (index < 0 || index > size())
15.28/4.99 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.28/4.99 }
15.28/4.99
15.28/4.99 private String outOfBoundsMsg(int index) {
15.28/4.99 return "";
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 class SubList extends AbstractList {
15.28/4.99 private final AbstractList l;
15.28/4.99 private final int offset;
15.28/4.99 private int size;
15.28/4.99
15.28/4.99 SubList(AbstractList list, int fromIndex, int toIndex) {
15.28/4.99 if (fromIndex < 0)
15.28/4.99 throw new IndexOutOfBoundsException();
15.28/4.99 if (toIndex > list.size())
15.28/4.99 throw new IndexOutOfBoundsException();
15.28/4.99 if (fromIndex > toIndex)
15.28/4.99 throw new IllegalArgumentException();
15.28/4.99 l = list;
15.28/4.99 offset = fromIndex;
15.28/4.99 size = toIndex - fromIndex;
15.28/4.99 this.modCount = l.modCount;
15.28/4.99 }
15.28/4.99
15.28/4.99 public E set(int index, E element) {
15.28/4.99 rangeCheck(index);
15.28/4.99 checkForComodification();
15.28/4.99 return l.set(index+offset, element);
15.28/4.99 }
15.28/4.99
15.28/4.99 public E get(int index) {
15.28/4.99 rangeCheck(index);
15.28/4.99 checkForComodification();
15.28/4.99 return l.get(index+offset);
15.28/4.99 }
15.28/4.99
15.28/4.99 public int size() {
15.28/4.99 checkForComodification();
15.28/4.99 return size;
15.28/4.99 }
15.28/4.99
15.28/4.99 public void add(int index, E element) {
15.28/4.99 rangeCheckForAdd(index);
15.28/4.99 checkForComodification();
15.28/4.99 l.add(index+offset, element);
15.28/4.99 this.modCount = l.modCount;
15.28/4.99 size++;
15.28/4.99 }
15.28/4.99
15.28/4.99 public E remove(int index) {
15.28/4.99 rangeCheck(index);
15.28/4.99 checkForComodification();
15.28/4.99 E result = l.remove(index+offset);
15.28/4.99 this.modCount = l.modCount;
15.28/4.99 size--;
15.28/4.99 return result;
15.28/4.99 }
15.28/4.99
15.28/4.99 protected void removeRange(int fromIndex, int toIndex) {
15.28/4.99 checkForComodification();
15.28/4.99 l.removeRange(fromIndex+offset, toIndex+offset);
15.28/4.99 this.modCount = l.modCount;
15.28/4.99 size -= (toIndex-fromIndex);
15.28/4.99 }
15.28/4.99
15.28/4.99 public boolean addAll(Collection c) {
15.28/4.99 return addAll(size, c);
15.28/4.99 }
15.28/4.99
15.28/4.99 public boolean addAll(int index, Collection c) {
15.28/4.99 rangeCheckForAdd(index);
15.28/4.99 int cSize = c.size();
15.28/4.99 if (cSize==0)
15.28/4.99 return false;
15.28/4.99
15.28/4.99 checkForComodification();
15.28/4.99 l.addAll(offset+index, c);
15.28/4.99 this.modCount = l.modCount;
15.28/4.99 size += cSize;
15.28/4.99 return true;
15.28/4.99 }
15.28/4.99
15.28/4.99 public Iterator iterator() {
15.28/4.99 return listIterator();
15.28/4.99 }
15.28/4.99
15.28/4.99 public ListIterator listIterator(final int index) {
15.28/4.99 checkForComodification();
15.28/4.99 rangeCheckForAdd(index);
15.28/4.99
15.28/4.99 return new ListIterator() {
15.28/4.99 private final ListIterator i = l.listIterator(index+offset);
15.28/4.99
15.28/4.99 public boolean hasNext() {
15.28/4.99 return nextIndex() < size;
15.28/4.99 }
15.28/4.99
15.28/4.99 public E next() {
15.28/4.99 if (hasNext())
15.28/4.99 return i.next();
15.28/4.99 else
15.28/4.99 throw new NoSuchElementException();
15.28/4.99 }
15.28/4.99
15.28/4.99 public boolean hasPrevious() {
15.28/4.99 return previousIndex() >= 0;
15.28/4.99 }
15.28/4.99
15.28/4.99 public E previous() {
15.28/4.99 if (hasPrevious())
15.28/4.99 return i.previous();
15.28/4.99 else
15.28/4.99 throw new NoSuchElementException();
15.28/4.99 }
15.28/4.99
15.28/4.99 public int nextIndex() {
15.28/4.99 return i.nextIndex() - offset;
15.28/4.99 }
15.28/4.99
15.28/4.99 public int previousIndex() {
15.28/4.99 return i.previousIndex() - offset;
15.28/4.99 }
15.28/4.99
15.28/4.99 public void remove() {
15.28/4.99 i.remove();
15.28/4.99 SubList.this.modCount = l.modCount;
15.28/4.99 size--;
15.28/4.99 }
15.28/4.99
15.28/4.99 public void set(E e) {
15.28/4.99 i.set(e);
15.28/4.99 }
15.28/4.99
15.28/4.99 public void add(E e) {
15.28/4.99 i.add(e);
15.28/4.99 SubList.this.modCount = l.modCount;
15.28/4.99 size++;
15.28/4.99 }
15.28/4.99 };
15.28/4.99 }
15.28/4.99
15.28/4.99 public List subList(int fromIndex, int toIndex) {
15.28/4.99 return new SubList(this, fromIndex, toIndex);
15.28/4.99 }
15.28/4.99
15.28/4.99 private void rangeCheck(int index) {
15.28/4.99 if (index < 0 || index >= size)
15.28/4.99 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.28/4.99 }
15.28/4.99
15.28/4.99 private void rangeCheckForAdd(int index) {
15.28/4.99 if (index < 0 || index > size)
15.28/4.99 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.28/4.99 }
15.28/4.99
15.28/4.99 private String outOfBoundsMsg(int index) {
15.28/4.99 return "";
15.28/4.99 }
15.28/4.99
15.28/4.99 private void checkForComodification() {
15.28/4.99 if (this.modCount != l.modCount)
15.28/4.99 throw new ConcurrentModificationException();
15.28/4.99 }
15.28/4.99 }
15.28/4.99
15.28/4.99 class RandomAccessSubList extends SubList implements RandomAccess {
15.28/4.99 RandomAccessSubList(AbstractList list, int fromIndex, int toIndex) {
15.28/4.99 super(list, fromIndex, toIndex);
15.28/4.99 }
15.28/4.99
15.28/4.99 public List subList(int fromIndex, int toIndex) {
15.47/4.99 return new RandomAccessSubList(this, fromIndex, toIndex);
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 /*
15.47/4.99 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/4.99 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/4.99 *
15.47/4.99 * This code is free software; you can redistribute it and/or modify it
15.47/4.99 * under the terms of the GNU General Public License version 2 only, as
15.47/4.99 * published by the Free Software Foundation. Sun designates this
15.47/4.99 * particular file as subject to the "Classpath" exception as provided
15.47/4.99 * by Sun in the LICENSE file that accompanied this code.
15.47/4.99 *
15.47/4.99 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/4.99 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/4.99 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/4.99 * version 2 for more details (a copy is included in the LICENSE file that
15.47/4.99 * accompanied this code).
15.47/4.99 *
15.47/4.99 * You should have received a copy of the GNU General Public License version
15.47/4.99 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/4.99 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/4.99 *
15.47/4.99 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/4.99 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/4.99 * have any questions.
15.47/4.99 */
15.47/4.99
15.47/4.99 package javaUtilEx;
15.47/4.99
15.47/4.99 /**
15.47/4.99 * This class provides a skeletal implementation of the List
15.47/4.99 * interface to minimize the effort required to implement this interface
15.47/4.99 * backed by a "sequential access" data store (such as a linked list). For
15.47/4.99 * random access data (such as an array), AbstractList should be used
15.47/4.99 * in preference to this class.
15.47/4.99 *
15.47/4.99 * This class is the opposite of the AbstractList class in the sense
15.47/4.99 * that it implements the "random access" methods (get(int index),
15.47/4.99 * set(int index, E element), add(int index, E element) and
15.47/4.99 * remove(int index)) on top of the list's list iterator, instead of
15.47/4.99 * the other way around.
15.47/4.99 *
15.47/4.99 * To implement a list the programmer needs only to extend this class and
15.47/4.99 * provide implementations for the listIterator and size
15.47/4.99 * methods. For an unmodifiable list, the programmer need only implement the
15.47/4.99 * list iterator's hasNext, next, hasPrevious,
15.47/4.99 * previous and index methods.
15.47/4.99 *
15.47/4.99 * For a modifiable list the programmer should additionally implement the list
15.47/4.99 * iterator's set method. For a variable-size list the programmer
15.47/4.99 * should additionally implement the list iterator's remove and
15.47/4.99 * add methods.
15.47/4.99 *
15.47/4.99 * The programmer should generally provide a void (no argument) and collection
15.47/4.99 * constructor, as per the recommendation in the Collection interface
15.47/4.99 * specification.
15.47/4.99 *
15.47/4.99 * This class is a member of the
15.47/4.99 *
15.47/4.99 * Java Collections Framework.
15.47/4.99 *
15.47/4.99 * @author Josh Bloch
15.47/4.99 * @author Neal Gafter
15.47/4.99 * @see Collection
15.47/4.99 * @see List
15.47/4.99 * @see AbstractList
15.47/4.99 * @see AbstractCollection
15.47/4.99 * @since 1.2
15.47/4.99 */
15.47/4.99
15.47/4.99 public abstract class AbstractSequentialList extends AbstractList {
15.47/4.99 /**
15.47/4.99 * Sole constructor. (For invocation by subclass constructors, typically
15.47/4.99 * implicit.)
15.47/4.99 */
15.47/4.99 protected AbstractSequentialList() {
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns the element at the specified position in this list.
15.47/4.99 *
15.47/4.99 * This implementation first gets a list iterator pointing to the
15.47/4.99 * indexed element (with listIterator(index)). Then, it gets
15.47/4.99 * the element using ListIterator.next and returns it.
15.47/4.99 *
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public E get(int index) {
15.47/4.99 try {
15.47/4.99 return listIterator(index).next();
15.47/4.99 } catch (NoSuchElementException exc) {
15.47/4.99 throw new IndexOutOfBoundsException();
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Replaces the element at the specified position in this list with the
15.47/4.99 * specified element (optional operation).
15.47/4.99 *
15.47/4.99 *
This implementation first gets a list iterator pointing to the
15.47/4.99 * indexed element (with listIterator(index)). Then, it gets
15.47/4.99 * the current element using ListIterator.next and replaces it
15.47/4.99 * with ListIterator.set.
15.47/4.99 *
15.47/4.99 *
Note that this implementation will throw an
15.47/4.99 * UnsupportedOperationException if the list iterator does not
15.47/4.99 * implement the set operation.
15.47/4.99 *
15.47/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.47/4.99 * @throws ClassCastException {@inheritDoc}
15.47/4.99 * @throws NullPointerException {@inheritDoc}
15.47/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public E set(int index, E element) {
15.47/4.99 try {
15.47/4.99 ListIterator e = listIterator(index);
15.47/4.99 E oldVal = e.next();
15.47/4.99 e.set(element);
15.47/4.99 return oldVal;
15.47/4.99 } catch (NoSuchElementException exc) {
15.47/4.99 throw new IndexOutOfBoundsException();
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element at the specified position in this list
15.47/4.99 * (optional operation). Shifts the element currently at that position
15.47/4.99 * (if any) and any subsequent elements to the right (adds one to their
15.47/4.99 * indices).
15.47/4.99 *
15.47/4.99 * This implementation first gets a list iterator pointing to the
15.47/4.99 * indexed element (with listIterator(index)). Then, it
15.47/4.99 * inserts the specified element with ListIterator.add.
15.47/4.99 *
15.47/4.99 *
Note that this implementation will throw an
15.47/4.99 * UnsupportedOperationException if the list iterator does not
15.47/4.99 * implement the add operation.
15.47/4.99 *
15.47/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.47/4.99 * @throws ClassCastException {@inheritDoc}
15.47/4.99 * @throws NullPointerException {@inheritDoc}
15.47/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public void add(int index, E element) {
15.47/4.99 try {
15.47/4.99 listIterator(index).add(element);
15.47/4.99 } catch (NoSuchElementException exc) {
15.47/4.99 throw new IndexOutOfBoundsException();
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes the element at the specified position in this list (optional
15.47/4.99 * operation). Shifts any subsequent elements to the left (subtracts one
15.47/4.99 * from their indices). Returns the element that was removed from the
15.47/4.99 * list.
15.47/4.99 *
15.47/4.99 *
This implementation first gets a list iterator pointing to the
15.47/4.99 * indexed element (with listIterator(index)). Then, it removes
15.47/4.99 * the element with ListIterator.remove.
15.47/4.99 *
15.47/4.99 *
Note that this implementation will throw an
15.47/4.99 * UnsupportedOperationException if the list iterator does not
15.47/4.99 * implement the remove operation.
15.47/4.99 *
15.47/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public E remove(int index) {
15.47/4.99 try {
15.47/4.99 ListIterator e = listIterator(index);
15.47/4.99 E outCast = e.next();
15.47/4.99 e.remove();
15.47/4.99 return outCast;
15.47/4.99 } catch (NoSuchElementException exc) {
15.47/4.99 throw new IndexOutOfBoundsException();
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 // Bulk Operations
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts all of the elements in the specified collection into this
15.47/4.99 * list at the specified position (optional operation). Shifts the
15.47/4.99 * element currently at that position (if any) and any subsequent
15.47/4.99 * elements to the right (increases their indices). The new elements
15.47/4.99 * will appear in this list in the order that they are returned by the
15.47/4.99 * specified collection's iterator. The behavior of this operation is
15.47/4.99 * undefined if the specified collection is modified while the
15.47/4.99 * operation is in progress. (Note that this will occur if the specified
15.47/4.99 * collection is this list, and it's nonempty.)
15.47/4.99 *
15.47/4.99 * This implementation gets an iterator over the specified collection and
15.47/4.99 * a list iterator over this list pointing to the indexed element (with
15.47/4.99 * listIterator(index)). Then, it iterates over the specified
15.47/4.99 * collection, inserting the elements obtained from the iterator into this
15.47/4.99 * list, one at a time, using ListIterator.add followed by
15.47/4.99 * ListIterator.next (to skip over the added element).
15.47/4.99 *
15.47/4.99 *
Note that this implementation will throw an
15.47/4.99 * UnsupportedOperationException if the list iterator returned by
15.47/4.99 * the listIterator method does not implement the add
15.47/4.99 * operation.
15.47/4.99 *
15.47/4.99 * @throws UnsupportedOperationException {@inheritDoc}
15.47/4.99 * @throws ClassCastException {@inheritDoc}
15.47/4.99 * @throws NullPointerException {@inheritDoc}
15.47/4.99 * @throws IllegalArgumentException {@inheritDoc}
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public boolean addAll(int index, Collection c) {
15.47/4.99 try {
15.47/4.99 boolean modified = false;
15.47/4.99 ListIterator e1 = listIterator(index);
15.47/4.99 Iterator e2 = c.iterator();
15.47/4.99 while (e2.hasNext()) {
15.47/4.99 e1.add(e2.next());
15.47/4.99 modified = true;
15.47/4.99 }
15.47/4.99 return modified;
15.47/4.99 } catch (NoSuchElementException exc) {
15.47/4.99 throw new IndexOutOfBoundsException();
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 // Iterators
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns an iterator over the elements in this list (in proper
15.47/4.99 * sequence).
15.47/4.99 *
15.47/4.99 * This implementation merely returns a list iterator over the list.
15.47/4.99 *
15.47/4.99 * @return an iterator over the elements in this list (in proper sequence)
15.47/4.99 */
15.47/4.99 public Iterator iterator() {
15.47/4.99 return listIterator();
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns a list iterator over the elements in this list (in proper
15.47/4.99 * sequence).
15.47/4.99 *
15.47/4.99 * @param index index of first element to be returned from the list
15.47/4.99 * iterator (by a call to the next method)
15.47/4.99 * @return a list iterator over the elements in this list (in proper
15.47/4.99 * sequence)
15.47/4.99 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/4.99 */
15.47/4.99 public abstract ListIterator listIterator(int index);
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 /*
15.47/4.99 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/4.99 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/4.99 *
15.47/4.99 * This code is free software; you can redistribute it and/or modify it
15.47/4.99 * under the terms of the GNU General Public License version 2 only, as
15.47/4.99 * published by the Free Software Foundation. Sun designates this
15.47/4.99 * particular file as subject to the "Classpath" exception as provided
15.47/4.99 * by Sun in the LICENSE file that accompanied this code.
15.47/4.99 *
15.47/4.99 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/4.99 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/4.99 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/4.99 * version 2 for more details (a copy is included in the LICENSE file that
15.47/4.99 * accompanied this code).
15.47/4.99 *
15.47/4.99 * You should have received a copy of the GNU General Public License version
15.47/4.99 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/4.99 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/4.99 *
15.47/4.99 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/4.99 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/4.99 * have any questions.
15.47/4.99 */
15.47/4.99
15.47/4.99 package javaUtilEx;
15.47/4.99
15.47/4.99 /**
15.47/4.99 * The root interface in the collection hierarchy. A collection
15.47/4.99 * represents a group of objects, known as its elements. Some
15.47/4.99 * collections allow duplicate elements and others do not. Some are ordered
15.47/4.99 * and others unordered. The JDK does not provide any direct
15.47/4.99 * implementations of this interface: it provides implementations of more
15.47/4.99 * specific subinterfaces like Set and List. This interface
15.47/4.99 * is typically used to pass collections around and manipulate them where
15.47/4.99 * maximum generality is desired.
15.47/4.99 *
15.47/4.99 * Bags or multisets (unordered collections that may contain
15.47/4.99 * duplicate elements) should implement this interface directly.
15.47/4.99 *
15.47/4.99 *
All general-purpose Collection implementation classes (which
15.47/4.99 * typically implement Collection indirectly through one of its
15.47/4.99 * subinterfaces) should provide two "standard" constructors: a void (no
15.47/4.99 * arguments) constructor, which creates an empty collection, and a
15.47/4.99 * constructor with a single argument of type Collection, which
15.47/4.99 * creates a new collection with the same elements as its argument. In
15.47/4.99 * effect, the latter constructor allows the user to copy any collection,
15.47/4.99 * producing an equivalent collection of the desired implementation type.
15.47/4.99 * There is no way to enforce this convention (as interfaces cannot contain
15.47/4.99 * constructors) but all of the general-purpose Collection
15.47/4.99 * implementations in the Java platform libraries comply.
15.47/4.99 *
15.47/4.99 *
The "destructive" methods contained in this interface, that is, the
15.47/4.99 * methods that modify the collection on which they operate, are specified to
15.47/4.99 * throw UnsupportedOperationException if this collection does not
15.47/4.99 * support the operation. If this is the case, these methods may, but are not
15.47/4.99 * required to, throw an UnsupportedOperationException if the
15.47/4.99 * invocation would have no effect on the collection. For example, invoking
15.47/4.99 * the {@link #addAll(Collection)} method on an unmodifiable collection may,
15.47/4.99 * but is not required to, throw the exception if the collection to be added
15.47/4.99 * is empty.
15.47/4.99 *
15.47/4.99 *
Some collection implementations have restrictions on the elements that
15.47/4.99 * they may contain. For example, some implementations prohibit null elements,
15.47/4.99 * and some have restrictions on the types of their elements. Attempting to
15.47/4.99 * add an ineligible element throws an unchecked exception, typically
15.47/4.99 * NullPointerException or ClassCastException. Attempting
15.47/4.99 * to query the presence of an ineligible element may throw an exception,
15.47/4.99 * or it may simply return false; some implementations will exhibit the former
15.47/4.99 * behavior and some will exhibit the latter. More generally, attempting an
15.47/4.99 * operation on an ineligible element whose completion would not result in
15.47/4.99 * the insertion of an ineligible element into the collection may throw an
15.47/4.99 * exception or it may succeed, at the option of the implementation.
15.47/4.99 * Such exceptions are marked as "optional" in the specification for this
15.47/4.99 * interface.
15.47/4.99 *
15.47/4.99 *
It is up to each collection to determine its own synchronization
15.47/4.99 * policy. In the absence of a stronger guarantee by the
15.47/4.99 * implementation, undefined behavior may result from the invocation
15.47/4.99 * of any method on a collection that is being mutated by another
15.47/4.99 * thread; this includes direct invocations, passing the collection to
15.47/4.99 * a method that might perform invocations, and using an existing
15.47/4.99 * iterator to examine the collection.
15.47/4.99 *
15.47/4.99 *
Many methods in Collections Framework interfaces are defined in
15.47/4.99 * terms of the {@link Object#equals(Object) equals} method. For example,
15.47/4.99 * the specification for the {@link #contains(Object) contains(Object o)}
15.47/4.99 * method says: "returns true if and only if this collection
15.47/4.99 * contains at least one element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e))." This specification should
15.47/4.99 * not be construed to imply that invoking Collection.contains
15.47/4.99 * with a non-null argument o will cause o.equals(e) to be
15.47/4.99 * invoked for any element e. Implementations are free to implement
15.47/4.99 * optimizations whereby the equals invocation is avoided, for
15.47/4.99 * example, by first comparing the hash codes of the two elements. (The
15.47/4.99 * {@link Object#hashCode()} specification guarantees that two objects with
15.47/4.99 * unequal hash codes cannot be equal.) More generally, implementations of
15.47/4.99 * the various Collections Framework interfaces are free to take advantage of
15.47/4.99 * the specified behavior of underlying {@link Object} methods wherever the
15.47/4.99 * implementor deems it appropriate.
15.47/4.99 *
15.47/4.99 *
This interface is a member of the
15.47/4.99 *
15.47/4.99 * Java Collections Framework.
15.47/4.99 *
15.47/4.99 * @author Josh Bloch
15.47/4.99 * @author Neal Gafter
15.47/4.99 * @see Set
15.47/4.99 * @see List
15.47/4.99 * @see Map
15.47/4.99 * @see SortedSet
15.47/4.99 * @see SortedMap
15.47/4.99 * @see HashSet
15.47/4.99 * @see TreeSet
15.47/4.99 * @see ArrayList
15.47/4.99 * @see LinkedList
15.47/4.99 * @see Vector
15.47/4.99 * @see Collections
15.47/4.99 * @see Arrays
15.47/4.99 * @see AbstractCollection
15.47/4.99 * @since 1.2
15.47/4.99 */
15.47/4.99
15.47/4.99 public interface Collection {
15.47/4.99 // Query Operations
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns the number of elements in this collection. If this collection
15.47/4.99 * contains more than Integer.MAX_VALUE elements, returns
15.47/4.99 * Integer.MAX_VALUE.
15.47/4.99 *
15.47/4.99 * @return the number of elements in this collection
15.47/4.99 */
15.47/4.99 int size();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns true if this collection contains no elements.
15.47/4.99 *
15.47/4.99 * @return true if this collection contains no elements
15.47/4.99 */
15.47/4.99 boolean isEmpty();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns true if this collection contains the specified element.
15.47/4.99 * More formally, returns true if and only if this collection
15.47/4.99 * contains at least one element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e)).
15.47/4.99 *
15.47/4.99 * @param o element whose presence in this collection is to be tested
15.47/4.99 * @return true if this collection contains the specified
15.47/4.99 * element
15.47/4.99 * @throws ClassCastException if the type of the specified element
15.47/4.99 * is incompatible with this collection (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * collection does not permit null elements (optional)
15.47/4.99 */
15.47/4.99 boolean contains(Object o);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns an iterator over the elements in this collection. There are no
15.47/4.99 * guarantees concerning the order in which the elements are returned
15.47/4.99 * (unless this collection is an instance of some class that provides a
15.47/4.99 * guarantee).
15.47/4.99 *
15.47/4.99 * @return an Iterator over the elements in this collection
15.47/4.99 */
15.47/4.99 Iterator iterator();
15.47/4.99
15.47/4.99 // Modification Operations
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Ensures that this collection contains the specified element (optional
15.47/4.99 * operation). Returns true if this collection changed as a
15.47/4.99 * result of the call. (Returns false if this collection does
15.47/4.99 * not permit duplicates and already contains the specified element.)
15.47/4.99 *
15.47/4.99 * Collections that support this operation may place limitations on what
15.47/4.99 * elements may be added to this collection. In particular, some
15.47/4.99 * collections will refuse to add null elements, and others will
15.47/4.99 * impose restrictions on the type of elements that may be added.
15.47/4.99 * Collection classes should clearly specify in their documentation any
15.47/4.99 * restrictions on what elements may be added.
15.47/4.99 *
15.47/4.99 * If a collection refuses to add a particular element for any reason
15.47/4.99 * other than that it already contains the element, it must throw
15.47/4.99 * an exception (rather than returning false). This preserves
15.47/4.99 * the invariant that a collection always contains the specified element
15.47/4.99 * after this call returns.
15.47/4.99 *
15.47/4.99 * @param e element whose presence in this collection is to be ensured
15.47/4.99 * @return true if this collection changed as a result of the
15.47/4.99 * call
15.47/4.99 * @throws UnsupportedOperationException if the add operation
15.47/4.99 * is not supported by this collection
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this collection
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * collection does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the element
15.47/4.99 * prevents it from being added to this collection
15.47/4.99 * @throws IllegalStateException if the element cannot be added at this
15.47/4.99 * time due to insertion restrictions
15.47/4.99 */
15.47/4.99 boolean add(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes a single instance of the specified element from this
15.47/4.99 * collection, if it is present (optional operation). More formally,
15.47/4.99 * removes an element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e)), if
15.47/4.99 * this collection contains one or more such elements. Returns
15.47/4.99 * true if this collection contained the specified element (or
15.47/4.99 * equivalently, if this collection changed as a result of the call).
15.47/4.99 *
15.47/4.99 * @param o element to be removed from this collection, if present
15.47/4.99 * @return true if an element was removed as a result of this call
15.47/4.99 * @throws ClassCastException if the type of the specified element
15.47/4.99 * is incompatible with this collection (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * collection does not permit null elements (optional)
15.47/4.99 * @throws UnsupportedOperationException if the remove operation
15.47/4.99 * is not supported by this collection
15.47/4.99 */
15.47/4.99 boolean remove(Object o);
15.47/4.99
15.47/4.99
15.47/4.99 // Bulk Operations
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns true if this collection contains all of the elements
15.47/4.99 * in the specified collection.
15.47/4.99 *
15.47/4.99 * @param c collection to be checked for containment in this collection
15.47/4.99 * @return true if this collection contains all of the elements
15.47/4.99 * in the specified collection
15.47/4.99 * @throws ClassCastException if the types of one or more elements
15.47/4.99 * in the specified collection are incompatible with this
15.47/4.99 * collection (optional)
15.47/4.99 * @throws NullPointerException if the specified collection contains one
15.47/4.99 * or more null elements and this collection does not permit null
15.47/4.99 * elements (optional), or if the specified collection is null
15.47/4.99 * @see #contains(Object)
15.47/4.99 */
15.47/4.99 boolean containsAll(Collection c);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Adds all of the elements in the specified collection to this collection
15.47/4.99 * (optional operation). The behavior of this operation is undefined if
15.47/4.99 * the specified collection is modified while the operation is in progress.
15.47/4.99 * (This implies that the behavior of this call is undefined if the
15.47/4.99 * specified collection is this collection, and this collection is
15.47/4.99 * nonempty.)
15.47/4.99 *
15.47/4.99 * @param c collection containing elements to be added to this collection
15.47/4.99 * @return true if this collection changed as a result of the call
15.47/4.99 * @throws UnsupportedOperationException if the addAll operation
15.47/4.99 * is not supported by this collection
15.47/4.99 * @throws ClassCastException if the class of an element of the specified
15.47/4.99 * collection prevents it from being added to this collection
15.47/4.99 * @throws NullPointerException if the specified collection contains a
15.47/4.99 * null element and this collection does not permit null elements,
15.47/4.99 * or if the specified collection is null
15.47/4.99 * @throws IllegalArgumentException if some property of an element of the
15.47/4.99 * specified collection prevents it from being added to this
15.47/4.99 * collection
15.47/4.99 * @throws IllegalStateException if not all the elements can be added at
15.47/4.99 * this time due to insertion restrictions
15.47/4.99 * @see #add(Object)
15.47/4.99 */
15.47/4.99 boolean addAll(Collection c);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes all of this collection's elements that are also contained in the
15.47/4.99 * specified collection (optional operation). After this call returns,
15.47/4.99 * this collection will contain no elements in common with the specified
15.47/4.99 * collection.
15.47/4.99 *
15.47/4.99 * @param c collection containing elements to be removed from this collection
15.47/4.99 * @return true if this collection changed as a result of the
15.47/4.99 * call
15.47/4.99 * @throws UnsupportedOperationException if the removeAll method
15.47/4.99 * is not supported by this collection
15.47/4.99 * @throws ClassCastException if the types of one or more elements
15.47/4.99 * in this collection are incompatible with the specified
15.47/4.99 * collection (optional)
15.47/4.99 * @throws NullPointerException if this collection contains one or more
15.47/4.99 * null elements and the specified collection does not support
15.47/4.99 * null elements (optional), or if the specified collection is null
15.47/4.99 * @see #remove(Object)
15.47/4.99 * @see #contains(Object)
15.47/4.99 */
15.47/4.99 boolean removeAll(Collection c);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retains only the elements in this collection that are contained in the
15.47/4.99 * specified collection (optional operation). In other words, removes from
15.47/4.99 * this collection all of its elements that are not contained in the
15.47/4.99 * specified collection.
15.47/4.99 *
15.47/4.99 * @param c collection containing elements to be retained in this collection
15.47/4.99 * @return true if this collection changed as a result of the call
15.47/4.99 * @throws UnsupportedOperationException if the retainAll operation
15.47/4.99 * is not supported by this collection
15.47/4.99 * @throws ClassCastException if the types of one or more elements
15.47/4.99 * in this collection are incompatible with the specified
15.47/4.99 * collection (optional)
15.47/4.99 * @throws NullPointerException if this collection contains one or more
15.47/4.99 * null elements and the specified collection does not permit null
15.47/4.99 * elements (optional), or if the specified collection is null
15.47/4.99 * @see #remove(Object)
15.47/4.99 * @see #contains(Object)
15.47/4.99 */
15.47/4.99 boolean retainAll(Collection c);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes all of the elements from this collection (optional operation).
15.47/4.99 * The collection will be empty after this method returns.
15.47/4.99 *
15.47/4.99 * @throws UnsupportedOperationException if the clear operation
15.47/4.99 * is not supported by this collection
15.47/4.99 */
15.47/4.99 void clear();
15.47/4.99
15.47/4.99
15.47/4.99 // Comparison and hashing
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Compares the specified object with this collection for equality.
15.47/4.99 *
15.47/4.99 * While the Collection interface adds no stipulations to the
15.47/4.99 * general contract for the Object.equals, programmers who
15.47/4.99 * implement the Collection interface "directly" (in other words,
15.47/4.99 * create a class that is a Collection but is not a Set
15.47/4.99 * or a List) must exercise care if they choose to override the
15.47/4.99 * Object.equals. It is not necessary to do so, and the simplest
15.47/4.99 * course of action is to rely on Object's implementation, but
15.47/4.99 * the implementor may wish to implement a "value comparison" in place of
15.47/4.99 * the default "reference comparison." (The List and
15.47/4.99 * Set interfaces mandate such value comparisons.)
15.47/4.99 *
15.47/4.99 * The general contract for the Object.equals method states that
15.47/4.99 * equals must be symmetric (in other words, a.equals(b) if and
15.47/4.99 * only if b.equals(a)). The contracts for List.equals
15.47/4.99 * and Set.equals state that lists are only equal to other lists,
15.47/4.99 * and sets to other sets. Thus, a custom equals method for a
15.47/4.99 * collection class that implements neither the List nor
15.47/4.99 * Set interface must return false when this collection
15.47/4.99 * is compared to any list or set. (By the same logic, it is not possible
15.47/4.99 * to write a class that correctly implements both the Set and
15.47/4.99 * List interfaces.)
15.47/4.99 *
15.47/4.99 * @param o object to be compared for equality with this collection
15.47/4.99 * @return true if the specified object is equal to this
15.47/4.99 * collection
15.47/4.99 *
15.47/4.99 * @see Object#equals(Object)
15.47/4.99 * @see Set#equals(Object)
15.47/4.99 * @see List#equals(Object)
15.47/4.99 */
15.47/4.99 boolean equals(Object o);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns the hash code value for this collection. While the
15.47/4.99 * Collection interface adds no stipulations to the general
15.47/4.99 * contract for the Object.hashCode method, programmers should
15.47/4.99 * take note that any class that overrides the Object.equals
15.47/4.99 * method must also override the Object.hashCode method in order
15.47/4.99 * to satisfy the general contract for the Object.hashCodemethod.
15.47/4.99 * In particular, c1.equals(c2) implies that
15.47/4.99 * c1.hashCode()==c2.hashCode().
15.47/4.99 *
15.47/4.99 * @return the hash code value for this collection
15.47/4.99 *
15.47/4.99 * @see Object#hashCode()
15.47/4.99 * @see Object#equals(Object)
15.47/4.99 */
15.47/4.99 int hashCode();
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 /*
15.47/4.99 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/4.99 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/4.99 *
15.47/4.99 * This code is free software; you can redistribute it and/or modify it
15.47/4.99 * under the terms of the GNU General Public License version 2 only, as
15.47/4.99 * published by the Free Software Foundation. Sun designates this
15.47/4.99 * particular file as subject to the "Classpath" exception as provided
15.47/4.99 * by Sun in the LICENSE file that accompanied this code.
15.47/4.99 *
15.47/4.99 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/4.99 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/4.99 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/4.99 * version 2 for more details (a copy is included in the LICENSE file that
15.47/4.99 * accompanied this code).
15.47/4.99 *
15.47/4.99 * You should have received a copy of the GNU General Public License version
15.47/4.99 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/4.99 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/4.99 *
15.47/4.99 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/4.99 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/4.99 * have any questions.
15.47/4.99 */
15.47/4.99
15.47/4.99 package javaUtilEx;
15.47/4.99
15.47/4.99 /**
15.47/4.99 * This exception may be thrown by methods that have detected concurrent
15.47/4.99 * modification of an object when such modification is not permissible.
15.47/4.99 *
15.47/4.99 * For example, it is not generally permissible for one thread to modify a Collection
15.47/4.99 * while another thread is iterating over it. In general, the results of the
15.47/4.99 * iteration are undefined under these circumstances. Some Iterator
15.47/4.99 * implementations (including those of all the general purpose collection implementations
15.47/4.99 * provided by the JRE) may choose to throw this exception if this behavior is
15.47/4.99 * detected. Iterators that do this are known as fail-fast iterators,
15.47/4.99 * as they fail quickly and cleanly, rather that risking arbitrary,
15.47/4.99 * non-deterministic behavior at an undetermined time in the future.
15.47/4.99 *
15.47/4.99 * Note that this exception does not always indicate that an object has
15.47/4.99 * been concurrently modified by a different thread. If a single
15.47/4.99 * thread issues a sequence of method invocations that violates the
15.47/4.99 * contract of an object, the object may throw this exception. For
15.47/4.99 * example, if a thread modifies a collection directly while it is
15.47/4.99 * iterating over the collection with a fail-fast iterator, the iterator
15.47/4.99 * will throw this exception.
15.47/4.99 *
15.47/4.99 *
Note that fail-fast behavior cannot be guaranteed as it is, generally
15.47/4.99 * speaking, impossible to make any hard guarantees in the presence of
15.47/4.99 * unsynchronized concurrent modification. Fail-fast operations
15.47/4.99 * throw ConcurrentModificationException on a best-effort basis.
15.47/4.99 * Therefore, it would be wrong to write a program that depended on this
15.47/4.99 * exception for its correctness: ConcurrentModificationException
15.47/4.99 * should be used only to detect bugs.
15.47/4.99 *
15.47/4.99 * @author Josh Bloch
15.47/4.99 * @see Collection
15.47/4.99 * @see Iterator
15.47/4.99 * @see ListIterator
15.47/4.99 * @see Vector
15.47/4.99 * @see LinkedList
15.47/4.99 * @see HashSet
15.47/4.99 * @see Hashtable
15.47/4.99 * @see TreeMap
15.47/4.99 * @see AbstractList
15.47/4.99 * @since 1.2
15.47/4.99 */
15.47/4.99 public class ConcurrentModificationException extends RuntimeException {
15.47/4.99 /**
15.47/4.99 * Constructs a ConcurrentModificationException with no
15.47/4.99 * detail message.
15.47/4.99 */
15.47/4.99 public ConcurrentModificationException() {
15.47/4.99 }
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Constructs a ConcurrentModificationException with the
15.47/4.99 * specified detail message.
15.47/4.99 *
15.47/4.99 * @param message the detail message pertaining to this exception.
15.47/4.99 */
15.47/4.99 public ConcurrentModificationException(String message) {
15.47/4.99 super(message);
15.47/4.99 }
15.47/4.99 }
15.47/4.99
15.47/4.99
15.47/4.99 /*
15.47/4.99 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/4.99 *
15.47/4.99 * This code is free software; you can redistribute it and/or modify it
15.47/4.99 * under the terms of the GNU General Public License version 2 only, as
15.47/4.99 * published by the Free Software Foundation. Sun designates this
15.47/4.99 * particular file as subject to the "Classpath" exception as provided
15.47/4.99 * by Sun in the LICENSE file that accompanied this code.
15.47/4.99 *
15.47/4.99 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/4.99 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/4.99 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/4.99 * version 2 for more details (a copy is included in the LICENSE file that
15.47/4.99 * accompanied this code).
15.47/4.99 *
15.47/4.99 * You should have received a copy of the GNU General Public License version
15.47/4.99 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/4.99 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/4.99 *
15.47/4.99 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/4.99 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/4.99 * have any questions.
15.47/4.99 */
15.47/4.99
15.47/4.99 /*
15.47/4.99 * This file is available under and governed by the GNU General Public
15.47/4.99 * License version 2 only, as published by the Free Software Foundation.
15.47/4.99 * However, the following notice accompanied the original version of this
15.47/4.99 * file:
15.47/4.99 *
15.47/4.99 * Written by Doug Lea and Josh Bloch with assistance from members of
15.47/4.99 * JCP JSR-166 Expert Group and released to the public domain, as explained
15.47/4.99 * at http://creativecommons.org/licenses/publicdomain
15.47/4.99 */
15.47/4.99
15.47/4.99 package javaUtilEx;
15.47/4.99
15.47/4.99 /**
15.47/4.99 * A linear collection that supports element insertion and removal at
15.47/4.99 * both ends. The name deque is short for "double ended queue"
15.47/4.99 * and is usually pronounced "deck". Most Deque
15.47/4.99 * implementations place no fixed limits on the number of elements
15.47/4.99 * they may contain, but this interface supports capacity-restricted
15.47/4.99 * deques as well as those with no fixed size limit.
15.47/4.99 *
15.47/4.99 *
This interface defines methods to access the elements at both
15.47/4.99 * ends of the deque. Methods are provided to insert, remove, and
15.47/4.99 * examine the element. Each of these methods exists in two forms:
15.47/4.99 * one throws an exception if the operation fails, the other returns a
15.47/4.99 * special value (either null or false, depending on
15.47/4.99 * the operation). The latter form of the insert operation is
15.47/4.99 * designed specifically for use with capacity-restricted
15.47/4.99 * Deque implementations; in most implementations, insert
15.47/4.99 * operations cannot fail.
15.47/4.99 *
15.47/4.99 *
The twelve methods described above are summarized in the
15.47/4.99 * following table:
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * |
15.47/4.99 * First Element (Head) |
15.47/4.99 * Last Element (Tail) |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * |
15.47/4.99 * Throws exception |
15.47/4.99 * Special value |
15.47/4.99 * Throws exception |
15.47/4.99 * Special value |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | Insert |
15.47/4.99 * {@link #addFirst addFirst(e)} |
15.47/4.99 * {@link #offerFirst offerFirst(e)} |
15.47/4.99 * {@link #addLast addLast(e)} |
15.47/4.99 * {@link #offerLast offerLast(e)} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | Remove |
15.47/4.99 * {@link #removeFirst removeFirst()} |
15.47/4.99 * {@link #pollFirst pollFirst()} |
15.47/4.99 * {@link #removeLast removeLast()} |
15.47/4.99 * {@link #pollLast pollLast()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | Examine |
15.47/4.99 * {@link #getFirst getFirst()} |
15.47/4.99 * {@link #peekFirst peekFirst()} |
15.47/4.99 * {@link #getLast getLast()} |
15.47/4.99 * {@link #peekLast peekLast()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * This interface extends the {@link Queue} interface. When a deque is
15.47/4.99 * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are
15.47/4.99 * added at the end of the deque and removed from the beginning. The methods
15.47/4.99 * inherited from the Queue interface are precisely equivalent to
15.47/4.99 * Deque methods as indicated in the following table:
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | Queue Method |
15.47/4.99 * Equivalent Deque Method |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#add add(e)} |
15.47/4.99 * {@link #addLast addLast(e)} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#offer offer(e)} |
15.47/4.99 * {@link #offerLast offerLast(e)} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#remove remove()} |
15.47/4.99 * {@link #removeFirst removeFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#poll poll()} |
15.47/4.99 * {@link #pollFirst pollFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#element element()} |
15.47/4.99 * {@link #getFirst getFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link java.util.Queue#peek peek()} |
15.47/4.99 * {@link #peek peekFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * Deques can also be used as LIFO (Last-In-First-Out) stacks. This
15.47/4.99 * interface should be used in preference to the legacy {@link Stack} class.
15.47/4.99 * When a deque is used as a stack, elements are pushed and popped from the
15.47/4.99 * beginning of the deque. Stack methods are precisely equivalent to
15.47/4.99 * Deque methods as indicated in the table below:
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | Stack Method |
15.47/4.99 * Equivalent Deque Method |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link #push push(e)} |
15.47/4.99 * {@link #addFirst addFirst(e)} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link #pop pop()} |
15.47/4.99 * {@link #removeFirst removeFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * | {@link #peek peek()} |
15.47/4.99 * {@link #peekFirst peekFirst()} |
15.47/4.99 *
15.47/4.99 *
15.47/4.99 *
15.47/4.99 * Note that the {@link #peek peek} method works equally well when
15.47/4.99 * a deque is used as a queue or a stack; in either case, elements are
15.47/4.99 * drawn from the beginning of the deque.
15.47/4.99 *
15.47/4.99 *
This interface provides two methods to remove interior
15.47/4.99 * elements, {@link #removeFirstOccurrence removeFirstOccurrence} and
15.47/4.99 * {@link #removeLastOccurrence removeLastOccurrence}.
15.47/4.99 *
15.47/4.99 *
Unlike the {@link List} interface, this interface does not
15.47/4.99 * provide support for indexed access to elements.
15.47/4.99 *
15.47/4.99 *
While Deque implementations are not strictly required
15.47/4.99 * to prohibit the insertion of null elements, they are strongly
15.47/4.99 * encouraged to do so. Users of any Deque implementations
15.47/4.99 * that do allow null elements are strongly encouraged not to
15.47/4.99 * take advantage of the ability to insert nulls. This is so because
15.47/4.99 * null is used as a special return value by various methods
15.47/4.99 * to indicated that the deque is empty.
15.47/4.99 *
15.47/4.99 *
Deque implementations generally do not define
15.47/4.99 * element-based versions of the equals and hashCode
15.47/4.99 * methods, but instead inherit the identity-based versions from class
15.47/4.99 * Object.
15.47/4.99 *
15.47/4.99 *
This interface is a member of the Java Collections
15.47/4.99 * Framework.
15.47/4.99 *
15.47/4.99 * @author Doug Lea
15.47/4.99 * @author Josh Bloch
15.47/4.99 * @since 1.6
15.47/4.99 * @param the type of elements held in this collection
15.47/4.99 */
15.47/4.99
15.47/4.99 public interface Deque extends Queue {
15.47/4.99 /**
15.47/4.99 * Inserts the specified element at the front of this deque if it is
15.47/4.99 * possible to do so immediately without violating capacity restrictions.
15.47/4.99 * When using a capacity-restricted deque, it is generally preferable to
15.47/4.99 * use method {@link #offerFirst}.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @throws IllegalStateException if the element cannot be added at this
15.47/4.99 * time due to capacity restrictions
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 void addFirst(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element at the end of this deque if it is
15.47/4.99 * possible to do so immediately without violating capacity restrictions.
15.47/4.99 * When using a capacity-restricted deque, it is generally preferable to
15.47/4.99 * use method {@link #offerLast}.
15.47/4.99 *
15.47/4.99 * This method is equivalent to {@link #add}.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @throws IllegalStateException if the element cannot be added at this
15.47/4.99 * time due to capacity restrictions
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 void addLast(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element at the front of this deque unless it would
15.47/4.99 * violate capacity restrictions. When using a capacity-restricted deque,
15.47/4.99 * this method is generally preferable to the {@link #addFirst} method,
15.47/4.99 * which can fail to insert an element only by throwing an exception.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @return true if the element was added to this deque, else
15.47/4.99 * false
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 boolean offerFirst(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element at the end of this deque unless it would
15.47/4.99 * violate capacity restrictions. When using a capacity-restricted deque,
15.47/4.99 * this method is generally preferable to the {@link #addLast} method,
15.47/4.99 * which can fail to insert an element only by throwing an exception.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @return true if the element was added to this deque, else
15.47/4.99 * false
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 boolean offerLast(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the first element of this deque. This method
15.47/4.99 * differs from {@link #pollFirst pollFirst} only in that it throws an
15.47/4.99 * exception if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the head of this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E removeFirst();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the last element of this deque. This method
15.47/4.99 * differs from {@link #pollLast pollLast} only in that it throws an
15.47/4.99 * exception if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the tail of this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E removeLast();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the first element of this deque,
15.47/4.99 * or returns null if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the head of this deque, or null if this deque is empty
15.47/4.99 */
15.47/4.99 E pollFirst();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the last element of this deque,
15.47/4.99 * or returns null if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the tail of this deque, or null if this deque is empty
15.47/4.99 */
15.47/4.99 E pollLast();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the first element of this deque.
15.47/4.99 *
15.47/4.99 * This method differs from {@link #peekFirst peekFirst} only in that it
15.47/4.99 * throws an exception if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the head of this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E getFirst();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the last element of this deque.
15.47/4.99 * This method differs from {@link #peekLast peekLast} only in that it
15.47/4.99 * throws an exception if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the tail of this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E getLast();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the first element of this deque,
15.47/4.99 * or returns null if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the head of this deque, or null if this deque is empty
15.47/4.99 */
15.47/4.99 E peekFirst();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the last element of this deque,
15.47/4.99 * or returns null if this deque is empty.
15.47/4.99 *
15.47/4.99 * @return the tail of this deque, or null if this deque is empty
15.47/4.99 */
15.47/4.99 E peekLast();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes the first occurrence of the specified element from this deque.
15.47/4.99 * If the deque does not contain the element, it is unchanged.
15.47/4.99 * More formally, removes the first element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e))
15.47/4.99 * (if such an element exists).
15.47/4.99 * Returns true if this deque contained the specified element
15.47/4.99 * (or equivalently, if this deque changed as a result of the call).
15.47/4.99 *
15.47/4.99 * @param o element to be removed from this deque, if present
15.47/4.99 * @return true if an element was removed as a result of this call
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * is incompatible with this deque (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements (optional)
15.47/4.99 */
15.47/4.99 boolean removeFirstOccurrence(Object o);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes the last occurrence of the specified element from this deque.
15.47/4.99 * If the deque does not contain the element, it is unchanged.
15.47/4.99 * More formally, removes the last element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e))
15.47/4.99 * (if such an element exists).
15.47/4.99 * Returns true if this deque contained the specified element
15.47/4.99 * (or equivalently, if this deque changed as a result of the call).
15.47/4.99 *
15.47/4.99 * @param o element to be removed from this deque, if present
15.47/4.99 * @return true if an element was removed as a result of this call
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * is incompatible with this deque (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements (optional)
15.47/4.99 */
15.47/4.99 boolean removeLastOccurrence(Object o);
15.47/4.99
15.47/4.99 // *** Queue methods ***
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element into the queue represented by this deque
15.47/4.99 * (in other words, at the tail of this deque) if it is possible to do so
15.47/4.99 * immediately without violating capacity restrictions, returning
15.47/4.99 * true upon success and throwing an
15.47/4.99 * IllegalStateException if no space is currently available.
15.47/4.99 * When using a capacity-restricted deque, it is generally preferable to
15.47/4.99 * use {@link #offer(Object) offer}.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #addLast}.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @return true (as specified by {@link Collection#add})
15.47/4.99 * @throws IllegalStateException if the element cannot be added at this
15.47/4.99 * time due to capacity restrictions
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 boolean add(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Inserts the specified element into the queue represented by this deque
15.47/4.99 * (in other words, at the tail of this deque) if it is possible to do so
15.47/4.99 * immediately without violating capacity restrictions, returning
15.47/4.99 * true upon success and false if no space is currently
15.47/4.99 * available. When using a capacity-restricted deque, this method is
15.47/4.99 * generally preferable to the {@link #add} method, which can fail to
15.47/4.99 * insert an element only by throwing an exception.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #offerLast}.
15.47/4.99 *
15.47/4.99 * @param e the element to add
15.47/4.99 * @return true if the element was added to this deque, else
15.47/4.99 * false
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 boolean offer(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the head of the queue represented by this deque
15.47/4.99 * (in other words, the first element of this deque).
15.47/4.99 * This method differs from {@link #poll poll} only in that it throws an
15.47/4.99 * exception if this deque is empty.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #removeFirst()}.
15.47/4.99 *
15.47/4.99 * @return the head of the queue represented by this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E remove();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves and removes the head of the queue represented by this deque
15.47/4.99 * (in other words, the first element of this deque), or returns
15.47/4.99 * null if this deque is empty.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #pollFirst()}.
15.47/4.99 *
15.47/4.99 * @return the first element of this deque, or null if
15.47/4.99 * this deque is empty
15.47/4.99 */
15.47/4.99 E poll();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the head of the queue represented by
15.47/4.99 * this deque (in other words, the first element of this deque).
15.47/4.99 * This method differs from {@link #peek peek} only in that it throws an
15.47/4.99 * exception if this deque is empty.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #getFirst()}.
15.47/4.99 *
15.47/4.99 * @return the head of the queue represented by this deque
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E element();
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Retrieves, but does not remove, the head of the queue represented by
15.47/4.99 * this deque (in other words, the first element of this deque), or
15.47/4.99 * returns null if this deque is empty.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #peekFirst()}.
15.47/4.99 *
15.47/4.99 * @return the head of the queue represented by this deque, or
15.47/4.99 * null if this deque is empty
15.47/4.99 */
15.47/4.99 E peek();
15.47/4.99
15.47/4.99
15.47/4.99 // *** Stack methods ***
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Pushes an element onto the stack represented by this deque (in other
15.47/4.99 * words, at the head of this deque) if it is possible to do so
15.47/4.99 * immediately without violating capacity restrictions, returning
15.47/4.99 * true upon success and throwing an
15.47/4.99 * IllegalStateException if no space is currently available.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #addFirst}.
15.47/4.99 *
15.47/4.99 * @param e the element to push
15.47/4.99 * @throws IllegalStateException if the element cannot be added at this
15.47/4.99 * time due to capacity restrictions
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * prevents it from being added to this deque
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements
15.47/4.99 * @throws IllegalArgumentException if some property of the specified
15.47/4.99 * element prevents it from being added to this deque
15.47/4.99 */
15.47/4.99 void push(E e);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Pops an element from the stack represented by this deque. In other
15.47/4.99 * words, removes and returns the first element of this deque.
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #removeFirst()}.
15.47/4.99 *
15.47/4.99 * @return the element at the front of this deque (which is the top
15.47/4.99 * of the stack represented by this deque)
15.47/4.99 * @throws NoSuchElementException if this deque is empty
15.47/4.99 */
15.47/4.99 E pop();
15.47/4.99
15.47/4.99
15.47/4.99 // *** Collection methods ***
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Removes the first occurrence of the specified element from this deque.
15.47/4.99 * If the deque does not contain the element, it is unchanged.
15.47/4.99 * More formally, removes the first element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e))
15.47/4.99 * (if such an element exists).
15.47/4.99 * Returns true if this deque contained the specified element
15.47/4.99 * (or equivalently, if this deque changed as a result of the call).
15.47/4.99 *
15.47/4.99 *
This method is equivalent to {@link #removeFirstOccurrence}.
15.47/4.99 *
15.47/4.99 * @param o element to be removed from this deque, if present
15.47/4.99 * @return true if an element was removed as a result of this call
15.47/4.99 * @throws ClassCastException if the class of the specified element
15.47/4.99 * is incompatible with this deque (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements (optional)
15.47/4.99 */
15.47/4.99 boolean remove(Object o);
15.47/4.99
15.47/4.99 /**
15.47/4.99 * Returns true if this deque contains the specified element.
15.47/4.99 * More formally, returns true if and only if this deque contains
15.47/4.99 * at least one element e such that
15.47/4.99 * (o==null ? e==null : o.equals(e)).
15.47/4.99 *
15.47/4.99 * @param o element whose presence in this deque is to be tested
15.47/4.99 * @return true if this deque contains the specified element
15.47/4.99 * @throws ClassCastException if the type of the specified element
15.47/4.99 * is incompatible with this deque (optional)
15.47/4.99 * @throws NullPointerException if the specified element is null and this
15.47/4.99 * deque does not permit null elements (optional)
15.47/5.00 */
15.47/5.00 boolean contains(Object o);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the number of elements in this deque.
15.47/5.00 *
15.47/5.00 * @return the number of elements in this deque
15.47/5.00 */
15.47/5.00 public int size();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns an iterator over the elements in this deque in proper sequence.
15.47/5.00 * The elements will be returned in order from first (head) to last (tail).
15.47/5.00 *
15.47/5.00 * @return an iterator over the elements in this deque in proper sequence
15.47/5.00 */
15.47/5.00 Iterator iterator();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns an iterator over the elements in this deque in reverse
15.47/5.00 * sequential order. The elements will be returned in order from
15.47/5.00 * last (tail) to first (head).
15.47/5.00 *
15.47/5.00 * @return an iterator over the elements in this deque in reverse
15.47/5.00 * sequence
15.47/5.00 */
15.47/5.00 Iterator descendingIterator();
15.47/5.00
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Thrown to indicate that a method has been passed an illegal or
15.47/5.00 * inappropriate argument.
15.47/5.00 *
15.47/5.00 * @author unascribed
15.47/5.00 * @see java.lang.Thread#setPriority(int)
15.47/5.00 * @since JDK1.0
15.47/5.00 */
15.47/5.00 public
15.47/5.00 class IllegalArgumentException extends RuntimeException {
15.47/5.00 /**
15.47/5.00 * Constructs an IllegalArgumentException with no
15.47/5.00 * detail message.
15.47/5.00 */
15.47/5.00 public IllegalArgumentException() {
15.47/5.00 super();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs an IllegalArgumentException with the
15.47/5.00 * specified detail message.
15.47/5.00 *
15.47/5.00 * @param s the detail message.
15.47/5.00 */
15.47/5.00 public IllegalArgumentException(String s) {
15.47/5.00 super(s);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a new exception with the specified detail message and
15.47/5.00 * cause.
15.47/5.00 *
15.47/5.00 * Note that the detail message associated with cause is
15.47/5.00 * not automatically incorporated in this exception's detail
15.47/5.00 * message.
15.47/5.00 *
15.47/5.00 * @param message the detail message (which is saved for later retrieval
15.47/5.00 * by the {@link Throwable#getMessage()} method).
15.47/5.00 * @param cause the cause (which is saved for later retrieval by the
15.47/5.00 * {@link Throwable#getCause()} method). (A null value
15.47/5.00 * is permitted, and indicates that the cause is nonexistent or
15.47/5.00 * unknown.)
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public IllegalArgumentException(String message, Throwable cause) {
15.47/5.00 super(message, cause);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a new exception with the specified cause and a detail
15.47/5.00 * message of (cause==null ? null : cause.toString()) (which
15.47/5.00 * typically contains the class and detail message of cause).
15.47/5.00 * This constructor is useful for exceptions that are little more than
15.47/5.00 * wrappers for other throwables (for example, {@link
15.47/5.00 * java.security.PrivilegedActionException}).
15.47/5.00 *
15.47/5.00 * @param cause the cause (which is saved for later retrieval by the
15.47/5.00 * {@link Throwable#getCause()} method). (A null value is
15.47/5.00 * permitted, and indicates that the cause is nonexistent or
15.47/5.00 * unknown.)
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public IllegalArgumentException(Throwable cause) {
15.47/5.00 super(cause);
15.47/5.00 }
15.47/5.00
15.47/5.00 private static final long serialVersionUID = -5365630128856068164L;
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1996-2003 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Signals that a method has been invoked at an illegal or
15.47/5.00 * inappropriate time. In other words, the Java environment or
15.47/5.00 * Java application is not in an appropriate state for the requested
15.47/5.00 * operation.
15.47/5.00 *
15.47/5.00 * @author Jonni Kanerva
15.47/5.00 * @since JDK1.1
15.47/5.00 */
15.47/5.00 public
15.47/5.00 class IllegalStateException extends RuntimeException {
15.47/5.00 /**
15.47/5.00 * Constructs an IllegalStateException with no detail message.
15.47/5.00 * A detail message is a String that describes this particular exception.
15.47/5.00 */
15.47/5.00 public IllegalStateException() {
15.47/5.00 super();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs an IllegalStateException with the specified detail
15.47/5.00 * message. A detail message is a String that describes this particular
15.47/5.00 * exception.
15.47/5.00 *
15.47/5.00 * @param s the String that contains a detailed message
15.47/5.00 */
15.47/5.00 public IllegalStateException(String s) {
15.47/5.00 super(s);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a new exception with the specified detail message and
15.47/5.00 * cause.
15.47/5.00 *
15.47/5.00 *
Note that the detail message associated with cause is
15.47/5.00 * not automatically incorporated in this exception's detail
15.47/5.00 * message.
15.47/5.00 *
15.47/5.00 * @param message the detail message (which is saved for later retrieval
15.47/5.00 * by the {@link Throwable#getMessage()} method).
15.47/5.00 * @param cause the cause (which is saved for later retrieval by the
15.47/5.00 * {@link Throwable#getCause()} method). (A null value
15.47/5.00 * is permitted, and indicates that the cause is nonexistent or
15.47/5.00 * unknown.)
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public IllegalStateException(String message, Throwable cause) {
15.47/5.00 super(message, cause);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a new exception with the specified cause and a detail
15.47/5.00 * message of (cause==null ? null : cause.toString()) (which
15.47/5.00 * typically contains the class and detail message of cause).
15.47/5.00 * This constructor is useful for exceptions that are little more than
15.47/5.00 * wrappers for other throwables (for example, {@link
15.47/5.00 * java.security.PrivilegedActionException}).
15.47/5.00 *
15.47/5.00 * @param cause the cause (which is saved for later retrieval by the
15.47/5.00 * {@link Throwable#getCause()} method). (A null value is
15.47/5.00 * permitted, and indicates that the cause is nonexistent or
15.47/5.00 * unknown.)
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public IllegalStateException(Throwable cause) {
15.47/5.00 super(cause);
15.47/5.00 }
15.47/5.00
15.47/5.00 static final long serialVersionUID = -1848914673093119416L;
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * An iterator over a collection. {@code Iterator} takes the place of
15.47/5.00 * {@link Enumeration} in the Java Collections Framework. Iterators
15.47/5.00 * differ from enumerations in two ways:
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * - Iterators allow the caller to remove elements from the
15.47/5.00 * underlying collection during the iteration with well-defined
15.47/5.00 * semantics.
15.47/5.00 *
- Method names have been improved.
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * This interface is a member of the
15.47/5.00 *
15.47/5.00 * Java Collections Framework.
15.47/5.00 *
15.47/5.00 * @author Josh Bloch
15.47/5.00 * @see Collection
15.47/5.00 * @see ListIterator
15.47/5.00 * @see Iterable
15.47/5.00 * @since 1.2
15.47/5.00 */
15.47/5.00 public interface Iterator {
15.47/5.00 /**
15.47/5.00 * Returns {@code true} if the iteration has more elements.
15.47/5.00 * (In other words, returns {@code true} if {@link #next} would
15.47/5.00 * return an element rather than throwing an exception.)
15.47/5.00 *
15.47/5.00 * @return {@code true} if the iteration has more elements
15.47/5.00 */
15.47/5.00 boolean hasNext();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the next element in the iteration.
15.47/5.00 *
15.47/5.00 * @return the next element in the iteration
15.47/5.00 * @throws NoSuchElementException if the iteration has no more elements
15.47/5.00 */
15.47/5.00 E next();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes from the underlying collection the last element returned
15.47/5.00 * by this iterator (optional operation). This method can be called
15.47/5.00 * only once per call to {@link #next}. The behavior of an iterator
15.47/5.00 * is unspecified if the underlying collection is modified while the
15.47/5.00 * iteration is in progress in any way other than by calling this
15.47/5.00 * method.
15.47/5.00 *
15.47/5.00 * @throws UnsupportedOperationException if the {@code remove}
15.47/5.00 * operation is not supported by this iterator
15.47/5.00 *
15.47/5.00 * @throws IllegalStateException if the {@code next} method has not
15.47/5.00 * yet been called, or the {@code remove} method has already
15.47/5.00 * been called after the last call to the {@code next}
15.47/5.00 * method
15.47/5.00 */
15.47/5.00 void remove();
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 public class juLinkedListCreateSet {
15.47/5.00 public static void main(String[] args) {
15.47/5.00 Random.args = args;
15.47/5.00
15.47/5.00 LinkedList l = createList(Random.random());
15.47/5.00 l.set(Random.random(), new Content(Random.random()));
15.47/5.00 }
15.47/5.00
15.47/5.00 public static LinkedList createList(int n) {
15.47/5.00 LinkedList l = new LinkedList();
15.47/5.00 while (n > 0) {
15.47/5.00 l.addLast(new Content(Random.random()));
15.47/5.00 n--;
15.47/5.00 }
15.47/5.00 return l;
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00 final class Content {
15.47/5.00 int val;
15.47/5.00
15.47/5.00 public Content(int v) {
15.47/5.00 this.val = v;
15.47/5.00 }
15.47/5.00
15.47/5.00 public int hashCode() {
15.47/5.00 return val^31;
15.47/5.00 }
15.47/5.00
15.47/5.00 public boolean equals(Object o) {
15.47/5.00 if (o instanceof Content) {
15.47/5.00 return this.val == ((Content) o).val;
15.47/5.00 }
15.47/5.00 return false;
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Linked list implementation of the List interface. Implements all
15.47/5.00 * optional list operations, and permits all elements (including
15.47/5.00 * null). In addition to implementing the List interface,
15.47/5.00 * the LinkedList class provides uniformly named methods to
15.47/5.00 * get, remove and insert an element at the
15.47/5.00 * beginning and end of the list. These operations allow linked lists to be
15.47/5.00 * used as a stack, {@linkplain Queue queue}, or {@linkplain Deque
15.47/5.00 * double-ended queue}.
15.47/5.00 *
15.47/5.00 * The class implements the Deque interface, providing
15.47/5.00 * first-in-first-out queue operations for add,
15.47/5.00 * poll, along with other stack and deque operations.
15.47/5.00 *
15.47/5.00 * All of the operations perform as could be expected for a doubly-linked
15.47/5.00 * list. Operations that index into the list will traverse the list from
15.47/5.00 * the beginning or the end, whichever is closer to the specified index.
15.47/5.00 *
15.47/5.00 *
Note that this implementation is not synchronized.
15.47/5.00 * If multiple threads access a linked list concurrently, and at least
15.47/5.00 * one of the threads modifies the list structurally, it must be
15.47/5.00 * synchronized externally. (A structural modification is any operation
15.47/5.00 * that adds or deletes one or more elements; merely setting the value of
15.47/5.00 * an element is not a structural modification.) This is typically
15.47/5.00 * accomplished by synchronizing on some object that naturally
15.47/5.00 * encapsulates the list.
15.47/5.00 *
15.47/5.00 * If no such object exists, the list should be "wrapped" using the
15.47/5.00 * {@link Collections#synchronizedList Collections.synchronizedList}
15.47/5.00 * method. This is best done at creation time, to prevent accidental
15.47/5.00 * unsynchronized access to the list:
15.47/5.00 * List list = Collections.synchronizedList(new LinkedList(...));
15.47/5.00 *
15.47/5.00 * The iterators returned by this class's iterator and
15.47/5.00 * listIterator methods are fail-fast: if the list is
15.47/5.00 * structurally modified at any time after the iterator is created, in
15.47/5.00 * any way except through the Iterator's own remove or
15.47/5.00 * add methods, the iterator will throw a {@link
15.47/5.00 * ConcurrentModificationException}. Thus, in the face of concurrent
15.47/5.00 * modification, the iterator fails quickly and cleanly, rather than
15.47/5.00 * risking arbitrary, non-deterministic behavior at an undetermined
15.47/5.00 * time in the future.
15.47/5.00 *
15.47/5.00 *
Note that the fail-fast behavior of an iterator cannot be guaranteed
15.47/5.00 * as it is, generally speaking, impossible to make any hard guarantees in the
15.47/5.00 * presence of unsynchronized concurrent modification. Fail-fast iterators
15.47/5.00 * throw ConcurrentModificationException on a best-effort basis.
15.47/5.00 * Therefore, it would be wrong to write a program that depended on this
15.47/5.00 * exception for its correctness: the fail-fast behavior of iterators
15.47/5.00 * should be used only to detect bugs.
15.47/5.00 *
15.47/5.00 *
This class is a member of the
15.47/5.00 *
15.47/5.00 * Java Collections Framework.
15.47/5.00 *
15.47/5.00 * @author Josh Bloch
15.47/5.00 * @see List
15.47/5.00 * @see ArrayList
15.47/5.00 * @see Vector
15.47/5.00 * @since 1.2
15.47/5.00 * @param the type of elements held in this collection
15.47/5.00 */
15.47/5.00
15.47/5.00 public class LinkedList
15.47/5.00 extends AbstractSequentialList
15.47/5.00 implements List, Deque
15.47/5.00 {
15.47/5.00 private transient Entry header = new Entry(null, null, null);
15.47/5.00 private transient int size = 0;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs an empty list.
15.47/5.00 */
15.47/5.00 public LinkedList() {
15.47/5.00 header.next = header.previous = header;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a list containing the elements of the specified
15.47/5.00 * collection, in the order they are returned by the collection's
15.47/5.00 * iterator.
15.47/5.00 *
15.47/5.00 * @param c the collection whose elements are to be placed into this list
15.47/5.00 * @throws NullPointerException if the specified collection is null
15.47/5.00 */
15.47/5.00 public LinkedList(Collection c) {
15.47/5.00 this();
15.47/5.00 addAll(c);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the first element in this list.
15.47/5.00 *
15.47/5.00 * @return the first element in this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 */
15.47/5.00 public E getFirst() {
15.47/5.00 if (size==0)
15.47/5.00 throw new NoSuchElementException();
15.47/5.00
15.47/5.00 return header.next.element;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the last element in this list.
15.47/5.00 *
15.47/5.00 * @return the last element in this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 */
15.47/5.00 public E getLast() {
15.47/5.00 if (size==0)
15.47/5.00 throw new NoSuchElementException();
15.47/5.00
15.47/5.00 return header.previous.element;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes and returns the first element from this list.
15.47/5.00 *
15.47/5.00 * @return the first element from this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 */
15.47/5.00 public E removeFirst() {
15.47/5.00 return remove(header.next);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes and returns the last element from this list.
15.47/5.00 *
15.47/5.00 * @return the last element from this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 */
15.47/5.00 public E removeLast() {
15.47/5.00 return remove(header.previous);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts the specified element at the beginning of this list.
15.47/5.00 *
15.47/5.00 * @param e the element to add
15.47/5.00 */
15.47/5.00 public void addFirst(E e) {
15.47/5.00 addBefore(e, header.next);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Appends the specified element to the end of this list.
15.47/5.00 *
15.47/5.00 * This method is equivalent to {@link #add}.
15.47/5.00 *
15.47/5.00 * @param e the element to add
15.47/5.00 */
15.47/5.00 public void addLast(E e) {
15.47/5.00 addBefore(e, header);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns true if this list contains the specified element.
15.47/5.00 * More formally, returns true if and only if this list contains
15.47/5.00 * at least one element e such that
15.47/5.00 * (o==null ? e==null : o.equals(e)).
15.47/5.00 *
15.47/5.00 * @param o element whose presence in this list is to be tested
15.47/5.00 * @return true if this list contains the specified element
15.47/5.00 */
15.47/5.00 public boolean contains(Object o) {
15.47/5.00 return indexOf(o) != -1;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the number of elements in this list.
15.47/5.00 *
15.47/5.00 * @return the number of elements in this list
15.47/5.00 */
15.47/5.00 public int size() {
15.47/5.00 return size;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Appends the specified element to the end of this list.
15.47/5.00 *
15.47/5.00 *
This method is equivalent to {@link #addLast}.
15.47/5.00 *
15.47/5.00 * @param e element to be appended to this list
15.47/5.00 * @return true (as specified by {@link Collection#add})
15.47/5.00 */
15.47/5.00 public boolean add(E e) {
15.47/5.00 addBefore(e, header);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the first occurrence of the specified element from this list,
15.47/5.00 * if it is present. If this list does not contain the element, it is
15.47/5.00 * unchanged. More formally, removes the element with the lowest index
15.47/5.00 * i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i)))
15.47/5.00 * (if such an element exists). Returns true if this list
15.47/5.00 * contained the specified element (or equivalently, if this list
15.47/5.00 * changed as a result of the call).
15.47/5.00 *
15.47/5.00 * @param o element to be removed from this list, if present
15.47/5.00 * @return true if this list contained the specified element
15.47/5.00 */
15.47/5.00 public boolean remove(Object o) {
15.47/5.00 if (o==null) {
15.47/5.00 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.00 if (e.element==null) {
15.47/5.00 remove(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 } else {
15.47/5.00 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.00 if (o.equals(e.element)) {
15.47/5.00 remove(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 }
15.47/5.00 return false;
15.47/5.00 }
15.47/5.00 /**
15.47/5.00 * Removes all of the elements from this list.
15.47/5.00 */
15.47/5.00 public void clear() {
15.47/5.00 Entry e = header.next;
15.47/5.00 while (e != header) {
15.47/5.00 Entry next = e.next;
15.47/5.00 e.next = e.previous = null;
15.47/5.00 e.element = null;
15.47/5.00 e = next;
15.47/5.00 }
15.47/5.00 header.next = header.previous = header;
15.47/5.00 size = 0;
15.47/5.00 modCount++;
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 // Positional Access Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the element at the specified position in this list.
15.47/5.00 *
15.47/5.00 * @param index index of the element to return
15.47/5.00 * @return the element at the specified position in this list
15.47/5.00 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.00 */
15.47/5.00 public E get(int index) {
15.47/5.00 return entry(index).element;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Replaces the element at the specified position in this list with the
15.47/5.00 * specified element.
15.47/5.00 *
15.47/5.00 * @param index index of the element to replace
15.47/5.00 * @param element element to be stored at the specified position
15.47/5.00 * @return the element previously at the specified position
15.47/5.00 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.00 */
15.47/5.00 public E set(int index, E element) {
15.47/5.00 Entry e = entry(index);
15.47/5.00 E oldVal = e.element;
15.47/5.00 e.element = element;
15.47/5.00 return oldVal;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts the specified element at the specified position in this list.
15.47/5.00 * Shifts the element currently at that position (if any) and any
15.47/5.00 * subsequent elements to the right (adds one to their indices).
15.47/5.00 *
15.47/5.00 * @param index index at which the specified element is to be inserted
15.47/5.00 * @param element element to be inserted
15.47/5.00 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.00 */
15.47/5.00 public void add(int index, E element) {
15.47/5.00 addBefore(element, (index==size ? header : entry(index)));
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the element at the specified position in this list. Shifts any
15.47/5.00 * subsequent elements to the left (subtracts one from their indices).
15.47/5.00 * Returns the element that was removed from the list.
15.47/5.00 *
15.47/5.00 * @param index the index of the element to be removed
15.47/5.00 * @return the element previously at the specified position
15.47/5.00 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.00 */
15.47/5.00 public E remove(int index) {
15.47/5.00 return remove(entry(index));
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the indexed entry.
15.47/5.00 */
15.47/5.00 private Entry entry(int index) {
15.47/5.00 if (index < 0 || index >= size)
15.47/5.00 throw new IndexOutOfBoundsException();
15.47/5.00 Entry e = header;
15.47/5.00 if (index < (size >> 1)) {
15.47/5.00 for (int i = 0; i <= index; i++)
15.47/5.00 e = e.next;
15.47/5.00 } else {
15.47/5.00 for (int i = size; i > index; i--)
15.47/5.00 e = e.previous;
15.47/5.00 }
15.47/5.00 return e;
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 // Search Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the first occurrence of the specified element
15.47/5.00 * in this list, or -1 if this list does not contain the element.
15.47/5.00 * More formally, returns the lowest index i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.00 * or -1 if there is no such index.
15.47/5.00 *
15.47/5.00 * @param o element to search for
15.47/5.00 * @return the index of the first occurrence of the specified element in
15.47/5.00 * this list, or -1 if this list does not contain the element
15.47/5.00 */
15.47/5.00 public int indexOf(Object o) {
15.47/5.00 int index = 0;
15.47/5.00 if (o==null) {
15.47/5.00 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.00 if (e.element==null)
15.47/5.00 return index;
15.47/5.00 index++;
15.47/5.00 }
15.47/5.00 } else {
15.47/5.00 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.00 if (o.equals(e.element))
15.47/5.00 return index;
15.47/5.00 index++;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 return -1;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the last occurrence of the specified element
15.47/5.00 * in this list, or -1 if this list does not contain the element.
15.47/5.00 * More formally, returns the highest index i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.00 * or -1 if there is no such index.
15.47/5.00 *
15.47/5.00 * @param o element to search for
15.47/5.00 * @return the index of the last occurrence of the specified element in
15.47/5.00 * this list, or -1 if this list does not contain the element
15.47/5.00 */
15.47/5.00 public int lastIndexOf(Object o) {
15.47/5.00 int index = size;
15.47/5.00 if (o==null) {
15.47/5.00 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.00 index--;
15.47/5.00 if (e.element==null)
15.47/5.00 return index;
15.47/5.00 }
15.47/5.00 } else {
15.47/5.00 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.00 index--;
15.47/5.00 if (o.equals(e.element))
15.47/5.00 return index;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 return -1;
15.47/5.00 }
15.47/5.00
15.47/5.00 // Queue operations.
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves, but does not remove, the head (first element) of this list.
15.47/5.00 * @return the head of this list, or null if this list is empty
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public E peek() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return getFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves, but does not remove, the head (first element) of this list.
15.47/5.00 * @return the head of this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public E element() {
15.47/5.00 return getFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves and removes the head (first element) of this list
15.47/5.00 * @return the head of this list, or null if this list is empty
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public E poll() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return removeFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves and removes the head (first element) of this list.
15.47/5.00 *
15.47/5.00 * @return the head of this list
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public E remove() {
15.47/5.00 return removeFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Adds the specified element as the tail (last element) of this list.
15.47/5.00 *
15.47/5.00 * @param e the element to add
15.47/5.00 * @return true (as specified by {@link Queue#offer})
15.47/5.00 * @since 1.5
15.47/5.00 */
15.47/5.00 public boolean offer(E e) {
15.47/5.00 return add(e);
15.47/5.00 }
15.47/5.00
15.47/5.00 // Deque operations
15.47/5.00 /**
15.47/5.00 * Inserts the specified element at the front of this list.
15.47/5.00 *
15.47/5.00 * @param e the element to insert
15.47/5.00 * @return true (as specified by {@link Deque#offerFirst})
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public boolean offerFirst(E e) {
15.47/5.00 addFirst(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts the specified element at the end of this list.
15.47/5.00 *
15.47/5.00 * @param e the element to insert
15.47/5.00 * @return true (as specified by {@link Deque#offerLast})
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public boolean offerLast(E e) {
15.47/5.00 addLast(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves, but does not remove, the first element of this list,
15.47/5.00 * or returns null if this list is empty.
15.47/5.00 *
15.47/5.00 * @return the first element of this list, or null
15.47/5.00 * if this list is empty
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public E peekFirst() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return getFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves, but does not remove, the last element of this list,
15.47/5.00 * or returns null if this list is empty.
15.47/5.00 *
15.47/5.00 * @return the last element of this list, or null
15.47/5.00 * if this list is empty
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public E peekLast() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return getLast();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves and removes the first element of this list,
15.47/5.00 * or returns null if this list is empty.
15.47/5.00 *
15.47/5.00 * @return the first element of this list, or null if
15.47/5.00 * this list is empty
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public E pollFirst() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return removeFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retrieves and removes the last element of this list,
15.47/5.00 * or returns null if this list is empty.
15.47/5.00 *
15.47/5.00 * @return the last element of this list, or null if
15.47/5.00 * this list is empty
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public E pollLast() {
15.47/5.00 if (size==0)
15.47/5.00 return null;
15.47/5.00 return removeLast();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Pushes an element onto the stack represented by this list. In other
15.47/5.00 * words, inserts the element at the front of this list.
15.47/5.00 *
15.47/5.00 * This method is equivalent to {@link #addFirst}.
15.47/5.00 *
15.47/5.00 * @param e the element to push
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public void push(E e) {
15.47/5.00 addFirst(e);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Pops an element from the stack represented by this list. In other
15.47/5.00 * words, removes and returns the first element of this list.
15.47/5.00 *
15.47/5.00 *
This method is equivalent to {@link #removeFirst()}.
15.47/5.00 *
15.47/5.00 * @return the element at the front of this list (which is the top
15.47/5.00 * of the stack represented by this list)
15.47/5.00 * @throws NoSuchElementException if this list is empty
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public E pop() {
15.47/5.00 return removeFirst();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the first occurrence of the specified element in this
15.47/5.00 * list (when traversing the list from head to tail). If the list
15.47/5.00 * does not contain the element, it is unchanged.
15.47/5.00 *
15.47/5.00 * @param o element to be removed from this list, if present
15.47/5.00 * @return true if the list contained the specified element
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public boolean removeFirstOccurrence(Object o) {
15.47/5.00 return remove(o);
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the last occurrence of the specified element in this
15.47/5.00 * list (when traversing the list from head to tail). If the list
15.47/5.00 * does not contain the element, it is unchanged.
15.47/5.00 *
15.47/5.00 * @param o element to be removed from this list, if present
15.47/5.00 * @return true if the list contained the specified element
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public boolean removeLastOccurrence(Object o) {
15.47/5.00 if (o==null) {
15.47/5.00 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.00 if (e.element==null) {
15.47/5.00 remove(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 } else {
15.47/5.00 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.00 if (o.equals(e.element)) {
15.47/5.00 remove(e);
15.47/5.00 return true;
15.47/5.00 }
15.47/5.00 }
15.47/5.00 }
15.47/5.00 return false;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns a list-iterator of the elements in this list (in proper
15.47/5.00 * sequence), starting at the specified position in the list.
15.47/5.00 * Obeys the general contract of List.listIterator(int).
15.47/5.00 *
15.47/5.00 * The list-iterator is fail-fast: if the list is structurally
15.47/5.00 * modified at any time after the Iterator is created, in any way except
15.47/5.00 * through the list-iterator's own remove or add
15.47/5.00 * methods, the list-iterator will throw a
15.47/5.00 * ConcurrentModificationException. Thus, in the face of
15.47/5.00 * concurrent modification, the iterator fails quickly and cleanly, rather
15.47/5.00 * than risking arbitrary, non-deterministic behavior at an undetermined
15.47/5.00 * time in the future.
15.47/5.00 *
15.47/5.00 * @param index index of the first element to be returned from the
15.47/5.00 * list-iterator (by a call to next)
15.47/5.00 * @return a ListIterator of the elements in this list (in proper
15.47/5.00 * sequence), starting at the specified position in the list
15.47/5.00 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.00 * @see List#listIterator(int)
15.47/5.00 */
15.47/5.00 public ListIterator listIterator(int index) {
15.47/5.00 return new ListItr(index);
15.47/5.00 }
15.47/5.00
15.47/5.00 private class ListItr implements ListIterator {
15.47/5.00 private Entry lastReturned = header;
15.47/5.00 private Entry next;
15.47/5.00 private int nextIndex;
15.47/5.00 private int expectedModCount = modCount;
15.47/5.00
15.47/5.00 ListItr(int index) {
15.47/5.00 if (index < 0 || index > size)
15.47/5.00 throw new IndexOutOfBoundsException();
15.47/5.00 if (index < (size >> 1)) {
15.47/5.00 next = header.next;
15.47/5.00 for (nextIndex=0; nextIndexindex; nextIndex--)
15.47/5.00 next = next.previous;
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00 public boolean hasNext() {
15.47/5.00 return nextIndex != size;
15.47/5.00 }
15.47/5.00
15.47/5.00 public E next() {
15.47/5.00 checkForComodification();
15.47/5.00 if (nextIndex == size)
15.47/5.00 throw new NoSuchElementException();
15.47/5.00
15.47/5.00 lastReturned = next;
15.47/5.00 next = next.next;
15.47/5.00 nextIndex++;
15.47/5.00 return lastReturned.element;
15.47/5.00 }
15.47/5.00
15.47/5.00 public boolean hasPrevious() {
15.47/5.00 return nextIndex != 0;
15.47/5.00 }
15.47/5.00
15.47/5.00 public E previous() {
15.47/5.00 if (nextIndex == 0)
15.47/5.00 throw new NoSuchElementException();
15.47/5.00
15.47/5.00 lastReturned = next = next.previous;
15.47/5.00 nextIndex--;
15.47/5.00 checkForComodification();
15.47/5.00 return lastReturned.element;
15.47/5.00 }
15.47/5.00
15.47/5.00 public int nextIndex() {
15.47/5.00 return nextIndex;
15.47/5.00 }
15.47/5.00
15.47/5.00 public int previousIndex() {
15.47/5.00 return nextIndex-1;
15.47/5.00 }
15.47/5.00
15.47/5.00 public void remove() {
15.47/5.00 checkForComodification();
15.47/5.00 Entry lastNext = lastReturned.next;
15.47/5.00 try {
15.47/5.00 LinkedList.this.remove(lastReturned);
15.47/5.00 } catch (NoSuchElementException e) {
15.47/5.00 throw new IllegalStateException();
15.47/5.00 }
15.47/5.00 if (next==lastReturned)
15.47/5.00 next = lastNext;
15.47/5.00 else
15.47/5.00 nextIndex--;
15.47/5.00 lastReturned = header;
15.47/5.00 expectedModCount++;
15.47/5.00 }
15.47/5.00
15.47/5.00 public void set(E e) {
15.47/5.00 if (lastReturned == header)
15.47/5.00 throw new IllegalStateException();
15.47/5.00 checkForComodification();
15.47/5.00 lastReturned.element = e;
15.47/5.00 }
15.47/5.00
15.47/5.00 public void add(E e) {
15.47/5.00 checkForComodification();
15.47/5.00 lastReturned = header;
15.47/5.00 addBefore(e, next);
15.47/5.00 nextIndex++;
15.47/5.00 expectedModCount++;
15.47/5.00 }
15.47/5.00
15.47/5.00 final void checkForComodification() {
15.47/5.00 if (modCount != expectedModCount)
15.47/5.00 throw new ConcurrentModificationException();
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00 private static class Entry {
15.47/5.00 E element;
15.47/5.00 Entry next;
15.47/5.00 Entry previous;
15.47/5.00
15.47/5.00 Entry(E element, Entry next, Entry previous) {
15.47/5.00 this.element = element;
15.47/5.00 this.next = next;
15.47/5.00 this.previous = previous;
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00 private Entry addBefore(E e, Entry entry) {
15.47/5.00 Entry newEntry = new Entry(e, entry, entry.previous);
15.47/5.00 newEntry.previous.next = newEntry;
15.47/5.00 newEntry.next.previous = newEntry;
15.47/5.00 size++;
15.47/5.00 modCount++;
15.47/5.00 return newEntry;
15.47/5.00 }
15.47/5.00
15.47/5.00 private E remove(Entry e) {
15.47/5.00 if (e == header)
15.47/5.00 throw new NoSuchElementException();
15.47/5.00
15.47/5.00 E result = e.element;
15.47/5.00 e.previous.next = e.next;
15.47/5.00 e.next.previous = e.previous;
15.47/5.00 e.next = e.previous = null;
15.47/5.00 e.element = null;
15.47/5.00 size--;
15.47/5.00 modCount++;
15.47/5.00 return result;
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * @since 1.6
15.47/5.00 */
15.47/5.00 public Iterator descendingIterator() {
15.47/5.00 return new DescendingIterator();
15.47/5.00 }
15.47/5.00
15.47/5.00 /** Adapter to provide descending iterators via ListItr.previous */
15.47/5.00 private class DescendingIterator implements Iterator {
15.47/5.00 final ListItr itr = new ListItr(size());
15.47/5.00 public boolean hasNext() {
15.47/5.00 return itr.hasPrevious();
15.47/5.00 }
15.47/5.00 public E next() {
15.47/5.00 return itr.previous();
15.47/5.00 }
15.47/5.00 public void remove() {
15.47/5.00 itr.remove();
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns an array containing all of the elements in this list
15.47/5.00 * in proper sequence (from first to last element).
15.47/5.00 *
15.47/5.00 * The returned array will be "safe" in that no references to it are
15.47/5.00 * maintained by this list. (In other words, this method must allocate
15.47/5.00 * a new array). The caller is thus free to modify the returned array.
15.47/5.00 *
15.47/5.00 *
This method acts as bridge between array-based and collection-based
15.47/5.00 * APIs.
15.47/5.00 *
15.47/5.00 * @return an array containing all of the elements in this list
15.47/5.00 * in proper sequence
15.47/5.00 */
15.47/5.00 public Object[] toArray() {
15.47/5.00 Object[] result = new Object[size];
15.47/5.00 int i = 0;
15.47/5.00 for (Entry e = header.next; e != header; e = e.next)
15.47/5.00 result[i++] = e.element;
15.47/5.00 return result;
15.47/5.00 }
15.47/5.00
15.47/5.00 private static final long serialVersionUID = 876323262645176354L;
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * An iterator for lists that allows the programmer
15.47/5.00 * to traverse the list in either direction, modify
15.47/5.00 * the list during iteration, and obtain the iterator's
15.47/5.00 * current position in the list. A {@code ListIterator}
15.47/5.00 * has no current element; its cursor position always
15.47/5.00 * lies between the element that would be returned by a call
15.47/5.00 * to {@code previous()} and the element that would be
15.47/5.00 * returned by a call to {@code next()}.
15.47/5.00 * An iterator for a list of length {@code n} has {@code n+1} possible
15.47/5.00 * cursor positions, as illustrated by the carets ({@code ^}) below:
15.47/5.00 *
15.47/5.00 * Element(0) Element(1) Element(2) ... Element(n-1)
15.47/5.00 * cursor positions: ^ ^ ^ ^ ^
15.47/5.00 *
15.47/5.00 * Note that the {@link #remove} and {@link #set(Object)} methods are
15.47/5.00 * not defined in terms of the cursor position; they are defined to
15.47/5.00 * operate on the last element returned by a call to {@link #next} or
15.47/5.00 * {@link #previous()}.
15.47/5.00 *
15.47/5.00 * This interface is a member of the
15.47/5.00 *
15.47/5.00 * Java Collections Framework.
15.47/5.00 *
15.47/5.00 * @author Josh Bloch
15.47/5.00 * @see Collection
15.47/5.00 * @see List
15.47/5.00 * @see Iterator
15.47/5.00 * @see Enumeration
15.47/5.00 * @see List#listIterator()
15.47/5.00 * @since 1.2
15.47/5.00 */
15.47/5.00 public interface ListIterator extends Iterator {
15.47/5.00 // Query Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns {@code true} if this list iterator has more elements when
15.47/5.00 * traversing the list in the forward direction. (In other words,
15.47/5.00 * returns {@code true} if {@link #next} would return an element rather
15.47/5.00 * than throwing an exception.)
15.47/5.00 *
15.47/5.00 * @return {@code true} if the list iterator has more elements when
15.47/5.00 * traversing the list in the forward direction
15.47/5.00 */
15.47/5.00 boolean hasNext();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the next element in the list and advances the cursor position.
15.47/5.00 * This method may be called repeatedly to iterate through the list,
15.47/5.00 * or intermixed with calls to {@link #previous} to go back and forth.
15.47/5.00 * (Note that alternating calls to {@code next} and {@code previous}
15.47/5.00 * will return the same element repeatedly.)
15.47/5.00 *
15.47/5.00 * @return the next element in the list
15.47/5.00 * @throws NoSuchElementException if the iteration has no next element
15.47/5.00 */
15.47/5.00 E next();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns {@code true} if this list iterator has more elements when
15.47/5.00 * traversing the list in the reverse direction. (In other words,
15.47/5.00 * returns {@code true} if {@link #previous} would return an element
15.47/5.00 * rather than throwing an exception.)
15.47/5.00 *
15.47/5.00 * @return {@code true} if the list iterator has more elements when
15.47/5.00 * traversing the list in the reverse direction
15.47/5.00 */
15.47/5.00 boolean hasPrevious();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the previous element in the list and moves the cursor
15.47/5.00 * position backwards. This method may be called repeatedly to
15.47/5.00 * iterate through the list backwards, or intermixed with calls to
15.47/5.00 * {@link #next} to go back and forth. (Note that alternating calls
15.47/5.00 * to {@code next} and {@code previous} will return the same
15.47/5.00 * element repeatedly.)
15.47/5.00 *
15.47/5.00 * @return the previous element in the list
15.47/5.00 * @throws NoSuchElementException if the iteration has no previous
15.47/5.00 * element
15.47/5.00 */
15.47/5.00 E previous();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the element that would be returned by a
15.47/5.00 * subsequent call to {@link #next}. (Returns list size if the list
15.47/5.00 * iterator is at the end of the list.)
15.47/5.00 *
15.47/5.00 * @return the index of the element that would be returned by a
15.47/5.00 * subsequent call to {@code next}, or list size if the list
15.47/5.00 * iterator is at the end of the list
15.47/5.00 */
15.47/5.00 int nextIndex();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the element that would be returned by a
15.47/5.00 * subsequent call to {@link #previous}. (Returns -1 if the list
15.47/5.00 * iterator is at the beginning of the list.)
15.47/5.00 *
15.47/5.00 * @return the index of the element that would be returned by a
15.47/5.00 * subsequent call to {@code previous}, or -1 if the list
15.47/5.00 * iterator is at the beginning of the list
15.47/5.00 */
15.47/5.00 int previousIndex();
15.47/5.00
15.47/5.00
15.47/5.00 // Modification Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes from the list the last element that was returned by {@link
15.47/5.00 * #next} or {@link #previous} (optional operation). This call can
15.47/5.00 * only be made once per call to {@code next} or {@code previous}.
15.47/5.00 * It can be made only if {@link #add} has not been
15.47/5.00 * called after the last call to {@code next} or {@code previous}.
15.47/5.00 *
15.47/5.00 * @throws UnsupportedOperationException if the {@code remove}
15.47/5.00 * operation is not supported by this list iterator
15.47/5.00 * @throws IllegalStateException if neither {@code next} nor
15.47/5.00 * {@code previous} have been called, or {@code remove} or
15.47/5.00 * {@code add} have been called after the last call to
15.47/5.00 * {@code next} or {@code previous}
15.47/5.00 */
15.47/5.00 void remove();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Replaces the last element returned by {@link #next} or
15.47/5.00 * {@link #previous} with the specified element (optional operation).
15.47/5.00 * This call can be made only if neither {@link #remove} nor {@link
15.47/5.00 * #add} have been called after the last call to {@code next} or
15.47/5.00 * {@code previous}.
15.47/5.00 *
15.47/5.00 * @param e the element with which to replace the last element returned by
15.47/5.00 * {@code next} or {@code previous}
15.47/5.00 * @throws UnsupportedOperationException if the {@code set} operation
15.47/5.00 * is not supported by this list iterator
15.47/5.00 * @throws ClassCastException if the class of the specified element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 * @throws IllegalArgumentException if some aspect of the specified
15.47/5.00 * element prevents it from being added to this list
15.47/5.00 * @throws IllegalStateException if neither {@code next} nor
15.47/5.00 * {@code previous} have been called, or {@code remove} or
15.47/5.00 * {@code add} have been called after the last call to
15.47/5.00 * {@code next} or {@code previous}
15.47/5.00 */
15.47/5.00 void set(E e);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts the specified element into the list (optional operation).
15.47/5.00 * The element is inserted immediately before the next element that
15.47/5.00 * would be returned by {@link #next}, if any, and after the next
15.47/5.00 * element that would be returned by {@link #previous}, if any. (If the
15.47/5.00 * list contains no elements, the new element becomes the sole element
15.47/5.00 * on the list.) The new element is inserted before the implicit
15.47/5.00 * cursor: a subsequent call to {@code next} would be unaffected, and a
15.47/5.00 * subsequent call to {@code previous} would return the new element.
15.47/5.00 * (This call increases by one the value that would be returned by a
15.47/5.00 * call to {@code nextIndex} or {@code previousIndex}.)
15.47/5.00 *
15.47/5.00 * @param e the element to insert
15.47/5.00 * @throws UnsupportedOperationException if the {@code add} method is
15.47/5.00 * not supported by this list iterator
15.47/5.00 * @throws ClassCastException if the class of the specified element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 * @throws IllegalArgumentException if some aspect of this element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 */
15.47/5.00 void add(E e);
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * An ordered collection (also known as a sequence). The user of this
15.47/5.00 * interface has precise control over where in the list each element is
15.47/5.00 * inserted. The user can access elements by their integer index (position in
15.47/5.00 * the list), and search for elements in the list.
15.47/5.00 *
15.47/5.00 * Unlike sets, lists typically allow duplicate elements. More formally,
15.47/5.00 * lists typically allow pairs of elements e1 and e2
15.47/5.00 * such that e1.equals(e2), and they typically allow multiple
15.47/5.00 * null elements if they allow null elements at all. It is not inconceivable
15.47/5.00 * that someone might wish to implement a list that prohibits duplicates, by
15.47/5.00 * throwing runtime exceptions when the user attempts to insert them, but we
15.47/5.00 * expect this usage to be rare.
15.47/5.00 *
15.47/5.00 * The List interface places additional stipulations, beyond those
15.47/5.00 * specified in the Collection interface, on the contracts of the
15.47/5.00 * iterator, add, remove, equals, and
15.47/5.00 * hashCode methods. Declarations for other inherited methods are
15.47/5.00 * also included here for convenience.
15.47/5.00 *
15.47/5.00 * The List interface provides four methods for positional (indexed)
15.47/5.00 * access to list elements. Lists (like Java arrays) are zero based. Note
15.47/5.00 * that these operations may execute in time proportional to the index value
15.47/5.00 * for some implementations (the LinkedList class, for
15.47/5.00 * example). Thus, iterating over the elements in a list is typically
15.47/5.00 * preferable to indexing through it if the caller does not know the
15.47/5.00 * implementation.
15.47/5.00 *
15.47/5.00 * The List interface provides a special iterator, called a
15.47/5.00 * ListIterator, that allows element insertion and replacement, and
15.47/5.00 * bidirectional access in addition to the normal operations that the
15.47/5.00 * Iterator interface provides. A method is provided to obtain a
15.47/5.00 * list iterator that starts at a specified position in the list.
15.47/5.00 *
15.47/5.00 * The List interface provides two methods to search for a specified
15.47/5.00 * object. From a performance standpoint, these methods should be used with
15.47/5.00 * caution. In many implementations they will perform costly linear
15.47/5.00 * searches.
15.47/5.00 *
15.47/5.00 * The List interface provides two methods to efficiently insert and
15.47/5.00 * remove multiple elements at an arbitrary point in the list.
15.47/5.00 *
15.47/5.00 * Note: While it is permissible for lists to contain themselves as elements,
15.47/5.00 * extreme caution is advised: the equals and hashCode
15.47/5.00 * methods are no longer well defined on such a list.
15.47/5.00 *
15.47/5.00 *
Some list implementations have restrictions on the elements that
15.47/5.00 * they may contain. For example, some implementations prohibit null elements,
15.47/5.00 * and some have restrictions on the types of their elements. Attempting to
15.47/5.00 * add an ineligible element throws an unchecked exception, typically
15.47/5.00 * NullPointerException or ClassCastException. Attempting
15.47/5.00 * to query the presence of an ineligible element may throw an exception,
15.47/5.00 * or it may simply return false; some implementations will exhibit the former
15.47/5.00 * behavior and some will exhibit the latter. More generally, attempting an
15.47/5.00 * operation on an ineligible element whose completion would not result in
15.47/5.00 * the insertion of an ineligible element into the list may throw an
15.47/5.00 * exception or it may succeed, at the option of the implementation.
15.47/5.00 * Such exceptions are marked as "optional" in the specification for this
15.47/5.00 * interface.
15.47/5.00 *
15.47/5.00 *
This interface is a member of the
15.47/5.00 *
15.47/5.00 * Java Collections Framework.
15.47/5.00 *
15.47/5.00 * @author Josh Bloch
15.47/5.00 * @author Neal Gafter
15.47/5.00 * @see Collection
15.47/5.00 * @see Set
15.47/5.00 * @see ArrayList
15.47/5.00 * @see LinkedList
15.47/5.00 * @see Vector
15.47/5.00 * @see Arrays#asList(Object[])
15.47/5.00 * @see Collections#nCopies(int, Object)
15.47/5.00 * @see Collections#EMPTY_LIST
15.47/5.00 * @see AbstractList
15.47/5.00 * @see AbstractSequentialList
15.47/5.00 * @since 1.2
15.47/5.00 */
15.47/5.00
15.47/5.00 public interface List extends Collection {
15.47/5.00 // Query Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the number of elements in this list. If this list contains
15.47/5.00 * more than Integer.MAX_VALUE elements, returns
15.47/5.00 * Integer.MAX_VALUE.
15.47/5.00 *
15.47/5.00 * @return the number of elements in this list
15.47/5.00 */
15.47/5.00 int size();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns true if this list contains no elements.
15.47/5.00 *
15.47/5.00 * @return true if this list contains no elements
15.47/5.00 */
15.47/5.00 boolean isEmpty();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns true if this list contains the specified element.
15.47/5.00 * More formally, returns true if and only if this list contains
15.47/5.00 * at least one element e such that
15.47/5.00 * (o==null ? e==null : o.equals(e)).
15.47/5.00 *
15.47/5.00 * @param o element whose presence in this list is to be tested
15.47/5.00 * @return true if this list contains the specified element
15.47/5.00 * @throws ClassCastException if the type of the specified element
15.47/5.00 * is incompatible with this list (optional)
15.47/5.00 * @throws NullPointerException if the specified element is null and this
15.47/5.00 * list does not permit null elements (optional)
15.47/5.00 */
15.47/5.00 boolean contains(Object o);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns an iterator over the elements in this list in proper sequence.
15.47/5.00 *
15.47/5.00 * @return an iterator over the elements in this list in proper sequence
15.47/5.00 */
15.47/5.00 Iterator iterator();
15.47/5.00
15.47/5.00 // Modification Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Appends the specified element to the end of this list (optional
15.47/5.00 * operation).
15.47/5.00 *
15.47/5.00 * Lists that support this operation may place limitations on what
15.47/5.00 * elements may be added to this list. In particular, some
15.47/5.00 * lists will refuse to add null elements, and others will impose
15.47/5.00 * restrictions on the type of elements that may be added. List
15.47/5.00 * classes should clearly specify in their documentation any restrictions
15.47/5.00 * on what elements may be added.
15.47/5.00 *
15.47/5.00 * @param e element to be appended to this list
15.47/5.00 * @return true (as specified by {@link Collection#add})
15.47/5.00 * @throws UnsupportedOperationException if the add operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of the specified element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 * @throws NullPointerException if the specified element is null and this
15.47/5.00 * list does not permit null elements
15.47/5.00 * @throws IllegalArgumentException if some property of this element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 */
15.47/5.00 boolean add(E e);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the first occurrence of the specified element from this list,
15.47/5.00 * if it is present (optional operation). If this list does not contain
15.47/5.00 * the element, it is unchanged. More formally, removes the element with
15.47/5.00 * the lowest index i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i)))
15.47/5.00 * (if such an element exists). Returns true if this list
15.47/5.00 * contained the specified element (or equivalently, if this list changed
15.47/5.00 * as a result of the call).
15.47/5.00 *
15.47/5.00 * @param o element to be removed from this list, if present
15.47/5.00 * @return true if this list contained the specified element
15.47/5.00 * @throws ClassCastException if the type of the specified element
15.47/5.00 * is incompatible with this list (optional)
15.47/5.00 * @throws NullPointerException if the specified element is null and this
15.47/5.00 * list does not permit null elements (optional)
15.47/5.00 * @throws UnsupportedOperationException if the remove operation
15.47/5.00 * is not supported by this list
15.47/5.00 */
15.47/5.00 boolean remove(Object o);
15.47/5.00
15.47/5.00
15.47/5.00 // Bulk Modification Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns true if this list contains all of the elements of the
15.47/5.00 * specified collection.
15.47/5.00 *
15.47/5.00 * @param c collection to be checked for containment in this list
15.47/5.00 * @return true if this list contains all of the elements of the
15.47/5.00 * specified collection
15.47/5.00 * @throws ClassCastException if the types of one or more elements
15.47/5.00 * in the specified collection are incompatible with this
15.47/5.00 * list (optional)
15.47/5.00 * @throws NullPointerException if the specified collection contains one
15.47/5.00 * or more null elements and this list does not permit null
15.47/5.00 * elements (optional), or if the specified collection is null
15.47/5.00 * @see #contains(Object)
15.47/5.00 */
15.47/5.00 boolean containsAll(Collection c);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Appends all of the elements in the specified collection to the end of
15.47/5.00 * this list, in the order that they are returned by the specified
15.47/5.00 * collection's iterator (optional operation). The behavior of this
15.47/5.00 * operation is undefined if the specified collection is modified while
15.47/5.00 * the operation is in progress. (Note that this will occur if the
15.47/5.00 * specified collection is this list, and it's nonempty.)
15.47/5.00 *
15.47/5.00 * @param c collection containing elements to be added to this list
15.47/5.00 * @return true if this list changed as a result of the call
15.47/5.00 * @throws UnsupportedOperationException if the addAll operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of an element of the specified
15.47/5.00 * collection prevents it from being added to this list
15.47/5.00 * @throws NullPointerException if the specified collection contains one
15.47/5.00 * or more null elements and this list does not permit null
15.47/5.00 * elements, or if the specified collection is null
15.47/5.00 * @throws IllegalArgumentException if some property of an element of the
15.47/5.00 * specified collection prevents it from being added to this list
15.47/5.00 * @see #add(Object)
15.47/5.00 */
15.47/5.00 boolean addAll(Collection c);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts all of the elements in the specified collection into this
15.47/5.00 * list at the specified position (optional operation). Shifts the
15.47/5.00 * element currently at that position (if any) and any subsequent
15.47/5.00 * elements to the right (increases their indices). The new elements
15.47/5.00 * will appear in this list in the order that they are returned by the
15.47/5.00 * specified collection's iterator. The behavior of this operation is
15.47/5.00 * undefined if the specified collection is modified while the
15.47/5.00 * operation is in progress. (Note that this will occur if the specified
15.47/5.00 * collection is this list, and it's nonempty.)
15.47/5.00 *
15.47/5.00 * @param index index at which to insert the first element from the
15.47/5.00 * specified collection
15.47/5.00 * @param c collection containing elements to be added to this list
15.47/5.00 * @return true if this list changed as a result of the call
15.47/5.00 * @throws UnsupportedOperationException if the addAll operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of an element of the specified
15.47/5.00 * collection prevents it from being added to this list
15.47/5.00 * @throws NullPointerException if the specified collection contains one
15.47/5.00 * or more null elements and this list does not permit null
15.47/5.00 * elements, or if the specified collection is null
15.47/5.00 * @throws IllegalArgumentException if some property of an element of the
15.47/5.00 * specified collection prevents it from being added to this list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * (index < 0 || index > size())
15.47/5.00 */
15.47/5.00 boolean addAll(int index, Collection c);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes from this list all of its elements that are contained in the
15.47/5.00 * specified collection (optional operation).
15.47/5.00 *
15.47/5.00 * @param c collection containing elements to be removed from this list
15.47/5.00 * @return true if this list changed as a result of the call
15.47/5.00 * @throws UnsupportedOperationException if the removeAll operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of an element of this list
15.47/5.00 * is incompatible with the specified collection (optional)
15.47/5.00 * @throws NullPointerException if this list contains a null element and the
15.47/5.00 * specified collection does not permit null elements (optional),
15.47/5.00 * or if the specified collection is null
15.47/5.00 * @see #remove(Object)
15.47/5.00 * @see #contains(Object)
15.47/5.00 */
15.47/5.00 boolean removeAll(Collection c);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Retains only the elements in this list that are contained in the
15.47/5.00 * specified collection (optional operation). In other words, removes
15.47/5.00 * from this list all of its elements that are not contained in the
15.47/5.00 * specified collection.
15.47/5.00 *
15.47/5.00 * @param c collection containing elements to be retained in this list
15.47/5.00 * @return true if this list changed as a result of the call
15.47/5.00 * @throws UnsupportedOperationException if the retainAll operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of an element of this list
15.47/5.00 * is incompatible with the specified collection (optional)
15.47/5.00 * @throws NullPointerException if this list contains a null element and the
15.47/5.00 * specified collection does not permit null elements (optional),
15.47/5.00 * or if the specified collection is null
15.47/5.00 * @see #remove(Object)
15.47/5.00 * @see #contains(Object)
15.47/5.00 */
15.47/5.00 boolean retainAll(Collection c);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes all of the elements from this list (optional operation).
15.47/5.00 * The list will be empty after this call returns.
15.47/5.00 *
15.47/5.00 * @throws UnsupportedOperationException if the clear operation
15.47/5.00 * is not supported by this list
15.47/5.00 */
15.47/5.00 void clear();
15.47/5.00
15.47/5.00
15.47/5.00 // Comparison and hashing
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Compares the specified object with this list for equality. Returns
15.47/5.00 * true if and only if the specified object is also a list, both
15.47/5.00 * lists have the same size, and all corresponding pairs of elements in
15.47/5.00 * the two lists are equal. (Two elements e1 and
15.47/5.00 * e2 are equal if (e1==null ? e2==null :
15.47/5.00 * e1.equals(e2)).) In other words, two lists are defined to be
15.47/5.00 * equal if they contain the same elements in the same order. This
15.47/5.00 * definition ensures that the equals method works properly across
15.47/5.00 * different implementations of the List interface.
15.47/5.00 *
15.47/5.00 * @param o the object to be compared for equality with this list
15.47/5.00 * @return true if the specified object is equal to this list
15.47/5.00 */
15.47/5.00 boolean equals(Object o);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the hash code value for this list. The hash code of a list
15.47/5.00 * is defined to be the result of the following calculation:
15.47/5.00 *
15.47/5.00 * int hashCode = 1;
15.47/5.00 * for (E e : list)
15.47/5.00 * hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());
15.47/5.00 *
15.47/5.00 * This ensures that list1.equals(list2) implies that
15.47/5.00 * list1.hashCode()==list2.hashCode() for any two lists,
15.47/5.00 * list1 and list2, as required by the general
15.47/5.00 * contract of {@link Object#hashCode}.
15.47/5.00 *
15.47/5.00 * @return the hash code value for this list
15.47/5.00 * @see Object#equals(Object)
15.47/5.00 * @see #equals(Object)
15.47/5.00 */
15.47/5.00 int hashCode();
15.47/5.00
15.47/5.00
15.47/5.00 // Positional Access Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the element at the specified position in this list.
15.47/5.00 *
15.47/5.00 * @param index index of the element to return
15.47/5.00 * @return the element at the specified position in this list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * (index < 0 || index >= size())
15.47/5.00 */
15.47/5.00 E get(int index);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Replaces the element at the specified position in this list with the
15.47/5.00 * specified element (optional operation).
15.47/5.00 *
15.47/5.00 * @param index index of the element to replace
15.47/5.00 * @param element element to be stored at the specified position
15.47/5.00 * @return the element previously at the specified position
15.47/5.00 * @throws UnsupportedOperationException if the set operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of the specified element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 * @throws NullPointerException if the specified element is null and
15.47/5.00 * this list does not permit null elements
15.47/5.00 * @throws IllegalArgumentException if some property of the specified
15.47/5.00 * element prevents it from being added to this list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * (index < 0 || index >= size())
15.47/5.00 */
15.47/5.00 E set(int index, E element);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Inserts the specified element at the specified position in this list
15.47/5.00 * (optional operation). Shifts the element currently at that position
15.47/5.00 * (if any) and any subsequent elements to the right (adds one to their
15.47/5.00 * indices).
15.47/5.00 *
15.47/5.00 * @param index index at which the specified element is to be inserted
15.47/5.00 * @param element element to be inserted
15.47/5.00 * @throws UnsupportedOperationException if the add operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws ClassCastException if the class of the specified element
15.47/5.00 * prevents it from being added to this list
15.47/5.00 * @throws NullPointerException if the specified element is null and
15.47/5.00 * this list does not permit null elements
15.47/5.00 * @throws IllegalArgumentException if some property of the specified
15.47/5.00 * element prevents it from being added to this list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * (index < 0 || index > size())
15.47/5.00 */
15.47/5.00 void add(int index, E element);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Removes the element at the specified position in this list (optional
15.47/5.00 * operation). Shifts any subsequent elements to the left (subtracts one
15.47/5.00 * from their indices). Returns the element that was removed from the
15.47/5.00 * list.
15.47/5.00 *
15.47/5.00 * @param index the index of the element to be removed
15.47/5.00 * @return the element previously at the specified position
15.47/5.00 * @throws UnsupportedOperationException if the remove operation
15.47/5.00 * is not supported by this list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * (index < 0 || index >= size())
15.47/5.00 */
15.47/5.00 E remove(int index);
15.47/5.00
15.47/5.00
15.47/5.00 // Search Operations
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the first occurrence of the specified element
15.47/5.00 * in this list, or -1 if this list does not contain the element.
15.47/5.00 * More formally, returns the lowest index i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.00 * or -1 if there is no such index.
15.47/5.00 *
15.47/5.00 * @param o element to search for
15.47/5.00 * @return the index of the first occurrence of the specified element in
15.47/5.00 * this list, or -1 if this list does not contain the element
15.47/5.00 * @throws ClassCastException if the type of the specified element
15.47/5.00 * is incompatible with this list (optional)
15.47/5.00 * @throws NullPointerException if the specified element is null and this
15.47/5.00 * list does not permit null elements (optional)
15.47/5.00 */
15.47/5.00 int indexOf(Object o);
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns the index of the last occurrence of the specified element
15.47/5.00 * in this list, or -1 if this list does not contain the element.
15.47/5.00 * More formally, returns the highest index i such that
15.47/5.00 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.00 * or -1 if there is no such index.
15.47/5.00 *
15.47/5.00 * @param o element to search for
15.47/5.00 * @return the index of the last occurrence of the specified element in
15.47/5.00 * this list, or -1 if this list does not contain the element
15.47/5.00 * @throws ClassCastException if the type of the specified element
15.47/5.00 * is incompatible with this list (optional)
15.47/5.00 * @throws NullPointerException if the specified element is null and this
15.47/5.00 * list does not permit null elements (optional)
15.47/5.00 */
15.47/5.00 int lastIndexOf(Object o);
15.47/5.00
15.47/5.00
15.47/5.00 // List Iterators
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns a list iterator over the elements in this list (in proper
15.47/5.00 * sequence).
15.47/5.00 *
15.47/5.00 * @return a list iterator over the elements in this list (in proper
15.47/5.00 * sequence)
15.47/5.00 */
15.47/5.00 ListIterator listIterator();
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns a list iterator over the elements in this list (in proper
15.47/5.00 * sequence), starting at the specified position in the list.
15.47/5.00 * The specified index indicates the first element that would be
15.47/5.00 * returned by an initial call to {@link ListIterator#next next}.
15.47/5.00 * An initial call to {@link ListIterator#previous previous} would
15.47/5.00 * return the element with the specified index minus one.
15.47/5.00 *
15.47/5.00 * @param index index of the first element to be returned from the
15.47/5.00 * list iterator (by a call to {@link ListIterator#next next})
15.47/5.00 * @return a list iterator over the elements in this list (in proper
15.47/5.00 * sequence), starting at the specified position in the list
15.47/5.00 * @throws IndexOutOfBoundsException if the index is out of range
15.47/5.00 * ({@code index < 0 || index > size()})
15.47/5.00 */
15.47/5.00 ListIterator listIterator(int index);
15.47/5.00
15.47/5.00 // View
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Returns a view of the portion of this list between the specified
15.47/5.00 * fromIndex, inclusive, and toIndex, exclusive. (If
15.47/5.00 * fromIndex and toIndex are equal, the returned list is
15.47/5.00 * empty.) The returned list is backed by this list, so non-structural
15.47/5.00 * changes in the returned list are reflected in this list, and vice-versa.
15.47/5.00 * The returned list supports all of the optional list operations supported
15.47/5.00 * by this list.
15.47/5.00 *
15.47/5.00 * This method eliminates the need for explicit range operations (of
15.47/5.00 * the sort that commonly exist for arrays). Any operation that expects
15.47/5.00 * a list can be used as a range operation by passing a subList view
15.47/5.00 * instead of a whole list. For example, the following idiom
15.47/5.00 * removes a range of elements from a list:
15.47/5.00 *
15.47/5.00 * list.subList(from, to).clear();
15.47/5.00 *
15.47/5.00 * Similar idioms may be constructed for indexOf and
15.47/5.00 * lastIndexOf, and all of the algorithms in the
15.47/5.00 * Collections class can be applied to a subList.
15.47/5.00 *
15.47/5.00 * The semantics of the list returned by this method become undefined if
15.47/5.00 * the backing list (i.e., this list) is structurally modified in
15.47/5.00 * any way other than via the returned list. (Structural modifications are
15.47/5.00 * those that change the size of this list, or otherwise perturb it in such
15.47/5.00 * a fashion that iterations in progress may yield incorrect results.)
15.47/5.00 *
15.47/5.00 * @param fromIndex low endpoint (inclusive) of the subList
15.47/5.00 * @param toIndex high endpoint (exclusive) of the subList
15.47/5.00 * @return a view of the specified range within this list
15.47/5.00 * @throws IndexOutOfBoundsException for an illegal endpoint index value
15.47/5.00 * (fromIndex < 0 || toIndex > size ||
15.47/5.00 * fromIndex > toIndex)
15.47/5.00 */
15.47/5.00 List subList(int fromIndex, int toIndex);
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Thrown by the nextElement method of an
15.47/5.00 * Enumeration to indicate that there are no more
15.47/5.00 * elements in the enumeration.
15.47/5.00 *
15.47/5.00 * @author unascribed
15.47/5.00 * @see java.util.Enumeration
15.47/5.00 * @see java.util.Enumeration#nextElement()
15.47/5.00 * @since JDK1.0
15.47/5.00 */
15.47/5.00 public
15.47/5.00 class NoSuchElementException extends RuntimeException {
15.47/5.00 /**
15.47/5.00 * Constructs a NoSuchElementException with null
15.47/5.00 * as its error message string.
15.47/5.00 */
15.47/5.00 public NoSuchElementException() {
15.47/5.00 super();
15.47/5.00 }
15.47/5.00
15.47/5.00 /**
15.47/5.00 * Constructs a NoSuchElementException, saving a reference
15.47/5.00 * to the error message string s for later retrieval by the
15.47/5.00 * getMessage method.
15.47/5.00 *
15.47/5.00 * @param s the detail message.
15.47/5.00 */
15.47/5.00 public NoSuchElementException(String s) {
15.47/5.00 super(s);
15.47/5.00 }
15.47/5.00 }
15.47/5.00
15.47/5.00
15.47/5.00 /*
15.47/5.00 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.00 *
15.47/5.00 * This code is free software; you can redistribute it and/or modify it
15.47/5.00 * under the terms of the GNU General Public License version 2 only, as
15.47/5.00 * published by the Free Software Foundation. Sun designates this
15.47/5.00 * particular file as subject to the "Classpath" exception as provided
15.47/5.00 * by Sun in the LICENSE file that accompanied this code.
15.47/5.00 *
15.47/5.00 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.00 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.00 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.00 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.00 * accompanied this code).
15.47/5.00 *
15.47/5.00 * You should have received a copy of the GNU General Public License version
15.47/5.00 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.00 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.00 *
15.47/5.00 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.00 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.00 * have any questions.
15.47/5.00 */
15.47/5.00
15.47/5.00 /*
15.47/5.00 * This file is available under and governed by the GNU General Public
15.47/5.00 * License version 2 only, as published by the Free Software Foundation.
15.47/5.00 * However, the following notice accompanied the original version of this
15.47/5.00 * file:
15.47/5.00 *
15.47/5.00 * Written by Doug Lea with assistance from members of JCP JSR-166
15.47/5.00 * Expert Group and released to the public domain, as explained at
15.47/5.00 * http://creativecommons.org/licenses/publicdomain
15.47/5.00 */
15.47/5.00
15.47/5.00 package javaUtilEx;
15.47/5.00
15.47/5.00 /**
15.47/5.00 * A collection designed for holding elements prior to processing.
15.47/5.00 * Besides basic {@link java.util.Collection Collection} operations,
15.47/5.00 * queues provide additional insertion, extraction, and inspection
15.47/5.00 * operations. Each of these methods exists in two forms: one throws
15.47/5.00 * an exception if the operation fails, the other returns a special
15.47/5.00 * value (either null or false, depending on the
15.47/5.00 * operation). The latter form of the insert operation is designed
15.47/5.00 * specifically for use with capacity-restricted Queue
15.47/5.00 * implementations; in most implementations, insert operations cannot
15.47/5.00 * fail.
15.47/5.00 *
15.47/5.00 *
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * |
15.47/5.00 * Throws exception |
15.47/5.00 * Returns special value |
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * | Insert |
15.47/5.00 * {@link #add add(e)} |
15.47/5.00 * {@link #offer offer(e)} |
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * | Remove |
15.47/5.00 * {@link #remove remove()} |
15.47/5.00 * {@link #poll poll()} |
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * | Examine |
15.47/5.00 * {@link #element element()} |
15.47/5.00 * {@link #peek peek()} |
15.47/5.00 *
15.47/5.00 *
15.47/5.00 *
15.47/5.00 * Queues typically, but do not necessarily, order elements in a
15.47/5.00 * FIFO (first-in-first-out) manner. Among the exceptions are
15.47/5.00 * priority queues, which order elements according to a supplied
15.47/5.00 * comparator, or the elements' natural ordering, and LIFO queues (or
15.47/5.00 * stacks) which order the elements LIFO (last-in-first-out).
15.47/5.00 * Whatever the ordering used, the head of the queue is that
15.47/5.00 * element which would be removed by a call to {@link #remove() } or
15.47/5.00 * {@link #poll()}. In a FIFO queue, all new elements are inserted at
15.47/5.00 * the tail of the queue. Other kinds of queues may use
15.47/5.00 * different placement rules. Every Queue implementation
15.47/5.00 * must specify its ordering properties.
15.47/5.00 *
15.47/5.00 *
The {@link #offer offer} method inserts an element if possible,
15.47/5.00 * otherwise returning false. This differs from the {@link
15.47/5.00 * java.util.Collection#add Collection.add} method, which can fail to
15.47/5.00 * add an element only by throwing an unchecked exception. The
15.47/5.00 * offer method is designed for use when failure is a normal,
15.47/5.00 * rather than exceptional occurrence, for example, in fixed-capacity
15.47/5.00 * (or "bounded") queues.
15.47/5.00 *
15.47/5.00 *
The {@link #remove()} and {@link #poll()} methods remove and
15.47/5.00 * return the head of the queue.
15.47/5.00 * Exactly which element is removed from the queue is a
15.47/5.00 * function of the queue's ordering policy, which differs from
15.47/5.00 * implementation to implementation. The remove() and
15.47/5.00 * poll() methods differ only in their behavior when the
15.47/5.00 * queue is empty: the remove() method throws an exception,
15.47/5.00 * while the poll() method returns null.
15.47/5.00 *
15.47/5.00 *
The {@link #element()} and {@link #peek()} methods return, but do
15.47/5.00 * not remove, the head of the queue.
15.47/5.00 *
15.47/5.00 *
The Queue interface does not define the blocking queue
15.47/5.00 * methods, which are common in concurrent programming. These methods,
15.47/5.00 * which wait for elements to appear or for space to become available, are
15.47/5.00 * defined in the {@link java.util.concurrent.BlockingQueue} interface, which
15.47/5.01 * extends this interface.
15.47/5.01 *
15.47/5.01 *
Queue implementations generally do not allow insertion
15.47/5.01 * of null elements, although some implementations, such as
15.47/5.01 * {@link LinkedList}, do not prohibit insertion of null.
15.47/5.01 * Even in the implementations that permit it, null should
15.47/5.01 * not be inserted into a Queue, as null is also
15.47/5.01 * used as a special return value by the poll method to
15.47/5.01 * indicate that the queue contains no elements.
15.47/5.01 *
15.47/5.01 *
Queue implementations generally do not define
15.47/5.01 * element-based versions of methods equals and
15.47/5.01 * hashCode but instead inherit the identity based versions
15.47/5.01 * from class Object, because element-based equality is not
15.47/5.01 * always well-defined for queues with the same elements but different
15.47/5.01 * ordering properties.
15.47/5.01 *
15.47/5.01 *
15.47/5.01 *
This interface is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @see java.util.Collection
15.47/5.01 * @see LinkedList
15.47/5.01 * @see PriorityQueue
15.47/5.01 * @see java.util.concurrent.LinkedBlockingQueue
15.47/5.01 * @see java.util.concurrent.BlockingQueue
15.47/5.01 * @see java.util.concurrent.ArrayBlockingQueue
15.47/5.01 * @see java.util.concurrent.LinkedBlockingQueue
15.47/5.01 * @see java.util.concurrent.PriorityBlockingQueue
15.47/5.01 * @since 1.5
15.47/5.01 * @author Doug Lea
15.47/5.01 * @param the type of elements held in this collection
15.47/5.01 */
15.47/5.01 public interface Queue extends Collection {
15.47/5.01 /**
15.47/5.01 * Inserts the specified element into this queue if it is possible to do so
15.47/5.01 * immediately without violating capacity restrictions, returning
15.47/5.01 * true upon success and throwing an IllegalStateException
15.47/5.01 * if no space is currently available.
15.47/5.01 *
15.47/5.01 * @param e the element to add
15.47/5.01 * @return true (as specified by {@link Collection#add})
15.47/5.01 * @throws IllegalStateException if the element cannot be added at this
15.47/5.01 * time due to capacity restrictions
15.47/5.01 * @throws ClassCastException if the class of the specified element
15.47/5.01 * prevents it from being added to this queue
15.47/5.01 * @throws NullPointerException if the specified element is null and
15.47/5.01 * this queue does not permit null elements
15.47/5.01 * @throws IllegalArgumentException if some property of this element
15.47/5.01 * prevents it from being added to this queue
15.47/5.01 */
15.47/5.01 boolean add(E e);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Inserts the specified element into this queue if it is possible to do
15.47/5.01 * so immediately without violating capacity restrictions.
15.47/5.01 * When using a capacity-restricted queue, this method is generally
15.47/5.01 * preferable to {@link #add}, which can fail to insert an element only
15.47/5.01 * by throwing an exception.
15.47/5.01 *
15.47/5.01 * @param e the element to add
15.47/5.01 * @return true if the element was added to this queue, else
15.47/5.01 * false
15.47/5.01 * @throws ClassCastException if the class of the specified element
15.47/5.01 * prevents it from being added to this queue
15.47/5.01 * @throws NullPointerException if the specified element is null and
15.47/5.01 * this queue does not permit null elements
15.47/5.01 * @throws IllegalArgumentException if some property of this element
15.47/5.01 * prevents it from being added to this queue
15.47/5.01 */
15.47/5.01 boolean offer(E e);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Retrieves and removes the head of this queue. This method differs
15.47/5.01 * from {@link #poll poll} only in that it throws an exception if this
15.47/5.01 * queue is empty.
15.47/5.01 *
15.47/5.01 * @return the head of this queue
15.47/5.01 * @throws NoSuchElementException if this queue is empty
15.47/5.01 */
15.47/5.01 E remove();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Retrieves and removes the head of this queue,
15.47/5.01 * or returns null if this queue is empty.
15.47/5.01 *
15.47/5.01 * @return the head of this queue, or null if this queue is empty
15.47/5.01 */
15.47/5.01 E poll();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Retrieves, but does not remove, the head of this queue. This method
15.47/5.01 * differs from {@link #peek peek} only in that it throws an exception
15.47/5.01 * if this queue is empty.
15.47/5.01 *
15.47/5.01 * @return the head of this queue
15.47/5.01 * @throws NoSuchElementException if this queue is empty
15.47/5.01 */
15.47/5.01 E element();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Retrieves, but does not remove, the head of this queue,
15.47/5.01 * or returns null if this queue is empty.
15.47/5.01 *
15.47/5.01 * @return the head of this queue, or null if this queue is empty
15.47/5.01 */
15.47/5.01 E peek();
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 /*
15.47/5.01 * Copyright 2000-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Marker interface used by List implementations to indicate that
15.47/5.01 * they support fast (generally constant time) random access. The primary
15.47/5.01 * purpose of this interface is to allow generic algorithms to alter their
15.47/5.01 * behavior to provide good performance when applied to either random or
15.47/5.01 * sequential access lists.
15.47/5.01 *
15.47/5.01 * The best algorithms for manipulating random access lists (such as
15.47/5.01 * ArrayList) can produce quadratic behavior when applied to
15.47/5.01 * sequential access lists (such as LinkedList). Generic list
15.47/5.01 * algorithms are encouraged to check whether the given list is an
15.47/5.01 * instanceof this interface before applying an algorithm that would
15.47/5.01 * provide poor performance if it were applied to a sequential access list,
15.47/5.01 * and to alter their behavior if necessary to guarantee acceptable
15.47/5.01 * performance.
15.47/5.01 *
15.47/5.01 *
It is recognized that the distinction between random and sequential
15.47/5.01 * access is often fuzzy. For example, some List implementations
15.47/5.01 * provide asymptotically linear access times if they get huge, but constant
15.47/5.01 * access times in practice. Such a List implementation
15.47/5.01 * should generally implement this interface. As a rule of thumb, a
15.47/5.01 * List implementation should implement this interface if,
15.47/5.01 * for typical instances of the class, this loop:
15.47/5.01 *
15.47/5.01 * for (int i=0, n=list.size(); i < n; i++)
15.47/5.01 * list.get(i);
15.47/5.01 *
15.47/5.01 * runs faster than this loop:
15.47/5.01 *
15.47/5.01 * for (Iterator i=list.iterator(); i.hasNext(); )
15.47/5.01 * i.next();
15.47/5.01 *
15.47/5.01 *
15.47/5.01 * This interface is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @since 1.4
15.47/5.01 */
15.47/5.01 public interface RandomAccess {
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 public class Random {
15.47/5.01 static String[] args;
15.47/5.01 static int index = 0;
15.47/5.01
15.47/5.01 public static int random() {
15.47/5.01 String string = args[index];
15.47/5.01 index++;
15.47/5.01 return string.length();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 /*
15.47/5.01 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Thrown to indicate that the requested operation is not supported.
15.47/5.01 *
15.47/5.01 * This class is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @author Josh Bloch
15.47/5.01 * @since 1.2
15.47/5.01 */
15.47/5.01 public class UnsupportedOperationException extends RuntimeException {
15.47/5.01 /**
15.47/5.01 * Constructs an UnsupportedOperationException with no detail message.
15.47/5.01 */
15.47/5.01 public UnsupportedOperationException() {
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Constructs an UnsupportedOperationException with the specified
15.47/5.01 * detail message.
15.47/5.01 *
15.47/5.01 * @param message the detail message
15.47/5.01 */
15.47/5.01 public UnsupportedOperationException(String message) {
15.47/5.01 super(message);
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Constructs a new exception with the specified detail message and
15.47/5.01 * cause.
15.47/5.01 *
15.47/5.01 *
Note that the detail message associated with cause is
15.47/5.01 * not automatically incorporated in this exception's detail
15.47/5.01 * message.
15.47/5.01 *
15.47/5.01 * @param message the detail message (which is saved for later retrieval
15.47/5.01 * by the {@link Throwable#getMessage()} method).
15.47/5.01 * @param cause the cause (which is saved for later retrieval by the
15.47/5.01 * {@link Throwable#getCause()} method). (A null value
15.47/5.01 * is permitted, and indicates that the cause is nonexistent or
15.47/5.01 * unknown.)
15.47/5.01 * @since 1.5
15.47/5.01 */
15.47/5.01 public UnsupportedOperationException(String message, Throwable cause) {
15.47/5.01 super(message, cause);
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Constructs a new exception with the specified cause and a detail
15.47/5.01 * message of (cause==null ? null : cause.toString()) (which
15.47/5.01 * typically contains the class and detail message of cause).
15.47/5.01 * This constructor is useful for exceptions that are little more than
15.47/5.01 * wrappers for other throwables (for example, {@link
15.47/5.01 * java.security.PrivilegedActionException}).
15.47/5.01 *
15.47/5.01 * @param cause the cause (which is saved for later retrieval by the
15.47/5.01 * {@link Throwable#getCause()} method). (A null value is
15.47/5.01 * permitted, and indicates that the cause is nonexistent or
15.47/5.01 * unknown.)
15.47/5.01 * @since 1.5
15.47/5.01 */
15.47/5.01 public UnsupportedOperationException(Throwable cause) {
15.47/5.01 super(cause);
15.47/5.01 }
15.47/5.01
15.47/5.01 static final long serialVersionUID = -1242599979055084673L;
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01
15.47/5.01 ----------------------------------------
15.47/5.01
15.47/5.01 (1) BareJBCToJBCProof (EQUIVALENT)
15.47/5.01 initialized classpath
15.47/5.01 ----------------------------------------
15.47/5.01
15.47/5.01 (2)
15.47/5.01 Obligation:
15.47/5.01 need to prove termination of the following program:
15.47/5.01 /*
15.47/5.01 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * This class provides a skeletal implementation of the Collection
15.47/5.01 * interface, to minimize the effort required to implement this interface.
15.47/5.01 *
15.47/5.01 * To implement an unmodifiable collection, the programmer needs only to
15.47/5.01 * extend this class and provide implementations for the iterator and
15.47/5.01 * size methods. (The iterator returned by the iterator
15.47/5.01 * method must implement hasNext and next.)
15.47/5.01 *
15.47/5.01 * To implement a modifiable collection, the programmer must additionally
15.47/5.01 * override this class's add method (which otherwise throws an
15.47/5.01 * UnsupportedOperationException), and the iterator returned by the
15.47/5.01 * iterator method must additionally implement its remove
15.47/5.01 * method.
15.47/5.01 *
15.47/5.01 * The programmer should generally provide a void (no argument) and
15.47/5.01 * Collection constructor, as per the recommendation in the
15.47/5.01 * Collection interface specification.
15.47/5.01 *
15.47/5.01 * The documentation for each non-abstract method in this class describes its
15.47/5.01 * implementation in detail. Each of these methods may be overridden if
15.47/5.01 * the collection being implemented admits a more efficient implementation.
15.47/5.01 *
15.47/5.01 * This class is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @author Josh Bloch
15.47/5.01 * @author Neal Gafter
15.47/5.01 * @see Collection
15.47/5.01 * @since 1.2
15.47/5.01 */
15.47/5.01
15.47/5.01 public abstract class AbstractCollection implements Collection {
15.47/5.01 /**
15.47/5.01 * Sole constructor. (For invocation by subclass constructors, typically
15.47/5.01 * implicit.)
15.47/5.01 */
15.47/5.01 protected AbstractCollection() {
15.47/5.01 }
15.47/5.01
15.47/5.01 // Query Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns an iterator over the elements contained in this collection.
15.47/5.01 *
15.47/5.01 * @return an iterator over the elements contained in this collection
15.47/5.01 */
15.47/5.01 public abstract Iterator iterator();
15.47/5.01
15.47/5.01 public abstract int size();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation returns size() == 0.
15.47/5.01 */
15.47/5.01 public boolean isEmpty() {
15.47/5.01 return size() == 0;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation iterates over the elements in the collection,
15.47/5.01 * checking each element in turn for equality with the specified element.
15.47/5.01 *
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public boolean contains(Object o) {
15.47/5.01 Iterator e = iterator();
15.47/5.01 if (o==null) {
15.47/5.01 while (e.hasNext())
15.47/5.01 if (e.next()==null)
15.47/5.01 return true;
15.47/5.01 } else {
15.47/5.01 while (e.hasNext())
15.47/5.01 if (o.equals(e.next()))
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01 return false;
15.47/5.01 }
15.47/5.01
15.47/5.01 // Modification Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation always throws an
15.47/5.01 * UnsupportedOperationException.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IllegalStateException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public boolean add(E e) {
15.47/5.01 throw new UnsupportedOperationException();
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation iterates over the collection looking for the
15.47/5.01 * specified element. If it finds the element, it removes the element
15.47/5.01 * from the collection using the iterator's remove method.
15.47/5.01 *
15.47/5.01 *
Note that this implementation throws an
15.47/5.01 * UnsupportedOperationException if the iterator returned by this
15.47/5.01 * collection's iterator method does not implement the remove
15.47/5.01 * method and this collection contains the specified object.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public boolean remove(Object o) {
15.47/5.01 Iterator e = iterator();
15.47/5.01 if (o==null) {
15.47/5.01 while (e.hasNext()) {
15.47/5.01 if (e.next()==null) {
15.47/5.01 e.remove();
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01 }
15.47/5.01 } else {
15.47/5.01 while (e.hasNext()) {
15.47/5.01 if (o.equals(e.next())) {
15.47/5.01 e.remove();
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01 }
15.47/5.01 }
15.47/5.01 return false;
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Bulk Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation iterates over the specified collection,
15.47/5.01 * checking each element returned by the iterator in turn to see
15.47/5.01 * if it's contained in this collection. If all elements are so
15.47/5.01 * contained true is returned, otherwise false.
15.47/5.01 *
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 public boolean containsAll(Collection c) {
15.47/5.01 Iterator e = c.iterator();
15.47/5.01 while (e.hasNext())
15.47/5.01 if (!contains(e.next()))
15.47/5.01 return false;
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation iterates over the specified collection, and adds
15.47/5.01 * each object returned by the iterator to this collection, in turn.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException unless add is
15.47/5.01 * overridden (assuming the specified collection is non-empty).
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IllegalStateException {@inheritDoc}
15.47/5.01 *
15.47/5.01 * @see #add(Object)
15.47/5.01 */
15.47/5.01 public boolean addAll(Collection c) {
15.47/5.01 boolean modified = false;
15.47/5.01 Iterator e = c.iterator();
15.47/5.01 while (e.hasNext()) {
15.47/5.01 if (add(e.next()))
15.47/5.01 modified = true;
15.47/5.01 }
15.47/5.01 return modified;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation iterates over this collection, checking each
15.47/5.01 * element returned by the iterator in turn to see if it's contained
15.47/5.01 * in the specified collection. If it's so contained, it's removed from
15.47/5.01 * this collection with the iterator's remove method.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the iterator returned by the
15.47/5.01 * iterator method does not implement the remove method
15.47/5.01 * and this collection contains one or more elements in common with the
15.47/5.01 * specified collection.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 *
15.47/5.01 * @see #remove(Object)
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 public boolean removeAll(Collection c) {
15.47/5.01 boolean modified = false;
15.47/5.01 Iterator e = iterator();
15.47/5.01 while (e.hasNext()) {
15.47/5.01 if (c.contains(e.next())) {
15.47/5.01 e.remove();
15.47/5.01 modified = true;
15.47/5.01 }
15.47/5.01 }
15.47/5.01 return modified;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation iterates over this collection, checking each
15.47/5.01 * element returned by the iterator in turn to see if it's contained
15.47/5.01 * in the specified collection. If it's not so contained, it's removed
15.47/5.01 * from this collection with the iterator's remove method.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the iterator returned by the
15.47/5.01 * iterator method does not implement the remove method
15.47/5.01 * and this collection contains one or more elements not present in the
15.47/5.01 * specified collection.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 *
15.47/5.01 * @see #remove(Object)
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 public boolean retainAll(Collection c) {
15.47/5.01 boolean modified = false;
15.47/5.01 Iterator e = iterator();
15.47/5.01 while (e.hasNext()) {
15.47/5.01 if (!c.contains(e.next())) {
15.47/5.01 e.remove();
15.47/5.01 modified = true;
15.47/5.01 }
15.47/5.01 }
15.47/5.01 return modified;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation iterates over this collection, removing each
15.47/5.01 * element using the Iterator.remove operation. Most
15.47/5.01 * implementations will probably choose to override this method for
15.47/5.01 * efficiency.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the iterator returned by this
15.47/5.01 * collection's iterator method does not implement the
15.47/5.01 * remove method and this collection is non-empty.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public void clear() {
15.47/5.01 Iterator e = iterator();
15.47/5.01 while (e.hasNext()) {
15.47/5.01 e.next();
15.47/5.01 e.remove();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // String conversion
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns a string representation of this collection. The string
15.47/5.01 * representation consists of a list of the collection's elements in the
15.47/5.01 * order they are returned by its iterator, enclosed in square brackets
15.47/5.01 * ("[]"). Adjacent elements are separated by the characters
15.47/5.01 * ", " (comma and space). Elements are converted to strings as
15.47/5.01 * by {@link String#valueOf(Object)}.
15.47/5.01 *
15.47/5.01 * @return a string representation of this collection
15.47/5.01 */
15.47/5.01 public String toString() {
15.47/5.01 Iterator i = iterator();
15.47/5.01 if (! i.hasNext())
15.47/5.01 return "[]";
15.47/5.01
15.47/5.01 String sb = "";
15.47/5.01 sb = sb + "[";
15.47/5.01 for (;;) {
15.47/5.01 E e = i.next();
15.47/5.01 sb = sb + (e == this ? "(this Collection)" : e);
15.47/5.01 if (! i.hasNext()) {
15.47/5.01 sb = sb + "]";
15.47/5.01 return sb;
15.47/5.01 }
15.47/5.01 sb = sb + ", ";
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 /*
15.47/5.01 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * This class provides a skeletal implementation of the {@link List}
15.47/5.01 * interface to minimize the effort required to implement this interface
15.47/5.01 * backed by a "random access" data store (such as an array). For sequential
15.47/5.01 * access data (such as a linked list), {@link AbstractSequentialList} should
15.47/5.01 * be used in preference to this class.
15.47/5.01 *
15.47/5.01 * To implement an unmodifiable list, the programmer needs only to extend
15.47/5.01 * this class and provide implementations for the {@link #get(int)} and
15.47/5.01 * {@link List#size() size()} methods.
15.47/5.01 *
15.47/5.01 *
To implement a modifiable list, the programmer must additionally
15.47/5.01 * override the {@link #set(int, Object) set(int, E)} method (which otherwise
15.47/5.01 * throws an {@code UnsupportedOperationException}). If the list is
15.47/5.01 * variable-size the programmer must additionally override the
15.47/5.01 * {@link #add(int, Object) add(int, E)} and {@link #remove(int)} methods.
15.47/5.01 *
15.47/5.01 *
The programmer should generally provide a void (no argument) and collection
15.47/5.01 * constructor, as per the recommendation in the {@link Collection} interface
15.47/5.01 * specification.
15.47/5.01 *
15.47/5.01 *
Unlike the other abstract collection implementations, the programmer does
15.47/5.01 * not have to provide an iterator implementation; the iterator and
15.47/5.01 * list iterator are implemented by this class, on top of the "random access"
15.47/5.01 * methods:
15.47/5.01 * {@link #get(int)},
15.47/5.01 * {@link #set(int, Object) set(int, E)},
15.47/5.01 * {@link #add(int, Object) add(int, E)} and
15.47/5.01 * {@link #remove(int)}.
15.47/5.01 *
15.47/5.01 *
The documentation for each non-abstract method in this class describes its
15.47/5.01 * implementation in detail. Each of these methods may be overridden if the
15.47/5.01 * collection being implemented admits a more efficient implementation.
15.47/5.01 *
15.47/5.01 *
This class is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @author Josh Bloch
15.47/5.01 * @author Neal Gafter
15.47/5.01 * @since 1.2
15.47/5.01 */
15.47/5.01
15.47/5.01 public abstract class AbstractList extends AbstractCollection implements List {
15.47/5.01 /**
15.47/5.01 * Sole constructor. (For invocation by subclass constructors, typically
15.47/5.01 * implicit.)
15.47/5.01 */
15.47/5.01 protected AbstractList() {
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Appends the specified element to the end of this list (optional
15.47/5.01 * operation).
15.47/5.01 *
15.47/5.01 * Lists that support this operation may place limitations on what
15.47/5.01 * elements may be added to this list. In particular, some
15.47/5.01 * lists will refuse to add null elements, and others will impose
15.47/5.01 * restrictions on the type of elements that may be added. List
15.47/5.01 * classes should clearly specify in their documentation any restrictions
15.47/5.01 * on what elements may be added.
15.47/5.01 *
15.47/5.01 *
This implementation calls {@code add(size(), e)}.
15.47/5.01 *
15.47/5.01 *
Note that this implementation throws an
15.47/5.01 * {@code UnsupportedOperationException} unless
15.47/5.01 * {@link #add(int, Object) add(int, E)} is overridden.
15.47/5.01 *
15.47/5.01 * @param e element to be appended to this list
15.47/5.01 * @return {@code true} (as specified by {@link Collection#add})
15.47/5.01 * @throws UnsupportedOperationException if the {@code add} operation
15.47/5.01 * is not supported by this list
15.47/5.01 * @throws ClassCastException if the class of the specified element
15.47/5.01 * prevents it from being added to this list
15.47/5.01 * @throws NullPointerException if the specified element is null and this
15.47/5.01 * list does not permit null elements
15.47/5.01 * @throws IllegalArgumentException if some property of this element
15.47/5.01 * prevents it from being added to this list
15.47/5.01 */
15.47/5.01 public boolean add(E e) {
15.47/5.01 add(size(), e);
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 abstract public E get(int index);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation always throws an
15.47/5.01 * {@code UnsupportedOperationException}.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public E set(int index, E element) {
15.47/5.01 throw new UnsupportedOperationException();
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation always throws an
15.47/5.01 * {@code UnsupportedOperationException}.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public void add(int index, E element) {
15.47/5.01 throw new UnsupportedOperationException();
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation always throws an
15.47/5.01 * {@code UnsupportedOperationException}.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public E remove(int index) {
15.47/5.01 throw new UnsupportedOperationException();
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Search Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation first gets a list iterator (with
15.47/5.01 * {@code listIterator()}). Then, it iterates over the list until the
15.47/5.01 * specified element is found or the end of the list is reached.
15.47/5.01 *
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public int indexOf(Object o) {
15.47/5.01 ListIterator e = listIterator();
15.47/5.01 if (o==null) {
15.47/5.01 while (e.hasNext())
15.47/5.01 if (e.next()==null)
15.47/5.01 return e.previousIndex();
15.47/5.01 } else {
15.47/5.01 while (e.hasNext())
15.47/5.01 if (o.equals(e.next()))
15.47/5.01 return e.previousIndex();
15.47/5.01 }
15.47/5.01 return -1;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation first gets a list iterator that points to the end
15.47/5.01 * of the list (with {@code listIterator(size())}). Then, it iterates
15.47/5.01 * backwards over the list until the specified element is found, or the
15.47/5.01 * beginning of the list is reached.
15.47/5.01 *
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public int lastIndexOf(Object o) {
15.47/5.01 ListIterator e = listIterator(size());
15.47/5.01 if (o==null) {
15.47/5.01 while (e.hasPrevious())
15.47/5.01 if (e.previous()==null)
15.47/5.01 return e.nextIndex();
15.47/5.01 } else {
15.47/5.01 while (e.hasPrevious())
15.47/5.01 if (o.equals(e.previous()))
15.47/5.01 return e.nextIndex();
15.47/5.01 }
15.47/5.01 return -1;
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Bulk Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes all of the elements from this list (optional operation).
15.47/5.01 * The list will be empty after this call returns.
15.47/5.01 *
15.47/5.01 * This implementation calls {@code removeRange(0, size())}.
15.47/5.01 *
15.47/5.01 *
Note that this implementation throws an
15.47/5.01 * {@code UnsupportedOperationException} unless {@code remove(int
15.47/5.01 * index)} or {@code removeRange(int fromIndex, int toIndex)} is
15.47/5.01 * overridden.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException if the {@code clear} operation
15.47/5.01 * is not supported by this list
15.47/5.01 */
15.47/5.01 public void clear() {
15.47/5.01 removeRange(0, size());
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 *
This implementation gets an iterator over the specified collection
15.47/5.01 * and iterates over it, inserting the elements obtained from the
15.47/5.01 * iterator into this list at the appropriate position, one at a time,
15.47/5.01 * using {@code add(int, E)}.
15.47/5.01 * Many implementations will override this method for efficiency.
15.47/5.01 *
15.47/5.01 *
Note that this implementation throws an
15.47/5.01 * {@code UnsupportedOperationException} unless
15.47/5.01 * {@link #add(int, Object) add(int, E)} is overridden.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public boolean addAll(int index, Collection c) {
15.47/5.01 rangeCheckForAdd(index);
15.47/5.01 boolean modified = false;
15.47/5.01 Iterator e = c.iterator();
15.47/5.01 while (e.hasNext()) {
15.47/5.01 add(index++, e.next());
15.47/5.01 modified = true;
15.47/5.01 }
15.47/5.01 return modified;
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Iterators
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns an iterator over the elements in this list in proper sequence.
15.47/5.01 *
15.47/5.01 *
This implementation returns a straightforward implementation of the
15.47/5.01 * iterator interface, relying on the backing list's {@code size()},
15.47/5.01 * {@code get(int)}, and {@code remove(int)} methods.
15.47/5.01 *
15.47/5.01 *
Note that the iterator returned by this method will throw an
15.47/5.01 * {@link UnsupportedOperationException} in response to its
15.47/5.01 * {@code remove} method unless the list's {@code remove(int)} method is
15.47/5.01 * overridden.
15.47/5.01 *
15.47/5.01 *
This implementation can be made to throw runtime exceptions in the
15.47/5.01 * face of concurrent modification, as described in the specification
15.47/5.01 * for the (protected) {@link #modCount} field.
15.47/5.01 *
15.47/5.01 * @return an iterator over the elements in this list in proper sequence
15.47/5.01 */
15.47/5.01 public Iterator iterator() {
15.47/5.01 return new Itr();
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation returns {@code listIterator(0)}.
15.47/5.01 *
15.47/5.01 * @see #listIterator(int)
15.47/5.01 */
15.47/5.01 public ListIterator listIterator() {
15.47/5.01 return listIterator(0);
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation returns a straightforward implementation of the
15.47/5.01 * {@code ListIterator} interface that extends the implementation of the
15.47/5.01 * {@code Iterator} interface returned by the {@code iterator()} method.
15.47/5.01 * The {@code ListIterator} implementation relies on the backing list's
15.47/5.01 * {@code get(int)}, {@code set(int, E)}, {@code add(int, E)}
15.47/5.01 * and {@code remove(int)} methods.
15.47/5.01 *
15.47/5.01 *
Note that the list iterator returned by this implementation will
15.47/5.01 * throw an {@link UnsupportedOperationException} in response to its
15.47/5.01 * {@code remove}, {@code set} and {@code add} methods unless the
15.47/5.01 * list's {@code remove(int)}, {@code set(int, E)}, and
15.47/5.01 * {@code add(int, E)} methods are overridden.
15.47/5.01 *
15.47/5.01 *
This implementation can be made to throw runtime exceptions in the
15.47/5.01 * face of concurrent modification, as described in the specification for
15.47/5.01 * the (protected) {@link #modCount} field.
15.47/5.01 *
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public ListIterator listIterator(final int index) {
15.47/5.01 rangeCheckForAdd(index);
15.47/5.01
15.47/5.01 return new ListItr(index);
15.47/5.01 }
15.47/5.01
15.47/5.01 private class Itr implements Iterator {
15.47/5.01 /**
15.47/5.01 * Index of element to be returned by subsequent call to next.
15.47/5.01 */
15.47/5.01 int cursor = 0;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Index of element returned by most recent call to next or
15.47/5.01 * previous. Reset to -1 if this element is deleted by a call
15.47/5.01 * to remove.
15.47/5.01 */
15.47/5.01 int lastRet = -1;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * The modCount value that the iterator believes that the backing
15.47/5.01 * List should have. If this expectation is violated, the iterator
15.47/5.01 * has detected concurrent modification.
15.47/5.01 */
15.47/5.01 int expectedModCount = modCount;
15.47/5.01
15.47/5.01 public boolean hasNext() {
15.47/5.01 return cursor != size();
15.47/5.01 }
15.47/5.01
15.47/5.01 public E next() {
15.47/5.01 checkForComodification();
15.47/5.01 try {
15.47/5.01 int i = cursor;
15.47/5.01 E next = get(i);
15.47/5.01 lastRet = i;
15.47/5.01 cursor = i + 1;
15.47/5.01 return next;
15.47/5.01 } catch (IndexOutOfBoundsException e) {
15.47/5.01 checkForComodification();
15.47/5.01 throw new NoSuchElementException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 public void remove() {
15.47/5.01 if (lastRet < 0)
15.47/5.01 throw new IllegalStateException();
15.47/5.01 checkForComodification();
15.47/5.01
15.47/5.01 try {
15.47/5.01 AbstractList.this.remove(lastRet);
15.47/5.01 if (lastRet < cursor)
15.47/5.01 cursor--;
15.47/5.01 lastRet = -1;
15.47/5.01 expectedModCount = modCount;
15.47/5.01 } catch (IndexOutOfBoundsException e) {
15.47/5.01 throw new ConcurrentModificationException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 final void checkForComodification() {
15.47/5.01 if (modCount != expectedModCount)
15.47/5.01 throw new ConcurrentModificationException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 private class ListItr extends Itr implements ListIterator {
15.47/5.01 ListItr(int index) {
15.47/5.01 cursor = index;
15.47/5.01 }
15.47/5.01
15.47/5.01 public boolean hasPrevious() {
15.47/5.01 return cursor != 0;
15.47/5.01 }
15.47/5.01
15.47/5.01 public E previous() {
15.47/5.01 checkForComodification();
15.47/5.01 try {
15.47/5.01 int i = cursor - 1;
15.47/5.01 E previous = get(i);
15.47/5.01 lastRet = cursor = i;
15.47/5.01 return previous;
15.47/5.01 } catch (IndexOutOfBoundsException e) {
15.47/5.01 checkForComodification();
15.47/5.01 throw new NoSuchElementException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 public int nextIndex() {
15.47/5.01 return cursor;
15.47/5.01 }
15.47/5.01
15.47/5.01 public int previousIndex() {
15.47/5.01 return cursor-1;
15.47/5.01 }
15.47/5.01
15.47/5.01 public void set(E e) {
15.47/5.01 if (lastRet < 0)
15.47/5.01 throw new IllegalStateException();
15.47/5.01 checkForComodification();
15.47/5.01
15.47/5.01 try {
15.47/5.01 AbstractList.this.set(lastRet, e);
15.47/5.01 expectedModCount = modCount;
15.47/5.01 } catch (IndexOutOfBoundsException ex) {
15.47/5.01 throw new ConcurrentModificationException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 public void add(E e) {
15.47/5.01 checkForComodification();
15.47/5.01
15.47/5.01 try {
15.47/5.01 int i = cursor;
15.47/5.01 AbstractList.this.add(i, e);
15.47/5.01 lastRet = -1;
15.47/5.01 cursor = i + 1;
15.47/5.01 expectedModCount = modCount;
15.47/5.01 } catch (IndexOutOfBoundsException ex) {
15.47/5.01 throw new ConcurrentModificationException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * {@inheritDoc}
15.47/5.01 *
15.47/5.01 * This implementation returns a list that subclasses
15.47/5.01 * {@code AbstractList}. The subclass stores, in private fields, the
15.47/5.01 * offset of the subList within the backing list, the size of the subList
15.47/5.01 * (which can change over its lifetime), and the expected
15.47/5.01 * {@code modCount} value of the backing list. There are two variants
15.47/5.01 * of the subclass, one of which implements {@code RandomAccess}.
15.47/5.01 * If this list implements {@code RandomAccess} the returned list will
15.47/5.01 * be an instance of the subclass that implements {@code RandomAccess}.
15.47/5.01 *
15.47/5.01 *
The subclass's {@code set(int, E)}, {@code get(int)},
15.47/5.01 * {@code add(int, E)}, {@code remove(int)}, {@code addAll(int,
15.47/5.01 * Collection)} and {@code removeRange(int, int)} methods all
15.47/5.01 * delegate to the corresponding methods on the backing abstract list,
15.47/5.01 * after bounds-checking the index and adjusting for the offset. The
15.47/5.01 * {@code addAll(Collection c)} method merely returns {@code addAll(size,
15.47/5.01 * c)}.
15.47/5.01 *
15.47/5.01 *
The {@code listIterator(int)} method returns a "wrapper object"
15.47/5.01 * over a list iterator on the backing list, which is created with the
15.47/5.01 * corresponding method on the backing list. The {@code iterator} method
15.47/5.01 * merely returns {@code listIterator()}, and the {@code size} method
15.47/5.01 * merely returns the subclass's {@code size} field.
15.47/5.01 *
15.47/5.01 *
All methods first check to see if the actual {@code modCount} of
15.47/5.01 * the backing list is equal to its expected value, and throw a
15.47/5.01 * {@code ConcurrentModificationException} if it is not.
15.47/5.01 *
15.47/5.01 * @throws IndexOutOfBoundsException if an endpoint index value is out of range
15.47/5.01 * {@code (fromIndex < 0 || toIndex > size)}
15.47/5.01 * @throws IllegalArgumentException if the endpoint indices are out of order
15.47/5.01 * {@code (fromIndex > toIndex)}
15.47/5.01 */
15.47/5.01 public List subList(int fromIndex, int toIndex) {
15.47/5.01 return (this instanceof RandomAccess ?
15.47/5.01 new RandomAccessSubList(this, fromIndex, toIndex) :
15.47/5.01 new SubList(this, fromIndex, toIndex));
15.47/5.01 }
15.47/5.01
15.47/5.01 // Comparison and hashing
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Compares the specified object with this list for equality. Returns
15.47/5.01 * {@code true} if and only if the specified object is also a list, both
15.47/5.01 * lists have the same size, and all corresponding pairs of elements in
15.47/5.01 * the two lists are equal. (Two elements {@code e1} and
15.47/5.01 * {@code e2} are equal if {@code (e1==null ? e2==null :
15.47/5.01 * e1.equals(e2))}.) In other words, two lists are defined to be
15.47/5.01 * equal if they contain the same elements in the same order.
15.47/5.01 *
15.47/5.01 * This implementation first checks if the specified object is this
15.47/5.01 * list. If so, it returns {@code true}; if not, it checks if the
15.47/5.01 * specified object is a list. If not, it returns {@code false}; if so,
15.47/5.01 * it iterates over both lists, comparing corresponding pairs of elements.
15.47/5.01 * If any comparison returns {@code false}, this method returns
15.47/5.01 * {@code false}. If either iterator runs out of elements before the
15.47/5.01 * other it returns {@code false} (as the lists are of unequal length);
15.47/5.01 * otherwise it returns {@code true} when the iterations complete.
15.47/5.01 *
15.47/5.01 * @param o the object to be compared for equality with this list
15.47/5.01 * @return {@code true} if the specified object is equal to this list
15.47/5.01 */
15.47/5.01 public boolean equals(Object o) {
15.47/5.01 if (o == this)
15.47/5.01 return true;
15.47/5.01 if (!(o instanceof List))
15.47/5.01 return false;
15.47/5.01
15.47/5.01 ListIterator e1 = listIterator();
15.47/5.01 ListIterator e2 = ((List) o).listIterator();
15.47/5.01 while(e1.hasNext() && e2.hasNext()) {
15.47/5.01 E o1 = e1.next();
15.47/5.01 Object o2 = e2.next();
15.47/5.01 if (!(o1==null ? o2==null : o1.equals(o2)))
15.47/5.01 return false;
15.47/5.01 }
15.47/5.01 return !(e1.hasNext() || e2.hasNext());
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns the hash code value for this list.
15.47/5.01 *
15.47/5.01 * This implementation uses exactly the code that is used to define the
15.47/5.01 * list hash function in the documentation for the {@link List#hashCode}
15.47/5.01 * method.
15.47/5.01 *
15.47/5.01 * @return the hash code value for this list
15.47/5.01 */
15.47/5.01 public int hashCode() {
15.47/5.01 int hashCode = 1;
15.47/5.01 Iterator it = this.iterator();
15.47/5.01 while (it.hasNext()) {
15.47/5.01 E e = it.next();
15.47/5.01 hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());
15.47/5.01 }
15.47/5.01 return hashCode;
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes from this list all of the elements whose index is between
15.47/5.01 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
15.47/5.01 * Shifts any succeeding elements to the left (reduces their index).
15.47/5.01 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
15.47/5.01 * (If {@code toIndex==fromIndex}, this operation has no effect.)
15.47/5.01 *
15.47/5.01 * This method is called by the {@code clear} operation on this list
15.47/5.01 * and its subLists. Overriding this method to take advantage of
15.47/5.01 * the internals of the list implementation can substantially
15.47/5.01 * improve the performance of the {@code clear} operation on this list
15.47/5.01 * and its subLists.
15.47/5.01 *
15.47/5.01 *
This implementation gets a list iterator positioned before
15.47/5.01 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
15.47/5.01 * followed by {@code ListIterator.remove} until the entire range has
15.47/5.01 * been removed. Note: if {@code ListIterator.remove} requires linear
15.47/5.01 * time, this implementation requires quadratic time.
15.47/5.01 *
15.47/5.01 * @param fromIndex index of first element to be removed
15.47/5.01 * @param toIndex index after last element to be removed
15.47/5.01 */
15.47/5.01 protected void removeRange(int fromIndex, int toIndex) {
15.47/5.01 ListIterator it = listIterator(fromIndex);
15.47/5.01 for (int i=0, n=toIndex-fromIndex; istructurally modified.
15.47/5.01 * Structural modifications are those that change the size of the
15.47/5.01 * list, or otherwise perturb it in such a fashion that iterations in
15.47/5.01 * progress may yield incorrect results.
15.47/5.01 *
15.47/5.01 * This field is used by the iterator and list iterator implementation
15.47/5.01 * returned by the {@code iterator} and {@code listIterator} methods.
15.47/5.01 * If the value of this field changes unexpectedly, the iterator (or list
15.47/5.01 * iterator) will throw a {@code ConcurrentModificationException} in
15.47/5.01 * response to the {@code next}, {@code remove}, {@code previous},
15.47/5.01 * {@code set} or {@code add} operations. This provides
15.47/5.01 * fail-fast behavior, rather than non-deterministic behavior in
15.47/5.01 * the face of concurrent modification during iteration.
15.47/5.01 *
15.47/5.01 *
Use of this field by subclasses is optional. If a subclass
15.47/5.01 * wishes to provide fail-fast iterators (and list iterators), then it
15.47/5.01 * merely has to increment this field in its {@code add(int, E)} and
15.47/5.01 * {@code remove(int)} methods (and any other methods that it overrides
15.47/5.01 * that result in structural modifications to the list). A single call to
15.47/5.01 * {@code add(int, E)} or {@code remove(int)} must add no more than
15.47/5.01 * one to this field, or the iterators (and list iterators) will throw
15.47/5.01 * bogus {@code ConcurrentModificationExceptions}. If an implementation
15.47/5.01 * does not wish to provide fail-fast iterators, this field may be
15.47/5.01 * ignored.
15.47/5.01 */
15.47/5.01 protected transient int modCount = 0;
15.47/5.01
15.47/5.01 private void rangeCheckForAdd(int index) {
15.47/5.01 if (index < 0 || index > size())
15.47/5.01 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.47/5.01 }
15.47/5.01
15.47/5.01 private String outOfBoundsMsg(int index) {
15.47/5.01 return "";
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 class SubList extends AbstractList {
15.47/5.01 private final AbstractList l;
15.47/5.01 private final int offset;
15.47/5.01 private int size;
15.47/5.01
15.47/5.01 SubList(AbstractList list, int fromIndex, int toIndex) {
15.47/5.01 if (fromIndex < 0)
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 if (toIndex > list.size())
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 if (fromIndex > toIndex)
15.47/5.01 throw new IllegalArgumentException();
15.47/5.01 l = list;
15.47/5.01 offset = fromIndex;
15.47/5.01 size = toIndex - fromIndex;
15.47/5.01 this.modCount = l.modCount;
15.47/5.01 }
15.47/5.01
15.47/5.01 public E set(int index, E element) {
15.47/5.01 rangeCheck(index);
15.47/5.01 checkForComodification();
15.47/5.01 return l.set(index+offset, element);
15.47/5.01 }
15.47/5.01
15.47/5.01 public E get(int index) {
15.47/5.01 rangeCheck(index);
15.47/5.01 checkForComodification();
15.47/5.01 return l.get(index+offset);
15.47/5.01 }
15.47/5.01
15.47/5.01 public int size() {
15.47/5.01 checkForComodification();
15.47/5.01 return size;
15.47/5.01 }
15.47/5.01
15.47/5.01 public void add(int index, E element) {
15.47/5.01 rangeCheckForAdd(index);
15.47/5.01 checkForComodification();
15.47/5.01 l.add(index+offset, element);
15.47/5.01 this.modCount = l.modCount;
15.47/5.01 size++;
15.47/5.01 }
15.47/5.01
15.47/5.01 public E remove(int index) {
15.47/5.01 rangeCheck(index);
15.47/5.01 checkForComodification();
15.47/5.01 E result = l.remove(index+offset);
15.47/5.01 this.modCount = l.modCount;
15.47/5.01 size--;
15.47/5.01 return result;
15.47/5.01 }
15.47/5.01
15.47/5.01 protected void removeRange(int fromIndex, int toIndex) {
15.47/5.01 checkForComodification();
15.47/5.01 l.removeRange(fromIndex+offset, toIndex+offset);
15.47/5.01 this.modCount = l.modCount;
15.47/5.01 size -= (toIndex-fromIndex);
15.47/5.01 }
15.47/5.01
15.47/5.01 public boolean addAll(Collection c) {
15.47/5.01 return addAll(size, c);
15.47/5.01 }
15.47/5.01
15.47/5.01 public boolean addAll(int index, Collection c) {
15.47/5.01 rangeCheckForAdd(index);
15.47/5.01 int cSize = c.size();
15.47/5.01 if (cSize==0)
15.47/5.01 return false;
15.47/5.01
15.47/5.01 checkForComodification();
15.47/5.01 l.addAll(offset+index, c);
15.47/5.01 this.modCount = l.modCount;
15.47/5.01 size += cSize;
15.47/5.01 return true;
15.47/5.01 }
15.47/5.01
15.47/5.01 public Iterator iterator() {
15.47/5.01 return listIterator();
15.47/5.01 }
15.47/5.01
15.47/5.01 public ListIterator listIterator(final int index) {
15.47/5.01 checkForComodification();
15.47/5.01 rangeCheckForAdd(index);
15.47/5.01
15.47/5.01 return new ListIterator() {
15.47/5.01 private final ListIterator i = l.listIterator(index+offset);
15.47/5.01
15.47/5.01 public boolean hasNext() {
15.47/5.01 return nextIndex() < size;
15.47/5.01 }
15.47/5.01
15.47/5.01 public E next() {
15.47/5.01 if (hasNext())
15.47/5.01 return i.next();
15.47/5.01 else
15.47/5.01 throw new NoSuchElementException();
15.47/5.01 }
15.47/5.01
15.47/5.01 public boolean hasPrevious() {
15.47/5.01 return previousIndex() >= 0;
15.47/5.01 }
15.47/5.01
15.47/5.01 public E previous() {
15.47/5.01 if (hasPrevious())
15.47/5.01 return i.previous();
15.47/5.01 else
15.47/5.01 throw new NoSuchElementException();
15.47/5.01 }
15.47/5.01
15.47/5.01 public int nextIndex() {
15.47/5.01 return i.nextIndex() - offset;
15.47/5.01 }
15.47/5.01
15.47/5.01 public int previousIndex() {
15.47/5.01 return i.previousIndex() - offset;
15.47/5.01 }
15.47/5.01
15.47/5.01 public void remove() {
15.47/5.01 i.remove();
15.47/5.01 SubList.this.modCount = l.modCount;
15.47/5.01 size--;
15.47/5.01 }
15.47/5.01
15.47/5.01 public void set(E e) {
15.47/5.01 i.set(e);
15.47/5.01 }
15.47/5.01
15.47/5.01 public void add(E e) {
15.47/5.01 i.add(e);
15.47/5.01 SubList.this.modCount = l.modCount;
15.47/5.01 size++;
15.47/5.01 }
15.47/5.01 };
15.47/5.01 }
15.47/5.01
15.47/5.01 public List subList(int fromIndex, int toIndex) {
15.47/5.01 return new SubList(this, fromIndex, toIndex);
15.47/5.01 }
15.47/5.01
15.47/5.01 private void rangeCheck(int index) {
15.47/5.01 if (index < 0 || index >= size)
15.47/5.01 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.47/5.01 }
15.47/5.01
15.47/5.01 private void rangeCheckForAdd(int index) {
15.47/5.01 if (index < 0 || index > size)
15.47/5.01 throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
15.47/5.01 }
15.47/5.01
15.47/5.01 private String outOfBoundsMsg(int index) {
15.47/5.01 return "";
15.47/5.01 }
15.47/5.01
15.47/5.01 private void checkForComodification() {
15.47/5.01 if (this.modCount != l.modCount)
15.47/5.01 throw new ConcurrentModificationException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 class RandomAccessSubList extends SubList implements RandomAccess {
15.47/5.01 RandomAccessSubList(AbstractList list, int fromIndex, int toIndex) {
15.47/5.01 super(list, fromIndex, toIndex);
15.47/5.01 }
15.47/5.01
15.47/5.01 public List subList(int fromIndex, int toIndex) {
15.47/5.01 return new RandomAccessSubList(this, fromIndex, toIndex);
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 /*
15.47/5.01 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * This class provides a skeletal implementation of the List
15.47/5.01 * interface to minimize the effort required to implement this interface
15.47/5.01 * backed by a "sequential access" data store (such as a linked list). For
15.47/5.01 * random access data (such as an array), AbstractList should be used
15.47/5.01 * in preference to this class.
15.47/5.01 *
15.47/5.01 * This class is the opposite of the AbstractList class in the sense
15.47/5.01 * that it implements the "random access" methods (get(int index),
15.47/5.01 * set(int index, E element), add(int index, E element) and
15.47/5.01 * remove(int index)) on top of the list's list iterator, instead of
15.47/5.01 * the other way around.
15.47/5.01 *
15.47/5.01 * To implement a list the programmer needs only to extend this class and
15.47/5.01 * provide implementations for the listIterator and size
15.47/5.01 * methods. For an unmodifiable list, the programmer need only implement the
15.47/5.01 * list iterator's hasNext, next, hasPrevious,
15.47/5.01 * previous and index methods.
15.47/5.01 *
15.47/5.01 * For a modifiable list the programmer should additionally implement the list
15.47/5.01 * iterator's set method. For a variable-size list the programmer
15.47/5.01 * should additionally implement the list iterator's remove and
15.47/5.01 * add methods.
15.47/5.01 *
15.47/5.01 * The programmer should generally provide a void (no argument) and collection
15.47/5.01 * constructor, as per the recommendation in the Collection interface
15.47/5.01 * specification.
15.47/5.01 *
15.47/5.01 * This class is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @author Josh Bloch
15.47/5.01 * @author Neal Gafter
15.47/5.01 * @see Collection
15.47/5.01 * @see List
15.47/5.01 * @see AbstractList
15.47/5.01 * @see AbstractCollection
15.47/5.01 * @since 1.2
15.47/5.01 */
15.47/5.01
15.47/5.01 public abstract class AbstractSequentialList extends AbstractList {
15.47/5.01 /**
15.47/5.01 * Sole constructor. (For invocation by subclass constructors, typically
15.47/5.01 * implicit.)
15.47/5.01 */
15.47/5.01 protected AbstractSequentialList() {
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns the element at the specified position in this list.
15.47/5.01 *
15.47/5.01 * This implementation first gets a list iterator pointing to the
15.47/5.01 * indexed element (with listIterator(index)). Then, it gets
15.47/5.01 * the element using ListIterator.next and returns it.
15.47/5.01 *
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public E get(int index) {
15.47/5.01 try {
15.47/5.01 return listIterator(index).next();
15.47/5.01 } catch (NoSuchElementException exc) {
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Replaces the element at the specified position in this list with the
15.47/5.01 * specified element (optional operation).
15.47/5.01 *
15.47/5.01 *
This implementation first gets a list iterator pointing to the
15.47/5.01 * indexed element (with listIterator(index)). Then, it gets
15.47/5.01 * the current element using ListIterator.next and replaces it
15.47/5.01 * with ListIterator.set.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the list iterator does not
15.47/5.01 * implement the set operation.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public E set(int index, E element) {
15.47/5.01 try {
15.47/5.01 ListIterator e = listIterator(index);
15.47/5.01 E oldVal = e.next();
15.47/5.01 e.set(element);
15.47/5.01 return oldVal;
15.47/5.01 } catch (NoSuchElementException exc) {
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Inserts the specified element at the specified position in this list
15.47/5.01 * (optional operation). Shifts the element currently at that position
15.47/5.01 * (if any) and any subsequent elements to the right (adds one to their
15.47/5.01 * indices).
15.47/5.01 *
15.47/5.01 * This implementation first gets a list iterator pointing to the
15.47/5.01 * indexed element (with listIterator(index)). Then, it
15.47/5.01 * inserts the specified element with ListIterator.add.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the list iterator does not
15.47/5.01 * implement the add operation.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public void add(int index, E element) {
15.47/5.01 try {
15.47/5.01 listIterator(index).add(element);
15.47/5.01 } catch (NoSuchElementException exc) {
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes the element at the specified position in this list (optional
15.47/5.01 * operation). Shifts any subsequent elements to the left (subtracts one
15.47/5.01 * from their indices). Returns the element that was removed from the
15.47/5.01 * list.
15.47/5.01 *
15.47/5.01 *
This implementation first gets a list iterator pointing to the
15.47/5.01 * indexed element (with listIterator(index)). Then, it removes
15.47/5.01 * the element with ListIterator.remove.
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the list iterator does not
15.47/5.01 * implement the remove operation.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public E remove(int index) {
15.47/5.01 try {
15.47/5.01 ListIterator e = listIterator(index);
15.47/5.01 E outCast = e.next();
15.47/5.01 e.remove();
15.47/5.01 return outCast;
15.47/5.01 } catch (NoSuchElementException exc) {
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Bulk Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Inserts all of the elements in the specified collection into this
15.47/5.01 * list at the specified position (optional operation). Shifts the
15.47/5.01 * element currently at that position (if any) and any subsequent
15.47/5.01 * elements to the right (increases their indices). The new elements
15.47/5.01 * will appear in this list in the order that they are returned by the
15.47/5.01 * specified collection's iterator. The behavior of this operation is
15.47/5.01 * undefined if the specified collection is modified while the
15.47/5.01 * operation is in progress. (Note that this will occur if the specified
15.47/5.01 * collection is this list, and it's nonempty.)
15.47/5.01 *
15.47/5.01 * This implementation gets an iterator over the specified collection and
15.47/5.01 * a list iterator over this list pointing to the indexed element (with
15.47/5.01 * listIterator(index)). Then, it iterates over the specified
15.47/5.01 * collection, inserting the elements obtained from the iterator into this
15.47/5.01 * list, one at a time, using ListIterator.add followed by
15.47/5.01 * ListIterator.next (to skip over the added element).
15.47/5.01 *
15.47/5.01 *
Note that this implementation will throw an
15.47/5.01 * UnsupportedOperationException if the list iterator returned by
15.47/5.01 * the listIterator method does not implement the add
15.47/5.01 * operation.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException {@inheritDoc}
15.47/5.01 * @throws ClassCastException {@inheritDoc}
15.47/5.01 * @throws NullPointerException {@inheritDoc}
15.47/5.01 * @throws IllegalArgumentException {@inheritDoc}
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public boolean addAll(int index, Collection c) {
15.47/5.01 try {
15.47/5.01 boolean modified = false;
15.47/5.01 ListIterator e1 = listIterator(index);
15.47/5.01 Iterator e2 = c.iterator();
15.47/5.01 while (e2.hasNext()) {
15.47/5.01 e1.add(e2.next());
15.47/5.01 modified = true;
15.47/5.01 }
15.47/5.01 return modified;
15.47/5.01 } catch (NoSuchElementException exc) {
15.47/5.01 throw new IndexOutOfBoundsException();
15.47/5.01 }
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 // Iterators
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns an iterator over the elements in this list (in proper
15.47/5.01 * sequence).
15.47/5.01 *
15.47/5.01 * This implementation merely returns a list iterator over the list.
15.47/5.01 *
15.47/5.01 * @return an iterator over the elements in this list (in proper sequence)
15.47/5.01 */
15.47/5.01 public Iterator iterator() {
15.47/5.01 return listIterator();
15.47/5.01 }
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns a list iterator over the elements in this list (in proper
15.47/5.01 * sequence).
15.47/5.01 *
15.47/5.01 * @param index index of first element to be returned from the list
15.47/5.01 * iterator (by a call to the next method)
15.47/5.01 * @return a list iterator over the elements in this list (in proper
15.47/5.01 * sequence)
15.47/5.01 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.01 */
15.47/5.01 public abstract ListIterator listIterator(int index);
15.47/5.01 }
15.47/5.01
15.47/5.01
15.47/5.01 /*
15.47/5.01 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.01 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.01 *
15.47/5.01 * This code is free software; you can redistribute it and/or modify it
15.47/5.01 * under the terms of the GNU General Public License version 2 only, as
15.47/5.01 * published by the Free Software Foundation. Sun designates this
15.47/5.01 * particular file as subject to the "Classpath" exception as provided
15.47/5.01 * by Sun in the LICENSE file that accompanied this code.
15.47/5.01 *
15.47/5.01 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.01 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.01 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.01 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.01 * accompanied this code).
15.47/5.01 *
15.47/5.01 * You should have received a copy of the GNU General Public License version
15.47/5.01 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.01 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.01 *
15.47/5.01 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.01 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.01 * have any questions.
15.47/5.01 */
15.47/5.01
15.47/5.01 package javaUtilEx;
15.47/5.01
15.47/5.01 /**
15.47/5.01 * The root interface in the collection hierarchy. A collection
15.47/5.01 * represents a group of objects, known as its elements. Some
15.47/5.01 * collections allow duplicate elements and others do not. Some are ordered
15.47/5.01 * and others unordered. The JDK does not provide any direct
15.47/5.01 * implementations of this interface: it provides implementations of more
15.47/5.01 * specific subinterfaces like Set and List. This interface
15.47/5.01 * is typically used to pass collections around and manipulate them where
15.47/5.01 * maximum generality is desired.
15.47/5.01 *
15.47/5.01 * Bags or multisets (unordered collections that may contain
15.47/5.01 * duplicate elements) should implement this interface directly.
15.47/5.01 *
15.47/5.01 *
All general-purpose Collection implementation classes (which
15.47/5.01 * typically implement Collection indirectly through one of its
15.47/5.01 * subinterfaces) should provide two "standard" constructors: a void (no
15.47/5.01 * arguments) constructor, which creates an empty collection, and a
15.47/5.01 * constructor with a single argument of type Collection, which
15.47/5.01 * creates a new collection with the same elements as its argument. In
15.47/5.01 * effect, the latter constructor allows the user to copy any collection,
15.47/5.01 * producing an equivalent collection of the desired implementation type.
15.47/5.01 * There is no way to enforce this convention (as interfaces cannot contain
15.47/5.01 * constructors) but all of the general-purpose Collection
15.47/5.01 * implementations in the Java platform libraries comply.
15.47/5.01 *
15.47/5.01 *
The "destructive" methods contained in this interface, that is, the
15.47/5.01 * methods that modify the collection on which they operate, are specified to
15.47/5.01 * throw UnsupportedOperationException if this collection does not
15.47/5.01 * support the operation. If this is the case, these methods may, but are not
15.47/5.01 * required to, throw an UnsupportedOperationException if the
15.47/5.01 * invocation would have no effect on the collection. For example, invoking
15.47/5.01 * the {@link #addAll(Collection)} method on an unmodifiable collection may,
15.47/5.01 * but is not required to, throw the exception if the collection to be added
15.47/5.01 * is empty.
15.47/5.01 *
15.47/5.01 *
Some collection implementations have restrictions on the elements that
15.47/5.01 * they may contain. For example, some implementations prohibit null elements,
15.47/5.01 * and some have restrictions on the types of their elements. Attempting to
15.47/5.01 * add an ineligible element throws an unchecked exception, typically
15.47/5.01 * NullPointerException or ClassCastException. Attempting
15.47/5.01 * to query the presence of an ineligible element may throw an exception,
15.47/5.01 * or it may simply return false; some implementations will exhibit the former
15.47/5.01 * behavior and some will exhibit the latter. More generally, attempting an
15.47/5.01 * operation on an ineligible element whose completion would not result in
15.47/5.01 * the insertion of an ineligible element into the collection may throw an
15.47/5.01 * exception or it may succeed, at the option of the implementation.
15.47/5.01 * Such exceptions are marked as "optional" in the specification for this
15.47/5.01 * interface.
15.47/5.01 *
15.47/5.01 *
It is up to each collection to determine its own synchronization
15.47/5.01 * policy. In the absence of a stronger guarantee by the
15.47/5.01 * implementation, undefined behavior may result from the invocation
15.47/5.01 * of any method on a collection that is being mutated by another
15.47/5.01 * thread; this includes direct invocations, passing the collection to
15.47/5.01 * a method that might perform invocations, and using an existing
15.47/5.01 * iterator to examine the collection.
15.47/5.01 *
15.47/5.01 *
Many methods in Collections Framework interfaces are defined in
15.47/5.01 * terms of the {@link Object#equals(Object) equals} method. For example,
15.47/5.01 * the specification for the {@link #contains(Object) contains(Object o)}
15.47/5.01 * method says: "returns true if and only if this collection
15.47/5.01 * contains at least one element e such that
15.47/5.01 * (o==null ? e==null : o.equals(e))." This specification should
15.47/5.01 * not be construed to imply that invoking Collection.contains
15.47/5.01 * with a non-null argument o will cause o.equals(e) to be
15.47/5.01 * invoked for any element e. Implementations are free to implement
15.47/5.01 * optimizations whereby the equals invocation is avoided, for
15.47/5.01 * example, by first comparing the hash codes of the two elements. (The
15.47/5.01 * {@link Object#hashCode()} specification guarantees that two objects with
15.47/5.01 * unequal hash codes cannot be equal.) More generally, implementations of
15.47/5.01 * the various Collections Framework interfaces are free to take advantage of
15.47/5.01 * the specified behavior of underlying {@link Object} methods wherever the
15.47/5.01 * implementor deems it appropriate.
15.47/5.01 *
15.47/5.01 *
This interface is a member of the
15.47/5.01 *
15.47/5.01 * Java Collections Framework.
15.47/5.01 *
15.47/5.01 * @author Josh Bloch
15.47/5.01 * @author Neal Gafter
15.47/5.01 * @see Set
15.47/5.01 * @see List
15.47/5.01 * @see Map
15.47/5.01 * @see SortedSet
15.47/5.01 * @see SortedMap
15.47/5.01 * @see HashSet
15.47/5.01 * @see TreeSet
15.47/5.01 * @see ArrayList
15.47/5.01 * @see LinkedList
15.47/5.01 * @see Vector
15.47/5.01 * @see Collections
15.47/5.01 * @see Arrays
15.47/5.01 * @see AbstractCollection
15.47/5.01 * @since 1.2
15.47/5.01 */
15.47/5.01
15.47/5.01 public interface Collection {
15.47/5.01 // Query Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns the number of elements in this collection. If this collection
15.47/5.01 * contains more than Integer.MAX_VALUE elements, returns
15.47/5.01 * Integer.MAX_VALUE.
15.47/5.01 *
15.47/5.01 * @return the number of elements in this collection
15.47/5.01 */
15.47/5.01 int size();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns true if this collection contains no elements.
15.47/5.01 *
15.47/5.01 * @return true if this collection contains no elements
15.47/5.01 */
15.47/5.01 boolean isEmpty();
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns true if this collection contains the specified element.
15.47/5.01 * More formally, returns true if and only if this collection
15.47/5.01 * contains at least one element e such that
15.47/5.01 * (o==null ? e==null : o.equals(e)).
15.47/5.01 *
15.47/5.01 * @param o element whose presence in this collection is to be tested
15.47/5.01 * @return true if this collection contains the specified
15.47/5.01 * element
15.47/5.01 * @throws ClassCastException if the type of the specified element
15.47/5.01 * is incompatible with this collection (optional)
15.47/5.01 * @throws NullPointerException if the specified element is null and this
15.47/5.01 * collection does not permit null elements (optional)
15.47/5.01 */
15.47/5.01 boolean contains(Object o);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns an iterator over the elements in this collection. There are no
15.47/5.01 * guarantees concerning the order in which the elements are returned
15.47/5.01 * (unless this collection is an instance of some class that provides a
15.47/5.01 * guarantee).
15.47/5.01 *
15.47/5.01 * @return an Iterator over the elements in this collection
15.47/5.01 */
15.47/5.01 Iterator iterator();
15.47/5.01
15.47/5.01 // Modification Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Ensures that this collection contains the specified element (optional
15.47/5.01 * operation). Returns true if this collection changed as a
15.47/5.01 * result of the call. (Returns false if this collection does
15.47/5.01 * not permit duplicates and already contains the specified element.)
15.47/5.01 *
15.47/5.01 * Collections that support this operation may place limitations on what
15.47/5.01 * elements may be added to this collection. In particular, some
15.47/5.01 * collections will refuse to add null elements, and others will
15.47/5.01 * impose restrictions on the type of elements that may be added.
15.47/5.01 * Collection classes should clearly specify in their documentation any
15.47/5.01 * restrictions on what elements may be added.
15.47/5.01 *
15.47/5.01 * If a collection refuses to add a particular element for any reason
15.47/5.01 * other than that it already contains the element, it must throw
15.47/5.01 * an exception (rather than returning false). This preserves
15.47/5.01 * the invariant that a collection always contains the specified element
15.47/5.01 * after this call returns.
15.47/5.01 *
15.47/5.01 * @param e element whose presence in this collection is to be ensured
15.47/5.01 * @return true if this collection changed as a result of the
15.47/5.01 * call
15.47/5.01 * @throws UnsupportedOperationException if the add operation
15.47/5.01 * is not supported by this collection
15.47/5.01 * @throws ClassCastException if the class of the specified element
15.47/5.01 * prevents it from being added to this collection
15.47/5.01 * @throws NullPointerException if the specified element is null and this
15.47/5.01 * collection does not permit null elements
15.47/5.01 * @throws IllegalArgumentException if some property of the element
15.47/5.01 * prevents it from being added to this collection
15.47/5.01 * @throws IllegalStateException if the element cannot be added at this
15.47/5.01 * time due to insertion restrictions
15.47/5.01 */
15.47/5.01 boolean add(E e);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes a single instance of the specified element from this
15.47/5.01 * collection, if it is present (optional operation). More formally,
15.47/5.01 * removes an element e such that
15.47/5.01 * (o==null ? e==null : o.equals(e)), if
15.47/5.01 * this collection contains one or more such elements. Returns
15.47/5.01 * true if this collection contained the specified element (or
15.47/5.01 * equivalently, if this collection changed as a result of the call).
15.47/5.01 *
15.47/5.01 * @param o element to be removed from this collection, if present
15.47/5.01 * @return true if an element was removed as a result of this call
15.47/5.01 * @throws ClassCastException if the type of the specified element
15.47/5.01 * is incompatible with this collection (optional)
15.47/5.01 * @throws NullPointerException if the specified element is null and this
15.47/5.01 * collection does not permit null elements (optional)
15.47/5.01 * @throws UnsupportedOperationException if the remove operation
15.47/5.01 * is not supported by this collection
15.47/5.01 */
15.47/5.01 boolean remove(Object o);
15.47/5.01
15.47/5.01
15.47/5.01 // Bulk Operations
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Returns true if this collection contains all of the elements
15.47/5.01 * in the specified collection.
15.47/5.01 *
15.47/5.01 * @param c collection to be checked for containment in this collection
15.47/5.01 * @return true if this collection contains all of the elements
15.47/5.01 * in the specified collection
15.47/5.01 * @throws ClassCastException if the types of one or more elements
15.47/5.01 * in the specified collection are incompatible with this
15.47/5.01 * collection (optional)
15.47/5.01 * @throws NullPointerException if the specified collection contains one
15.47/5.01 * or more null elements and this collection does not permit null
15.47/5.01 * elements (optional), or if the specified collection is null
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 boolean containsAll(Collection c);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Adds all of the elements in the specified collection to this collection
15.47/5.01 * (optional operation). The behavior of this operation is undefined if
15.47/5.01 * the specified collection is modified while the operation is in progress.
15.47/5.01 * (This implies that the behavior of this call is undefined if the
15.47/5.01 * specified collection is this collection, and this collection is
15.47/5.01 * nonempty.)
15.47/5.01 *
15.47/5.01 * @param c collection containing elements to be added to this collection
15.47/5.01 * @return true if this collection changed as a result of the call
15.47/5.01 * @throws UnsupportedOperationException if the addAll operation
15.47/5.01 * is not supported by this collection
15.47/5.01 * @throws ClassCastException if the class of an element of the specified
15.47/5.01 * collection prevents it from being added to this collection
15.47/5.01 * @throws NullPointerException if the specified collection contains a
15.47/5.01 * null element and this collection does not permit null elements,
15.47/5.01 * or if the specified collection is null
15.47/5.01 * @throws IllegalArgumentException if some property of an element of the
15.47/5.01 * specified collection prevents it from being added to this
15.47/5.01 * collection
15.47/5.01 * @throws IllegalStateException if not all the elements can be added at
15.47/5.01 * this time due to insertion restrictions
15.47/5.01 * @see #add(Object)
15.47/5.01 */
15.47/5.01 boolean addAll(Collection c);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes all of this collection's elements that are also contained in the
15.47/5.01 * specified collection (optional operation). After this call returns,
15.47/5.01 * this collection will contain no elements in common with the specified
15.47/5.01 * collection.
15.47/5.01 *
15.47/5.01 * @param c collection containing elements to be removed from this collection
15.47/5.01 * @return true if this collection changed as a result of the
15.47/5.01 * call
15.47/5.01 * @throws UnsupportedOperationException if the removeAll method
15.47/5.01 * is not supported by this collection
15.47/5.01 * @throws ClassCastException if the types of one or more elements
15.47/5.01 * in this collection are incompatible with the specified
15.47/5.01 * collection (optional)
15.47/5.01 * @throws NullPointerException if this collection contains one or more
15.47/5.01 * null elements and the specified collection does not support
15.47/5.01 * null elements (optional), or if the specified collection is null
15.47/5.01 * @see #remove(Object)
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 boolean removeAll(Collection c);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Retains only the elements in this collection that are contained in the
15.47/5.01 * specified collection (optional operation). In other words, removes from
15.47/5.01 * this collection all of its elements that are not contained in the
15.47/5.01 * specified collection.
15.47/5.01 *
15.47/5.01 * @param c collection containing elements to be retained in this collection
15.47/5.01 * @return true if this collection changed as a result of the call
15.47/5.01 * @throws UnsupportedOperationException if the retainAll operation
15.47/5.01 * is not supported by this collection
15.47/5.01 * @throws ClassCastException if the types of one or more elements
15.47/5.01 * in this collection are incompatible with the specified
15.47/5.01 * collection (optional)
15.47/5.01 * @throws NullPointerException if this collection contains one or more
15.47/5.01 * null elements and the specified collection does not permit null
15.47/5.01 * elements (optional), or if the specified collection is null
15.47/5.01 * @see #remove(Object)
15.47/5.01 * @see #contains(Object)
15.47/5.01 */
15.47/5.01 boolean retainAll(Collection c);
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Removes all of the elements from this collection (optional operation).
15.47/5.01 * The collection will be empty after this method returns.
15.47/5.01 *
15.47/5.01 * @throws UnsupportedOperationException if the clear operation
15.47/5.01 * is not supported by this collection
15.47/5.01 */
15.47/5.01 void clear();
15.47/5.01
15.47/5.01
15.47/5.01 // Comparison and hashing
15.47/5.01
15.47/5.01 /**
15.47/5.01 * Compares the specified object with this collection for equality.
15.47/5.01 *
15.47/5.01 * While the Collection interface adds no stipulations to the
15.47/5.01 * general contract for the Object.equals, programmers who
15.47/5.01 * implement the Collection interface "directly" (in other words,
15.47/5.01 * create a class that is a Collection but is not a Set
15.47/5.01 * or a List) must exercise care if they choose to override the
15.47/5.01 * Object.equals. It is not necessary to do so, and the simplest
15.47/5.01 * course of action is to rely on Object's implementation, but
15.47/5.01 * the implementor may wish to implement a "value comparison" in place of
15.47/5.01 * the default "reference comparison." (The List and
15.47/5.01 * Set interfaces mandate such value comparisons.)
15.47/5.01 *
15.47/5.01 * The general contract for the Object.equals method states that
15.47/5.01 * equals must be symmetric (in other words, a.equals(b) if and
15.47/5.01 * only if b.equals(a)). The contracts for List.equals
15.47/5.01 * and Set.equals state that lists are only equal to other lists,
15.47/5.01 * and sets to other sets. Thus, a custom equals method for a
15.47/5.01 * collection class that implements neither the List nor
15.47/5.01 * Set interface must return false when this collection
15.47/5.01 * is compared to any list or set. (By the same logic, it is not possible
15.47/5.01 * to write a class that correctly implements both the Set and
15.47/5.01 * List interfaces.)
15.47/5.01 *
15.47/5.01 * @param o object to be compared for equality with this collection
15.47/5.01 * @return true if the specified object is equal to this
15.47/5.01 * collection
15.47/5.01 *
15.47/5.02 * @see Object#equals(Object)
15.47/5.02 * @see Set#equals(Object)
15.47/5.02 * @see List#equals(Object)
15.47/5.02 */
15.47/5.02 boolean equals(Object o);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the hash code value for this collection. While the
15.47/5.02 * Collection interface adds no stipulations to the general
15.47/5.02 * contract for the Object.hashCode method, programmers should
15.47/5.02 * take note that any class that overrides the Object.equals
15.47/5.02 * method must also override the Object.hashCode method in order
15.47/5.02 * to satisfy the general contract for the Object.hashCodemethod.
15.47/5.02 * In particular, c1.equals(c2) implies that
15.47/5.02 * c1.hashCode()==c2.hashCode().
15.47/5.02 *
15.47/5.02 * @return the hash code value for this collection
15.47/5.02 *
15.47/5.02 * @see Object#hashCode()
15.47/5.02 * @see Object#equals(Object)
15.47/5.02 */
15.47/5.02 int hashCode();
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * This exception may be thrown by methods that have detected concurrent
15.47/5.02 * modification of an object when such modification is not permissible.
15.47/5.02 *
15.47/5.02 * For example, it is not generally permissible for one thread to modify a Collection
15.47/5.02 * while another thread is iterating over it. In general, the results of the
15.47/5.02 * iteration are undefined under these circumstances. Some Iterator
15.47/5.02 * implementations (including those of all the general purpose collection implementations
15.47/5.02 * provided by the JRE) may choose to throw this exception if this behavior is
15.47/5.02 * detected. Iterators that do this are known as fail-fast iterators,
15.47/5.02 * as they fail quickly and cleanly, rather that risking arbitrary,
15.47/5.02 * non-deterministic behavior at an undetermined time in the future.
15.47/5.02 *
15.47/5.02 * Note that this exception does not always indicate that an object has
15.47/5.02 * been concurrently modified by a different thread. If a single
15.47/5.02 * thread issues a sequence of method invocations that violates the
15.47/5.02 * contract of an object, the object may throw this exception. For
15.47/5.02 * example, if a thread modifies a collection directly while it is
15.47/5.02 * iterating over the collection with a fail-fast iterator, the iterator
15.47/5.02 * will throw this exception.
15.47/5.02 *
15.47/5.02 *
Note that fail-fast behavior cannot be guaranteed as it is, generally
15.47/5.02 * speaking, impossible to make any hard guarantees in the presence of
15.47/5.02 * unsynchronized concurrent modification. Fail-fast operations
15.47/5.02 * throw ConcurrentModificationException on a best-effort basis.
15.47/5.02 * Therefore, it would be wrong to write a program that depended on this
15.47/5.02 * exception for its correctness: ConcurrentModificationException
15.47/5.02 * should be used only to detect bugs.
15.47/5.02 *
15.47/5.02 * @author Josh Bloch
15.47/5.02 * @see Collection
15.47/5.02 * @see Iterator
15.47/5.02 * @see ListIterator
15.47/5.02 * @see Vector
15.47/5.02 * @see LinkedList
15.47/5.02 * @see HashSet
15.47/5.02 * @see Hashtable
15.47/5.02 * @see TreeMap
15.47/5.02 * @see AbstractList
15.47/5.02 * @since 1.2
15.47/5.02 */
15.47/5.02 public class ConcurrentModificationException extends RuntimeException {
15.47/5.02 /**
15.47/5.02 * Constructs a ConcurrentModificationException with no
15.47/5.02 * detail message.
15.47/5.02 */
15.47/5.02 public ConcurrentModificationException() {
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a ConcurrentModificationException with the
15.47/5.02 * specified detail message.
15.47/5.02 *
15.47/5.02 * @param message the detail message pertaining to this exception.
15.47/5.02 */
15.47/5.02 public ConcurrentModificationException(String message) {
15.47/5.02 super(message);
15.47/5.02 }
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 /*
15.47/5.02 * This file is available under and governed by the GNU General Public
15.47/5.02 * License version 2 only, as published by the Free Software Foundation.
15.47/5.02 * However, the following notice accompanied the original version of this
15.47/5.02 * file:
15.47/5.02 *
15.47/5.02 * Written by Doug Lea and Josh Bloch with assistance from members of
15.47/5.02 * JCP JSR-166 Expert Group and released to the public domain, as explained
15.47/5.02 * at http://creativecommons.org/licenses/publicdomain
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * A linear collection that supports element insertion and removal at
15.47/5.02 * both ends. The name deque is short for "double ended queue"
15.47/5.02 * and is usually pronounced "deck". Most Deque
15.47/5.02 * implementations place no fixed limits on the number of elements
15.47/5.02 * they may contain, but this interface supports capacity-restricted
15.47/5.02 * deques as well as those with no fixed size limit.
15.47/5.02 *
15.47/5.02 *
This interface defines methods to access the elements at both
15.47/5.02 * ends of the deque. Methods are provided to insert, remove, and
15.47/5.02 * examine the element. Each of these methods exists in two forms:
15.47/5.02 * one throws an exception if the operation fails, the other returns a
15.47/5.02 * special value (either null or false, depending on
15.47/5.02 * the operation). The latter form of the insert operation is
15.47/5.02 * designed specifically for use with capacity-restricted
15.47/5.02 * Deque implementations; in most implementations, insert
15.47/5.02 * operations cannot fail.
15.47/5.02 *
15.47/5.02 *
The twelve methods described above are summarized in the
15.47/5.02 * following table:
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * |
15.47/5.02 * First Element (Head) |
15.47/5.02 * Last Element (Tail) |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * |
15.47/5.02 * Throws exception |
15.47/5.02 * Special value |
15.47/5.02 * Throws exception |
15.47/5.02 * Special value |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | Insert |
15.47/5.02 * {@link #addFirst addFirst(e)} |
15.47/5.02 * {@link #offerFirst offerFirst(e)} |
15.47/5.02 * {@link #addLast addLast(e)} |
15.47/5.02 * {@link #offerLast offerLast(e)} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | Remove |
15.47/5.02 * {@link #removeFirst removeFirst()} |
15.47/5.02 * {@link #pollFirst pollFirst()} |
15.47/5.02 * {@link #removeLast removeLast()} |
15.47/5.02 * {@link #pollLast pollLast()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | Examine |
15.47/5.02 * {@link #getFirst getFirst()} |
15.47/5.02 * {@link #peekFirst peekFirst()} |
15.47/5.02 * {@link #getLast getLast()} |
15.47/5.02 * {@link #peekLast peekLast()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * This interface extends the {@link Queue} interface. When a deque is
15.47/5.02 * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are
15.47/5.02 * added at the end of the deque and removed from the beginning. The methods
15.47/5.02 * inherited from the Queue interface are precisely equivalent to
15.47/5.02 * Deque methods as indicated in the following table:
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | Queue Method |
15.47/5.02 * Equivalent Deque Method |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#add add(e)} |
15.47/5.02 * {@link #addLast addLast(e)} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#offer offer(e)} |
15.47/5.02 * {@link #offerLast offerLast(e)} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#remove remove()} |
15.47/5.02 * {@link #removeFirst removeFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#poll poll()} |
15.47/5.02 * {@link #pollFirst pollFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#element element()} |
15.47/5.02 * {@link #getFirst getFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link java.util.Queue#peek peek()} |
15.47/5.02 * {@link #peek peekFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * Deques can also be used as LIFO (Last-In-First-Out) stacks. This
15.47/5.02 * interface should be used in preference to the legacy {@link Stack} class.
15.47/5.02 * When a deque is used as a stack, elements are pushed and popped from the
15.47/5.02 * beginning of the deque. Stack methods are precisely equivalent to
15.47/5.02 * Deque methods as indicated in the table below:
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | Stack Method |
15.47/5.02 * Equivalent Deque Method |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link #push push(e)} |
15.47/5.02 * {@link #addFirst addFirst(e)} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link #pop pop()} |
15.47/5.02 * {@link #removeFirst removeFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * | {@link #peek peek()} |
15.47/5.02 * {@link #peekFirst peekFirst()} |
15.47/5.02 *
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * Note that the {@link #peek peek} method works equally well when
15.47/5.02 * a deque is used as a queue or a stack; in either case, elements are
15.47/5.02 * drawn from the beginning of the deque.
15.47/5.02 *
15.47/5.02 *
This interface provides two methods to remove interior
15.47/5.02 * elements, {@link #removeFirstOccurrence removeFirstOccurrence} and
15.47/5.02 * {@link #removeLastOccurrence removeLastOccurrence}.
15.47/5.02 *
15.47/5.02 *
Unlike the {@link List} interface, this interface does not
15.47/5.02 * provide support for indexed access to elements.
15.47/5.02 *
15.47/5.02 *
While Deque implementations are not strictly required
15.47/5.02 * to prohibit the insertion of null elements, they are strongly
15.47/5.02 * encouraged to do so. Users of any Deque implementations
15.47/5.02 * that do allow null elements are strongly encouraged not to
15.47/5.02 * take advantage of the ability to insert nulls. This is so because
15.47/5.02 * null is used as a special return value by various methods
15.47/5.02 * to indicated that the deque is empty.
15.47/5.02 *
15.47/5.02 *
Deque implementations generally do not define
15.47/5.02 * element-based versions of the equals and hashCode
15.47/5.02 * methods, but instead inherit the identity-based versions from class
15.47/5.02 * Object.
15.47/5.02 *
15.47/5.02 *
This interface is a member of the Java Collections
15.47/5.02 * Framework.
15.47/5.02 *
15.47/5.02 * @author Doug Lea
15.47/5.02 * @author Josh Bloch
15.47/5.02 * @since 1.6
15.47/5.02 * @param the type of elements held in this collection
15.47/5.02 */
15.47/5.02
15.47/5.02 public interface Deque extends Queue {
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the front of this deque if it is
15.47/5.02 * possible to do so immediately without violating capacity restrictions.
15.47/5.02 * When using a capacity-restricted deque, it is generally preferable to
15.47/5.02 * use method {@link #offerFirst}.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @throws IllegalStateException if the element cannot be added at this
15.47/5.02 * time due to capacity restrictions
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 void addFirst(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the end of this deque if it is
15.47/5.02 * possible to do so immediately without violating capacity restrictions.
15.47/5.02 * When using a capacity-restricted deque, it is generally preferable to
15.47/5.02 * use method {@link #offerLast}.
15.47/5.02 *
15.47/5.02 * This method is equivalent to {@link #add}.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @throws IllegalStateException if the element cannot be added at this
15.47/5.02 * time due to capacity restrictions
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 void addLast(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the front of this deque unless it would
15.47/5.02 * violate capacity restrictions. When using a capacity-restricted deque,
15.47/5.02 * this method is generally preferable to the {@link #addFirst} method,
15.47/5.02 * which can fail to insert an element only by throwing an exception.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @return true if the element was added to this deque, else
15.47/5.02 * false
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 boolean offerFirst(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the end of this deque unless it would
15.47/5.02 * violate capacity restrictions. When using a capacity-restricted deque,
15.47/5.02 * this method is generally preferable to the {@link #addLast} method,
15.47/5.02 * which can fail to insert an element only by throwing an exception.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @return true if the element was added to this deque, else
15.47/5.02 * false
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 boolean offerLast(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the first element of this deque. This method
15.47/5.02 * differs from {@link #pollFirst pollFirst} only in that it throws an
15.47/5.02 * exception if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the head of this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E removeFirst();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the last element of this deque. This method
15.47/5.02 * differs from {@link #pollLast pollLast} only in that it throws an
15.47/5.02 * exception if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the tail of this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E removeLast();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the first element of this deque,
15.47/5.02 * or returns null if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the head of this deque, or null if this deque is empty
15.47/5.02 */
15.47/5.02 E pollFirst();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the last element of this deque,
15.47/5.02 * or returns null if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the tail of this deque, or null if this deque is empty
15.47/5.02 */
15.47/5.02 E pollLast();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the first element of this deque.
15.47/5.02 *
15.47/5.02 * This method differs from {@link #peekFirst peekFirst} only in that it
15.47/5.02 * throws an exception if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the head of this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E getFirst();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the last element of this deque.
15.47/5.02 * This method differs from {@link #peekLast peekLast} only in that it
15.47/5.02 * throws an exception if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the tail of this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E getLast();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the first element of this deque,
15.47/5.02 * or returns null if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the head of this deque, or null if this deque is empty
15.47/5.02 */
15.47/5.02 E peekFirst();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the last element of this deque,
15.47/5.02 * or returns null if this deque is empty.
15.47/5.02 *
15.47/5.02 * @return the tail of this deque, or null if this deque is empty
15.47/5.02 */
15.47/5.02 E peekLast();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the first occurrence of the specified element from this deque.
15.47/5.02 * If the deque does not contain the element, it is unchanged.
15.47/5.02 * More formally, removes the first element e such that
15.47/5.02 * (o==null ? e==null : o.equals(e))
15.47/5.02 * (if such an element exists).
15.47/5.02 * Returns true if this deque contained the specified element
15.47/5.02 * (or equivalently, if this deque changed as a result of the call).
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this deque, if present
15.47/5.02 * @return true if an element was removed as a result of this call
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * is incompatible with this deque (optional)
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements (optional)
15.47/5.02 */
15.47/5.02 boolean removeFirstOccurrence(Object o);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the last occurrence of the specified element from this deque.
15.47/5.02 * If the deque does not contain the element, it is unchanged.
15.47/5.02 * More formally, removes the last element e such that
15.47/5.02 * (o==null ? e==null : o.equals(e))
15.47/5.02 * (if such an element exists).
15.47/5.02 * Returns true if this deque contained the specified element
15.47/5.02 * (or equivalently, if this deque changed as a result of the call).
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this deque, if present
15.47/5.02 * @return true if an element was removed as a result of this call
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * is incompatible with this deque (optional)
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements (optional)
15.47/5.02 */
15.47/5.02 boolean removeLastOccurrence(Object o);
15.47/5.02
15.47/5.02 // *** Queue methods ***
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element into the queue represented by this deque
15.47/5.02 * (in other words, at the tail of this deque) if it is possible to do so
15.47/5.02 * immediately without violating capacity restrictions, returning
15.47/5.02 * true upon success and throwing an
15.47/5.02 * IllegalStateException if no space is currently available.
15.47/5.02 * When using a capacity-restricted deque, it is generally preferable to
15.47/5.02 * use {@link #offer(Object) offer}.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #addLast}.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @return true (as specified by {@link Collection#add})
15.47/5.02 * @throws IllegalStateException if the element cannot be added at this
15.47/5.02 * time due to capacity restrictions
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 boolean add(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element into the queue represented by this deque
15.47/5.02 * (in other words, at the tail of this deque) if it is possible to do so
15.47/5.02 * immediately without violating capacity restrictions, returning
15.47/5.02 * true upon success and false if no space is currently
15.47/5.02 * available. When using a capacity-restricted deque, this method is
15.47/5.02 * generally preferable to the {@link #add} method, which can fail to
15.47/5.02 * insert an element only by throwing an exception.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #offerLast}.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @return true if the element was added to this deque, else
15.47/5.02 * false
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 boolean offer(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the head of the queue represented by this deque
15.47/5.02 * (in other words, the first element of this deque).
15.47/5.02 * This method differs from {@link #poll poll} only in that it throws an
15.47/5.02 * exception if this deque is empty.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #removeFirst()}.
15.47/5.02 *
15.47/5.02 * @return the head of the queue represented by this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E remove();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the head of the queue represented by this deque
15.47/5.02 * (in other words, the first element of this deque), or returns
15.47/5.02 * null if this deque is empty.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #pollFirst()}.
15.47/5.02 *
15.47/5.02 * @return the first element of this deque, or null if
15.47/5.02 * this deque is empty
15.47/5.02 */
15.47/5.02 E poll();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the head of the queue represented by
15.47/5.02 * this deque (in other words, the first element of this deque).
15.47/5.02 * This method differs from {@link #peek peek} only in that it throws an
15.47/5.02 * exception if this deque is empty.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #getFirst()}.
15.47/5.02 *
15.47/5.02 * @return the head of the queue represented by this deque
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E element();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the head of the queue represented by
15.47/5.02 * this deque (in other words, the first element of this deque), or
15.47/5.02 * returns null if this deque is empty.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #peekFirst()}.
15.47/5.02 *
15.47/5.02 * @return the head of the queue represented by this deque, or
15.47/5.02 * null if this deque is empty
15.47/5.02 */
15.47/5.02 E peek();
15.47/5.02
15.47/5.02
15.47/5.02 // *** Stack methods ***
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Pushes an element onto the stack represented by this deque (in other
15.47/5.02 * words, at the head of this deque) if it is possible to do so
15.47/5.02 * immediately without violating capacity restrictions, returning
15.47/5.02 * true upon success and throwing an
15.47/5.02 * IllegalStateException if no space is currently available.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #addFirst}.
15.47/5.02 *
15.47/5.02 * @param e the element to push
15.47/5.02 * @throws IllegalStateException if the element cannot be added at this
15.47/5.02 * time due to capacity restrictions
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * prevents it from being added to this deque
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements
15.47/5.02 * @throws IllegalArgumentException if some property of the specified
15.47/5.02 * element prevents it from being added to this deque
15.47/5.02 */
15.47/5.02 void push(E e);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Pops an element from the stack represented by this deque. In other
15.47/5.02 * words, removes and returns the first element of this deque.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #removeFirst()}.
15.47/5.02 *
15.47/5.02 * @return the element at the front of this deque (which is the top
15.47/5.02 * of the stack represented by this deque)
15.47/5.02 * @throws NoSuchElementException if this deque is empty
15.47/5.02 */
15.47/5.02 E pop();
15.47/5.02
15.47/5.02
15.47/5.02 // *** Collection methods ***
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the first occurrence of the specified element from this deque.
15.47/5.02 * If the deque does not contain the element, it is unchanged.
15.47/5.02 * More formally, removes the first element e such that
15.47/5.02 * (o==null ? e==null : o.equals(e))
15.47/5.02 * (if such an element exists).
15.47/5.02 * Returns true if this deque contained the specified element
15.47/5.02 * (or equivalently, if this deque changed as a result of the call).
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #removeFirstOccurrence}.
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this deque, if present
15.47/5.02 * @return true if an element was removed as a result of this call
15.47/5.02 * @throws ClassCastException if the class of the specified element
15.47/5.02 * is incompatible with this deque (optional)
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements (optional)
15.47/5.02 */
15.47/5.02 boolean remove(Object o);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns true if this deque contains the specified element.
15.47/5.02 * More formally, returns true if and only if this deque contains
15.47/5.02 * at least one element e such that
15.47/5.02 * (o==null ? e==null : o.equals(e)).
15.47/5.02 *
15.47/5.02 * @param o element whose presence in this deque is to be tested
15.47/5.02 * @return true if this deque contains the specified element
15.47/5.02 * @throws ClassCastException if the type of the specified element
15.47/5.02 * is incompatible with this deque (optional)
15.47/5.02 * @throws NullPointerException if the specified element is null and this
15.47/5.02 * deque does not permit null elements (optional)
15.47/5.02 */
15.47/5.02 boolean contains(Object o);
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the number of elements in this deque.
15.47/5.02 *
15.47/5.02 * @return the number of elements in this deque
15.47/5.02 */
15.47/5.02 public int size();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns an iterator over the elements in this deque in proper sequence.
15.47/5.02 * The elements will be returned in order from first (head) to last (tail).
15.47/5.02 *
15.47/5.02 * @return an iterator over the elements in this deque in proper sequence
15.47/5.02 */
15.47/5.02 Iterator iterator();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns an iterator over the elements in this deque in reverse
15.47/5.02 * sequential order. The elements will be returned in order from
15.47/5.02 * last (tail) to first (head).
15.47/5.02 *
15.47/5.02 * @return an iterator over the elements in this deque in reverse
15.47/5.02 * sequence
15.47/5.02 */
15.47/5.02 Iterator descendingIterator();
15.47/5.02
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Thrown to indicate that a method has been passed an illegal or
15.47/5.02 * inappropriate argument.
15.47/5.02 *
15.47/5.02 * @author unascribed
15.47/5.02 * @see java.lang.Thread#setPriority(int)
15.47/5.02 * @since JDK1.0
15.47/5.02 */
15.47/5.02 public
15.47/5.02 class IllegalArgumentException extends RuntimeException {
15.47/5.02 /**
15.47/5.02 * Constructs an IllegalArgumentException with no
15.47/5.02 * detail message.
15.47/5.02 */
15.47/5.02 public IllegalArgumentException() {
15.47/5.02 super();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs an IllegalArgumentException with the
15.47/5.02 * specified detail message.
15.47/5.02 *
15.47/5.02 * @param s the detail message.
15.47/5.02 */
15.47/5.02 public IllegalArgumentException(String s) {
15.47/5.02 super(s);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a new exception with the specified detail message and
15.47/5.02 * cause.
15.47/5.02 *
15.47/5.02 * Note that the detail message associated with cause is
15.47/5.02 * not automatically incorporated in this exception's detail
15.47/5.02 * message.
15.47/5.02 *
15.47/5.02 * @param message the detail message (which is saved for later retrieval
15.47/5.02 * by the {@link Throwable#getMessage()} method).
15.47/5.02 * @param cause the cause (which is saved for later retrieval by the
15.47/5.02 * {@link Throwable#getCause()} method). (A null value
15.47/5.02 * is permitted, and indicates that the cause is nonexistent or
15.47/5.02 * unknown.)
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public IllegalArgumentException(String message, Throwable cause) {
15.47/5.02 super(message, cause);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a new exception with the specified cause and a detail
15.47/5.02 * message of (cause==null ? null : cause.toString()) (which
15.47/5.02 * typically contains the class and detail message of cause).
15.47/5.02 * This constructor is useful for exceptions that are little more than
15.47/5.02 * wrappers for other throwables (for example, {@link
15.47/5.02 * java.security.PrivilegedActionException}).
15.47/5.02 *
15.47/5.02 * @param cause the cause (which is saved for later retrieval by the
15.47/5.02 * {@link Throwable#getCause()} method). (A null value is
15.47/5.02 * permitted, and indicates that the cause is nonexistent or
15.47/5.02 * unknown.)
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public IllegalArgumentException(Throwable cause) {
15.47/5.02 super(cause);
15.47/5.02 }
15.47/5.02
15.47/5.02 private static final long serialVersionUID = -5365630128856068164L;
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * Copyright 1996-2003 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Signals that a method has been invoked at an illegal or
15.47/5.02 * inappropriate time. In other words, the Java environment or
15.47/5.02 * Java application is not in an appropriate state for the requested
15.47/5.02 * operation.
15.47/5.02 *
15.47/5.02 * @author Jonni Kanerva
15.47/5.02 * @since JDK1.1
15.47/5.02 */
15.47/5.02 public
15.47/5.02 class IllegalStateException extends RuntimeException {
15.47/5.02 /**
15.47/5.02 * Constructs an IllegalStateException with no detail message.
15.47/5.02 * A detail message is a String that describes this particular exception.
15.47/5.02 */
15.47/5.02 public IllegalStateException() {
15.47/5.02 super();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs an IllegalStateException with the specified detail
15.47/5.02 * message. A detail message is a String that describes this particular
15.47/5.02 * exception.
15.47/5.02 *
15.47/5.02 * @param s the String that contains a detailed message
15.47/5.02 */
15.47/5.02 public IllegalStateException(String s) {
15.47/5.02 super(s);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a new exception with the specified detail message and
15.47/5.02 * cause.
15.47/5.02 *
15.47/5.02 *
Note that the detail message associated with cause is
15.47/5.02 * not automatically incorporated in this exception's detail
15.47/5.02 * message.
15.47/5.02 *
15.47/5.02 * @param message the detail message (which is saved for later retrieval
15.47/5.02 * by the {@link Throwable#getMessage()} method).
15.47/5.02 * @param cause the cause (which is saved for later retrieval by the
15.47/5.02 * {@link Throwable#getCause()} method). (A null value
15.47/5.02 * is permitted, and indicates that the cause is nonexistent or
15.47/5.02 * unknown.)
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public IllegalStateException(String message, Throwable cause) {
15.47/5.02 super(message, cause);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a new exception with the specified cause and a detail
15.47/5.02 * message of (cause==null ? null : cause.toString()) (which
15.47/5.02 * typically contains the class and detail message of cause).
15.47/5.02 * This constructor is useful for exceptions that are little more than
15.47/5.02 * wrappers for other throwables (for example, {@link
15.47/5.02 * java.security.PrivilegedActionException}).
15.47/5.02 *
15.47/5.02 * @param cause the cause (which is saved for later retrieval by the
15.47/5.02 * {@link Throwable#getCause()} method). (A null value is
15.47/5.02 * permitted, and indicates that the cause is nonexistent or
15.47/5.02 * unknown.)
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public IllegalStateException(Throwable cause) {
15.47/5.02 super(cause);
15.47/5.02 }
15.47/5.02
15.47/5.02 static final long serialVersionUID = -1848914673093119416L;
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * An iterator over a collection. {@code Iterator} takes the place of
15.47/5.02 * {@link Enumeration} in the Java Collections Framework. Iterators
15.47/5.02 * differ from enumerations in two ways:
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * - Iterators allow the caller to remove elements from the
15.47/5.02 * underlying collection during the iteration with well-defined
15.47/5.02 * semantics.
15.47/5.02 *
- Method names have been improved.
15.47/5.02 *
15.47/5.02 *
15.47/5.02 * This interface is a member of the
15.47/5.02 *
15.47/5.02 * Java Collections Framework.
15.47/5.02 *
15.47/5.02 * @author Josh Bloch
15.47/5.02 * @see Collection
15.47/5.02 * @see ListIterator
15.47/5.02 * @see Iterable
15.47/5.02 * @since 1.2
15.47/5.02 */
15.47/5.02 public interface Iterator {
15.47/5.02 /**
15.47/5.02 * Returns {@code true} if the iteration has more elements.
15.47/5.02 * (In other words, returns {@code true} if {@link #next} would
15.47/5.02 * return an element rather than throwing an exception.)
15.47/5.02 *
15.47/5.02 * @return {@code true} if the iteration has more elements
15.47/5.02 */
15.47/5.02 boolean hasNext();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the next element in the iteration.
15.47/5.02 *
15.47/5.02 * @return the next element in the iteration
15.47/5.02 * @throws NoSuchElementException if the iteration has no more elements
15.47/5.02 */
15.47/5.02 E next();
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes from the underlying collection the last element returned
15.47/5.02 * by this iterator (optional operation). This method can be called
15.47/5.02 * only once per call to {@link #next}. The behavior of an iterator
15.47/5.02 * is unspecified if the underlying collection is modified while the
15.47/5.02 * iteration is in progress in any way other than by calling this
15.47/5.02 * method.
15.47/5.02 *
15.47/5.02 * @throws UnsupportedOperationException if the {@code remove}
15.47/5.02 * operation is not supported by this iterator
15.47/5.02 *
15.47/5.02 * @throws IllegalStateException if the {@code next} method has not
15.47/5.02 * yet been called, or the {@code remove} method has already
15.47/5.02 * been called after the last call to the {@code next}
15.47/5.02 * method
15.47/5.02 */
15.47/5.02 void remove();
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 public class juLinkedListCreateSet {
15.47/5.02 public static void main(String[] args) {
15.47/5.02 Random.args = args;
15.47/5.02
15.47/5.02 LinkedList l = createList(Random.random());
15.47/5.02 l.set(Random.random(), new Content(Random.random()));
15.47/5.02 }
15.47/5.02
15.47/5.02 public static LinkedList createList(int n) {
15.47/5.02 LinkedList l = new LinkedList();
15.47/5.02 while (n > 0) {
15.47/5.02 l.addLast(new Content(Random.random()));
15.47/5.02 n--;
15.47/5.02 }
15.47/5.02 return l;
15.47/5.02 }
15.47/5.02 }
15.47/5.02
15.47/5.02 final class Content {
15.47/5.02 int val;
15.47/5.02
15.47/5.02 public Content(int v) {
15.47/5.02 this.val = v;
15.47/5.02 }
15.47/5.02
15.47/5.02 public int hashCode() {
15.47/5.02 return val^31;
15.47/5.02 }
15.47/5.02
15.47/5.02 public boolean equals(Object o) {
15.47/5.02 if (o instanceof Content) {
15.47/5.02 return this.val == ((Content) o).val;
15.47/5.02 }
15.47/5.02 return false;
15.47/5.02 }
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 /*
15.47/5.02 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
15.47/5.02 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
15.47/5.02 *
15.47/5.02 * This code is free software; you can redistribute it and/or modify it
15.47/5.02 * under the terms of the GNU General Public License version 2 only, as
15.47/5.02 * published by the Free Software Foundation. Sun designates this
15.47/5.02 * particular file as subject to the "Classpath" exception as provided
15.47/5.02 * by Sun in the LICENSE file that accompanied this code.
15.47/5.02 *
15.47/5.02 * This code is distributed in the hope that it will be useful, but WITHOUT
15.47/5.02 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15.47/5.02 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15.47/5.02 * version 2 for more details (a copy is included in the LICENSE file that
15.47/5.02 * accompanied this code).
15.47/5.02 *
15.47/5.02 * You should have received a copy of the GNU General Public License version
15.47/5.02 * 2 along with this work; if not, write to the Free Software Foundation,
15.47/5.02 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
15.47/5.02 *
15.47/5.02 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
15.47/5.02 * CA 95054 USA or visit www.sun.com if you need additional information or
15.47/5.02 * have any questions.
15.47/5.02 */
15.47/5.02
15.47/5.02 package javaUtilEx;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Linked list implementation of the List interface. Implements all
15.47/5.02 * optional list operations, and permits all elements (including
15.47/5.02 * null). In addition to implementing the List interface,
15.47/5.02 * the LinkedList class provides uniformly named methods to
15.47/5.02 * get, remove and insert an element at the
15.47/5.02 * beginning and end of the list. These operations allow linked lists to be
15.47/5.02 * used as a stack, {@linkplain Queue queue}, or {@linkplain Deque
15.47/5.02 * double-ended queue}.
15.47/5.02 *
15.47/5.02 * The class implements the Deque interface, providing
15.47/5.02 * first-in-first-out queue operations for add,
15.47/5.02 * poll, along with other stack and deque operations.
15.47/5.02 *
15.47/5.02 * All of the operations perform as could be expected for a doubly-linked
15.47/5.02 * list. Operations that index into the list will traverse the list from
15.47/5.02 * the beginning or the end, whichever is closer to the specified index.
15.47/5.02 *
15.47/5.02 *
Note that this implementation is not synchronized.
15.47/5.02 * If multiple threads access a linked list concurrently, and at least
15.47/5.02 * one of the threads modifies the list structurally, it must be
15.47/5.02 * synchronized externally. (A structural modification is any operation
15.47/5.02 * that adds or deletes one or more elements; merely setting the value of
15.47/5.02 * an element is not a structural modification.) This is typically
15.47/5.02 * accomplished by synchronizing on some object that naturally
15.47/5.02 * encapsulates the list.
15.47/5.02 *
15.47/5.02 * If no such object exists, the list should be "wrapped" using the
15.47/5.02 * {@link Collections#synchronizedList Collections.synchronizedList}
15.47/5.02 * method. This is best done at creation time, to prevent accidental
15.47/5.02 * unsynchronized access to the list:
15.47/5.02 * List list = Collections.synchronizedList(new LinkedList(...));
15.47/5.02 *
15.47/5.02 * The iterators returned by this class's iterator and
15.47/5.02 * listIterator methods are fail-fast: if the list is
15.47/5.02 * structurally modified at any time after the iterator is created, in
15.47/5.02 * any way except through the Iterator's own remove or
15.47/5.02 * add methods, the iterator will throw a {@link
15.47/5.02 * ConcurrentModificationException}. Thus, in the face of concurrent
15.47/5.02 * modification, the iterator fails quickly and cleanly, rather than
15.47/5.02 * risking arbitrary, non-deterministic behavior at an undetermined
15.47/5.02 * time in the future.
15.47/5.02 *
15.47/5.02 *
Note that the fail-fast behavior of an iterator cannot be guaranteed
15.47/5.02 * as it is, generally speaking, impossible to make any hard guarantees in the
15.47/5.02 * presence of unsynchronized concurrent modification. Fail-fast iterators
15.47/5.02 * throw ConcurrentModificationException on a best-effort basis.
15.47/5.02 * Therefore, it would be wrong to write a program that depended on this
15.47/5.02 * exception for its correctness: the fail-fast behavior of iterators
15.47/5.02 * should be used only to detect bugs.
15.47/5.02 *
15.47/5.02 *
This class is a member of the
15.47/5.02 *
15.47/5.02 * Java Collections Framework.
15.47/5.02 *
15.47/5.02 * @author Josh Bloch
15.47/5.02 * @see List
15.47/5.02 * @see ArrayList
15.47/5.02 * @see Vector
15.47/5.02 * @since 1.2
15.47/5.02 * @param the type of elements held in this collection
15.47/5.02 */
15.47/5.02
15.47/5.02 public class LinkedList
15.47/5.02 extends AbstractSequentialList
15.47/5.02 implements List, Deque
15.47/5.02 {
15.47/5.02 private transient Entry header = new Entry(null, null, null);
15.47/5.02 private transient int size = 0;
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs an empty list.
15.47/5.02 */
15.47/5.02 public LinkedList() {
15.47/5.02 header.next = header.previous = header;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Constructs a list containing the elements of the specified
15.47/5.02 * collection, in the order they are returned by the collection's
15.47/5.02 * iterator.
15.47/5.02 *
15.47/5.02 * @param c the collection whose elements are to be placed into this list
15.47/5.02 * @throws NullPointerException if the specified collection is null
15.47/5.02 */
15.47/5.02 public LinkedList(Collection c) {
15.47/5.02 this();
15.47/5.02 addAll(c);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the first element in this list.
15.47/5.02 *
15.47/5.02 * @return the first element in this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 */
15.47/5.02 public E getFirst() {
15.47/5.02 if (size==0)
15.47/5.02 throw new NoSuchElementException();
15.47/5.02
15.47/5.02 return header.next.element;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the last element in this list.
15.47/5.02 *
15.47/5.02 * @return the last element in this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 */
15.47/5.02 public E getLast() {
15.47/5.02 if (size==0)
15.47/5.02 throw new NoSuchElementException();
15.47/5.02
15.47/5.02 return header.previous.element;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes and returns the first element from this list.
15.47/5.02 *
15.47/5.02 * @return the first element from this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 */
15.47/5.02 public E removeFirst() {
15.47/5.02 return remove(header.next);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes and returns the last element from this list.
15.47/5.02 *
15.47/5.02 * @return the last element from this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 */
15.47/5.02 public E removeLast() {
15.47/5.02 return remove(header.previous);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the beginning of this list.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 */
15.47/5.02 public void addFirst(E e) {
15.47/5.02 addBefore(e, header.next);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Appends the specified element to the end of this list.
15.47/5.02 *
15.47/5.02 * This method is equivalent to {@link #add}.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 */
15.47/5.02 public void addLast(E e) {
15.47/5.02 addBefore(e, header);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns true if this list contains the specified element.
15.47/5.02 * More formally, returns true if and only if this list contains
15.47/5.02 * at least one element e such that
15.47/5.02 * (o==null ? e==null : o.equals(e)).
15.47/5.02 *
15.47/5.02 * @param o element whose presence in this list is to be tested
15.47/5.02 * @return true if this list contains the specified element
15.47/5.02 */
15.47/5.02 public boolean contains(Object o) {
15.47/5.02 return indexOf(o) != -1;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the number of elements in this list.
15.47/5.02 *
15.47/5.02 * @return the number of elements in this list
15.47/5.02 */
15.47/5.02 public int size() {
15.47/5.02 return size;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Appends the specified element to the end of this list.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #addLast}.
15.47/5.02 *
15.47/5.02 * @param e element to be appended to this list
15.47/5.02 * @return true (as specified by {@link Collection#add})
15.47/5.02 */
15.47/5.02 public boolean add(E e) {
15.47/5.02 addBefore(e, header);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the first occurrence of the specified element from this list,
15.47/5.02 * if it is present. If this list does not contain the element, it is
15.47/5.02 * unchanged. More formally, removes the element with the lowest index
15.47/5.02 * i such that
15.47/5.02 * (o==null ? get(i)==null : o.equals(get(i)))
15.47/5.02 * (if such an element exists). Returns true if this list
15.47/5.02 * contained the specified element (or equivalently, if this list
15.47/5.02 * changed as a result of the call).
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this list, if present
15.47/5.02 * @return true if this list contained the specified element
15.47/5.02 */
15.47/5.02 public boolean remove(Object o) {
15.47/5.02 if (o==null) {
15.47/5.02 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.02 if (e.element==null) {
15.47/5.02 remove(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 } else {
15.47/5.02 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.02 if (o.equals(e.element)) {
15.47/5.02 remove(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 }
15.47/5.02 return false;
15.47/5.02 }
15.47/5.02 /**
15.47/5.02 * Removes all of the elements from this list.
15.47/5.02 */
15.47/5.02 public void clear() {
15.47/5.02 Entry e = header.next;
15.47/5.02 while (e != header) {
15.47/5.02 Entry next = e.next;
15.47/5.02 e.next = e.previous = null;
15.47/5.02 e.element = null;
15.47/5.02 e = next;
15.47/5.02 }
15.47/5.02 header.next = header.previous = header;
15.47/5.02 size = 0;
15.47/5.02 modCount++;
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 // Positional Access Operations
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the element at the specified position in this list.
15.47/5.02 *
15.47/5.02 * @param index index of the element to return
15.47/5.02 * @return the element at the specified position in this list
15.47/5.02 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.02 */
15.47/5.02 public E get(int index) {
15.47/5.02 return entry(index).element;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Replaces the element at the specified position in this list with the
15.47/5.02 * specified element.
15.47/5.02 *
15.47/5.02 * @param index index of the element to replace
15.47/5.02 * @param element element to be stored at the specified position
15.47/5.02 * @return the element previously at the specified position
15.47/5.02 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.02 */
15.47/5.02 public E set(int index, E element) {
15.47/5.02 Entry e = entry(index);
15.47/5.02 E oldVal = e.element;
15.47/5.02 e.element = element;
15.47/5.02 return oldVal;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the specified position in this list.
15.47/5.02 * Shifts the element currently at that position (if any) and any
15.47/5.02 * subsequent elements to the right (adds one to their indices).
15.47/5.02 *
15.47/5.02 * @param index index at which the specified element is to be inserted
15.47/5.02 * @param element element to be inserted
15.47/5.02 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.02 */
15.47/5.02 public void add(int index, E element) {
15.47/5.02 addBefore(element, (index==size ? header : entry(index)));
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the element at the specified position in this list. Shifts any
15.47/5.02 * subsequent elements to the left (subtracts one from their indices).
15.47/5.02 * Returns the element that was removed from the list.
15.47/5.02 *
15.47/5.02 * @param index the index of the element to be removed
15.47/5.02 * @return the element previously at the specified position
15.47/5.02 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.02 */
15.47/5.02 public E remove(int index) {
15.47/5.02 return remove(entry(index));
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the indexed entry.
15.47/5.02 */
15.47/5.02 private Entry entry(int index) {
15.47/5.02 if (index < 0 || index >= size)
15.47/5.02 throw new IndexOutOfBoundsException();
15.47/5.02 Entry e = header;
15.47/5.02 if (index < (size >> 1)) {
15.47/5.02 for (int i = 0; i <= index; i++)
15.47/5.02 e = e.next;
15.47/5.02 } else {
15.47/5.02 for (int i = size; i > index; i--)
15.47/5.02 e = e.previous;
15.47/5.02 }
15.47/5.02 return e;
15.47/5.02 }
15.47/5.02
15.47/5.02
15.47/5.02 // Search Operations
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the index of the first occurrence of the specified element
15.47/5.02 * in this list, or -1 if this list does not contain the element.
15.47/5.02 * More formally, returns the lowest index i such that
15.47/5.02 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.02 * or -1 if there is no such index.
15.47/5.02 *
15.47/5.02 * @param o element to search for
15.47/5.02 * @return the index of the first occurrence of the specified element in
15.47/5.02 * this list, or -1 if this list does not contain the element
15.47/5.02 */
15.47/5.02 public int indexOf(Object o) {
15.47/5.02 int index = 0;
15.47/5.02 if (o==null) {
15.47/5.02 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.02 if (e.element==null)
15.47/5.02 return index;
15.47/5.02 index++;
15.47/5.02 }
15.47/5.02 } else {
15.47/5.02 for (Entry e = header.next; e != header; e = e.next) {
15.47/5.02 if (o.equals(e.element))
15.47/5.02 return index;
15.47/5.02 index++;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 return -1;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns the index of the last occurrence of the specified element
15.47/5.02 * in this list, or -1 if this list does not contain the element.
15.47/5.02 * More formally, returns the highest index i such that
15.47/5.02 * (o==null ? get(i)==null : o.equals(get(i))),
15.47/5.02 * or -1 if there is no such index.
15.47/5.02 *
15.47/5.02 * @param o element to search for
15.47/5.02 * @return the index of the last occurrence of the specified element in
15.47/5.02 * this list, or -1 if this list does not contain the element
15.47/5.02 */
15.47/5.02 public int lastIndexOf(Object o) {
15.47/5.02 int index = size;
15.47/5.02 if (o==null) {
15.47/5.02 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.02 index--;
15.47/5.02 if (e.element==null)
15.47/5.02 return index;
15.47/5.02 }
15.47/5.02 } else {
15.47/5.02 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.02 index--;
15.47/5.02 if (o.equals(e.element))
15.47/5.02 return index;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 return -1;
15.47/5.02 }
15.47/5.02
15.47/5.02 // Queue operations.
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the head (first element) of this list.
15.47/5.02 * @return the head of this list, or null if this list is empty
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public E peek() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return getFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the head (first element) of this list.
15.47/5.02 * @return the head of this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public E element() {
15.47/5.02 return getFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the head (first element) of this list
15.47/5.02 * @return the head of this list, or null if this list is empty
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public E poll() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return removeFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the head (first element) of this list.
15.47/5.02 *
15.47/5.02 * @return the head of this list
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public E remove() {
15.47/5.02 return removeFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Adds the specified element as the tail (last element) of this list.
15.47/5.02 *
15.47/5.02 * @param e the element to add
15.47/5.02 * @return true (as specified by {@link Queue#offer})
15.47/5.02 * @since 1.5
15.47/5.02 */
15.47/5.02 public boolean offer(E e) {
15.47/5.02 return add(e);
15.47/5.02 }
15.47/5.02
15.47/5.02 // Deque operations
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the front of this list.
15.47/5.02 *
15.47/5.02 * @param e the element to insert
15.47/5.02 * @return true (as specified by {@link Deque#offerFirst})
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public boolean offerFirst(E e) {
15.47/5.02 addFirst(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Inserts the specified element at the end of this list.
15.47/5.02 *
15.47/5.02 * @param e the element to insert
15.47/5.02 * @return true (as specified by {@link Deque#offerLast})
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public boolean offerLast(E e) {
15.47/5.02 addLast(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the first element of this list,
15.47/5.02 * or returns null if this list is empty.
15.47/5.02 *
15.47/5.02 * @return the first element of this list, or null
15.47/5.02 * if this list is empty
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public E peekFirst() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return getFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves, but does not remove, the last element of this list,
15.47/5.02 * or returns null if this list is empty.
15.47/5.02 *
15.47/5.02 * @return the last element of this list, or null
15.47/5.02 * if this list is empty
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public E peekLast() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return getLast();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the first element of this list,
15.47/5.02 * or returns null if this list is empty.
15.47/5.02 *
15.47/5.02 * @return the first element of this list, or null if
15.47/5.02 * this list is empty
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public E pollFirst() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return removeFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Retrieves and removes the last element of this list,
15.47/5.02 * or returns null if this list is empty.
15.47/5.02 *
15.47/5.02 * @return the last element of this list, or null if
15.47/5.02 * this list is empty
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public E pollLast() {
15.47/5.02 if (size==0)
15.47/5.02 return null;
15.47/5.02 return removeLast();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Pushes an element onto the stack represented by this list. In other
15.47/5.02 * words, inserts the element at the front of this list.
15.47/5.02 *
15.47/5.02 * This method is equivalent to {@link #addFirst}.
15.47/5.02 *
15.47/5.02 * @param e the element to push
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public void push(E e) {
15.47/5.02 addFirst(e);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Pops an element from the stack represented by this list. In other
15.47/5.02 * words, removes and returns the first element of this list.
15.47/5.02 *
15.47/5.02 *
This method is equivalent to {@link #removeFirst()}.
15.47/5.02 *
15.47/5.02 * @return the element at the front of this list (which is the top
15.47/5.02 * of the stack represented by this list)
15.47/5.02 * @throws NoSuchElementException if this list is empty
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public E pop() {
15.47/5.02 return removeFirst();
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the first occurrence of the specified element in this
15.47/5.02 * list (when traversing the list from head to tail). If the list
15.47/5.02 * does not contain the element, it is unchanged.
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this list, if present
15.47/5.02 * @return true if the list contained the specified element
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public boolean removeFirstOccurrence(Object o) {
15.47/5.02 return remove(o);
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Removes the last occurrence of the specified element in this
15.47/5.02 * list (when traversing the list from head to tail). If the list
15.47/5.02 * does not contain the element, it is unchanged.
15.47/5.02 *
15.47/5.02 * @param o element to be removed from this list, if present
15.47/5.02 * @return true if the list contained the specified element
15.47/5.02 * @since 1.6
15.47/5.02 */
15.47/5.02 public boolean removeLastOccurrence(Object o) {
15.47/5.02 if (o==null) {
15.47/5.02 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.02 if (e.element==null) {
15.47/5.02 remove(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 } else {
15.47/5.02 for (Entry e = header.previous; e != header; e = e.previous) {
15.47/5.02 if (o.equals(e.element)) {
15.47/5.02 remove(e);
15.47/5.02 return true;
15.47/5.02 }
15.47/5.02 }
15.47/5.02 }
15.47/5.02 return false;
15.47/5.02 }
15.47/5.02
15.47/5.02 /**
15.47/5.02 * Returns a list-iterator of the elements in this list (in proper
15.47/5.02 * sequence), starting at the specified position in the list.
15.47/5.02 * Obeys the general contract of List.listIterator(int).
15.47/5.02 *
15.47/5.02 * The list-iterator is fail-fast: if the list is structurally
15.47/5.02 * modified at any time after the Iterator is created, in any way except
15.47/5.02 * through the list-iterator's own remove or add
15.47/5.02 * methods, the list-iterator will throw a
15.47/5.02 * ConcurrentModificationException. Thus, in the face of
15.47/5.02 * concurrent modification, the iterator fails quickly and cleanly, rather
15.47/5.02 * than risking arbitrary, non-deterministic behavior at an undetermined
15.47/5.02 * time in the future.
15.47/5.02 *
15.47/5.02 * @param index index of the first element to be returned from the
15.47/5.02 * list-iterator (by a call to next)
15.47/5.02 * @return a ListIterator of the elements in this list (in proper
15.47/5.02 * sequence), starting at the specified position in the list
15.47/5.02 * @throws IndexOutOfBoundsException {@inheritDoc}
15.47/5.02 * @see List#listIterator(int)
15.47/5.02 */
15.47/5.02 public ListIterator listIterator(int index) {
15.47/5.02 return new ListItr(index);
15.47/5.02 }
15.47/5.02
15.47/5.02 private class ListItr implements ListIterator {
15.47/5.02 private Entry lastReturned = header;
15.47/5.02 private Entry next;
15.47/5.02 private int nextIndex;
15.47/5.02 private int expectedModCount = modCount;
15.47/5.02
15.47/5.02 ListItr(int index) {
15.47/5.02 if (index < 0 || index > size)
15.47/5.02 throw new IndexOutOfBoundsException();
15.47/5.02 if (index < (size >> 1)) {
15.47/5.02 next = header.next;
15.47/5.02 for (nextIndex=0; nextIndexindex; nextIndex--)
15.47/5.02 next = next.previous;
15.47/5.02 }
15.47/5.02 }
15.47/5.02
15.47/5.02 public boolean hasNext() {
15.47/5.02 return nextIndex != size;
15.47/5.02 }
15.47/5.02
15.47/5.02 public E next() {
15.47/5.02 checkForComodification();
15.47/5.02 if (nextIndex == size)
15.47/5.02 throw new NoSuchElementException();
15.47/5.02
15.47/5.02 lastReturned = next;
15.47/5.02 next = next.next;
15.47/5.02 nextIndex++;
15.47/5.02 return lastReturned.element;
15.47/5.02 }
15.47/5.02
15.47/5.02 public boolean hasPrevious() {
15.47/5.02 return nextIndex != 0;
15.47/5.02 }
15.47/5.02
15.47/5.02 public E previous() {
15.47/5.02 if (nextIndex == 0)
15.47/5.02 throw new NoSuchElementException();
15.47/5.02
15.47/5.02 lastReturned = next = next.previous;
15.47/5.02 nextIndex--;
15.47/5.02 checkForComodification();
15.47/5.02 return lastReturned.element;
15.47/5.02 }
15.47/5.02
15.47/5.02 public int nextIndex() {
15.47/5.02 return nextIndex;
15.47/5.02 }
15.47/5.02
15.47/5.02 public int previousIndex() {
15.47/5.02 return nextIndex-1;
15.47/5.02 }
15.47/5.02
15.47/5.02 public void remove() {
15.47/5.02 checkForComodification();
15.47/5.02 Entry lastNext = lastReturned.next;
15.47/5.02 try {
15.47/5.02 LinkedList.this.remove(lastReturned);
15.47/5.02 } catch (NoSuchElementException e) {
15.47/5.02 throw new IllegalStateException();
15.47/5.02 }
15.47/5.02 if (next==lastReturned)
15.47/5.02 next = lastNext;
15.47/5.02 else
15.47/5.02 nextIndex--;
15.47/5.02 lastReturned = header;
15.47/5.02 expectedModCount++;
15.47/5.02 }
15.47/5.02
15.47/5.02 public void set(E e) {
15.47/5.02 if (lastReturned == header)
15.47/5.02 throw new IllegalStateException();
15.47/5.02 checkForComodification();
15.47/5.02 lastReturned.element = e;
15.47/5.02 }
15.47/5.02
15.47/5.02 public void add(E e) {
15.47/5.02 checkForComodification();
15.47/5.02 lastReturned = header;
15.47/5.02 addBefore(e, next);
15.47/5.02 nextIndex++;
15.47/5.02 expectedModCount++;
15.47/5.02 }
15.47/5.02
15.47/5.02 final void checkForComodification() {
15.47/5.02 if (modCount != expectedModCount)
15.47/5.02 throw new ConcurrentModificationException();
15.47/5.02 }
15.47/5.02 }
15.47/5.02
15.47/5.02 private static class Entry {
15.47/5.02 E element;
15.47/5.02 Entry next;
15.47/5.02 Entry previous;
15.47/5.02
15.47/5.02 Entry(E element, Entry next, Entry