16.74/5.65 YES 16.74/5.67 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 16.74/5.67 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.74/5.67 16.74/5.67 16.74/5.67 termination of the given Bare JBC problem could be proven: 16.74/5.67 16.74/5.67 (0) Bare JBC problem 16.74/5.67 (1) BareJBCToJBCProof [EQUIVALENT, 89 ms] 16.74/5.67 (2) JBC problem 16.74/5.67 (3) JBCToGraph [EQUIVALENT, 2682 ms] 16.74/5.67 (4) JBCTerminationGraph 16.74/5.67 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 16.74/5.67 (6) JBCTerminationSCC 16.74/5.67 (7) SCCToIRSProof [SOUND, 400 ms] 16.74/5.67 (8) IRSwT 16.74/5.67 (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 16.74/5.67 (10) IRSwT 16.74/5.67 (11) IRSwTTerminationDigraphProof [EQUIVALENT, 141 ms] 16.74/5.67 (12) IRSwT 16.74/5.67 (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] 16.74/5.67 (14) IRSwT 16.74/5.67 (15) TempFilterProof [SOUND, 125 ms] 16.74/5.67 (16) IntTRS 16.74/5.67 (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 16.74/5.67 (18) IntTRS 16.74/5.67 (19) RankingReductionPairProof [EQUIVALENT, 0 ms] 16.74/5.67 (20) YES 16.74/5.67 16.74/5.67 16.74/5.67 ---------------------------------------- 16.74/5.67 16.74/5.67 (0) 16.74/5.67 Obligation: 16.74/5.67 need to prove termination of the following program: 16.74/5.67 /* 16.74/5.67 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.67 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.67 * 16.74/5.67 * This code is free software; you can redistribute it and/or modify it 16.74/5.67 * under the terms of the GNU General Public License version 2 only, as 16.74/5.67 * published by the Free Software Foundation. Sun designates this 16.74/5.67 * particular file as subject to the "Classpath" exception as provided 16.74/5.67 * by Sun in the LICENSE file that accompanied this code. 16.74/5.67 * 16.74/5.67 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.67 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.67 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.67 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.67 * accompanied this code). 16.74/5.67 * 16.74/5.67 * You should have received a copy of the GNU General Public License version 16.74/5.67 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.67 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.67 * 16.74/5.67 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.67 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.67 * have any questions. 16.74/5.67 */ 16.74/5.67 16.74/5.67 package javaUtilEx; 16.74/5.67 16.74/5.67 /** 16.74/5.67 * This class provides a skeletal implementation of the Collection 16.74/5.67 * interface, to minimize the effort required to implement this interface.

16.74/5.67 * 16.74/5.67 * To implement an unmodifiable collection, the programmer needs only to 16.74/5.67 * extend this class and provide implementations for the iterator and 16.74/5.67 * size methods. (The iterator returned by the iterator 16.74/5.67 * method must implement hasNext and next.)

16.74/5.67 * 16.74/5.67 * To implement a modifiable collection, the programmer must additionally 16.74/5.67 * override this class's add method (which otherwise throws an 16.74/5.67 * UnsupportedOperationException), and the iterator returned by the 16.74/5.67 * iterator method must additionally implement its remove 16.74/5.67 * method.

16.74/5.67 * 16.74/5.67 * The programmer should generally provide a void (no argument) and 16.74/5.67 * Collection constructor, as per the recommendation in the 16.74/5.67 * Collection interface specification.

16.74/5.67 * 16.74/5.67 * The documentation for each non-abstract method in this class describes its 16.74/5.67 * implementation in detail. Each of these methods may be overridden if 16.74/5.67 * the collection being implemented admits a more efficient implementation.

16.74/5.67 * 16.74/5.67 * This class is a member of the 16.74/5.67 * 16.74/5.67 * Java Collections Framework. 16.74/5.67 * 16.74/5.67 * @author Josh Bloch 16.74/5.67 * @author Neal Gafter 16.74/5.67 * @see Collection 16.74/5.67 * @since 1.2 16.74/5.67 */ 16.74/5.67 16.74/5.67 public abstract class AbstractCollection implements Collection { 16.74/5.67 /** 16.74/5.67 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.67 * implicit.) 16.74/5.67 */ 16.74/5.67 protected AbstractCollection() { 16.74/5.67 } 16.74/5.67 16.74/5.67 // Query Operations 16.74/5.67 16.74/5.67 /** 16.74/5.67 * Returns an iterator over the elements contained in this collection. 16.74/5.67 * 16.74/5.67 * @return an iterator over the elements contained in this collection 16.74/5.67 */ 16.74/5.67 public abstract Iterator iterator(); 16.74/5.67 16.74/5.67 public abstract int size(); 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation returns size() == 0. 16.74/5.67 */ 16.74/5.67 public boolean isEmpty() { 16.74/5.67 return size() == 0; 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over the elements in the collection, 16.74/5.67 * checking each element in turn for equality with the specified element. 16.74/5.67 * 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 */ 16.74/5.67 public boolean contains(Object o) { 16.74/5.67 Iterator e = iterator(); 16.74/5.67 if (o==null) { 16.74/5.67 while (e.hasNext()) 16.74/5.67 if (e.next()==null) 16.74/5.67 return true; 16.74/5.67 } else { 16.74/5.67 while (e.hasNext()) 16.74/5.67 if (o.equals(e.next())) 16.74/5.67 return true; 16.74/5.67 } 16.74/5.67 return false; 16.74/5.67 } 16.74/5.67 16.74/5.67 // Modification Operations 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation always throws an 16.74/5.67 * UnsupportedOperationException. 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.67 * @throws IllegalStateException {@inheritDoc} 16.74/5.67 */ 16.74/5.67 public boolean add(E e) { 16.74/5.67 throw new UnsupportedOperationException(); 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over the collection looking for the 16.74/5.67 * specified element. If it finds the element, it removes the element 16.74/5.67 * from the collection using the iterator's remove method. 16.74/5.67 * 16.74/5.67 *

Note that this implementation throws an 16.74/5.67 * UnsupportedOperationException if the iterator returned by this 16.74/5.67 * collection's iterator method does not implement the remove 16.74/5.67 * method and this collection contains the specified object. 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 */ 16.74/5.67 public boolean remove(Object o) { 16.74/5.67 Iterator e = iterator(); 16.74/5.67 if (o==null) { 16.74/5.67 while (e.hasNext()) { 16.74/5.67 if (e.next()==null) { 16.74/5.67 e.remove(); 16.74/5.67 return true; 16.74/5.67 } 16.74/5.67 } 16.74/5.67 } else { 16.74/5.67 while (e.hasNext()) { 16.74/5.67 if (o.equals(e.next())) { 16.74/5.67 e.remove(); 16.74/5.67 return true; 16.74/5.67 } 16.74/5.67 } 16.74/5.67 } 16.74/5.67 return false; 16.74/5.67 } 16.74/5.67 16.74/5.67 16.74/5.67 // Bulk Operations 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over the specified collection, 16.74/5.67 * checking each element returned by the iterator in turn to see 16.74/5.67 * if it's contained in this collection. If all elements are so 16.74/5.67 * contained true is returned, otherwise false. 16.74/5.67 * 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 * @see #contains(Object) 16.74/5.67 */ 16.74/5.67 public boolean containsAll(Collection c) { 16.74/5.67 Iterator e = c.iterator(); 16.74/5.67 while (e.hasNext()) 16.74/5.67 if (!contains(e.next())) 16.74/5.67 return false; 16.74/5.67 return true; 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over the specified collection, and adds 16.74/5.67 * each object returned by the iterator to this collection, in turn. 16.74/5.67 * 16.74/5.67 *

Note that this implementation will throw an 16.74/5.67 * UnsupportedOperationException unless add is 16.74/5.67 * overridden (assuming the specified collection is non-empty). 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.67 * @throws IllegalStateException {@inheritDoc} 16.74/5.67 * 16.74/5.67 * @see #add(Object) 16.74/5.67 */ 16.74/5.67 public boolean addAll(Collection c) { 16.74/5.67 boolean modified = false; 16.74/5.67 Iterator e = c.iterator(); 16.74/5.67 while (e.hasNext()) { 16.74/5.67 if (add(e.next())) 16.74/5.67 modified = true; 16.74/5.67 } 16.74/5.67 return modified; 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over this collection, checking each 16.74/5.67 * element returned by the iterator in turn to see if it's contained 16.74/5.67 * in the specified collection. If it's so contained, it's removed from 16.74/5.67 * this collection with the iterator's remove method. 16.74/5.67 * 16.74/5.67 *

Note that this implementation will throw an 16.74/5.67 * UnsupportedOperationException if the iterator returned by the 16.74/5.67 * iterator method does not implement the remove method 16.74/5.67 * and this collection contains one or more elements in common with the 16.74/5.67 * specified collection. 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 * 16.74/5.67 * @see #remove(Object) 16.74/5.67 * @see #contains(Object) 16.74/5.67 */ 16.74/5.67 public boolean removeAll(Collection c) { 16.74/5.67 boolean modified = false; 16.74/5.67 Iterator e = iterator(); 16.74/5.67 while (e.hasNext()) { 16.74/5.67 if (c.contains(e.next())) { 16.74/5.67 e.remove(); 16.74/5.67 modified = true; 16.74/5.67 } 16.74/5.67 } 16.74/5.67 return modified; 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over this collection, checking each 16.74/5.67 * element returned by the iterator in turn to see if it's contained 16.74/5.67 * in the specified collection. If it's not so contained, it's removed 16.74/5.67 * from this collection with the iterator's remove method. 16.74/5.67 * 16.74/5.67 *

Note that this implementation will throw an 16.74/5.67 * UnsupportedOperationException if the iterator returned by the 16.74/5.67 * iterator method does not implement the remove method 16.74/5.67 * and this collection contains one or more elements not present in the 16.74/5.67 * specified collection. 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 * @throws ClassCastException {@inheritDoc} 16.74/5.67 * @throws NullPointerException {@inheritDoc} 16.74/5.67 * 16.74/5.67 * @see #remove(Object) 16.74/5.67 * @see #contains(Object) 16.74/5.67 */ 16.74/5.67 public boolean retainAll(Collection c) { 16.74/5.67 boolean modified = false; 16.74/5.67 Iterator e = iterator(); 16.74/5.67 while (e.hasNext()) { 16.74/5.67 if (!c.contains(e.next())) { 16.74/5.67 e.remove(); 16.74/5.67 modified = true; 16.74/5.67 } 16.74/5.67 } 16.74/5.67 return modified; 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * {@inheritDoc} 16.74/5.67 * 16.74/5.67 *

This implementation iterates over this collection, removing each 16.74/5.67 * element using the Iterator.remove operation. Most 16.74/5.67 * implementations will probably choose to override this method for 16.74/5.67 * efficiency. 16.74/5.67 * 16.74/5.67 *

Note that this implementation will throw an 16.74/5.67 * UnsupportedOperationException if the iterator returned by this 16.74/5.67 * collection's iterator method does not implement the 16.74/5.67 * remove method and this collection is non-empty. 16.74/5.67 * 16.74/5.67 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.67 */ 16.74/5.67 public void clear() { 16.74/5.67 Iterator e = iterator(); 16.74/5.67 while (e.hasNext()) { 16.74/5.67 e.next(); 16.74/5.67 e.remove(); 16.74/5.67 } 16.74/5.67 } 16.74/5.67 16.74/5.67 16.74/5.67 // String conversion 16.74/5.67 16.74/5.67 /** 16.74/5.67 * Returns a string representation of this collection. The string 16.74/5.67 * representation consists of a list of the collection's elements in the 16.74/5.67 * order they are returned by its iterator, enclosed in square brackets 16.74/5.67 * ("[]"). Adjacent elements are separated by the characters 16.74/5.67 * ", " (comma and space). Elements are converted to strings as 16.74/5.67 * by {@link String#valueOf(Object)}. 16.74/5.67 * 16.74/5.67 * @return a string representation of this collection 16.74/5.67 */ 16.74/5.67 public String toString() { 16.74/5.67 Iterator i = iterator(); 16.74/5.67 if (! i.hasNext()) 16.74/5.67 return "[]"; 16.74/5.67 16.74/5.67 String sb = ""; 16.74/5.67 sb = sb + "["; 16.74/5.67 for (;;) { 16.74/5.67 E e = i.next(); 16.74/5.67 sb = sb + (e == this ? "(this Collection)" : e); 16.74/5.67 if (! i.hasNext()) { 16.74/5.67 sb = sb + "]"; 16.74/5.67 return sb; 16.74/5.67 } 16.74/5.67 sb = sb + ", "; 16.74/5.67 } 16.74/5.67 } 16.74/5.67 16.74/5.67 } 16.74/5.67 16.74/5.67 16.74/5.67 /* 16.74/5.67 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.67 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.67 * 16.74/5.67 * This code is free software; you can redistribute it and/or modify it 16.74/5.67 * under the terms of the GNU General Public License version 2 only, as 16.74/5.67 * published by the Free Software Foundation. Sun designates this 16.74/5.67 * particular file as subject to the "Classpath" exception as provided 16.74/5.67 * by Sun in the LICENSE file that accompanied this code. 16.74/5.67 * 16.74/5.67 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.67 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.67 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.67 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.67 * accompanied this code). 16.74/5.67 * 16.74/5.67 * You should have received a copy of the GNU General Public License version 16.74/5.67 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.67 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.67 * 16.74/5.67 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.67 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.67 * have any questions. 16.74/5.67 */ 16.74/5.67 16.74/5.67 package javaUtilEx; 16.74/5.67 16.74/5.67 /** 16.74/5.67 * This class provides a skeletal implementation of the {@link List} 16.74/5.67 * interface to minimize the effort required to implement this interface 16.74/5.67 * backed by a "random access" data store (such as an array). For sequential 16.74/5.67 * access data (such as a linked list), {@link AbstractSequentialList} should 16.74/5.67 * be used in preference to this class. 16.74/5.67 * 16.74/5.67 *

To implement an unmodifiable list, the programmer needs only to extend 16.74/5.67 * this class and provide implementations for the {@link #get(int)} and 16.74/5.67 * {@link List#size() size()} methods. 16.74/5.67 * 16.74/5.67 *

To implement a modifiable list, the programmer must additionally 16.74/5.67 * override the {@link #set(int, Object) set(int, E)} method (which otherwise 16.74/5.67 * throws an {@code UnsupportedOperationException}). If the list is 16.74/5.67 * variable-size the programmer must additionally override the 16.74/5.67 * {@link #add(int, Object) add(int, E)} and {@link #remove(int)} methods. 16.74/5.67 * 16.74/5.67 *

The programmer should generally provide a void (no argument) and collection 16.74/5.67 * constructor, as per the recommendation in the {@link Collection} interface 16.74/5.67 * specification. 16.74/5.67 * 16.74/5.67 *

Unlike the other abstract collection implementations, the programmer does 16.74/5.67 * not have to provide an iterator implementation; the iterator and 16.74/5.67 * list iterator are implemented by this class, on top of the "random access" 16.74/5.67 * methods: 16.74/5.67 * {@link #get(int)}, 16.74/5.67 * {@link #set(int, Object) set(int, E)}, 16.74/5.67 * {@link #add(int, Object) add(int, E)} and 16.74/5.67 * {@link #remove(int)}. 16.74/5.67 * 16.74/5.67 *

The documentation for each non-abstract method in this class describes its 16.74/5.67 * implementation in detail. Each of these methods may be overridden if the 16.74/5.67 * collection being implemented admits a more efficient implementation. 16.74/5.67 * 16.74/5.67 *

This class is a member of the 16.74/5.67 * 16.74/5.67 * Java Collections Framework. 16.74/5.67 * 16.74/5.67 * @author Josh Bloch 16.74/5.67 * @author Neal Gafter 16.74/5.67 * @since 1.2 16.74/5.67 */ 16.74/5.67 16.74/5.67 public abstract class AbstractList extends AbstractCollection implements List { 16.74/5.67 /** 16.74/5.67 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.67 * implicit.) 16.74/5.67 */ 16.74/5.67 protected AbstractList() { 16.74/5.67 } 16.74/5.67 16.74/5.67 /** 16.74/5.67 * Appends the specified element to the end of this list (optional 16.74/5.67 * operation). 16.74/5.67 * 16.74/5.67 *

Lists that support this operation may place limitations on what 16.74/5.67 * elements may be added to this list. In particular, some 16.74/5.67 * lists will refuse to add null elements, and others will impose 16.74/5.67 * restrictions on the type of elements that may be added. List 16.74/5.67 * classes should clearly specify in their documentation any restrictions 16.74/5.67 * on what elements may be added. 16.74/5.68 * 16.74/5.68 *

This implementation calls {@code add(size(), e)}. 16.74/5.68 * 16.74/5.68 *

Note that this implementation throws an 16.74/5.68 * {@code UnsupportedOperationException} unless 16.74/5.68 * {@link #add(int, Object) add(int, E)} is overridden. 16.74/5.68 * 16.74/5.68 * @param e element to be appended to this list 16.74/5.68 * @return {@code true} (as specified by {@link Collection#add}) 16.74/5.68 * @throws UnsupportedOperationException if the {@code add} operation 16.74/5.68 * is not supported by this list 16.74/5.68 * @throws ClassCastException if the class of the specified element 16.74/5.68 * prevents it from being added to this list 16.74/5.68 * @throws NullPointerException if the specified element is null and this 16.74/5.68 * list does not permit null elements 16.74/5.68 * @throws IllegalArgumentException if some property of this element 16.74/5.68 * prevents it from being added to this list 16.74/5.68 */ 16.74/5.68 public boolean add(E e) { 16.74/5.68 add(size(), e); 16.74/5.68 return true; 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 abstract public E get(int index); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation always throws an 16.74/5.68 * {@code UnsupportedOperationException}. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public E set(int index, E element) { 16.74/5.68 throw new UnsupportedOperationException(); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation always throws an 16.74/5.68 * {@code UnsupportedOperationException}. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public void add(int index, E element) { 16.74/5.68 throw new UnsupportedOperationException(); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation always throws an 16.74/5.68 * {@code UnsupportedOperationException}. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public E remove(int index) { 16.74/5.68 throw new UnsupportedOperationException(); 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 // Search Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator (with 16.74/5.68 * {@code listIterator()}). Then, it iterates over the list until the 16.74/5.68 * specified element is found or the end of the list is reached. 16.74/5.68 * 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public int indexOf(Object o) { 16.74/5.68 ListIterator e = listIterator(); 16.74/5.68 if (o==null) { 16.74/5.68 while (e.hasNext()) 16.74/5.68 if (e.next()==null) 16.74/5.68 return e.previousIndex(); 16.74/5.68 } else { 16.74/5.68 while (e.hasNext()) 16.74/5.68 if (o.equals(e.next())) 16.74/5.68 return e.previousIndex(); 16.74/5.68 } 16.74/5.68 return -1; 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator that points to the end 16.74/5.68 * of the list (with {@code listIterator(size())}). Then, it iterates 16.74/5.68 * backwards over the list until the specified element is found, or the 16.74/5.68 * beginning of the list is reached. 16.74/5.68 * 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public int lastIndexOf(Object o) { 16.74/5.68 ListIterator e = listIterator(size()); 16.74/5.68 if (o==null) { 16.74/5.68 while (e.hasPrevious()) 16.74/5.68 if (e.previous()==null) 16.74/5.68 return e.nextIndex(); 16.74/5.68 } else { 16.74/5.68 while (e.hasPrevious()) 16.74/5.68 if (o.equals(e.previous())) 16.74/5.68 return e.nextIndex(); 16.74/5.68 } 16.74/5.68 return -1; 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 // Bulk Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes all of the elements from this list (optional operation). 16.74/5.68 * The list will be empty after this call returns. 16.74/5.68 * 16.74/5.68 *

This implementation calls {@code removeRange(0, size())}. 16.74/5.68 * 16.74/5.68 *

Note that this implementation throws an 16.74/5.68 * {@code UnsupportedOperationException} unless {@code remove(int 16.74/5.68 * index)} or {@code removeRange(int fromIndex, int toIndex)} is 16.74/5.68 * overridden. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException if the {@code clear} operation 16.74/5.68 * is not supported by this list 16.74/5.68 */ 16.74/5.68 public void clear() { 16.74/5.68 removeRange(0, size()); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation gets an iterator over the specified collection 16.74/5.68 * and iterates over it, inserting the elements obtained from the 16.74/5.68 * iterator into this list at the appropriate position, one at a time, 16.74/5.68 * using {@code add(int, E)}. 16.74/5.68 * Many implementations will override this method for efficiency. 16.74/5.68 * 16.74/5.68 *

Note that this implementation throws an 16.74/5.68 * {@code UnsupportedOperationException} unless 16.74/5.68 * {@link #add(int, Object) add(int, E)} is overridden. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public boolean addAll(int index, Collection c) { 16.74/5.68 rangeCheckForAdd(index); 16.74/5.68 boolean modified = false; 16.74/5.68 Iterator e = c.iterator(); 16.74/5.68 while (e.hasNext()) { 16.74/5.68 add(index++, e.next()); 16.74/5.68 modified = true; 16.74/5.68 } 16.74/5.68 return modified; 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 // Iterators 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns an iterator over the elements in this list in proper sequence. 16.74/5.68 * 16.74/5.68 *

This implementation returns a straightforward implementation of the 16.74/5.68 * iterator interface, relying on the backing list's {@code size()}, 16.74/5.68 * {@code get(int)}, and {@code remove(int)} methods. 16.74/5.68 * 16.74/5.68 *

Note that the iterator returned by this method will throw an 16.74/5.68 * {@link UnsupportedOperationException} in response to its 16.74/5.68 * {@code remove} method unless the list's {@code remove(int)} method is 16.74/5.68 * overridden. 16.74/5.68 * 16.74/5.68 *

This implementation can be made to throw runtime exceptions in the 16.74/5.68 * face of concurrent modification, as described in the specification 16.74/5.68 * for the (protected) {@link #modCount} field. 16.74/5.68 * 16.74/5.68 * @return an iterator over the elements in this list in proper sequence 16.74/5.68 */ 16.74/5.68 public Iterator iterator() { 16.74/5.68 return new Itr(); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation returns {@code listIterator(0)}. 16.74/5.68 * 16.74/5.68 * @see #listIterator(int) 16.74/5.68 */ 16.74/5.68 public ListIterator listIterator() { 16.74/5.68 return listIterator(0); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation returns a straightforward implementation of the 16.74/5.68 * {@code ListIterator} interface that extends the implementation of the 16.74/5.68 * {@code Iterator} interface returned by the {@code iterator()} method. 16.74/5.68 * The {@code ListIterator} implementation relies on the backing list's 16.74/5.68 * {@code get(int)}, {@code set(int, E)}, {@code add(int, E)} 16.74/5.68 * and {@code remove(int)} methods. 16.74/5.68 * 16.74/5.68 *

Note that the list iterator returned by this implementation will 16.74/5.68 * throw an {@link UnsupportedOperationException} in response to its 16.74/5.68 * {@code remove}, {@code set} and {@code add} methods unless the 16.74/5.68 * list's {@code remove(int)}, {@code set(int, E)}, and 16.74/5.68 * {@code add(int, E)} methods are overridden. 16.74/5.68 * 16.74/5.68 *

This implementation can be made to throw runtime exceptions in the 16.74/5.68 * face of concurrent modification, as described in the specification for 16.74/5.68 * the (protected) {@link #modCount} field. 16.74/5.68 * 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public ListIterator listIterator(final int index) { 16.74/5.68 rangeCheckForAdd(index); 16.74/5.68 16.74/5.68 return new ListItr(index); 16.74/5.68 } 16.74/5.68 16.74/5.68 private class Itr implements Iterator { 16.74/5.68 /** 16.74/5.68 * Index of element to be returned by subsequent call to next. 16.74/5.68 */ 16.74/5.68 int cursor = 0; 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Index of element returned by most recent call to next or 16.74/5.68 * previous. Reset to -1 if this element is deleted by a call 16.74/5.68 * to remove. 16.74/5.68 */ 16.74/5.68 int lastRet = -1; 16.74/5.68 16.74/5.68 /** 16.74/5.68 * The modCount value that the iterator believes that the backing 16.74/5.68 * List should have. If this expectation is violated, the iterator 16.74/5.68 * has detected concurrent modification. 16.74/5.68 */ 16.74/5.68 int expectedModCount = modCount; 16.74/5.68 16.74/5.68 public boolean hasNext() { 16.74/5.68 return cursor != size(); 16.74/5.68 } 16.74/5.68 16.74/5.68 public E next() { 16.74/5.68 checkForComodification(); 16.74/5.68 try { 16.74/5.68 int i = cursor; 16.74/5.68 E next = get(i); 16.74/5.68 lastRet = i; 16.74/5.68 cursor = i + 1; 16.74/5.68 return next; 16.74/5.68 } catch (IndexOutOfBoundsException e) { 16.74/5.68 checkForComodification(); 16.74/5.68 throw new NoSuchElementException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 public void remove() { 16.74/5.68 if (lastRet < 0) 16.74/5.68 throw new IllegalStateException(); 16.74/5.68 checkForComodification(); 16.74/5.68 16.74/5.68 try { 16.74/5.68 AbstractList.this.remove(lastRet); 16.74/5.68 if (lastRet < cursor) 16.74/5.68 cursor--; 16.74/5.68 lastRet = -1; 16.74/5.68 expectedModCount = modCount; 16.74/5.68 } catch (IndexOutOfBoundsException e) { 16.74/5.68 throw new ConcurrentModificationException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 final void checkForComodification() { 16.74/5.68 if (modCount != expectedModCount) 16.74/5.68 throw new ConcurrentModificationException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 private class ListItr extends Itr implements ListIterator { 16.74/5.68 ListItr(int index) { 16.74/5.68 cursor = index; 16.74/5.68 } 16.74/5.68 16.74/5.68 public boolean hasPrevious() { 16.74/5.68 return cursor != 0; 16.74/5.68 } 16.74/5.68 16.74/5.68 public E previous() { 16.74/5.68 checkForComodification(); 16.74/5.68 try { 16.74/5.68 int i = cursor - 1; 16.74/5.68 E previous = get(i); 16.74/5.68 lastRet = cursor = i; 16.74/5.68 return previous; 16.74/5.68 } catch (IndexOutOfBoundsException e) { 16.74/5.68 checkForComodification(); 16.74/5.68 throw new NoSuchElementException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 public int nextIndex() { 16.74/5.68 return cursor; 16.74/5.68 } 16.74/5.68 16.74/5.68 public int previousIndex() { 16.74/5.68 return cursor-1; 16.74/5.68 } 16.74/5.68 16.74/5.68 public void set(E e) { 16.74/5.68 if (lastRet < 0) 16.74/5.68 throw new IllegalStateException(); 16.74/5.68 checkForComodification(); 16.74/5.68 16.74/5.68 try { 16.74/5.68 AbstractList.this.set(lastRet, e); 16.74/5.68 expectedModCount = modCount; 16.74/5.68 } catch (IndexOutOfBoundsException ex) { 16.74/5.68 throw new ConcurrentModificationException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 public void add(E e) { 16.74/5.68 checkForComodification(); 16.74/5.68 16.74/5.68 try { 16.74/5.68 int i = cursor; 16.74/5.68 AbstractList.this.add(i, e); 16.74/5.68 lastRet = -1; 16.74/5.68 cursor = i + 1; 16.74/5.68 expectedModCount = modCount; 16.74/5.68 } catch (IndexOutOfBoundsException ex) { 16.74/5.68 throw new ConcurrentModificationException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * {@inheritDoc} 16.74/5.68 * 16.74/5.68 *

This implementation returns a list that subclasses 16.74/5.68 * {@code AbstractList}. The subclass stores, in private fields, the 16.74/5.68 * offset of the subList within the backing list, the size of the subList 16.74/5.68 * (which can change over its lifetime), and the expected 16.74/5.68 * {@code modCount} value of the backing list. There are two variants 16.74/5.68 * of the subclass, one of which implements {@code RandomAccess}. 16.74/5.68 * If this list implements {@code RandomAccess} the returned list will 16.74/5.68 * be an instance of the subclass that implements {@code RandomAccess}. 16.74/5.68 * 16.74/5.68 *

The subclass's {@code set(int, E)}, {@code get(int)}, 16.74/5.68 * {@code add(int, E)}, {@code remove(int)}, {@code addAll(int, 16.74/5.68 * Collection)} and {@code removeRange(int, int)} methods all 16.74/5.68 * delegate to the corresponding methods on the backing abstract list, 16.74/5.68 * after bounds-checking the index and adjusting for the offset. The 16.74/5.68 * {@code addAll(Collection c)} method merely returns {@code addAll(size, 16.74/5.68 * c)}. 16.74/5.68 * 16.74/5.68 *

The {@code listIterator(int)} method returns a "wrapper object" 16.74/5.68 * over a list iterator on the backing list, which is created with the 16.74/5.68 * corresponding method on the backing list. The {@code iterator} method 16.74/5.68 * merely returns {@code listIterator()}, and the {@code size} method 16.74/5.68 * merely returns the subclass's {@code size} field. 16.74/5.68 * 16.74/5.68 *

All methods first check to see if the actual {@code modCount} of 16.74/5.68 * the backing list is equal to its expected value, and throw a 16.74/5.68 * {@code ConcurrentModificationException} if it is not. 16.74/5.68 * 16.74/5.68 * @throws IndexOutOfBoundsException if an endpoint index value is out of range 16.74/5.68 * {@code (fromIndex < 0 || toIndex > size)} 16.74/5.68 * @throws IllegalArgumentException if the endpoint indices are out of order 16.74/5.68 * {@code (fromIndex > toIndex)} 16.74/5.68 */ 16.74/5.68 public List subList(int fromIndex, int toIndex) { 16.74/5.68 return (this instanceof RandomAccess ? 16.74/5.68 new RandomAccessSubList(this, fromIndex, toIndex) : 16.74/5.68 new SubList(this, fromIndex, toIndex)); 16.74/5.68 } 16.74/5.68 16.74/5.68 // Comparison and hashing 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Compares the specified object with this list for equality. Returns 16.74/5.68 * {@code true} if and only if the specified object is also a list, both 16.74/5.68 * lists have the same size, and all corresponding pairs of elements in 16.74/5.68 * the two lists are equal. (Two elements {@code e1} and 16.74/5.68 * {@code e2} are equal if {@code (e1==null ? e2==null : 16.74/5.68 * e1.equals(e2))}.) In other words, two lists are defined to be 16.74/5.68 * equal if they contain the same elements in the same order.

16.74/5.68 * 16.74/5.68 * This implementation first checks if the specified object is this 16.74/5.68 * list. If so, it returns {@code true}; if not, it checks if the 16.74/5.68 * specified object is a list. If not, it returns {@code false}; if so, 16.74/5.68 * it iterates over both lists, comparing corresponding pairs of elements. 16.74/5.68 * If any comparison returns {@code false}, this method returns 16.74/5.68 * {@code false}. If either iterator runs out of elements before the 16.74/5.68 * other it returns {@code false} (as the lists are of unequal length); 16.74/5.68 * otherwise it returns {@code true} when the iterations complete. 16.74/5.68 * 16.74/5.68 * @param o the object to be compared for equality with this list 16.74/5.68 * @return {@code true} if the specified object is equal to this list 16.74/5.68 */ 16.74/5.68 public boolean equals(Object o) { 16.74/5.68 if (o == this) 16.74/5.68 return true; 16.74/5.68 if (!(o instanceof List)) 16.74/5.68 return false; 16.74/5.68 16.74/5.68 ListIterator e1 = listIterator(); 16.74/5.68 ListIterator e2 = ((List) o).listIterator(); 16.74/5.68 while(e1.hasNext() && e2.hasNext()) { 16.74/5.68 E o1 = e1.next(); 16.74/5.68 Object o2 = e2.next(); 16.74/5.68 if (!(o1==null ? o2==null : o1.equals(o2))) 16.74/5.68 return false; 16.74/5.68 } 16.74/5.68 return !(e1.hasNext() || e2.hasNext()); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns the hash code value for this list. 16.74/5.68 * 16.74/5.68 *

This implementation uses exactly the code that is used to define the 16.74/5.68 * list hash function in the documentation for the {@link List#hashCode} 16.74/5.68 * method. 16.74/5.68 * 16.74/5.68 * @return the hash code value for this list 16.74/5.68 */ 16.74/5.68 public int hashCode() { 16.74/5.68 int hashCode = 1; 16.74/5.68 Iterator it = this.iterator(); 16.74/5.68 while (it.hasNext()) { 16.74/5.68 E e = it.next(); 16.74/5.68 hashCode = 31*hashCode + (e==null ? 0 : e.hashCode()); 16.74/5.68 } 16.74/5.68 return hashCode; 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes from this list all of the elements whose index is between 16.74/5.68 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive. 16.74/5.68 * Shifts any succeeding elements to the left (reduces their index). 16.74/5.68 * This call shortens the list by {@code (toIndex - fromIndex)} elements. 16.74/5.68 * (If {@code toIndex==fromIndex}, this operation has no effect.) 16.74/5.68 * 16.74/5.68 *

This method is called by the {@code clear} operation on this list 16.74/5.68 * and its subLists. Overriding this method to take advantage of 16.74/5.68 * the internals of the list implementation can substantially 16.74/5.68 * improve the performance of the {@code clear} operation on this list 16.74/5.68 * and its subLists. 16.74/5.68 * 16.74/5.68 *

This implementation gets a list iterator positioned before 16.74/5.68 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next} 16.74/5.68 * followed by {@code ListIterator.remove} until the entire range has 16.74/5.68 * been removed. Note: if {@code ListIterator.remove} requires linear 16.74/5.68 * time, this implementation requires quadratic time. 16.74/5.68 * 16.74/5.68 * @param fromIndex index of first element to be removed 16.74/5.68 * @param toIndex index after last element to be removed 16.74/5.68 */ 16.74/5.68 protected void removeRange(int fromIndex, int toIndex) { 16.74/5.68 ListIterator it = listIterator(fromIndex); 16.74/5.68 for (int i=0, n=toIndex-fromIndex; istructurally modified. 16.74/5.68 * Structural modifications are those that change the size of the 16.74/5.68 * list, or otherwise perturb it in such a fashion that iterations in 16.74/5.68 * progress may yield incorrect results. 16.74/5.68 * 16.74/5.68 *

This field is used by the iterator and list iterator implementation 16.74/5.68 * returned by the {@code iterator} and {@code listIterator} methods. 16.74/5.68 * If the value of this field changes unexpectedly, the iterator (or list 16.74/5.68 * iterator) will throw a {@code ConcurrentModificationException} in 16.74/5.68 * response to the {@code next}, {@code remove}, {@code previous}, 16.74/5.68 * {@code set} or {@code add} operations. This provides 16.74/5.68 * fail-fast behavior, rather than non-deterministic behavior in 16.74/5.68 * the face of concurrent modification during iteration. 16.74/5.68 * 16.74/5.68 *

Use of this field by subclasses is optional. If a subclass 16.74/5.68 * wishes to provide fail-fast iterators (and list iterators), then it 16.74/5.68 * merely has to increment this field in its {@code add(int, E)} and 16.74/5.68 * {@code remove(int)} methods (and any other methods that it overrides 16.74/5.68 * that result in structural modifications to the list). A single call to 16.74/5.68 * {@code add(int, E)} or {@code remove(int)} must add no more than 16.74/5.68 * one to this field, or the iterators (and list iterators) will throw 16.74/5.68 * bogus {@code ConcurrentModificationExceptions}. If an implementation 16.74/5.68 * does not wish to provide fail-fast iterators, this field may be 16.74/5.68 * ignored. 16.74/5.68 */ 16.74/5.68 protected transient int modCount = 0; 16.74/5.68 16.74/5.68 private void rangeCheckForAdd(int index) { 16.74/5.68 if (index < 0 || index > size()) 16.74/5.68 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.68 } 16.74/5.68 16.74/5.68 private String outOfBoundsMsg(int index) { 16.74/5.68 return ""; 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 class SubList extends AbstractList { 16.74/5.68 private final AbstractList l; 16.74/5.68 private final int offset; 16.74/5.68 private int size; 16.74/5.68 16.74/5.68 SubList(AbstractList list, int fromIndex, int toIndex) { 16.74/5.68 if (fromIndex < 0) 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 if (toIndex > list.size()) 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 if (fromIndex > toIndex) 16.74/5.68 throw new IllegalArgumentException(); 16.74/5.68 l = list; 16.74/5.68 offset = fromIndex; 16.74/5.68 size = toIndex - fromIndex; 16.74/5.68 this.modCount = l.modCount; 16.74/5.68 } 16.74/5.68 16.74/5.68 public E set(int index, E element) { 16.74/5.68 rangeCheck(index); 16.74/5.68 checkForComodification(); 16.74/5.68 return l.set(index+offset, element); 16.74/5.68 } 16.74/5.68 16.74/5.68 public E get(int index) { 16.74/5.68 rangeCheck(index); 16.74/5.68 checkForComodification(); 16.74/5.68 return l.get(index+offset); 16.74/5.68 } 16.74/5.68 16.74/5.68 public int size() { 16.74/5.68 checkForComodification(); 16.74/5.68 return size; 16.74/5.68 } 16.74/5.68 16.74/5.68 public void add(int index, E element) { 16.74/5.68 rangeCheckForAdd(index); 16.74/5.68 checkForComodification(); 16.74/5.68 l.add(index+offset, element); 16.74/5.68 this.modCount = l.modCount; 16.74/5.68 size++; 16.74/5.68 } 16.74/5.68 16.74/5.68 public E remove(int index) { 16.74/5.68 rangeCheck(index); 16.74/5.68 checkForComodification(); 16.74/5.68 E result = l.remove(index+offset); 16.74/5.68 this.modCount = l.modCount; 16.74/5.68 size--; 16.74/5.68 return result; 16.74/5.68 } 16.74/5.68 16.74/5.68 protected void removeRange(int fromIndex, int toIndex) { 16.74/5.68 checkForComodification(); 16.74/5.68 l.removeRange(fromIndex+offset, toIndex+offset); 16.74/5.68 this.modCount = l.modCount; 16.74/5.68 size -= (toIndex-fromIndex); 16.74/5.68 } 16.74/5.68 16.74/5.68 public boolean addAll(Collection c) { 16.74/5.68 return addAll(size, c); 16.74/5.68 } 16.74/5.68 16.74/5.68 public boolean addAll(int index, Collection c) { 16.74/5.68 rangeCheckForAdd(index); 16.74/5.68 int cSize = c.size(); 16.74/5.68 if (cSize==0) 16.74/5.68 return false; 16.74/5.68 16.74/5.68 checkForComodification(); 16.74/5.68 l.addAll(offset+index, c); 16.74/5.68 this.modCount = l.modCount; 16.74/5.68 size += cSize; 16.74/5.68 return true; 16.74/5.68 } 16.74/5.68 16.74/5.68 public Iterator iterator() { 16.74/5.68 return listIterator(); 16.74/5.68 } 16.74/5.68 16.74/5.68 public ListIterator listIterator(final int index) { 16.74/5.68 checkForComodification(); 16.74/5.68 rangeCheckForAdd(index); 16.74/5.68 16.74/5.68 return new ListIterator() { 16.74/5.68 private final ListIterator i = l.listIterator(index+offset); 16.74/5.68 16.74/5.68 public boolean hasNext() { 16.74/5.68 return nextIndex() < size; 16.74/5.68 } 16.74/5.68 16.74/5.68 public E next() { 16.74/5.68 if (hasNext()) 16.74/5.68 return i.next(); 16.74/5.68 else 16.74/5.68 throw new NoSuchElementException(); 16.74/5.68 } 16.74/5.68 16.74/5.68 public boolean hasPrevious() { 16.74/5.68 return previousIndex() >= 0; 16.74/5.68 } 16.74/5.68 16.74/5.68 public E previous() { 16.74/5.68 if (hasPrevious()) 16.74/5.68 return i.previous(); 16.74/5.68 else 16.74/5.68 throw new NoSuchElementException(); 16.74/5.68 } 16.74/5.68 16.74/5.68 public int nextIndex() { 16.74/5.68 return i.nextIndex() - offset; 16.74/5.68 } 16.74/5.68 16.74/5.68 public int previousIndex() { 16.74/5.68 return i.previousIndex() - offset; 16.74/5.68 } 16.74/5.68 16.74/5.68 public void remove() { 16.74/5.68 i.remove(); 16.74/5.68 SubList.this.modCount = l.modCount; 16.74/5.68 size--; 16.74/5.68 } 16.74/5.68 16.74/5.68 public void set(E e) { 16.74/5.68 i.set(e); 16.74/5.68 } 16.74/5.68 16.74/5.68 public void add(E e) { 16.74/5.68 i.add(e); 16.74/5.68 SubList.this.modCount = l.modCount; 16.74/5.68 size++; 16.74/5.68 } 16.74/5.68 }; 16.74/5.68 } 16.74/5.68 16.74/5.68 public List subList(int fromIndex, int toIndex) { 16.74/5.68 return new SubList(this, fromIndex, toIndex); 16.74/5.68 } 16.74/5.68 16.74/5.68 private void rangeCheck(int index) { 16.74/5.68 if (index < 0 || index >= size) 16.74/5.68 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.68 } 16.74/5.68 16.74/5.68 private void rangeCheckForAdd(int index) { 16.74/5.68 if (index < 0 || index > size) 16.74/5.68 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.68 } 16.74/5.68 16.74/5.68 private String outOfBoundsMsg(int index) { 16.74/5.68 return ""; 16.74/5.68 } 16.74/5.68 16.74/5.68 private void checkForComodification() { 16.74/5.68 if (this.modCount != l.modCount) 16.74/5.68 throw new ConcurrentModificationException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 class RandomAccessSubList extends SubList implements RandomAccess { 16.74/5.68 RandomAccessSubList(AbstractList list, int fromIndex, int toIndex) { 16.74/5.68 super(list, fromIndex, toIndex); 16.74/5.68 } 16.74/5.68 16.74/5.68 public List subList(int fromIndex, int toIndex) { 16.74/5.68 return new RandomAccessSubList(this, fromIndex, toIndex); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 /* 16.74/5.68 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.68 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.68 * 16.74/5.68 * This code is free software; you can redistribute it and/or modify it 16.74/5.68 * under the terms of the GNU General Public License version 2 only, as 16.74/5.68 * published by the Free Software Foundation. Sun designates this 16.74/5.68 * particular file as subject to the "Classpath" exception as provided 16.74/5.68 * by Sun in the LICENSE file that accompanied this code. 16.74/5.68 * 16.74/5.68 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.68 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.68 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.68 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.68 * accompanied this code). 16.74/5.68 * 16.74/5.68 * You should have received a copy of the GNU General Public License version 16.74/5.68 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.68 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.68 * 16.74/5.68 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.68 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.68 * have any questions. 16.74/5.68 */ 16.74/5.68 16.74/5.68 package javaUtilEx; 16.74/5.68 16.74/5.68 /** 16.74/5.68 * This class provides a skeletal implementation of the List 16.74/5.68 * interface to minimize the effort required to implement this interface 16.74/5.68 * backed by a "sequential access" data store (such as a linked list). For 16.74/5.68 * random access data (such as an array), AbstractList should be used 16.74/5.68 * in preference to this class.

16.74/5.68 * 16.74/5.68 * This class is the opposite of the AbstractList class in the sense 16.74/5.68 * that it implements the "random access" methods (get(int index), 16.74/5.68 * set(int index, E element), add(int index, E element) and 16.74/5.68 * remove(int index)) on top of the list's list iterator, instead of 16.74/5.68 * the other way around.

16.74/5.68 * 16.74/5.68 * To implement a list the programmer needs only to extend this class and 16.74/5.68 * provide implementations for the listIterator and size 16.74/5.68 * methods. For an unmodifiable list, the programmer need only implement the 16.74/5.68 * list iterator's hasNext, next, hasPrevious, 16.74/5.68 * previous and index methods.

16.74/5.68 * 16.74/5.68 * For a modifiable list the programmer should additionally implement the list 16.74/5.68 * iterator's set method. For a variable-size list the programmer 16.74/5.68 * should additionally implement the list iterator's remove and 16.74/5.68 * add methods.

16.74/5.68 * 16.74/5.68 * The programmer should generally provide a void (no argument) and collection 16.74/5.68 * constructor, as per the recommendation in the Collection interface 16.74/5.68 * specification.

16.74/5.68 * 16.74/5.68 * This class is a member of the 16.74/5.68 * 16.74/5.68 * Java Collections Framework. 16.74/5.68 * 16.74/5.68 * @author Josh Bloch 16.74/5.68 * @author Neal Gafter 16.74/5.68 * @see Collection 16.74/5.68 * @see List 16.74/5.68 * @see AbstractList 16.74/5.68 * @see AbstractCollection 16.74/5.68 * @since 1.2 16.74/5.68 */ 16.74/5.68 16.74/5.68 public abstract class AbstractSequentialList extends AbstractList { 16.74/5.68 /** 16.74/5.68 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.68 * implicit.) 16.74/5.68 */ 16.74/5.68 protected AbstractSequentialList() { 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns the element at the specified position in this list. 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator pointing to the 16.74/5.68 * indexed element (with listIterator(index)). Then, it gets 16.74/5.68 * the element using ListIterator.next and returns it. 16.74/5.68 * 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public E get(int index) { 16.74/5.68 try { 16.74/5.68 return listIterator(index).next(); 16.74/5.68 } catch (NoSuchElementException exc) { 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Replaces the element at the specified position in this list with the 16.74/5.68 * specified element (optional operation). 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator pointing to the 16.74/5.68 * indexed element (with listIterator(index)). Then, it gets 16.74/5.68 * the current element using ListIterator.next and replaces it 16.74/5.68 * with ListIterator.set. 16.74/5.68 * 16.74/5.68 *

Note that this implementation will throw an 16.74/5.68 * UnsupportedOperationException if the list iterator does not 16.74/5.68 * implement the set operation. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public E set(int index, E element) { 16.74/5.68 try { 16.74/5.68 ListIterator e = listIterator(index); 16.74/5.68 E oldVal = e.next(); 16.74/5.68 e.set(element); 16.74/5.68 return oldVal; 16.74/5.68 } catch (NoSuchElementException exc) { 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Inserts the specified element at the specified position in this list 16.74/5.68 * (optional operation). Shifts the element currently at that position 16.74/5.68 * (if any) and any subsequent elements to the right (adds one to their 16.74/5.68 * indices). 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator pointing to the 16.74/5.68 * indexed element (with listIterator(index)). Then, it 16.74/5.68 * inserts the specified element with ListIterator.add. 16.74/5.68 * 16.74/5.68 *

Note that this implementation will throw an 16.74/5.68 * UnsupportedOperationException if the list iterator does not 16.74/5.68 * implement the add operation. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public void add(int index, E element) { 16.74/5.68 try { 16.74/5.68 listIterator(index).add(element); 16.74/5.68 } catch (NoSuchElementException exc) { 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes the element at the specified position in this list (optional 16.74/5.68 * operation). Shifts any subsequent elements to the left (subtracts one 16.74/5.68 * from their indices). Returns the element that was removed from the 16.74/5.68 * list. 16.74/5.68 * 16.74/5.68 *

This implementation first gets a list iterator pointing to the 16.74/5.68 * indexed element (with listIterator(index)). Then, it removes 16.74/5.68 * the element with ListIterator.remove. 16.74/5.68 * 16.74/5.68 *

Note that this implementation will throw an 16.74/5.68 * UnsupportedOperationException if the list iterator does not 16.74/5.68 * implement the remove operation. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public E remove(int index) { 16.74/5.68 try { 16.74/5.68 ListIterator e = listIterator(index); 16.74/5.68 E outCast = e.next(); 16.74/5.68 e.remove(); 16.74/5.68 return outCast; 16.74/5.68 } catch (NoSuchElementException exc) { 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 // Bulk Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Inserts all of the elements in the specified collection into this 16.74/5.68 * list at the specified position (optional operation). Shifts the 16.74/5.68 * element currently at that position (if any) and any subsequent 16.74/5.68 * elements to the right (increases their indices). The new elements 16.74/5.68 * will appear in this list in the order that they are returned by the 16.74/5.68 * specified collection's iterator. The behavior of this operation is 16.74/5.68 * undefined if the specified collection is modified while the 16.74/5.68 * operation is in progress. (Note that this will occur if the specified 16.74/5.68 * collection is this list, and it's nonempty.) 16.74/5.68 * 16.74/5.68 *

This implementation gets an iterator over the specified collection and 16.74/5.68 * a list iterator over this list pointing to the indexed element (with 16.74/5.68 * listIterator(index)). Then, it iterates over the specified 16.74/5.68 * collection, inserting the elements obtained from the iterator into this 16.74/5.68 * list, one at a time, using ListIterator.add followed by 16.74/5.68 * ListIterator.next (to skip over the added element). 16.74/5.68 * 16.74/5.68 *

Note that this implementation will throw an 16.74/5.68 * UnsupportedOperationException if the list iterator returned by 16.74/5.68 * the listIterator method does not implement the add 16.74/5.68 * operation. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.68 * @throws ClassCastException {@inheritDoc} 16.74/5.68 * @throws NullPointerException {@inheritDoc} 16.74/5.68 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public boolean addAll(int index, Collection c) { 16.74/5.68 try { 16.74/5.68 boolean modified = false; 16.74/5.68 ListIterator e1 = listIterator(index); 16.74/5.68 Iterator e2 = c.iterator(); 16.74/5.68 while (e2.hasNext()) { 16.74/5.68 e1.add(e2.next()); 16.74/5.68 modified = true; 16.74/5.68 } 16.74/5.68 return modified; 16.74/5.68 } catch (NoSuchElementException exc) { 16.74/5.68 throw new IndexOutOfBoundsException(); 16.74/5.68 } 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 // Iterators 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns an iterator over the elements in this list (in proper 16.74/5.68 * sequence).

16.74/5.68 * 16.74/5.68 * This implementation merely returns a list iterator over the list. 16.74/5.68 * 16.74/5.68 * @return an iterator over the elements in this list (in proper sequence) 16.74/5.68 */ 16.74/5.68 public Iterator iterator() { 16.74/5.68 return listIterator(); 16.74/5.68 } 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns a list iterator over the elements in this list (in proper 16.74/5.68 * sequence). 16.74/5.68 * 16.74/5.68 * @param index index of first element to be returned from the list 16.74/5.68 * iterator (by a call to the next method) 16.74/5.68 * @return a list iterator over the elements in this list (in proper 16.74/5.68 * sequence) 16.74/5.68 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.68 */ 16.74/5.68 public abstract ListIterator listIterator(int index); 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 /* 16.74/5.68 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.68 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.68 * 16.74/5.68 * This code is free software; you can redistribute it and/or modify it 16.74/5.68 * under the terms of the GNU General Public License version 2 only, as 16.74/5.68 * published by the Free Software Foundation. Sun designates this 16.74/5.68 * particular file as subject to the "Classpath" exception as provided 16.74/5.68 * by Sun in the LICENSE file that accompanied this code. 16.74/5.68 * 16.74/5.68 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.68 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.68 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.68 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.68 * accompanied this code). 16.74/5.68 * 16.74/5.68 * You should have received a copy of the GNU General Public License version 16.74/5.68 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.68 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.68 * 16.74/5.68 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.68 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.68 * have any questions. 16.74/5.68 */ 16.74/5.68 16.74/5.68 package javaUtilEx; 16.74/5.68 16.74/5.68 /** 16.74/5.68 * The root interface in the collection hierarchy. A collection 16.74/5.68 * represents a group of objects, known as its elements. Some 16.74/5.68 * collections allow duplicate elements and others do not. Some are ordered 16.74/5.68 * and others unordered. The JDK does not provide any direct 16.74/5.68 * implementations of this interface: it provides implementations of more 16.74/5.68 * specific subinterfaces like Set and List. This interface 16.74/5.68 * is typically used to pass collections around and manipulate them where 16.74/5.68 * maximum generality is desired. 16.74/5.68 * 16.74/5.68 *

Bags or multisets (unordered collections that may contain 16.74/5.68 * duplicate elements) should implement this interface directly. 16.74/5.68 * 16.74/5.68 *

All general-purpose Collection implementation classes (which 16.74/5.68 * typically implement Collection indirectly through one of its 16.74/5.68 * subinterfaces) should provide two "standard" constructors: a void (no 16.74/5.68 * arguments) constructor, which creates an empty collection, and a 16.74/5.68 * constructor with a single argument of type Collection, which 16.74/5.68 * creates a new collection with the same elements as its argument. In 16.74/5.68 * effect, the latter constructor allows the user to copy any collection, 16.74/5.68 * producing an equivalent collection of the desired implementation type. 16.74/5.68 * There is no way to enforce this convention (as interfaces cannot contain 16.74/5.68 * constructors) but all of the general-purpose Collection 16.74/5.68 * implementations in the Java platform libraries comply. 16.74/5.68 * 16.74/5.68 *

The "destructive" methods contained in this interface, that is, the 16.74/5.68 * methods that modify the collection on which they operate, are specified to 16.74/5.68 * throw UnsupportedOperationException if this collection does not 16.74/5.68 * support the operation. If this is the case, these methods may, but are not 16.74/5.68 * required to, throw an UnsupportedOperationException if the 16.74/5.68 * invocation would have no effect on the collection. For example, invoking 16.74/5.68 * the {@link #addAll(Collection)} method on an unmodifiable collection may, 16.74/5.68 * but is not required to, throw the exception if the collection to be added 16.74/5.68 * is empty. 16.74/5.68 * 16.74/5.68 *

Some collection implementations have restrictions on the elements that 16.74/5.68 * they may contain. For example, some implementations prohibit null elements, 16.74/5.68 * and some have restrictions on the types of their elements. Attempting to 16.74/5.68 * add an ineligible element throws an unchecked exception, typically 16.74/5.68 * NullPointerException or ClassCastException. Attempting 16.74/5.68 * to query the presence of an ineligible element may throw an exception, 16.74/5.68 * or it may simply return false; some implementations will exhibit the former 16.74/5.68 * behavior and some will exhibit the latter. More generally, attempting an 16.74/5.68 * operation on an ineligible element whose completion would not result in 16.74/5.68 * the insertion of an ineligible element into the collection may throw an 16.74/5.68 * exception or it may succeed, at the option of the implementation. 16.74/5.68 * Such exceptions are marked as "optional" in the specification for this 16.74/5.68 * interface. 16.74/5.68 * 16.74/5.68 *

It is up to each collection to determine its own synchronization 16.74/5.68 * policy. In the absence of a stronger guarantee by the 16.74/5.68 * implementation, undefined behavior may result from the invocation 16.74/5.68 * of any method on a collection that is being mutated by another 16.74/5.68 * thread; this includes direct invocations, passing the collection to 16.74/5.68 * a method that might perform invocations, and using an existing 16.74/5.68 * iterator to examine the collection. 16.74/5.68 * 16.74/5.68 *

Many methods in Collections Framework interfaces are defined in 16.74/5.68 * terms of the {@link Object#equals(Object) equals} method. For example, 16.74/5.68 * the specification for the {@link #contains(Object) contains(Object o)} 16.74/5.68 * method says: "returns true if and only if this collection 16.74/5.68 * contains at least one element e such that 16.74/5.68 * (o==null ? e==null : o.equals(e))." This specification should 16.74/5.68 * not be construed to imply that invoking Collection.contains 16.74/5.68 * with a non-null argument o will cause o.equals(e) to be 16.74/5.68 * invoked for any element e. Implementations are free to implement 16.74/5.68 * optimizations whereby the equals invocation is avoided, for 16.74/5.68 * example, by first comparing the hash codes of the two elements. (The 16.74/5.68 * {@link Object#hashCode()} specification guarantees that two objects with 16.74/5.68 * unequal hash codes cannot be equal.) More generally, implementations of 16.74/5.68 * the various Collections Framework interfaces are free to take advantage of 16.74/5.68 * the specified behavior of underlying {@link Object} methods wherever the 16.74/5.68 * implementor deems it appropriate. 16.74/5.68 * 16.74/5.68 *

This interface is a member of the 16.74/5.68 * 16.74/5.68 * Java Collections Framework. 16.74/5.68 * 16.74/5.68 * @author Josh Bloch 16.74/5.68 * @author Neal Gafter 16.74/5.68 * @see Set 16.74/5.68 * @see List 16.74/5.68 * @see Map 16.74/5.68 * @see SortedSet 16.74/5.68 * @see SortedMap 16.74/5.68 * @see HashSet 16.74/5.68 * @see TreeSet 16.74/5.68 * @see ArrayList 16.74/5.68 * @see LinkedList 16.74/5.68 * @see Vector 16.74/5.68 * @see Collections 16.74/5.68 * @see Arrays 16.74/5.68 * @see AbstractCollection 16.74/5.68 * @since 1.2 16.74/5.68 */ 16.74/5.68 16.74/5.68 public interface Collection { 16.74/5.68 // Query Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns the number of elements in this collection. If this collection 16.74/5.68 * contains more than Integer.MAX_VALUE elements, returns 16.74/5.68 * Integer.MAX_VALUE. 16.74/5.68 * 16.74/5.68 * @return the number of elements in this collection 16.74/5.68 */ 16.74/5.68 int size(); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns true if this collection contains no elements. 16.74/5.68 * 16.74/5.68 * @return true if this collection contains no elements 16.74/5.68 */ 16.74/5.68 boolean isEmpty(); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns true if this collection contains the specified element. 16.74/5.68 * More formally, returns true if and only if this collection 16.74/5.68 * contains at least one element e such that 16.74/5.68 * (o==null ? e==null : o.equals(e)). 16.74/5.68 * 16.74/5.68 * @param o element whose presence in this collection is to be tested 16.74/5.68 * @return true if this collection contains the specified 16.74/5.68 * element 16.74/5.68 * @throws ClassCastException if the type of the specified element 16.74/5.68 * is incompatible with this collection (optional) 16.74/5.68 * @throws NullPointerException if the specified element is null and this 16.74/5.68 * collection does not permit null elements (optional) 16.74/5.68 */ 16.74/5.68 boolean contains(Object o); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns an iterator over the elements in this collection. There are no 16.74/5.68 * guarantees concerning the order in which the elements are returned 16.74/5.68 * (unless this collection is an instance of some class that provides a 16.74/5.68 * guarantee). 16.74/5.68 * 16.74/5.68 * @return an Iterator over the elements in this collection 16.74/5.68 */ 16.74/5.68 Iterator iterator(); 16.74/5.68 16.74/5.68 // Modification Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Ensures that this collection contains the specified element (optional 16.74/5.68 * operation). Returns true if this collection changed as a 16.74/5.68 * result of the call. (Returns false if this collection does 16.74/5.68 * not permit duplicates and already contains the specified element.)

16.74/5.68 * 16.74/5.68 * Collections that support this operation may place limitations on what 16.74/5.68 * elements may be added to this collection. In particular, some 16.74/5.68 * collections will refuse to add null elements, and others will 16.74/5.68 * impose restrictions on the type of elements that may be added. 16.74/5.68 * Collection classes should clearly specify in their documentation any 16.74/5.68 * restrictions on what elements may be added.

16.74/5.68 * 16.74/5.68 * If a collection refuses to add a particular element for any reason 16.74/5.68 * other than that it already contains the element, it must throw 16.74/5.68 * an exception (rather than returning false). This preserves 16.74/5.68 * the invariant that a collection always contains the specified element 16.74/5.68 * after this call returns. 16.74/5.68 * 16.74/5.68 * @param e element whose presence in this collection is to be ensured 16.74/5.68 * @return true if this collection changed as a result of the 16.74/5.68 * call 16.74/5.68 * @throws UnsupportedOperationException if the add operation 16.74/5.68 * is not supported by this collection 16.74/5.68 * @throws ClassCastException if the class of the specified element 16.74/5.68 * prevents it from being added to this collection 16.74/5.68 * @throws NullPointerException if the specified element is null and this 16.74/5.68 * collection does not permit null elements 16.74/5.68 * @throws IllegalArgumentException if some property of the element 16.74/5.68 * prevents it from being added to this collection 16.74/5.68 * @throws IllegalStateException if the element cannot be added at this 16.74/5.68 * time due to insertion restrictions 16.74/5.68 */ 16.74/5.68 boolean add(E e); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes a single instance of the specified element from this 16.74/5.68 * collection, if it is present (optional operation). More formally, 16.74/5.68 * removes an element e such that 16.74/5.68 * (o==null ? e==null : o.equals(e)), if 16.74/5.68 * this collection contains one or more such elements. Returns 16.74/5.68 * true if this collection contained the specified element (or 16.74/5.68 * equivalently, if this collection changed as a result of the call). 16.74/5.68 * 16.74/5.68 * @param o element to be removed from this collection, if present 16.74/5.68 * @return true if an element was removed as a result of this call 16.74/5.68 * @throws ClassCastException if the type of the specified element 16.74/5.68 * is incompatible with this collection (optional) 16.74/5.68 * @throws NullPointerException if the specified element is null and this 16.74/5.68 * collection does not permit null elements (optional) 16.74/5.68 * @throws UnsupportedOperationException if the remove operation 16.74/5.68 * is not supported by this collection 16.74/5.68 */ 16.74/5.68 boolean remove(Object o); 16.74/5.68 16.74/5.68 16.74/5.68 // Bulk Operations 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns true if this collection contains all of the elements 16.74/5.68 * in the specified collection. 16.74/5.68 * 16.74/5.68 * @param c collection to be checked for containment in this collection 16.74/5.68 * @return true if this collection contains all of the elements 16.74/5.68 * in the specified collection 16.74/5.68 * @throws ClassCastException if the types of one or more elements 16.74/5.68 * in the specified collection are incompatible with this 16.74/5.68 * collection (optional) 16.74/5.68 * @throws NullPointerException if the specified collection contains one 16.74/5.68 * or more null elements and this collection does not permit null 16.74/5.68 * elements (optional), or if the specified collection is null 16.74/5.68 * @see #contains(Object) 16.74/5.68 */ 16.74/5.68 boolean containsAll(Collection c); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Adds all of the elements in the specified collection to this collection 16.74/5.68 * (optional operation). The behavior of this operation is undefined if 16.74/5.68 * the specified collection is modified while the operation is in progress. 16.74/5.68 * (This implies that the behavior of this call is undefined if the 16.74/5.68 * specified collection is this collection, and this collection is 16.74/5.68 * nonempty.) 16.74/5.68 * 16.74/5.68 * @param c collection containing elements to be added to this collection 16.74/5.68 * @return true if this collection changed as a result of the call 16.74/5.68 * @throws UnsupportedOperationException if the addAll operation 16.74/5.68 * is not supported by this collection 16.74/5.68 * @throws ClassCastException if the class of an element of the specified 16.74/5.68 * collection prevents it from being added to this collection 16.74/5.68 * @throws NullPointerException if the specified collection contains a 16.74/5.68 * null element and this collection does not permit null elements, 16.74/5.68 * or if the specified collection is null 16.74/5.68 * @throws IllegalArgumentException if some property of an element of the 16.74/5.68 * specified collection prevents it from being added to this 16.74/5.68 * collection 16.74/5.68 * @throws IllegalStateException if not all the elements can be added at 16.74/5.68 * this time due to insertion restrictions 16.74/5.68 * @see #add(Object) 16.74/5.68 */ 16.74/5.68 boolean addAll(Collection c); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes all of this collection's elements that are also contained in the 16.74/5.68 * specified collection (optional operation). After this call returns, 16.74/5.68 * this collection will contain no elements in common with the specified 16.74/5.68 * collection. 16.74/5.68 * 16.74/5.68 * @param c collection containing elements to be removed from this collection 16.74/5.68 * @return true if this collection changed as a result of the 16.74/5.68 * call 16.74/5.68 * @throws UnsupportedOperationException if the removeAll method 16.74/5.68 * is not supported by this collection 16.74/5.68 * @throws ClassCastException if the types of one or more elements 16.74/5.68 * in this collection are incompatible with the specified 16.74/5.68 * collection (optional) 16.74/5.68 * @throws NullPointerException if this collection contains one or more 16.74/5.68 * null elements and the specified collection does not support 16.74/5.68 * null elements (optional), or if the specified collection is null 16.74/5.68 * @see #remove(Object) 16.74/5.68 * @see #contains(Object) 16.74/5.68 */ 16.74/5.68 boolean removeAll(Collection c); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Retains only the elements in this collection that are contained in the 16.74/5.68 * specified collection (optional operation). In other words, removes from 16.74/5.68 * this collection all of its elements that are not contained in the 16.74/5.68 * specified collection. 16.74/5.68 * 16.74/5.68 * @param c collection containing elements to be retained in this collection 16.74/5.68 * @return true if this collection changed as a result of the call 16.74/5.68 * @throws UnsupportedOperationException if the retainAll operation 16.74/5.68 * is not supported by this collection 16.74/5.68 * @throws ClassCastException if the types of one or more elements 16.74/5.68 * in this collection are incompatible with the specified 16.74/5.68 * collection (optional) 16.74/5.68 * @throws NullPointerException if this collection contains one or more 16.74/5.68 * null elements and the specified collection does not permit null 16.74/5.68 * elements (optional), or if the specified collection is null 16.74/5.68 * @see #remove(Object) 16.74/5.68 * @see #contains(Object) 16.74/5.68 */ 16.74/5.68 boolean retainAll(Collection c); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Removes all of the elements from this collection (optional operation). 16.74/5.68 * The collection will be empty after this method returns. 16.74/5.68 * 16.74/5.68 * @throws UnsupportedOperationException if the clear operation 16.74/5.68 * is not supported by this collection 16.74/5.68 */ 16.74/5.68 void clear(); 16.74/5.68 16.74/5.68 16.74/5.68 // Comparison and hashing 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Compares the specified object with this collection for equality.

16.74/5.68 * 16.74/5.68 * While the Collection interface adds no stipulations to the 16.74/5.68 * general contract for the Object.equals, programmers who 16.74/5.68 * implement the Collection interface "directly" (in other words, 16.74/5.68 * create a class that is a Collection but is not a Set 16.74/5.68 * or a List) must exercise care if they choose to override the 16.74/5.68 * Object.equals. It is not necessary to do so, and the simplest 16.74/5.68 * course of action is to rely on Object's implementation, but 16.74/5.68 * the implementor may wish to implement a "value comparison" in place of 16.74/5.68 * the default "reference comparison." (The List and 16.74/5.68 * Set interfaces mandate such value comparisons.)

16.74/5.68 * 16.74/5.68 * The general contract for the Object.equals method states that 16.74/5.68 * equals must be symmetric (in other words, a.equals(b) if and 16.74/5.68 * only if b.equals(a)). The contracts for List.equals 16.74/5.68 * and Set.equals state that lists are only equal to other lists, 16.74/5.68 * and sets to other sets. Thus, a custom equals method for a 16.74/5.68 * collection class that implements neither the List nor 16.74/5.68 * Set interface must return false when this collection 16.74/5.68 * is compared to any list or set. (By the same logic, it is not possible 16.74/5.68 * to write a class that correctly implements both the Set and 16.74/5.68 * List interfaces.) 16.74/5.68 * 16.74/5.68 * @param o object to be compared for equality with this collection 16.74/5.68 * @return true if the specified object is equal to this 16.74/5.68 * collection 16.74/5.68 * 16.74/5.68 * @see Object#equals(Object) 16.74/5.68 * @see Set#equals(Object) 16.74/5.68 * @see List#equals(Object) 16.74/5.68 */ 16.74/5.68 boolean equals(Object o); 16.74/5.68 16.74/5.68 /** 16.74/5.68 * Returns the hash code value for this collection. While the 16.74/5.68 * Collection interface adds no stipulations to the general 16.74/5.68 * contract for the Object.hashCode method, programmers should 16.74/5.68 * take note that any class that overrides the Object.equals 16.74/5.68 * method must also override the Object.hashCode method in order 16.74/5.68 * to satisfy the general contract for the Object.hashCodemethod. 16.74/5.68 * In particular, c1.equals(c2) implies that 16.74/5.68 * c1.hashCode()==c2.hashCode(). 16.74/5.68 * 16.74/5.68 * @return the hash code value for this collection 16.74/5.68 * 16.74/5.68 * @see Object#hashCode() 16.74/5.68 * @see Object#equals(Object) 16.74/5.68 */ 16.74/5.68 int hashCode(); 16.74/5.68 } 16.74/5.68 16.74/5.68 16.74/5.68 /* 16.74/5.68 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.68 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.68 * 16.74/5.68 * This code is free software; you can redistribute it and/or modify it 16.74/5.68 * under the terms of the GNU General Public License version 2 only, as 16.74/5.68 * published by the Free Software Foundation. Sun designates this 16.74/5.68 * particular file as subject to the "Classpath" exception as provided 16.74/5.68 * by Sun in the LICENSE file that accompanied this code. 16.74/5.68 * 16.74/5.68 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.68 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.68 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.68 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.68 * accompanied this code). 16.74/5.68 * 16.74/5.68 * You should have received a copy of the GNU General Public License version 16.74/5.68 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.68 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.68 * 16.74/5.68 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.68 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.68 * have any questions. 16.74/5.68 */ 16.74/5.68 16.74/5.68 package javaUtilEx; 16.74/5.68 16.74/5.68 /** 16.74/5.68 * This exception may be thrown by methods that have detected concurrent 16.74/5.68 * modification of an object when such modification is not permissible. 16.74/5.68 *

16.74/5.68 * For example, it is not generally permissible for one thread to modify a Collection 16.74/5.68 * while another thread is iterating over it. In general, the results of the 16.74/5.68 * iteration are undefined under these circumstances. Some Iterator 16.74/5.68 * implementations (including those of all the general purpose collection implementations 16.74/5.68 * provided by the JRE) may choose to throw this exception if this behavior is 16.74/5.68 * detected. Iterators that do this are known as fail-fast iterators, 16.74/5.68 * as they fail quickly and cleanly, rather that risking arbitrary, 16.74/5.68 * non-deterministic behavior at an undetermined time in the future. 16.74/5.68 *

16.74/5.68 * Note that this exception does not always indicate that an object has 16.74/5.68 * been concurrently modified by a different thread. If a single 16.74/5.68 * thread issues a sequence of method invocations that violates the 16.74/5.68 * contract of an object, the object may throw this exception. For 16.74/5.68 * example, if a thread modifies a collection directly while it is 16.74/5.68 * iterating over the collection with a fail-fast iterator, the iterator 16.74/5.68 * will throw this exception. 16.74/5.68 * 16.74/5.68 *

Note that fail-fast behavior cannot be guaranteed as it is, generally 16.74/5.69 * speaking, impossible to make any hard guarantees in the presence of 16.74/5.69 * unsynchronized concurrent modification. Fail-fast operations 16.74/5.69 * throw ConcurrentModificationException on a best-effort basis. 16.74/5.69 * Therefore, it would be wrong to write a program that depended on this 16.74/5.69 * exception for its correctness: ConcurrentModificationException 16.74/5.69 * should be used only to detect bugs. 16.74/5.69 * 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @see Collection 16.74/5.69 * @see Iterator 16.74/5.69 * @see ListIterator 16.74/5.69 * @see Vector 16.74/5.69 * @see LinkedList 16.74/5.69 * @see HashSet 16.74/5.69 * @see Hashtable 16.74/5.69 * @see TreeMap 16.74/5.69 * @see AbstractList 16.74/5.69 * @since 1.2 16.74/5.69 */ 16.74/5.69 public class ConcurrentModificationException extends RuntimeException { 16.74/5.69 /** 16.74/5.69 * Constructs a ConcurrentModificationException with no 16.74/5.69 * detail message. 16.74/5.69 */ 16.74/5.69 public ConcurrentModificationException() { 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a ConcurrentModificationException with the 16.74/5.69 * specified detail message. 16.74/5.69 * 16.74/5.69 * @param message the detail message pertaining to this exception. 16.74/5.69 */ 16.74/5.69 public ConcurrentModificationException(String message) { 16.74/5.69 super(message); 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 /* 16.74/5.69 * This file is available under and governed by the GNU General Public 16.74/5.69 * License version 2 only, as published by the Free Software Foundation. 16.74/5.69 * However, the following notice accompanied the original version of this 16.74/5.69 * file: 16.74/5.69 * 16.74/5.69 * Written by Doug Lea and Josh Bloch with assistance from members of 16.74/5.69 * JCP JSR-166 Expert Group and released to the public domain, as explained 16.74/5.69 * at http://creativecommons.org/licenses/publicdomain 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * A linear collection that supports element insertion and removal at 16.74/5.69 * both ends. The name deque is short for "double ended queue" 16.74/5.69 * and is usually pronounced "deck". Most Deque 16.74/5.69 * implementations place no fixed limits on the number of elements 16.74/5.69 * they may contain, but this interface supports capacity-restricted 16.74/5.69 * deques as well as those with no fixed size limit. 16.74/5.69 * 16.74/5.69 *

This interface defines methods to access the elements at both 16.74/5.69 * ends of the deque. Methods are provided to insert, remove, and 16.74/5.69 * examine the element. Each of these methods exists in two forms: 16.74/5.69 * one throws an exception if the operation fails, the other returns a 16.74/5.69 * special value (either null or false, depending on 16.74/5.69 * the operation). The latter form of the insert operation is 16.74/5.69 * designed specifically for use with capacity-restricted 16.74/5.69 * Deque implementations; in most implementations, insert 16.74/5.69 * operations cannot fail. 16.74/5.69 * 16.74/5.69 *

The twelve methods described above are summarized in the 16.74/5.69 * following table: 16.74/5.69 * 16.74/5.69 *

16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 *
First Element (Head) Last Element (Tail)
Throws exceptionSpecial valueThrows exceptionSpecial value
Insert{@link #addFirst addFirst(e)}{@link #offerFirst offerFirst(e)}{@link #addLast addLast(e)}{@link #offerLast offerLast(e)}
Remove{@link #removeFirst removeFirst()}{@link #pollFirst pollFirst()}{@link #removeLast removeLast()}{@link #pollLast pollLast()}
Examine{@link #getFirst getFirst()}{@link #peekFirst peekFirst()}{@link #getLast getLast()}{@link #peekLast peekLast()}
16.74/5.69 * 16.74/5.69 *

This interface extends the {@link Queue} interface. When a deque is 16.74/5.69 * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are 16.74/5.69 * added at the end of the deque and removed from the beginning. The methods 16.74/5.69 * inherited from the Queue interface are precisely equivalent to 16.74/5.69 * Deque methods as indicated in the following table: 16.74/5.69 * 16.74/5.69 *

16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 *
Queue Method Equivalent Deque Method
{@link java.util.Queue#add add(e)}{@link #addLast addLast(e)}
{@link java.util.Queue#offer offer(e)}{@link #offerLast offerLast(e)}
{@link java.util.Queue#remove remove()}{@link #removeFirst removeFirst()}
{@link java.util.Queue#poll poll()}{@link #pollFirst pollFirst()}
{@link java.util.Queue#element element()}{@link #getFirst getFirst()}
{@link java.util.Queue#peek peek()}{@link #peek peekFirst()}
16.74/5.69 * 16.74/5.69 *

Deques can also be used as LIFO (Last-In-First-Out) stacks. This 16.74/5.69 * interface should be used in preference to the legacy {@link Stack} class. 16.74/5.69 * When a deque is used as a stack, elements are pushed and popped from the 16.74/5.69 * beginning of the deque. Stack methods are precisely equivalent to 16.74/5.69 * Deque methods as indicated in the table below: 16.74/5.69 * 16.74/5.69 *

16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 * 16.74/5.69 *
Stack Method Equivalent Deque Method
{@link #push push(e)}{@link #addFirst addFirst(e)}
{@link #pop pop()}{@link #removeFirst removeFirst()}
{@link #peek peek()}{@link #peekFirst peekFirst()}
16.74/5.69 * 16.74/5.69 *

Note that the {@link #peek peek} method works equally well when 16.74/5.69 * a deque is used as a queue or a stack; in either case, elements are 16.74/5.69 * drawn from the beginning of the deque. 16.74/5.69 * 16.74/5.69 *

This interface provides two methods to remove interior 16.74/5.69 * elements, {@link #removeFirstOccurrence removeFirstOccurrence} and 16.74/5.69 * {@link #removeLastOccurrence removeLastOccurrence}. 16.74/5.69 * 16.74/5.69 *

Unlike the {@link List} interface, this interface does not 16.74/5.69 * provide support for indexed access to elements. 16.74/5.69 * 16.74/5.69 *

While Deque implementations are not strictly required 16.74/5.69 * to prohibit the insertion of null elements, they are strongly 16.74/5.69 * encouraged to do so. Users of any Deque implementations 16.74/5.69 * that do allow null elements are strongly encouraged not to 16.74/5.69 * take advantage of the ability to insert nulls. This is so because 16.74/5.69 * null is used as a special return value by various methods 16.74/5.69 * to indicated that the deque is empty. 16.74/5.69 * 16.74/5.69 *

Deque implementations generally do not define 16.74/5.69 * element-based versions of the equals and hashCode 16.74/5.69 * methods, but instead inherit the identity-based versions from class 16.74/5.69 * Object. 16.74/5.69 * 16.74/5.69 *

This interface is a member of the Java Collections 16.74/5.69 * Framework. 16.74/5.69 * 16.74/5.69 * @author Doug Lea 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @since 1.6 16.74/5.69 * @param the type of elements held in this collection 16.74/5.69 */ 16.74/5.69 16.74/5.69 public interface Deque extends Queue { 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the front of this deque if it is 16.74/5.69 * possible to do so immediately without violating capacity restrictions. 16.74/5.69 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.69 * use method {@link #offerFirst}. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @throws IllegalStateException if the element cannot be added at this 16.74/5.69 * time due to capacity restrictions 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 void addFirst(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the end of this deque if it is 16.74/5.69 * possible to do so immediately without violating capacity restrictions. 16.74/5.69 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.69 * use method {@link #offerLast}. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #add}. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @throws IllegalStateException if the element cannot be added at this 16.74/5.69 * time due to capacity restrictions 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 void addLast(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the front of this deque unless it would 16.74/5.69 * violate capacity restrictions. When using a capacity-restricted deque, 16.74/5.69 * this method is generally preferable to the {@link #addFirst} method, 16.74/5.69 * which can fail to insert an element only by throwing an exception. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @return true if the element was added to this deque, else 16.74/5.69 * false 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 boolean offerFirst(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the end of this deque unless it would 16.74/5.69 * violate capacity restrictions. When using a capacity-restricted deque, 16.74/5.69 * this method is generally preferable to the {@link #addLast} method, 16.74/5.69 * which can fail to insert an element only by throwing an exception. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @return true if the element was added to this deque, else 16.74/5.69 * false 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 boolean offerLast(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the first element of this deque. This method 16.74/5.69 * differs from {@link #pollFirst pollFirst} only in that it throws an 16.74/5.69 * exception if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the head of this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E removeFirst(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the last element of this deque. This method 16.74/5.69 * differs from {@link #pollLast pollLast} only in that it throws an 16.74/5.69 * exception if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the tail of this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E removeLast(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the first element of this deque, 16.74/5.69 * or returns null if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the head of this deque, or null if this deque is empty 16.74/5.69 */ 16.74/5.69 E pollFirst(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the last element of this deque, 16.74/5.69 * or returns null if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the tail of this deque, or null if this deque is empty 16.74/5.69 */ 16.74/5.69 E pollLast(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the first element of this deque. 16.74/5.69 * 16.74/5.69 * This method differs from {@link #peekFirst peekFirst} only in that it 16.74/5.69 * throws an exception if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the head of this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E getFirst(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the last element of this deque. 16.74/5.69 * This method differs from {@link #peekLast peekLast} only in that it 16.74/5.69 * throws an exception if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the tail of this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E getLast(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the first element of this deque, 16.74/5.69 * or returns null if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the head of this deque, or null if this deque is empty 16.74/5.69 */ 16.74/5.69 E peekFirst(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the last element of this deque, 16.74/5.69 * or returns null if this deque is empty. 16.74/5.69 * 16.74/5.69 * @return the tail of this deque, or null if this deque is empty 16.74/5.69 */ 16.74/5.69 E peekLast(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the first occurrence of the specified element from this deque. 16.74/5.69 * If the deque does not contain the element, it is unchanged. 16.74/5.69 * More formally, removes the first element e such that 16.74/5.69 * (o==null ? e==null : o.equals(e)) 16.74/5.69 * (if such an element exists). 16.74/5.69 * Returns true if this deque contained the specified element 16.74/5.69 * (or equivalently, if this deque changed as a result of the call). 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this deque, if present 16.74/5.69 * @return true if an element was removed as a result of this call 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * is incompatible with this deque (optional) 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements (optional) 16.74/5.69 */ 16.74/5.69 boolean removeFirstOccurrence(Object o); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the last occurrence of the specified element from this deque. 16.74/5.69 * If the deque does not contain the element, it is unchanged. 16.74/5.69 * More formally, removes the last element e such that 16.74/5.69 * (o==null ? e==null : o.equals(e)) 16.74/5.69 * (if such an element exists). 16.74/5.69 * Returns true if this deque contained the specified element 16.74/5.69 * (or equivalently, if this deque changed as a result of the call). 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this deque, if present 16.74/5.69 * @return true if an element was removed as a result of this call 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * is incompatible with this deque (optional) 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements (optional) 16.74/5.69 */ 16.74/5.69 boolean removeLastOccurrence(Object o); 16.74/5.69 16.74/5.69 // *** Queue methods *** 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element into the queue represented by this deque 16.74/5.69 * (in other words, at the tail of this deque) if it is possible to do so 16.74/5.69 * immediately without violating capacity restrictions, returning 16.74/5.69 * true upon success and throwing an 16.74/5.69 * IllegalStateException if no space is currently available. 16.74/5.69 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.69 * use {@link #offer(Object) offer}. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #addLast}. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @return true (as specified by {@link Collection#add}) 16.74/5.69 * @throws IllegalStateException if the element cannot be added at this 16.74/5.69 * time due to capacity restrictions 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 boolean add(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element into the queue represented by this deque 16.74/5.69 * (in other words, at the tail of this deque) if it is possible to do so 16.74/5.69 * immediately without violating capacity restrictions, returning 16.74/5.69 * true upon success and false if no space is currently 16.74/5.69 * available. When using a capacity-restricted deque, this method is 16.74/5.69 * generally preferable to the {@link #add} method, which can fail to 16.74/5.69 * insert an element only by throwing an exception. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #offerLast}. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @return true if the element was added to this deque, else 16.74/5.69 * false 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 boolean offer(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the head of the queue represented by this deque 16.74/5.69 * (in other words, the first element of this deque). 16.74/5.69 * This method differs from {@link #poll poll} only in that it throws an 16.74/5.69 * exception if this deque is empty. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.69 * 16.74/5.69 * @return the head of the queue represented by this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E remove(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the head of the queue represented by this deque 16.74/5.69 * (in other words, the first element of this deque), or returns 16.74/5.69 * null if this deque is empty. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #pollFirst()}. 16.74/5.69 * 16.74/5.69 * @return the first element of this deque, or null if 16.74/5.69 * this deque is empty 16.74/5.69 */ 16.74/5.69 E poll(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the head of the queue represented by 16.74/5.69 * this deque (in other words, the first element of this deque). 16.74/5.69 * This method differs from {@link #peek peek} only in that it throws an 16.74/5.69 * exception if this deque is empty. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #getFirst()}. 16.74/5.69 * 16.74/5.69 * @return the head of the queue represented by this deque 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E element(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the head of the queue represented by 16.74/5.69 * this deque (in other words, the first element of this deque), or 16.74/5.69 * returns null if this deque is empty. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #peekFirst()}. 16.74/5.69 * 16.74/5.69 * @return the head of the queue represented by this deque, or 16.74/5.69 * null if this deque is empty 16.74/5.69 */ 16.74/5.69 E peek(); 16.74/5.69 16.74/5.69 16.74/5.69 // *** Stack methods *** 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Pushes an element onto the stack represented by this deque (in other 16.74/5.69 * words, at the head of this deque) if it is possible to do so 16.74/5.69 * immediately without violating capacity restrictions, returning 16.74/5.69 * true upon success and throwing an 16.74/5.69 * IllegalStateException if no space is currently available. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #addFirst}. 16.74/5.69 * 16.74/5.69 * @param e the element to push 16.74/5.69 * @throws IllegalStateException if the element cannot be added at this 16.74/5.69 * time due to capacity restrictions 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this deque 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements 16.74/5.69 * @throws IllegalArgumentException if some property of the specified 16.74/5.69 * element prevents it from being added to this deque 16.74/5.69 */ 16.74/5.69 void push(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Pops an element from the stack represented by this deque. In other 16.74/5.69 * words, removes and returns the first element of this deque. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.69 * 16.74/5.69 * @return the element at the front of this deque (which is the top 16.74/5.69 * of the stack represented by this deque) 16.74/5.69 * @throws NoSuchElementException if this deque is empty 16.74/5.69 */ 16.74/5.69 E pop(); 16.74/5.69 16.74/5.69 16.74/5.69 // *** Collection methods *** 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the first occurrence of the specified element from this deque. 16.74/5.69 * If the deque does not contain the element, it is unchanged. 16.74/5.69 * More formally, removes the first element e such that 16.74/5.69 * (o==null ? e==null : o.equals(e)) 16.74/5.69 * (if such an element exists). 16.74/5.69 * Returns true if this deque contained the specified element 16.74/5.69 * (or equivalently, if this deque changed as a result of the call). 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #removeFirstOccurrence}. 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this deque, if present 16.74/5.69 * @return true if an element was removed as a result of this call 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * is incompatible with this deque (optional) 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements (optional) 16.74/5.69 */ 16.74/5.69 boolean remove(Object o); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns true if this deque contains the specified element. 16.74/5.69 * More formally, returns true if and only if this deque contains 16.74/5.69 * at least one element e such that 16.74/5.69 * (o==null ? e==null : o.equals(e)). 16.74/5.69 * 16.74/5.69 * @param o element whose presence in this deque is to be tested 16.74/5.69 * @return true if this deque contains the specified element 16.74/5.69 * @throws ClassCastException if the type of the specified element 16.74/5.69 * is incompatible with this deque (optional) 16.74/5.69 * @throws NullPointerException if the specified element is null and this 16.74/5.69 * deque does not permit null elements (optional) 16.74/5.69 */ 16.74/5.69 boolean contains(Object o); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the number of elements in this deque. 16.74/5.69 * 16.74/5.69 * @return the number of elements in this deque 16.74/5.69 */ 16.74/5.69 public int size(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns an iterator over the elements in this deque in proper sequence. 16.74/5.69 * The elements will be returned in order from first (head) to last (tail). 16.74/5.69 * 16.74/5.69 * @return an iterator over the elements in this deque in proper sequence 16.74/5.69 */ 16.74/5.69 Iterator iterator(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns an iterator over the elements in this deque in reverse 16.74/5.69 * sequential order. The elements will be returned in order from 16.74/5.69 * last (tail) to first (head). 16.74/5.69 * 16.74/5.69 * @return an iterator over the elements in this deque in reverse 16.74/5.69 * sequence 16.74/5.69 */ 16.74/5.69 Iterator descendingIterator(); 16.74/5.69 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Thrown to indicate that a method has been passed an illegal or 16.74/5.69 * inappropriate argument. 16.74/5.69 * 16.74/5.69 * @author unascribed 16.74/5.69 * @see java.lang.Thread#setPriority(int) 16.74/5.69 * @since JDK1.0 16.74/5.69 */ 16.74/5.69 public 16.74/5.69 class IllegalArgumentException extends RuntimeException { 16.74/5.69 /** 16.74/5.69 * Constructs an IllegalArgumentException with no 16.74/5.69 * detail message. 16.74/5.69 */ 16.74/5.69 public IllegalArgumentException() { 16.74/5.69 super(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs an IllegalArgumentException with the 16.74/5.69 * specified detail message. 16.74/5.69 * 16.74/5.69 * @param s the detail message. 16.74/5.69 */ 16.74/5.69 public IllegalArgumentException(String s) { 16.74/5.69 super(s); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a new exception with the specified detail message and 16.74/5.69 * cause. 16.74/5.69 * 16.74/5.69 *

Note that the detail message associated with cause is 16.74/5.69 * not automatically incorporated in this exception's detail 16.74/5.69 * message. 16.74/5.69 * 16.74/5.69 * @param message the detail message (which is saved for later retrieval 16.74/5.69 * by the {@link Throwable#getMessage()} method). 16.74/5.69 * @param cause the cause (which is saved for later retrieval by the 16.74/5.69 * {@link Throwable#getCause()} method). (A null value 16.74/5.69 * is permitted, and indicates that the cause is nonexistent or 16.74/5.69 * unknown.) 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public IllegalArgumentException(String message, Throwable cause) { 16.74/5.69 super(message, cause); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a new exception with the specified cause and a detail 16.74/5.69 * message of (cause==null ? null : cause.toString()) (which 16.74/5.69 * typically contains the class and detail message of cause). 16.74/5.69 * This constructor is useful for exceptions that are little more than 16.74/5.69 * wrappers for other throwables (for example, {@link 16.74/5.69 * java.security.PrivilegedActionException}). 16.74/5.69 * 16.74/5.69 * @param cause the cause (which is saved for later retrieval by the 16.74/5.69 * {@link Throwable#getCause()} method). (A null value is 16.74/5.69 * permitted, and indicates that the cause is nonexistent or 16.74/5.69 * unknown.) 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public IllegalArgumentException(Throwable cause) { 16.74/5.69 super(cause); 16.74/5.69 } 16.74/5.69 16.74/5.69 private static final long serialVersionUID = -5365630128856068164L; 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1996-2003 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Signals that a method has been invoked at an illegal or 16.74/5.69 * inappropriate time. In other words, the Java environment or 16.74/5.69 * Java application is not in an appropriate state for the requested 16.74/5.69 * operation. 16.74/5.69 * 16.74/5.69 * @author Jonni Kanerva 16.74/5.69 * @since JDK1.1 16.74/5.69 */ 16.74/5.69 public 16.74/5.69 class IllegalStateException extends RuntimeException { 16.74/5.69 /** 16.74/5.69 * Constructs an IllegalStateException with no detail message. 16.74/5.69 * A detail message is a String that describes this particular exception. 16.74/5.69 */ 16.74/5.69 public IllegalStateException() { 16.74/5.69 super(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs an IllegalStateException with the specified detail 16.74/5.69 * message. A detail message is a String that describes this particular 16.74/5.69 * exception. 16.74/5.69 * 16.74/5.69 * @param s the String that contains a detailed message 16.74/5.69 */ 16.74/5.69 public IllegalStateException(String s) { 16.74/5.69 super(s); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a new exception with the specified detail message and 16.74/5.69 * cause. 16.74/5.69 * 16.74/5.69 *

Note that the detail message associated with cause is 16.74/5.69 * not automatically incorporated in this exception's detail 16.74/5.69 * message. 16.74/5.69 * 16.74/5.69 * @param message the detail message (which is saved for later retrieval 16.74/5.69 * by the {@link Throwable#getMessage()} method). 16.74/5.69 * @param cause the cause (which is saved for later retrieval by the 16.74/5.69 * {@link Throwable#getCause()} method). (A null value 16.74/5.69 * is permitted, and indicates that the cause is nonexistent or 16.74/5.69 * unknown.) 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public IllegalStateException(String message, Throwable cause) { 16.74/5.69 super(message, cause); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a new exception with the specified cause and a detail 16.74/5.69 * message of (cause==null ? null : cause.toString()) (which 16.74/5.69 * typically contains the class and detail message of cause). 16.74/5.69 * This constructor is useful for exceptions that are little more than 16.74/5.69 * wrappers for other throwables (for example, {@link 16.74/5.69 * java.security.PrivilegedActionException}). 16.74/5.69 * 16.74/5.69 * @param cause the cause (which is saved for later retrieval by the 16.74/5.69 * {@link Throwable#getCause()} method). (A null value is 16.74/5.69 * permitted, and indicates that the cause is nonexistent or 16.74/5.69 * unknown.) 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public IllegalStateException(Throwable cause) { 16.74/5.69 super(cause); 16.74/5.69 } 16.74/5.69 16.74/5.69 static final long serialVersionUID = -1848914673093119416L; 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * An iterator over a collection. {@code Iterator} takes the place of 16.74/5.69 * {@link Enumeration} in the Java Collections Framework. Iterators 16.74/5.69 * differ from enumerations in two ways: 16.74/5.69 * 16.74/5.69 *

16.74/5.69 * 16.74/5.69 *

This interface is a member of the 16.74/5.69 * 16.74/5.69 * Java Collections Framework. 16.74/5.69 * 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @see Collection 16.74/5.69 * @see ListIterator 16.74/5.69 * @see Iterable 16.74/5.69 * @since 1.2 16.74/5.69 */ 16.74/5.69 public interface Iterator { 16.74/5.69 /** 16.74/5.69 * Returns {@code true} if the iteration has more elements. 16.74/5.69 * (In other words, returns {@code true} if {@link #next} would 16.74/5.69 * return an element rather than throwing an exception.) 16.74/5.69 * 16.74/5.69 * @return {@code true} if the iteration has more elements 16.74/5.69 */ 16.74/5.69 boolean hasNext(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the next element in the iteration. 16.74/5.69 * 16.74/5.69 * @return the next element in the iteration 16.74/5.69 * @throws NoSuchElementException if the iteration has no more elements 16.74/5.69 */ 16.74/5.69 E next(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes from the underlying collection the last element returned 16.74/5.69 * by this iterator (optional operation). This method can be called 16.74/5.69 * only once per call to {@link #next}. The behavior of an iterator 16.74/5.69 * is unspecified if the underlying collection is modified while the 16.74/5.69 * iteration is in progress in any way other than by calling this 16.74/5.69 * method. 16.74/5.69 * 16.74/5.69 * @throws UnsupportedOperationException if the {@code remove} 16.74/5.69 * operation is not supported by this iterator 16.74/5.69 * 16.74/5.69 * @throws IllegalStateException if the {@code next} method has not 16.74/5.69 * yet been called, or the {@code remove} method has already 16.74/5.69 * been called after the last call to the {@code next} 16.74/5.69 * method 16.74/5.69 */ 16.74/5.69 void remove(); 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 public class juLinkedListCreatePollLast { 16.74/5.69 public static void main(String[] args) { 16.74/5.69 Random.args = args; 16.74/5.69 16.74/5.69 LinkedList l = createList(Random.random()); 16.74/5.69 l.pollLast(); 16.74/5.69 } 16.74/5.69 16.74/5.69 public static LinkedList createList(int n) { 16.74/5.69 LinkedList l = new LinkedList(); 16.74/5.69 while (n > 0) { 16.74/5.69 l.addLast(new Content(Random.random())); 16.74/5.69 n--; 16.74/5.69 } 16.74/5.69 return l; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 final class Content { 16.74/5.69 int val; 16.74/5.69 16.74/5.69 public Content(int v) { 16.74/5.69 this.val = v; 16.74/5.69 } 16.74/5.69 16.74/5.69 public int hashCode() { 16.74/5.69 return val^31; 16.74/5.69 } 16.74/5.69 16.74/5.69 public boolean equals(Object o) { 16.74/5.69 if (o instanceof Content) { 16.74/5.69 return this.val == ((Content) o).val; 16.74/5.69 } 16.74/5.69 return false; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Linked list implementation of the List interface. Implements all 16.74/5.69 * optional list operations, and permits all elements (including 16.74/5.69 * null). In addition to implementing the List interface, 16.74/5.69 * the LinkedList class provides uniformly named methods to 16.74/5.69 * get, remove and insert an element at the 16.74/5.69 * beginning and end of the list. These operations allow linked lists to be 16.74/5.69 * used as a stack, {@linkplain Queue queue}, or {@linkplain Deque 16.74/5.69 * double-ended queue}.

16.74/5.69 * 16.74/5.69 * The class implements the Deque interface, providing 16.74/5.69 * first-in-first-out queue operations for add, 16.74/5.69 * poll, along with other stack and deque operations.

16.74/5.69 * 16.74/5.69 * All of the operations perform as could be expected for a doubly-linked 16.74/5.69 * list. Operations that index into the list will traverse the list from 16.74/5.69 * the beginning or the end, whichever is closer to the specified index.

16.74/5.69 * 16.74/5.69 *

Note that this implementation is not synchronized. 16.74/5.69 * If multiple threads access a linked list concurrently, and at least 16.74/5.69 * one of the threads modifies the list structurally, it must be 16.74/5.69 * synchronized externally. (A structural modification is any operation 16.74/5.69 * that adds or deletes one or more elements; merely setting the value of 16.74/5.69 * an element is not a structural modification.) This is typically 16.74/5.69 * accomplished by synchronizing on some object that naturally 16.74/5.69 * encapsulates the list. 16.74/5.69 * 16.74/5.69 * If no such object exists, the list should be "wrapped" using the 16.74/5.69 * {@link Collections#synchronizedList Collections.synchronizedList} 16.74/5.69 * method. This is best done at creation time, to prevent accidental 16.74/5.69 * unsynchronized access to the list:

16.74/5.69	 *   List list = Collections.synchronizedList(new LinkedList(...));
16.74/5.69 * 16.74/5.69 *

The iterators returned by this class's iterator and 16.74/5.69 * listIterator methods are fail-fast: if the list is 16.74/5.69 * structurally modified at any time after the iterator is created, in 16.74/5.69 * any way except through the Iterator's own remove or 16.74/5.69 * add methods, the iterator will throw a {@link 16.74/5.69 * ConcurrentModificationException}. Thus, in the face of concurrent 16.74/5.69 * modification, the iterator fails quickly and cleanly, rather than 16.74/5.69 * risking arbitrary, non-deterministic behavior at an undetermined 16.74/5.69 * time in the future. 16.74/5.69 * 16.74/5.69 *

Note that the fail-fast behavior of an iterator cannot be guaranteed 16.74/5.69 * as it is, generally speaking, impossible to make any hard guarantees in the 16.74/5.69 * presence of unsynchronized concurrent modification. Fail-fast iterators 16.74/5.69 * throw ConcurrentModificationException on a best-effort basis. 16.74/5.69 * Therefore, it would be wrong to write a program that depended on this 16.74/5.69 * exception for its correctness: the fail-fast behavior of iterators 16.74/5.69 * should be used only to detect bugs. 16.74/5.69 * 16.74/5.69 *

This class is a member of the 16.74/5.69 * 16.74/5.69 * Java Collections Framework. 16.74/5.69 * 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @see List 16.74/5.69 * @see ArrayList 16.74/5.69 * @see Vector 16.74/5.69 * @since 1.2 16.74/5.69 * @param the type of elements held in this collection 16.74/5.69 */ 16.74/5.69 16.74/5.69 public class LinkedList 16.74/5.69 extends AbstractSequentialList 16.74/5.69 implements List, Deque 16.74/5.69 { 16.74/5.69 private transient Entry header = new Entry(null, null, null); 16.74/5.69 private transient int size = 0; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs an empty list. 16.74/5.69 */ 16.74/5.69 public LinkedList() { 16.74/5.69 header.next = header.previous = header; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Constructs a list containing the elements of the specified 16.74/5.69 * collection, in the order they are returned by the collection's 16.74/5.69 * iterator. 16.74/5.69 * 16.74/5.69 * @param c the collection whose elements are to be placed into this list 16.74/5.69 * @throws NullPointerException if the specified collection is null 16.74/5.69 */ 16.74/5.69 public LinkedList(Collection c) { 16.74/5.69 this(); 16.74/5.69 addAll(c); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the first element in this list. 16.74/5.69 * 16.74/5.69 * @return the first element in this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 */ 16.74/5.69 public E getFirst() { 16.74/5.69 if (size==0) 16.74/5.69 throw new NoSuchElementException(); 16.74/5.69 16.74/5.69 return header.next.element; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the last element in this list. 16.74/5.69 * 16.74/5.69 * @return the last element in this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 */ 16.74/5.69 public E getLast() { 16.74/5.69 if (size==0) 16.74/5.69 throw new NoSuchElementException(); 16.74/5.69 16.74/5.69 return header.previous.element; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes and returns the first element from this list. 16.74/5.69 * 16.74/5.69 * @return the first element from this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 */ 16.74/5.69 public E removeFirst() { 16.74/5.69 return remove(header.next); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes and returns the last element from this list. 16.74/5.69 * 16.74/5.69 * @return the last element from this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 */ 16.74/5.69 public E removeLast() { 16.74/5.69 return remove(header.previous); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the beginning of this list. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 */ 16.74/5.69 public void addFirst(E e) { 16.74/5.69 addBefore(e, header.next); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Appends the specified element to the end of this list. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #add}. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 */ 16.74/5.69 public void addLast(E e) { 16.74/5.69 addBefore(e, header); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns true if this list contains the specified element. 16.74/5.69 * More formally, returns true if and only if this list contains 16.74/5.69 * at least one element e such that 16.74/5.69 * (o==null ? e==null : o.equals(e)). 16.74/5.69 * 16.74/5.69 * @param o element whose presence in this list is to be tested 16.74/5.69 * @return true if this list contains the specified element 16.74/5.69 */ 16.74/5.69 public boolean contains(Object o) { 16.74/5.69 return indexOf(o) != -1; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the number of elements in this list. 16.74/5.69 * 16.74/5.69 * @return the number of elements in this list 16.74/5.69 */ 16.74/5.69 public int size() { 16.74/5.69 return size; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Appends the specified element to the end of this list. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #addLast}. 16.74/5.69 * 16.74/5.69 * @param e element to be appended to this list 16.74/5.69 * @return true (as specified by {@link Collection#add}) 16.74/5.69 */ 16.74/5.69 public boolean add(E e) { 16.74/5.69 addBefore(e, header); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the first occurrence of the specified element from this list, 16.74/5.69 * if it is present. If this list does not contain the element, it is 16.74/5.69 * unchanged. More formally, removes the element with the lowest index 16.74/5.69 * i such that 16.74/5.69 * (o==null ? get(i)==null : o.equals(get(i))) 16.74/5.69 * (if such an element exists). Returns true if this list 16.74/5.69 * contained the specified element (or equivalently, if this list 16.74/5.69 * changed as a result of the call). 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this list, if present 16.74/5.69 * @return true if this list contained the specified element 16.74/5.69 */ 16.74/5.69 public boolean remove(Object o) { 16.74/5.69 if (o==null) { 16.74/5.69 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.69 if (e.element==null) { 16.74/5.69 remove(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 } else { 16.74/5.69 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.69 if (o.equals(e.element)) { 16.74/5.69 remove(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 } 16.74/5.69 return false; 16.74/5.69 } 16.74/5.69 /** 16.74/5.69 * Removes all of the elements from this list. 16.74/5.69 */ 16.74/5.69 public void clear() { 16.74/5.69 Entry e = header.next; 16.74/5.69 while (e != header) { 16.74/5.69 Entry next = e.next; 16.74/5.69 e.next = e.previous = null; 16.74/5.69 e.element = null; 16.74/5.69 e = next; 16.74/5.69 } 16.74/5.69 header.next = header.previous = header; 16.74/5.69 size = 0; 16.74/5.69 modCount++; 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 // Positional Access Operations 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the element at the specified position in this list. 16.74/5.69 * 16.74/5.69 * @param index index of the element to return 16.74/5.69 * @return the element at the specified position in this list 16.74/5.69 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.69 */ 16.74/5.69 public E get(int index) { 16.74/5.69 return entry(index).element; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Replaces the element at the specified position in this list with the 16.74/5.69 * specified element. 16.74/5.69 * 16.74/5.69 * @param index index of the element to replace 16.74/5.69 * @param element element to be stored at the specified position 16.74/5.69 * @return the element previously at the specified position 16.74/5.69 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.69 */ 16.74/5.69 public E set(int index, E element) { 16.74/5.69 Entry e = entry(index); 16.74/5.69 E oldVal = e.element; 16.74/5.69 e.element = element; 16.74/5.69 return oldVal; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the specified position in this list. 16.74/5.69 * Shifts the element currently at that position (if any) and any 16.74/5.69 * subsequent elements to the right (adds one to their indices). 16.74/5.69 * 16.74/5.69 * @param index index at which the specified element is to be inserted 16.74/5.69 * @param element element to be inserted 16.74/5.69 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.69 */ 16.74/5.69 public void add(int index, E element) { 16.74/5.69 addBefore(element, (index==size ? header : entry(index))); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the element at the specified position in this list. Shifts any 16.74/5.69 * subsequent elements to the left (subtracts one from their indices). 16.74/5.69 * Returns the element that was removed from the list. 16.74/5.69 * 16.74/5.69 * @param index the index of the element to be removed 16.74/5.69 * @return the element previously at the specified position 16.74/5.69 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.69 */ 16.74/5.69 public E remove(int index) { 16.74/5.69 return remove(entry(index)); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the indexed entry. 16.74/5.69 */ 16.74/5.69 private Entry entry(int index) { 16.74/5.69 if (index < 0 || index >= size) 16.74/5.69 throw new IndexOutOfBoundsException(); 16.74/5.69 Entry e = header; 16.74/5.69 if (index < (size >> 1)) { 16.74/5.69 for (int i = 0; i <= index; i++) 16.74/5.69 e = e.next; 16.74/5.69 } else { 16.74/5.69 for (int i = size; i > index; i--) 16.74/5.69 e = e.previous; 16.74/5.69 } 16.74/5.69 return e; 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 // Search Operations 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the index of the first occurrence of the specified element 16.74/5.69 * in this list, or -1 if this list does not contain the element. 16.74/5.69 * More formally, returns the lowest index i such that 16.74/5.69 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.69 * or -1 if there is no such index. 16.74/5.69 * 16.74/5.69 * @param o element to search for 16.74/5.69 * @return the index of the first occurrence of the specified element in 16.74/5.69 * this list, or -1 if this list does not contain the element 16.74/5.69 */ 16.74/5.69 public int indexOf(Object o) { 16.74/5.69 int index = 0; 16.74/5.69 if (o==null) { 16.74/5.69 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.69 if (e.element==null) 16.74/5.69 return index; 16.74/5.69 index++; 16.74/5.69 } 16.74/5.69 } else { 16.74/5.69 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.69 if (o.equals(e.element)) 16.74/5.69 return index; 16.74/5.69 index++; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 return -1; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the index of the last occurrence of the specified element 16.74/5.69 * in this list, or -1 if this list does not contain the element. 16.74/5.69 * More formally, returns the highest index i such that 16.74/5.69 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.69 * or -1 if there is no such index. 16.74/5.69 * 16.74/5.69 * @param o element to search for 16.74/5.69 * @return the index of the last occurrence of the specified element in 16.74/5.69 * this list, or -1 if this list does not contain the element 16.74/5.69 */ 16.74/5.69 public int lastIndexOf(Object o) { 16.74/5.69 int index = size; 16.74/5.69 if (o==null) { 16.74/5.69 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.69 index--; 16.74/5.69 if (e.element==null) 16.74/5.69 return index; 16.74/5.69 } 16.74/5.69 } else { 16.74/5.69 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.69 index--; 16.74/5.69 if (o.equals(e.element)) 16.74/5.69 return index; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 return -1; 16.74/5.69 } 16.74/5.69 16.74/5.69 // Queue operations. 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the head (first element) of this list. 16.74/5.69 * @return the head of this list, or null if this list is empty 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public E peek() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return getFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the head (first element) of this list. 16.74/5.69 * @return the head of this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public E element() { 16.74/5.69 return getFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the head (first element) of this list 16.74/5.69 * @return the head of this list, or null if this list is empty 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public E poll() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return removeFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the head (first element) of this list. 16.74/5.69 * 16.74/5.69 * @return the head of this list 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public E remove() { 16.74/5.69 return removeFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Adds the specified element as the tail (last element) of this list. 16.74/5.69 * 16.74/5.69 * @param e the element to add 16.74/5.69 * @return true (as specified by {@link Queue#offer}) 16.74/5.69 * @since 1.5 16.74/5.69 */ 16.74/5.69 public boolean offer(E e) { 16.74/5.69 return add(e); 16.74/5.69 } 16.74/5.69 16.74/5.69 // Deque operations 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the front of this list. 16.74/5.69 * 16.74/5.69 * @param e the element to insert 16.74/5.69 * @return true (as specified by {@link Deque#offerFirst}) 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public boolean offerFirst(E e) { 16.74/5.69 addFirst(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element at the end of this list. 16.74/5.69 * 16.74/5.69 * @param e the element to insert 16.74/5.69 * @return true (as specified by {@link Deque#offerLast}) 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public boolean offerLast(E e) { 16.74/5.69 addLast(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the first element of this list, 16.74/5.69 * or returns null if this list is empty. 16.74/5.69 * 16.74/5.69 * @return the first element of this list, or null 16.74/5.69 * if this list is empty 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public E peekFirst() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return getFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves, but does not remove, the last element of this list, 16.74/5.69 * or returns null if this list is empty. 16.74/5.69 * 16.74/5.69 * @return the last element of this list, or null 16.74/5.69 * if this list is empty 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public E peekLast() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return getLast(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the first element of this list, 16.74/5.69 * or returns null if this list is empty. 16.74/5.69 * 16.74/5.69 * @return the first element of this list, or null if 16.74/5.69 * this list is empty 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public E pollFirst() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return removeFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Retrieves and removes the last element of this list, 16.74/5.69 * or returns null if this list is empty. 16.74/5.69 * 16.74/5.69 * @return the last element of this list, or null if 16.74/5.69 * this list is empty 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public E pollLast() { 16.74/5.69 if (size==0) 16.74/5.69 return null; 16.74/5.69 return removeLast(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Pushes an element onto the stack represented by this list. In other 16.74/5.69 * words, inserts the element at the front of this list. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #addFirst}. 16.74/5.69 * 16.74/5.69 * @param e the element to push 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public void push(E e) { 16.74/5.69 addFirst(e); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Pops an element from the stack represented by this list. In other 16.74/5.69 * words, removes and returns the first element of this list. 16.74/5.69 * 16.74/5.69 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.69 * 16.74/5.69 * @return the element at the front of this list (which is the top 16.74/5.69 * of the stack represented by this list) 16.74/5.69 * @throws NoSuchElementException if this list is empty 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public E pop() { 16.74/5.69 return removeFirst(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the first occurrence of the specified element in this 16.74/5.69 * list (when traversing the list from head to tail). If the list 16.74/5.69 * does not contain the element, it is unchanged. 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this list, if present 16.74/5.69 * @return true if the list contained the specified element 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public boolean removeFirstOccurrence(Object o) { 16.74/5.69 return remove(o); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes the last occurrence of the specified element in this 16.74/5.69 * list (when traversing the list from head to tail). If the list 16.74/5.69 * does not contain the element, it is unchanged. 16.74/5.69 * 16.74/5.69 * @param o element to be removed from this list, if present 16.74/5.69 * @return true if the list contained the specified element 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public boolean removeLastOccurrence(Object o) { 16.74/5.69 if (o==null) { 16.74/5.69 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.69 if (e.element==null) { 16.74/5.69 remove(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 } else { 16.74/5.69 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.69 if (o.equals(e.element)) { 16.74/5.69 remove(e); 16.74/5.69 return true; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 } 16.74/5.69 return false; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns a list-iterator of the elements in this list (in proper 16.74/5.69 * sequence), starting at the specified position in the list. 16.74/5.69 * Obeys the general contract of List.listIterator(int).

16.74/5.69 * 16.74/5.69 * The list-iterator is fail-fast: if the list is structurally 16.74/5.69 * modified at any time after the Iterator is created, in any way except 16.74/5.69 * through the list-iterator's own remove or add 16.74/5.69 * methods, the list-iterator will throw a 16.74/5.69 * ConcurrentModificationException. Thus, in the face of 16.74/5.69 * concurrent modification, the iterator fails quickly and cleanly, rather 16.74/5.69 * than risking arbitrary, non-deterministic behavior at an undetermined 16.74/5.69 * time in the future. 16.74/5.69 * 16.74/5.69 * @param index index of the first element to be returned from the 16.74/5.69 * list-iterator (by a call to next) 16.74/5.69 * @return a ListIterator of the elements in this list (in proper 16.74/5.69 * sequence), starting at the specified position in the list 16.74/5.69 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.69 * @see List#listIterator(int) 16.74/5.69 */ 16.74/5.69 public ListIterator listIterator(int index) { 16.74/5.69 return new ListItr(index); 16.74/5.69 } 16.74/5.69 16.74/5.69 private class ListItr implements ListIterator { 16.74/5.69 private Entry lastReturned = header; 16.74/5.69 private Entry next; 16.74/5.69 private int nextIndex; 16.74/5.69 private int expectedModCount = modCount; 16.74/5.69 16.74/5.69 ListItr(int index) { 16.74/5.69 if (index < 0 || index > size) 16.74/5.69 throw new IndexOutOfBoundsException(); 16.74/5.69 if (index < (size >> 1)) { 16.74/5.69 next = header.next; 16.74/5.69 for (nextIndex=0; nextIndexindex; nextIndex--) 16.74/5.69 next = next.previous; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 public boolean hasNext() { 16.74/5.69 return nextIndex != size; 16.74/5.69 } 16.74/5.69 16.74/5.69 public E next() { 16.74/5.69 checkForComodification(); 16.74/5.69 if (nextIndex == size) 16.74/5.69 throw new NoSuchElementException(); 16.74/5.69 16.74/5.69 lastReturned = next; 16.74/5.69 next = next.next; 16.74/5.69 nextIndex++; 16.74/5.69 return lastReturned.element; 16.74/5.69 } 16.74/5.69 16.74/5.69 public boolean hasPrevious() { 16.74/5.69 return nextIndex != 0; 16.74/5.69 } 16.74/5.69 16.74/5.69 public E previous() { 16.74/5.69 if (nextIndex == 0) 16.74/5.69 throw new NoSuchElementException(); 16.74/5.69 16.74/5.69 lastReturned = next = next.previous; 16.74/5.69 nextIndex--; 16.74/5.69 checkForComodification(); 16.74/5.69 return lastReturned.element; 16.74/5.69 } 16.74/5.69 16.74/5.69 public int nextIndex() { 16.74/5.69 return nextIndex; 16.74/5.69 } 16.74/5.69 16.74/5.69 public int previousIndex() { 16.74/5.69 return nextIndex-1; 16.74/5.69 } 16.74/5.69 16.74/5.69 public void remove() { 16.74/5.69 checkForComodification(); 16.74/5.69 Entry lastNext = lastReturned.next; 16.74/5.69 try { 16.74/5.69 LinkedList.this.remove(lastReturned); 16.74/5.69 } catch (NoSuchElementException e) { 16.74/5.69 throw new IllegalStateException(); 16.74/5.69 } 16.74/5.69 if (next==lastReturned) 16.74/5.69 next = lastNext; 16.74/5.69 else 16.74/5.69 nextIndex--; 16.74/5.69 lastReturned = header; 16.74/5.69 expectedModCount++; 16.74/5.69 } 16.74/5.69 16.74/5.69 public void set(E e) { 16.74/5.69 if (lastReturned == header) 16.74/5.69 throw new IllegalStateException(); 16.74/5.69 checkForComodification(); 16.74/5.69 lastReturned.element = e; 16.74/5.69 } 16.74/5.69 16.74/5.69 public void add(E e) { 16.74/5.69 checkForComodification(); 16.74/5.69 lastReturned = header; 16.74/5.69 addBefore(e, next); 16.74/5.69 nextIndex++; 16.74/5.69 expectedModCount++; 16.74/5.69 } 16.74/5.69 16.74/5.69 final void checkForComodification() { 16.74/5.69 if (modCount != expectedModCount) 16.74/5.69 throw new ConcurrentModificationException(); 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 private static class Entry { 16.74/5.69 E element; 16.74/5.69 Entry next; 16.74/5.69 Entry previous; 16.74/5.69 16.74/5.69 Entry(E element, Entry next, Entry previous) { 16.74/5.69 this.element = element; 16.74/5.69 this.next = next; 16.74/5.69 this.previous = previous; 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 private Entry addBefore(E e, Entry entry) { 16.74/5.69 Entry newEntry = new Entry(e, entry, entry.previous); 16.74/5.69 newEntry.previous.next = newEntry; 16.74/5.69 newEntry.next.previous = newEntry; 16.74/5.69 size++; 16.74/5.69 modCount++; 16.74/5.69 return newEntry; 16.74/5.69 } 16.74/5.69 16.74/5.69 private E remove(Entry e) { 16.74/5.69 if (e == header) 16.74/5.69 throw new NoSuchElementException(); 16.74/5.69 16.74/5.69 E result = e.element; 16.74/5.69 e.previous.next = e.next; 16.74/5.69 e.next.previous = e.previous; 16.74/5.69 e.next = e.previous = null; 16.74/5.69 e.element = null; 16.74/5.69 size--; 16.74/5.69 modCount++; 16.74/5.69 return result; 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * @since 1.6 16.74/5.69 */ 16.74/5.69 public Iterator descendingIterator() { 16.74/5.69 return new DescendingIterator(); 16.74/5.69 } 16.74/5.69 16.74/5.69 /** Adapter to provide descending iterators via ListItr.previous */ 16.74/5.69 private class DescendingIterator implements Iterator { 16.74/5.69 final ListItr itr = new ListItr(size()); 16.74/5.69 public boolean hasNext() { 16.74/5.69 return itr.hasPrevious(); 16.74/5.69 } 16.74/5.69 public E next() { 16.74/5.69 return itr.previous(); 16.74/5.69 } 16.74/5.69 public void remove() { 16.74/5.69 itr.remove(); 16.74/5.69 } 16.74/5.69 } 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns an array containing all of the elements in this list 16.74/5.69 * in proper sequence (from first to last element). 16.74/5.69 * 16.74/5.69 *

The returned array will be "safe" in that no references to it are 16.74/5.69 * maintained by this list. (In other words, this method must allocate 16.74/5.69 * a new array). The caller is thus free to modify the returned array. 16.74/5.69 * 16.74/5.69 *

This method acts as bridge between array-based and collection-based 16.74/5.69 * APIs. 16.74/5.69 * 16.74/5.69 * @return an array containing all of the elements in this list 16.74/5.69 * in proper sequence 16.74/5.69 */ 16.74/5.69 public Object[] toArray() { 16.74/5.69 Object[] result = new Object[size]; 16.74/5.69 int i = 0; 16.74/5.69 for (Entry e = header.next; e != header; e = e.next) 16.74/5.69 result[i++] = e.element; 16.74/5.69 return result; 16.74/5.69 } 16.74/5.69 16.74/5.69 private static final long serialVersionUID = 876323262645176354L; 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * An iterator for lists that allows the programmer 16.74/5.69 * to traverse the list in either direction, modify 16.74/5.69 * the list during iteration, and obtain the iterator's 16.74/5.69 * current position in the list. A {@code ListIterator} 16.74/5.69 * has no current element; its cursor position always 16.74/5.69 * lies between the element that would be returned by a call 16.74/5.69 * to {@code previous()} and the element that would be 16.74/5.69 * returned by a call to {@code next()}. 16.74/5.69 * An iterator for a list of length {@code n} has {@code n+1} possible 16.74/5.69 * cursor positions, as illustrated by the carets ({@code ^}) below: 16.74/5.69 *

16.74/5.69	 *                      Element(0)   Element(1)   Element(2)   ... Element(n-1)
16.74/5.69	 * cursor positions:  ^            ^            ^            ^                  ^
16.74/5.69	 * 
16.74/5.69 * Note that the {@link #remove} and {@link #set(Object)} methods are 16.74/5.69 * not defined in terms of the cursor position; they are defined to 16.74/5.69 * operate on the last element returned by a call to {@link #next} or 16.74/5.69 * {@link #previous()}. 16.74/5.69 * 16.74/5.69 *

This interface is a member of the 16.74/5.69 * 16.74/5.69 * Java Collections Framework. 16.74/5.69 * 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @see Collection 16.74/5.69 * @see List 16.74/5.69 * @see Iterator 16.74/5.69 * @see Enumeration 16.74/5.69 * @see List#listIterator() 16.74/5.69 * @since 1.2 16.74/5.69 */ 16.74/5.69 public interface ListIterator extends Iterator { 16.74/5.69 // Query Operations 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns {@code true} if this list iterator has more elements when 16.74/5.69 * traversing the list in the forward direction. (In other words, 16.74/5.69 * returns {@code true} if {@link #next} would return an element rather 16.74/5.69 * than throwing an exception.) 16.74/5.69 * 16.74/5.69 * @return {@code true} if the list iterator has more elements when 16.74/5.69 * traversing the list in the forward direction 16.74/5.69 */ 16.74/5.69 boolean hasNext(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the next element in the list and advances the cursor position. 16.74/5.69 * This method may be called repeatedly to iterate through the list, 16.74/5.69 * or intermixed with calls to {@link #previous} to go back and forth. 16.74/5.69 * (Note that alternating calls to {@code next} and {@code previous} 16.74/5.69 * will return the same element repeatedly.) 16.74/5.69 * 16.74/5.69 * @return the next element in the list 16.74/5.69 * @throws NoSuchElementException if the iteration has no next element 16.74/5.69 */ 16.74/5.69 E next(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns {@code true} if this list iterator has more elements when 16.74/5.69 * traversing the list in the reverse direction. (In other words, 16.74/5.69 * returns {@code true} if {@link #previous} would return an element 16.74/5.69 * rather than throwing an exception.) 16.74/5.69 * 16.74/5.69 * @return {@code true} if the list iterator has more elements when 16.74/5.69 * traversing the list in the reverse direction 16.74/5.69 */ 16.74/5.69 boolean hasPrevious(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the previous element in the list and moves the cursor 16.74/5.69 * position backwards. This method may be called repeatedly to 16.74/5.69 * iterate through the list backwards, or intermixed with calls to 16.74/5.69 * {@link #next} to go back and forth. (Note that alternating calls 16.74/5.69 * to {@code next} and {@code previous} will return the same 16.74/5.69 * element repeatedly.) 16.74/5.69 * 16.74/5.69 * @return the previous element in the list 16.74/5.69 * @throws NoSuchElementException if the iteration has no previous 16.74/5.69 * element 16.74/5.69 */ 16.74/5.69 E previous(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the index of the element that would be returned by a 16.74/5.69 * subsequent call to {@link #next}. (Returns list size if the list 16.74/5.69 * iterator is at the end of the list.) 16.74/5.69 * 16.74/5.69 * @return the index of the element that would be returned by a 16.74/5.69 * subsequent call to {@code next}, or list size if the list 16.74/5.69 * iterator is at the end of the list 16.74/5.69 */ 16.74/5.69 int nextIndex(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the index of the element that would be returned by a 16.74/5.69 * subsequent call to {@link #previous}. (Returns -1 if the list 16.74/5.69 * iterator is at the beginning of the list.) 16.74/5.69 * 16.74/5.69 * @return the index of the element that would be returned by a 16.74/5.69 * subsequent call to {@code previous}, or -1 if the list 16.74/5.69 * iterator is at the beginning of the list 16.74/5.69 */ 16.74/5.69 int previousIndex(); 16.74/5.69 16.74/5.69 16.74/5.69 // Modification Operations 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Removes from the list the last element that was returned by {@link 16.74/5.69 * #next} or {@link #previous} (optional operation). This call can 16.74/5.69 * only be made once per call to {@code next} or {@code previous}. 16.74/5.69 * It can be made only if {@link #add} has not been 16.74/5.69 * called after the last call to {@code next} or {@code previous}. 16.74/5.69 * 16.74/5.69 * @throws UnsupportedOperationException if the {@code remove} 16.74/5.69 * operation is not supported by this list iterator 16.74/5.69 * @throws IllegalStateException if neither {@code next} nor 16.74/5.69 * {@code previous} have been called, or {@code remove} or 16.74/5.69 * {@code add} have been called after the last call to 16.74/5.69 * {@code next} or {@code previous} 16.74/5.69 */ 16.74/5.69 void remove(); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Replaces the last element returned by {@link #next} or 16.74/5.69 * {@link #previous} with the specified element (optional operation). 16.74/5.69 * This call can be made only if neither {@link #remove} nor {@link 16.74/5.69 * #add} have been called after the last call to {@code next} or 16.74/5.69 * {@code previous}. 16.74/5.69 * 16.74/5.69 * @param e the element with which to replace the last element returned by 16.74/5.69 * {@code next} or {@code previous} 16.74/5.69 * @throws UnsupportedOperationException if the {@code set} operation 16.74/5.69 * is not supported by this list iterator 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this list 16.74/5.69 * @throws IllegalArgumentException if some aspect of the specified 16.74/5.69 * element prevents it from being added to this list 16.74/5.69 * @throws IllegalStateException if neither {@code next} nor 16.74/5.69 * {@code previous} have been called, or {@code remove} or 16.74/5.69 * {@code add} have been called after the last call to 16.74/5.69 * {@code next} or {@code previous} 16.74/5.69 */ 16.74/5.69 void set(E e); 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Inserts the specified element into the list (optional operation). 16.74/5.69 * The element is inserted immediately before the next element that 16.74/5.69 * would be returned by {@link #next}, if any, and after the next 16.74/5.69 * element that would be returned by {@link #previous}, if any. (If the 16.74/5.69 * list contains no elements, the new element becomes the sole element 16.74/5.69 * on the list.) The new element is inserted before the implicit 16.74/5.69 * cursor: a subsequent call to {@code next} would be unaffected, and a 16.74/5.69 * subsequent call to {@code previous} would return the new element. 16.74/5.69 * (This call increases by one the value that would be returned by a 16.74/5.69 * call to {@code nextIndex} or {@code previousIndex}.) 16.74/5.69 * 16.74/5.69 * @param e the element to insert 16.74/5.69 * @throws UnsupportedOperationException if the {@code add} method is 16.74/5.69 * not supported by this list iterator 16.74/5.69 * @throws ClassCastException if the class of the specified element 16.74/5.69 * prevents it from being added to this list 16.74/5.69 * @throws IllegalArgumentException if some aspect of this element 16.74/5.69 * prevents it from being added to this list 16.74/5.69 */ 16.74/5.69 void add(E e); 16.74/5.69 } 16.74/5.69 16.74/5.69 16.74/5.69 /* 16.74/5.69 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.69 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.69 * 16.74/5.69 * This code is free software; you can redistribute it and/or modify it 16.74/5.69 * under the terms of the GNU General Public License version 2 only, as 16.74/5.69 * published by the Free Software Foundation. Sun designates this 16.74/5.69 * particular file as subject to the "Classpath" exception as provided 16.74/5.69 * by Sun in the LICENSE file that accompanied this code. 16.74/5.69 * 16.74/5.69 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.69 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.69 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.69 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.69 * accompanied this code). 16.74/5.69 * 16.74/5.69 * You should have received a copy of the GNU General Public License version 16.74/5.69 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.69 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.69 * 16.74/5.69 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.69 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.69 * have any questions. 16.74/5.69 */ 16.74/5.69 16.74/5.69 package javaUtilEx; 16.74/5.69 16.74/5.69 /** 16.74/5.69 * An ordered collection (also known as a sequence). The user of this 16.74/5.69 * interface has precise control over where in the list each element is 16.74/5.69 * inserted. The user can access elements by their integer index (position in 16.74/5.69 * the list), and search for elements in the list.

16.74/5.69 * 16.74/5.69 * Unlike sets, lists typically allow duplicate elements. More formally, 16.74/5.69 * lists typically allow pairs of elements e1 and e2 16.74/5.69 * such that e1.equals(e2), and they typically allow multiple 16.74/5.69 * null elements if they allow null elements at all. It is not inconceivable 16.74/5.69 * that someone might wish to implement a list that prohibits duplicates, by 16.74/5.69 * throwing runtime exceptions when the user attempts to insert them, but we 16.74/5.69 * expect this usage to be rare.

16.74/5.69 * 16.74/5.69 * The List interface places additional stipulations, beyond those 16.74/5.69 * specified in the Collection interface, on the contracts of the 16.74/5.69 * iterator, add, remove, equals, and 16.74/5.69 * hashCode methods. Declarations for other inherited methods are 16.74/5.69 * also included here for convenience.

16.74/5.69 * 16.74/5.69 * The List interface provides four methods for positional (indexed) 16.74/5.69 * access to list elements. Lists (like Java arrays) are zero based. Note 16.74/5.69 * that these operations may execute in time proportional to the index value 16.74/5.69 * for some implementations (the LinkedList class, for 16.74/5.69 * example). Thus, iterating over the elements in a list is typically 16.74/5.69 * preferable to indexing through it if the caller does not know the 16.74/5.69 * implementation.

16.74/5.69 * 16.74/5.69 * The List interface provides a special iterator, called a 16.74/5.69 * ListIterator, that allows element insertion and replacement, and 16.74/5.69 * bidirectional access in addition to the normal operations that the 16.74/5.69 * Iterator interface provides. A method is provided to obtain a 16.74/5.69 * list iterator that starts at a specified position in the list.

16.74/5.69 * 16.74/5.69 * The List interface provides two methods to search for a specified 16.74/5.69 * object. From a performance standpoint, these methods should be used with 16.74/5.69 * caution. In many implementations they will perform costly linear 16.74/5.69 * searches.

16.74/5.69 * 16.74/5.69 * The List interface provides two methods to efficiently insert and 16.74/5.69 * remove multiple elements at an arbitrary point in the list.

16.74/5.69 * 16.74/5.69 * Note: While it is permissible for lists to contain themselves as elements, 16.74/5.69 * extreme caution is advised: the equals and hashCode 16.74/5.69 * methods are no longer well defined on such a list. 16.74/5.69 * 16.74/5.69 *

Some list implementations have restrictions on the elements that 16.74/5.69 * they may contain. For example, some implementations prohibit null elements, 16.74/5.69 * and some have restrictions on the types of their elements. Attempting to 16.74/5.69 * add an ineligible element throws an unchecked exception, typically 16.74/5.69 * NullPointerException or ClassCastException. Attempting 16.74/5.69 * to query the presence of an ineligible element may throw an exception, 16.74/5.69 * or it may simply return false; some implementations will exhibit the former 16.74/5.69 * behavior and some will exhibit the latter. More generally, attempting an 16.74/5.69 * operation on an ineligible element whose completion would not result in 16.74/5.69 * the insertion of an ineligible element into the list may throw an 16.74/5.69 * exception or it may succeed, at the option of the implementation. 16.74/5.69 * Such exceptions are marked as "optional" in the specification for this 16.74/5.69 * interface. 16.74/5.69 * 16.74/5.69 *

This interface is a member of the 16.74/5.69 * 16.74/5.69 * Java Collections Framework. 16.74/5.69 * 16.74/5.69 * @author Josh Bloch 16.74/5.69 * @author Neal Gafter 16.74/5.69 * @see Collection 16.74/5.69 * @see Set 16.74/5.69 * @see ArrayList 16.74/5.69 * @see LinkedList 16.74/5.69 * @see Vector 16.74/5.69 * @see Arrays#asList(Object[]) 16.74/5.69 * @see Collections#nCopies(int, Object) 16.74/5.69 * @see Collections#EMPTY_LIST 16.74/5.69 * @see AbstractList 16.74/5.69 * @see AbstractSequentialList 16.74/5.69 * @since 1.2 16.74/5.69 */ 16.74/5.69 16.74/5.69 public interface List extends Collection { 16.74/5.69 // Query Operations 16.74/5.69 16.74/5.69 /** 16.74/5.69 * Returns the number of elements in this list. If this list contains 16.74/5.69 * more than Integer.MAX_VALUE elements, returns 16.74/5.69 * Integer.MAX_VALUE. 16.74/5.69 * 16.74/5.69 * @return the number of elements in this list 16.74/5.69 */ 16.74/5.69 int size(); 16.74/5.69 16.74/5.69 /** 16.74/5.70 * Returns true if this list contains no elements. 16.74/5.70 * 16.74/5.70 * @return true if this list contains no elements 16.74/5.70 */ 16.74/5.70 boolean isEmpty(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns true if this list contains the specified element. 16.74/5.70 * More formally, returns true if and only if this list contains 16.74/5.70 * at least one element e such that 16.74/5.70 * (o==null ? e==null : o.equals(e)). 16.74/5.70 * 16.74/5.70 * @param o element whose presence in this list is to be tested 16.74/5.70 * @return true if this list contains the specified element 16.74/5.70 * @throws ClassCastException if the type of the specified element 16.74/5.70 * is incompatible with this list (optional) 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements (optional) 16.74/5.70 */ 16.74/5.70 boolean contains(Object o); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns an iterator over the elements in this list in proper sequence. 16.74/5.70 * 16.74/5.70 * @return an iterator over the elements in this list in proper sequence 16.74/5.70 */ 16.74/5.70 Iterator iterator(); 16.74/5.70 16.74/5.70 // Modification Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Appends the specified element to the end of this list (optional 16.74/5.70 * operation). 16.74/5.70 * 16.74/5.70 *

Lists that support this operation may place limitations on what 16.74/5.70 * elements may be added to this list. In particular, some 16.74/5.70 * lists will refuse to add null elements, and others will impose 16.74/5.70 * restrictions on the type of elements that may be added. List 16.74/5.70 * classes should clearly specify in their documentation any restrictions 16.74/5.70 * on what elements may be added. 16.74/5.70 * 16.74/5.70 * @param e element to be appended to this list 16.74/5.70 * @return true (as specified by {@link Collection#add}) 16.74/5.70 * @throws UnsupportedOperationException if the add operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of this element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 */ 16.74/5.70 boolean add(E e); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes the first occurrence of the specified element from this list, 16.74/5.70 * if it is present (optional operation). If this list does not contain 16.74/5.70 * the element, it is unchanged. More formally, removes the element with 16.74/5.70 * the lowest index i such that 16.74/5.70 * (o==null ? get(i)==null : o.equals(get(i))) 16.74/5.70 * (if such an element exists). Returns true if this list 16.74/5.70 * contained the specified element (or equivalently, if this list changed 16.74/5.70 * as a result of the call). 16.74/5.70 * 16.74/5.70 * @param o element to be removed from this list, if present 16.74/5.70 * @return true if this list contained the specified element 16.74/5.70 * @throws ClassCastException if the type of the specified element 16.74/5.70 * is incompatible with this list (optional) 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements (optional) 16.74/5.70 * @throws UnsupportedOperationException if the remove operation 16.74/5.70 * is not supported by this list 16.74/5.70 */ 16.74/5.70 boolean remove(Object o); 16.74/5.70 16.74/5.70 16.74/5.70 // Bulk Modification Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns true if this list contains all of the elements of the 16.74/5.70 * specified collection. 16.74/5.70 * 16.74/5.70 * @param c collection to be checked for containment in this list 16.74/5.70 * @return true if this list contains all of the elements of the 16.74/5.70 * specified collection 16.74/5.70 * @throws ClassCastException if the types of one or more elements 16.74/5.70 * in the specified collection are incompatible with this 16.74/5.70 * list (optional) 16.74/5.70 * @throws NullPointerException if the specified collection contains one 16.74/5.70 * or more null elements and this list does not permit null 16.74/5.70 * elements (optional), or if the specified collection is null 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 boolean containsAll(Collection c); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Appends all of the elements in the specified collection to the end of 16.74/5.70 * this list, in the order that they are returned by the specified 16.74/5.70 * collection's iterator (optional operation). The behavior of this 16.74/5.70 * operation is undefined if the specified collection is modified while 16.74/5.70 * the operation is in progress. (Note that this will occur if the 16.74/5.70 * specified collection is this list, and it's nonempty.) 16.74/5.70 * 16.74/5.70 * @param c collection containing elements to be added to this list 16.74/5.70 * @return true if this list changed as a result of the call 16.74/5.70 * @throws UnsupportedOperationException if the addAll operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of an element of the specified 16.74/5.70 * collection prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified collection contains one 16.74/5.70 * or more null elements and this list does not permit null 16.74/5.70 * elements, or if the specified collection is null 16.74/5.70 * @throws IllegalArgumentException if some property of an element of the 16.74/5.70 * specified collection prevents it from being added to this list 16.74/5.70 * @see #add(Object) 16.74/5.70 */ 16.74/5.70 boolean addAll(Collection c); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Inserts all of the elements in the specified collection into this 16.74/5.70 * list at the specified position (optional operation). Shifts the 16.74/5.70 * element currently at that position (if any) and any subsequent 16.74/5.70 * elements to the right (increases their indices). The new elements 16.74/5.70 * will appear in this list in the order that they are returned by the 16.74/5.70 * specified collection's iterator. The behavior of this operation is 16.74/5.70 * undefined if the specified collection is modified while the 16.74/5.70 * operation is in progress. (Note that this will occur if the specified 16.74/5.70 * collection is this list, and it's nonempty.) 16.74/5.70 * 16.74/5.70 * @param index index at which to insert the first element from the 16.74/5.70 * specified collection 16.74/5.70 * @param c collection containing elements to be added to this list 16.74/5.70 * @return true if this list changed as a result of the call 16.74/5.70 * @throws UnsupportedOperationException if the addAll operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of an element of the specified 16.74/5.70 * collection prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified collection contains one 16.74/5.70 * or more null elements and this list does not permit null 16.74/5.70 * elements, or if the specified collection is null 16.74/5.70 * @throws IllegalArgumentException if some property of an element of the 16.74/5.70 * specified collection prevents it from being added to this list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * (index < 0 || index > size()) 16.74/5.70 */ 16.74/5.70 boolean addAll(int index, Collection c); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes from this list all of its elements that are contained in the 16.74/5.70 * specified collection (optional operation). 16.74/5.70 * 16.74/5.70 * @param c collection containing elements to be removed from this list 16.74/5.70 * @return true if this list changed as a result of the call 16.74/5.70 * @throws UnsupportedOperationException if the removeAll operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of an element of this list 16.74/5.70 * is incompatible with the specified collection (optional) 16.74/5.70 * @throws NullPointerException if this list contains a null element and the 16.74/5.70 * specified collection does not permit null elements (optional), 16.74/5.70 * or if the specified collection is null 16.74/5.70 * @see #remove(Object) 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 boolean removeAll(Collection c); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Retains only the elements in this list that are contained in the 16.74/5.70 * specified collection (optional operation). In other words, removes 16.74/5.70 * from this list all of its elements that are not contained in the 16.74/5.70 * specified collection. 16.74/5.70 * 16.74/5.70 * @param c collection containing elements to be retained in this list 16.74/5.70 * @return true if this list changed as a result of the call 16.74/5.70 * @throws UnsupportedOperationException if the retainAll operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of an element of this list 16.74/5.70 * is incompatible with the specified collection (optional) 16.74/5.70 * @throws NullPointerException if this list contains a null element and the 16.74/5.70 * specified collection does not permit null elements (optional), 16.74/5.70 * or if the specified collection is null 16.74/5.70 * @see #remove(Object) 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 boolean retainAll(Collection c); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes all of the elements from this list (optional operation). 16.74/5.70 * The list will be empty after this call returns. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException if the clear operation 16.74/5.70 * is not supported by this list 16.74/5.70 */ 16.74/5.70 void clear(); 16.74/5.70 16.74/5.70 16.74/5.70 // Comparison and hashing 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Compares the specified object with this list for equality. Returns 16.74/5.70 * true if and only if the specified object is also a list, both 16.74/5.70 * lists have the same size, and all corresponding pairs of elements in 16.74/5.70 * the two lists are equal. (Two elements e1 and 16.74/5.70 * e2 are equal if (e1==null ? e2==null : 16.74/5.70 * e1.equals(e2)).) In other words, two lists are defined to be 16.74/5.70 * equal if they contain the same elements in the same order. This 16.74/5.70 * definition ensures that the equals method works properly across 16.74/5.70 * different implementations of the List interface. 16.74/5.70 * 16.74/5.70 * @param o the object to be compared for equality with this list 16.74/5.70 * @return true if the specified object is equal to this list 16.74/5.70 */ 16.74/5.70 boolean equals(Object o); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns the hash code value for this list. The hash code of a list 16.74/5.70 * is defined to be the result of the following calculation: 16.74/5.70 *

16.74/5.70	     *  int hashCode = 1;
16.74/5.70	     *  for (E e : list)
16.74/5.70	     *      hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());
16.74/5.70	     * 
16.74/5.70 * This ensures that list1.equals(list2) implies that 16.74/5.70 * list1.hashCode()==list2.hashCode() for any two lists, 16.74/5.70 * list1 and list2, as required by the general 16.74/5.70 * contract of {@link Object#hashCode}. 16.74/5.70 * 16.74/5.70 * @return the hash code value for this list 16.74/5.70 * @see Object#equals(Object) 16.74/5.70 * @see #equals(Object) 16.74/5.70 */ 16.74/5.70 int hashCode(); 16.74/5.70 16.74/5.70 16.74/5.70 // Positional Access Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns the element at the specified position in this list. 16.74/5.70 * 16.74/5.70 * @param index index of the element to return 16.74/5.70 * @return the element at the specified position in this list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * (index < 0 || index >= size()) 16.74/5.70 */ 16.74/5.70 E get(int index); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Replaces the element at the specified position in this list with the 16.74/5.70 * specified element (optional operation). 16.74/5.70 * 16.74/5.70 * @param index index of the element to replace 16.74/5.70 * @param element element to be stored at the specified position 16.74/5.70 * @return the element previously at the specified position 16.74/5.70 * @throws UnsupportedOperationException if the set operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified element is null and 16.74/5.70 * this list does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of the specified 16.74/5.70 * element prevents it from being added to this list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * (index < 0 || index >= size()) 16.74/5.70 */ 16.74/5.70 E set(int index, E element); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Inserts the specified element at the specified position in this list 16.74/5.70 * (optional operation). Shifts the element currently at that position 16.74/5.70 * (if any) and any subsequent elements to the right (adds one to their 16.74/5.70 * indices). 16.74/5.70 * 16.74/5.70 * @param index index at which the specified element is to be inserted 16.74/5.70 * @param element element to be inserted 16.74/5.70 * @throws UnsupportedOperationException if the add operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified element is null and 16.74/5.70 * this list does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of the specified 16.74/5.70 * element prevents it from being added to this list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * (index < 0 || index > size()) 16.74/5.70 */ 16.74/5.70 void add(int index, E element); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes the element at the specified position in this list (optional 16.74/5.70 * operation). Shifts any subsequent elements to the left (subtracts one 16.74/5.70 * from their indices). Returns the element that was removed from the 16.74/5.70 * list. 16.74/5.70 * 16.74/5.70 * @param index the index of the element to be removed 16.74/5.70 * @return the element previously at the specified position 16.74/5.70 * @throws UnsupportedOperationException if the remove operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * (index < 0 || index >= size()) 16.74/5.70 */ 16.74/5.70 E remove(int index); 16.74/5.70 16.74/5.70 16.74/5.70 // Search Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns the index of the first occurrence of the specified element 16.74/5.70 * in this list, or -1 if this list does not contain the element. 16.74/5.70 * More formally, returns the lowest index i such that 16.74/5.70 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.70 * or -1 if there is no such index. 16.74/5.70 * 16.74/5.70 * @param o element to search for 16.74/5.70 * @return the index of the first occurrence of the specified element in 16.74/5.70 * this list, or -1 if this list does not contain the element 16.74/5.70 * @throws ClassCastException if the type of the specified element 16.74/5.70 * is incompatible with this list (optional) 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements (optional) 16.74/5.70 */ 16.74/5.70 int indexOf(Object o); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns the index of the last occurrence of the specified element 16.74/5.70 * in this list, or -1 if this list does not contain the element. 16.74/5.70 * More formally, returns the highest index i such that 16.74/5.70 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.70 * or -1 if there is no such index. 16.74/5.70 * 16.74/5.70 * @param o element to search for 16.74/5.70 * @return the index of the last occurrence of the specified element in 16.74/5.70 * this list, or -1 if this list does not contain the element 16.74/5.70 * @throws ClassCastException if the type of the specified element 16.74/5.70 * is incompatible with this list (optional) 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements (optional) 16.74/5.70 */ 16.74/5.70 int lastIndexOf(Object o); 16.74/5.70 16.74/5.70 16.74/5.70 // List Iterators 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns a list iterator over the elements in this list (in proper 16.74/5.70 * sequence). 16.74/5.70 * 16.74/5.70 * @return a list iterator over the elements in this list (in proper 16.74/5.70 * sequence) 16.74/5.70 */ 16.74/5.70 ListIterator listIterator(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns a list iterator over the elements in this list (in proper 16.74/5.70 * sequence), starting at the specified position in the list. 16.74/5.70 * The specified index indicates the first element that would be 16.74/5.70 * returned by an initial call to {@link ListIterator#next next}. 16.74/5.70 * An initial call to {@link ListIterator#previous previous} would 16.74/5.70 * return the element with the specified index minus one. 16.74/5.70 * 16.74/5.70 * @param index index of the first element to be returned from the 16.74/5.70 * list iterator (by a call to {@link ListIterator#next next}) 16.74/5.70 * @return a list iterator over the elements in this list (in proper 16.74/5.70 * sequence), starting at the specified position in the list 16.74/5.70 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.70 * ({@code index < 0 || index > size()}) 16.74/5.70 */ 16.74/5.70 ListIterator listIterator(int index); 16.74/5.70 16.74/5.70 // View 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns a view of the portion of this list between the specified 16.74/5.70 * fromIndex, inclusive, and toIndex, exclusive. (If 16.74/5.70 * fromIndex and toIndex are equal, the returned list is 16.74/5.70 * empty.) The returned list is backed by this list, so non-structural 16.74/5.70 * changes in the returned list are reflected in this list, and vice-versa. 16.74/5.70 * The returned list supports all of the optional list operations supported 16.74/5.70 * by this list.

16.74/5.70 * 16.74/5.70 * This method eliminates the need for explicit range operations (of 16.74/5.70 * the sort that commonly exist for arrays). Any operation that expects 16.74/5.70 * a list can be used as a range operation by passing a subList view 16.74/5.70 * instead of a whole list. For example, the following idiom 16.74/5.70 * removes a range of elements from a list: 16.74/5.70 *

16.74/5.70	     *      list.subList(from, to).clear();
16.74/5.70	     * 
16.74/5.70 * Similar idioms may be constructed for indexOf and 16.74/5.70 * lastIndexOf, and all of the algorithms in the 16.74/5.70 * Collections class can be applied to a subList.

16.74/5.70 * 16.74/5.70 * The semantics of the list returned by this method become undefined if 16.74/5.70 * the backing list (i.e., this list) is structurally modified in 16.74/5.70 * any way other than via the returned list. (Structural modifications are 16.74/5.70 * those that change the size of this list, or otherwise perturb it in such 16.74/5.70 * a fashion that iterations in progress may yield incorrect results.) 16.74/5.70 * 16.74/5.70 * @param fromIndex low endpoint (inclusive) of the subList 16.74/5.70 * @param toIndex high endpoint (exclusive) of the subList 16.74/5.70 * @return a view of the specified range within this list 16.74/5.70 * @throws IndexOutOfBoundsException for an illegal endpoint index value 16.74/5.70 * (fromIndex < 0 || toIndex > size || 16.74/5.70 * fromIndex > toIndex) 16.74/5.70 */ 16.74/5.70 List subList(int fromIndex, int toIndex); 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Thrown by the nextElement method of an 16.74/5.70 * Enumeration to indicate that there are no more 16.74/5.70 * elements in the enumeration. 16.74/5.70 * 16.74/5.70 * @author unascribed 16.74/5.70 * @see java.util.Enumeration 16.74/5.70 * @see java.util.Enumeration#nextElement() 16.74/5.70 * @since JDK1.0 16.74/5.70 */ 16.74/5.70 public 16.74/5.70 class NoSuchElementException extends RuntimeException { 16.74/5.70 /** 16.74/5.70 * Constructs a NoSuchElementException with null 16.74/5.70 * as its error message string. 16.74/5.70 */ 16.74/5.70 public NoSuchElementException() { 16.74/5.70 super(); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Constructs a NoSuchElementException, saving a reference 16.74/5.70 * to the error message string s for later retrieval by the 16.74/5.70 * getMessage method. 16.74/5.70 * 16.74/5.70 * @param s the detail message. 16.74/5.70 */ 16.74/5.70 public NoSuchElementException(String s) { 16.74/5.70 super(s); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 /* 16.74/5.70 * This file is available under and governed by the GNU General Public 16.74/5.70 * License version 2 only, as published by the Free Software Foundation. 16.74/5.70 * However, the following notice accompanied the original version of this 16.74/5.70 * file: 16.74/5.70 * 16.74/5.70 * Written by Doug Lea with assistance from members of JCP JSR-166 16.74/5.70 * Expert Group and released to the public domain, as explained at 16.74/5.70 * http://creativecommons.org/licenses/publicdomain 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * A collection designed for holding elements prior to processing. 16.74/5.70 * Besides basic {@link java.util.Collection Collection} operations, 16.74/5.70 * queues provide additional insertion, extraction, and inspection 16.74/5.70 * operations. Each of these methods exists in two forms: one throws 16.74/5.70 * an exception if the operation fails, the other returns a special 16.74/5.70 * value (either null or false, depending on the 16.74/5.70 * operation). The latter form of the insert operation is designed 16.74/5.70 * specifically for use with capacity-restricted Queue 16.74/5.70 * implementations; in most implementations, insert operations cannot 16.74/5.70 * fail. 16.74/5.70 * 16.74/5.70 *

16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 * 16.74/5.70 *
Throws exceptionReturns special value
Insert{@link #add add(e)}{@link #offer offer(e)}
Remove{@link #remove remove()}{@link #poll poll()}
Examine{@link #element element()}{@link #peek peek()}
16.74/5.70 * 16.74/5.70 *

Queues typically, but do not necessarily, order elements in a 16.74/5.70 * FIFO (first-in-first-out) manner. Among the exceptions are 16.74/5.70 * priority queues, which order elements according to a supplied 16.74/5.70 * comparator, or the elements' natural ordering, and LIFO queues (or 16.74/5.70 * stacks) which order the elements LIFO (last-in-first-out). 16.74/5.70 * Whatever the ordering used, the head of the queue is that 16.74/5.70 * element which would be removed by a call to {@link #remove() } or 16.74/5.70 * {@link #poll()}. In a FIFO queue, all new elements are inserted at 16.74/5.70 * the tail of the queue. Other kinds of queues may use 16.74/5.70 * different placement rules. Every Queue implementation 16.74/5.70 * must specify its ordering properties. 16.74/5.70 * 16.74/5.70 *

The {@link #offer offer} method inserts an element if possible, 16.74/5.70 * otherwise returning false. This differs from the {@link 16.74/5.70 * java.util.Collection#add Collection.add} method, which can fail to 16.74/5.70 * add an element only by throwing an unchecked exception. The 16.74/5.70 * offer method is designed for use when failure is a normal, 16.74/5.70 * rather than exceptional occurrence, for example, in fixed-capacity 16.74/5.70 * (or "bounded") queues. 16.74/5.70 * 16.74/5.70 *

The {@link #remove()} and {@link #poll()} methods remove and 16.74/5.70 * return the head of the queue. 16.74/5.70 * Exactly which element is removed from the queue is a 16.74/5.70 * function of the queue's ordering policy, which differs from 16.74/5.70 * implementation to implementation. The remove() and 16.74/5.70 * poll() methods differ only in their behavior when the 16.74/5.70 * queue is empty: the remove() method throws an exception, 16.74/5.70 * while the poll() method returns null. 16.74/5.70 * 16.74/5.70 *

The {@link #element()} and {@link #peek()} methods return, but do 16.74/5.70 * not remove, the head of the queue. 16.74/5.70 * 16.74/5.70 *

The Queue interface does not define the blocking queue 16.74/5.70 * methods, which are common in concurrent programming. These methods, 16.74/5.70 * which wait for elements to appear or for space to become available, are 16.74/5.70 * defined in the {@link java.util.concurrent.BlockingQueue} interface, which 16.74/5.70 * extends this interface. 16.74/5.70 * 16.74/5.70 *

Queue implementations generally do not allow insertion 16.74/5.70 * of null elements, although some implementations, such as 16.74/5.70 * {@link LinkedList}, do not prohibit insertion of null. 16.74/5.70 * Even in the implementations that permit it, null should 16.74/5.70 * not be inserted into a Queue, as null is also 16.74/5.70 * used as a special return value by the poll method to 16.74/5.70 * indicate that the queue contains no elements. 16.74/5.70 * 16.74/5.70 *

Queue implementations generally do not define 16.74/5.70 * element-based versions of methods equals and 16.74/5.70 * hashCode but instead inherit the identity based versions 16.74/5.70 * from class Object, because element-based equality is not 16.74/5.70 * always well-defined for queues with the same elements but different 16.74/5.70 * ordering properties. 16.74/5.70 * 16.74/5.70 * 16.74/5.70 *

This interface is a member of the 16.74/5.70 * 16.74/5.70 * Java Collections Framework. 16.74/5.70 * 16.74/5.70 * @see java.util.Collection 16.74/5.70 * @see LinkedList 16.74/5.70 * @see PriorityQueue 16.74/5.70 * @see java.util.concurrent.LinkedBlockingQueue 16.74/5.70 * @see java.util.concurrent.BlockingQueue 16.74/5.70 * @see java.util.concurrent.ArrayBlockingQueue 16.74/5.70 * @see java.util.concurrent.LinkedBlockingQueue 16.74/5.70 * @see java.util.concurrent.PriorityBlockingQueue 16.74/5.70 * @since 1.5 16.74/5.70 * @author Doug Lea 16.74/5.70 * @param the type of elements held in this collection 16.74/5.70 */ 16.74/5.70 public interface Queue extends Collection { 16.74/5.70 /** 16.74/5.70 * Inserts the specified element into this queue if it is possible to do so 16.74/5.70 * immediately without violating capacity restrictions, returning 16.74/5.70 * true upon success and throwing an IllegalStateException 16.74/5.70 * if no space is currently available. 16.74/5.70 * 16.74/5.70 * @param e the element to add 16.74/5.70 * @return true (as specified by {@link Collection#add}) 16.74/5.70 * @throws IllegalStateException if the element cannot be added at this 16.74/5.70 * time due to capacity restrictions 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this queue 16.74/5.70 * @throws NullPointerException if the specified element is null and 16.74/5.70 * this queue does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of this element 16.74/5.70 * prevents it from being added to this queue 16.74/5.70 */ 16.74/5.70 boolean add(E e); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Inserts the specified element into this queue if it is possible to do 16.74/5.70 * so immediately without violating capacity restrictions. 16.74/5.70 * When using a capacity-restricted queue, this method is generally 16.74/5.70 * preferable to {@link #add}, which can fail to insert an element only 16.74/5.70 * by throwing an exception. 16.74/5.70 * 16.74/5.70 * @param e the element to add 16.74/5.70 * @return true if the element was added to this queue, else 16.74/5.70 * false 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this queue 16.74/5.70 * @throws NullPointerException if the specified element is null and 16.74/5.70 * this queue does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of this element 16.74/5.70 * prevents it from being added to this queue 16.74/5.70 */ 16.74/5.70 boolean offer(E e); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Retrieves and removes the head of this queue. This method differs 16.74/5.70 * from {@link #poll poll} only in that it throws an exception if this 16.74/5.70 * queue is empty. 16.74/5.70 * 16.74/5.70 * @return the head of this queue 16.74/5.70 * @throws NoSuchElementException if this queue is empty 16.74/5.70 */ 16.74/5.70 E remove(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Retrieves and removes the head of this queue, 16.74/5.70 * or returns null if this queue is empty. 16.74/5.70 * 16.74/5.70 * @return the head of this queue, or null if this queue is empty 16.74/5.70 */ 16.74/5.70 E poll(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Retrieves, but does not remove, the head of this queue. This method 16.74/5.70 * differs from {@link #peek peek} only in that it throws an exception 16.74/5.70 * if this queue is empty. 16.74/5.70 * 16.74/5.70 * @return the head of this queue 16.74/5.70 * @throws NoSuchElementException if this queue is empty 16.74/5.70 */ 16.74/5.70 E element(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Retrieves, but does not remove, the head of this queue, 16.74/5.70 * or returns null if this queue is empty. 16.74/5.70 * 16.74/5.70 * @return the head of this queue, or null if this queue is empty 16.74/5.70 */ 16.74/5.70 E peek(); 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * Copyright 2000-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Marker interface used by List implementations to indicate that 16.74/5.70 * they support fast (generally constant time) random access. The primary 16.74/5.70 * purpose of this interface is to allow generic algorithms to alter their 16.74/5.70 * behavior to provide good performance when applied to either random or 16.74/5.70 * sequential access lists. 16.74/5.70 * 16.74/5.70 *

The best algorithms for manipulating random access lists (such as 16.74/5.70 * ArrayList) can produce quadratic behavior when applied to 16.74/5.70 * sequential access lists (such as LinkedList). Generic list 16.74/5.70 * algorithms are encouraged to check whether the given list is an 16.74/5.70 * instanceof this interface before applying an algorithm that would 16.74/5.70 * provide poor performance if it were applied to a sequential access list, 16.74/5.70 * and to alter their behavior if necessary to guarantee acceptable 16.74/5.70 * performance. 16.74/5.70 * 16.74/5.70 *

It is recognized that the distinction between random and sequential 16.74/5.70 * access is often fuzzy. For example, some List implementations 16.74/5.70 * provide asymptotically linear access times if they get huge, but constant 16.74/5.70 * access times in practice. Such a List implementation 16.74/5.70 * should generally implement this interface. As a rule of thumb, a 16.74/5.70 * List implementation should implement this interface if, 16.74/5.70 * for typical instances of the class, this loop: 16.74/5.70 *

16.74/5.70	 *     for (int i=0, n=list.size(); i < n; i++)
16.74/5.70	 *         list.get(i);
16.74/5.70	 * 
16.74/5.70 * runs faster than this loop: 16.74/5.70 *
16.74/5.70	 *     for (Iterator i=list.iterator(); i.hasNext(); )
16.74/5.70	 *         i.next();
16.74/5.70	 * 
16.74/5.70 * 16.74/5.70 *

This interface is a member of the 16.74/5.70 * 16.74/5.70 * Java Collections Framework. 16.74/5.70 * 16.74/5.70 * @since 1.4 16.74/5.70 */ 16.74/5.70 public interface RandomAccess { 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 public class Random { 16.74/5.70 static String[] args; 16.74/5.70 static int index = 0; 16.74/5.70 16.74/5.70 public static int random() { 16.74/5.70 String string = args[index]; 16.74/5.70 index++; 16.74/5.70 return string.length(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Thrown to indicate that the requested operation is not supported.

16.74/5.70 * 16.74/5.70 * This class is a member of the 16.74/5.70 * 16.74/5.70 * Java Collections Framework. 16.74/5.70 * 16.74/5.70 * @author Josh Bloch 16.74/5.70 * @since 1.2 16.74/5.70 */ 16.74/5.70 public class UnsupportedOperationException extends RuntimeException { 16.74/5.70 /** 16.74/5.70 * Constructs an UnsupportedOperationException with no detail message. 16.74/5.70 */ 16.74/5.70 public UnsupportedOperationException() { 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Constructs an UnsupportedOperationException with the specified 16.74/5.70 * detail message. 16.74/5.70 * 16.74/5.70 * @param message the detail message 16.74/5.70 */ 16.74/5.70 public UnsupportedOperationException(String message) { 16.74/5.70 super(message); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Constructs a new exception with the specified detail message and 16.74/5.70 * cause. 16.74/5.70 * 16.74/5.70 *

Note that the detail message associated with cause is 16.74/5.70 * not automatically incorporated in this exception's detail 16.74/5.70 * message. 16.74/5.70 * 16.74/5.70 * @param message the detail message (which is saved for later retrieval 16.74/5.70 * by the {@link Throwable#getMessage()} method). 16.74/5.70 * @param cause the cause (which is saved for later retrieval by the 16.74/5.70 * {@link Throwable#getCause()} method). (A null value 16.74/5.70 * is permitted, and indicates that the cause is nonexistent or 16.74/5.70 * unknown.) 16.74/5.70 * @since 1.5 16.74/5.70 */ 16.74/5.70 public UnsupportedOperationException(String message, Throwable cause) { 16.74/5.70 super(message, cause); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Constructs a new exception with the specified cause and a detail 16.74/5.70 * message of (cause==null ? null : cause.toString()) (which 16.74/5.70 * typically contains the class and detail message of cause). 16.74/5.70 * This constructor is useful for exceptions that are little more than 16.74/5.70 * wrappers for other throwables (for example, {@link 16.74/5.70 * java.security.PrivilegedActionException}). 16.74/5.70 * 16.74/5.70 * @param cause the cause (which is saved for later retrieval by the 16.74/5.70 * {@link Throwable#getCause()} method). (A null value is 16.74/5.70 * permitted, and indicates that the cause is nonexistent or 16.74/5.70 * unknown.) 16.74/5.70 * @since 1.5 16.74/5.70 */ 16.74/5.70 public UnsupportedOperationException(Throwable cause) { 16.74/5.70 super(cause); 16.74/5.70 } 16.74/5.70 16.74/5.70 static final long serialVersionUID = -1242599979055084673L; 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 16.74/5.70 ---------------------------------------- 16.74/5.70 16.74/5.70 (1) BareJBCToJBCProof (EQUIVALENT) 16.74/5.70 initialized classpath 16.74/5.70 ---------------------------------------- 16.74/5.70 16.74/5.70 (2) 16.74/5.70 Obligation: 16.74/5.70 need to prove termination of the following program: 16.74/5.70 /* 16.74/5.70 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * This class provides a skeletal implementation of the Collection 16.74/5.70 * interface, to minimize the effort required to implement this interface.

16.74/5.70 * 16.74/5.70 * To implement an unmodifiable collection, the programmer needs only to 16.74/5.70 * extend this class and provide implementations for the iterator and 16.74/5.70 * size methods. (The iterator returned by the iterator 16.74/5.70 * method must implement hasNext and next.)

16.74/5.70 * 16.74/5.70 * To implement a modifiable collection, the programmer must additionally 16.74/5.70 * override this class's add method (which otherwise throws an 16.74/5.70 * UnsupportedOperationException), and the iterator returned by the 16.74/5.70 * iterator method must additionally implement its remove 16.74/5.70 * method.

16.74/5.70 * 16.74/5.70 * The programmer should generally provide a void (no argument) and 16.74/5.70 * Collection constructor, as per the recommendation in the 16.74/5.70 * Collection interface specification.

16.74/5.70 * 16.74/5.70 * The documentation for each non-abstract method in this class describes its 16.74/5.70 * implementation in detail. Each of these methods may be overridden if 16.74/5.70 * the collection being implemented admits a more efficient implementation.

16.74/5.70 * 16.74/5.70 * This class is a member of the 16.74/5.70 * 16.74/5.70 * Java Collections Framework. 16.74/5.70 * 16.74/5.70 * @author Josh Bloch 16.74/5.70 * @author Neal Gafter 16.74/5.70 * @see Collection 16.74/5.70 * @since 1.2 16.74/5.70 */ 16.74/5.70 16.74/5.70 public abstract class AbstractCollection implements Collection { 16.74/5.70 /** 16.74/5.70 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.70 * implicit.) 16.74/5.70 */ 16.74/5.70 protected AbstractCollection() { 16.74/5.70 } 16.74/5.70 16.74/5.70 // Query Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns an iterator over the elements contained in this collection. 16.74/5.70 * 16.74/5.70 * @return an iterator over the elements contained in this collection 16.74/5.70 */ 16.74/5.70 public abstract Iterator iterator(); 16.74/5.70 16.74/5.70 public abstract int size(); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation returns size() == 0. 16.74/5.70 */ 16.74/5.70 public boolean isEmpty() { 16.74/5.70 return size() == 0; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over the elements in the collection, 16.74/5.70 * checking each element in turn for equality with the specified element. 16.74/5.70 * 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public boolean contains(Object o) { 16.74/5.70 Iterator e = iterator(); 16.74/5.70 if (o==null) { 16.74/5.70 while (e.hasNext()) 16.74/5.70 if (e.next()==null) 16.74/5.70 return true; 16.74/5.70 } else { 16.74/5.70 while (e.hasNext()) 16.74/5.70 if (o.equals(e.next())) 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 return false; 16.74/5.70 } 16.74/5.70 16.74/5.70 // Modification Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation always throws an 16.74/5.70 * UnsupportedOperationException. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.70 * @throws IllegalStateException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public boolean add(E e) { 16.74/5.70 throw new UnsupportedOperationException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over the collection looking for the 16.74/5.70 * specified element. If it finds the element, it removes the element 16.74/5.70 * from the collection using the iterator's remove method. 16.74/5.70 * 16.74/5.70 *

Note that this implementation throws an 16.74/5.70 * UnsupportedOperationException if the iterator returned by this 16.74/5.70 * collection's iterator method does not implement the remove 16.74/5.70 * method and this collection contains the specified object. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public boolean remove(Object o) { 16.74/5.70 Iterator e = iterator(); 16.74/5.70 if (o==null) { 16.74/5.70 while (e.hasNext()) { 16.74/5.70 if (e.next()==null) { 16.74/5.70 e.remove(); 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 } else { 16.74/5.70 while (e.hasNext()) { 16.74/5.70 if (o.equals(e.next())) { 16.74/5.70 e.remove(); 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 } 16.74/5.70 return false; 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 // Bulk Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over the specified collection, 16.74/5.70 * checking each element returned by the iterator in turn to see 16.74/5.70 * if it's contained in this collection. If all elements are so 16.74/5.70 * contained true is returned, otherwise false. 16.74/5.70 * 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 public boolean containsAll(Collection c) { 16.74/5.70 Iterator e = c.iterator(); 16.74/5.70 while (e.hasNext()) 16.74/5.70 if (!contains(e.next())) 16.74/5.70 return false; 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over the specified collection, and adds 16.74/5.70 * each object returned by the iterator to this collection, in turn. 16.74/5.70 * 16.74/5.70 *

Note that this implementation will throw an 16.74/5.70 * UnsupportedOperationException unless add is 16.74/5.70 * overridden (assuming the specified collection is non-empty). 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.70 * @throws IllegalStateException {@inheritDoc} 16.74/5.70 * 16.74/5.70 * @see #add(Object) 16.74/5.70 */ 16.74/5.70 public boolean addAll(Collection c) { 16.74/5.70 boolean modified = false; 16.74/5.70 Iterator e = c.iterator(); 16.74/5.70 while (e.hasNext()) { 16.74/5.70 if (add(e.next())) 16.74/5.70 modified = true; 16.74/5.70 } 16.74/5.70 return modified; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over this collection, checking each 16.74/5.70 * element returned by the iterator in turn to see if it's contained 16.74/5.70 * in the specified collection. If it's so contained, it's removed from 16.74/5.70 * this collection with the iterator's remove method. 16.74/5.70 * 16.74/5.70 *

Note that this implementation will throw an 16.74/5.70 * UnsupportedOperationException if the iterator returned by the 16.74/5.70 * iterator method does not implement the remove method 16.74/5.70 * and this collection contains one or more elements in common with the 16.74/5.70 * specified collection. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * 16.74/5.70 * @see #remove(Object) 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 public boolean removeAll(Collection c) { 16.74/5.70 boolean modified = false; 16.74/5.70 Iterator e = iterator(); 16.74/5.70 while (e.hasNext()) { 16.74/5.70 if (c.contains(e.next())) { 16.74/5.70 e.remove(); 16.74/5.70 modified = true; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 return modified; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over this collection, checking each 16.74/5.70 * element returned by the iterator in turn to see if it's contained 16.74/5.70 * in the specified collection. If it's not so contained, it's removed 16.74/5.70 * from this collection with the iterator's remove method. 16.74/5.70 * 16.74/5.70 *

Note that this implementation will throw an 16.74/5.70 * UnsupportedOperationException if the iterator returned by the 16.74/5.70 * iterator method does not implement the remove method 16.74/5.70 * and this collection contains one or more elements not present in the 16.74/5.70 * specified collection. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * 16.74/5.70 * @see #remove(Object) 16.74/5.70 * @see #contains(Object) 16.74/5.70 */ 16.74/5.70 public boolean retainAll(Collection c) { 16.74/5.70 boolean modified = false; 16.74/5.70 Iterator e = iterator(); 16.74/5.70 while (e.hasNext()) { 16.74/5.70 if (!c.contains(e.next())) { 16.74/5.70 e.remove(); 16.74/5.70 modified = true; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 return modified; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation iterates over this collection, removing each 16.74/5.70 * element using the Iterator.remove operation. Most 16.74/5.70 * implementations will probably choose to override this method for 16.74/5.70 * efficiency. 16.74/5.70 * 16.74/5.70 *

Note that this implementation will throw an 16.74/5.70 * UnsupportedOperationException if the iterator returned by this 16.74/5.70 * collection's iterator method does not implement the 16.74/5.70 * remove method and this collection is non-empty. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public void clear() { 16.74/5.70 Iterator e = iterator(); 16.74/5.70 while (e.hasNext()) { 16.74/5.70 e.next(); 16.74/5.70 e.remove(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 // String conversion 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns a string representation of this collection. The string 16.74/5.70 * representation consists of a list of the collection's elements in the 16.74/5.70 * order they are returned by its iterator, enclosed in square brackets 16.74/5.70 * ("[]"). Adjacent elements are separated by the characters 16.74/5.70 * ", " (comma and space). Elements are converted to strings as 16.74/5.70 * by {@link String#valueOf(Object)}. 16.74/5.70 * 16.74/5.70 * @return a string representation of this collection 16.74/5.70 */ 16.74/5.70 public String toString() { 16.74/5.70 Iterator i = iterator(); 16.74/5.70 if (! i.hasNext()) 16.74/5.70 return "[]"; 16.74/5.70 16.74/5.70 String sb = ""; 16.74/5.70 sb = sb + "["; 16.74/5.70 for (;;) { 16.74/5.70 E e = i.next(); 16.74/5.70 sb = sb + (e == this ? "(this Collection)" : e); 16.74/5.70 if (! i.hasNext()) { 16.74/5.70 sb = sb + "]"; 16.74/5.70 return sb; 16.74/5.70 } 16.74/5.70 sb = sb + ", "; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.70 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.70 * 16.74/5.70 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.70 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.70 * have any questions. 16.74/5.70 */ 16.74/5.70 16.74/5.70 package javaUtilEx; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * This class provides a skeletal implementation of the {@link List} 16.74/5.70 * interface to minimize the effort required to implement this interface 16.74/5.70 * backed by a "random access" data store (such as an array). For sequential 16.74/5.70 * access data (such as a linked list), {@link AbstractSequentialList} should 16.74/5.70 * be used in preference to this class. 16.74/5.70 * 16.74/5.70 *

To implement an unmodifiable list, the programmer needs only to extend 16.74/5.70 * this class and provide implementations for the {@link #get(int)} and 16.74/5.70 * {@link List#size() size()} methods. 16.74/5.70 * 16.74/5.70 *

To implement a modifiable list, the programmer must additionally 16.74/5.70 * override the {@link #set(int, Object) set(int, E)} method (which otherwise 16.74/5.70 * throws an {@code UnsupportedOperationException}). If the list is 16.74/5.70 * variable-size the programmer must additionally override the 16.74/5.70 * {@link #add(int, Object) add(int, E)} and {@link #remove(int)} methods. 16.74/5.70 * 16.74/5.70 *

The programmer should generally provide a void (no argument) and collection 16.74/5.70 * constructor, as per the recommendation in the {@link Collection} interface 16.74/5.70 * specification. 16.74/5.70 * 16.74/5.70 *

Unlike the other abstract collection implementations, the programmer does 16.74/5.70 * not have to provide an iterator implementation; the iterator and 16.74/5.70 * list iterator are implemented by this class, on top of the "random access" 16.74/5.70 * methods: 16.74/5.70 * {@link #get(int)}, 16.74/5.70 * {@link #set(int, Object) set(int, E)}, 16.74/5.70 * {@link #add(int, Object) add(int, E)} and 16.74/5.70 * {@link #remove(int)}. 16.74/5.70 * 16.74/5.70 *

The documentation for each non-abstract method in this class describes its 16.74/5.70 * implementation in detail. Each of these methods may be overridden if the 16.74/5.70 * collection being implemented admits a more efficient implementation. 16.74/5.70 * 16.74/5.70 *

This class is a member of the 16.74/5.70 * 16.74/5.70 * Java Collections Framework. 16.74/5.70 * 16.74/5.70 * @author Josh Bloch 16.74/5.70 * @author Neal Gafter 16.74/5.70 * @since 1.2 16.74/5.70 */ 16.74/5.70 16.74/5.70 public abstract class AbstractList extends AbstractCollection implements List { 16.74/5.70 /** 16.74/5.70 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.70 * implicit.) 16.74/5.70 */ 16.74/5.70 protected AbstractList() { 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Appends the specified element to the end of this list (optional 16.74/5.70 * operation). 16.74/5.70 * 16.74/5.70 *

Lists that support this operation may place limitations on what 16.74/5.70 * elements may be added to this list. In particular, some 16.74/5.70 * lists will refuse to add null elements, and others will impose 16.74/5.70 * restrictions on the type of elements that may be added. List 16.74/5.70 * classes should clearly specify in their documentation any restrictions 16.74/5.70 * on what elements may be added. 16.74/5.70 * 16.74/5.70 *

This implementation calls {@code add(size(), e)}. 16.74/5.70 * 16.74/5.70 *

Note that this implementation throws an 16.74/5.70 * {@code UnsupportedOperationException} unless 16.74/5.70 * {@link #add(int, Object) add(int, E)} is overridden. 16.74/5.70 * 16.74/5.70 * @param e element to be appended to this list 16.74/5.70 * @return {@code true} (as specified by {@link Collection#add}) 16.74/5.70 * @throws UnsupportedOperationException if the {@code add} operation 16.74/5.70 * is not supported by this list 16.74/5.70 * @throws ClassCastException if the class of the specified element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 * @throws NullPointerException if the specified element is null and this 16.74/5.70 * list does not permit null elements 16.74/5.70 * @throws IllegalArgumentException if some property of this element 16.74/5.70 * prevents it from being added to this list 16.74/5.70 */ 16.74/5.70 public boolean add(E e) { 16.74/5.70 add(size(), e); 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 abstract public E get(int index); 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation always throws an 16.74/5.70 * {@code UnsupportedOperationException}. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public E set(int index, E element) { 16.74/5.70 throw new UnsupportedOperationException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation always throws an 16.74/5.70 * {@code UnsupportedOperationException}. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public void add(int index, E element) { 16.74/5.70 throw new UnsupportedOperationException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation always throws an 16.74/5.70 * {@code UnsupportedOperationException}. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public E remove(int index) { 16.74/5.70 throw new UnsupportedOperationException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 // Search Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation first gets a list iterator (with 16.74/5.70 * {@code listIterator()}). Then, it iterates over the list until the 16.74/5.70 * specified element is found or the end of the list is reached. 16.74/5.70 * 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public int indexOf(Object o) { 16.74/5.70 ListIterator e = listIterator(); 16.74/5.70 if (o==null) { 16.74/5.70 while (e.hasNext()) 16.74/5.70 if (e.next()==null) 16.74/5.70 return e.previousIndex(); 16.74/5.70 } else { 16.74/5.70 while (e.hasNext()) 16.74/5.70 if (o.equals(e.next())) 16.74/5.70 return e.previousIndex(); 16.74/5.70 } 16.74/5.70 return -1; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation first gets a list iterator that points to the end 16.74/5.70 * of the list (with {@code listIterator(size())}). Then, it iterates 16.74/5.70 * backwards over the list until the specified element is found, or the 16.74/5.70 * beginning of the list is reached. 16.74/5.70 * 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public int lastIndexOf(Object o) { 16.74/5.70 ListIterator e = listIterator(size()); 16.74/5.70 if (o==null) { 16.74/5.70 while (e.hasPrevious()) 16.74/5.70 if (e.previous()==null) 16.74/5.70 return e.nextIndex(); 16.74/5.70 } else { 16.74/5.70 while (e.hasPrevious()) 16.74/5.70 if (o.equals(e.previous())) 16.74/5.70 return e.nextIndex(); 16.74/5.70 } 16.74/5.70 return -1; 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 // Bulk Operations 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes all of the elements from this list (optional operation). 16.74/5.70 * The list will be empty after this call returns. 16.74/5.70 * 16.74/5.70 *

This implementation calls {@code removeRange(0, size())}. 16.74/5.70 * 16.74/5.70 *

Note that this implementation throws an 16.74/5.70 * {@code UnsupportedOperationException} unless {@code remove(int 16.74/5.70 * index)} or {@code removeRange(int fromIndex, int toIndex)} is 16.74/5.70 * overridden. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException if the {@code clear} operation 16.74/5.70 * is not supported by this list 16.74/5.70 */ 16.74/5.70 public void clear() { 16.74/5.70 removeRange(0, size()); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation gets an iterator over the specified collection 16.74/5.70 * and iterates over it, inserting the elements obtained from the 16.74/5.70 * iterator into this list at the appropriate position, one at a time, 16.74/5.70 * using {@code add(int, E)}. 16.74/5.70 * Many implementations will override this method for efficiency. 16.74/5.70 * 16.74/5.70 *

Note that this implementation throws an 16.74/5.70 * {@code UnsupportedOperationException} unless 16.74/5.70 * {@link #add(int, Object) add(int, E)} is overridden. 16.74/5.70 * 16.74/5.70 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.70 * @throws ClassCastException {@inheritDoc} 16.74/5.70 * @throws NullPointerException {@inheritDoc} 16.74/5.70 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public boolean addAll(int index, Collection c) { 16.74/5.70 rangeCheckForAdd(index); 16.74/5.70 boolean modified = false; 16.74/5.70 Iterator e = c.iterator(); 16.74/5.70 while (e.hasNext()) { 16.74/5.70 add(index++, e.next()); 16.74/5.70 modified = true; 16.74/5.70 } 16.74/5.70 return modified; 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 // Iterators 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns an iterator over the elements in this list in proper sequence. 16.74/5.70 * 16.74/5.70 *

This implementation returns a straightforward implementation of the 16.74/5.70 * iterator interface, relying on the backing list's {@code size()}, 16.74/5.70 * {@code get(int)}, and {@code remove(int)} methods. 16.74/5.70 * 16.74/5.70 *

Note that the iterator returned by this method will throw an 16.74/5.70 * {@link UnsupportedOperationException} in response to its 16.74/5.70 * {@code remove} method unless the list's {@code remove(int)} method is 16.74/5.70 * overridden. 16.74/5.70 * 16.74/5.70 *

This implementation can be made to throw runtime exceptions in the 16.74/5.70 * face of concurrent modification, as described in the specification 16.74/5.70 * for the (protected) {@link #modCount} field. 16.74/5.70 * 16.74/5.70 * @return an iterator over the elements in this list in proper sequence 16.74/5.70 */ 16.74/5.70 public Iterator iterator() { 16.74/5.70 return new Itr(); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation returns {@code listIterator(0)}. 16.74/5.70 * 16.74/5.70 * @see #listIterator(int) 16.74/5.70 */ 16.74/5.70 public ListIterator listIterator() { 16.74/5.70 return listIterator(0); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation returns a straightforward implementation of the 16.74/5.70 * {@code ListIterator} interface that extends the implementation of the 16.74/5.70 * {@code Iterator} interface returned by the {@code iterator()} method. 16.74/5.70 * The {@code ListIterator} implementation relies on the backing list's 16.74/5.70 * {@code get(int)}, {@code set(int, E)}, {@code add(int, E)} 16.74/5.70 * and {@code remove(int)} methods. 16.74/5.70 * 16.74/5.70 *

Note that the list iterator returned by this implementation will 16.74/5.70 * throw an {@link UnsupportedOperationException} in response to its 16.74/5.70 * {@code remove}, {@code set} and {@code add} methods unless the 16.74/5.70 * list's {@code remove(int)}, {@code set(int, E)}, and 16.74/5.70 * {@code add(int, E)} methods are overridden. 16.74/5.70 * 16.74/5.70 *

This implementation can be made to throw runtime exceptions in the 16.74/5.70 * face of concurrent modification, as described in the specification for 16.74/5.70 * the (protected) {@link #modCount} field. 16.74/5.70 * 16.74/5.70 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.70 */ 16.74/5.70 public ListIterator listIterator(final int index) { 16.74/5.70 rangeCheckForAdd(index); 16.74/5.70 16.74/5.70 return new ListItr(index); 16.74/5.70 } 16.74/5.70 16.74/5.70 private class Itr implements Iterator { 16.74/5.70 /** 16.74/5.70 * Index of element to be returned by subsequent call to next. 16.74/5.70 */ 16.74/5.70 int cursor = 0; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Index of element returned by most recent call to next or 16.74/5.70 * previous. Reset to -1 if this element is deleted by a call 16.74/5.70 * to remove. 16.74/5.70 */ 16.74/5.70 int lastRet = -1; 16.74/5.70 16.74/5.70 /** 16.74/5.70 * The modCount value that the iterator believes that the backing 16.74/5.70 * List should have. If this expectation is violated, the iterator 16.74/5.70 * has detected concurrent modification. 16.74/5.70 */ 16.74/5.70 int expectedModCount = modCount; 16.74/5.70 16.74/5.70 public boolean hasNext() { 16.74/5.70 return cursor != size(); 16.74/5.70 } 16.74/5.70 16.74/5.70 public E next() { 16.74/5.70 checkForComodification(); 16.74/5.70 try { 16.74/5.70 int i = cursor; 16.74/5.70 E next = get(i); 16.74/5.70 lastRet = i; 16.74/5.70 cursor = i + 1; 16.74/5.70 return next; 16.74/5.70 } catch (IndexOutOfBoundsException e) { 16.74/5.70 checkForComodification(); 16.74/5.70 throw new NoSuchElementException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 public void remove() { 16.74/5.70 if (lastRet < 0) 16.74/5.70 throw new IllegalStateException(); 16.74/5.70 checkForComodification(); 16.74/5.70 16.74/5.70 try { 16.74/5.70 AbstractList.this.remove(lastRet); 16.74/5.70 if (lastRet < cursor) 16.74/5.70 cursor--; 16.74/5.70 lastRet = -1; 16.74/5.70 expectedModCount = modCount; 16.74/5.70 } catch (IndexOutOfBoundsException e) { 16.74/5.70 throw new ConcurrentModificationException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 final void checkForComodification() { 16.74/5.70 if (modCount != expectedModCount) 16.74/5.70 throw new ConcurrentModificationException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 private class ListItr extends Itr implements ListIterator { 16.74/5.70 ListItr(int index) { 16.74/5.70 cursor = index; 16.74/5.70 } 16.74/5.70 16.74/5.70 public boolean hasPrevious() { 16.74/5.70 return cursor != 0; 16.74/5.70 } 16.74/5.70 16.74/5.70 public E previous() { 16.74/5.70 checkForComodification(); 16.74/5.70 try { 16.74/5.70 int i = cursor - 1; 16.74/5.70 E previous = get(i); 16.74/5.70 lastRet = cursor = i; 16.74/5.70 return previous; 16.74/5.70 } catch (IndexOutOfBoundsException e) { 16.74/5.70 checkForComodification(); 16.74/5.70 throw new NoSuchElementException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 public int nextIndex() { 16.74/5.70 return cursor; 16.74/5.70 } 16.74/5.70 16.74/5.70 public int previousIndex() { 16.74/5.70 return cursor-1; 16.74/5.70 } 16.74/5.70 16.74/5.70 public void set(E e) { 16.74/5.70 if (lastRet < 0) 16.74/5.70 throw new IllegalStateException(); 16.74/5.70 checkForComodification(); 16.74/5.70 16.74/5.70 try { 16.74/5.70 AbstractList.this.set(lastRet, e); 16.74/5.70 expectedModCount = modCount; 16.74/5.70 } catch (IndexOutOfBoundsException ex) { 16.74/5.70 throw new ConcurrentModificationException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 public void add(E e) { 16.74/5.70 checkForComodification(); 16.74/5.70 16.74/5.70 try { 16.74/5.70 int i = cursor; 16.74/5.70 AbstractList.this.add(i, e); 16.74/5.70 lastRet = -1; 16.74/5.70 cursor = i + 1; 16.74/5.70 expectedModCount = modCount; 16.74/5.70 } catch (IndexOutOfBoundsException ex) { 16.74/5.70 throw new ConcurrentModificationException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * {@inheritDoc} 16.74/5.70 * 16.74/5.70 *

This implementation returns a list that subclasses 16.74/5.70 * {@code AbstractList}. The subclass stores, in private fields, the 16.74/5.70 * offset of the subList within the backing list, the size of the subList 16.74/5.70 * (which can change over its lifetime), and the expected 16.74/5.70 * {@code modCount} value of the backing list. There are two variants 16.74/5.70 * of the subclass, one of which implements {@code RandomAccess}. 16.74/5.70 * If this list implements {@code RandomAccess} the returned list will 16.74/5.70 * be an instance of the subclass that implements {@code RandomAccess}. 16.74/5.70 * 16.74/5.70 *

The subclass's {@code set(int, E)}, {@code get(int)}, 16.74/5.70 * {@code add(int, E)}, {@code remove(int)}, {@code addAll(int, 16.74/5.70 * Collection)} and {@code removeRange(int, int)} methods all 16.74/5.70 * delegate to the corresponding methods on the backing abstract list, 16.74/5.70 * after bounds-checking the index and adjusting for the offset. The 16.74/5.70 * {@code addAll(Collection c)} method merely returns {@code addAll(size, 16.74/5.70 * c)}. 16.74/5.70 * 16.74/5.70 *

The {@code listIterator(int)} method returns a "wrapper object" 16.74/5.70 * over a list iterator on the backing list, which is created with the 16.74/5.70 * corresponding method on the backing list. The {@code iterator} method 16.74/5.70 * merely returns {@code listIterator()}, and the {@code size} method 16.74/5.70 * merely returns the subclass's {@code size} field. 16.74/5.70 * 16.74/5.70 *

All methods first check to see if the actual {@code modCount} of 16.74/5.70 * the backing list is equal to its expected value, and throw a 16.74/5.70 * {@code ConcurrentModificationException} if it is not. 16.74/5.70 * 16.74/5.70 * @throws IndexOutOfBoundsException if an endpoint index value is out of range 16.74/5.70 * {@code (fromIndex < 0 || toIndex > size)} 16.74/5.70 * @throws IllegalArgumentException if the endpoint indices are out of order 16.74/5.70 * {@code (fromIndex > toIndex)} 16.74/5.70 */ 16.74/5.70 public List subList(int fromIndex, int toIndex) { 16.74/5.70 return (this instanceof RandomAccess ? 16.74/5.70 new RandomAccessSubList(this, fromIndex, toIndex) : 16.74/5.70 new SubList(this, fromIndex, toIndex)); 16.74/5.70 } 16.74/5.70 16.74/5.70 // Comparison and hashing 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Compares the specified object with this list for equality. Returns 16.74/5.70 * {@code true} if and only if the specified object is also a list, both 16.74/5.70 * lists have the same size, and all corresponding pairs of elements in 16.74/5.70 * the two lists are equal. (Two elements {@code e1} and 16.74/5.70 * {@code e2} are equal if {@code (e1==null ? e2==null : 16.74/5.70 * e1.equals(e2))}.) In other words, two lists are defined to be 16.74/5.70 * equal if they contain the same elements in the same order.

16.74/5.70 * 16.74/5.70 * This implementation first checks if the specified object is this 16.74/5.70 * list. If so, it returns {@code true}; if not, it checks if the 16.74/5.70 * specified object is a list. If not, it returns {@code false}; if so, 16.74/5.70 * it iterates over both lists, comparing corresponding pairs of elements. 16.74/5.70 * If any comparison returns {@code false}, this method returns 16.74/5.70 * {@code false}. If either iterator runs out of elements before the 16.74/5.70 * other it returns {@code false} (as the lists are of unequal length); 16.74/5.70 * otherwise it returns {@code true} when the iterations complete. 16.74/5.70 * 16.74/5.70 * @param o the object to be compared for equality with this list 16.74/5.70 * @return {@code true} if the specified object is equal to this list 16.74/5.70 */ 16.74/5.70 public boolean equals(Object o) { 16.74/5.70 if (o == this) 16.74/5.70 return true; 16.74/5.70 if (!(o instanceof List)) 16.74/5.70 return false; 16.74/5.70 16.74/5.70 ListIterator e1 = listIterator(); 16.74/5.70 ListIterator e2 = ((List) o).listIterator(); 16.74/5.70 while(e1.hasNext() && e2.hasNext()) { 16.74/5.70 E o1 = e1.next(); 16.74/5.70 Object o2 = e2.next(); 16.74/5.70 if (!(o1==null ? o2==null : o1.equals(o2))) 16.74/5.70 return false; 16.74/5.70 } 16.74/5.70 return !(e1.hasNext() || e2.hasNext()); 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Returns the hash code value for this list. 16.74/5.70 * 16.74/5.70 *

This implementation uses exactly the code that is used to define the 16.74/5.70 * list hash function in the documentation for the {@link List#hashCode} 16.74/5.70 * method. 16.74/5.70 * 16.74/5.70 * @return the hash code value for this list 16.74/5.70 */ 16.74/5.70 public int hashCode() { 16.74/5.70 int hashCode = 1; 16.74/5.70 Iterator it = this.iterator(); 16.74/5.70 while (it.hasNext()) { 16.74/5.70 E e = it.next(); 16.74/5.70 hashCode = 31*hashCode + (e==null ? 0 : e.hashCode()); 16.74/5.70 } 16.74/5.70 return hashCode; 16.74/5.70 } 16.74/5.70 16.74/5.70 /** 16.74/5.70 * Removes from this list all of the elements whose index is between 16.74/5.70 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive. 16.74/5.70 * Shifts any succeeding elements to the left (reduces their index). 16.74/5.70 * This call shortens the list by {@code (toIndex - fromIndex)} elements. 16.74/5.70 * (If {@code toIndex==fromIndex}, this operation has no effect.) 16.74/5.70 * 16.74/5.70 *

This method is called by the {@code clear} operation on this list 16.74/5.70 * and its subLists. Overriding this method to take advantage of 16.74/5.70 * the internals of the list implementation can substantially 16.74/5.70 * improve the performance of the {@code clear} operation on this list 16.74/5.70 * and its subLists. 16.74/5.70 * 16.74/5.70 *

This implementation gets a list iterator positioned before 16.74/5.70 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next} 16.74/5.70 * followed by {@code ListIterator.remove} until the entire range has 16.74/5.70 * been removed. Note: if {@code ListIterator.remove} requires linear 16.74/5.70 * time, this implementation requires quadratic time. 16.74/5.70 * 16.74/5.70 * @param fromIndex index of first element to be removed 16.74/5.70 * @param toIndex index after last element to be removed 16.74/5.70 */ 16.74/5.70 protected void removeRange(int fromIndex, int toIndex) { 16.74/5.70 ListIterator it = listIterator(fromIndex); 16.74/5.70 for (int i=0, n=toIndex-fromIndex; istructurally modified. 16.74/5.70 * Structural modifications are those that change the size of the 16.74/5.70 * list, or otherwise perturb it in such a fashion that iterations in 16.74/5.70 * progress may yield incorrect results. 16.74/5.70 * 16.74/5.70 *

This field is used by the iterator and list iterator implementation 16.74/5.70 * returned by the {@code iterator} and {@code listIterator} methods. 16.74/5.70 * If the value of this field changes unexpectedly, the iterator (or list 16.74/5.70 * iterator) will throw a {@code ConcurrentModificationException} in 16.74/5.70 * response to the {@code next}, {@code remove}, {@code previous}, 16.74/5.70 * {@code set} or {@code add} operations. This provides 16.74/5.70 * fail-fast behavior, rather than non-deterministic behavior in 16.74/5.70 * the face of concurrent modification during iteration. 16.74/5.70 * 16.74/5.70 *

Use of this field by subclasses is optional. If a subclass 16.74/5.70 * wishes to provide fail-fast iterators (and list iterators), then it 16.74/5.70 * merely has to increment this field in its {@code add(int, E)} and 16.74/5.70 * {@code remove(int)} methods (and any other methods that it overrides 16.74/5.70 * that result in structural modifications to the list). A single call to 16.74/5.70 * {@code add(int, E)} or {@code remove(int)} must add no more than 16.74/5.70 * one to this field, or the iterators (and list iterators) will throw 16.74/5.70 * bogus {@code ConcurrentModificationExceptions}. If an implementation 16.74/5.70 * does not wish to provide fail-fast iterators, this field may be 16.74/5.70 * ignored. 16.74/5.70 */ 16.74/5.70 protected transient int modCount = 0; 16.74/5.70 16.74/5.70 private void rangeCheckForAdd(int index) { 16.74/5.70 if (index < 0 || index > size()) 16.74/5.70 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.70 } 16.74/5.70 16.74/5.70 private String outOfBoundsMsg(int index) { 16.74/5.70 return ""; 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 class SubList extends AbstractList { 16.74/5.70 private final AbstractList l; 16.74/5.70 private final int offset; 16.74/5.70 private int size; 16.74/5.70 16.74/5.70 SubList(AbstractList list, int fromIndex, int toIndex) { 16.74/5.70 if (fromIndex < 0) 16.74/5.70 throw new IndexOutOfBoundsException(); 16.74/5.70 if (toIndex > list.size()) 16.74/5.70 throw new IndexOutOfBoundsException(); 16.74/5.70 if (fromIndex > toIndex) 16.74/5.70 throw new IllegalArgumentException(); 16.74/5.70 l = list; 16.74/5.70 offset = fromIndex; 16.74/5.70 size = toIndex - fromIndex; 16.74/5.70 this.modCount = l.modCount; 16.74/5.70 } 16.74/5.70 16.74/5.70 public E set(int index, E element) { 16.74/5.70 rangeCheck(index); 16.74/5.70 checkForComodification(); 16.74/5.70 return l.set(index+offset, element); 16.74/5.70 } 16.74/5.70 16.74/5.70 public E get(int index) { 16.74/5.70 rangeCheck(index); 16.74/5.70 checkForComodification(); 16.74/5.70 return l.get(index+offset); 16.74/5.70 } 16.74/5.70 16.74/5.70 public int size() { 16.74/5.70 checkForComodification(); 16.74/5.70 return size; 16.74/5.70 } 16.74/5.70 16.74/5.70 public void add(int index, E element) { 16.74/5.70 rangeCheckForAdd(index); 16.74/5.70 checkForComodification(); 16.74/5.70 l.add(index+offset, element); 16.74/5.70 this.modCount = l.modCount; 16.74/5.70 size++; 16.74/5.70 } 16.74/5.70 16.74/5.70 public E remove(int index) { 16.74/5.70 rangeCheck(index); 16.74/5.70 checkForComodification(); 16.74/5.70 E result = l.remove(index+offset); 16.74/5.70 this.modCount = l.modCount; 16.74/5.70 size--; 16.74/5.70 return result; 16.74/5.70 } 16.74/5.70 16.74/5.70 protected void removeRange(int fromIndex, int toIndex) { 16.74/5.70 checkForComodification(); 16.74/5.70 l.removeRange(fromIndex+offset, toIndex+offset); 16.74/5.70 this.modCount = l.modCount; 16.74/5.70 size -= (toIndex-fromIndex); 16.74/5.70 } 16.74/5.70 16.74/5.70 public boolean addAll(Collection c) { 16.74/5.70 return addAll(size, c); 16.74/5.70 } 16.74/5.70 16.74/5.70 public boolean addAll(int index, Collection c) { 16.74/5.70 rangeCheckForAdd(index); 16.74/5.70 int cSize = c.size(); 16.74/5.70 if (cSize==0) 16.74/5.70 return false; 16.74/5.70 16.74/5.70 checkForComodification(); 16.74/5.70 l.addAll(offset+index, c); 16.74/5.70 this.modCount = l.modCount; 16.74/5.70 size += cSize; 16.74/5.70 return true; 16.74/5.70 } 16.74/5.70 16.74/5.70 public Iterator iterator() { 16.74/5.70 return listIterator(); 16.74/5.70 } 16.74/5.70 16.74/5.70 public ListIterator listIterator(final int index) { 16.74/5.70 checkForComodification(); 16.74/5.70 rangeCheckForAdd(index); 16.74/5.70 16.74/5.70 return new ListIterator() { 16.74/5.70 private final ListIterator i = l.listIterator(index+offset); 16.74/5.70 16.74/5.70 public boolean hasNext() { 16.74/5.70 return nextIndex() < size; 16.74/5.70 } 16.74/5.70 16.74/5.70 public E next() { 16.74/5.70 if (hasNext()) 16.74/5.70 return i.next(); 16.74/5.70 else 16.74/5.70 throw new NoSuchElementException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 public boolean hasPrevious() { 16.74/5.70 return previousIndex() >= 0; 16.74/5.70 } 16.74/5.70 16.74/5.70 public E previous() { 16.74/5.70 if (hasPrevious()) 16.74/5.70 return i.previous(); 16.74/5.70 else 16.74/5.70 throw new NoSuchElementException(); 16.74/5.70 } 16.74/5.70 16.74/5.70 public int nextIndex() { 16.74/5.70 return i.nextIndex() - offset; 16.74/5.70 } 16.74/5.70 16.74/5.70 public int previousIndex() { 16.74/5.70 return i.previousIndex() - offset; 16.74/5.70 } 16.74/5.70 16.74/5.70 public void remove() { 16.74/5.70 i.remove(); 16.74/5.70 SubList.this.modCount = l.modCount; 16.74/5.70 size--; 16.74/5.70 } 16.74/5.70 16.74/5.70 public void set(E e) { 16.74/5.70 i.set(e); 16.74/5.70 } 16.74/5.70 16.74/5.70 public void add(E e) { 16.74/5.70 i.add(e); 16.74/5.70 SubList.this.modCount = l.modCount; 16.74/5.70 size++; 16.74/5.70 } 16.74/5.70 }; 16.74/5.70 } 16.74/5.70 16.74/5.70 public List subList(int fromIndex, int toIndex) { 16.74/5.70 return new SubList(this, fromIndex, toIndex); 16.74/5.70 } 16.74/5.70 16.74/5.70 private void rangeCheck(int index) { 16.74/5.70 if (index < 0 || index >= size) 16.74/5.70 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.70 } 16.74/5.70 16.74/5.70 private void rangeCheckForAdd(int index) { 16.74/5.70 if (index < 0 || index > size) 16.74/5.70 throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); 16.74/5.70 } 16.74/5.70 16.74/5.70 private String outOfBoundsMsg(int index) { 16.74/5.70 return ""; 16.74/5.70 } 16.74/5.70 16.74/5.70 private void checkForComodification() { 16.74/5.70 if (this.modCount != l.modCount) 16.74/5.70 throw new ConcurrentModificationException(); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 class RandomAccessSubList extends SubList implements RandomAccess { 16.74/5.70 RandomAccessSubList(AbstractList list, int fromIndex, int toIndex) { 16.74/5.70 super(list, fromIndex, toIndex); 16.74/5.70 } 16.74/5.70 16.74/5.70 public List subList(int fromIndex, int toIndex) { 16.74/5.70 return new RandomAccessSubList(this, fromIndex, toIndex); 16.74/5.70 } 16.74/5.70 } 16.74/5.70 16.74/5.70 16.74/5.70 /* 16.74/5.70 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.70 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.70 * 16.74/5.70 * This code is free software; you can redistribute it and/or modify it 16.74/5.70 * under the terms of the GNU General Public License version 2 only, as 16.74/5.70 * published by the Free Software Foundation. Sun designates this 16.74/5.70 * particular file as subject to the "Classpath" exception as provided 16.74/5.70 * by Sun in the LICENSE file that accompanied this code. 16.74/5.70 * 16.74/5.70 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.70 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.70 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.70 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.70 * accompanied this code). 16.74/5.70 * 16.74/5.70 * You should have received a copy of the GNU General Public License version 16.74/5.70 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * This class provides a skeletal implementation of the List 16.74/5.71 * interface to minimize the effort required to implement this interface 16.74/5.71 * backed by a "sequential access" data store (such as a linked list). For 16.74/5.71 * random access data (such as an array), AbstractList should be used 16.74/5.71 * in preference to this class.

16.74/5.71 * 16.74/5.71 * This class is the opposite of the AbstractList class in the sense 16.74/5.71 * that it implements the "random access" methods (get(int index), 16.74/5.71 * set(int index, E element), add(int index, E element) and 16.74/5.71 * remove(int index)) on top of the list's list iterator, instead of 16.74/5.71 * the other way around.

16.74/5.71 * 16.74/5.71 * To implement a list the programmer needs only to extend this class and 16.74/5.71 * provide implementations for the listIterator and size 16.74/5.71 * methods. For an unmodifiable list, the programmer need only implement the 16.74/5.71 * list iterator's hasNext, next, hasPrevious, 16.74/5.71 * previous and index methods.

16.74/5.71 * 16.74/5.71 * For a modifiable list the programmer should additionally implement the list 16.74/5.71 * iterator's set method. For a variable-size list the programmer 16.74/5.71 * should additionally implement the list iterator's remove and 16.74/5.71 * add methods.

16.74/5.71 * 16.74/5.71 * The programmer should generally provide a void (no argument) and collection 16.74/5.71 * constructor, as per the recommendation in the Collection interface 16.74/5.71 * specification.

16.74/5.71 * 16.74/5.71 * This class is a member of the 16.74/5.71 * 16.74/5.71 * Java Collections Framework. 16.74/5.71 * 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @author Neal Gafter 16.74/5.71 * @see Collection 16.74/5.71 * @see List 16.74/5.71 * @see AbstractList 16.74/5.71 * @see AbstractCollection 16.74/5.71 * @since 1.2 16.74/5.71 */ 16.74/5.71 16.74/5.71 public abstract class AbstractSequentialList extends AbstractList { 16.74/5.71 /** 16.74/5.71 * Sole constructor. (For invocation by subclass constructors, typically 16.74/5.71 * implicit.) 16.74/5.71 */ 16.74/5.71 protected AbstractSequentialList() { 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the element at the specified position in this list. 16.74/5.71 * 16.74/5.71 *

This implementation first gets a list iterator pointing to the 16.74/5.71 * indexed element (with listIterator(index)). Then, it gets 16.74/5.71 * the element using ListIterator.next and returns it. 16.74/5.71 * 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E get(int index) { 16.74/5.71 try { 16.74/5.71 return listIterator(index).next(); 16.74/5.71 } catch (NoSuchElementException exc) { 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Replaces the element at the specified position in this list with the 16.74/5.71 * specified element (optional operation). 16.74/5.71 * 16.74/5.71 *

This implementation first gets a list iterator pointing to the 16.74/5.71 * indexed element (with listIterator(index)). Then, it gets 16.74/5.71 * the current element using ListIterator.next and replaces it 16.74/5.71 * with ListIterator.set. 16.74/5.71 * 16.74/5.71 *

Note that this implementation will throw an 16.74/5.71 * UnsupportedOperationException if the list iterator does not 16.74/5.71 * implement the set operation. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.71 * @throws ClassCastException {@inheritDoc} 16.74/5.71 * @throws NullPointerException {@inheritDoc} 16.74/5.71 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E set(int index, E element) { 16.74/5.71 try { 16.74/5.71 ListIterator e = listIterator(index); 16.74/5.71 E oldVal = e.next(); 16.74/5.71 e.set(element); 16.74/5.71 return oldVal; 16.74/5.71 } catch (NoSuchElementException exc) { 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the specified position in this list 16.74/5.71 * (optional operation). Shifts the element currently at that position 16.74/5.71 * (if any) and any subsequent elements to the right (adds one to their 16.74/5.71 * indices). 16.74/5.71 * 16.74/5.71 *

This implementation first gets a list iterator pointing to the 16.74/5.71 * indexed element (with listIterator(index)). Then, it 16.74/5.71 * inserts the specified element with ListIterator.add. 16.74/5.71 * 16.74/5.71 *

Note that this implementation will throw an 16.74/5.71 * UnsupportedOperationException if the list iterator does not 16.74/5.71 * implement the add operation. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.71 * @throws ClassCastException {@inheritDoc} 16.74/5.71 * @throws NullPointerException {@inheritDoc} 16.74/5.71 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public void add(int index, E element) { 16.74/5.71 try { 16.74/5.71 listIterator(index).add(element); 16.74/5.71 } catch (NoSuchElementException exc) { 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the element at the specified position in this list (optional 16.74/5.71 * operation). Shifts any subsequent elements to the left (subtracts one 16.74/5.71 * from their indices). Returns the element that was removed from the 16.74/5.71 * list. 16.74/5.71 * 16.74/5.71 *

This implementation first gets a list iterator pointing to the 16.74/5.71 * indexed element (with listIterator(index)). Then, it removes 16.74/5.71 * the element with ListIterator.remove. 16.74/5.71 * 16.74/5.71 *

Note that this implementation will throw an 16.74/5.71 * UnsupportedOperationException if the list iterator does not 16.74/5.71 * implement the remove operation. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E remove(int index) { 16.74/5.71 try { 16.74/5.71 ListIterator e = listIterator(index); 16.74/5.71 E outCast = e.next(); 16.74/5.71 e.remove(); 16.74/5.71 return outCast; 16.74/5.71 } catch (NoSuchElementException exc) { 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 // Bulk Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts all of the elements in the specified collection into this 16.74/5.71 * list at the specified position (optional operation). Shifts the 16.74/5.71 * element currently at that position (if any) and any subsequent 16.74/5.71 * elements to the right (increases their indices). The new elements 16.74/5.71 * will appear in this list in the order that they are returned by the 16.74/5.71 * specified collection's iterator. The behavior of this operation is 16.74/5.71 * undefined if the specified collection is modified while the 16.74/5.71 * operation is in progress. (Note that this will occur if the specified 16.74/5.71 * collection is this list, and it's nonempty.) 16.74/5.71 * 16.74/5.71 *

This implementation gets an iterator over the specified collection and 16.74/5.71 * a list iterator over this list pointing to the indexed element (with 16.74/5.71 * listIterator(index)). Then, it iterates over the specified 16.74/5.71 * collection, inserting the elements obtained from the iterator into this 16.74/5.71 * list, one at a time, using ListIterator.add followed by 16.74/5.71 * ListIterator.next (to skip over the added element). 16.74/5.71 * 16.74/5.71 *

Note that this implementation will throw an 16.74/5.71 * UnsupportedOperationException if the list iterator returned by 16.74/5.71 * the listIterator method does not implement the add 16.74/5.71 * operation. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException {@inheritDoc} 16.74/5.71 * @throws ClassCastException {@inheritDoc} 16.74/5.71 * @throws NullPointerException {@inheritDoc} 16.74/5.71 * @throws IllegalArgumentException {@inheritDoc} 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public boolean addAll(int index, Collection c) { 16.74/5.71 try { 16.74/5.71 boolean modified = false; 16.74/5.71 ListIterator e1 = listIterator(index); 16.74/5.71 Iterator e2 = c.iterator(); 16.74/5.71 while (e2.hasNext()) { 16.74/5.71 e1.add(e2.next()); 16.74/5.71 modified = true; 16.74/5.71 } 16.74/5.71 return modified; 16.74/5.71 } catch (NoSuchElementException exc) { 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 // Iterators 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns an iterator over the elements in this list (in proper 16.74/5.71 * sequence).

16.74/5.71 * 16.74/5.71 * This implementation merely returns a list iterator over the list. 16.74/5.71 * 16.74/5.71 * @return an iterator over the elements in this list (in proper sequence) 16.74/5.71 */ 16.74/5.71 public Iterator iterator() { 16.74/5.71 return listIterator(); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns a list iterator over the elements in this list (in proper 16.74/5.71 * sequence). 16.74/5.71 * 16.74/5.71 * @param index index of first element to be returned from the list 16.74/5.71 * iterator (by a call to the next method) 16.74/5.71 * @return a list iterator over the elements in this list (in proper 16.74/5.71 * sequence) 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public abstract ListIterator listIterator(int index); 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * The root interface in the collection hierarchy. A collection 16.74/5.71 * represents a group of objects, known as its elements. Some 16.74/5.71 * collections allow duplicate elements and others do not. Some are ordered 16.74/5.71 * and others unordered. The JDK does not provide any direct 16.74/5.71 * implementations of this interface: it provides implementations of more 16.74/5.71 * specific subinterfaces like Set and List. This interface 16.74/5.71 * is typically used to pass collections around and manipulate them where 16.74/5.71 * maximum generality is desired. 16.74/5.71 * 16.74/5.71 *

Bags or multisets (unordered collections that may contain 16.74/5.71 * duplicate elements) should implement this interface directly. 16.74/5.71 * 16.74/5.71 *

All general-purpose Collection implementation classes (which 16.74/5.71 * typically implement Collection indirectly through one of its 16.74/5.71 * subinterfaces) should provide two "standard" constructors: a void (no 16.74/5.71 * arguments) constructor, which creates an empty collection, and a 16.74/5.71 * constructor with a single argument of type Collection, which 16.74/5.71 * creates a new collection with the same elements as its argument. In 16.74/5.71 * effect, the latter constructor allows the user to copy any collection, 16.74/5.71 * producing an equivalent collection of the desired implementation type. 16.74/5.71 * There is no way to enforce this convention (as interfaces cannot contain 16.74/5.71 * constructors) but all of the general-purpose Collection 16.74/5.71 * implementations in the Java platform libraries comply. 16.74/5.71 * 16.74/5.71 *

The "destructive" methods contained in this interface, that is, the 16.74/5.71 * methods that modify the collection on which they operate, are specified to 16.74/5.71 * throw UnsupportedOperationException if this collection does not 16.74/5.71 * support the operation. If this is the case, these methods may, but are not 16.74/5.71 * required to, throw an UnsupportedOperationException if the 16.74/5.71 * invocation would have no effect on the collection. For example, invoking 16.74/5.71 * the {@link #addAll(Collection)} method on an unmodifiable collection may, 16.74/5.71 * but is not required to, throw the exception if the collection to be added 16.74/5.71 * is empty. 16.74/5.71 * 16.74/5.71 *

Some collection implementations have restrictions on the elements that 16.74/5.71 * they may contain. For example, some implementations prohibit null elements, 16.74/5.71 * and some have restrictions on the types of their elements. Attempting to 16.74/5.71 * add an ineligible element throws an unchecked exception, typically 16.74/5.71 * NullPointerException or ClassCastException. Attempting 16.74/5.71 * to query the presence of an ineligible element may throw an exception, 16.74/5.71 * or it may simply return false; some implementations will exhibit the former 16.74/5.71 * behavior and some will exhibit the latter. More generally, attempting an 16.74/5.71 * operation on an ineligible element whose completion would not result in 16.74/5.71 * the insertion of an ineligible element into the collection may throw an 16.74/5.71 * exception or it may succeed, at the option of the implementation. 16.74/5.71 * Such exceptions are marked as "optional" in the specification for this 16.74/5.71 * interface. 16.74/5.71 * 16.74/5.71 *

It is up to each collection to determine its own synchronization 16.74/5.71 * policy. In the absence of a stronger guarantee by the 16.74/5.71 * implementation, undefined behavior may result from the invocation 16.74/5.71 * of any method on a collection that is being mutated by another 16.74/5.71 * thread; this includes direct invocations, passing the collection to 16.74/5.71 * a method that might perform invocations, and using an existing 16.74/5.71 * iterator to examine the collection. 16.74/5.71 * 16.74/5.71 *

Many methods in Collections Framework interfaces are defined in 16.74/5.71 * terms of the {@link Object#equals(Object) equals} method. For example, 16.74/5.71 * the specification for the {@link #contains(Object) contains(Object o)} 16.74/5.71 * method says: "returns true if and only if this collection 16.74/5.71 * contains at least one element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e))." This specification should 16.74/5.71 * not be construed to imply that invoking Collection.contains 16.74/5.71 * with a non-null argument o will cause o.equals(e) to be 16.74/5.71 * invoked for any element e. Implementations are free to implement 16.74/5.71 * optimizations whereby the equals invocation is avoided, for 16.74/5.71 * example, by first comparing the hash codes of the two elements. (The 16.74/5.71 * {@link Object#hashCode()} specification guarantees that two objects with 16.74/5.71 * unequal hash codes cannot be equal.) More generally, implementations of 16.74/5.71 * the various Collections Framework interfaces are free to take advantage of 16.74/5.71 * the specified behavior of underlying {@link Object} methods wherever the 16.74/5.71 * implementor deems it appropriate. 16.74/5.71 * 16.74/5.71 *

This interface is a member of the 16.74/5.71 * 16.74/5.71 * Java Collections Framework. 16.74/5.71 * 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @author Neal Gafter 16.74/5.71 * @see Set 16.74/5.71 * @see List 16.74/5.71 * @see Map 16.74/5.71 * @see SortedSet 16.74/5.71 * @see SortedMap 16.74/5.71 * @see HashSet 16.74/5.71 * @see TreeSet 16.74/5.71 * @see ArrayList 16.74/5.71 * @see LinkedList 16.74/5.71 * @see Vector 16.74/5.71 * @see Collections 16.74/5.71 * @see Arrays 16.74/5.71 * @see AbstractCollection 16.74/5.71 * @since 1.2 16.74/5.71 */ 16.74/5.71 16.74/5.71 public interface Collection { 16.74/5.71 // Query Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the number of elements in this collection. If this collection 16.74/5.71 * contains more than Integer.MAX_VALUE elements, returns 16.74/5.71 * Integer.MAX_VALUE. 16.74/5.71 * 16.74/5.71 * @return the number of elements in this collection 16.74/5.71 */ 16.74/5.71 int size(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns true if this collection contains no elements. 16.74/5.71 * 16.74/5.71 * @return true if this collection contains no elements 16.74/5.71 */ 16.74/5.71 boolean isEmpty(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns true if this collection contains the specified element. 16.74/5.71 * More formally, returns true if and only if this collection 16.74/5.71 * contains at least one element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)). 16.74/5.71 * 16.74/5.71 * @param o element whose presence in this collection is to be tested 16.74/5.71 * @return true if this collection contains the specified 16.74/5.71 * element 16.74/5.71 * @throws ClassCastException if the type of the specified element 16.74/5.71 * is incompatible with this collection (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * collection does not permit null elements (optional) 16.74/5.71 */ 16.74/5.71 boolean contains(Object o); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns an iterator over the elements in this collection. There are no 16.74/5.71 * guarantees concerning the order in which the elements are returned 16.74/5.71 * (unless this collection is an instance of some class that provides a 16.74/5.71 * guarantee). 16.74/5.71 * 16.74/5.71 * @return an Iterator over the elements in this collection 16.74/5.71 */ 16.74/5.71 Iterator iterator(); 16.74/5.71 16.74/5.71 // Modification Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Ensures that this collection contains the specified element (optional 16.74/5.71 * operation). Returns true if this collection changed as a 16.74/5.71 * result of the call. (Returns false if this collection does 16.74/5.71 * not permit duplicates and already contains the specified element.)

16.74/5.71 * 16.74/5.71 * Collections that support this operation may place limitations on what 16.74/5.71 * elements may be added to this collection. In particular, some 16.74/5.71 * collections will refuse to add null elements, and others will 16.74/5.71 * impose restrictions on the type of elements that may be added. 16.74/5.71 * Collection classes should clearly specify in their documentation any 16.74/5.71 * restrictions on what elements may be added.

16.74/5.71 * 16.74/5.71 * If a collection refuses to add a particular element for any reason 16.74/5.71 * other than that it already contains the element, it must throw 16.74/5.71 * an exception (rather than returning false). This preserves 16.74/5.71 * the invariant that a collection always contains the specified element 16.74/5.71 * after this call returns. 16.74/5.71 * 16.74/5.71 * @param e element whose presence in this collection is to be ensured 16.74/5.71 * @return true if this collection changed as a result of the 16.74/5.71 * call 16.74/5.71 * @throws UnsupportedOperationException if the add operation 16.74/5.71 * is not supported by this collection 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this collection 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * collection does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the element 16.74/5.71 * prevents it from being added to this collection 16.74/5.71 * @throws IllegalStateException if the element cannot be added at this 16.74/5.71 * time due to insertion restrictions 16.74/5.71 */ 16.74/5.71 boolean add(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes a single instance of the specified element from this 16.74/5.71 * collection, if it is present (optional operation). More formally, 16.74/5.71 * removes an element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)), if 16.74/5.71 * this collection contains one or more such elements. Returns 16.74/5.71 * true if this collection contained the specified element (or 16.74/5.71 * equivalently, if this collection changed as a result of the call). 16.74/5.71 * 16.74/5.71 * @param o element to be removed from this collection, if present 16.74/5.71 * @return true if an element was removed as a result of this call 16.74/5.71 * @throws ClassCastException if the type of the specified element 16.74/5.71 * is incompatible with this collection (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * collection does not permit null elements (optional) 16.74/5.71 * @throws UnsupportedOperationException if the remove operation 16.74/5.71 * is not supported by this collection 16.74/5.71 */ 16.74/5.71 boolean remove(Object o); 16.74/5.71 16.74/5.71 16.74/5.71 // Bulk Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns true if this collection contains all of the elements 16.74/5.71 * in the specified collection. 16.74/5.71 * 16.74/5.71 * @param c collection to be checked for containment in this collection 16.74/5.71 * @return true if this collection contains all of the elements 16.74/5.71 * in the specified collection 16.74/5.71 * @throws ClassCastException if the types of one or more elements 16.74/5.71 * in the specified collection are incompatible with this 16.74/5.71 * collection (optional) 16.74/5.71 * @throws NullPointerException if the specified collection contains one 16.74/5.71 * or more null elements and this collection does not permit null 16.74/5.71 * elements (optional), or if the specified collection is null 16.74/5.71 * @see #contains(Object) 16.74/5.71 */ 16.74/5.71 boolean containsAll(Collection c); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Adds all of the elements in the specified collection to this collection 16.74/5.71 * (optional operation). The behavior of this operation is undefined if 16.74/5.71 * the specified collection is modified while the operation is in progress. 16.74/5.71 * (This implies that the behavior of this call is undefined if the 16.74/5.71 * specified collection is this collection, and this collection is 16.74/5.71 * nonempty.) 16.74/5.71 * 16.74/5.71 * @param c collection containing elements to be added to this collection 16.74/5.71 * @return true if this collection changed as a result of the call 16.74/5.71 * @throws UnsupportedOperationException if the addAll operation 16.74/5.71 * is not supported by this collection 16.74/5.71 * @throws ClassCastException if the class of an element of the specified 16.74/5.71 * collection prevents it from being added to this collection 16.74/5.71 * @throws NullPointerException if the specified collection contains a 16.74/5.71 * null element and this collection does not permit null elements, 16.74/5.71 * or if the specified collection is null 16.74/5.71 * @throws IllegalArgumentException if some property of an element of the 16.74/5.71 * specified collection prevents it from being added to this 16.74/5.71 * collection 16.74/5.71 * @throws IllegalStateException if not all the elements can be added at 16.74/5.71 * this time due to insertion restrictions 16.74/5.71 * @see #add(Object) 16.74/5.71 */ 16.74/5.71 boolean addAll(Collection c); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes all of this collection's elements that are also contained in the 16.74/5.71 * specified collection (optional operation). After this call returns, 16.74/5.71 * this collection will contain no elements in common with the specified 16.74/5.71 * collection. 16.74/5.71 * 16.74/5.71 * @param c collection containing elements to be removed from this collection 16.74/5.71 * @return true if this collection changed as a result of the 16.74/5.71 * call 16.74/5.71 * @throws UnsupportedOperationException if the removeAll method 16.74/5.71 * is not supported by this collection 16.74/5.71 * @throws ClassCastException if the types of one or more elements 16.74/5.71 * in this collection are incompatible with the specified 16.74/5.71 * collection (optional) 16.74/5.71 * @throws NullPointerException if this collection contains one or more 16.74/5.71 * null elements and the specified collection does not support 16.74/5.71 * null elements (optional), or if the specified collection is null 16.74/5.71 * @see #remove(Object) 16.74/5.71 * @see #contains(Object) 16.74/5.71 */ 16.74/5.71 boolean removeAll(Collection c); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retains only the elements in this collection that are contained in the 16.74/5.71 * specified collection (optional operation). In other words, removes from 16.74/5.71 * this collection all of its elements that are not contained in the 16.74/5.71 * specified collection. 16.74/5.71 * 16.74/5.71 * @param c collection containing elements to be retained in this collection 16.74/5.71 * @return true if this collection changed as a result of the call 16.74/5.71 * @throws UnsupportedOperationException if the retainAll operation 16.74/5.71 * is not supported by this collection 16.74/5.71 * @throws ClassCastException if the types of one or more elements 16.74/5.71 * in this collection are incompatible with the specified 16.74/5.71 * collection (optional) 16.74/5.71 * @throws NullPointerException if this collection contains one or more 16.74/5.71 * null elements and the specified collection does not permit null 16.74/5.71 * elements (optional), or if the specified collection is null 16.74/5.71 * @see #remove(Object) 16.74/5.71 * @see #contains(Object) 16.74/5.71 */ 16.74/5.71 boolean retainAll(Collection c); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes all of the elements from this collection (optional operation). 16.74/5.71 * The collection will be empty after this method returns. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException if the clear operation 16.74/5.71 * is not supported by this collection 16.74/5.71 */ 16.74/5.71 void clear(); 16.74/5.71 16.74/5.71 16.74/5.71 // Comparison and hashing 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Compares the specified object with this collection for equality.

16.74/5.71 * 16.74/5.71 * While the Collection interface adds no stipulations to the 16.74/5.71 * general contract for the Object.equals, programmers who 16.74/5.71 * implement the Collection interface "directly" (in other words, 16.74/5.71 * create a class that is a Collection but is not a Set 16.74/5.71 * or a List) must exercise care if they choose to override the 16.74/5.71 * Object.equals. It is not necessary to do so, and the simplest 16.74/5.71 * course of action is to rely on Object's implementation, but 16.74/5.71 * the implementor may wish to implement a "value comparison" in place of 16.74/5.71 * the default "reference comparison." (The List and 16.74/5.71 * Set interfaces mandate such value comparisons.)

16.74/5.71 * 16.74/5.71 * The general contract for the Object.equals method states that 16.74/5.71 * equals must be symmetric (in other words, a.equals(b) if and 16.74/5.71 * only if b.equals(a)). The contracts for List.equals 16.74/5.71 * and Set.equals state that lists are only equal to other lists, 16.74/5.71 * and sets to other sets. Thus, a custom equals method for a 16.74/5.71 * collection class that implements neither the List nor 16.74/5.71 * Set interface must return false when this collection 16.74/5.71 * is compared to any list or set. (By the same logic, it is not possible 16.74/5.71 * to write a class that correctly implements both the Set and 16.74/5.71 * List interfaces.) 16.74/5.71 * 16.74/5.71 * @param o object to be compared for equality with this collection 16.74/5.71 * @return true if the specified object is equal to this 16.74/5.71 * collection 16.74/5.71 * 16.74/5.71 * @see Object#equals(Object) 16.74/5.71 * @see Set#equals(Object) 16.74/5.71 * @see List#equals(Object) 16.74/5.71 */ 16.74/5.71 boolean equals(Object o); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the hash code value for this collection. While the 16.74/5.71 * Collection interface adds no stipulations to the general 16.74/5.71 * contract for the Object.hashCode method, programmers should 16.74/5.71 * take note that any class that overrides the Object.equals 16.74/5.71 * method must also override the Object.hashCode method in order 16.74/5.71 * to satisfy the general contract for the Object.hashCodemethod. 16.74/5.71 * In particular, c1.equals(c2) implies that 16.74/5.71 * c1.hashCode()==c2.hashCode(). 16.74/5.71 * 16.74/5.71 * @return the hash code value for this collection 16.74/5.71 * 16.74/5.71 * @see Object#hashCode() 16.74/5.71 * @see Object#equals(Object) 16.74/5.71 */ 16.74/5.71 int hashCode(); 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * This exception may be thrown by methods that have detected concurrent 16.74/5.71 * modification of an object when such modification is not permissible. 16.74/5.71 *

16.74/5.71 * For example, it is not generally permissible for one thread to modify a Collection 16.74/5.71 * while another thread is iterating over it. In general, the results of the 16.74/5.71 * iteration are undefined under these circumstances. Some Iterator 16.74/5.71 * implementations (including those of all the general purpose collection implementations 16.74/5.71 * provided by the JRE) may choose to throw this exception if this behavior is 16.74/5.71 * detected. Iterators that do this are known as fail-fast iterators, 16.74/5.71 * as they fail quickly and cleanly, rather that risking arbitrary, 16.74/5.71 * non-deterministic behavior at an undetermined time in the future. 16.74/5.71 *

16.74/5.71 * Note that this exception does not always indicate that an object has 16.74/5.71 * been concurrently modified by a different thread. If a single 16.74/5.71 * thread issues a sequence of method invocations that violates the 16.74/5.71 * contract of an object, the object may throw this exception. For 16.74/5.71 * example, if a thread modifies a collection directly while it is 16.74/5.71 * iterating over the collection with a fail-fast iterator, the iterator 16.74/5.71 * will throw this exception. 16.74/5.71 * 16.74/5.71 *

Note that fail-fast behavior cannot be guaranteed as it is, generally 16.74/5.71 * speaking, impossible to make any hard guarantees in the presence of 16.74/5.71 * unsynchronized concurrent modification. Fail-fast operations 16.74/5.71 * throw ConcurrentModificationException on a best-effort basis. 16.74/5.71 * Therefore, it would be wrong to write a program that depended on this 16.74/5.71 * exception for its correctness: ConcurrentModificationException 16.74/5.71 * should be used only to detect bugs. 16.74/5.71 * 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @see Collection 16.74/5.71 * @see Iterator 16.74/5.71 * @see ListIterator 16.74/5.71 * @see Vector 16.74/5.71 * @see LinkedList 16.74/5.71 * @see HashSet 16.74/5.71 * @see Hashtable 16.74/5.71 * @see TreeMap 16.74/5.71 * @see AbstractList 16.74/5.71 * @since 1.2 16.74/5.71 */ 16.74/5.71 public class ConcurrentModificationException extends RuntimeException { 16.74/5.71 /** 16.74/5.71 * Constructs a ConcurrentModificationException with no 16.74/5.71 * detail message. 16.74/5.71 */ 16.74/5.71 public ConcurrentModificationException() { 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a ConcurrentModificationException with the 16.74/5.71 * specified detail message. 16.74/5.71 * 16.74/5.71 * @param message the detail message pertaining to this exception. 16.74/5.71 */ 16.74/5.71 public ConcurrentModificationException(String message) { 16.74/5.71 super(message); 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 /* 16.74/5.71 * This file is available under and governed by the GNU General Public 16.74/5.71 * License version 2 only, as published by the Free Software Foundation. 16.74/5.71 * However, the following notice accompanied the original version of this 16.74/5.71 * file: 16.74/5.71 * 16.74/5.71 * Written by Doug Lea and Josh Bloch with assistance from members of 16.74/5.71 * JCP JSR-166 Expert Group and released to the public domain, as explained 16.74/5.71 * at http://creativecommons.org/licenses/publicdomain 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * A linear collection that supports element insertion and removal at 16.74/5.71 * both ends. The name deque is short for "double ended queue" 16.74/5.71 * and is usually pronounced "deck". Most Deque 16.74/5.71 * implementations place no fixed limits on the number of elements 16.74/5.71 * they may contain, but this interface supports capacity-restricted 16.74/5.71 * deques as well as those with no fixed size limit. 16.74/5.71 * 16.74/5.71 *

This interface defines methods to access the elements at both 16.74/5.71 * ends of the deque. Methods are provided to insert, remove, and 16.74/5.71 * examine the element. Each of these methods exists in two forms: 16.74/5.71 * one throws an exception if the operation fails, the other returns a 16.74/5.71 * special value (either null or false, depending on 16.74/5.71 * the operation). The latter form of the insert operation is 16.74/5.71 * designed specifically for use with capacity-restricted 16.74/5.71 * Deque implementations; in most implementations, insert 16.74/5.71 * operations cannot fail. 16.74/5.71 * 16.74/5.71 *

The twelve methods described above are summarized in the 16.74/5.71 * following table: 16.74/5.71 * 16.74/5.71 *

16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 *
First Element (Head) Last Element (Tail)
Throws exceptionSpecial valueThrows exceptionSpecial value
Insert{@link #addFirst addFirst(e)}{@link #offerFirst offerFirst(e)}{@link #addLast addLast(e)}{@link #offerLast offerLast(e)}
Remove{@link #removeFirst removeFirst()}{@link #pollFirst pollFirst()}{@link #removeLast removeLast()}{@link #pollLast pollLast()}
Examine{@link #getFirst getFirst()}{@link #peekFirst peekFirst()}{@link #getLast getLast()}{@link #peekLast peekLast()}
16.74/5.71 * 16.74/5.71 *

This interface extends the {@link Queue} interface. When a deque is 16.74/5.71 * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are 16.74/5.71 * added at the end of the deque and removed from the beginning. The methods 16.74/5.71 * inherited from the Queue interface are precisely equivalent to 16.74/5.71 * Deque methods as indicated in the following table: 16.74/5.71 * 16.74/5.71 *

16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 *
Queue Method Equivalent Deque Method
{@link java.util.Queue#add add(e)}{@link #addLast addLast(e)}
{@link java.util.Queue#offer offer(e)}{@link #offerLast offerLast(e)}
{@link java.util.Queue#remove remove()}{@link #removeFirst removeFirst()}
{@link java.util.Queue#poll poll()}{@link #pollFirst pollFirst()}
{@link java.util.Queue#element element()}{@link #getFirst getFirst()}
{@link java.util.Queue#peek peek()}{@link #peek peekFirst()}
16.74/5.71 * 16.74/5.71 *

Deques can also be used as LIFO (Last-In-First-Out) stacks. This 16.74/5.71 * interface should be used in preference to the legacy {@link Stack} class. 16.74/5.71 * When a deque is used as a stack, elements are pushed and popped from the 16.74/5.71 * beginning of the deque. Stack methods are precisely equivalent to 16.74/5.71 * Deque methods as indicated in the table below: 16.74/5.71 * 16.74/5.71 *

16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 * 16.74/5.71 *
Stack Method Equivalent Deque Method
{@link #push push(e)}{@link #addFirst addFirst(e)}
{@link #pop pop()}{@link #removeFirst removeFirst()}
{@link #peek peek()}{@link #peekFirst peekFirst()}
16.74/5.71 * 16.74/5.71 *

Note that the {@link #peek peek} method works equally well when 16.74/5.71 * a deque is used as a queue or a stack; in either case, elements are 16.74/5.71 * drawn from the beginning of the deque. 16.74/5.71 * 16.74/5.71 *

This interface provides two methods to remove interior 16.74/5.71 * elements, {@link #removeFirstOccurrence removeFirstOccurrence} and 16.74/5.71 * {@link #removeLastOccurrence removeLastOccurrence}. 16.74/5.71 * 16.74/5.71 *

Unlike the {@link List} interface, this interface does not 16.74/5.71 * provide support for indexed access to elements. 16.74/5.71 * 16.74/5.71 *

While Deque implementations are not strictly required 16.74/5.71 * to prohibit the insertion of null elements, they are strongly 16.74/5.71 * encouraged to do so. Users of any Deque implementations 16.74/5.71 * that do allow null elements are strongly encouraged not to 16.74/5.71 * take advantage of the ability to insert nulls. This is so because 16.74/5.71 * null is used as a special return value by various methods 16.74/5.71 * to indicated that the deque is empty. 16.74/5.71 * 16.74/5.71 *

Deque implementations generally do not define 16.74/5.71 * element-based versions of the equals and hashCode 16.74/5.71 * methods, but instead inherit the identity-based versions from class 16.74/5.71 * Object. 16.74/5.71 * 16.74/5.71 *

This interface is a member of the Java Collections 16.74/5.71 * Framework. 16.74/5.71 * 16.74/5.71 * @author Doug Lea 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @since 1.6 16.74/5.71 * @param the type of elements held in this collection 16.74/5.71 */ 16.74/5.71 16.74/5.71 public interface Deque extends Queue { 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the front of this deque if it is 16.74/5.71 * possible to do so immediately without violating capacity restrictions. 16.74/5.71 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.71 * use method {@link #offerFirst}. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @throws IllegalStateException if the element cannot be added at this 16.74/5.71 * time due to capacity restrictions 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 void addFirst(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the end of this deque if it is 16.74/5.71 * possible to do so immediately without violating capacity restrictions. 16.74/5.71 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.71 * use method {@link #offerLast}. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #add}. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @throws IllegalStateException if the element cannot be added at this 16.74/5.71 * time due to capacity restrictions 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 void addLast(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the front of this deque unless it would 16.74/5.71 * violate capacity restrictions. When using a capacity-restricted deque, 16.74/5.71 * this method is generally preferable to the {@link #addFirst} method, 16.74/5.71 * which can fail to insert an element only by throwing an exception. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @return true if the element was added to this deque, else 16.74/5.71 * false 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 boolean offerFirst(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the end of this deque unless it would 16.74/5.71 * violate capacity restrictions. When using a capacity-restricted deque, 16.74/5.71 * this method is generally preferable to the {@link #addLast} method, 16.74/5.71 * which can fail to insert an element only by throwing an exception. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @return true if the element was added to this deque, else 16.74/5.71 * false 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 boolean offerLast(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the first element of this deque. This method 16.74/5.71 * differs from {@link #pollFirst pollFirst} only in that it throws an 16.74/5.71 * exception if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the head of this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E removeFirst(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the last element of this deque. This method 16.74/5.71 * differs from {@link #pollLast pollLast} only in that it throws an 16.74/5.71 * exception if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the tail of this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E removeLast(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the first element of this deque, 16.74/5.71 * or returns null if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the head of this deque, or null if this deque is empty 16.74/5.71 */ 16.74/5.71 E pollFirst(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the last element of this deque, 16.74/5.71 * or returns null if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the tail of this deque, or null if this deque is empty 16.74/5.71 */ 16.74/5.71 E pollLast(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the first element of this deque. 16.74/5.71 * 16.74/5.71 * This method differs from {@link #peekFirst peekFirst} only in that it 16.74/5.71 * throws an exception if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the head of this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E getFirst(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the last element of this deque. 16.74/5.71 * This method differs from {@link #peekLast peekLast} only in that it 16.74/5.71 * throws an exception if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the tail of this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E getLast(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the first element of this deque, 16.74/5.71 * or returns null if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the head of this deque, or null if this deque is empty 16.74/5.71 */ 16.74/5.71 E peekFirst(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the last element of this deque, 16.74/5.71 * or returns null if this deque is empty. 16.74/5.71 * 16.74/5.71 * @return the tail of this deque, or null if this deque is empty 16.74/5.71 */ 16.74/5.71 E peekLast(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the first occurrence of the specified element from this deque. 16.74/5.71 * If the deque does not contain the element, it is unchanged. 16.74/5.71 * More formally, removes the first element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)) 16.74/5.71 * (if such an element exists). 16.74/5.71 * Returns true if this deque contained the specified element 16.74/5.71 * (or equivalently, if this deque changed as a result of the call). 16.74/5.71 * 16.74/5.71 * @param o element to be removed from this deque, if present 16.74/5.71 * @return true if an element was removed as a result of this call 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * is incompatible with this deque (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements (optional) 16.74/5.71 */ 16.74/5.71 boolean removeFirstOccurrence(Object o); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the last occurrence of the specified element from this deque. 16.74/5.71 * If the deque does not contain the element, it is unchanged. 16.74/5.71 * More formally, removes the last element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)) 16.74/5.71 * (if such an element exists). 16.74/5.71 * Returns true if this deque contained the specified element 16.74/5.71 * (or equivalently, if this deque changed as a result of the call). 16.74/5.71 * 16.74/5.71 * @param o element to be removed from this deque, if present 16.74/5.71 * @return true if an element was removed as a result of this call 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * is incompatible with this deque (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements (optional) 16.74/5.71 */ 16.74/5.71 boolean removeLastOccurrence(Object o); 16.74/5.71 16.74/5.71 // *** Queue methods *** 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element into the queue represented by this deque 16.74/5.71 * (in other words, at the tail of this deque) if it is possible to do so 16.74/5.71 * immediately without violating capacity restrictions, returning 16.74/5.71 * true upon success and throwing an 16.74/5.71 * IllegalStateException if no space is currently available. 16.74/5.71 * When using a capacity-restricted deque, it is generally preferable to 16.74/5.71 * use {@link #offer(Object) offer}. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #addLast}. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @return true (as specified by {@link Collection#add}) 16.74/5.71 * @throws IllegalStateException if the element cannot be added at this 16.74/5.71 * time due to capacity restrictions 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 boolean add(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element into the queue represented by this deque 16.74/5.71 * (in other words, at the tail of this deque) if it is possible to do so 16.74/5.71 * immediately without violating capacity restrictions, returning 16.74/5.71 * true upon success and false if no space is currently 16.74/5.71 * available. When using a capacity-restricted deque, this method is 16.74/5.71 * generally preferable to the {@link #add} method, which can fail to 16.74/5.71 * insert an element only by throwing an exception. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #offerLast}. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 * @return true if the element was added to this deque, else 16.74/5.71 * false 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 boolean offer(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the head of the queue represented by this deque 16.74/5.71 * (in other words, the first element of this deque). 16.74/5.71 * This method differs from {@link #poll poll} only in that it throws an 16.74/5.71 * exception if this deque is empty. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.71 * 16.74/5.71 * @return the head of the queue represented by this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E remove(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the head of the queue represented by this deque 16.74/5.71 * (in other words, the first element of this deque), or returns 16.74/5.71 * null if this deque is empty. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #pollFirst()}. 16.74/5.71 * 16.74/5.71 * @return the first element of this deque, or null if 16.74/5.71 * this deque is empty 16.74/5.71 */ 16.74/5.71 E poll(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the head of the queue represented by 16.74/5.71 * this deque (in other words, the first element of this deque). 16.74/5.71 * This method differs from {@link #peek peek} only in that it throws an 16.74/5.71 * exception if this deque is empty. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #getFirst()}. 16.74/5.71 * 16.74/5.71 * @return the head of the queue represented by this deque 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E element(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the head of the queue represented by 16.74/5.71 * this deque (in other words, the first element of this deque), or 16.74/5.71 * returns null if this deque is empty. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #peekFirst()}. 16.74/5.71 * 16.74/5.71 * @return the head of the queue represented by this deque, or 16.74/5.71 * null if this deque is empty 16.74/5.71 */ 16.74/5.71 E peek(); 16.74/5.71 16.74/5.71 16.74/5.71 // *** Stack methods *** 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Pushes an element onto the stack represented by this deque (in other 16.74/5.71 * words, at the head of this deque) if it is possible to do so 16.74/5.71 * immediately without violating capacity restrictions, returning 16.74/5.71 * true upon success and throwing an 16.74/5.71 * IllegalStateException if no space is currently available. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #addFirst}. 16.74/5.71 * 16.74/5.71 * @param e the element to push 16.74/5.71 * @throws IllegalStateException if the element cannot be added at this 16.74/5.71 * time due to capacity restrictions 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * prevents it from being added to this deque 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements 16.74/5.71 * @throws IllegalArgumentException if some property of the specified 16.74/5.71 * element prevents it from being added to this deque 16.74/5.71 */ 16.74/5.71 void push(E e); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Pops an element from the stack represented by this deque. In other 16.74/5.71 * words, removes and returns the first element of this deque. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.71 * 16.74/5.71 * @return the element at the front of this deque (which is the top 16.74/5.71 * of the stack represented by this deque) 16.74/5.71 * @throws NoSuchElementException if this deque is empty 16.74/5.71 */ 16.74/5.71 E pop(); 16.74/5.71 16.74/5.71 16.74/5.71 // *** Collection methods *** 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the first occurrence of the specified element from this deque. 16.74/5.71 * If the deque does not contain the element, it is unchanged. 16.74/5.71 * More formally, removes the first element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)) 16.74/5.71 * (if such an element exists). 16.74/5.71 * Returns true if this deque contained the specified element 16.74/5.71 * (or equivalently, if this deque changed as a result of the call). 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #removeFirstOccurrence}. 16.74/5.71 * 16.74/5.71 * @param o element to be removed from this deque, if present 16.74/5.71 * @return true if an element was removed as a result of this call 16.74/5.71 * @throws ClassCastException if the class of the specified element 16.74/5.71 * is incompatible with this deque (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements (optional) 16.74/5.71 */ 16.74/5.71 boolean remove(Object o); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns true if this deque contains the specified element. 16.74/5.71 * More formally, returns true if and only if this deque contains 16.74/5.71 * at least one element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)). 16.74/5.71 * 16.74/5.71 * @param o element whose presence in this deque is to be tested 16.74/5.71 * @return true if this deque contains the specified element 16.74/5.71 * @throws ClassCastException if the type of the specified element 16.74/5.71 * is incompatible with this deque (optional) 16.74/5.71 * @throws NullPointerException if the specified element is null and this 16.74/5.71 * deque does not permit null elements (optional) 16.74/5.71 */ 16.74/5.71 boolean contains(Object o); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the number of elements in this deque. 16.74/5.71 * 16.74/5.71 * @return the number of elements in this deque 16.74/5.71 */ 16.74/5.71 public int size(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns an iterator over the elements in this deque in proper sequence. 16.74/5.71 * The elements will be returned in order from first (head) to last (tail). 16.74/5.71 * 16.74/5.71 * @return an iterator over the elements in this deque in proper sequence 16.74/5.71 */ 16.74/5.71 Iterator iterator(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns an iterator over the elements in this deque in reverse 16.74/5.71 * sequential order. The elements will be returned in order from 16.74/5.71 * last (tail) to first (head). 16.74/5.71 * 16.74/5.71 * @return an iterator over the elements in this deque in reverse 16.74/5.71 * sequence 16.74/5.71 */ 16.74/5.71 Iterator descendingIterator(); 16.74/5.71 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Thrown to indicate that a method has been passed an illegal or 16.74/5.71 * inappropriate argument. 16.74/5.71 * 16.74/5.71 * @author unascribed 16.74/5.71 * @see java.lang.Thread#setPriority(int) 16.74/5.71 * @since JDK1.0 16.74/5.71 */ 16.74/5.71 public 16.74/5.71 class IllegalArgumentException extends RuntimeException { 16.74/5.71 /** 16.74/5.71 * Constructs an IllegalArgumentException with no 16.74/5.71 * detail message. 16.74/5.71 */ 16.74/5.71 public IllegalArgumentException() { 16.74/5.71 super(); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs an IllegalArgumentException with the 16.74/5.71 * specified detail message. 16.74/5.71 * 16.74/5.71 * @param s the detail message. 16.74/5.71 */ 16.74/5.71 public IllegalArgumentException(String s) { 16.74/5.71 super(s); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a new exception with the specified detail message and 16.74/5.71 * cause. 16.74/5.71 * 16.74/5.71 *

Note that the detail message associated with cause is 16.74/5.71 * not automatically incorporated in this exception's detail 16.74/5.71 * message. 16.74/5.71 * 16.74/5.71 * @param message the detail message (which is saved for later retrieval 16.74/5.71 * by the {@link Throwable#getMessage()} method). 16.74/5.71 * @param cause the cause (which is saved for later retrieval by the 16.74/5.71 * {@link Throwable#getCause()} method). (A null value 16.74/5.71 * is permitted, and indicates that the cause is nonexistent or 16.74/5.71 * unknown.) 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public IllegalArgumentException(String message, Throwable cause) { 16.74/5.71 super(message, cause); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a new exception with the specified cause and a detail 16.74/5.71 * message of (cause==null ? null : cause.toString()) (which 16.74/5.71 * typically contains the class and detail message of cause). 16.74/5.71 * This constructor is useful for exceptions that are little more than 16.74/5.71 * wrappers for other throwables (for example, {@link 16.74/5.71 * java.security.PrivilegedActionException}). 16.74/5.71 * 16.74/5.71 * @param cause the cause (which is saved for later retrieval by the 16.74/5.71 * {@link Throwable#getCause()} method). (A null value is 16.74/5.71 * permitted, and indicates that the cause is nonexistent or 16.74/5.71 * unknown.) 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public IllegalArgumentException(Throwable cause) { 16.74/5.71 super(cause); 16.74/5.71 } 16.74/5.71 16.74/5.71 private static final long serialVersionUID = -5365630128856068164L; 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1996-2003 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Signals that a method has been invoked at an illegal or 16.74/5.71 * inappropriate time. In other words, the Java environment or 16.74/5.71 * Java application is not in an appropriate state for the requested 16.74/5.71 * operation. 16.74/5.71 * 16.74/5.71 * @author Jonni Kanerva 16.74/5.71 * @since JDK1.1 16.74/5.71 */ 16.74/5.71 public 16.74/5.71 class IllegalStateException extends RuntimeException { 16.74/5.71 /** 16.74/5.71 * Constructs an IllegalStateException with no detail message. 16.74/5.71 * A detail message is a String that describes this particular exception. 16.74/5.71 */ 16.74/5.71 public IllegalStateException() { 16.74/5.71 super(); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs an IllegalStateException with the specified detail 16.74/5.71 * message. A detail message is a String that describes this particular 16.74/5.71 * exception. 16.74/5.71 * 16.74/5.71 * @param s the String that contains a detailed message 16.74/5.71 */ 16.74/5.71 public IllegalStateException(String s) { 16.74/5.71 super(s); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a new exception with the specified detail message and 16.74/5.71 * cause. 16.74/5.71 * 16.74/5.71 *

Note that the detail message associated with cause is 16.74/5.71 * not automatically incorporated in this exception's detail 16.74/5.71 * message. 16.74/5.71 * 16.74/5.71 * @param message the detail message (which is saved for later retrieval 16.74/5.71 * by the {@link Throwable#getMessage()} method). 16.74/5.71 * @param cause the cause (which is saved for later retrieval by the 16.74/5.71 * {@link Throwable#getCause()} method). (A null value 16.74/5.71 * is permitted, and indicates that the cause is nonexistent or 16.74/5.71 * unknown.) 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public IllegalStateException(String message, Throwable cause) { 16.74/5.71 super(message, cause); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a new exception with the specified cause and a detail 16.74/5.71 * message of (cause==null ? null : cause.toString()) (which 16.74/5.71 * typically contains the class and detail message of cause). 16.74/5.71 * This constructor is useful for exceptions that are little more than 16.74/5.71 * wrappers for other throwables (for example, {@link 16.74/5.71 * java.security.PrivilegedActionException}). 16.74/5.71 * 16.74/5.71 * @param cause the cause (which is saved for later retrieval by the 16.74/5.71 * {@link Throwable#getCause()} method). (A null value is 16.74/5.71 * permitted, and indicates that the cause is nonexistent or 16.74/5.71 * unknown.) 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public IllegalStateException(Throwable cause) { 16.74/5.71 super(cause); 16.74/5.71 } 16.74/5.71 16.74/5.71 static final long serialVersionUID = -1848914673093119416L; 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * An iterator over a collection. {@code Iterator} takes the place of 16.74/5.71 * {@link Enumeration} in the Java Collections Framework. Iterators 16.74/5.71 * differ from enumerations in two ways: 16.74/5.71 * 16.74/5.71 *

16.74/5.71 * 16.74/5.71 *

This interface is a member of the 16.74/5.71 * 16.74/5.71 * Java Collections Framework. 16.74/5.71 * 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @see Collection 16.74/5.71 * @see ListIterator 16.74/5.71 * @see Iterable 16.74/5.71 * @since 1.2 16.74/5.71 */ 16.74/5.71 public interface Iterator { 16.74/5.71 /** 16.74/5.71 * Returns {@code true} if the iteration has more elements. 16.74/5.71 * (In other words, returns {@code true} if {@link #next} would 16.74/5.71 * return an element rather than throwing an exception.) 16.74/5.71 * 16.74/5.71 * @return {@code true} if the iteration has more elements 16.74/5.71 */ 16.74/5.71 boolean hasNext(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the next element in the iteration. 16.74/5.71 * 16.74/5.71 * @return the next element in the iteration 16.74/5.71 * @throws NoSuchElementException if the iteration has no more elements 16.74/5.71 */ 16.74/5.71 E next(); 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes from the underlying collection the last element returned 16.74/5.71 * by this iterator (optional operation). This method can be called 16.74/5.71 * only once per call to {@link #next}. The behavior of an iterator 16.74/5.71 * is unspecified if the underlying collection is modified while the 16.74/5.71 * iteration is in progress in any way other than by calling this 16.74/5.71 * method. 16.74/5.71 * 16.74/5.71 * @throws UnsupportedOperationException if the {@code remove} 16.74/5.71 * operation is not supported by this iterator 16.74/5.71 * 16.74/5.71 * @throws IllegalStateException if the {@code next} method has not 16.74/5.71 * yet been called, or the {@code remove} method has already 16.74/5.71 * been called after the last call to the {@code next} 16.74/5.71 * method 16.74/5.71 */ 16.74/5.71 void remove(); 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 public class juLinkedListCreatePollLast { 16.74/5.71 public static void main(String[] args) { 16.74/5.71 Random.args = args; 16.74/5.71 16.74/5.71 LinkedList l = createList(Random.random()); 16.74/5.71 l.pollLast(); 16.74/5.71 } 16.74/5.71 16.74/5.71 public static LinkedList createList(int n) { 16.74/5.71 LinkedList l = new LinkedList(); 16.74/5.71 while (n > 0) { 16.74/5.71 l.addLast(new Content(Random.random())); 16.74/5.71 n--; 16.74/5.71 } 16.74/5.71 return l; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 final class Content { 16.74/5.71 int val; 16.74/5.71 16.74/5.71 public Content(int v) { 16.74/5.71 this.val = v; 16.74/5.71 } 16.74/5.71 16.74/5.71 public int hashCode() { 16.74/5.71 return val^31; 16.74/5.71 } 16.74/5.71 16.74/5.71 public boolean equals(Object o) { 16.74/5.71 if (o instanceof Content) { 16.74/5.71 return this.val == ((Content) o).val; 16.74/5.71 } 16.74/5.71 return false; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 /* 16.74/5.71 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.71 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.71 * 16.74/5.71 * This code is free software; you can redistribute it and/or modify it 16.74/5.71 * under the terms of the GNU General Public License version 2 only, as 16.74/5.71 * published by the Free Software Foundation. Sun designates this 16.74/5.71 * particular file as subject to the "Classpath" exception as provided 16.74/5.71 * by Sun in the LICENSE file that accompanied this code. 16.74/5.71 * 16.74/5.71 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.71 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.71 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.71 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.71 * accompanied this code). 16.74/5.71 * 16.74/5.71 * You should have received a copy of the GNU General Public License version 16.74/5.71 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.71 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.71 * 16.74/5.71 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.71 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.71 * have any questions. 16.74/5.71 */ 16.74/5.71 16.74/5.71 package javaUtilEx; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Linked list implementation of the List interface. Implements all 16.74/5.71 * optional list operations, and permits all elements (including 16.74/5.71 * null). In addition to implementing the List interface, 16.74/5.71 * the LinkedList class provides uniformly named methods to 16.74/5.71 * get, remove and insert an element at the 16.74/5.71 * beginning and end of the list. These operations allow linked lists to be 16.74/5.71 * used as a stack, {@linkplain Queue queue}, or {@linkplain Deque 16.74/5.71 * double-ended queue}.

16.74/5.71 * 16.74/5.71 * The class implements the Deque interface, providing 16.74/5.71 * first-in-first-out queue operations for add, 16.74/5.71 * poll, along with other stack and deque operations.

16.74/5.71 * 16.74/5.71 * All of the operations perform as could be expected for a doubly-linked 16.74/5.71 * list. Operations that index into the list will traverse the list from 16.74/5.71 * the beginning or the end, whichever is closer to the specified index.

16.74/5.71 * 16.74/5.71 *

Note that this implementation is not synchronized. 16.74/5.71 * If multiple threads access a linked list concurrently, and at least 16.74/5.71 * one of the threads modifies the list structurally, it must be 16.74/5.71 * synchronized externally. (A structural modification is any operation 16.74/5.71 * that adds or deletes one or more elements; merely setting the value of 16.74/5.71 * an element is not a structural modification.) This is typically 16.74/5.71 * accomplished by synchronizing on some object that naturally 16.74/5.71 * encapsulates the list. 16.74/5.71 * 16.74/5.71 * If no such object exists, the list should be "wrapped" using the 16.74/5.71 * {@link Collections#synchronizedList Collections.synchronizedList} 16.74/5.71 * method. This is best done at creation time, to prevent accidental 16.74/5.71 * unsynchronized access to the list:

16.74/5.71	 *   List list = Collections.synchronizedList(new LinkedList(...));
16.74/5.71 * 16.74/5.71 *

The iterators returned by this class's iterator and 16.74/5.71 * listIterator methods are fail-fast: if the list is 16.74/5.71 * structurally modified at any time after the iterator is created, in 16.74/5.71 * any way except through the Iterator's own remove or 16.74/5.71 * add methods, the iterator will throw a {@link 16.74/5.71 * ConcurrentModificationException}. Thus, in the face of concurrent 16.74/5.71 * modification, the iterator fails quickly and cleanly, rather than 16.74/5.71 * risking arbitrary, non-deterministic behavior at an undetermined 16.74/5.71 * time in the future. 16.74/5.71 * 16.74/5.71 *

Note that the fail-fast behavior of an iterator cannot be guaranteed 16.74/5.71 * as it is, generally speaking, impossible to make any hard guarantees in the 16.74/5.71 * presence of unsynchronized concurrent modification. Fail-fast iterators 16.74/5.71 * throw ConcurrentModificationException on a best-effort basis. 16.74/5.71 * Therefore, it would be wrong to write a program that depended on this 16.74/5.71 * exception for its correctness: the fail-fast behavior of iterators 16.74/5.71 * should be used only to detect bugs. 16.74/5.71 * 16.74/5.71 *

This class is a member of the 16.74/5.71 * 16.74/5.71 * Java Collections Framework. 16.74/5.71 * 16.74/5.71 * @author Josh Bloch 16.74/5.71 * @see List 16.74/5.71 * @see ArrayList 16.74/5.71 * @see Vector 16.74/5.71 * @since 1.2 16.74/5.71 * @param the type of elements held in this collection 16.74/5.71 */ 16.74/5.71 16.74/5.71 public class LinkedList 16.74/5.71 extends AbstractSequentialList 16.74/5.71 implements List, Deque 16.74/5.71 { 16.74/5.71 private transient Entry header = new Entry(null, null, null); 16.74/5.71 private transient int size = 0; 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs an empty list. 16.74/5.71 */ 16.74/5.71 public LinkedList() { 16.74/5.71 header.next = header.previous = header; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Constructs a list containing the elements of the specified 16.74/5.71 * collection, in the order they are returned by the collection's 16.74/5.71 * iterator. 16.74/5.71 * 16.74/5.71 * @param c the collection whose elements are to be placed into this list 16.74/5.71 * @throws NullPointerException if the specified collection is null 16.74/5.71 */ 16.74/5.71 public LinkedList(Collection c) { 16.74/5.71 this(); 16.74/5.71 addAll(c); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the first element in this list. 16.74/5.71 * 16.74/5.71 * @return the first element in this list 16.74/5.71 * @throws NoSuchElementException if this list is empty 16.74/5.71 */ 16.74/5.71 public E getFirst() { 16.74/5.71 if (size==0) 16.74/5.71 throw new NoSuchElementException(); 16.74/5.71 16.74/5.71 return header.next.element; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the last element in this list. 16.74/5.71 * 16.74/5.71 * @return the last element in this list 16.74/5.71 * @throws NoSuchElementException if this list is empty 16.74/5.71 */ 16.74/5.71 public E getLast() { 16.74/5.71 if (size==0) 16.74/5.71 throw new NoSuchElementException(); 16.74/5.71 16.74/5.71 return header.previous.element; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes and returns the first element from this list. 16.74/5.71 * 16.74/5.71 * @return the first element from this list 16.74/5.71 * @throws NoSuchElementException if this list is empty 16.74/5.71 */ 16.74/5.71 public E removeFirst() { 16.74/5.71 return remove(header.next); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes and returns the last element from this list. 16.74/5.71 * 16.74/5.71 * @return the last element from this list 16.74/5.71 * @throws NoSuchElementException if this list is empty 16.74/5.71 */ 16.74/5.71 public E removeLast() { 16.74/5.71 return remove(header.previous); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the beginning of this list. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 */ 16.74/5.71 public void addFirst(E e) { 16.74/5.71 addBefore(e, header.next); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Appends the specified element to the end of this list. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #add}. 16.74/5.71 * 16.74/5.71 * @param e the element to add 16.74/5.71 */ 16.74/5.71 public void addLast(E e) { 16.74/5.71 addBefore(e, header); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns true if this list contains the specified element. 16.74/5.71 * More formally, returns true if and only if this list contains 16.74/5.71 * at least one element e such that 16.74/5.71 * (o==null ? e==null : o.equals(e)). 16.74/5.71 * 16.74/5.71 * @param o element whose presence in this list is to be tested 16.74/5.71 * @return true if this list contains the specified element 16.74/5.71 */ 16.74/5.71 public boolean contains(Object o) { 16.74/5.71 return indexOf(o) != -1; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the number of elements in this list. 16.74/5.71 * 16.74/5.71 * @return the number of elements in this list 16.74/5.71 */ 16.74/5.71 public int size() { 16.74/5.71 return size; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Appends the specified element to the end of this list. 16.74/5.71 * 16.74/5.71 *

This method is equivalent to {@link #addLast}. 16.74/5.71 * 16.74/5.71 * @param e element to be appended to this list 16.74/5.71 * @return true (as specified by {@link Collection#add}) 16.74/5.71 */ 16.74/5.71 public boolean add(E e) { 16.74/5.71 addBefore(e, header); 16.74/5.71 return true; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the first occurrence of the specified element from this list, 16.74/5.71 * if it is present. If this list does not contain the element, it is 16.74/5.71 * unchanged. More formally, removes the element with the lowest index 16.74/5.71 * i such that 16.74/5.71 * (o==null ? get(i)==null : o.equals(get(i))) 16.74/5.71 * (if such an element exists). Returns true if this list 16.74/5.71 * contained the specified element (or equivalently, if this list 16.74/5.71 * changed as a result of the call). 16.74/5.71 * 16.74/5.71 * @param o element to be removed from this list, if present 16.74/5.71 * @return true if this list contained the specified element 16.74/5.71 */ 16.74/5.71 public boolean remove(Object o) { 16.74/5.71 if (o==null) { 16.74/5.71 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.71 if (e.element==null) { 16.74/5.71 remove(e); 16.74/5.71 return true; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 } else { 16.74/5.71 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.71 if (o.equals(e.element)) { 16.74/5.71 remove(e); 16.74/5.71 return true; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 } 16.74/5.71 return false; 16.74/5.71 } 16.74/5.71 /** 16.74/5.71 * Removes all of the elements from this list. 16.74/5.71 */ 16.74/5.71 public void clear() { 16.74/5.71 Entry e = header.next; 16.74/5.71 while (e != header) { 16.74/5.71 Entry next = e.next; 16.74/5.71 e.next = e.previous = null; 16.74/5.71 e.element = null; 16.74/5.71 e = next; 16.74/5.71 } 16.74/5.71 header.next = header.previous = header; 16.74/5.71 size = 0; 16.74/5.71 modCount++; 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 // Positional Access Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the element at the specified position in this list. 16.74/5.71 * 16.74/5.71 * @param index index of the element to return 16.74/5.71 * @return the element at the specified position in this list 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E get(int index) { 16.74/5.71 return entry(index).element; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Replaces the element at the specified position in this list with the 16.74/5.71 * specified element. 16.74/5.71 * 16.74/5.71 * @param index index of the element to replace 16.74/5.71 * @param element element to be stored at the specified position 16.74/5.71 * @return the element previously at the specified position 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E set(int index, E element) { 16.74/5.71 Entry e = entry(index); 16.74/5.71 E oldVal = e.element; 16.74/5.71 e.element = element; 16.74/5.71 return oldVal; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Inserts the specified element at the specified position in this list. 16.74/5.71 * Shifts the element currently at that position (if any) and any 16.74/5.71 * subsequent elements to the right (adds one to their indices). 16.74/5.71 * 16.74/5.71 * @param index index at which the specified element is to be inserted 16.74/5.71 * @param element element to be inserted 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public void add(int index, E element) { 16.74/5.71 addBefore(element, (index==size ? header : entry(index))); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Removes the element at the specified position in this list. Shifts any 16.74/5.71 * subsequent elements to the left (subtracts one from their indices). 16.74/5.71 * Returns the element that was removed from the list. 16.74/5.71 * 16.74/5.71 * @param index the index of the element to be removed 16.74/5.71 * @return the element previously at the specified position 16.74/5.71 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.71 */ 16.74/5.71 public E remove(int index) { 16.74/5.71 return remove(entry(index)); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the indexed entry. 16.74/5.71 */ 16.74/5.71 private Entry entry(int index) { 16.74/5.71 if (index < 0 || index >= size) 16.74/5.71 throw new IndexOutOfBoundsException(); 16.74/5.71 Entry e = header; 16.74/5.71 if (index < (size >> 1)) { 16.74/5.71 for (int i = 0; i <= index; i++) 16.74/5.71 e = e.next; 16.74/5.71 } else { 16.74/5.71 for (int i = size; i > index; i--) 16.74/5.71 e = e.previous; 16.74/5.71 } 16.74/5.71 return e; 16.74/5.71 } 16.74/5.71 16.74/5.71 16.74/5.71 // Search Operations 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the index of the first occurrence of the specified element 16.74/5.71 * in this list, or -1 if this list does not contain the element. 16.74/5.71 * More formally, returns the lowest index i such that 16.74/5.71 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.71 * or -1 if there is no such index. 16.74/5.71 * 16.74/5.71 * @param o element to search for 16.74/5.71 * @return the index of the first occurrence of the specified element in 16.74/5.71 * this list, or -1 if this list does not contain the element 16.74/5.71 */ 16.74/5.71 public int indexOf(Object o) { 16.74/5.71 int index = 0; 16.74/5.71 if (o==null) { 16.74/5.71 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.71 if (e.element==null) 16.74/5.71 return index; 16.74/5.71 index++; 16.74/5.71 } 16.74/5.71 } else { 16.74/5.71 for (Entry e = header.next; e != header; e = e.next) { 16.74/5.71 if (o.equals(e.element)) 16.74/5.71 return index; 16.74/5.71 index++; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 return -1; 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Returns the index of the last occurrence of the specified element 16.74/5.71 * in this list, or -1 if this list does not contain the element. 16.74/5.71 * More formally, returns the highest index i such that 16.74/5.71 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.71 * or -1 if there is no such index. 16.74/5.71 * 16.74/5.71 * @param o element to search for 16.74/5.71 * @return the index of the last occurrence of the specified element in 16.74/5.71 * this list, or -1 if this list does not contain the element 16.74/5.71 */ 16.74/5.71 public int lastIndexOf(Object o) { 16.74/5.71 int index = size; 16.74/5.71 if (o==null) { 16.74/5.71 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.71 index--; 16.74/5.71 if (e.element==null) 16.74/5.71 return index; 16.74/5.71 } 16.74/5.71 } else { 16.74/5.71 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.71 index--; 16.74/5.71 if (o.equals(e.element)) 16.74/5.71 return index; 16.74/5.71 } 16.74/5.71 } 16.74/5.71 return -1; 16.74/5.71 } 16.74/5.71 16.74/5.71 // Queue operations. 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the head (first element) of this list. 16.74/5.71 * @return the head of this list, or null if this list is empty 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public E peek() { 16.74/5.71 if (size==0) 16.74/5.71 return null; 16.74/5.71 return getFirst(); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves, but does not remove, the head (first element) of this list. 16.74/5.71 * @return the head of this list 16.74/5.71 * @throws NoSuchElementException if this list is empty 16.74/5.71 * @since 1.5 16.74/5.71 */ 16.74/5.71 public E element() { 16.74/5.71 return getFirst(); 16.74/5.71 } 16.74/5.71 16.74/5.71 /** 16.74/5.71 * Retrieves and removes the head (first element) of this list 16.74/5.71 * @return the head of this list, or null if this list is empty 16.74/5.72 * @since 1.5 16.74/5.72 */ 16.74/5.72 public E poll() { 16.74/5.72 if (size==0) 16.74/5.72 return null; 16.74/5.72 return removeFirst(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves and removes the head (first element) of this list. 16.74/5.72 * 16.74/5.72 * @return the head of this list 16.74/5.72 * @throws NoSuchElementException if this list is empty 16.74/5.72 * @since 1.5 16.74/5.72 */ 16.74/5.72 public E remove() { 16.74/5.72 return removeFirst(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Adds the specified element as the tail (last element) of this list. 16.74/5.72 * 16.74/5.72 * @param e the element to add 16.74/5.72 * @return true (as specified by {@link Queue#offer}) 16.74/5.72 * @since 1.5 16.74/5.72 */ 16.74/5.72 public boolean offer(E e) { 16.74/5.72 return add(e); 16.74/5.72 } 16.74/5.72 16.74/5.72 // Deque operations 16.74/5.72 /** 16.74/5.72 * Inserts the specified element at the front of this list. 16.74/5.72 * 16.74/5.72 * @param e the element to insert 16.74/5.72 * @return true (as specified by {@link Deque#offerFirst}) 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public boolean offerFirst(E e) { 16.74/5.72 addFirst(e); 16.74/5.72 return true; 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Inserts the specified element at the end of this list. 16.74/5.72 * 16.74/5.72 * @param e the element to insert 16.74/5.72 * @return true (as specified by {@link Deque#offerLast}) 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public boolean offerLast(E e) { 16.74/5.72 addLast(e); 16.74/5.72 return true; 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves, but does not remove, the first element of this list, 16.74/5.72 * or returns null if this list is empty. 16.74/5.72 * 16.74/5.72 * @return the first element of this list, or null 16.74/5.72 * if this list is empty 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public E peekFirst() { 16.74/5.72 if (size==0) 16.74/5.72 return null; 16.74/5.72 return getFirst(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves, but does not remove, the last element of this list, 16.74/5.72 * or returns null if this list is empty. 16.74/5.72 * 16.74/5.72 * @return the last element of this list, or null 16.74/5.72 * if this list is empty 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public E peekLast() { 16.74/5.72 if (size==0) 16.74/5.72 return null; 16.74/5.72 return getLast(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves and removes the first element of this list, 16.74/5.72 * or returns null if this list is empty. 16.74/5.72 * 16.74/5.72 * @return the first element of this list, or null if 16.74/5.72 * this list is empty 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public E pollFirst() { 16.74/5.72 if (size==0) 16.74/5.72 return null; 16.74/5.72 return removeFirst(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves and removes the last element of this list, 16.74/5.72 * or returns null if this list is empty. 16.74/5.72 * 16.74/5.72 * @return the last element of this list, or null if 16.74/5.72 * this list is empty 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public E pollLast() { 16.74/5.72 if (size==0) 16.74/5.72 return null; 16.74/5.72 return removeLast(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Pushes an element onto the stack represented by this list. In other 16.74/5.72 * words, inserts the element at the front of this list. 16.74/5.72 * 16.74/5.72 *

This method is equivalent to {@link #addFirst}. 16.74/5.72 * 16.74/5.72 * @param e the element to push 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public void push(E e) { 16.74/5.72 addFirst(e); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Pops an element from the stack represented by this list. In other 16.74/5.72 * words, removes and returns the first element of this list. 16.74/5.72 * 16.74/5.72 *

This method is equivalent to {@link #removeFirst()}. 16.74/5.72 * 16.74/5.72 * @return the element at the front of this list (which is the top 16.74/5.72 * of the stack represented by this list) 16.74/5.72 * @throws NoSuchElementException if this list is empty 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public E pop() { 16.74/5.72 return removeFirst(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes the first occurrence of the specified element in this 16.74/5.72 * list (when traversing the list from head to tail). If the list 16.74/5.72 * does not contain the element, it is unchanged. 16.74/5.72 * 16.74/5.72 * @param o element to be removed from this list, if present 16.74/5.72 * @return true if the list contained the specified element 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public boolean removeFirstOccurrence(Object o) { 16.74/5.72 return remove(o); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes the last occurrence of the specified element in this 16.74/5.72 * list (when traversing the list from head to tail). If the list 16.74/5.72 * does not contain the element, it is unchanged. 16.74/5.72 * 16.74/5.72 * @param o element to be removed from this list, if present 16.74/5.72 * @return true if the list contained the specified element 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public boolean removeLastOccurrence(Object o) { 16.74/5.72 if (o==null) { 16.74/5.72 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.72 if (e.element==null) { 16.74/5.72 remove(e); 16.74/5.72 return true; 16.74/5.72 } 16.74/5.72 } 16.74/5.72 } else { 16.74/5.72 for (Entry e = header.previous; e != header; e = e.previous) { 16.74/5.72 if (o.equals(e.element)) { 16.74/5.72 remove(e); 16.74/5.72 return true; 16.74/5.72 } 16.74/5.72 } 16.74/5.72 } 16.74/5.72 return false; 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns a list-iterator of the elements in this list (in proper 16.74/5.72 * sequence), starting at the specified position in the list. 16.74/5.72 * Obeys the general contract of List.listIterator(int).

16.74/5.72 * 16.74/5.72 * The list-iterator is fail-fast: if the list is structurally 16.74/5.72 * modified at any time after the Iterator is created, in any way except 16.74/5.72 * through the list-iterator's own remove or add 16.74/5.72 * methods, the list-iterator will throw a 16.74/5.72 * ConcurrentModificationException. Thus, in the face of 16.74/5.72 * concurrent modification, the iterator fails quickly and cleanly, rather 16.74/5.72 * than risking arbitrary, non-deterministic behavior at an undetermined 16.74/5.72 * time in the future. 16.74/5.72 * 16.74/5.72 * @param index index of the first element to be returned from the 16.74/5.72 * list-iterator (by a call to next) 16.74/5.72 * @return a ListIterator of the elements in this list (in proper 16.74/5.72 * sequence), starting at the specified position in the list 16.74/5.72 * @throws IndexOutOfBoundsException {@inheritDoc} 16.74/5.72 * @see List#listIterator(int) 16.74/5.72 */ 16.74/5.72 public ListIterator listIterator(int index) { 16.74/5.72 return new ListItr(index); 16.74/5.72 } 16.74/5.72 16.74/5.72 private class ListItr implements ListIterator { 16.74/5.72 private Entry lastReturned = header; 16.74/5.72 private Entry next; 16.74/5.72 private int nextIndex; 16.74/5.72 private int expectedModCount = modCount; 16.74/5.72 16.74/5.72 ListItr(int index) { 16.74/5.72 if (index < 0 || index > size) 16.74/5.72 throw new IndexOutOfBoundsException(); 16.74/5.72 if (index < (size >> 1)) { 16.74/5.72 next = header.next; 16.74/5.72 for (nextIndex=0; nextIndexindex; nextIndex--) 16.74/5.72 next = next.previous; 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 public boolean hasNext() { 16.74/5.72 return nextIndex != size; 16.74/5.72 } 16.74/5.72 16.74/5.72 public E next() { 16.74/5.72 checkForComodification(); 16.74/5.72 if (nextIndex == size) 16.74/5.72 throw new NoSuchElementException(); 16.74/5.72 16.74/5.72 lastReturned = next; 16.74/5.72 next = next.next; 16.74/5.72 nextIndex++; 16.74/5.72 return lastReturned.element; 16.74/5.72 } 16.74/5.72 16.74/5.72 public boolean hasPrevious() { 16.74/5.72 return nextIndex != 0; 16.74/5.72 } 16.74/5.72 16.74/5.72 public E previous() { 16.74/5.72 if (nextIndex == 0) 16.74/5.72 throw new NoSuchElementException(); 16.74/5.72 16.74/5.72 lastReturned = next = next.previous; 16.74/5.72 nextIndex--; 16.74/5.72 checkForComodification(); 16.74/5.72 return lastReturned.element; 16.74/5.72 } 16.74/5.72 16.74/5.72 public int nextIndex() { 16.74/5.72 return nextIndex; 16.74/5.72 } 16.74/5.72 16.74/5.72 public int previousIndex() { 16.74/5.72 return nextIndex-1; 16.74/5.72 } 16.74/5.72 16.74/5.72 public void remove() { 16.74/5.72 checkForComodification(); 16.74/5.72 Entry lastNext = lastReturned.next; 16.74/5.72 try { 16.74/5.72 LinkedList.this.remove(lastReturned); 16.74/5.72 } catch (NoSuchElementException e) { 16.74/5.72 throw new IllegalStateException(); 16.74/5.72 } 16.74/5.72 if (next==lastReturned) 16.74/5.72 next = lastNext; 16.74/5.72 else 16.74/5.72 nextIndex--; 16.74/5.72 lastReturned = header; 16.74/5.72 expectedModCount++; 16.74/5.72 } 16.74/5.72 16.74/5.72 public void set(E e) { 16.74/5.72 if (lastReturned == header) 16.74/5.72 throw new IllegalStateException(); 16.74/5.72 checkForComodification(); 16.74/5.72 lastReturned.element = e; 16.74/5.72 } 16.74/5.72 16.74/5.72 public void add(E e) { 16.74/5.72 checkForComodification(); 16.74/5.72 lastReturned = header; 16.74/5.72 addBefore(e, next); 16.74/5.72 nextIndex++; 16.74/5.72 expectedModCount++; 16.74/5.72 } 16.74/5.72 16.74/5.72 final void checkForComodification() { 16.74/5.72 if (modCount != expectedModCount) 16.74/5.72 throw new ConcurrentModificationException(); 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 private static class Entry { 16.74/5.72 E element; 16.74/5.72 Entry next; 16.74/5.72 Entry previous; 16.74/5.72 16.74/5.72 Entry(E element, Entry next, Entry previous) { 16.74/5.72 this.element = element; 16.74/5.72 this.next = next; 16.74/5.72 this.previous = previous; 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 private Entry addBefore(E e, Entry entry) { 16.74/5.72 Entry newEntry = new Entry(e, entry, entry.previous); 16.74/5.72 newEntry.previous.next = newEntry; 16.74/5.72 newEntry.next.previous = newEntry; 16.74/5.72 size++; 16.74/5.72 modCount++; 16.74/5.72 return newEntry; 16.74/5.72 } 16.74/5.72 16.74/5.72 private E remove(Entry e) { 16.74/5.72 if (e == header) 16.74/5.72 throw new NoSuchElementException(); 16.74/5.72 16.74/5.72 E result = e.element; 16.74/5.72 e.previous.next = e.next; 16.74/5.72 e.next.previous = e.previous; 16.74/5.72 e.next = e.previous = null; 16.74/5.72 e.element = null; 16.74/5.72 size--; 16.74/5.72 modCount++; 16.74/5.72 return result; 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * @since 1.6 16.74/5.72 */ 16.74/5.72 public Iterator descendingIterator() { 16.74/5.72 return new DescendingIterator(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** Adapter to provide descending iterators via ListItr.previous */ 16.74/5.72 private class DescendingIterator implements Iterator { 16.74/5.72 final ListItr itr = new ListItr(size()); 16.74/5.72 public boolean hasNext() { 16.74/5.72 return itr.hasPrevious(); 16.74/5.72 } 16.74/5.72 public E next() { 16.74/5.72 return itr.previous(); 16.74/5.72 } 16.74/5.72 public void remove() { 16.74/5.72 itr.remove(); 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns an array containing all of the elements in this list 16.74/5.72 * in proper sequence (from first to last element). 16.74/5.72 * 16.74/5.72 *

The returned array will be "safe" in that no references to it are 16.74/5.72 * maintained by this list. (In other words, this method must allocate 16.74/5.72 * a new array). The caller is thus free to modify the returned array. 16.74/5.72 * 16.74/5.72 *

This method acts as bridge between array-based and collection-based 16.74/5.72 * APIs. 16.74/5.72 * 16.74/5.72 * @return an array containing all of the elements in this list 16.74/5.72 * in proper sequence 16.74/5.72 */ 16.74/5.72 public Object[] toArray() { 16.74/5.72 Object[] result = new Object[size]; 16.74/5.72 int i = 0; 16.74/5.72 for (Entry e = header.next; e != header; e = e.next) 16.74/5.72 result[i++] = e.element; 16.74/5.72 return result; 16.74/5.72 } 16.74/5.72 16.74/5.72 private static final long serialVersionUID = 876323262645176354L; 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * An iterator for lists that allows the programmer 16.74/5.72 * to traverse the list in either direction, modify 16.74/5.72 * the list during iteration, and obtain the iterator's 16.74/5.72 * current position in the list. A {@code ListIterator} 16.74/5.72 * has no current element; its cursor position always 16.74/5.72 * lies between the element that would be returned by a call 16.74/5.72 * to {@code previous()} and the element that would be 16.74/5.72 * returned by a call to {@code next()}. 16.74/5.72 * An iterator for a list of length {@code n} has {@code n+1} possible 16.74/5.72 * cursor positions, as illustrated by the carets ({@code ^}) below: 16.74/5.72 *

16.74/5.72	 *                      Element(0)   Element(1)   Element(2)   ... Element(n-1)
16.74/5.72	 * cursor positions:  ^            ^            ^            ^                  ^
16.74/5.72	 * 
16.74/5.72 * Note that the {@link #remove} and {@link #set(Object)} methods are 16.74/5.72 * not defined in terms of the cursor position; they are defined to 16.74/5.72 * operate on the last element returned by a call to {@link #next} or 16.74/5.72 * {@link #previous()}. 16.74/5.72 * 16.74/5.72 *

This interface is a member of the 16.74/5.72 * 16.74/5.72 * Java Collections Framework. 16.74/5.72 * 16.74/5.72 * @author Josh Bloch 16.74/5.72 * @see Collection 16.74/5.72 * @see List 16.74/5.72 * @see Iterator 16.74/5.72 * @see Enumeration 16.74/5.72 * @see List#listIterator() 16.74/5.72 * @since 1.2 16.74/5.72 */ 16.74/5.72 public interface ListIterator extends Iterator { 16.74/5.72 // Query Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns {@code true} if this list iterator has more elements when 16.74/5.72 * traversing the list in the forward direction. (In other words, 16.74/5.72 * returns {@code true} if {@link #next} would return an element rather 16.74/5.72 * than throwing an exception.) 16.74/5.72 * 16.74/5.72 * @return {@code true} if the list iterator has more elements when 16.74/5.72 * traversing the list in the forward direction 16.74/5.72 */ 16.74/5.72 boolean hasNext(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the next element in the list and advances the cursor position. 16.74/5.72 * This method may be called repeatedly to iterate through the list, 16.74/5.72 * or intermixed with calls to {@link #previous} to go back and forth. 16.74/5.72 * (Note that alternating calls to {@code next} and {@code previous} 16.74/5.72 * will return the same element repeatedly.) 16.74/5.72 * 16.74/5.72 * @return the next element in the list 16.74/5.72 * @throws NoSuchElementException if the iteration has no next element 16.74/5.72 */ 16.74/5.72 E next(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns {@code true} if this list iterator has more elements when 16.74/5.72 * traversing the list in the reverse direction. (In other words, 16.74/5.72 * returns {@code true} if {@link #previous} would return an element 16.74/5.72 * rather than throwing an exception.) 16.74/5.72 * 16.74/5.72 * @return {@code true} if the list iterator has more elements when 16.74/5.72 * traversing the list in the reverse direction 16.74/5.72 */ 16.74/5.72 boolean hasPrevious(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the previous element in the list and moves the cursor 16.74/5.72 * position backwards. This method may be called repeatedly to 16.74/5.72 * iterate through the list backwards, or intermixed with calls to 16.74/5.72 * {@link #next} to go back and forth. (Note that alternating calls 16.74/5.72 * to {@code next} and {@code previous} will return the same 16.74/5.72 * element repeatedly.) 16.74/5.72 * 16.74/5.72 * @return the previous element in the list 16.74/5.72 * @throws NoSuchElementException if the iteration has no previous 16.74/5.72 * element 16.74/5.72 */ 16.74/5.72 E previous(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the index of the element that would be returned by a 16.74/5.72 * subsequent call to {@link #next}. (Returns list size if the list 16.74/5.72 * iterator is at the end of the list.) 16.74/5.72 * 16.74/5.72 * @return the index of the element that would be returned by a 16.74/5.72 * subsequent call to {@code next}, or list size if the list 16.74/5.72 * iterator is at the end of the list 16.74/5.72 */ 16.74/5.72 int nextIndex(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the index of the element that would be returned by a 16.74/5.72 * subsequent call to {@link #previous}. (Returns -1 if the list 16.74/5.72 * iterator is at the beginning of the list.) 16.74/5.72 * 16.74/5.72 * @return the index of the element that would be returned by a 16.74/5.72 * subsequent call to {@code previous}, or -1 if the list 16.74/5.72 * iterator is at the beginning of the list 16.74/5.72 */ 16.74/5.72 int previousIndex(); 16.74/5.72 16.74/5.72 16.74/5.72 // Modification Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes from the list the last element that was returned by {@link 16.74/5.72 * #next} or {@link #previous} (optional operation). This call can 16.74/5.72 * only be made once per call to {@code next} or {@code previous}. 16.74/5.72 * It can be made only if {@link #add} has not been 16.74/5.72 * called after the last call to {@code next} or {@code previous}. 16.74/5.72 * 16.74/5.72 * @throws UnsupportedOperationException if the {@code remove} 16.74/5.72 * operation is not supported by this list iterator 16.74/5.72 * @throws IllegalStateException if neither {@code next} nor 16.74/5.72 * {@code previous} have been called, or {@code remove} or 16.74/5.72 * {@code add} have been called after the last call to 16.74/5.72 * {@code next} or {@code previous} 16.74/5.72 */ 16.74/5.72 void remove(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Replaces the last element returned by {@link #next} or 16.74/5.72 * {@link #previous} with the specified element (optional operation). 16.74/5.72 * This call can be made only if neither {@link #remove} nor {@link 16.74/5.72 * #add} have been called after the last call to {@code next} or 16.74/5.72 * {@code previous}. 16.74/5.72 * 16.74/5.72 * @param e the element with which to replace the last element returned by 16.74/5.72 * {@code next} or {@code previous} 16.74/5.72 * @throws UnsupportedOperationException if the {@code set} operation 16.74/5.72 * is not supported by this list iterator 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 * @throws IllegalArgumentException if some aspect of the specified 16.74/5.72 * element prevents it from being added to this list 16.74/5.72 * @throws IllegalStateException if neither {@code next} nor 16.74/5.72 * {@code previous} have been called, or {@code remove} or 16.74/5.72 * {@code add} have been called after the last call to 16.74/5.72 * {@code next} or {@code previous} 16.74/5.72 */ 16.74/5.72 void set(E e); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Inserts the specified element into the list (optional operation). 16.74/5.72 * The element is inserted immediately before the next element that 16.74/5.72 * would be returned by {@link #next}, if any, and after the next 16.74/5.72 * element that would be returned by {@link #previous}, if any. (If the 16.74/5.72 * list contains no elements, the new element becomes the sole element 16.74/5.72 * on the list.) The new element is inserted before the implicit 16.74/5.72 * cursor: a subsequent call to {@code next} would be unaffected, and a 16.74/5.72 * subsequent call to {@code previous} would return the new element. 16.74/5.72 * (This call increases by one the value that would be returned by a 16.74/5.72 * call to {@code nextIndex} or {@code previousIndex}.) 16.74/5.72 * 16.74/5.72 * @param e the element to insert 16.74/5.72 * @throws UnsupportedOperationException if the {@code add} method is 16.74/5.72 * not supported by this list iterator 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 * @throws IllegalArgumentException if some aspect of this element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 */ 16.74/5.72 void add(E e); 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * An ordered collection (also known as a sequence). The user of this 16.74/5.72 * interface has precise control over where in the list each element is 16.74/5.72 * inserted. The user can access elements by their integer index (position in 16.74/5.72 * the list), and search for elements in the list.

16.74/5.72 * 16.74/5.72 * Unlike sets, lists typically allow duplicate elements. More formally, 16.74/5.72 * lists typically allow pairs of elements e1 and e2 16.74/5.72 * such that e1.equals(e2), and they typically allow multiple 16.74/5.72 * null elements if they allow null elements at all. It is not inconceivable 16.74/5.72 * that someone might wish to implement a list that prohibits duplicates, by 16.74/5.72 * throwing runtime exceptions when the user attempts to insert them, but we 16.74/5.72 * expect this usage to be rare.

16.74/5.72 * 16.74/5.72 * The List interface places additional stipulations, beyond those 16.74/5.72 * specified in the Collection interface, on the contracts of the 16.74/5.72 * iterator, add, remove, equals, and 16.74/5.72 * hashCode methods. Declarations for other inherited methods are 16.74/5.72 * also included here for convenience.

16.74/5.72 * 16.74/5.72 * The List interface provides four methods for positional (indexed) 16.74/5.72 * access to list elements. Lists (like Java arrays) are zero based. Note 16.74/5.72 * that these operations may execute in time proportional to the index value 16.74/5.72 * for some implementations (the LinkedList class, for 16.74/5.72 * example). Thus, iterating over the elements in a list is typically 16.74/5.72 * preferable to indexing through it if the caller does not know the 16.74/5.72 * implementation.

16.74/5.72 * 16.74/5.72 * The List interface provides a special iterator, called a 16.74/5.72 * ListIterator, that allows element insertion and replacement, and 16.74/5.72 * bidirectional access in addition to the normal operations that the 16.74/5.72 * Iterator interface provides. A method is provided to obtain a 16.74/5.72 * list iterator that starts at a specified position in the list.

16.74/5.72 * 16.74/5.72 * The List interface provides two methods to search for a specified 16.74/5.72 * object. From a performance standpoint, these methods should be used with 16.74/5.72 * caution. In many implementations they will perform costly linear 16.74/5.72 * searches.

16.74/5.72 * 16.74/5.72 * The List interface provides two methods to efficiently insert and 16.74/5.72 * remove multiple elements at an arbitrary point in the list.

16.74/5.72 * 16.74/5.72 * Note: While it is permissible for lists to contain themselves as elements, 16.74/5.72 * extreme caution is advised: the equals and hashCode 16.74/5.72 * methods are no longer well defined on such a list. 16.74/5.72 * 16.74/5.72 *

Some list implementations have restrictions on the elements that 16.74/5.72 * they may contain. For example, some implementations prohibit null elements, 16.74/5.72 * and some have restrictions on the types of their elements. Attempting to 16.74/5.72 * add an ineligible element throws an unchecked exception, typically 16.74/5.72 * NullPointerException or ClassCastException. Attempting 16.74/5.72 * to query the presence of an ineligible element may throw an exception, 16.74/5.72 * or it may simply return false; some implementations will exhibit the former 16.74/5.72 * behavior and some will exhibit the latter. More generally, attempting an 16.74/5.72 * operation on an ineligible element whose completion would not result in 16.74/5.72 * the insertion of an ineligible element into the list may throw an 16.74/5.72 * exception or it may succeed, at the option of the implementation. 16.74/5.72 * Such exceptions are marked as "optional" in the specification for this 16.74/5.72 * interface. 16.74/5.72 * 16.74/5.72 *

This interface is a member of the 16.74/5.72 * 16.74/5.72 * Java Collections Framework. 16.74/5.72 * 16.74/5.72 * @author Josh Bloch 16.74/5.72 * @author Neal Gafter 16.74/5.72 * @see Collection 16.74/5.72 * @see Set 16.74/5.72 * @see ArrayList 16.74/5.72 * @see LinkedList 16.74/5.72 * @see Vector 16.74/5.72 * @see Arrays#asList(Object[]) 16.74/5.72 * @see Collections#nCopies(int, Object) 16.74/5.72 * @see Collections#EMPTY_LIST 16.74/5.72 * @see AbstractList 16.74/5.72 * @see AbstractSequentialList 16.74/5.72 * @since 1.2 16.74/5.72 */ 16.74/5.72 16.74/5.72 public interface List extends Collection { 16.74/5.72 // Query Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the number of elements in this list. If this list contains 16.74/5.72 * more than Integer.MAX_VALUE elements, returns 16.74/5.72 * Integer.MAX_VALUE. 16.74/5.72 * 16.74/5.72 * @return the number of elements in this list 16.74/5.72 */ 16.74/5.72 int size(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns true if this list contains no elements. 16.74/5.72 * 16.74/5.72 * @return true if this list contains no elements 16.74/5.72 */ 16.74/5.72 boolean isEmpty(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns true if this list contains the specified element. 16.74/5.72 * More formally, returns true if and only if this list contains 16.74/5.72 * at least one element e such that 16.74/5.72 * (o==null ? e==null : o.equals(e)). 16.74/5.72 * 16.74/5.72 * @param o element whose presence in this list is to be tested 16.74/5.72 * @return true if this list contains the specified element 16.74/5.72 * @throws ClassCastException if the type of the specified element 16.74/5.72 * is incompatible with this list (optional) 16.74/5.72 * @throws NullPointerException if the specified element is null and this 16.74/5.72 * list does not permit null elements (optional) 16.74/5.72 */ 16.74/5.72 boolean contains(Object o); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns an iterator over the elements in this list in proper sequence. 16.74/5.72 * 16.74/5.72 * @return an iterator over the elements in this list in proper sequence 16.74/5.72 */ 16.74/5.72 Iterator iterator(); 16.74/5.72 16.74/5.72 // Modification Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Appends the specified element to the end of this list (optional 16.74/5.72 * operation). 16.74/5.72 * 16.74/5.72 *

Lists that support this operation may place limitations on what 16.74/5.72 * elements may be added to this list. In particular, some 16.74/5.72 * lists will refuse to add null elements, and others will impose 16.74/5.72 * restrictions on the type of elements that may be added. List 16.74/5.72 * classes should clearly specify in their documentation any restrictions 16.74/5.72 * on what elements may be added. 16.74/5.72 * 16.74/5.72 * @param e element to be appended to this list 16.74/5.72 * @return true (as specified by {@link Collection#add}) 16.74/5.72 * @throws UnsupportedOperationException if the add operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 * @throws NullPointerException if the specified element is null and this 16.74/5.72 * list does not permit null elements 16.74/5.72 * @throws IllegalArgumentException if some property of this element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 */ 16.74/5.72 boolean add(E e); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes the first occurrence of the specified element from this list, 16.74/5.72 * if it is present (optional operation). If this list does not contain 16.74/5.72 * the element, it is unchanged. More formally, removes the element with 16.74/5.72 * the lowest index i such that 16.74/5.72 * (o==null ? get(i)==null : o.equals(get(i))) 16.74/5.72 * (if such an element exists). Returns true if this list 16.74/5.72 * contained the specified element (or equivalently, if this list changed 16.74/5.72 * as a result of the call). 16.74/5.72 * 16.74/5.72 * @param o element to be removed from this list, if present 16.74/5.72 * @return true if this list contained the specified element 16.74/5.72 * @throws ClassCastException if the type of the specified element 16.74/5.72 * is incompatible with this list (optional) 16.74/5.72 * @throws NullPointerException if the specified element is null and this 16.74/5.72 * list does not permit null elements (optional) 16.74/5.72 * @throws UnsupportedOperationException if the remove operation 16.74/5.72 * is not supported by this list 16.74/5.72 */ 16.74/5.72 boolean remove(Object o); 16.74/5.72 16.74/5.72 16.74/5.72 // Bulk Modification Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns true if this list contains all of the elements of the 16.74/5.72 * specified collection. 16.74/5.72 * 16.74/5.72 * @param c collection to be checked for containment in this list 16.74/5.72 * @return true if this list contains all of the elements of the 16.74/5.72 * specified collection 16.74/5.72 * @throws ClassCastException if the types of one or more elements 16.74/5.72 * in the specified collection are incompatible with this 16.74/5.72 * list (optional) 16.74/5.72 * @throws NullPointerException if the specified collection contains one 16.74/5.72 * or more null elements and this list does not permit null 16.74/5.72 * elements (optional), or if the specified collection is null 16.74/5.72 * @see #contains(Object) 16.74/5.72 */ 16.74/5.72 boolean containsAll(Collection c); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Appends all of the elements in the specified collection to the end of 16.74/5.72 * this list, in the order that they are returned by the specified 16.74/5.72 * collection's iterator (optional operation). The behavior of this 16.74/5.72 * operation is undefined if the specified collection is modified while 16.74/5.72 * the operation is in progress. (Note that this will occur if the 16.74/5.72 * specified collection is this list, and it's nonempty.) 16.74/5.72 * 16.74/5.72 * @param c collection containing elements to be added to this list 16.74/5.72 * @return true if this list changed as a result of the call 16.74/5.72 * @throws UnsupportedOperationException if the addAll operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of an element of the specified 16.74/5.72 * collection prevents it from being added to this list 16.74/5.72 * @throws NullPointerException if the specified collection contains one 16.74/5.72 * or more null elements and this list does not permit null 16.74/5.72 * elements, or if the specified collection is null 16.74/5.72 * @throws IllegalArgumentException if some property of an element of the 16.74/5.72 * specified collection prevents it from being added to this list 16.74/5.72 * @see #add(Object) 16.74/5.72 */ 16.74/5.72 boolean addAll(Collection c); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Inserts all of the elements in the specified collection into this 16.74/5.72 * list at the specified position (optional operation). Shifts the 16.74/5.72 * element currently at that position (if any) and any subsequent 16.74/5.72 * elements to the right (increases their indices). The new elements 16.74/5.72 * will appear in this list in the order that they are returned by the 16.74/5.72 * specified collection's iterator. The behavior of this operation is 16.74/5.72 * undefined if the specified collection is modified while the 16.74/5.72 * operation is in progress. (Note that this will occur if the specified 16.74/5.72 * collection is this list, and it's nonempty.) 16.74/5.72 * 16.74/5.72 * @param index index at which to insert the first element from the 16.74/5.72 * specified collection 16.74/5.72 * @param c collection containing elements to be added to this list 16.74/5.72 * @return true if this list changed as a result of the call 16.74/5.72 * @throws UnsupportedOperationException if the addAll operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of an element of the specified 16.74/5.72 * collection prevents it from being added to this list 16.74/5.72 * @throws NullPointerException if the specified collection contains one 16.74/5.72 * or more null elements and this list does not permit null 16.74/5.72 * elements, or if the specified collection is null 16.74/5.72 * @throws IllegalArgumentException if some property of an element of the 16.74/5.72 * specified collection prevents it from being added to this list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * (index < 0 || index > size()) 16.74/5.72 */ 16.74/5.72 boolean addAll(int index, Collection c); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes from this list all of its elements that are contained in the 16.74/5.72 * specified collection (optional operation). 16.74/5.72 * 16.74/5.72 * @param c collection containing elements to be removed from this list 16.74/5.72 * @return true if this list changed as a result of the call 16.74/5.72 * @throws UnsupportedOperationException if the removeAll operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of an element of this list 16.74/5.72 * is incompatible with the specified collection (optional) 16.74/5.72 * @throws NullPointerException if this list contains a null element and the 16.74/5.72 * specified collection does not permit null elements (optional), 16.74/5.72 * or if the specified collection is null 16.74/5.72 * @see #remove(Object) 16.74/5.72 * @see #contains(Object) 16.74/5.72 */ 16.74/5.72 boolean removeAll(Collection c); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retains only the elements in this list that are contained in the 16.74/5.72 * specified collection (optional operation). In other words, removes 16.74/5.72 * from this list all of its elements that are not contained in the 16.74/5.72 * specified collection. 16.74/5.72 * 16.74/5.72 * @param c collection containing elements to be retained in this list 16.74/5.72 * @return true if this list changed as a result of the call 16.74/5.72 * @throws UnsupportedOperationException if the retainAll operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of an element of this list 16.74/5.72 * is incompatible with the specified collection (optional) 16.74/5.72 * @throws NullPointerException if this list contains a null element and the 16.74/5.72 * specified collection does not permit null elements (optional), 16.74/5.72 * or if the specified collection is null 16.74/5.72 * @see #remove(Object) 16.74/5.72 * @see #contains(Object) 16.74/5.72 */ 16.74/5.72 boolean retainAll(Collection c); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes all of the elements from this list (optional operation). 16.74/5.72 * The list will be empty after this call returns. 16.74/5.72 * 16.74/5.72 * @throws UnsupportedOperationException if the clear operation 16.74/5.72 * is not supported by this list 16.74/5.72 */ 16.74/5.72 void clear(); 16.74/5.72 16.74/5.72 16.74/5.72 // Comparison and hashing 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Compares the specified object with this list for equality. Returns 16.74/5.72 * true if and only if the specified object is also a list, both 16.74/5.72 * lists have the same size, and all corresponding pairs of elements in 16.74/5.72 * the two lists are equal. (Two elements e1 and 16.74/5.72 * e2 are equal if (e1==null ? e2==null : 16.74/5.72 * e1.equals(e2)).) In other words, two lists are defined to be 16.74/5.72 * equal if they contain the same elements in the same order. This 16.74/5.72 * definition ensures that the equals method works properly across 16.74/5.72 * different implementations of the List interface. 16.74/5.72 * 16.74/5.72 * @param o the object to be compared for equality with this list 16.74/5.72 * @return true if the specified object is equal to this list 16.74/5.72 */ 16.74/5.72 boolean equals(Object o); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the hash code value for this list. The hash code of a list 16.74/5.72 * is defined to be the result of the following calculation: 16.74/5.72 *

16.74/5.72	     *  int hashCode = 1;
16.74/5.72	     *  for (E e : list)
16.74/5.72	     *      hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());
16.74/5.72	     * 
16.74/5.72 * This ensures that list1.equals(list2) implies that 16.74/5.72 * list1.hashCode()==list2.hashCode() for any two lists, 16.74/5.72 * list1 and list2, as required by the general 16.74/5.72 * contract of {@link Object#hashCode}. 16.74/5.72 * 16.74/5.72 * @return the hash code value for this list 16.74/5.72 * @see Object#equals(Object) 16.74/5.72 * @see #equals(Object) 16.74/5.72 */ 16.74/5.72 int hashCode(); 16.74/5.72 16.74/5.72 16.74/5.72 // Positional Access Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the element at the specified position in this list. 16.74/5.72 * 16.74/5.72 * @param index index of the element to return 16.74/5.72 * @return the element at the specified position in this list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * (index < 0 || index >= size()) 16.74/5.72 */ 16.74/5.72 E get(int index); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Replaces the element at the specified position in this list with the 16.74/5.72 * specified element (optional operation). 16.74/5.72 * 16.74/5.72 * @param index index of the element to replace 16.74/5.72 * @param element element to be stored at the specified position 16.74/5.72 * @return the element previously at the specified position 16.74/5.72 * @throws UnsupportedOperationException if the set operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 * @throws NullPointerException if the specified element is null and 16.74/5.72 * this list does not permit null elements 16.74/5.72 * @throws IllegalArgumentException if some property of the specified 16.74/5.72 * element prevents it from being added to this list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * (index < 0 || index >= size()) 16.74/5.72 */ 16.74/5.72 E set(int index, E element); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Inserts the specified element at the specified position in this list 16.74/5.72 * (optional operation). Shifts the element currently at that position 16.74/5.72 * (if any) and any subsequent elements to the right (adds one to their 16.74/5.72 * indices). 16.74/5.72 * 16.74/5.72 * @param index index at which the specified element is to be inserted 16.74/5.72 * @param element element to be inserted 16.74/5.72 * @throws UnsupportedOperationException if the add operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this list 16.74/5.72 * @throws NullPointerException if the specified element is null and 16.74/5.72 * this list does not permit null elements 16.74/5.72 * @throws IllegalArgumentException if some property of the specified 16.74/5.72 * element prevents it from being added to this list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * (index < 0 || index > size()) 16.74/5.72 */ 16.74/5.72 void add(int index, E element); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Removes the element at the specified position in this list (optional 16.74/5.72 * operation). Shifts any subsequent elements to the left (subtracts one 16.74/5.72 * from their indices). Returns the element that was removed from the 16.74/5.72 * list. 16.74/5.72 * 16.74/5.72 * @param index the index of the element to be removed 16.74/5.72 * @return the element previously at the specified position 16.74/5.72 * @throws UnsupportedOperationException if the remove operation 16.74/5.72 * is not supported by this list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * (index < 0 || index >= size()) 16.74/5.72 */ 16.74/5.72 E remove(int index); 16.74/5.72 16.74/5.72 16.74/5.72 // Search Operations 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the index of the first occurrence of the specified element 16.74/5.72 * in this list, or -1 if this list does not contain the element. 16.74/5.72 * More formally, returns the lowest index i such that 16.74/5.72 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.72 * or -1 if there is no such index. 16.74/5.72 * 16.74/5.72 * @param o element to search for 16.74/5.72 * @return the index of the first occurrence of the specified element in 16.74/5.72 * this list, or -1 if this list does not contain the element 16.74/5.72 * @throws ClassCastException if the type of the specified element 16.74/5.72 * is incompatible with this list (optional) 16.74/5.72 * @throws NullPointerException if the specified element is null and this 16.74/5.72 * list does not permit null elements (optional) 16.74/5.72 */ 16.74/5.72 int indexOf(Object o); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns the index of the last occurrence of the specified element 16.74/5.72 * in this list, or -1 if this list does not contain the element. 16.74/5.72 * More formally, returns the highest index i such that 16.74/5.72 * (o==null ? get(i)==null : o.equals(get(i))), 16.74/5.72 * or -1 if there is no such index. 16.74/5.72 * 16.74/5.72 * @param o element to search for 16.74/5.72 * @return the index of the last occurrence of the specified element in 16.74/5.72 * this list, or -1 if this list does not contain the element 16.74/5.72 * @throws ClassCastException if the type of the specified element 16.74/5.72 * is incompatible with this list (optional) 16.74/5.72 * @throws NullPointerException if the specified element is null and this 16.74/5.72 * list does not permit null elements (optional) 16.74/5.72 */ 16.74/5.72 int lastIndexOf(Object o); 16.74/5.72 16.74/5.72 16.74/5.72 // List Iterators 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns a list iterator over the elements in this list (in proper 16.74/5.72 * sequence). 16.74/5.72 * 16.74/5.72 * @return a list iterator over the elements in this list (in proper 16.74/5.72 * sequence) 16.74/5.72 */ 16.74/5.72 ListIterator listIterator(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns a list iterator over the elements in this list (in proper 16.74/5.72 * sequence), starting at the specified position in the list. 16.74/5.72 * The specified index indicates the first element that would be 16.74/5.72 * returned by an initial call to {@link ListIterator#next next}. 16.74/5.72 * An initial call to {@link ListIterator#previous previous} would 16.74/5.72 * return the element with the specified index minus one. 16.74/5.72 * 16.74/5.72 * @param index index of the first element to be returned from the 16.74/5.72 * list iterator (by a call to {@link ListIterator#next next}) 16.74/5.72 * @return a list iterator over the elements in this list (in proper 16.74/5.72 * sequence), starting at the specified position in the list 16.74/5.72 * @throws IndexOutOfBoundsException if the index is out of range 16.74/5.72 * ({@code index < 0 || index > size()}) 16.74/5.72 */ 16.74/5.72 ListIterator listIterator(int index); 16.74/5.72 16.74/5.72 // View 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Returns a view of the portion of this list between the specified 16.74/5.72 * fromIndex, inclusive, and toIndex, exclusive. (If 16.74/5.72 * fromIndex and toIndex are equal, the returned list is 16.74/5.72 * empty.) The returned list is backed by this list, so non-structural 16.74/5.72 * changes in the returned list are reflected in this list, and vice-versa. 16.74/5.72 * The returned list supports all of the optional list operations supported 16.74/5.72 * by this list.

16.74/5.72 * 16.74/5.72 * This method eliminates the need for explicit range operations (of 16.74/5.72 * the sort that commonly exist for arrays). Any operation that expects 16.74/5.72 * a list can be used as a range operation by passing a subList view 16.74/5.72 * instead of a whole list. For example, the following idiom 16.74/5.72 * removes a range of elements from a list: 16.74/5.72 *

16.74/5.72	     *      list.subList(from, to).clear();
16.74/5.72	     * 
16.74/5.72 * Similar idioms may be constructed for indexOf and 16.74/5.72 * lastIndexOf, and all of the algorithms in the 16.74/5.72 * Collections class can be applied to a subList.

16.74/5.72 * 16.74/5.72 * The semantics of the list returned by this method become undefined if 16.74/5.72 * the backing list (i.e., this list) is structurally modified in 16.74/5.72 * any way other than via the returned list. (Structural modifications are 16.74/5.72 * those that change the size of this list, or otherwise perturb it in such 16.74/5.72 * a fashion that iterations in progress may yield incorrect results.) 16.74/5.72 * 16.74/5.72 * @param fromIndex low endpoint (inclusive) of the subList 16.74/5.72 * @param toIndex high endpoint (exclusive) of the subList 16.74/5.72 * @return a view of the specified range within this list 16.74/5.72 * @throws IndexOutOfBoundsException for an illegal endpoint index value 16.74/5.72 * (fromIndex < 0 || toIndex > size || 16.74/5.72 * fromIndex > toIndex) 16.74/5.72 */ 16.74/5.72 List subList(int fromIndex, int toIndex); 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Thrown by the nextElement method of an 16.74/5.72 * Enumeration to indicate that there are no more 16.74/5.72 * elements in the enumeration. 16.74/5.72 * 16.74/5.72 * @author unascribed 16.74/5.72 * @see java.util.Enumeration 16.74/5.72 * @see java.util.Enumeration#nextElement() 16.74/5.72 * @since JDK1.0 16.74/5.72 */ 16.74/5.72 public 16.74/5.72 class NoSuchElementException extends RuntimeException { 16.74/5.72 /** 16.74/5.72 * Constructs a NoSuchElementException with null 16.74/5.72 * as its error message string. 16.74/5.72 */ 16.74/5.72 public NoSuchElementException() { 16.74/5.72 super(); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Constructs a NoSuchElementException, saving a reference 16.74/5.72 * to the error message string s for later retrieval by the 16.74/5.72 * getMessage method. 16.74/5.72 * 16.74/5.72 * @param s the detail message. 16.74/5.72 */ 16.74/5.72 public NoSuchElementException(String s) { 16.74/5.72 super(s); 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 /* 16.74/5.72 * This file is available under and governed by the GNU General Public 16.74/5.72 * License version 2 only, as published by the Free Software Foundation. 16.74/5.72 * However, the following notice accompanied the original version of this 16.74/5.72 * file: 16.74/5.72 * 16.74/5.72 * Written by Doug Lea with assistance from members of JCP JSR-166 16.74/5.72 * Expert Group and released to the public domain, as explained at 16.74/5.72 * http://creativecommons.org/licenses/publicdomain 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * A collection designed for holding elements prior to processing. 16.74/5.72 * Besides basic {@link java.util.Collection Collection} operations, 16.74/5.72 * queues provide additional insertion, extraction, and inspection 16.74/5.72 * operations. Each of these methods exists in two forms: one throws 16.74/5.72 * an exception if the operation fails, the other returns a special 16.74/5.72 * value (either null or false, depending on the 16.74/5.72 * operation). The latter form of the insert operation is designed 16.74/5.72 * specifically for use with capacity-restricted Queue 16.74/5.72 * implementations; in most implementations, insert operations cannot 16.74/5.72 * fail. 16.74/5.72 * 16.74/5.72 *

16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 * 16.74/5.72 *
Throws exceptionReturns special value
Insert{@link #add add(e)}{@link #offer offer(e)}
Remove{@link #remove remove()}{@link #poll poll()}
Examine{@link #element element()}{@link #peek peek()}
16.74/5.72 * 16.74/5.72 *

Queues typically, but do not necessarily, order elements in a 16.74/5.72 * FIFO (first-in-first-out) manner. Among the exceptions are 16.74/5.72 * priority queues, which order elements according to a supplied 16.74/5.72 * comparator, or the elements' natural ordering, and LIFO queues (or 16.74/5.72 * stacks) which order the elements LIFO (last-in-first-out). 16.74/5.72 * Whatever the ordering used, the head of the queue is that 16.74/5.72 * element which would be removed by a call to {@link #remove() } or 16.74/5.72 * {@link #poll()}. In a FIFO queue, all new elements are inserted at 16.74/5.72 * the tail of the queue. Other kinds of queues may use 16.74/5.72 * different placement rules. Every Queue implementation 16.74/5.72 * must specify its ordering properties. 16.74/5.72 * 16.74/5.72 *

The {@link #offer offer} method inserts an element if possible, 16.74/5.72 * otherwise returning false. This differs from the {@link 16.74/5.72 * java.util.Collection#add Collection.add} method, which can fail to 16.74/5.72 * add an element only by throwing an unchecked exception. The 16.74/5.72 * offer method is designed for use when failure is a normal, 16.74/5.72 * rather than exceptional occurrence, for example, in fixed-capacity 16.74/5.72 * (or "bounded") queues. 16.74/5.72 * 16.74/5.72 *

The {@link #remove()} and {@link #poll()} methods remove and 16.74/5.72 * return the head of the queue. 16.74/5.72 * Exactly which element is removed from the queue is a 16.74/5.72 * function of the queue's ordering policy, which differs from 16.74/5.72 * implementation to implementation. The remove() and 16.74/5.72 * poll() methods differ only in their behavior when the 16.74/5.72 * queue is empty: the remove() method throws an exception, 16.74/5.72 * while the poll() method returns null. 16.74/5.72 * 16.74/5.72 *

The {@link #element()} and {@link #peek()} methods return, but do 16.74/5.72 * not remove, the head of the queue. 16.74/5.72 * 16.74/5.72 *

The Queue interface does not define the blocking queue 16.74/5.72 * methods, which are common in concurrent programming. These methods, 16.74/5.72 * which wait for elements to appear or for space to become available, are 16.74/5.72 * defined in the {@link java.util.concurrent.BlockingQueue} interface, which 16.74/5.72 * extends this interface. 16.74/5.72 * 16.74/5.72 *

Queue implementations generally do not allow insertion 16.74/5.72 * of null elements, although some implementations, such as 16.74/5.72 * {@link LinkedList}, do not prohibit insertion of null. 16.74/5.72 * Even in the implementations that permit it, null should 16.74/5.72 * not be inserted into a Queue, as null is also 16.74/5.72 * used as a special return value by the poll method to 16.74/5.72 * indicate that the queue contains no elements. 16.74/5.72 * 16.74/5.72 *

Queue implementations generally do not define 16.74/5.72 * element-based versions of methods equals and 16.74/5.72 * hashCode but instead inherit the identity based versions 16.74/5.72 * from class Object, because element-based equality is not 16.74/5.72 * always well-defined for queues with the same elements but different 16.74/5.72 * ordering properties. 16.74/5.72 * 16.74/5.72 * 16.74/5.72 *

This interface is a member of the 16.74/5.72 * 16.74/5.72 * Java Collections Framework. 16.74/5.72 * 16.74/5.72 * @see java.util.Collection 16.74/5.72 * @see LinkedList 16.74/5.72 * @see PriorityQueue 16.74/5.72 * @see java.util.concurrent.LinkedBlockingQueue 16.74/5.72 * @see java.util.concurrent.BlockingQueue 16.74/5.72 * @see java.util.concurrent.ArrayBlockingQueue 16.74/5.72 * @see java.util.concurrent.LinkedBlockingQueue 16.74/5.72 * @see java.util.concurrent.PriorityBlockingQueue 16.74/5.72 * @since 1.5 16.74/5.72 * @author Doug Lea 16.74/5.72 * @param the type of elements held in this collection 16.74/5.72 */ 16.74/5.72 public interface Queue extends Collection { 16.74/5.72 /** 16.74/5.72 * Inserts the specified element into this queue if it is possible to do so 16.74/5.72 * immediately without violating capacity restrictions, returning 16.74/5.72 * true upon success and throwing an IllegalStateException 16.74/5.72 * if no space is currently available. 16.74/5.72 * 16.74/5.72 * @param e the element to add 16.74/5.72 * @return true (as specified by {@link Collection#add}) 16.74/5.72 * @throws IllegalStateException if the element cannot be added at this 16.74/5.72 * time due to capacity restrictions 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this queue 16.74/5.72 * @throws NullPointerException if the specified element is null and 16.74/5.72 * this queue does not permit null elements 16.74/5.72 * @throws IllegalArgumentException if some property of this element 16.74/5.72 * prevents it from being added to this queue 16.74/5.72 */ 16.74/5.72 boolean add(E e); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Inserts the specified element into this queue if it is possible to do 16.74/5.72 * so immediately without violating capacity restrictions. 16.74/5.72 * When using a capacity-restricted queue, this method is generally 16.74/5.72 * preferable to {@link #add}, which can fail to insert an element only 16.74/5.72 * by throwing an exception. 16.74/5.72 * 16.74/5.72 * @param e the element to add 16.74/5.72 * @return true if the element was added to this queue, else 16.74/5.72 * false 16.74/5.72 * @throws ClassCastException if the class of the specified element 16.74/5.72 * prevents it from being added to this queue 16.74/5.72 * @throws NullPointerException if the specified element is null and 16.74/5.72 * this queue does not permit null elements 16.74/5.72 * @throws IllegalArgumentException if some property of this element 16.74/5.72 * prevents it from being added to this queue 16.74/5.72 */ 16.74/5.72 boolean offer(E e); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves and removes the head of this queue. This method differs 16.74/5.72 * from {@link #poll poll} only in that it throws an exception if this 16.74/5.72 * queue is empty. 16.74/5.72 * 16.74/5.72 * @return the head of this queue 16.74/5.72 * @throws NoSuchElementException if this queue is empty 16.74/5.72 */ 16.74/5.72 E remove(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves and removes the head of this queue, 16.74/5.72 * or returns null if this queue is empty. 16.74/5.72 * 16.74/5.72 * @return the head of this queue, or null if this queue is empty 16.74/5.72 */ 16.74/5.72 E poll(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves, but does not remove, the head of this queue. This method 16.74/5.72 * differs from {@link #peek peek} only in that it throws an exception 16.74/5.72 * if this queue is empty. 16.74/5.72 * 16.74/5.72 * @return the head of this queue 16.74/5.72 * @throws NoSuchElementException if this queue is empty 16.74/5.72 */ 16.74/5.72 E element(); 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Retrieves, but does not remove, the head of this queue, 16.74/5.72 * or returns null if this queue is empty. 16.74/5.72 * 16.74/5.72 * @return the head of this queue, or null if this queue is empty 16.74/5.72 */ 16.74/5.72 E peek(); 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * Copyright 2000-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Marker interface used by List implementations to indicate that 16.74/5.72 * they support fast (generally constant time) random access. The primary 16.74/5.72 * purpose of this interface is to allow generic algorithms to alter their 16.74/5.72 * behavior to provide good performance when applied to either random or 16.74/5.72 * sequential access lists. 16.74/5.72 * 16.74/5.72 *

The best algorithms for manipulating random access lists (such as 16.74/5.72 * ArrayList) can produce quadratic behavior when applied to 16.74/5.72 * sequential access lists (such as LinkedList). Generic list 16.74/5.72 * algorithms are encouraged to check whether the given list is an 16.74/5.72 * instanceof this interface before applying an algorithm that would 16.74/5.72 * provide poor performance if it were applied to a sequential access list, 16.74/5.72 * and to alter their behavior if necessary to guarantee acceptable 16.74/5.72 * performance. 16.74/5.72 * 16.74/5.72 *

It is recognized that the distinction between random and sequential 16.74/5.72 * access is often fuzzy. For example, some List implementations 16.74/5.72 * provide asymptotically linear access times if they get huge, but constant 16.74/5.72 * access times in practice. Such a List implementation 16.74/5.72 * should generally implement this interface. As a rule of thumb, a 16.74/5.72 * List implementation should implement this interface if, 16.74/5.72 * for typical instances of the class, this loop: 16.74/5.72 *

16.74/5.72	 *     for (int i=0, n=list.size(); i < n; i++)
16.74/5.72	 *         list.get(i);
16.74/5.72	 * 
16.74/5.72 * runs faster than this loop: 16.74/5.72 *
16.74/5.72	 *     for (Iterator i=list.iterator(); i.hasNext(); )
16.74/5.72	 *         i.next();
16.74/5.72	 * 
16.74/5.72 * 16.74/5.72 *

This interface is a member of the 16.74/5.72 * 16.74/5.72 * Java Collections Framework. 16.74/5.72 * 16.74/5.72 * @since 1.4 16.74/5.72 */ 16.74/5.72 public interface RandomAccess { 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 public class Random { 16.74/5.72 static String[] args; 16.74/5.72 static int index = 0; 16.74/5.72 16.74/5.72 public static int random() { 16.74/5.72 String string = args[index]; 16.74/5.72 index++; 16.74/5.72 return string.length(); 16.74/5.72 } 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 /* 16.74/5.72 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 16.74/5.72 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 16.74/5.72 * 16.74/5.72 * This code is free software; you can redistribute it and/or modify it 16.74/5.72 * under the terms of the GNU General Public License version 2 only, as 16.74/5.72 * published by the Free Software Foundation. Sun designates this 16.74/5.72 * particular file as subject to the "Classpath" exception as provided 16.74/5.72 * by Sun in the LICENSE file that accompanied this code. 16.74/5.72 * 16.74/5.72 * This code is distributed in the hope that it will be useful, but WITHOUT 16.74/5.72 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 16.74/5.72 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16.74/5.72 * version 2 for more details (a copy is included in the LICENSE file that 16.74/5.72 * accompanied this code). 16.74/5.72 * 16.74/5.72 * You should have received a copy of the GNU General Public License version 16.74/5.72 * 2 along with this work; if not, write to the Free Software Foundation, 16.74/5.72 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 16.74/5.72 * 16.74/5.72 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 16.74/5.72 * CA 95054 USA or visit www.sun.com if you need additional information or 16.74/5.72 * have any questions. 16.74/5.72 */ 16.74/5.72 16.74/5.72 package javaUtilEx; 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Thrown to indicate that the requested operation is not supported.

16.74/5.72 * 16.74/5.72 * This class is a member of the 16.74/5.72 * 16.74/5.72 * Java Collections Framework. 16.74/5.72 * 16.74/5.72 * @author Josh Bloch 16.74/5.72 * @since 1.2 16.74/5.72 */ 16.74/5.72 public class UnsupportedOperationException extends RuntimeException { 16.74/5.72 /** 16.74/5.72 * Constructs an UnsupportedOperationException with no detail message. 16.74/5.72 */ 16.74/5.72 public UnsupportedOperationException() { 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Constructs an UnsupportedOperationException with the specified 16.74/5.72 * detail message. 16.74/5.72 * 16.74/5.72 * @param message the detail message 16.74/5.72 */ 16.74/5.72 public UnsupportedOperationException(String message) { 16.74/5.72 super(message); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Constructs a new exception with the specified detail message and 16.74/5.72 * cause. 16.74/5.72 * 16.74/5.72 *

Note that the detail message associated with cause is 16.74/5.72 * not automatically incorporated in this exception's detail 16.74/5.72 * message. 16.74/5.72 * 16.74/5.72 * @param message the detail message (which is saved for later retrieval 16.74/5.72 * by the {@link Throwable#getMessage()} method). 16.74/5.72 * @param cause the cause (which is saved for later retrieval by the 16.74/5.72 * {@link Throwable#getCause()} method). (A null value 16.74/5.72 * is permitted, and indicates that the cause is nonexistent or 16.74/5.72 * unknown.) 16.74/5.72 * @since 1.5 16.74/5.72 */ 16.74/5.72 public UnsupportedOperationException(String message, Throwable cause) { 16.74/5.72 super(message, cause); 16.74/5.72 } 16.74/5.72 16.74/5.72 /** 16.74/5.72 * Constructs a new exception with the specified cause and a detail 16.74/5.72 * message of (cause==null ? null : cause.toString()) (which 16.74/5.72 * typically contains the class and detail message of cause). 16.74/5.72 * This constructor is useful for exceptions that are little more than 16.74/5.72 * wrappers for other throwables (for example, {@link 16.74/5.72 * java.security.PrivilegedActionException}). 16.74/5.72 * 16.74/5.72 * @param cause the cause (which is saved for later retrieval by the 16.74/5.72 * {@link Throwable#getCause()} method). (A null value is 16.74/5.72 * permitted, and indicates that the cause is nonexistent or 16.74/5.72 * unknown.) 16.74/5.72 * @since 1.5 16.74/5.72 */ 16.74/5.72 public UnsupportedOperationException(Throwable cause) { 16.74/5.72 super(cause); 16.74/5.72 } 16.74/5.72 16.74/5.72 static final long serialVersionUID = -1242599979055084673L; 16.74/5.72 } 16.74/5.72 16.74/5.72 16.74/5.72 16.74/5.72 ---------------------------------------- 16.74/5.72 16.74/5.72 (3) JBCToGraph (EQUIVALENT) 16.74/5.72 Constructed TerminationGraph. 16.74/5.72 ---------------------------------------- 16.74/5.72 16.74/5.72 (4) 16.74/5.72 Obligation: 16.74/5.72 Termination Graph based on JBC Program: 16.74/5.72 javaUtilEx.juLinkedListCreatePollLast.main([Ljava/lang/String;)V: Graph of 412 nodes with 0 SCCs. 16.74/5.72 16.74/5.72 16.74/5.72 16.74/5.72 javaUtilEx.juLinkedListCreatePollLast.createList(I)LjavaUtilEx/LinkedList;: Graph of 250 nodes with 1 SCC. 16.74/5.72 16.74/5.72 16.74/5.72 16.74/5.72 16.74/5.72 16.74/5.72 ---------------------------------------- 16.74/5.72 16.74/5.72 (5) TerminationGraphToSCCProof (SOUND) 16.74/5.72 Splitted TerminationGraph to 1 SCCs. 16.74/5.72 ---------------------------------------- 16.74/5.72 16.74/5.72 (6) 16.74/5.72 Obligation: 16.74/5.72 SCC of termination graph based on JBC Program. 16.74/5.72 SCC contains nodes from the following methods: javaUtilEx.juLinkedListCreatePollLast.createList(I)LjavaUtilEx/LinkedList; 16.74/5.72 SCC calls the following helper methods: 16.74/5.72 Performed SCC analyses: 16.74/5.72 *Used field analysis yielded the following read fields: 16.74/5.72 *java.lang.String: [count] 16.74/5.72 *javaUtilEx.LinkedList: [header, size] 16.74/5.72 *javaUtilEx.LinkedList$Entry: [previous, next] 16.74/5.72 *javaUtilEx.AbstractList: [modCount] 16.74/5.72 *Marker field analysis yielded the following relations that could be markers: 16.74/5.72 16.74/5.72 ---------------------------------------- 16.74/5.72 16.74/5.72 (7) SCCToIRSProof (SOUND) 16.74/5.72 Transformed FIGraph SCCs to intTRSs. Log: 16.74/5.72 Generated rules. Obtained 118 IRulesP rules: 16.74/5.72 f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(o7880sub), i1172)), i1187, i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4972_0_createList_LE(EOS(STATIC_4972(java.lang.Object(o7880sub), i1172)), i1187, i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4972_0_createList_LE(EOS(STATIC_4972(java.lang.Object(o7880sub), i1172)), i1187, i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4974_0_createList_Load(EOS(STATIC_4974(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: i1187 > 0 16.74/5.72 f4974_0_createList_Load(EOS(STATIC_4974(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4976_0_createList_New(EOS(STATIC_4976(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4976_0_createList_New(EOS(STATIC_4976(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4978_0_createList_Duplicate(EOS(STATIC_4978(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4978_0_createList_Duplicate(EOS(STATIC_4978(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4979_0_createList_InvokeMethod(EOS(STATIC_4979(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4979_0_createList_InvokeMethod(EOS(STATIC_4979(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4981_0_random_FieldAccess(EOS(STATIC_4981(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4981_0_random_FieldAccess(EOS(STATIC_4981(java.lang.Object(o7880sub), i1172)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4982_0_random_FieldAccess(EOS(STATIC_4982(java.lang.Object(o7880sub), i1172)), i1187, java.lang.Object(o7880sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4982_0_random_FieldAccess(EOS(STATIC_4982(java.lang.Object(o7880sub), i1172)), i1187, java.lang.Object(o7880sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4983_0_random_ArrayAccess(EOS(STATIC_4983(java.lang.Object(o7880sub), i1172)), i1187, java.lang.Object(o7880sub), i1172, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4983_0_random_ArrayAccess(EOS(STATIC_4983(java.lang.Object(ARRAY(i1198)), i1172)), i1187, java.lang.Object(ARRAY(i1198)), i1172, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4984_0_random_ArrayAccess(EOS(STATIC_4984(java.lang.Object(ARRAY(i1198)), i1172)), i1187, java.lang.Object(ARRAY(i1198)), i1172, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: i1198 >= 0 16.74/5.72 f4984_0_random_ArrayAccess(EOS(STATIC_4984(java.lang.Object(ARRAY(i1198)), i1200)), i1187, java.lang.Object(ARRAY(i1198)), i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4986_0_random_ArrayAccess(EOS(STATIC_4986(java.lang.Object(ARRAY(i1198)), i1200)), i1187, java.lang.Object(ARRAY(i1198)), i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4986_0_random_ArrayAccess(EOS(STATIC_4986(java.lang.Object(ARRAY(i1198)), i1200)), i1187, java.lang.Object(ARRAY(i1198)), i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4988_0_random_ArrayAccess(EOS(STATIC_4988(java.lang.Object(ARRAY(i1198)), i1200)), i1187, java.lang.Object(ARRAY(i1198)), i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4988_0_random_ArrayAccess(EOS(STATIC_4988(java.lang.Object(ARRAY(i1198)), i1200)), i1187, java.lang.Object(ARRAY(i1198)), i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4990_0_random_Store(EOS(STATIC_4990(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: i1200 < i1198 16.74/5.72 f4990_0_random_Store(EOS(STATIC_4990(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4993_0_random_FieldAccess(EOS(STATIC_4993(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4993_0_random_FieldAccess(EOS(STATIC_4993(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4995_0_random_ConstantStackPush(EOS(STATIC_4995(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4995_0_random_ConstantStackPush(EOS(STATIC_4995(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1200, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4997_0_random_IntArithmetic(EOS(STATIC_4997(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1200, 1, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f4997_0_random_IntArithmetic(EOS(STATIC_4997(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1200, matching1, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5000_0_random_FieldAccess(EOS(STATIC_5000(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1200 + 1, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: i1200 >= 0 && matching1 = 1 16.74/5.72 f5000_0_random_FieldAccess(EOS(STATIC_5000(java.lang.Object(ARRAY(i1198)), i1200)), i1187, o7912, i1201, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5002_0_random_Load(EOS(STATIC_5002(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5002_0_random_Load(EOS(STATIC_5002(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5004_0_random_InvokeMethod(EOS(STATIC_5004(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7912, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5004_0_random_InvokeMethod(EOS(STATIC_5004(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7914sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5007_0_random_InvokeMethod(EOS(STATIC_5007(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7914sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5007_0_random_InvokeMethod(EOS(STATIC_5007(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5010_0_random_InvokeMethod(EOS(STATIC_5010(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5010_0_random_InvokeMethod(EOS(STATIC_5010(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5013_0_length_Load(EOS(STATIC_5013(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5013_0_length_Load(EOS(STATIC_5013(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5018_0_length_FieldAccess(EOS(STATIC_5018(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(o7915sub), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5018_0_length_FieldAccess(EOS(STATIC_5018(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(java.lang.String(EOC, i1205)), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5021_0_length_FieldAccess(EOS(STATIC_5021(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(java.lang.String(EOC, i1205)), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5021_0_length_FieldAccess(EOS(STATIC_5021(java.lang.Object(ARRAY(i1198)), i1201)), i1187, java.lang.Object(java.lang.String(EOC, i1205)), o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5024_0_length_Return(EOS(STATIC_5024(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5024_0_length_Return(EOS(STATIC_5024(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5027_0_random_Return(EOS(STATIC_5027(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5027_0_random_Return(EOS(STATIC_5027(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5031_0_createList_InvokeMethod(EOS(STATIC_5031(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5031_0_createList_InvokeMethod(EOS(STATIC_5031(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5034_0__init__Load(EOS(STATIC_5034(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5034_0__init__Load(EOS(STATIC_5034(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5041_0__init__InvokeMethod(EOS(STATIC_5041(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5041_0__init__InvokeMethod(EOS(STATIC_5041(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5044_0__init__Load(EOS(STATIC_5044(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5044_0__init__Load(EOS(STATIC_5044(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5048_0__init__Load(EOS(STATIC_5048(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5048_0__init__Load(EOS(STATIC_5048(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5052_0__init__FieldAccess(EOS(STATIC_5052(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5052_0__init__FieldAccess(EOS(STATIC_5052(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5056_0__init__Return(EOS(STATIC_5056(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5056_0__init__Return(EOS(STATIC_5056(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5060_0_createList_InvokeMethod(EOS(STATIC_5060(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5060_0_createList_InvokeMethod(EOS(STATIC_5060(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5064_0_addLast_Load(EOS(STATIC_5064(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5064_0_addLast_Load(EOS(STATIC_5064(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5071_0_addLast_Load(EOS(STATIC_5071(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5071_0_addLast_Load(EOS(STATIC_5071(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5075_0_addLast_Load(EOS(STATIC_5075(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5075_0_addLast_Load(EOS(STATIC_5075(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5078_0_addLast_FieldAccess(EOS(STATIC_5078(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5078_0_addLast_FieldAccess(EOS(STATIC_5078(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5082_0_addLast_InvokeMethod(EOS(STATIC_5082(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5082_0_addLast_InvokeMethod(EOS(STATIC_5082(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5084_0_addBefore_New(EOS(STATIC_5084(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5084_0_addBefore_New(EOS(STATIC_5084(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5088_0_addBefore_Duplicate(EOS(STATIC_5088(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5088_0_addBefore_Duplicate(EOS(STATIC_5088(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5090_0_addBefore_Load(EOS(STATIC_5090(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5090_0_addBefore_Load(EOS(STATIC_5090(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5091_0_addBefore_Load(EOS(STATIC_5091(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5091_0_addBefore_Load(EOS(STATIC_5091(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5093_0_addBefore_Load(EOS(STATIC_5093(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5093_0_addBefore_Load(EOS(STATIC_5093(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5094_0_addBefore_FieldAccess(EOS(STATIC_5094(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5094_0_addBefore_FieldAccess(EOS(STATIC_5094(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5095_0_addBefore_FieldAccess(EOS(STATIC_5095(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: o7885[LinkedList$Entry.next]o7885 > 0 && o7885[LinkedList$Entry.next]o7883 > 0 && o7885[LinkedList$Entry.previous]o7883 > 0 && o7885[LinkedList$Entry.previous]o7885 > 0 16.74/5.72 f5095_0_addBefore_FieldAccess(EOS(STATIC_5095(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5097_0_addBefore_FieldAccess(EOS(STATIC_5097(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: o7884[LinkedList$Entry.previous]o7884 > 0 && o7884[LinkedList$Entry.previous]o7883 > 0 16.74/5.72 f5097_0_addBefore_FieldAccess(EOS(STATIC_5097(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5099_0_addBefore_FieldAccess(EOS(STATIC_5099(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: o7886[LinkedList$Entry.previous]o7883 > 0 && o7886[LinkedList$Entry.previous]o7886 > 0 16.74/5.72 f5099_0_addBefore_FieldAccess(EOS(STATIC_5099(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5101_0_addBefore_InvokeMethod(EOS(STATIC_5101(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5101_0_addBefore_InvokeMethod(EOS(STATIC_5101(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5102_0__init__Load(EOS(STATIC_5102(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5102_0__init__Load(EOS(STATIC_5102(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5103_0__init__InvokeMethod(EOS(STATIC_5103(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5103_0__init__InvokeMethod(EOS(STATIC_5103(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5104_0__init__Load(EOS(STATIC_5104(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5104_0__init__Load(EOS(STATIC_5104(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5105_0__init__Load(EOS(STATIC_5105(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5105_0__init__Load(EOS(STATIC_5105(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5106_0__init__FieldAccess(EOS(STATIC_5106(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5106_0__init__FieldAccess(EOS(STATIC_5106(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5107_0__init__Load(EOS(STATIC_5107(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5107_0__init__Load(EOS(STATIC_5107(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5108_0__init__Load(EOS(STATIC_5108(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5108_0__init__Load(EOS(STATIC_5108(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5109_0__init__FieldAccess(EOS(STATIC_5109(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5109_0__init__FieldAccess(EOS(STATIC_5109(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5110_0__init__Load(EOS(STATIC_5110(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5110_0__init__Load(EOS(STATIC_5110(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5111_0__init__Load(EOS(STATIC_5111(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5111_0__init__Load(EOS(STATIC_5111(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5112_0__init__FieldAccess(EOS(STATIC_5112(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5112_0__init__FieldAccess(EOS(STATIC_5112(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5113_0__init__Return(EOS(STATIC_5113(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5113_0__init__Return(EOS(STATIC_5113(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5114_0_addBefore_Store(EOS(STATIC_5114(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5114_0_addBefore_Store(EOS(STATIC_5114(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5115_0_addBefore_Load(EOS(STATIC_5115(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5115_0_addBefore_Load(EOS(STATIC_5115(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5116_0_addBefore_FieldAccess(EOS(STATIC_5116(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5116_0_addBefore_FieldAccess(EOS(STATIC_5116(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5117_0_addBefore_Load(EOS(STATIC_5117(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5117_0_addBefore_Load(EOS(STATIC_5117(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5118_0_addBefore_FieldAccess(EOS(STATIC_5118(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5118_0_addBefore_FieldAccess(EOS(STATIC_5118(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f5119_0_addBefore_FieldAccess(EOS(STATIC_5119(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: o7885[LinkedList$Entry.next]o7885 > 0 && o7886[LinkedList$Entry.previous]o7885 > 0 && o7885[LinkedList$Entry.previous]o7885 > 0 && o7885[LinkedList$Entry.next]o7886 > 0 && o7885[LinkedList$Entry.previous]o7886 > 0 && o7886[LinkedList$Entry.previous]o7886 > 0 16.74/5.72 f5118_0_addBefore_FieldAccess(EOS(STATIC_5118(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.next]o7884, o7961[LinkedList$Entry.previous]o7884, o7961[LinkedList$Entry.previous]o7884, o7961[LinkedList$Entry.next]o7961, o7961[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.next]o7961, o7961[LinkedList$Entry.previous]o7961, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5120_0_addBefore_FieldAccess(EOS(STATIC_5120(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.72 f5119_0_addBefore_FieldAccess(EOS(STATIC_5119(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5121_0_addBefore_FieldAccess(EOS(STATIC_5121(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: o7886[LinkedList$Entry.previous]o7884 > 0 && o7884[LinkedList$Entry.previous]o7884 > 0 && o7884[LinkedList$Entry.previous]o7886 > 0 && o7886[LinkedList$Entry.previous]o7886 > 0 16.74/5.72 f5121_0_addBefore_FieldAccess(EOS(STATIC_5121(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5125_0_addBefore_Load(EOS(STATIC_5125(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5125_0_addBefore_Load(EOS(STATIC_5125(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5127_0_addBefore_FieldAccess(EOS(STATIC_5127(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5127_0_addBefore_FieldAccess(EOS(STATIC_5127(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5129_0_addBefore_Load(EOS(STATIC_5129(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5129_0_addBefore_Load(EOS(STATIC_5129(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5131_0_addBefore_FieldAccess(EOS(STATIC_5131(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5131_0_addBefore_FieldAccess(EOS(STATIC_5131(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5133_0_addBefore_Load(EOS(STATIC_5133(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5133_0_addBefore_Load(EOS(STATIC_5133(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5135_0_addBefore_Duplicate(EOS(STATIC_5135(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5135_0_addBefore_Duplicate(EOS(STATIC_5135(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5137_0_addBefore_FieldAccess(EOS(STATIC_5137(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5137_0_addBefore_FieldAccess(EOS(STATIC_5137(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5139_0_addBefore_ConstantStackPush(EOS(STATIC_5139(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5139_0_addBefore_ConstantStackPush(EOS(STATIC_5139(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5141_0_addBefore_IntArithmetic(EOS(STATIC_5141(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5141_0_addBefore_IntArithmetic(EOS(STATIC_5141(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5143_0_addBefore_FieldAccess(EOS(STATIC_5143(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5143_0_addBefore_FieldAccess(EOS(STATIC_5143(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5145_0_addBefore_Load(EOS(STATIC_5145(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5145_0_addBefore_Load(EOS(STATIC_5145(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5147_0_addBefore_Duplicate(EOS(STATIC_5147(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5147_0_addBefore_Duplicate(EOS(STATIC_5147(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5149_0_addBefore_FieldAccess(EOS(STATIC_5149(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5149_0_addBefore_FieldAccess(EOS(STATIC_5149(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5151_0_addBefore_ConstantStackPush(EOS(STATIC_5151(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5151_0_addBefore_ConstantStackPush(EOS(STATIC_5151(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5153_0_addBefore_IntArithmetic(EOS(STATIC_5153(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5153_0_addBefore_IntArithmetic(EOS(STATIC_5153(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5155_0_addBefore_FieldAccess(EOS(STATIC_5155(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.72 f5155_0_addBefore_FieldAccess(EOS(STATIC_5155(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5157_0_addBefore_Load(EOS(STATIC_5157(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5157_0_addBefore_Load(EOS(STATIC_5157(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5159_0_addBefore_Return(EOS(STATIC_5159(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5159_0_addBefore_Return(EOS(STATIC_5159(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5161_0_addLast_StackPop(EOS(STATIC_5161(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5161_0_addLast_StackPop(EOS(STATIC_5161(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5163_0_addLast_Return(EOS(STATIC_5163(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5163_0_addLast_Return(EOS(STATIC_5163(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5165_0_createList_Inc(EOS(STATIC_5165(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5165_0_createList_Inc(EOS(STATIC_5165(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5167_0_createList_JMP(EOS(STATIC_5167(java.lang.Object(ARRAY(i1198)), i1201)), i1187 + -1, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5167_0_createList_JMP(EOS(STATIC_5167(java.lang.Object(ARRAY(i1198)), i1201)), i1256, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f5169_0_createList_Load(EOS(STATIC_5169(java.lang.Object(ARRAY(i1198)), i1201)), i1256, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5169_0_createList_Load(EOS(STATIC_5169(java.lang.Object(ARRAY(i1198)), i1201)), i1256, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886, o7885[LinkedList$Entry.previous]o7886) -> f4969_0_createList_Load(EOS(STATIC_4969(java.lang.Object(ARRAY(i1198)), i1201)), i1256, o7885[LinkedList$Entry.next]o7884, o7939[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7939[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7939[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7939, o7885[LinkedList$Entry.previous]o7939, o7884[LinkedList$Entry.previous]o7939, o7939[LinkedList$Entry.previous]o7939) :|: TRUE 16.74/5.73 f4969_0_createList_Load(EOS(STATIC_4969(java.lang.Object(o7880sub), i1172)), i1174, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) -> f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(o7880sub), i1172)), i1174, i1174, o7885[LinkedList$Entry.next]o7884, o7886[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.previous]o7884, o7885[LinkedList$Entry.next]o7885, o7885[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7886[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7885, o7886[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.previous]o7883, o7885[LinkedList$Entry.previous]o7885, o7885[LinkedList$Entry.next]o7886, o7885[LinkedList$Entry.previous]o7886, o7884[LinkedList$Entry.previous]o7886, o7886[LinkedList$Entry.previous]o7886) :|: TRUE 16.74/5.73 f5120_0_addBefore_FieldAccess(EOS(STATIC_5120(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5123_0_addBefore_FieldAccess(EOS(STATIC_5123(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: o7961[LinkedList$Entry.previous]o7884 > 0 && o7884[LinkedList$Entry.previous]o7884 > 0 && o7884[LinkedList$Entry.previous]o7961 > 0 && o7961[LinkedList$Entry.previous]o7961 > 0 16.74/5.73 f5123_0_addBefore_FieldAccess(EOS(STATIC_5123(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5126_0_addBefore_Load(EOS(STATIC_5126(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5126_0_addBefore_Load(EOS(STATIC_5126(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5128_0_addBefore_FieldAccess(EOS(STATIC_5128(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5128_0_addBefore_FieldAccess(EOS(STATIC_5128(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5130_0_addBefore_Load(EOS(STATIC_5130(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5130_0_addBefore_Load(EOS(STATIC_5130(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5132_0_addBefore_FieldAccess(EOS(STATIC_5132(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5132_0_addBefore_FieldAccess(EOS(STATIC_5132(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5134_0_addBefore_Load(EOS(STATIC_5134(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5134_0_addBefore_Load(EOS(STATIC_5134(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5136_0_addBefore_Duplicate(EOS(STATIC_5136(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5136_0_addBefore_Duplicate(EOS(STATIC_5136(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5138_0_addBefore_FieldAccess(EOS(STATIC_5138(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5138_0_addBefore_FieldAccess(EOS(STATIC_5138(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5140_0_addBefore_ConstantStackPush(EOS(STATIC_5140(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5140_0_addBefore_ConstantStackPush(EOS(STATIC_5140(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5142_0_addBefore_IntArithmetic(EOS(STATIC_5142(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5142_0_addBefore_IntArithmetic(EOS(STATIC_5142(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5144_0_addBefore_FieldAccess(EOS(STATIC_5144(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5144_0_addBefore_FieldAccess(EOS(STATIC_5144(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5146_0_addBefore_Load(EOS(STATIC_5146(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5146_0_addBefore_Load(EOS(STATIC_5146(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5148_0_addBefore_Duplicate(EOS(STATIC_5148(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5148_0_addBefore_Duplicate(EOS(STATIC_5148(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5150_0_addBefore_FieldAccess(EOS(STATIC_5150(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5150_0_addBefore_FieldAccess(EOS(STATIC_5150(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5152_0_addBefore_ConstantStackPush(EOS(STATIC_5152(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5152_0_addBefore_ConstantStackPush(EOS(STATIC_5152(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5154_0_addBefore_IntArithmetic(EOS(STATIC_5154(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5154_0_addBefore_IntArithmetic(EOS(STATIC_5154(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5156_0_addBefore_FieldAccess(EOS(STATIC_5156(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5156_0_addBefore_FieldAccess(EOS(STATIC_5156(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5158_0_addBefore_Load(EOS(STATIC_5158(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5158_0_addBefore_Load(EOS(STATIC_5158(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5160_0_addBefore_Return(EOS(STATIC_5160(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5160_0_addBefore_Return(EOS(STATIC_5160(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5162_0_addLast_StackPop(EOS(STATIC_5162(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5162_0_addLast_StackPop(EOS(STATIC_5162(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5164_0_addLast_Return(EOS(STATIC_5164(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5164_0_addLast_Return(EOS(STATIC_5164(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5166_0_createList_Inc(EOS(STATIC_5166(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5166_0_createList_Inc(EOS(STATIC_5166(java.lang.Object(ARRAY(i1198)), i1201)), i1187, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5168_0_createList_JMP(EOS(STATIC_5168(java.lang.Object(ARRAY(i1198)), i1201)), i1187 + -1, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5168_0_createList_JMP(EOS(STATIC_5168(java.lang.Object(ARRAY(i1198)), i1201)), i1257, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f5170_0_createList_Load(EOS(STATIC_5170(java.lang.Object(ARRAY(i1198)), i1201)), i1257, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) :|: TRUE 16.74/5.73 f5170_0_createList_Load(EOS(STATIC_5170(java.lang.Object(ARRAY(i1198)), i1201)), i1257, o7961[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7961) -> f4969_0_createList_Load(EOS(STATIC_4969(java.lang.Object(ARRAY(i1198)), i1201)), i1257, o7961[LinkedList$Entry.next]o7884, o7939[LinkedList$Entry.previous]o7884, o7961[LinkedList$Entry.previous]o7884, o7961[LinkedList$Entry.next]o7961, o7961[LinkedList$Entry.next]o7883, o7884[LinkedList$Entry.previous]o7884, o7884[LinkedList$Entry.previous]o7883, o7939[LinkedList$Entry.previous]o7883, o7884[LinkedList$Entry.previous]o7961, o7939[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.previous]o7883, o7961[LinkedList$Entry.previous]o7961, o7961[LinkedList$Entry.next]o7939, o7961[LinkedList$Entry.previous]o7939, o7884[LinkedList$Entry.previous]o7939, o7939[LinkedList$Entry.previous]o7939) :|: o7961[LinkedList$Entry.next]o7961 = 4 && o7939[LinkedList$Entry.previous]o7961 = 1 && o7961[LinkedList$Entry.next]o7939 = 1 16.74/5.73 Combined rules. Obtained 2 IRulesP rules: 16.74/5.73 f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(ARRAY(i1198:0)), i1172:0)), i1187:0, i1187:0, o7885[LinkedList$Entry.next]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0) -> f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(ARRAY(i1198:0)), i1172:0 + 1)), i1187:0 - 1, i1187:0 - 1, o7961[LinkedList$Entry.next]o7884:0, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0) :|: i1187:0 > 0 && i1198:0 > -1 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 16.74/5.73 f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(ARRAY(i1198:0)), i1172:0)), i1187:0, i1187:0, o7885[LinkedList$Entry.next]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.previous]o7883:0, o7885[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7886:0, o7885[LinkedList$Entry.previous]o7886:0, o7884[LinkedList$Entry.previous]o7886:0, o7886[LinkedList$Entry.previous]o7886:0) -> f4970_0_createList_LE(EOS(STATIC_4970(java.lang.Object(ARRAY(i1198:0)), i1172:0 + 1)), i1187:0 - 1, i1187:0 - 1, o7885[LinkedList$Entry.next]o7884:0, o7939[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7939[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.previous]o7883:0, o7885[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7939:0, o7885[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0) :|: i1187:0 > 0 && i1198:0 > -1 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7885[LinkedList$Entry.previous]o7883:0 > 0 && o7885[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7886[LinkedList$Entry.previous]o7886:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7885[LinkedList$Entry.next]o7886:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && o7885[LinkedList$Entry.previous]o7886:0 > 0 && o7884[LinkedList$Entry.previous]o7886:0 > 0 16.74/5.73 Filtered duplicate arguments: 16.74/5.73 f4970_0_createList_LE(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f4970_0_createList_LE(x1, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) 16.74/5.73 Filtered unneeded arguments: 16.74/5.73 f4970_0_createList_LE(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f4970_0_createList_LE(x1, x2, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) 16.74/5.73 Finished conversion. Obtained 2 rules.P rules: 16.74/5.73 f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, i1198:0, i1172:0) -> f4970_0_createList_LE(i1187:0 - 1, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, i1172:0 + 1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 16.74/5.73 f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.previous]o7883:0, o7885[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7886:0, o7885[LinkedList$Entry.previous]o7886:0, o7884[LinkedList$Entry.previous]o7886:0, o7886[LinkedList$Entry.previous]o7886:0, i1198:0, i1172:0) -> f4970_0_createList_LE(i1187:0 - 1, o7939[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7939[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.previous]o7883:0, o7885[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7939:0, o7885[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, i1172:0 + 1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7885[LinkedList$Entry.previous]o7883:0 > 0 && o7885[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7886[LinkedList$Entry.previous]o7886:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7885[LinkedList$Entry.next]o7886:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7886:0 > 0 && o7885[LinkedList$Entry.previous]o7886:0 > 0 16.74/5.73 16.74/5.73 ---------------------------------------- 16.74/5.73 16.74/5.73 (8) 16.74/5.73 Obligation: 16.74/5.73 Rules: 16.74/5.73 f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, i1198:0, i1172:0) -> f4970_0_createList_LE(i1187:0 - 1, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, i1172:0 + 1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 17.03/5.73 f4970_0_createList_LE(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f4970_0_createList_LE(x - 1, x18, x2, x3, x4, x5, x6, x19, x8, x20, x10, x11, x21, x22, x23, x24, x16, x17 + 1) :|: x16 > -1 && x > 0 && x16 > x17 && x17 > -1 && x4 > 0 && x3 > 0 && x10 > 0 && x11 > 0 && x6 > 0 && x5 > 0 && x15 > 0 && x7 > 0 && x9 > 0 && x12 > 0 && x1 > 0 && x14 > 0 && x13 > 0 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (9) IRSFormatTransformerProof (EQUIVALENT) 17.03/5.73 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (10) 17.03/5.73 Obligation: 17.03/5.73 Rules: 17.03/5.73 f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, i1198:0, i1172:0) -> f4970_0_createList_LE(arith, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, arith1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && arith = i1187:0 - 1 && arith1 = i1172:0 + 1 17.03/5.73 f4970_0_createList_LE(x25, x26, x27, x28, x29, x30, x31, x32, x33, x34, x35, x36, x37, x38, x39, x40, x41, x42) -> f4970_0_createList_LE(x43, x44, x27, x28, x29, x30, x31, x45, x33, x46, x35, x36, x47, x48, x49, x50, x41, x51) :|: x41 > -1 && x25 > 0 && x41 > x42 && x42 > -1 && x29 > 0 && x28 > 0 && x35 > 0 && x36 > 0 && x31 > 0 && x30 > 0 && x40 > 0 && x32 > 0 && x34 > 0 && x37 > 0 && x26 > 0 && x39 > 0 && x38 > 0 && x43 = x25 - 1 && x51 = x42 + 1 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (11) IRSwTTerminationDigraphProof (EQUIVALENT) 17.03/5.73 Constructed termination digraph! 17.03/5.73 Nodes: 17.03/5.73 (1) f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, i1198:0, i1172:0) -> f4970_0_createList_LE(arith, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, arith1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && arith = i1187:0 - 1 && arith1 = i1172:0 + 1 17.03/5.73 (2) f4970_0_createList_LE(x25, x26, x27, x28, x29, x30, x31, x32, x33, x34, x35, x36, x37, x38, x39, x40, x41, x42) -> f4970_0_createList_LE(x43, x44, x27, x28, x29, x30, x31, x45, x33, x46, x35, x36, x47, x48, x49, x50, x41, x51) :|: x41 > -1 && x25 > 0 && x41 > x42 && x42 > -1 && x29 > 0 && x28 > 0 && x35 > 0 && x36 > 0 && x31 > 0 && x30 > 0 && x40 > 0 && x32 > 0 && x34 > 0 && x37 > 0 && x26 > 0 && x39 > 0 && x38 > 0 && x43 = x25 - 1 && x51 = x42 + 1 17.03/5.73 17.03/5.73 Arcs: 17.03/5.73 (1) -> (2) 17.03/5.73 (2) -> (1), (2) 17.03/5.73 17.03/5.73 This digraph is fully evaluated! 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (12) 17.03/5.73 Obligation: 17.03/5.73 17.03/5.73 Termination digraph: 17.03/5.73 Nodes: 17.03/5.73 (1) f4970_0_createList_LE(i1187:0, o7886[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, o7885[LinkedList$Entry.next]o7885:0, o7885[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, o7885[LinkedList$Entry.next]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, o7884[LinkedList$Entry.previous]o7885:0, o7886[LinkedList$Entry.previous]o7885:0, i1198:0, i1172:0) -> f4970_0_createList_LE(arith, o7939[LinkedList$Entry.previous]o7884:0, o7886[LinkedList$Entry.previous]o7884:0, 4, o7961[LinkedList$Entry.next]o7883:0, o7884[LinkedList$Entry.previous]o7884:0, o7884[LinkedList$Entry.previous]o7883:0, o7939[LinkedList$Entry.previous]o7883:0, o7884[LinkedList$Entry.previous]o7885:0, 1, o7886[LinkedList$Entry.previous]o7883:0, o7886[LinkedList$Entry.previous]o7885:0, 1, o7961[LinkedList$Entry.previous]o7939:0, o7884[LinkedList$Entry.previous]o7939:0, o7939[LinkedList$Entry.previous]o7939:0, i1198:0, arith1) :|: i1198:0 > -1 && i1187:0 > 0 && i1198:0 > i1172:0 && i1172:0 > -1 && o7885[LinkedList$Entry.next]o7883:0 > 0 && o7885[LinkedList$Entry.next]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0 > 0 && o7884[LinkedList$Entry.previous]o7885:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0 > 0 && arith = i1187:0 - 1 && arith1 = i1172:0 + 1 17.03/5.73 (2) f4970_0_createList_LE(x25, x26, x27, x28, x29, x30, x31, x32, x33, x34, x35, x36, x37, x38, x39, x40, x41, x42) -> f4970_0_createList_LE(x43, x44, x27, x28, x29, x30, x31, x45, x33, x46, x35, x36, x47, x48, x49, x50, x41, x51) :|: x41 > -1 && x25 > 0 && x41 > x42 && x42 > -1 && x29 > 0 && x28 > 0 && x35 > 0 && x36 > 0 && x31 > 0 && x30 > 0 && x40 > 0 && x32 > 0 && x34 > 0 && x37 > 0 && x26 > 0 && x39 > 0 && x38 > 0 && x43 = x25 - 1 && x51 = x42 + 1 17.03/5.73 17.03/5.73 Arcs: 17.03/5.73 (1) -> (2) 17.03/5.73 (2) -> (1), (2) 17.03/5.73 17.03/5.73 This digraph is fully evaluated! 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (13) IntTRSCompressionProof (EQUIVALENT) 17.03/5.73 Compressed rules. 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (14) 17.03/5.73 Obligation: 17.03/5.73 Rules: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(i1187:0:0 - 1, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, 4, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, 1, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, 1, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, i1172:0:0 + 1) :|: o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1 17.03/5.73 f4970_0_createList_LE(x25:0, x26:0, x27:0, x28:0, x29:0, x30:0, x31:0, x32:0, x33:0, x34:0, x35:0, x36:0, x37:0, x38:0, x39:0, x40:0, x41:0, x42:0) -> f4970_0_createList_LE(x25:0 - 1, x44:0, x27:0, x28:0, x29:0, x30:0, x31:0, x45:0, x33:0, x46:0, x35:0, x36:0, x47:0, x48:0, x49:0, x50:0, x41:0, x42:0 + 1) :|: x39:0 > 0 && x38:0 > 0 && x26:0 > 0 && x37:0 > 0 && x34:0 > 0 && x32:0 > 0 && x40:0 > 0 && x30:0 > 0 && x31:0 > 0 && x36:0 > 0 && x35:0 > 0 && x28:0 > 0 && x29:0 > 0 && x42:0 > -1 && x42:0 < x41:0 && x25:0 > 0 && x41:0 > -1 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (15) TempFilterProof (SOUND) 17.03/5.73 Used the following sort dictionary for filtering: 17.03/5.73 f4970_0_createList_LE(INTEGER, VARIABLE, VARIABLE, VARIABLE, VARIABLE, INTEGER, INTEGER, VARIABLE, VARIABLE, VARIABLE, INTEGER, INTEGER, VARIABLE, VARIABLE, VARIABLE, VARIABLE, INTEGER, INTEGER) 17.03/5.73 Replaced non-predefined constructor symbols by 0. 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (16) 17.03/5.73 Obligation: 17.03/5.73 Rules: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(c, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, c1, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, c2, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, c3, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, c4) :|: c4 = i1172:0:0 + 1 && (c3 = 1 && (c2 = 1 && (c1 = 4 && c = i1187:0:0 - 1))) && (o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1) 17.03/5.73 f4970_0_createList_LE(x25:0, x26:0, x27:0, x28:0, x29:0, x30:0, x31:0, x32:0, x33:0, x34:0, x35:0, x36:0, x37:0, x38:0, x39:0, x40:0, x41:0, x42:0) -> f4970_0_createList_LE(c5, x44:0, x27:0, x28:0, x29:0, x30:0, x31:0, x45:0, x33:0, x46:0, x35:0, x36:0, x47:0, x48:0, x49:0, x50:0, x41:0, c6) :|: c6 = x42:0 + 1 && c5 = x25:0 - 1 && (x39:0 > 0 && x38:0 > 0 && x26:0 > 0 && x37:0 > 0 && x34:0 > 0 && x32:0 > 0 && x40:0 > 0 && x30:0 > 0 && x31:0 > 0 && x36:0 > 0 && x35:0 > 0 && x28:0 > 0 && x29:0 > 0 && x42:0 > -1 && x42:0 < x41:0 && x25:0 > 0 && x41:0 > -1) 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (17) PolynomialOrderProcessor (EQUIVALENT) 17.03/5.73 Found the following polynomial interpretation: 17.03/5.73 [f4970_0_createList_LE(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17)] = -5 + 3*x + x3 + x5 17.03/5.73 17.03/5.73 The following rules are decreasing: 17.03/5.73 f4970_0_createList_LE(x25:0, x26:0, x27:0, x28:0, x29:0, x30:0, x31:0, x32:0, x33:0, x34:0, x35:0, x36:0, x37:0, x38:0, x39:0, x40:0, x41:0, x42:0) -> f4970_0_createList_LE(c5, x44:0, x27:0, x28:0, x29:0, x30:0, x31:0, x45:0, x33:0, x46:0, x35:0, x36:0, x47:0, x48:0, x49:0, x50:0, x41:0, c6) :|: c6 = x42:0 + 1 && c5 = x25:0 - 1 && (x39:0 > 0 && x38:0 > 0 && x26:0 > 0 && x37:0 > 0 && x34:0 > 0 && x32:0 > 0 && x40:0 > 0 && x30:0 > 0 && x31:0 > 0 && x36:0 > 0 && x35:0 > 0 && x28:0 > 0 && x29:0 > 0 && x42:0 > -1 && x42:0 < x41:0 && x25:0 > 0 && x41:0 > -1) 17.03/5.73 The following rules are bounded: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(c, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, c1, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, c2, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, c3, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, c4) :|: c4 = i1172:0:0 + 1 && (c3 = 1 && (c2 = 1 && (c1 = 4 && c = i1187:0:0 - 1))) && (o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1) 17.03/5.73 f4970_0_createList_LE(x25:0, x26:0, x27:0, x28:0, x29:0, x30:0, x31:0, x32:0, x33:0, x34:0, x35:0, x36:0, x37:0, x38:0, x39:0, x40:0, x41:0, x42:0) -> f4970_0_createList_LE(c5, x44:0, x27:0, x28:0, x29:0, x30:0, x31:0, x45:0, x33:0, x46:0, x35:0, x36:0, x47:0, x48:0, x49:0, x50:0, x41:0, c6) :|: c6 = x42:0 + 1 && c5 = x25:0 - 1 && (x39:0 > 0 && x38:0 > 0 && x26:0 > 0 && x37:0 > 0 && x34:0 > 0 && x32:0 > 0 && x40:0 > 0 && x30:0 > 0 && x31:0 > 0 && x36:0 > 0 && x35:0 > 0 && x28:0 > 0 && x29:0 > 0 && x42:0 > -1 && x42:0 < x41:0 && x25:0 > 0 && x41:0 > -1) 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (18) 17.03/5.73 Obligation: 17.03/5.73 Rules: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(c, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, c1, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, c2, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, c3, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, c4) :|: c4 = i1172:0:0 + 1 && (c3 = 1 && (c2 = 1 && (c1 = 4 && c = i1187:0:0 - 1))) && (o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1) 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (19) RankingReductionPairProof (EQUIVALENT) 17.03/5.73 Interpretation: 17.03/5.73 [ f4970_0_createList_LE ] = f4970_0_createList_LE_1 17.03/5.73 17.03/5.73 The following rules are decreasing: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(c, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, c1, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, c2, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, c3, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, c4) :|: c4 = i1172:0:0 + 1 && (c3 = 1 && (c2 = 1 && (c1 = 4 && c = i1187:0:0 - 1))) && (o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1) 17.03/5.73 17.03/5.73 The following rules are bounded: 17.03/5.73 f4970_0_createList_LE(i1187:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7885[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7885[LinkedList$Entry.next]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, i1198:0:0, i1172:0:0) -> f4970_0_createList_LE(c, o7939[LinkedList$Entry.previous]o7884:0:0, o7886[LinkedList$Entry.previous]o7884:0:0, c1, o7961[LinkedList$Entry.next]o7883:0:0, o7884[LinkedList$Entry.previous]o7884:0:0, o7884[LinkedList$Entry.previous]o7883:0:0, o7939[LinkedList$Entry.previous]o7883:0:0, o7884[LinkedList$Entry.previous]o7885:0:0, c2, o7886[LinkedList$Entry.previous]o7883:0:0, o7886[LinkedList$Entry.previous]o7885:0:0, c3, o7961[LinkedList$Entry.previous]o7939:0:0, o7884[LinkedList$Entry.previous]o7939:0:0, o7939[LinkedList$Entry.previous]o7939:0:0, i1198:0:0, c4) :|: c4 = i1172:0:0 + 1 && (c3 = 1 && (c2 = 1 && (c1 = 4 && c = i1187:0:0 - 1))) && (o7884[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7884:0:0 > 0 && o7884[LinkedList$Entry.previous]o7883:0:0 > 0 && o7886[LinkedList$Entry.previous]o7885:0:0 > 0 && o7886[LinkedList$Entry.previous]o7883:0:0 > 0 && o7885[LinkedList$Entry.next]o7885:0:0 > 0 && o7885[LinkedList$Entry.next]o7883:0:0 > 0 && i1172:0:0 > -1 && i1198:0:0 > i1172:0:0 && i1187:0:0 > 0 && i1198:0:0 > -1) 17.03/5.73 17.03/5.73 17.03/5.73 ---------------------------------------- 17.03/5.73 17.03/5.73 (20) 17.03/5.73 YES 17.03/5.77 EOF