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