24.21/9.49 YES 24.26/9.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 24.26/9.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 24.26/9.51 24.26/9.51 24.26/9.51 termination of the given Bare JBC problem could be proven: 24.26/9.51 24.26/9.51 (0) Bare JBC problem 24.26/9.51 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 24.26/9.51 (2) JBC problem 24.26/9.51 (3) JBCToGraph [EQUIVALENT, 2489 ms] 24.26/9.51 (4) JBCTerminationGraph 24.26/9.51 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 24.26/9.51 (6) AND 24.26/9.51 (7) JBCTerminationSCC 24.26/9.51 (8) SCCToIRSProof [SOUND, 222 ms] 24.26/9.51 (9) IRSwT 24.26/9.51 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 24.26/9.51 (11) IRSwT 24.26/9.51 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 32 ms] 24.26/9.51 (13) IRSwT 24.26/9.51 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 24.26/9.51 (15) IRSwT 24.26/9.51 (16) TempFilterProof [SOUND, 943 ms] 24.26/9.51 (17) IRSwT 24.26/9.51 (18) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 24.26/9.51 (19) IRSwT 24.26/9.51 (20) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] 24.26/9.51 (21) IRSwT 24.26/9.51 (22) TempFilterProof [SOUND, 1 ms] 24.26/9.51 (23) IRSwT 24.26/9.51 (24) IRSwTToQDPProof [SOUND, 0 ms] 24.26/9.51 (25) QDP 24.26/9.51 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 24.26/9.51 (27) YES 24.26/9.51 (28) JBCTerminationSCC 24.26/9.51 (29) SCCToIRSProof [SOUND, 224 ms] 24.26/9.51 (30) IRSwT 24.26/9.51 (31) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 24.26/9.51 (32) IRSwT 24.26/9.51 (33) IRSwTTerminationDigraphProof [EQUIVALENT, 44 ms] 24.26/9.51 (34) IRSwT 24.26/9.51 (35) IntTRSCompressionProof [EQUIVALENT, 0 ms] 24.26/9.51 (36) IRSwT 24.26/9.51 (37) TempFilterProof [SOUND, 26 ms] 24.26/9.51 (38) IRSwT 24.26/9.51 (39) IRSwTToQDPProof [SOUND, 0 ms] 24.26/9.51 (40) QDP 24.26/9.51 (41) QDPSizeChangeProof [EQUIVALENT, 0 ms] 24.26/9.51 (42) YES 24.26/9.51 (43) JBCTerminationSCC 24.26/9.51 (44) SCCToIRSProof [SOUND, 830 ms] 24.26/9.51 (45) IRSwT 24.26/9.51 (46) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 24.26/9.51 (47) IRSwT 24.26/9.51 (48) IRSwTTerminationDigraphProof [EQUIVALENT, 39 ms] 24.26/9.51 (49) IRSwT 24.26/9.51 (50) IntTRSCompressionProof [EQUIVALENT, 0 ms] 24.26/9.51 (51) IRSwT 24.26/9.51 (52) TempFilterProof [SOUND, 42 ms] 24.26/9.51 (53) IntTRS 24.26/9.51 (54) PolynomialOrderProcessor [EQUIVALENT, 16 ms] 24.26/9.51 (55) YES 24.26/9.51 24.26/9.51 24.26/9.51 ---------------------------------------- 24.26/9.51 24.26/9.51 (0) 24.26/9.51 Obligation: 24.26/9.51 need to prove termination of the following program: 24.26/9.51 /* 24.26/9.51 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.51 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.51 * 24.26/9.51 * This code is free software; you can redistribute it and/or modify it 24.26/9.51 * under the terms of the GNU General Public License version 2 only, as 24.26/9.51 * published by the Free Software Foundation. Sun designates this 24.26/9.51 * particular file as subject to the "Classpath" exception as provided 24.26/9.51 * by Sun in the LICENSE file that accompanied this code. 24.26/9.51 * 24.26/9.51 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.51 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.51 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.51 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.51 * accompanied this code). 24.26/9.51 * 24.26/9.51 * You should have received a copy of the GNU General Public License version 24.26/9.51 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.51 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.51 * 24.26/9.51 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.51 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.51 * have any questions. 24.26/9.51 */ 24.26/9.51 24.26/9.51 package javaUtilEx; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * This class provides a skeletal implementation of the Collection 24.26/9.51 * interface, to minimize the effort required to implement this interface.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

To implement an unmodifiable map, the programmer needs only to extend this 24.26/9.51 * class and provide an implementation for the entrySet method, which 24.26/9.51 * returns a set-view of the map's mappings. Typically, the returned set 24.26/9.51 * will, in turn, be implemented atop AbstractSet. This set should 24.26/9.51 * not support the add or remove methods, and its iterator 24.26/9.51 * should not support the remove method. 24.26/9.51 * 24.26/9.51 *

To implement a modifiable map, the programmer must additionally override 24.26/9.51 * this class's put method (which otherwise throws an 24.26/9.51 * UnsupportedOperationException), and the iterator returned by 24.26/9.51 * entrySet().iterator() must additionally implement its 24.26/9.51 * remove method. 24.26/9.51 * 24.26/9.51 *

The programmer should generally provide a void (no argument) and map 24.26/9.51 * constructor, as per the recommendation in the Map interface 24.26/9.51 * specification. 24.26/9.51 * 24.26/9.51 *

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

This class is a member of the 24.26/9.51 * 24.26/9.51 * Java Collections Framework. 24.26/9.51 * 24.26/9.51 * @param the type of keys maintained by this map 24.26/9.51 * @param the type of mapped values 24.26/9.51 * 24.26/9.51 * @author Josh Bloch 24.26/9.51 * @author Neal Gafter 24.26/9.51 * @see Map 24.26/9.51 * @see Collection 24.26/9.51 * @since 1.2 24.26/9.51 */ 24.26/9.51 24.26/9.51 public abstract class AbstractMap implements Map { 24.26/9.51 /** 24.26/9.51 * Sole constructor. (For invocation by subclass constructors, typically 24.26/9.51 * implicit.) 24.26/9.51 */ 24.26/9.51 protected AbstractMap() { 24.26/9.51 } 24.26/9.51 24.26/9.51 // Query Operations 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation returns entrySet().size(). 24.26/9.51 */ 24.26/9.51 public int size() { 24.26/9.51 return entrySet().size(); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

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

This implementation iterates over entrySet() searching 24.26/9.51 * for an entry with the specified value. If such an entry is found, 24.26/9.51 * true is returned. If the iteration terminates without 24.26/9.51 * finding such an entry, false is returned. Note that this 24.26/9.51 * implementation requires linear time in the size of the map. 24.26/9.51 * 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public boolean containsValue(Object value) { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 if (value==null) { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (e.getValue()==null) 24.26/9.51 return true; 24.26/9.51 } 24.26/9.51 } else { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (value.equals(e.getValue())) 24.26/9.51 return true; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 return false; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation iterates over entrySet() searching 24.26/9.51 * for an entry with the specified key. If such an entry is found, 24.26/9.51 * true is returned. If the iteration terminates without 24.26/9.51 * finding such an entry, false is returned. Note that this 24.26/9.51 * implementation requires linear time in the size of the map; many 24.26/9.51 * implementations will override this method. 24.26/9.51 * 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public boolean containsKey(Object key) { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 if (key==null) { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (e.getKey()==null) 24.26/9.51 return true; 24.26/9.51 } 24.26/9.51 } else { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (key.equals(e.getKey())) 24.26/9.51 return true; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 return false; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation iterates over entrySet() searching 24.26/9.51 * for an entry with the specified key. If such an entry is found, 24.26/9.51 * the entry's value is returned. If the iteration terminates without 24.26/9.51 * finding such an entry, null is returned. Note that this 24.26/9.51 * implementation requires linear time in the size of the map; many 24.26/9.51 * implementations will override this method. 24.26/9.51 * 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public V get(Object key) { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 if (key==null) { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (e.getKey()==null) 24.26/9.51 return e.getValue(); 24.26/9.51 } 24.26/9.51 } else { 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (key.equals(e.getKey())) 24.26/9.51 return e.getValue(); 24.26/9.51 } 24.26/9.51 } 24.26/9.51 return null; 24.26/9.51 } 24.26/9.51 24.26/9.51 24.26/9.51 // Modification Operations 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation always throws an 24.26/9.51 * UnsupportedOperationException. 24.26/9.51 * 24.26/9.51 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 * @throws IllegalArgumentException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public V put(K key, V value) { 24.26/9.51 throw new UnsupportedOperationException(); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation iterates over entrySet() searching for an 24.26/9.51 * entry with the specified key. If such an entry is found, its value is 24.26/9.51 * obtained with its getValue operation, the entry is removed 24.26/9.51 * from the collection (and the backing map) with the iterator's 24.26/9.51 * remove operation, and the saved value is returned. If the 24.26/9.51 * iteration terminates without finding such an entry, null is 24.26/9.51 * returned. Note that this implementation requires linear time in the 24.26/9.51 * size of the map; many implementations will override this method. 24.26/9.51 * 24.26/9.51 *

Note that this implementation throws an 24.26/9.51 * UnsupportedOperationException if the entrySet 24.26/9.51 * iterator does not support the remove method and this map 24.26/9.51 * contains a mapping for the specified key. 24.26/9.51 * 24.26/9.51 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public V remove(Object key) { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 Entry correctEntry = null; 24.26/9.51 if (key==null) { 24.26/9.51 while (correctEntry==null && i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (e.getKey()==null) 24.26/9.51 correctEntry = e; 24.26/9.51 } 24.26/9.51 } else { 24.26/9.51 while (correctEntry==null && i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 if (key.equals(e.getKey())) 24.26/9.51 correctEntry = e; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 24.26/9.51 V oldValue = null; 24.26/9.51 if (correctEntry !=null) { 24.26/9.51 oldValue = correctEntry.getValue(); 24.26/9.51 i.remove(); 24.26/9.51 } 24.26/9.51 return oldValue; 24.26/9.51 } 24.26/9.51 24.26/9.51 24.26/9.51 // Bulk Operations 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation iterates over the specified map's 24.26/9.51 * entrySet() collection, and calls this map's put 24.26/9.51 * operation once for each entry returned by the iteration. 24.26/9.51 * 24.26/9.51 *

Note that this implementation throws an 24.26/9.51 * UnsupportedOperationException if this map does not support 24.26/9.51 * the put operation and the specified map is nonempty. 24.26/9.51 * 24.26/9.51 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.51 * @throws ClassCastException {@inheritDoc} 24.26/9.51 * @throws NullPointerException {@inheritDoc} 24.26/9.51 * @throws IllegalArgumentException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public void putAll(Map m) { 24.26/9.51 Iterator it = m.entrySet().iterator(); 24.26/9.51 while (it.hasNext()) { 24.26/9.51 Map.Entry e = (Map.Entry) it.next(); 24.26/9.51 put((K) e.getKey(), (V) e.getValue()); 24.26/9.51 } 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation calls entrySet().clear(). 24.26/9.51 * 24.26/9.51 *

Note that this implementation throws an 24.26/9.51 * UnsupportedOperationException if the entrySet 24.26/9.51 * does not support the clear operation. 24.26/9.51 * 24.26/9.51 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.51 */ 24.26/9.51 public void clear() { 24.26/9.51 entrySet().clear(); 24.26/9.51 } 24.26/9.51 24.26/9.51 24.26/9.51 // Views 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Each of these fields are initialized to contain an instance of the 24.26/9.51 * appropriate view the first time this view is requested. The views are 24.26/9.51 * stateless, so there's no reason to create more than one of each. 24.26/9.51 */ 24.26/9.51 transient volatile Set keySet = null; 24.26/9.51 transient volatile Collection values = null; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation returns a set that subclasses {@link AbstractSet}. 24.26/9.51 * The subclass's iterator method returns a "wrapper object" over this 24.26/9.51 * map's entrySet() iterator. The size method 24.26/9.51 * delegates to this map's size method and the 24.26/9.51 * contains method delegates to this map's 24.26/9.51 * containsKey method. 24.26/9.51 * 24.26/9.51 *

The set is created the first time this method is called, 24.26/9.51 * and returned in response to all subsequent calls. No synchronization 24.26/9.51 * is performed, so there is a slight chance that multiple calls to this 24.26/9.51 * method will not all return the same set. 24.26/9.51 */ 24.26/9.51 public Set keySet() { 24.26/9.51 if (keySet == null) { 24.26/9.51 keySet = new AbstractSet() { 24.26/9.51 public Iterator iterator() { 24.26/9.51 return new Iterator() { 24.26/9.51 private Iterator> i = entrySet().iterator(); 24.26/9.51 24.26/9.51 public boolean hasNext() { 24.26/9.51 return i.hasNext(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public K next() { 24.26/9.51 return i.next().getKey(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public void remove() { 24.26/9.51 i.remove(); 24.26/9.51 } 24.26/9.51 }; 24.26/9.51 } 24.26/9.51 24.26/9.51 public int size() { 24.26/9.51 return AbstractMap.this.size(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public boolean isEmpty() { 24.26/9.51 return AbstractMap.this.isEmpty(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public void clear() { 24.26/9.51 AbstractMap.this.clear(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public boolean contains(Object k) { 24.26/9.51 return AbstractMap.this.containsKey(k); 24.26/9.51 } 24.26/9.51 24.26/9.51 public Object[] toArray() { 24.26/9.51 Object[] res = new Object[AbstractMap.this.size()]; 24.26/9.51 Iterator> it = entrySet().iterator(); 24.26/9.51 int i = 0; 24.26/9.51 while (it.hasNext()) 24.26/9.51 res[i++] = it.next().getKey(); 24.26/9.51 return res; 24.26/9.51 } 24.26/9.51 24.26/9.51 public T[] toArray(T[] a) { 24.26/9.51 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.51 a.getClass().getComponentType(), AbstractMap.this.size()); 24.26/9.51 Object[] res = a; 24.26/9.51 Iterator> it = entrySet().iterator(); 24.26/9.51 int i = 0; 24.26/9.51 while (it.hasNext()) 24.26/9.51 res[i++] = it.next().getKey(); 24.26/9.51 return a; 24.26/9.51 } 24.26/9.51 }; 24.26/9.51 } 24.26/9.51 return keySet; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * {@inheritDoc} 24.26/9.51 * 24.26/9.51 *

This implementation returns a collection that subclasses {@link 24.26/9.51 * AbstractCollection}. The subclass's iterator method returns a 24.26/9.51 * "wrapper object" over this map's entrySet() iterator. 24.26/9.51 * The size method delegates to this map's size 24.26/9.51 * method and the contains method delegates to this map's 24.26/9.51 * containsValue method. 24.26/9.51 * 24.26/9.51 *

The collection is created the first time this method is called, and 24.26/9.51 * returned in response to all subsequent calls. No synchronization is 24.26/9.51 * performed, so there is a slight chance that multiple calls to this 24.26/9.51 * method will not all return the same collection. 24.26/9.51 */ 24.26/9.51 public Collection values() { 24.26/9.51 if (values == null) { 24.26/9.51 values = new AbstractCollection() { 24.26/9.51 public Iterator iterator() { 24.26/9.51 return new Iterator() { 24.26/9.51 private Iterator> i = entrySet().iterator(); 24.26/9.51 24.26/9.51 public boolean hasNext() { 24.26/9.51 return i.hasNext(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public V next() { 24.26/9.51 return i.next().getValue(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public void remove() { 24.26/9.51 i.remove(); 24.26/9.51 } 24.26/9.51 }; 24.26/9.51 } 24.26/9.51 24.26/9.51 public int size() { 24.26/9.51 return AbstractMap.this.size(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public boolean isEmpty() { 24.26/9.51 return AbstractMap.this.isEmpty(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public void clear() { 24.26/9.51 AbstractMap.this.clear(); 24.26/9.51 } 24.26/9.51 24.26/9.51 public boolean contains(Object v) { 24.26/9.51 return AbstractMap.this.containsValue(v); 24.26/9.51 } 24.26/9.51 }; 24.26/9.51 } 24.26/9.51 return values; 24.26/9.51 } 24.26/9.51 24.26/9.51 public abstract Set> entrySet(); 24.26/9.51 24.26/9.51 24.26/9.51 // Comparison and hashing 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Compares the specified object with this map for equality. Returns 24.26/9.51 * true if the given object is also a map and the two maps 24.26/9.51 * represent the same mappings. More formally, two maps m1 and 24.26/9.51 * m2 represent the same mappings if 24.26/9.51 * m1.entrySet().equals(m2.entrySet()). This ensures that the 24.26/9.51 * equals method works properly across different implementations 24.26/9.51 * of the Map interface. 24.26/9.51 * 24.26/9.51 *

This implementation first checks if the specified object is this map; 24.26/9.51 * if so it returns true. Then, it checks if the specified 24.26/9.51 * object is a map whose size is identical to the size of this map; if 24.26/9.51 * not, it returns false. If so, it iterates over this map's 24.26/9.51 * entrySet collection, and checks that the specified map 24.26/9.51 * contains each mapping that this map contains. If the specified map 24.26/9.51 * fails to contain such a mapping, false is returned. If the 24.26/9.51 * iteration completes, true is returned. 24.26/9.51 * 24.26/9.51 * @param o object to be compared for equality with this map 24.26/9.51 * @return true if the specified object is equal to this map 24.26/9.51 */ 24.26/9.51 public boolean equals(Object o) { 24.26/9.51 if (o == this) 24.26/9.51 return true; 24.26/9.51 24.26/9.51 if (!(o instanceof Map)) 24.26/9.51 return false; 24.26/9.51 Map m = (Map) o; 24.26/9.51 if (m.size() != size()) 24.26/9.51 return false; 24.26/9.51 24.26/9.51 try { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 while (i.hasNext()) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 K key = e.getKey(); 24.26/9.51 V value = e.getValue(); 24.26/9.51 if (value == null) { 24.26/9.51 if (!(m.get(key)==null && m.containsKey(key))) 24.26/9.51 return false; 24.26/9.51 } else { 24.26/9.51 if (!value.equals(m.get(key))) 24.26/9.51 return false; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 } catch (ClassCastException unused) { 24.26/9.51 return false; 24.26/9.51 } catch (NullPointerException unused) { 24.26/9.51 return false; 24.26/9.51 } 24.26/9.51 24.26/9.51 return true; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the hash code value for this map. The hash code of a map is 24.26/9.51 * defined to be the sum of the hash codes of each entry in the map's 24.26/9.51 * entrySet() view. This ensures that m1.equals(m2) 24.26/9.51 * implies that m1.hashCode()==m2.hashCode() for any two maps 24.26/9.51 * m1 and m2, as required by the general contract of 24.26/9.51 * {@link Object#hashCode}. 24.26/9.51 * 24.26/9.51 *

This implementation iterates over entrySet(), calling 24.26/9.51 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the 24.26/9.51 * set, and adding up the results. 24.26/9.51 * 24.26/9.51 * @return the hash code value for this map 24.26/9.51 * @see Map.Entry#hashCode() 24.26/9.51 * @see Object#equals(Object) 24.26/9.51 * @see Set#equals(Object) 24.26/9.51 */ 24.26/9.51 public int hashCode() { 24.26/9.51 int h = 0; 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 while (i.hasNext()) 24.26/9.51 h += i.next().hashCode(); 24.26/9.51 return h; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns a string representation of this map. The string representation 24.26/9.51 * consists of a list of key-value mappings in the order returned by the 24.26/9.51 * map's entrySet view's iterator, enclosed in braces 24.26/9.51 * ("{}"). Adjacent mappings are separated by the characters 24.26/9.51 * ", " (comma and space). Each key-value mapping is rendered as 24.26/9.51 * the key followed by an equals sign ("=") followed by the 24.26/9.51 * associated value. Keys and values are converted to strings as by 24.26/9.51 * {@link String#valueOf(Object)}. 24.26/9.51 * 24.26/9.51 * @return a string representation of this map 24.26/9.51 */ 24.26/9.51 public String toString() { 24.26/9.51 Iterator> i = entrySet().iterator(); 24.26/9.51 if (! i.hasNext()) 24.26/9.51 return "{}"; 24.26/9.51 24.26/9.51 StringBuilder sb = new StringBuilder(); 24.26/9.51 sb.append('{'); 24.26/9.51 for (;;) { 24.26/9.51 Entry e = i.next(); 24.26/9.51 K key = e.getKey(); 24.26/9.51 V value = e.getValue(); 24.26/9.51 sb.append(key == this ? "(this Map)" : key); 24.26/9.51 sb.append('='); 24.26/9.51 sb.append(value == this ? "(this Map)" : value); 24.26/9.51 if (! i.hasNext()) 24.26/9.51 return sb.append('}').toString(); 24.26/9.51 sb.append(", "); 24.26/9.51 } 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns a shallow copy of this AbstractMap instance: the keys 24.26/9.51 * and values themselves are not cloned. 24.26/9.51 * 24.26/9.51 * @return a shallow copy of this map 24.26/9.51 */ 24.26/9.51 protected Object clone() throws CloneNotSupportedException { 24.26/9.51 AbstractMap result = (AbstractMap)super.clone(); 24.26/9.51 result.keySet = null; 24.26/9.51 result.values = null; 24.26/9.51 return result; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Utility method for SimpleEntry and SimpleImmutableEntry. 24.26/9.51 * Test for equality, checking for nulls. 24.26/9.51 */ 24.26/9.51 private static boolean eq(Object o1, Object o2) { 24.26/9.51 return o1 == null ? o2 == null : o1.equals(o2); 24.26/9.51 } 24.26/9.51 24.26/9.51 // Implementation Note: SimpleEntry and SimpleImmutableEntry 24.26/9.51 // are distinct unrelated classes, even though they share 24.26/9.51 // some code. Since you can't add or subtract final-ness 24.26/9.51 // of a field in a subclass, they can't share representations, 24.26/9.51 // and the amount of duplicated code is too small to warrant 24.26/9.51 // exposing a common abstract class. 24.26/9.51 24.26/9.51 24.26/9.51 /** 24.26/9.51 * An Entry maintaining a key and a value. The value may be 24.26/9.51 * changed using the setValue method. This class 24.26/9.51 * facilitates the process of building custom map 24.26/9.51 * implementations. For example, it may be convenient to return 24.26/9.51 * arrays of SimpleEntry instances in method 24.26/9.51 * Map.entrySet().toArray. 24.26/9.51 * 24.26/9.51 * @since 1.6 24.26/9.51 */ 24.26/9.51 public static class SimpleEntry 24.26/9.51 implements Entry, java.io.Serializable 24.26/9.51 { 24.26/9.51 private static final long serialVersionUID = -8499721149061103585L; 24.26/9.51 24.26/9.51 private final K key; 24.26/9.51 private V value; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Creates an entry representing a mapping from the specified 24.26/9.51 * key to the specified value. 24.26/9.51 * 24.26/9.51 * @param key the key represented by this entry 24.26/9.51 * @param value the value represented by this entry 24.26/9.51 */ 24.26/9.51 public SimpleEntry(K key, V value) { 24.26/9.51 this.key = key; 24.26/9.51 this.value = value; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Creates an entry representing the same mapping as the 24.26/9.51 * specified entry. 24.26/9.51 * 24.26/9.51 * @param entry the entry to copy 24.26/9.51 */ 24.26/9.51 public SimpleEntry(Entry entry) { 24.26/9.51 this.key = entry.getKey(); 24.26/9.51 this.value = entry.getValue(); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the key corresponding to this entry. 24.26/9.51 * 24.26/9.51 * @return the key corresponding to this entry 24.26/9.51 */ 24.26/9.51 public K getKey() { 24.26/9.51 return key; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the value corresponding to this entry. 24.26/9.51 * 24.26/9.51 * @return the value corresponding to this entry 24.26/9.51 */ 24.26/9.51 public V getValue() { 24.26/9.51 return value; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Replaces the value corresponding to this entry with the specified 24.26/9.51 * value. 24.26/9.51 * 24.26/9.51 * @param value new value to be stored in this entry 24.26/9.51 * @return the old value corresponding to the entry 24.26/9.51 */ 24.26/9.51 public V setValue(V value) { 24.26/9.51 V oldValue = this.value; 24.26/9.51 this.value = value; 24.26/9.51 return oldValue; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Compares the specified object with this entry for equality. 24.26/9.51 * Returns {@code true} if the given object is also a map entry and 24.26/9.51 * the two entries represent the same mapping. More formally, two 24.26/9.51 * entries {@code e1} and {@code e2} represent the same mapping 24.26/9.51 * if

24.26/9.51	         *   (e1.getKey()==null ?
24.26/9.51	         *    e2.getKey()==null :
24.26/9.51	         *    e1.getKey().equals(e2.getKey()))
24.26/9.51	         *   &&
24.26/9.51	         *   (e1.getValue()==null ?
24.26/9.51	         *    e2.getValue()==null :
24.26/9.51	         *    e1.getValue().equals(e2.getValue()))
24.26/9.51 * This ensures that the {@code equals} method works properly across 24.26/9.51 * different implementations of the {@code Map.Entry} interface. 24.26/9.51 * 24.26/9.51 * @param o object to be compared for equality with this map entry 24.26/9.51 * @return {@code true} if the specified object is equal to this map 24.26/9.51 * entry 24.26/9.51 * @see #hashCode 24.26/9.51 */ 24.26/9.51 public boolean equals(Object o) { 24.26/9.51 if (!(o instanceof Map.Entry)) 24.26/9.51 return false; 24.26/9.51 Map.Entry e = (Map.Entry)o; 24.26/9.51 return eq(key, e.getKey()) && eq(value, e.getValue()); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the hash code value for this map entry. The hash code 24.26/9.51 * of a map entry {@code e} is defined to be: 
24.26/9.51	         *   (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.51	         *   (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.51 * This ensures that {@code e1.equals(e2)} implies that 24.26/9.51 * {@code e1.hashCode()==e2.hashCode()} for any two Entries 24.26/9.51 * {@code e1} and {@code e2}, as required by the general 24.26/9.51 * contract of {@link Object#hashCode}. 24.26/9.51 * 24.26/9.51 * @return the hash code value for this map entry 24.26/9.51 * @see #equals 24.26/9.51 */ 24.26/9.51 public int hashCode() { 24.26/9.51 return (key == null ? 0 : key.hashCode()) ^ 24.26/9.51 (value == null ? 0 : value.hashCode()); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns a String representation of this map entry. This 24.26/9.51 * implementation returns the string representation of this 24.26/9.51 * entry's key followed by the equals character ("=") 24.26/9.51 * followed by the string representation of this entry's value. 24.26/9.51 * 24.26/9.51 * @return a String representation of this map entry 24.26/9.51 */ 24.26/9.51 public String toString() { 24.26/9.51 return key + "=" + value; 24.26/9.51 } 24.26/9.51 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * An Entry maintaining an immutable key and value. This class 24.26/9.51 * does not support method setValue. This class may be 24.26/9.51 * convenient in methods that return thread-safe snapshots of 24.26/9.51 * key-value mappings. 24.26/9.51 * 24.26/9.51 * @since 1.6 24.26/9.51 */ 24.26/9.51 public static class SimpleImmutableEntry 24.26/9.51 implements Entry, java.io.Serializable 24.26/9.51 { 24.26/9.51 private static final long serialVersionUID = 7138329143949025153L; 24.26/9.51 24.26/9.51 private final K key; 24.26/9.51 private final V value; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Creates an entry representing a mapping from the specified 24.26/9.51 * key to the specified value. 24.26/9.51 * 24.26/9.51 * @param key the key represented by this entry 24.26/9.51 * @param value the value represented by this entry 24.26/9.51 */ 24.26/9.51 public SimpleImmutableEntry(K key, V value) { 24.26/9.51 this.key = key; 24.26/9.51 this.value = value; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Creates an entry representing the same mapping as the 24.26/9.51 * specified entry. 24.26/9.51 * 24.26/9.51 * @param entry the entry to copy 24.26/9.51 */ 24.26/9.51 public SimpleImmutableEntry(Entry entry) { 24.26/9.51 this.key = entry.getKey(); 24.26/9.51 this.value = entry.getValue(); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the key corresponding to this entry. 24.26/9.51 * 24.26/9.51 * @return the key corresponding to this entry 24.26/9.51 */ 24.26/9.51 public K getKey() { 24.26/9.51 return key; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the value corresponding to this entry. 24.26/9.51 * 24.26/9.51 * @return the value corresponding to this entry 24.26/9.51 */ 24.26/9.51 public V getValue() { 24.26/9.51 return value; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Replaces the value corresponding to this entry with the specified 24.26/9.51 * value (optional operation). This implementation simply throws 24.26/9.51 * UnsupportedOperationException, as this class implements 24.26/9.51 * an immutable map entry. 24.26/9.51 * 24.26/9.51 * @param value new value to be stored in this entry 24.26/9.51 * @return (Does not return) 24.26/9.51 * @throws UnsupportedOperationException always 24.26/9.51 */ 24.26/9.51 public V setValue(V value) { 24.26/9.51 throw new UnsupportedOperationException(); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Compares the specified object with this entry for equality. 24.26/9.51 * Returns {@code true} if the given object is also a map entry and 24.26/9.51 * the two entries represent the same mapping. More formally, two 24.26/9.51 * entries {@code e1} and {@code e2} represent the same mapping 24.26/9.51 * if
24.26/9.51	         *   (e1.getKey()==null ?
24.26/9.51	         *    e2.getKey()==null :
24.26/9.51	         *    e1.getKey().equals(e2.getKey()))
24.26/9.51	         *   &&
24.26/9.51	         *   (e1.getValue()==null ?
24.26/9.51	         *    e2.getValue()==null :
24.26/9.51	         *    e1.getValue().equals(e2.getValue()))
24.26/9.51 * This ensures that the {@code equals} method works properly across 24.26/9.51 * different implementations of the {@code Map.Entry} interface. 24.26/9.51 * 24.26/9.51 * @param o object to be compared for equality with this map entry 24.26/9.51 * @return {@code true} if the specified object is equal to this map 24.26/9.51 * entry 24.26/9.51 * @see #hashCode 24.26/9.51 */ 24.26/9.51 public boolean equals(Object o) { 24.26/9.51 if (!(o instanceof Map.Entry)) 24.26/9.51 return false; 24.26/9.51 Map.Entry e = (Map.Entry)o; 24.26/9.51 return eq(key, e.getKey()) && eq(value, e.getValue()); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the hash code value for this map entry. The hash code 24.26/9.51 * of a map entry {@code e} is defined to be: 
24.26/9.51	         *   (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.51	         *   (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.51 * This ensures that {@code e1.equals(e2)} implies that 24.26/9.51 * {@code e1.hashCode()==e2.hashCode()} for any two Entries 24.26/9.51 * {@code e1} and {@code e2}, as required by the general 24.26/9.51 * contract of {@link Object#hashCode}. 24.26/9.51 * 24.26/9.51 * @return the hash code value for this map entry 24.26/9.51 * @see #equals 24.26/9.51 */ 24.26/9.51 public int hashCode() { 24.26/9.51 return (key == null ? 0 : key.hashCode()) ^ 24.26/9.51 (value == null ? 0 : value.hashCode()); 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns a String representation of this map entry. This 24.26/9.51 * implementation returns the string representation of this 24.26/9.51 * entry's key followed by the equals character ("=") 24.26/9.51 * followed by the string representation of this entry's value. 24.26/9.51 * 24.26/9.51 * @return a String representation of this map entry 24.26/9.51 */ 24.26/9.51 public String toString() { 24.26/9.51 return key + "=" + value; 24.26/9.51 } 24.26/9.51 24.26/9.51 } 24.26/9.51 24.26/9.51 } 24.26/9.51 24.26/9.51 24.26/9.51 /* 24.26/9.51 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.51 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.51 * 24.26/9.51 * This code is free software; you can redistribute it and/or modify it 24.26/9.51 * under the terms of the GNU General Public License version 2 only, as 24.26/9.51 * published by the Free Software Foundation. Sun designates this 24.26/9.51 * particular file as subject to the "Classpath" exception as provided 24.26/9.51 * by Sun in the LICENSE file that accompanied this code. 24.26/9.51 * 24.26/9.51 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.51 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.51 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.51 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.51 * accompanied this code). 24.26/9.51 * 24.26/9.51 * You should have received a copy of the GNU General Public License version 24.26/9.51 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.51 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.51 * 24.26/9.51 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.51 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.51 * have any questions. 24.26/9.51 */ 24.26/9.51 24.26/9.51 package javaUtilEx; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * This class provides a skeletal implementation of the Set 24.26/9.51 * interface to minimize the effort required to implement this 24.26/9.51 * interface.

24.26/9.51 * 24.26/9.51 * The process of implementing a set by extending this class is identical 24.26/9.51 * to that of implementing a Collection by extending AbstractCollection, 24.26/9.51 * except that all of the methods and constructors in subclasses of this 24.26/9.51 * class must obey the additional constraints imposed by the Set 24.26/9.51 * interface (for instance, the add method must not permit addition of 24.26/9.51 * multiple instances of an object to a set).

24.26/9.51 * 24.26/9.51 * Note that this class does not override any of the implementations from 24.26/9.51 * the AbstractCollection class. It merely adds implementations 24.26/9.51 * for equals and hashCode.

24.26/9.51 * 24.26/9.51 * This class is a member of the 24.26/9.51 * 24.26/9.51 * Java Collections Framework. 24.26/9.51 * 24.26/9.51 * @param the type of elements maintained by this set 24.26/9.51 * 24.26/9.51 * @author Josh Bloch 24.26/9.51 * @author Neal Gafter 24.26/9.51 * @see Collection 24.26/9.51 * @see AbstractCollection 24.26/9.51 * @see Set 24.26/9.51 * @since 1.2 24.26/9.51 */ 24.26/9.51 24.26/9.51 public abstract class AbstractSet extends AbstractCollection implements Set { 24.26/9.51 /** 24.26/9.51 * Sole constructor. (For invocation by subclass constructors, typically 24.26/9.51 * implicit.) 24.26/9.51 */ 24.26/9.51 protected AbstractSet() { 24.26/9.51 } 24.26/9.51 24.26/9.51 // Comparison and hashing 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Compares the specified object with this set for equality. Returns 24.26/9.51 * true if the given object is also a set, the two sets have 24.26/9.51 * the same size, and every member of the given set is contained in 24.26/9.51 * this set. This ensures that the equals method works 24.26/9.51 * properly across different implementations of the Set 24.26/9.51 * interface.

24.26/9.51 * 24.26/9.51 * This implementation first checks if the specified object is this 24.26/9.51 * set; if so it returns true. Then, it checks if the 24.26/9.51 * specified object is a set whose size is identical to the size of 24.26/9.51 * this set; if not, it returns false. If so, it returns 24.26/9.51 * containsAll((Collection) o). 24.26/9.51 * 24.26/9.51 * @param o object to be compared for equality with this set 24.26/9.51 * @return true if the specified object is equal to this set 24.26/9.51 */ 24.26/9.51 public boolean equals(Object o) { 24.26/9.51 if (o == this) 24.26/9.51 return true; 24.26/9.51 24.26/9.51 if (!(o instanceof Set)) 24.26/9.51 return false; 24.26/9.51 Collection c = (Collection) o; 24.26/9.51 if (c.size() != size()) 24.26/9.51 return false; 24.26/9.51 try { 24.26/9.51 return containsAll(c); 24.26/9.51 } catch (ClassCastException unused) { 24.26/9.51 return false; 24.26/9.51 } catch (NullPointerException unused) { 24.26/9.51 return false; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Returns the hash code value for this set. The hash code of a set is 24.26/9.51 * defined to be the sum of the hash codes of the elements in the set, 24.26/9.51 * where the hash code of a null element is defined to be zero. 24.26/9.51 * This ensures that s1.equals(s2) implies that 24.26/9.51 * s1.hashCode()==s2.hashCode() for any two sets s1 24.26/9.51 * and s2, as required by the general contract of 24.26/9.51 * {@link Object#hashCode}. 24.26/9.51 * 24.26/9.51 *

This implementation iterates over the set, calling the 24.26/9.51 * hashCode method on each element in the set, and adding up 24.26/9.51 * the results. 24.26/9.51 * 24.26/9.51 * @return the hash code value for this set 24.26/9.51 * @see Object#equals(Object) 24.26/9.51 * @see Set#equals(Object) 24.26/9.51 */ 24.26/9.51 public int hashCode() { 24.26/9.51 int h = 0; 24.26/9.51 Iterator i = iterator(); 24.26/9.51 while (i.hasNext()) { 24.26/9.51 E obj = i.next(); 24.26/9.51 if (obj != null) 24.26/9.51 h += obj.hashCode(); 24.26/9.51 } 24.26/9.51 return h; 24.26/9.51 } 24.26/9.51 24.26/9.51 /** 24.26/9.51 * Removes from this set all of its elements that are contained in the 24.26/9.51 * specified collection (optional operation). If the specified 24.26/9.51 * collection is also a set, this operation effectively modifies this 24.26/9.51 * set so that its value is the asymmetric set difference of 24.26/9.51 * the two sets. 24.26/9.51 * 24.26/9.51 *

This implementation determines which is the smaller of this set 24.26/9.51 * and the specified collection, by invoking the size 24.26/9.51 * method on each. If this set has fewer elements, then the 24.26/9.51 * implementation iterates over this set, checking each element 24.26/9.51 * returned by the iterator in turn to see if it is contained in 24.26/9.51 * the specified collection. If it is so contained, it is removed 24.26/9.51 * from this set with the iterator's remove method. If 24.26/9.51 * the specified collection has fewer elements, then the 24.26/9.51 * implementation iterates over the specified collection, removing 24.26/9.51 * from this set each element returned by the iterator, using this 24.26/9.51 * set's remove method. 24.26/9.51 * 24.26/9.51 *

Note that this implementation will throw an 24.26/9.51 * UnsupportedOperationException if the iterator returned by the 24.26/9.51 * iterator method does not implement the remove method. 24.26/9.51 * 24.26/9.51 * @param c collection containing elements to be removed from this set 24.26/9.51 * @return true if this set changed as a result of the call 24.26/9.51 * @throws UnsupportedOperationException if the removeAll operation 24.26/9.51 * is not supported by this set 24.26/9.51 * @throws ClassCastException if the class of an element of this set 24.26/9.51 * is incompatible with the specified collection (optional) 24.26/9.51 * @throws NullPointerException if this set contains a null element and the 24.26/9.51 * specified collection does not permit null elements (optional), 24.26/9.51 * or if the specified collection is null 24.26/9.51 * @see #remove(Object) 24.26/9.51 * @see #contains(Object) 24.26/9.51 */ 24.26/9.51 public boolean removeAll(Collection c) { 24.26/9.51 boolean modified = false; 24.26/9.51 24.26/9.51 if (size() > c.size()) { 24.26/9.51 for (Iterator i = c.iterator(); i.hasNext(); ) 24.26/9.51 modified |= remove(i.next()); 24.26/9.51 } else { 24.26/9.51 for (Iterator i = iterator(); i.hasNext(); ) { 24.26/9.51 if (c.contains(i.next())) { 24.26/9.51 i.remove(); 24.26/9.51 modified = true; 24.26/9.51 } 24.26/9.51 } 24.26/9.51 } 24.26/9.51 return modified; 24.26/9.51 } 24.26/9.51 24.26/9.51 } 24.26/9.51 24.26/9.51 24.26/9.51 /* 24.26/9.51 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.51 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.51 * 24.26/9.51 * This code is free software; you can redistribute it and/or modify it 24.26/9.51 * under the terms of the GNU General Public License version 2 only, as 24.26/9.51 * published by the Free Software Foundation. Sun designates this 24.26/9.51 * particular file as subject to the "Classpath" exception as provided 24.26/9.51 * by Sun in the LICENSE file that accompanied this code. 24.26/9.51 * 24.26/9.51 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.51 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.51 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.51 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.51 * accompanied this code). 24.26/9.51 * 24.26/9.51 * You should have received a copy of the GNU General Public License version 24.26/9.51 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.51 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.51 * 24.26/9.51 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.51 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.51 * have any questions. 24.26/9.51 */ 24.26/9.51 24.26/9.51 package javaUtilEx; 24.26/9.51 24.26/9.51 /** 24.26/9.51 * The root interface in the collection hierarchy. A collection 24.26/9.51 * represents a group of objects, known as its elements. Some 24.26/9.51 * collections allow duplicate elements and others do not. Some are ordered 24.26/9.51 * and others unordered. The JDK does not provide any direct 24.26/9.51 * implementations of this interface: it provides implementations of more 24.26/9.51 * specific subinterfaces like Set and List. This interface 24.26/9.51 * is typically used to pass collections around and manipulate them where 24.26/9.51 * maximum generality is desired. 24.26/9.51 * 24.26/9.51 *

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

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

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

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

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

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

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

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

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

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

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

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

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

Note that fail-fast behavior cannot be guaranteed as it is, generally 24.26/9.52 * speaking, impossible to make any hard guarantees in the presence of 24.26/9.52 * unsynchronized concurrent modification. Fail-fast operations 24.26/9.52 * throw ConcurrentModificationException on a best-effort basis. 24.26/9.52 * Therefore, it would be wrong to write a program that depended on this 24.26/9.52 * exception for its correctness: ConcurrentModificationException 24.26/9.52 * should be used only to detect bugs. 24.26/9.52 * 24.26/9.52 * @author Josh Bloch 24.26/9.52 * @see Collection 24.26/9.52 * @see Iterator 24.26/9.52 * @see ListIterator 24.26/9.52 * @see Vector 24.26/9.52 * @see LinkedList 24.26/9.52 * @see HashSet 24.26/9.52 * @see Hashtable 24.26/9.52 * @see TreeMap 24.26/9.52 * @see AbstractList 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 public class ConcurrentModificationException extends RuntimeException { 24.26/9.52 /** 24.26/9.52 * Constructs a ConcurrentModificationException with no 24.26/9.52 * detail message. 24.26/9.52 */ 24.26/9.52 public ConcurrentModificationException() { 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs a ConcurrentModificationException with the 24.26/9.52 * specified detail message. 24.26/9.52 * 24.26/9.52 * @param message the detail message pertaining to this exception. 24.26/9.52 */ 24.26/9.52 public ConcurrentModificationException(String message) { 24.26/9.52 super(message); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.52 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.52 * 24.26/9.52 * This code is free software; you can redistribute it and/or modify it 24.26/9.52 * under the terms of the GNU General Public License version 2 only, as 24.26/9.52 * published by the Free Software Foundation. Sun designates this 24.26/9.52 * particular file as subject to the "Classpath" exception as provided 24.26/9.52 * by Sun in the LICENSE file that accompanied this code. 24.26/9.52 * 24.26/9.52 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.52 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.52 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.52 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.52 * accompanied this code). 24.26/9.52 * 24.26/9.52 * You should have received a copy of the GNU General Public License version 24.26/9.52 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.52 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.52 * 24.26/9.52 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.52 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.52 * have any questions. 24.26/9.52 */ 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Hash table based implementation of the Map interface. This 24.26/9.52 * implementation provides all of the optional map operations, and permits 24.26/9.52 * null values and the null key. (The HashMap 24.26/9.52 * class is roughly equivalent to Hashtable, except that it is 24.26/9.52 * unsynchronized and permits nulls.) This class makes no guarantees as to 24.26/9.52 * the order of the map; in particular, it does not guarantee that the order 24.26/9.52 * will remain constant over time. 24.26/9.52 * 24.26/9.52 *

This implementation provides constant-time performance for the basic 24.26/9.52 * operations (get and put), assuming the hash function 24.26/9.52 * disperses the elements properly among the buckets. Iteration over 24.26/9.52 * collection views requires time proportional to the "capacity" of the 24.26/9.52 * HashMap instance (the number of buckets) plus its size (the number 24.26/9.52 * of key-value mappings). Thus, it's very important not to set the initial 24.26/9.52 * capacity too high (or the load factor too low) if iteration performance is 24.26/9.52 * important. 24.26/9.52 * 24.26/9.52 *

An instance of HashMap has two parameters that affect its 24.26/9.52 * performance: initial capacity and load factor. The 24.26/9.52 * capacity is the number of buckets in the hash table, and the initial 24.26/9.52 * capacity is simply the capacity at the time the hash table is created. The 24.26/9.52 * load factor is a measure of how full the hash table is allowed to 24.26/9.52 * get before its capacity is automatically increased. When the number of 24.26/9.52 * entries in the hash table exceeds the product of the load factor and the 24.26/9.52 * current capacity, the hash table is rehashed (that is, internal data 24.26/9.52 * structures are rebuilt) so that the hash table has approximately twice the 24.26/9.52 * number of buckets. 24.26/9.52 * 24.26/9.52 *

As a general rule, the default load factor (.75) offers a good tradeoff 24.26/9.52 * between time and space costs. Higher values decrease the space overhead 24.26/9.52 * but increase the lookup cost (reflected in most of the operations of the 24.26/9.52 * HashMap class, including get and put). The 24.26/9.52 * expected number of entries in the map and its load factor should be taken 24.26/9.52 * into account when setting its initial capacity, so as to minimize the 24.26/9.52 * number of rehash operations. If the initial capacity is greater 24.26/9.52 * than the maximum number of entries divided by the load factor, no 24.26/9.52 * rehash operations will ever occur. 24.26/9.52 * 24.26/9.52 *

If many mappings are to be stored in a HashMap instance, 24.26/9.52 * creating it with a sufficiently large capacity will allow the mappings to 24.26/9.52 * be stored more efficiently than letting it perform automatic rehashing as 24.26/9.52 * needed to grow the table. 24.26/9.52 * 24.26/9.52 *

Note that this implementation is not synchronized. 24.26/9.52 * If multiple threads access a hash map concurrently, and at least one of 24.26/9.52 * the threads modifies the map structurally, it must be 24.26/9.52 * synchronized externally. (A structural modification is any operation 24.26/9.52 * that adds or deletes one or more mappings; merely changing the value 24.26/9.52 * associated with a key that an instance already contains is not a 24.26/9.52 * structural modification.) This is typically accomplished by 24.26/9.52 * synchronizing on some object that naturally encapsulates the map. 24.26/9.52 * 24.26/9.52 * If no such object exists, the map should be "wrapped" using the 24.26/9.52 * {@link Collections#synchronizedMap Collections.synchronizedMap} 24.26/9.52 * method. This is best done at creation time, to prevent accidental 24.26/9.52 * unsynchronized access to the map:

24.26/9.52	 *   Map m = Collections.synchronizedMap(new HashMap(...));
24.26/9.52 * 24.26/9.52 *

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

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

This class is a member of the 24.26/9.52 * 24.26/9.52 * Java Collections Framework. 24.26/9.52 * 24.26/9.52 * @param the type of keys maintained by this map 24.26/9.52 * @param the type of mapped values 24.26/9.52 * 24.26/9.52 * @author Doug Lea 24.26/9.52 * @author Josh Bloch 24.26/9.52 * @author Arthur van Hoff 24.26/9.52 * @author Neal Gafter 24.26/9.52 * @see Object#hashCode() 24.26/9.52 * @see Collection 24.26/9.52 * @see Map 24.26/9.52 * @see TreeMap 24.26/9.52 * @see Hashtable 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 24.26/9.52 public class HashMap 24.26/9.52 extends AbstractMap 24.26/9.52 implements Map, Cloneable 24.26/9.52 { 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The default initial capacity - MUST be a power of two. 24.26/9.52 */ 24.26/9.52 static final int DEFAULT_INITIAL_CAPACITY = 16; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The maximum capacity, used if a higher value is implicitly specified 24.26/9.52 * by either of the constructors with arguments. 24.26/9.52 * MUST be a power of two <= 1<<30. 24.26/9.52 */ 24.26/9.52 static final int MAXIMUM_CAPACITY = 1 << 30; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The load factor used when none specified in constructor. 24.26/9.52 */ 24.26/9.52 static final float DEFAULT_LOAD_FACTOR = 0.75f; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The table, resized as necessary. Length MUST Always be a power of two. 24.26/9.52 */ 24.26/9.52 transient Entry[] table; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The number of key-value mappings contained in this map. 24.26/9.52 */ 24.26/9.52 transient int size; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The next size value at which to resize (capacity * load factor). 24.26/9.52 * @serial 24.26/9.52 */ 24.26/9.52 int threshold; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The load factor for the hash table. 24.26/9.52 * 24.26/9.52 * @serial 24.26/9.52 */ 24.26/9.52 final float loadFactor; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * The number of times this HashMap has been structurally modified 24.26/9.52 * Structural modifications are those that change the number of mappings in 24.26/9.52 * the HashMap or otherwise modify its internal structure (e.g., 24.26/9.52 * rehash). This field is used to make iterators on Collection-views of 24.26/9.52 * the HashMap fail-fast. (See ConcurrentModificationException). 24.26/9.52 */ 24.26/9.52 transient volatile int modCount; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs an empty HashMap with the specified initial 24.26/9.52 * capacity and load factor. 24.26/9.52 * 24.26/9.52 * @param initialCapacity the initial capacity 24.26/9.52 * @param loadFactor the load factor 24.26/9.52 * @throws IllegalArgumentException if the initial capacity is negative 24.26/9.52 * or the load factor is nonpositive 24.26/9.52 */ 24.26/9.52 public HashMap(int initialCapacity, float loadFactor) { 24.26/9.52 if (initialCapacity < 0) 24.26/9.52 throw new IllegalArgumentException("Illegal initial capacity: " + 24.26/9.52 initialCapacity); 24.26/9.52 if (initialCapacity > MAXIMUM_CAPACITY) 24.26/9.52 initialCapacity = MAXIMUM_CAPACITY; 24.26/9.52 if (loadFactor <= 0 || Float.isNaN(loadFactor)) 24.26/9.52 throw new IllegalArgumentException("Illegal load factor: " + 24.26/9.52 loadFactor); 24.26/9.52 24.26/9.52 // Find a power of 2 >= initialCapacity 24.26/9.52 int capacity = 1; 24.26/9.52 while (capacity < initialCapacity) 24.26/9.52 capacity <<= 1; 24.26/9.52 24.26/9.52 this.loadFactor = loadFactor; 24.26/9.52 threshold = (int)(capacity * loadFactor); 24.26/9.52 table = new Entry[capacity]; 24.26/9.52 init(); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs an empty HashMap with the specified initial 24.26/9.52 * capacity and the default load factor (0.75). 24.26/9.52 * 24.26/9.52 * @param initialCapacity the initial capacity. 24.26/9.52 * @throws IllegalArgumentException if the initial capacity is negative. 24.26/9.52 */ 24.26/9.52 public HashMap(int initialCapacity) { 24.26/9.52 this(initialCapacity, DEFAULT_LOAD_FACTOR); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs an empty HashMap with the default initial capacity 24.26/9.52 * (16) and the default load factor (0.75). 24.26/9.52 */ 24.26/9.52 public HashMap() { 24.26/9.52 this.loadFactor = DEFAULT_LOAD_FACTOR; 24.26/9.52 threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR); 24.26/9.52 table = new Entry[DEFAULT_INITIAL_CAPACITY]; 24.26/9.52 init(); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs a new HashMap with the same mappings as the 24.26/9.52 * specified Map. The HashMap is created with 24.26/9.52 * default load factor (0.75) and an initial capacity sufficient to 24.26/9.52 * hold the mappings in the specified Map. 24.26/9.52 * 24.26/9.52 * @param m the map whose mappings are to be placed in this map 24.26/9.52 * @throws NullPointerException if the specified map is null 24.26/9.52 */ 24.26/9.52 public HashMap(Map m) { 24.26/9.52 this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) + 1, 24.26/9.52 DEFAULT_INITIAL_CAPACITY), DEFAULT_LOAD_FACTOR); 24.26/9.52 putAllForCreate(m); 24.26/9.52 } 24.26/9.52 24.26/9.52 // internal utilities 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Initialization hook for subclasses. This method is called 24.26/9.52 * in all constructors and pseudo-constructors (clone, readObject) 24.26/9.52 * after HashMap has been initialized but before any entries have 24.26/9.52 * been inserted. (In the absence of this method, readObject would 24.26/9.52 * require explicit knowledge of subclasses.) 24.26/9.52 */ 24.26/9.52 void init() { 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Applies a supplemental hash function to a given hashCode, which 24.26/9.52 * defends against poor quality hash functions. This is critical 24.26/9.52 * because HashMap uses power-of-two length hash tables, that 24.26/9.52 * otherwise encounter collisions for hashCodes that do not differ 24.26/9.52 * in lower bits. Note: Null keys always map to hash 0, thus index 0. 24.26/9.52 */ 24.26/9.52 static int hash(int h) { 24.26/9.52 // This function ensures that hashCodes that differ only by 24.26/9.52 // constant multiples at each bit position have a bounded 24.26/9.52 // number of collisions (approximately 8 at default load factor). 24.26/9.52 h ^= (h >>> 20) ^ (h >>> 12); 24.26/9.52 return h ^ (h >>> 7) ^ (h >>> 4); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns index for hash code h. 24.26/9.52 */ 24.26/9.52 static int indexFor(int h, int length) { 24.26/9.52 return h & (length-1); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the number of key-value mappings in this map. 24.26/9.52 * 24.26/9.52 * @return the number of key-value mappings in this map 24.26/9.52 */ 24.26/9.52 public int size() { 24.26/9.52 return size; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map contains no key-value mappings. 24.26/9.52 * 24.26/9.52 * @return true if this map contains no key-value mappings 24.26/9.52 */ 24.26/9.52 public boolean isEmpty() { 24.26/9.52 return size == 0; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the value to which the specified key is mapped, 24.26/9.52 * or {@code null} if this map contains no mapping for the key. 24.26/9.52 * 24.26/9.52 *

More formally, if this map contains a mapping from a key 24.26/9.52 * {@code k} to a value {@code v} such that {@code (key==null ? k==null : 24.26/9.52 * key.equals(k))}, then this method returns {@code v}; otherwise 24.26/9.52 * it returns {@code null}. (There can be at most one such mapping.) 24.26/9.52 * 24.26/9.52 *

A return value of {@code null} does not necessarily 24.26/9.52 * indicate that the map contains no mapping for the key; it's also 24.26/9.52 * possible that the map explicitly maps the key to {@code null}. 24.26/9.52 * The {@link #containsKey containsKey} operation may be used to 24.26/9.52 * distinguish these two cases. 24.26/9.52 * 24.26/9.52 * @see #put(Object, Object) 24.26/9.52 */ 24.26/9.52 public V get(Object key) { 24.26/9.52 if (key == null) 24.26/9.52 return getForNullKey(); 24.26/9.52 int hash = hash(key.hashCode()); 24.26/9.52 for (Entry e = table[indexFor(hash, table.length)]; 24.26/9.52 e != null; 24.26/9.52 e = e.next) { 24.26/9.52 Object k; 24.26/9.52 if (e.hash == hash && ((k = e.key) == key || key.equals(k))) 24.26/9.52 return e.value; 24.26/9.52 } 24.26/9.52 return null; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Offloaded version of get() to look up null keys. Null keys map 24.26/9.52 * to index 0. This null case is split out into separate methods 24.26/9.52 * for the sake of performance in the two most commonly used 24.26/9.52 * operations (get and put), but incorporated with conditionals in 24.26/9.52 * others. 24.26/9.52 */ 24.26/9.52 private V getForNullKey() { 24.26/9.52 for (Entry e = table[0]; e != null; e = e.next) { 24.26/9.52 if (e.key == null) 24.26/9.52 return e.value; 24.26/9.52 } 24.26/9.52 return null; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map contains a mapping for the 24.26/9.52 * specified key. 24.26/9.52 * 24.26/9.52 * @param key The key whose presence in this map is to be tested 24.26/9.52 * @return true if this map contains a mapping for the specified 24.26/9.52 * key. 24.26/9.52 */ 24.26/9.52 public boolean containsKey(Object key) { 24.26/9.52 return getEntry(key) != null; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the entry associated with the specified key in the 24.26/9.52 * HashMap. Returns null if the HashMap contains no mapping 24.26/9.52 * for the key. 24.26/9.52 */ 24.26/9.52 final Entry getEntry(Object key) { 24.26/9.52 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.52 for (Entry e = table[indexFor(hash, table.length)]; 24.26/9.52 e != null; 24.26/9.52 e = e.next) { 24.26/9.52 Object k; 24.26/9.52 if (e.hash == hash && 24.26/9.52 ((k = e.key) == key || (key != null && key.equals(k)))) 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 return null; 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Associates the specified value with the specified key in this map. 24.26/9.52 * If the map previously contained a mapping for the key, the old 24.26/9.52 * value is replaced. 24.26/9.52 * 24.26/9.52 * @param key key with which the specified value is to be associated 24.26/9.52 * @param value value to be associated with the specified key 24.26/9.52 * @return the previous value associated with key, or 24.26/9.52 * null if there was no mapping for key. 24.26/9.52 * (A null return can also indicate that the map 24.26/9.52 * previously associated null with key.) 24.26/9.52 */ 24.26/9.52 public V put(K key, V value) { 24.26/9.52 if (key == null) 24.26/9.52 return putForNullKey(value); 24.26/9.52 int hash = hash(key.hashCode()); 24.26/9.52 int i = indexFor(hash, table.length); 24.26/9.52 for (Entry e = table[i]; e != null; e = e.next) { 24.26/9.52 Object k; 24.26/9.52 if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { 24.26/9.52 V oldValue = e.value; 24.26/9.52 e.value = value; 24.26/9.52 e.recordAccess(this); 24.26/9.52 return oldValue; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 modCount++; 24.26/9.52 addEntry(hash, key, value, i); 24.26/9.52 return null; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Offloaded version of put for null keys 24.26/9.52 */ 24.26/9.52 private V putForNullKey(V value) { 24.26/9.52 for (Entry e = table[0]; e != null; e = e.next) { 24.26/9.52 if (e.key == null) { 24.26/9.52 V oldValue = e.value; 24.26/9.52 e.value = value; 24.26/9.52 e.recordAccess(this); 24.26/9.52 return oldValue; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 modCount++; 24.26/9.52 addEntry(0, null, value, 0); 24.26/9.52 return null; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * This method is used instead of put by constructors and 24.26/9.52 * pseudoconstructors (clone, readObject). It does not resize the table, 24.26/9.52 * check for comodification, etc. It calls createEntry rather than 24.26/9.52 * addEntry. 24.26/9.52 */ 24.26/9.52 private void putForCreate(K key, V value) { 24.26/9.52 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.52 int i = indexFor(hash, table.length); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Look for preexisting entry for key. This will never happen for 24.26/9.52 * clone or deserialize. It will only happen for construction if the 24.26/9.52 * input Map is a sorted map whose ordering is inconsistent w/ equals. 24.26/9.52 */ 24.26/9.52 for (Entry e = table[i]; e != null; e = e.next) { 24.26/9.52 Object k; 24.26/9.52 if (e.hash == hash && 24.26/9.52 ((k = e.key) == key || (key != null && key.equals(k)))) { 24.26/9.52 e.value = value; 24.26/9.52 return; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 createEntry(hash, key, value, i); 24.26/9.52 } 24.26/9.52 24.26/9.52 private void putAllForCreate(Map m) { 24.26/9.52 for (Iterator> i = m.entrySet().iterator(); i.hasNext(); ) { 24.26/9.52 Map.Entry e = i.next(); 24.26/9.52 putForCreate(e.getKey(), e.getValue()); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Rehashes the contents of this map into a new array with a 24.26/9.52 * larger capacity. This method is called automatically when the 24.26/9.52 * number of keys in this map reaches its threshold. 24.26/9.52 * 24.26/9.52 * If current capacity is MAXIMUM_CAPACITY, this method does not 24.26/9.52 * resize the map, but sets threshold to Integer.MAX_VALUE. 24.26/9.52 * This has the effect of preventing future calls. 24.26/9.52 * 24.26/9.52 * @param newCapacity the new capacity, MUST be a power of two; 24.26/9.52 * must be greater than current capacity unless current 24.26/9.52 * capacity is MAXIMUM_CAPACITY (in which case value 24.26/9.52 * is irrelevant). 24.26/9.52 */ 24.26/9.52 void resize(int newCapacity) { 24.26/9.52 Entry[] oldTable = table; 24.26/9.52 int oldCapacity = oldTable.length; 24.26/9.52 if (oldCapacity == MAXIMUM_CAPACITY) { 24.26/9.52 threshold = Integer.MAX_VALUE; 24.26/9.52 return; 24.26/9.52 } 24.26/9.52 24.26/9.52 Entry[] newTable = new Entry[newCapacity]; 24.26/9.52 transfer(newTable); 24.26/9.52 table = newTable; 24.26/9.52 threshold = (int)(newCapacity * loadFactor); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Transfers all entries from current table to newTable. 24.26/9.52 */ 24.26/9.52 void transfer(Entry[] newTable) { 24.26/9.52 Entry[] src = table; 24.26/9.52 int newCapacity = newTable.length; 24.26/9.52 for (int j = 0; j < src.length; j++) { 24.26/9.52 Entry e = src[j]; 24.26/9.52 if (e != null) { 24.26/9.52 src[j] = null; 24.26/9.52 do { 24.26/9.52 Entry next = e.next; 24.26/9.52 int i = indexFor(e.hash, newCapacity); 24.26/9.52 e.next = newTable[i]; 24.26/9.52 newTable[i] = e; 24.26/9.52 e = next; 24.26/9.52 } while (e != null); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Copies all of the mappings from the specified map to this map. 24.26/9.52 * These mappings will replace any mappings that this map had for 24.26/9.52 * any of the keys currently in the specified map. 24.26/9.52 * 24.26/9.52 * @param m mappings to be stored in this map 24.26/9.52 * @throws NullPointerException if the specified map is null 24.26/9.52 */ 24.26/9.52 public void putAll(Map m) { 24.26/9.52 int numKeysToBeAdded = m.size(); 24.26/9.52 if (numKeysToBeAdded == 0) 24.26/9.52 return; 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Expand the map if the map if the number of mappings to be added 24.26/9.52 * is greater than or equal to threshold. This is conservative; the 24.26/9.52 * obvious condition is (m.size() + size) >= threshold, but this 24.26/9.52 * condition could result in a map with twice the appropriate capacity, 24.26/9.52 * if the keys to be added overlap with the keys already in this map. 24.26/9.52 * By using the conservative calculation, we subject ourself 24.26/9.52 * to at most one extra resize. 24.26/9.52 */ 24.26/9.52 if (numKeysToBeAdded > threshold) { 24.26/9.52 int targetCapacity = (int)(numKeysToBeAdded / loadFactor + 1); 24.26/9.52 if (targetCapacity > MAXIMUM_CAPACITY) 24.26/9.52 targetCapacity = MAXIMUM_CAPACITY; 24.26/9.52 int newCapacity = table.length; 24.26/9.52 while (newCapacity < targetCapacity) 24.26/9.52 newCapacity <<= 1; 24.26/9.52 if (newCapacity > table.length) 24.26/9.52 resize(newCapacity); 24.26/9.52 } 24.26/9.52 24.26/9.52 for (Iterator> i = m.entrySet().iterator(); i.hasNext(); ) { 24.26/9.52 Map.Entry e = i.next(); 24.26/9.52 put(e.getKey(), e.getValue()); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes the mapping for the specified key from this map if present. 24.26/9.52 * 24.26/9.52 * @param key key whose mapping is to be removed from the map 24.26/9.52 * @return the previous value associated with key, or 24.26/9.52 * null if there was no mapping for key. 24.26/9.52 * (A null return can also indicate that the map 24.26/9.52 * previously associated null with key.) 24.26/9.52 */ 24.26/9.52 public V remove(Object key) { 24.26/9.52 Entry e = removeEntryForKey(key); 24.26/9.52 return (e == null ? null : e.value); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes and returns the entry associated with the specified key 24.26/9.52 * in the HashMap. Returns null if the HashMap contains no mapping 24.26/9.52 * for this key. 24.26/9.52 */ 24.26/9.52 final Entry removeEntryForKey(Object key) { 24.26/9.52 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.52 int i = indexFor(hash, table.length); 24.26/9.52 Entry prev = table[i]; 24.26/9.52 Entry e = prev; 24.26/9.52 24.26/9.52 while (e != null) { 24.26/9.52 Entry next = e.next; 24.26/9.52 Object k; 24.26/9.52 if (e.hash == hash && 24.26/9.52 ((k = e.key) == key || (key != null && key.equals(k)))) { 24.26/9.52 modCount++; 24.26/9.52 size--; 24.26/9.52 if (prev == e) 24.26/9.52 table[i] = next; 24.26/9.52 else 24.26/9.52 prev.next = next; 24.26/9.52 e.recordRemoval(this); 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 prev = e; 24.26/9.52 e = next; 24.26/9.52 } 24.26/9.52 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Special version of remove for EntrySet. 24.26/9.52 */ 24.26/9.52 final Entry removeMapping(Object o) { 24.26/9.52 if (!(o instanceof Map.Entry)) 24.26/9.52 return null; 24.26/9.52 24.26/9.52 Map.Entry entry = (Map.Entry) o; 24.26/9.52 Object key = entry.getKey(); 24.26/9.52 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.52 int i = indexFor(hash, table.length); 24.26/9.52 Entry prev = table[i]; 24.26/9.52 Entry e = prev; 24.26/9.52 24.26/9.52 while (e != null) { 24.26/9.52 Entry next = e.next; 24.26/9.52 if (e.hash == hash && e.equals(entry)) { 24.26/9.52 modCount++; 24.26/9.52 size--; 24.26/9.52 if (prev == e) 24.26/9.52 table[i] = next; 24.26/9.52 else 24.26/9.52 prev.next = next; 24.26/9.52 e.recordRemoval(this); 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 prev = e; 24.26/9.52 e = next; 24.26/9.52 } 24.26/9.52 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes all of the mappings from this map. 24.26/9.52 * The map will be empty after this call returns. 24.26/9.52 */ 24.26/9.52 public void clear() { 24.26/9.52 modCount++; 24.26/9.52 Entry[] tab = table; 24.26/9.52 for (int i = 0; i < tab.length; i++) 24.26/9.52 tab[i] = null; 24.26/9.52 size = 0; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map maps one or more keys to the 24.26/9.52 * specified value. 24.26/9.52 * 24.26/9.52 * @param value value whose presence in this map is to be tested 24.26/9.52 * @return true if this map maps one or more keys to the 24.26/9.52 * specified value 24.26/9.52 */ 24.26/9.52 public boolean containsValue(Object value) { 24.26/9.52 if (value == null) 24.26/9.52 return containsNullValue(); 24.26/9.52 24.26/9.52 Entry[] tab = table; 24.26/9.52 for (int i = 0; i < tab.length ; i++) 24.26/9.52 for (Entry e = tab[i] ; e != null ; e = e.next) 24.26/9.52 if (value.equals(e.value)) 24.26/9.52 return true; 24.26/9.52 return false; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Special-case code for containsValue with null argument 24.26/9.52 */ 24.26/9.52 private boolean containsNullValue() { 24.26/9.52 Entry[] tab = table; 24.26/9.52 for (int i = 0; i < tab.length ; i++) 24.26/9.52 for (Entry e = tab[i] ; e != null ; e = e.next) 24.26/9.52 if (e.value == null) 24.26/9.52 return true; 24.26/9.52 return false; 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a shallow copy of this HashMap instance: the keys and 24.26/9.52 * values themselves are not cloned. 24.26/9.52 * 24.26/9.52 * @return a shallow copy of this map 24.26/9.52 */ 24.26/9.52 public Object clone() { 24.26/9.52 HashMap result = null; 24.26/9.52 try { 24.26/9.52 result = (HashMap)super.clone(); 24.26/9.52 } catch (CloneNotSupportedException e) { 24.26/9.52 // assert false; 24.26/9.52 } 24.26/9.52 result.table = new Entry[table.length]; 24.26/9.52 result.entrySet = null; 24.26/9.52 result.modCount = 0; 24.26/9.52 result.size = 0; 24.26/9.52 result.init(); 24.26/9.52 result.putAllForCreate(this); 24.26/9.52 24.26/9.52 return result; 24.26/9.52 } 24.26/9.52 24.26/9.52 static class Entry implements Map.Entry { 24.26/9.52 final K key; 24.26/9.52 V value; 24.26/9.52 Entry next; 24.26/9.52 final int hash; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Creates new entry. 24.26/9.52 */ 24.26/9.52 Entry(int h, K k, V v, Entry n) { 24.26/9.52 value = v; 24.26/9.52 next = n; 24.26/9.52 key = k; 24.26/9.52 hash = h; 24.26/9.52 } 24.26/9.52 24.26/9.52 public final K getKey() { 24.26/9.52 return key; 24.26/9.52 } 24.26/9.52 24.26/9.52 public final V getValue() { 24.26/9.52 return value; 24.26/9.52 } 24.26/9.52 24.26/9.52 public final V setValue(V newValue) { 24.26/9.52 V oldValue = value; 24.26/9.52 value = newValue; 24.26/9.52 return oldValue; 24.26/9.52 } 24.26/9.52 24.26/9.52 public final boolean equals(Object o) { 24.26/9.52 if (!(o instanceof Map.Entry)) 24.26/9.52 return false; 24.26/9.52 Map.Entry e = (Map.Entry)o; 24.26/9.52 Object k1 = getKey(); 24.26/9.52 Object k2 = e.getKey(); 24.26/9.52 if (k1 == k2 || (k1 != null && k1.equals(k2))) { 24.26/9.52 Object v1 = getValue(); 24.26/9.52 Object v2 = e.getValue(); 24.26/9.52 if (v1 == v2 || (v1 != null && v1.equals(v2))) 24.26/9.52 return true; 24.26/9.52 } 24.26/9.52 return false; 24.26/9.52 } 24.26/9.52 24.26/9.52 public final int hashCode() { 24.26/9.52 return (key==null ? 0 : key.hashCode()) ^ 24.26/9.52 (value==null ? 0 : value.hashCode()); 24.26/9.52 } 24.26/9.52 24.26/9.52 public final String toString() { 24.26/9.52 return getKey() + "=" + getValue(); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * This method is invoked whenever the value in an entry is 24.26/9.52 * overwritten by an invocation of put(k,v) for a key k that's already 24.26/9.52 * in the HashMap. 24.26/9.52 */ 24.26/9.52 void recordAccess(HashMap m) { 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * This method is invoked whenever the entry is 24.26/9.52 * removed from the table. 24.26/9.52 */ 24.26/9.52 void recordRemoval(HashMap m) { 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Adds a new entry with the specified key, value and hash code to 24.26/9.52 * the specified bucket. It is the responsibility of this 24.26/9.52 * method to resize the table if appropriate. 24.26/9.52 * 24.26/9.52 * Subclass overrides this to alter the behavior of put method. 24.26/9.52 */ 24.26/9.52 void addEntry(int hash, K key, V value, int bucketIndex) { 24.26/9.52 Entry e = table[bucketIndex]; 24.26/9.52 table[bucketIndex] = new Entry(hash, key, value, e); 24.26/9.52 if (size++ >= threshold) 24.26/9.52 resize(2 * table.length); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Like addEntry except that this version is used when creating entries 24.26/9.52 * as part of Map construction or "pseudo-construction" (cloning, 24.26/9.52 * deserialization). This version needn't worry about resizing the table. 24.26/9.52 * 24.26/9.52 * Subclass overrides this to alter the behavior of HashMap(Map), 24.26/9.52 * clone, and readObject. 24.26/9.52 */ 24.26/9.52 void createEntry(int hash, K key, V value, int bucketIndex) { 24.26/9.52 Entry e = table[bucketIndex]; 24.26/9.52 table[bucketIndex] = new Entry(hash, key, value, e); 24.26/9.52 size++; 24.26/9.52 } 24.26/9.52 24.26/9.52 private abstract class HashIterator implements Iterator { 24.26/9.52 Entry next; // next entry to return 24.26/9.52 int expectedModCount; // For fast-fail 24.26/9.52 int index; // current slot 24.26/9.52 Entry current; // current entry 24.26/9.52 24.26/9.52 HashIterator() { 24.26/9.52 expectedModCount = modCount; 24.26/9.52 if (size > 0) { // advance to first entry 24.26/9.52 Entry[] t = table; 24.26/9.52 while (index < t.length && (next = t[index++]) == null) 24.26/9.52 ; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 public final boolean hasNext() { 24.26/9.52 return next != null; 24.26/9.52 } 24.26/9.52 24.26/9.52 final Entry nextEntry() { 24.26/9.52 if (modCount != expectedModCount) 24.26/9.52 throw new ConcurrentModificationException(); 24.26/9.52 Entry e = next; 24.26/9.52 if (e == null) 24.26/9.52 throw new NoSuchElementException(); 24.26/9.52 24.26/9.52 if ((next = e.next) == null) { 24.26/9.52 Entry[] t = table; 24.26/9.52 while (index < t.length && (next = t[index++]) == null) 24.26/9.52 ; 24.26/9.52 } 24.26/9.52 current = e; 24.26/9.52 return e; 24.26/9.52 } 24.26/9.52 24.26/9.52 public void remove() { 24.26/9.52 if (current == null) 24.26/9.52 throw new IllegalStateException(); 24.26/9.52 if (modCount != expectedModCount) 24.26/9.52 throw new ConcurrentModificationException(); 24.26/9.52 Object k = current.key; 24.26/9.52 current = null; 24.26/9.52 HashMap.this.removeEntryForKey(k); 24.26/9.52 expectedModCount = modCount; 24.26/9.52 } 24.26/9.52 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class ValueIterator extends HashIterator { 24.26/9.52 public V next() { 24.26/9.52 return nextEntry().value; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class KeyIterator extends HashIterator { 24.26/9.52 public K next() { 24.26/9.52 return nextEntry().getKey(); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class EntryIterator extends HashIterator> { 24.26/9.52 public Map.Entry next() { 24.26/9.52 return nextEntry(); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 // Subclass overrides these to alter behavior of views' iterator() method 24.26/9.52 Iterator newKeyIterator() { 24.26/9.52 return new KeyIterator(); 24.26/9.52 } 24.26/9.52 Iterator newValueIterator() { 24.26/9.52 return new ValueIterator(); 24.26/9.52 } 24.26/9.52 Iterator> newEntryIterator() { 24.26/9.52 return new EntryIterator(); 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 // Views 24.26/9.52 24.26/9.52 private transient Set> entrySet = null; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Set} view of the keys contained in this map. 24.26/9.52 * The set is backed by the map, so changes to the map are 24.26/9.52 * reflected in the set, and vice-versa. If the map is modified 24.26/9.52 * while an iteration over the set is in progress (except through 24.26/9.52 * the iterator's own remove operation), the results of 24.26/9.52 * the iteration are undefined. The set supports element removal, 24.26/9.52 * which removes the corresponding mapping from the map, via the 24.26/9.52 * Iterator.remove, Set.remove, 24.26/9.52 * removeAll, retainAll, and clear 24.26/9.52 * operations. It does not support the add or addAll 24.26/9.52 * operations. 24.26/9.52 */ 24.26/9.52 public Set keySet() { 24.26/9.52 Set ks = keySet; 24.26/9.52 return (ks != null ? ks : (keySet = new KeySet())); 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class KeySet extends AbstractSet { 24.26/9.52 public Iterator iterator() { 24.26/9.52 return newKeyIterator(); 24.26/9.52 } 24.26/9.52 public int size() { 24.26/9.52 return size; 24.26/9.52 } 24.26/9.52 public boolean contains(Object o) { 24.26/9.52 return containsKey(o); 24.26/9.52 } 24.26/9.52 public boolean remove(Object o) { 24.26/9.52 return HashMap.this.removeEntryForKey(o) != null; 24.26/9.52 } 24.26/9.52 public void clear() { 24.26/9.52 HashMap.this.clear(); 24.26/9.52 } 24.26/9.52 public Object[] toArray() { 24.26/9.52 Object[] res = new Object[size]; 24.26/9.52 Iterator it = iterator(); 24.26/9.52 int i = 0; 24.26/9.52 while (it.hasNext()) 24.26/9.52 res[i++] = it.next(); 24.26/9.52 return res; 24.26/9.52 } 24.26/9.52 public T[] toArray(T[] a) { 24.26/9.52 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.52 a.getClass().getComponentType(), size); 24.26/9.52 Object[] res = a; 24.26/9.52 Iterator it = iterator(); 24.26/9.52 int i = 0; 24.26/9.52 while (it.hasNext()) 24.26/9.52 res[i++] = it.next(); 24.26/9.52 return a; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Collection} view of the values contained in this map. 24.26/9.52 * The collection is backed by the map, so changes to the map are 24.26/9.52 * reflected in the collection, and vice-versa. If the map is 24.26/9.52 * modified while an iteration over the collection is in progress 24.26/9.52 * (except through the iterator's own remove operation), 24.26/9.52 * the results of the iteration are undefined. The collection 24.26/9.52 * supports element removal, which removes the corresponding 24.26/9.52 * mapping from the map, via the Iterator.remove, 24.26/9.52 * Collection.remove, removeAll, 24.26/9.52 * retainAll and clear operations. It does not 24.26/9.52 * support the add or addAll operations. 24.26/9.52 */ 24.26/9.52 public Collection values() { 24.26/9.52 Collection vs = values; 24.26/9.52 return (vs != null ? vs : (values = new Values())); 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class Values extends AbstractCollection { 24.26/9.52 public Iterator iterator() { 24.26/9.52 return newValueIterator(); 24.26/9.52 } 24.26/9.52 public int size() { 24.26/9.52 return size; 24.26/9.52 } 24.26/9.52 public boolean contains(Object o) { 24.26/9.52 return containsValue(o); 24.26/9.52 } 24.26/9.52 public void clear() { 24.26/9.52 HashMap.this.clear(); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Set} view of the mappings contained in this map. 24.26/9.52 * The set is backed by the map, so changes to the map are 24.26/9.52 * reflected in the set, and vice-versa. If the map is modified 24.26/9.52 * while an iteration over the set is in progress (except through 24.26/9.52 * the iterator's own remove operation, or through the 24.26/9.52 * setValue operation on a map entry returned by the 24.26/9.52 * iterator) the results of the iteration are undefined. The set 24.26/9.52 * supports element removal, which removes the corresponding 24.26/9.52 * mapping from the map, via the Iterator.remove, 24.26/9.52 * Set.remove, removeAll, retainAll and 24.26/9.52 * clear operations. It does not support the 24.26/9.52 * add or addAll operations. 24.26/9.52 * 24.26/9.52 * @return a set view of the mappings contained in this map 24.26/9.52 */ 24.26/9.52 public Set> entrySet() { 24.26/9.52 return entrySet0(); 24.26/9.52 } 24.26/9.52 24.26/9.52 private Set> entrySet0() { 24.26/9.52 Set> es = entrySet; 24.26/9.52 return es != null ? es : (entrySet = new EntrySet()); 24.26/9.52 } 24.26/9.52 24.26/9.52 private final class EntrySet extends AbstractSet> { 24.26/9.52 public Iterator> iterator() { 24.26/9.52 return newEntryIterator(); 24.26/9.52 } 24.26/9.52 public boolean contains(Object o) { 24.26/9.52 if (!(o instanceof Map.Entry)) 24.26/9.52 return false; 24.26/9.52 Map.Entry e = (Map.Entry) o; 24.26/9.52 Entry candidate = getEntry(e.getKey()); 24.26/9.52 return candidate != null && candidate.equals(e); 24.26/9.52 } 24.26/9.52 public boolean remove(Object o) { 24.26/9.52 return removeMapping(o) != null; 24.26/9.52 } 24.26/9.52 public int size() { 24.26/9.52 return size; 24.26/9.52 } 24.26/9.52 public void clear() { 24.26/9.52 HashMap.this.clear(); 24.26/9.52 } 24.26/9.52 public Object[] toArray() { 24.26/9.52 Object[] res = new Object[size]; 24.26/9.52 Iterator> it = iterator(); 24.26/9.52 int i = 0; 24.26/9.52 while (it.hasNext()) 24.26/9.52 res[i++] = it.next(); 24.26/9.52 return res; 24.26/9.52 } 24.26/9.52 public T[] toArray(T[] a) { 24.26/9.52 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.52 a.getClass().getComponentType(), size); 24.26/9.52 Object[] res = a; 24.26/9.52 Iterator> it = iterator(); 24.26/9.52 int i = 0; 24.26/9.52 while (it.hasNext()) 24.26/9.52 res[i++] = it.next(); 24.26/9.52 return a; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 private static final long serialVersionUID = 362498820763181265L; 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.52 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.52 * 24.26/9.52 * This code is free software; you can redistribute it and/or modify it 24.26/9.52 * under the terms of the GNU General Public License version 2 only, as 24.26/9.52 * published by the Free Software Foundation. Sun designates this 24.26/9.52 * particular file as subject to the "Classpath" exception as provided 24.26/9.52 * by Sun in the LICENSE file that accompanied this code. 24.26/9.52 * 24.26/9.52 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.52 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.52 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.52 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.52 * accompanied this code). 24.26/9.52 * 24.26/9.52 * You should have received a copy of the GNU General Public License version 24.26/9.52 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.52 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.52 * 24.26/9.52 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.52 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.52 * have any questions. 24.26/9.52 */ 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Thrown to indicate that a method has been passed an illegal or 24.26/9.52 * inappropriate argument. 24.26/9.52 * 24.26/9.52 * @author unascribed 24.26/9.52 * @see java.lang.Thread#setPriority(int) 24.26/9.52 * @since JDK1.0 24.26/9.52 */ 24.26/9.52 public 24.26/9.52 class IllegalArgumentException extends RuntimeException { 24.26/9.52 /** 24.26/9.52 * Constructs an IllegalArgumentException with no 24.26/9.52 * detail message. 24.26/9.52 */ 24.26/9.52 public IllegalArgumentException() { 24.26/9.52 super(); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs an IllegalArgumentException with the 24.26/9.52 * specified detail message. 24.26/9.52 * 24.26/9.52 * @param s the detail message. 24.26/9.52 */ 24.26/9.52 public IllegalArgumentException(String s) { 24.26/9.52 super(s); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs a new exception with the specified detail message and 24.26/9.52 * cause. 24.26/9.52 * 24.26/9.52 *

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

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

24.26/9.52 * 24.26/9.52 *

This interface is a member of the 24.26/9.52 * 24.26/9.52 * Java Collections Framework. 24.26/9.52 * 24.26/9.52 * @author Josh Bloch 24.26/9.52 * @see Collection 24.26/9.52 * @see ListIterator 24.26/9.52 * @see Iterable 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 public interface Iterator { 24.26/9.52 /** 24.26/9.52 * Returns {@code true} if the iteration has more elements. 24.26/9.52 * (In other words, returns {@code true} if {@link #next} would 24.26/9.52 * return an element rather than throwing an exception.) 24.26/9.52 * 24.26/9.52 * @return {@code true} if the iteration has more elements 24.26/9.52 */ 24.26/9.52 boolean hasNext(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the next element in the iteration. 24.26/9.52 * 24.26/9.52 * @return the next element in the iteration 24.26/9.52 * @throws NoSuchElementException if the iteration has no more elements 24.26/9.52 */ 24.26/9.52 E next(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes from the underlying collection the last element returned 24.26/9.52 * by this iterator (optional operation). This method can be called 24.26/9.52 * only once per call to {@link #next}. The behavior of an iterator 24.26/9.52 * is unspecified if the underlying collection is modified while the 24.26/9.52 * iteration is in progress in any way other than by calling this 24.26/9.52 * method. 24.26/9.52 * 24.26/9.52 * @throws UnsupportedOperationException if the {@code remove} 24.26/9.52 * operation is not supported by this iterator 24.26/9.52 * 24.26/9.52 * @throws IllegalStateException if the {@code next} method has not 24.26/9.52 * yet been called, or the {@code remove} method has already 24.26/9.52 * been called after the last call to the {@code next} 24.26/9.52 * method 24.26/9.52 */ 24.26/9.52 void remove(); 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 public class juHashMapCreate { 24.26/9.52 public static void main(String[] args) { 24.26/9.52 Random.args = args; 24.26/9.52 24.26/9.52 HashMap m = createMap(Random.random()); 24.26/9.52 } 24.26/9.52 24.26/9.52 public static HashMap createMap(int n) { 24.26/9.52 HashMap m = new HashMap(); 24.26/9.52 while (n > 0) { 24.26/9.52 Content key = new Content(Random.random()); 24.26/9.52 Content val = new Content(Random.random()); 24.26/9.52 m.put(key, val); 24.26/9.52 n--; 24.26/9.52 } 24.26/9.52 return m; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 final class Content { 24.26/9.52 int val; 24.26/9.52 24.26/9.52 public Content(int v) { 24.26/9.52 this.val = v; 24.26/9.52 } 24.26/9.52 24.26/9.52 public int hashCode() { 24.26/9.52 return val^31; 24.26/9.52 } 24.26/9.52 24.26/9.52 public boolean equals(Object o) { 24.26/9.52 if (o instanceof Content) { 24.26/9.52 return this.val == ((Content) o).val; 24.26/9.52 } 24.26/9.52 return false; 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.52 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.52 * 24.26/9.52 * This code is free software; you can redistribute it and/or modify it 24.26/9.52 * under the terms of the GNU General Public License version 2 only, as 24.26/9.52 * published by the Free Software Foundation. Sun designates this 24.26/9.52 * particular file as subject to the "Classpath" exception as provided 24.26/9.52 * by Sun in the LICENSE file that accompanied this code. 24.26/9.52 * 24.26/9.52 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.52 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.52 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.52 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.52 * accompanied this code). 24.26/9.52 * 24.26/9.52 * You should have received a copy of the GNU General Public License version 24.26/9.52 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.52 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.52 * 24.26/9.52 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.52 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.52 * have any questions. 24.26/9.52 */ 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * An object that maps keys to values. A map cannot contain duplicate keys; 24.26/9.52 * each key can map to at most one value. 24.26/9.52 * 24.26/9.52 *

This interface takes the place of the Dictionary class, which 24.26/9.52 * was a totally abstract class rather than an interface. 24.26/9.52 * 24.26/9.52 *

The Map interface provides three collection views, which 24.26/9.52 * allow a map's contents to be viewed as a set of keys, collection of values, 24.26/9.52 * or set of key-value mappings. The order of a map is defined as 24.26/9.52 * the order in which the iterators on the map's collection views return their 24.26/9.52 * elements. Some map implementations, like the TreeMap class, make 24.26/9.52 * specific guarantees as to their order; others, like the HashMap 24.26/9.52 * class, do not. 24.26/9.52 * 24.26/9.52 *

Note: great care must be exercised if mutable objects are used as map 24.26/9.52 * keys. The behavior of a map is not specified if the value of an object is 24.26/9.52 * changed in a manner that affects equals comparisons while the 24.26/9.52 * object is a key in the map. A special case of this prohibition is that it 24.26/9.52 * is not permissible for a map to contain itself as a key. While it is 24.26/9.52 * permissible for a map to contain itself as a value, extreme caution is 24.26/9.52 * advised: the equals and hashCode methods are no longer 24.26/9.52 * well defined on such a map. 24.26/9.52 * 24.26/9.52 *

All general-purpose map implementation classes should provide two 24.26/9.52 * "standard" constructors: a void (no arguments) constructor which creates an 24.26/9.52 * empty map, and a constructor with a single argument of type Map, 24.26/9.52 * which creates a new map with the same key-value mappings as its argument. 24.26/9.52 * In effect, the latter constructor allows the user to copy any map, 24.26/9.52 * producing an equivalent map of the desired class. There is no way to 24.26/9.52 * enforce this recommendation (as interfaces cannot contain constructors) but 24.26/9.52 * all of the general-purpose map implementations in the JDK comply. 24.26/9.52 * 24.26/9.52 *

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

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

This interface is a member of the 24.26/9.52 * 24.26/9.52 * Java Collections Framework. 24.26/9.52 * 24.26/9.52 *

Many methods in Collections Framework interfaces are defined 24.26/9.52 * in terms of the {@link Object#equals(Object) equals} method. For 24.26/9.52 * example, the specification for the {@link #containsKey(Object) 24.26/9.52 * containsKey(Object key)} method says: "returns true if and 24.26/9.52 * only if this map contains a mapping for a key k such that 24.26/9.52 * (key==null ? k==null : key.equals(k))." This specification should 24.26/9.52 * not be construed to imply that invoking Map.containsKey 24.26/9.52 * with a non-null argument key will cause key.equals(k) to 24.26/9.52 * be invoked for any key k. Implementations are free to 24.26/9.52 * implement optimizations whereby the equals invocation is avoided, 24.26/9.52 * for example, by first comparing the hash codes of the two keys. (The 24.26/9.52 * {@link Object#hashCode()} specification guarantees that two objects with 24.26/9.52 * unequal hash codes cannot be equal.) More generally, implementations of 24.26/9.52 * the various Collections Framework interfaces are free to take advantage of 24.26/9.52 * the specified behavior of underlying {@link Object} methods wherever the 24.26/9.52 * implementor deems it appropriate. 24.26/9.52 * 24.26/9.52 * @param the type of keys maintained by this map 24.26/9.52 * @param the type of mapped values 24.26/9.52 * 24.26/9.52 * @author Josh Bloch 24.26/9.52 * @see HashMap 24.26/9.52 * @see TreeMap 24.26/9.52 * @see Hashtable 24.26/9.52 * @see SortedMap 24.26/9.52 * @see Collection 24.26/9.52 * @see Set 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 public interface Map { 24.26/9.52 // Query Operations 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the number of key-value mappings in this map. If the 24.26/9.52 * map contains more than Integer.MAX_VALUE elements, returns 24.26/9.52 * Integer.MAX_VALUE. 24.26/9.52 * 24.26/9.52 * @return the number of key-value mappings in this map 24.26/9.52 */ 24.26/9.52 int size(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map contains no key-value mappings. 24.26/9.52 * 24.26/9.52 * @return true if this map contains no key-value mappings 24.26/9.52 */ 24.26/9.52 boolean isEmpty(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map contains a mapping for the specified 24.26/9.52 * key. More formally, returns true if and only if 24.26/9.52 * this map contains a mapping for a key k such that 24.26/9.52 * (key==null ? k==null : key.equals(k)). (There can be 24.26/9.52 * at most one such mapping.) 24.26/9.52 * 24.26/9.52 * @param key key whose presence in this map is to be tested 24.26/9.52 * @return true if this map contains a mapping for the specified 24.26/9.52 * key 24.26/9.52 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.52 * this map (optional) 24.26/9.52 * @throws NullPointerException if the specified key is null and this map 24.26/9.52 * does not permit null keys (optional) 24.26/9.52 */ 24.26/9.52 boolean containsKey(Object key); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this map maps one or more keys to the 24.26/9.52 * specified value. More formally, returns true if and only if 24.26/9.52 * this map contains at least one mapping to a value v such that 24.26/9.52 * (value==null ? v==null : value.equals(v)). This operation 24.26/9.52 * will probably require time linear in the map size for most 24.26/9.52 * implementations of the Map interface. 24.26/9.52 * 24.26/9.52 * @param value value whose presence in this map is to be tested 24.26/9.52 * @return true if this map maps one or more keys to the 24.26/9.52 * specified value 24.26/9.52 * @throws ClassCastException if the value is of an inappropriate type for 24.26/9.52 * this map (optional) 24.26/9.52 * @throws NullPointerException if the specified value is null and this 24.26/9.52 * map does not permit null values (optional) 24.26/9.52 */ 24.26/9.52 boolean containsValue(Object value); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the value to which the specified key is mapped, 24.26/9.52 * or {@code null} if this map contains no mapping for the key. 24.26/9.52 * 24.26/9.52 *

More formally, if this map contains a mapping from a key 24.26/9.52 * {@code k} to a value {@code v} such that {@code (key==null ? k==null : 24.26/9.52 * key.equals(k))}, then this method returns {@code v}; otherwise 24.26/9.52 * it returns {@code null}. (There can be at most one such mapping.) 24.26/9.52 * 24.26/9.52 *

If this map permits null values, then a return value of 24.26/9.52 * {@code null} does not necessarily indicate that the map 24.26/9.52 * contains no mapping for the key; it's also possible that the map 24.26/9.52 * explicitly maps the key to {@code null}. The {@link #containsKey 24.26/9.52 * containsKey} operation may be used to distinguish these two cases. 24.26/9.52 * 24.26/9.52 * @param key the key whose associated value is to be returned 24.26/9.52 * @return the value to which the specified key is mapped, or 24.26/9.52 * {@code null} if this map contains no mapping for the key 24.26/9.52 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.52 * this map (optional) 24.26/9.52 * @throws NullPointerException if the specified key is null and this map 24.26/9.52 * does not permit null keys (optional) 24.26/9.52 */ 24.26/9.52 V get(Object key); 24.26/9.52 24.26/9.52 // Modification Operations 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Associates the specified value with the specified key in this map 24.26/9.52 * (optional operation). If the map previously contained a mapping for 24.26/9.52 * the key, the old value is replaced by the specified value. (A map 24.26/9.52 * m is said to contain a mapping for a key k if and only 24.26/9.52 * if {@link #containsKey(Object) m.containsKey(k)} would return 24.26/9.52 * true.) 24.26/9.52 * 24.26/9.52 * @param key key with which the specified value is to be associated 24.26/9.52 * @param value value to be associated with the specified key 24.26/9.52 * @return the previous value associated with key, or 24.26/9.52 * null if there was no mapping for key. 24.26/9.52 * (A null return can also indicate that the map 24.26/9.52 * previously associated null with key, 24.26/9.52 * if the implementation supports null values.) 24.26/9.52 * @throws UnsupportedOperationException if the put operation 24.26/9.52 * is not supported by this map 24.26/9.52 * @throws ClassCastException if the class of the specified key or value 24.26/9.52 * prevents it from being stored in this map 24.26/9.52 * @throws NullPointerException if the specified key or value is null 24.26/9.52 * and this map does not permit null keys or values 24.26/9.52 * @throws IllegalArgumentException if some property of the specified key 24.26/9.52 * or value prevents it from being stored in this map 24.26/9.52 */ 24.26/9.52 V put(K key, V value); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes the mapping for a key from this map if it is present 24.26/9.52 * (optional operation). More formally, if this map contains a mapping 24.26/9.52 * from key k to value v such that 24.26/9.52 * (key==null ? k==null : key.equals(k)), that mapping 24.26/9.52 * is removed. (The map can contain at most one such mapping.) 24.26/9.52 * 24.26/9.52 *

Returns the value to which this map previously associated the key, 24.26/9.52 * or null if the map contained no mapping for the key. 24.26/9.52 * 24.26/9.52 *

If this map permits null values, then a return value of 24.26/9.52 * null does not necessarily indicate that the map 24.26/9.52 * contained no mapping for the key; it's also possible that the map 24.26/9.52 * explicitly mapped the key to null. 24.26/9.52 * 24.26/9.52 *

The map will not contain a mapping for the specified key once the 24.26/9.52 * call returns. 24.26/9.52 * 24.26/9.52 * @param key key whose mapping is to be removed from the map 24.26/9.52 * @return the previous value associated with key, or 24.26/9.52 * null if there was no mapping for key. 24.26/9.52 * @throws UnsupportedOperationException if the remove operation 24.26/9.52 * is not supported by this map 24.26/9.52 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.52 * this map (optional) 24.26/9.52 * @throws NullPointerException if the specified key is null and this 24.26/9.52 * map does not permit null keys (optional) 24.26/9.52 */ 24.26/9.52 V remove(Object key); 24.26/9.52 24.26/9.52 24.26/9.52 // Bulk Operations 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Copies all of the mappings from the specified map to this map 24.26/9.52 * (optional operation). The effect of this call is equivalent to that 24.26/9.52 * of calling {@link #put(Object,Object) put(k, v)} on this map once 24.26/9.52 * for each mapping from key k to value v in the 24.26/9.52 * specified map. The behavior of this operation is undefined if the 24.26/9.52 * specified map is modified while the operation is in progress. 24.26/9.52 * 24.26/9.52 * @param m mappings to be stored in this map 24.26/9.52 * @throws UnsupportedOperationException if the putAll operation 24.26/9.52 * is not supported by this map 24.26/9.52 * @throws ClassCastException if the class of a key or value in the 24.26/9.52 * specified map prevents it from being stored in this map 24.26/9.52 * @throws NullPointerException if the specified map is null, or if 24.26/9.52 * this map does not permit null keys or values, and the 24.26/9.52 * specified map contains null keys or values 24.26/9.52 * @throws IllegalArgumentException if some property of a key or value in 24.26/9.52 * the specified map prevents it from being stored in this map 24.26/9.52 */ 24.26/9.52 void putAll(Map m); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Removes all of the mappings from this map (optional operation). 24.26/9.52 * The map will be empty after this call returns. 24.26/9.52 * 24.26/9.52 * @throws UnsupportedOperationException if the clear operation 24.26/9.52 * is not supported by this map 24.26/9.52 */ 24.26/9.52 void clear(); 24.26/9.52 24.26/9.52 24.26/9.52 // Views 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Set} view of the keys contained in this map. 24.26/9.52 * The set is backed by the map, so changes to the map are 24.26/9.52 * reflected in the set, and vice-versa. If the map is modified 24.26/9.52 * while an iteration over the set is in progress (except through 24.26/9.52 * the iterator's own remove operation), the results of 24.26/9.52 * the iteration are undefined. The set supports element removal, 24.26/9.52 * which removes the corresponding mapping from the map, via the 24.26/9.52 * Iterator.remove, Set.remove, 24.26/9.52 * removeAll, retainAll, and clear 24.26/9.52 * operations. It does not support the add or addAll 24.26/9.52 * operations. 24.26/9.52 * 24.26/9.52 * @return a set view of the keys contained in this map 24.26/9.52 */ 24.26/9.52 Set keySet(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Collection} view of the values contained in this map. 24.26/9.52 * The collection is backed by the map, so changes to the map are 24.26/9.52 * reflected in the collection, and vice-versa. If the map is 24.26/9.52 * modified while an iteration over the collection is in progress 24.26/9.52 * (except through the iterator's own remove operation), 24.26/9.52 * the results of the iteration are undefined. The collection 24.26/9.52 * supports element removal, which removes the corresponding 24.26/9.52 * mapping from the map, via the Iterator.remove, 24.26/9.52 * Collection.remove, removeAll, 24.26/9.52 * retainAll and clear operations. It does not 24.26/9.52 * support the add or addAll operations. 24.26/9.52 * 24.26/9.52 * @return a collection view of the values contained in this map 24.26/9.52 */ 24.26/9.52 Collection values(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns a {@link Set} view of the mappings contained in this map. 24.26/9.52 * The set is backed by the map, so changes to the map are 24.26/9.52 * reflected in the set, and vice-versa. If the map is modified 24.26/9.52 * while an iteration over the set is in progress (except through 24.26/9.52 * the iterator's own remove operation, or through the 24.26/9.52 * setValue operation on a map entry returned by the 24.26/9.52 * iterator) the results of the iteration are undefined. The set 24.26/9.52 * supports element removal, which removes the corresponding 24.26/9.52 * mapping from the map, via the Iterator.remove, 24.26/9.52 * Set.remove, removeAll, retainAll and 24.26/9.52 * clear operations. It does not support the 24.26/9.52 * add or addAll operations. 24.26/9.52 * 24.26/9.52 * @return a set view of the mappings contained in this map 24.26/9.52 */ 24.26/9.52 Set> entrySet(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * A map entry (key-value pair). The Map.entrySet method returns 24.26/9.52 * a collection-view of the map, whose elements are of this class. The 24.26/9.52 * only way to obtain a reference to a map entry is from the 24.26/9.52 * iterator of this collection-view. These Map.Entry objects are 24.26/9.52 * valid only for the duration of the iteration; more formally, 24.26/9.52 * the behavior of a map entry is undefined if the backing map has been 24.26/9.52 * modified after the entry was returned by the iterator, except through 24.26/9.52 * the setValue operation on the map entry. 24.26/9.52 * 24.26/9.52 * @see Map#entrySet() 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 interface Entry { 24.26/9.52 /** 24.26/9.52 * Returns the key corresponding to this entry. 24.26/9.52 * 24.26/9.52 * @return the key corresponding to this entry 24.26/9.52 * @throws IllegalStateException implementations may, but are not 24.26/9.52 * required to, throw this exception if the entry has been 24.26/9.52 * removed from the backing map. 24.26/9.52 */ 24.26/9.52 K getKey(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the value corresponding to this entry. If the mapping 24.26/9.52 * has been removed from the backing map (by the iterator's 24.26/9.52 * remove operation), the results of this call are undefined. 24.26/9.52 * 24.26/9.52 * @return the value corresponding to this entry 24.26/9.52 * @throws IllegalStateException implementations may, but are not 24.26/9.52 * required to, throw this exception if the entry has been 24.26/9.52 * removed from the backing map. 24.26/9.52 */ 24.26/9.52 V getValue(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Replaces the value corresponding to this entry with the specified 24.26/9.52 * value (optional operation). (Writes through to the map.) The 24.26/9.52 * behavior of this call is undefined if the mapping has already been 24.26/9.52 * removed from the map (by the iterator's remove operation). 24.26/9.52 * 24.26/9.52 * @param value new value to be stored in this entry 24.26/9.52 * @return old value corresponding to the entry 24.26/9.52 * @throws UnsupportedOperationException if the put operation 24.26/9.52 * is not supported by the backing map 24.26/9.52 * @throws ClassCastException if the class of the specified value 24.26/9.52 * prevents it from being stored in the backing map 24.26/9.52 * @throws NullPointerException if the backing map does not permit 24.26/9.52 * null values, and the specified value is null 24.26/9.52 * @throws IllegalArgumentException if some property of this value 24.26/9.52 * prevents it from being stored in the backing map 24.26/9.52 * @throws IllegalStateException implementations may, but are not 24.26/9.52 * required to, throw this exception if the entry has been 24.26/9.52 * removed from the backing map. 24.26/9.52 */ 24.26/9.52 V setValue(V value); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Compares the specified object with this entry for equality. 24.26/9.52 * Returns true if the given object is also a map entry and 24.26/9.52 * the two entries represent the same mapping. More formally, two 24.26/9.52 * entries e1 and e2 represent the same mapping 24.26/9.52 * if

24.26/9.52	         *     (e1.getKey()==null ?
24.26/9.52	         *      e2.getKey()==null : e1.getKey().equals(e2.getKey()))  &&
24.26/9.52	         *     (e1.getValue()==null ?
24.26/9.52	         *      e2.getValue()==null : e1.getValue().equals(e2.getValue()))
24.26/9.52	         *
24.26/9.52 * This ensures that the equals method works properly across 24.26/9.52 * different implementations of the Map.Entry interface. 24.26/9.52 * 24.26/9.52 * @param o object to be compared for equality with this map entry 24.26/9.52 * @return true if the specified object is equal to this map 24.26/9.52 * entry 24.26/9.52 */ 24.26/9.52 boolean equals(Object o); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the hash code value for this map entry. The hash code 24.26/9.52 * of a map entry e is defined to be: 
24.26/9.52	         *     (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.52	         *     (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.52	         *
24.26/9.52 * This ensures that e1.equals(e2) implies that 24.26/9.52 * e1.hashCode()==e2.hashCode() for any two Entries 24.26/9.52 * e1 and e2, as required by the general 24.26/9.52 * contract of Object.hashCode. 24.26/9.52 * 24.26/9.52 * @return the hash code value for this map entry 24.26/9.52 * @see Object#hashCode() 24.26/9.52 * @see Object#equals(Object) 24.26/9.52 * @see #equals(Object) 24.26/9.52 */ 24.26/9.52 int hashCode(); 24.26/9.52 } 24.26/9.52 24.26/9.52 // Comparison and hashing 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Compares the specified object with this map for equality. Returns 24.26/9.52 * true if the given object is also a map and the two maps 24.26/9.52 * represent the same mappings. More formally, two maps m1 and 24.26/9.52 * m2 represent the same mappings if 24.26/9.52 * m1.entrySet().equals(m2.entrySet()). This ensures that the 24.26/9.52 * equals method works properly across different implementations 24.26/9.52 * of the Map interface. 24.26/9.52 * 24.26/9.52 * @param o object to be compared for equality with this map 24.26/9.52 * @return true if the specified object is equal to this map 24.26/9.52 */ 24.26/9.52 boolean equals(Object o); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the hash code value for this map. The hash code of a map is 24.26/9.52 * defined to be the sum of the hash codes of each entry in the map's 24.26/9.52 * entrySet() view. This ensures that m1.equals(m2) 24.26/9.52 * implies that m1.hashCode()==m2.hashCode() for any two maps 24.26/9.52 * m1 and m2, as required by the general contract of 24.26/9.52 * {@link Object#hashCode}. 24.26/9.52 * 24.26/9.52 * @return the hash code value for this map 24.26/9.52 * @see Map.Entry#hashCode() 24.26/9.52 * @see Object#equals(Object) 24.26/9.52 * @see #equals(Object) 24.26/9.52 */ 24.26/9.52 int hashCode(); 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.52 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.52 * 24.26/9.52 * This code is free software; you can redistribute it and/or modify it 24.26/9.52 * under the terms of the GNU General Public License version 2 only, as 24.26/9.52 * published by the Free Software Foundation. Sun designates this 24.26/9.52 * particular file as subject to the "Classpath" exception as provided 24.26/9.52 * by Sun in the LICENSE file that accompanied this code. 24.26/9.52 * 24.26/9.52 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.52 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.52 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.52 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.52 * accompanied this code). 24.26/9.52 * 24.26/9.52 * You should have received a copy of the GNU General Public License version 24.26/9.52 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.52 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.52 * 24.26/9.52 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.52 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.52 * have any questions. 24.26/9.52 */ 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Thrown by the nextElement method of an 24.26/9.52 * Enumeration to indicate that there are no more 24.26/9.52 * elements in the enumeration. 24.26/9.52 * 24.26/9.52 * @author unascribed 24.26/9.52 * @see java.util.Enumeration 24.26/9.52 * @see java.util.Enumeration#nextElement() 24.26/9.52 * @since JDK1.0 24.26/9.52 */ 24.26/9.52 public 24.26/9.52 class NoSuchElementException extends RuntimeException { 24.26/9.52 /** 24.26/9.52 * Constructs a NoSuchElementException with null 24.26/9.52 * as its error message string. 24.26/9.52 */ 24.26/9.52 public NoSuchElementException() { 24.26/9.52 super(); 24.26/9.52 } 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Constructs a NoSuchElementException, saving a reference 24.26/9.52 * to the error message string s for later retrieval by the 24.26/9.52 * getMessage method. 24.26/9.52 * 24.26/9.52 * @param s the detail message. 24.26/9.52 */ 24.26/9.52 public NoSuchElementException(String s) { 24.26/9.52 super(s); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 public class Random { 24.26/9.52 static String[] args; 24.26/9.52 static int index = 0; 24.26/9.52 24.26/9.52 public static int random() { 24.26/9.52 String string = args[index]; 24.26/9.52 index++; 24.26/9.52 return string.length(); 24.26/9.52 } 24.26/9.52 } 24.26/9.52 24.26/9.52 24.26/9.52 /* 24.26/9.52 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.52 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.52 * 24.26/9.52 * This code is free software; you can redistribute it and/or modify it 24.26/9.52 * under the terms of the GNU General Public License version 2 only, as 24.26/9.52 * published by the Free Software Foundation. Sun designates this 24.26/9.52 * particular file as subject to the "Classpath" exception as provided 24.26/9.52 * by Sun in the LICENSE file that accompanied this code. 24.26/9.52 * 24.26/9.52 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.52 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.52 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.52 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.52 * accompanied this code). 24.26/9.52 * 24.26/9.52 * You should have received a copy of the GNU General Public License version 24.26/9.52 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.52 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.52 * 24.26/9.52 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.52 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.52 * have any questions. 24.26/9.52 */ 24.26/9.52 24.26/9.52 package javaUtilEx; 24.26/9.52 24.26/9.52 /** 24.26/9.52 * A collection that contains no duplicate elements. More formally, sets 24.26/9.52 * contain no pair of elements e1 and e2 such that 24.26/9.52 * e1.equals(e2), and at most one null element. As implied by 24.26/9.52 * its name, this interface models the mathematical set abstraction. 24.26/9.52 * 24.26/9.52 *

The Set interface places additional stipulations, beyond those 24.26/9.52 * inherited from the Collection interface, on the contracts of all 24.26/9.52 * constructors and on the contracts of the add, equals and 24.26/9.52 * hashCode methods. Declarations for other inherited methods are 24.26/9.52 * also included here for convenience. (The specifications accompanying these 24.26/9.52 * declarations have been tailored to the Set interface, but they do 24.26/9.52 * not contain any additional stipulations.) 24.26/9.52 * 24.26/9.52 *

The additional stipulation on constructors is, not surprisingly, 24.26/9.52 * that all constructors must create a set that contains no duplicate elements 24.26/9.52 * (as defined above). 24.26/9.52 * 24.26/9.52 *

Note: Great care must be exercised if mutable objects are used as set 24.26/9.52 * elements. The behavior of a set is not specified if the value of an object 24.26/9.52 * is changed in a manner that affects equals comparisons while the 24.26/9.52 * object is an element in the set. A special case of this prohibition is 24.26/9.52 * that it is not permissible for a set to contain itself as an element. 24.26/9.52 * 24.26/9.52 *

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

This interface is a member of the 24.26/9.52 * 24.26/9.52 * Java Collections Framework. 24.26/9.52 * 24.26/9.52 * @param the type of elements maintained by this set 24.26/9.52 * 24.26/9.52 * @author Josh Bloch 24.26/9.52 * @author Neal Gafter 24.26/9.52 * @see Collection 24.26/9.52 * @see List 24.26/9.52 * @see SortedSet 24.26/9.52 * @see HashSet 24.26/9.52 * @see TreeSet 24.26/9.52 * @see AbstractSet 24.26/9.52 * @see Collections#singleton(java.lang.Object) 24.26/9.52 * @see Collections#EMPTY_SET 24.26/9.52 * @since 1.2 24.26/9.52 */ 24.26/9.52 24.26/9.52 public interface Set extends Collection { 24.26/9.52 // Query Operations 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns the number of elements in this set (its cardinality). If this 24.26/9.52 * set contains more than Integer.MAX_VALUE elements, returns 24.26/9.52 * Integer.MAX_VALUE. 24.26/9.52 * 24.26/9.52 * @return the number of elements in this set (its cardinality) 24.26/9.52 */ 24.26/9.52 int size(); 24.26/9.52 24.26/9.52 /** 24.26/9.52 * Returns true if this set contains no elements. 24.26/9.52 * 24.26/9.52 * @return true if this set contains no elements 24.26/9.52 */ 24.26/9.52 boolean isEmpty(); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns true if this set contains the specified element. 24.26/9.53 * More formally, returns true if and only if this set 24.26/9.53 * contains an element e such that 24.26/9.53 * (o==null ? e==null : o.equals(e)). 24.26/9.53 * 24.26/9.53 * @param o element whose presence in this set is to be tested 24.26/9.53 * @return true if this set contains the specified element 24.26/9.53 * @throws ClassCastException if the type of the specified element 24.26/9.53 * is incompatible with this set (optional) 24.26/9.53 * @throws NullPointerException if the specified element is null and this 24.26/9.53 * set does not permit null elements (optional) 24.26/9.53 */ 24.26/9.53 boolean contains(Object o); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns an iterator over the elements in this set. The elements are 24.26/9.53 * returned in no particular order (unless this set is an instance of some 24.26/9.53 * class that provides a guarantee). 24.26/9.53 * 24.26/9.53 * @return an iterator over the elements in this set 24.26/9.53 */ 24.26/9.53 Iterator iterator(); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns an array containing all of the elements in this set. 24.26/9.53 * If this set makes any guarantees as to what order its elements 24.26/9.53 * are returned by its iterator, this method must return the 24.26/9.53 * elements in the same order. 24.26/9.53 * 24.26/9.53 *

The returned array will be "safe" in that no references to it 24.26/9.53 * are maintained by this set. (In other words, this method must 24.26/9.53 * allocate a new array even if this set is backed by an array). 24.26/9.53 * The caller is thus free to modify the returned array. 24.26/9.53 * 24.26/9.53 *

This method acts as bridge between array-based and collection-based 24.26/9.53 * APIs. 24.26/9.53 * 24.26/9.53 * @return an array containing all the elements in this set 24.26/9.53 */ 24.26/9.53 Object[] toArray(); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns an array containing all of the elements in this set; the 24.26/9.53 * runtime type of the returned array is that of the specified array. 24.26/9.53 * If the set fits in the specified array, it is returned therein. 24.26/9.53 * Otherwise, a new array is allocated with the runtime type of the 24.26/9.53 * specified array and the size of this set. 24.26/9.53 * 24.26/9.53 *

If this set fits in the specified array with room to spare 24.26/9.53 * (i.e., the array has more elements than this set), the element in 24.26/9.53 * the array immediately following the end of the set is set to 24.26/9.53 * null. (This is useful in determining the length of this 24.26/9.53 * set only if the caller knows that this set does not contain 24.26/9.53 * any null elements.) 24.26/9.53 * 24.26/9.53 *

If this set makes any guarantees as to what order its elements 24.26/9.53 * are returned by its iterator, this method must return the elements 24.26/9.53 * in the same order. 24.26/9.53 * 24.26/9.53 *

Like the {@link #toArray()} method, this method acts as bridge between 24.26/9.53 * array-based and collection-based APIs. Further, this method allows 24.26/9.53 * precise control over the runtime type of the output array, and may, 24.26/9.53 * under certain circumstances, be used to save allocation costs. 24.26/9.53 * 24.26/9.53 *

Suppose x is a set known to contain only strings. 24.26/9.53 * The following code can be used to dump the set into a newly allocated 24.26/9.53 * array of String: 24.26/9.53 * 24.26/9.53 * 

24.26/9.53	     *     String[] y = x.toArray(new String[0]);
24.26/9.53 * 24.26/9.53 * Note that toArray(new Object[0]) is identical in function to 24.26/9.53 * toArray(). 24.26/9.53 * 24.26/9.53 * @param a the array into which the elements of this set are to be 24.26/9.53 * stored, if it is big enough; otherwise, a new array of the same 24.26/9.53 * runtime type is allocated for this purpose. 24.26/9.53 * @return an array containing all the elements in this set 24.26/9.53 * @throws ArrayStoreException if the runtime type of the specified array 24.26/9.53 * is not a supertype of the runtime type of every element in this 24.26/9.53 * set 24.26/9.53 * @throws NullPointerException if the specified array is null 24.26/9.53 */ 24.26/9.53 T[] toArray(T[] a); 24.26/9.53 24.26/9.53 24.26/9.53 // Modification Operations 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Adds the specified element to this set if it is not already present 24.26/9.53 * (optional operation). More formally, adds the specified element 24.26/9.53 * e to this set if the set contains no element e2 24.26/9.53 * such that 24.26/9.53 * (e==null ? e2==null : e.equals(e2)). 24.26/9.53 * If this set already contains the element, the call leaves the set 24.26/9.53 * unchanged and returns false. In combination with the 24.26/9.53 * restriction on constructors, this ensures that sets never contain 24.26/9.53 * duplicate elements. 24.26/9.53 * 24.26/9.53 *

The stipulation above does not imply that sets must accept all 24.26/9.53 * elements; sets may refuse to add any particular element, including 24.26/9.53 * null, and throw an exception, as described in the 24.26/9.53 * specification for {@link Collection#add Collection.add}. 24.26/9.53 * Individual set implementations should clearly document any 24.26/9.53 * restrictions on the elements that they may contain. 24.26/9.53 * 24.26/9.53 * @param e element to be added to this set 24.26/9.53 * @return true if this set did not already contain the specified 24.26/9.53 * element 24.26/9.53 * @throws UnsupportedOperationException if the add operation 24.26/9.53 * is not supported by this set 24.26/9.53 * @throws ClassCastException if the class of the specified element 24.26/9.53 * prevents it from being added to this set 24.26/9.53 * @throws NullPointerException if the specified element is null and this 24.26/9.53 * set does not permit null elements 24.26/9.53 * @throws IllegalArgumentException if some property of the specified element 24.26/9.53 * prevents it from being added to this set 24.26/9.53 */ 24.26/9.53 boolean add(E e); 24.26/9.53 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Removes the specified element from this set if it is present 24.26/9.53 * (optional operation). More formally, removes an element e 24.26/9.53 * such that 24.26/9.53 * (o==null ? e==null : o.equals(e)), if 24.26/9.53 * this set contains such an element. Returns true if this set 24.26/9.53 * contained the element (or equivalently, if this set changed as a 24.26/9.53 * result of the call). (This set will not contain the element once the 24.26/9.53 * call returns.) 24.26/9.53 * 24.26/9.53 * @param o object to be removed from this set, if present 24.26/9.53 * @return true if this set contained the specified element 24.26/9.53 * @throws ClassCastException if the type of the specified element 24.26/9.53 * is incompatible with this set (optional) 24.26/9.53 * @throws NullPointerException if the specified element is null and this 24.26/9.53 * set does not permit null elements (optional) 24.26/9.53 * @throws UnsupportedOperationException if the remove operation 24.26/9.53 * is not supported by this set 24.26/9.53 */ 24.26/9.53 boolean remove(Object o); 24.26/9.53 24.26/9.53 24.26/9.53 // Bulk Operations 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns true if this set contains all of the elements of the 24.26/9.53 * specified collection. If the specified collection is also a set, this 24.26/9.53 * method returns true if it is a subset of this set. 24.26/9.53 * 24.26/9.53 * @param c collection to be checked for containment in this set 24.26/9.53 * @return true if this set contains all of the elements of the 24.26/9.53 * specified collection 24.26/9.53 * @throws ClassCastException if the types of one or more elements 24.26/9.53 * in the specified collection are incompatible with this 24.26/9.53 * set (optional) 24.26/9.53 * @throws NullPointerException if the specified collection contains one 24.26/9.53 * or more null elements and this set does not permit null 24.26/9.53 * elements (optional), or if the specified collection is null 24.26/9.53 * @see #contains(Object) 24.26/9.53 */ 24.26/9.53 boolean containsAll(Collection c); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Adds all of the elements in the specified collection to this set if 24.26/9.53 * they're not already present (optional operation). If the specified 24.26/9.53 * collection is also a set, the addAll operation effectively 24.26/9.53 * modifies this set so that its value is the union of the two 24.26/9.53 * sets. The behavior of this operation is undefined if the specified 24.26/9.53 * collection is modified while the operation is in progress. 24.26/9.53 * 24.26/9.53 * @param c collection containing elements to be added to this set 24.26/9.53 * @return true if this set changed as a result of the call 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException if the addAll operation 24.26/9.53 * is not supported by this set 24.26/9.53 * @throws ClassCastException if the class of an element of the 24.26/9.53 * specified collection prevents it from being added to this set 24.26/9.53 * @throws NullPointerException if the specified collection contains one 24.26/9.53 * or more null elements and this set does not permit null 24.26/9.53 * elements, or if the specified collection is null 24.26/9.53 * @throws IllegalArgumentException if some property of an element of the 24.26/9.53 * specified collection prevents it from being added to this set 24.26/9.53 * @see #add(Object) 24.26/9.53 */ 24.26/9.53 boolean addAll(Collection c); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Retains only the elements in this set that are contained in the 24.26/9.53 * specified collection (optional operation). In other words, removes 24.26/9.53 * from this set all of its elements that are not contained in the 24.26/9.53 * specified collection. If the specified collection is also a set, this 24.26/9.53 * operation effectively modifies this set so that its value is the 24.26/9.53 * intersection of the two sets. 24.26/9.53 * 24.26/9.53 * @param c collection containing elements to be retained in this set 24.26/9.53 * @return true if this set changed as a result of the call 24.26/9.53 * @throws UnsupportedOperationException if the retainAll operation 24.26/9.53 * is not supported by this set 24.26/9.53 * @throws ClassCastException if the class of an element of this set 24.26/9.53 * is incompatible with the specified collection (optional) 24.26/9.53 * @throws NullPointerException if this set contains a null element and the 24.26/9.53 * specified collection does not permit null elements (optional), 24.26/9.53 * or if the specified collection is null 24.26/9.53 * @see #remove(Object) 24.26/9.53 */ 24.26/9.53 boolean retainAll(Collection c); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Removes from this set all of its elements that are contained in the 24.26/9.53 * specified collection (optional operation). If the specified 24.26/9.53 * collection is also a set, this operation effectively modifies this 24.26/9.53 * set so that its value is the asymmetric set difference of 24.26/9.53 * the two sets. 24.26/9.53 * 24.26/9.53 * @param c collection containing elements to be removed from this set 24.26/9.53 * @return true if this set changed as a result of the call 24.26/9.53 * @throws UnsupportedOperationException if the removeAll operation 24.26/9.53 * is not supported by this set 24.26/9.53 * @throws ClassCastException if the class of an element of this set 24.26/9.53 * is incompatible with the specified collection (optional) 24.26/9.53 * @throws NullPointerException if this set contains a null element and the 24.26/9.53 * specified collection does not permit null elements (optional), 24.26/9.53 * or if the specified collection is null 24.26/9.53 * @see #remove(Object) 24.26/9.53 * @see #contains(Object) 24.26/9.53 */ 24.26/9.53 boolean removeAll(Collection c); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Removes all of the elements from this set (optional operation). 24.26/9.53 * The set will be empty after this call returns. 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException if the clear method 24.26/9.53 * is not supported by this set 24.26/9.53 */ 24.26/9.53 void clear(); 24.26/9.53 24.26/9.53 24.26/9.53 // Comparison and hashing 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Compares the specified object with this set for equality. Returns 24.26/9.53 * true if the specified object is also a set, the two sets 24.26/9.53 * have the same size, and every member of the specified set is 24.26/9.53 * contained in this set (or equivalently, every member of this set is 24.26/9.53 * contained in the specified set). This definition ensures that the 24.26/9.53 * equals method works properly across different implementations of the 24.26/9.53 * set interface. 24.26/9.53 * 24.26/9.53 * @param o object to be compared for equality with this set 24.26/9.53 * @return true if the specified object is equal to this set 24.26/9.53 */ 24.26/9.53 boolean equals(Object o); 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the hash code value for this set. The hash code of a set is 24.26/9.53 * defined to be the sum of the hash codes of the elements in the set, 24.26/9.53 * where the hash code of a null element is defined to be zero. 24.26/9.53 * This ensures that s1.equals(s2) implies that 24.26/9.53 * s1.hashCode()==s2.hashCode() for any two sets s1 24.26/9.53 * and s2, as required by the general contract of 24.26/9.53 * {@link Object#hashCode}. 24.26/9.53 * 24.26/9.53 * @return the hash code value for this set 24.26/9.53 * @see Object#equals(Object) 24.26/9.53 * @see Set#equals(Object) 24.26/9.53 */ 24.26/9.53 int hashCode(); 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 /* 24.26/9.53 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.53 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.53 * 24.26/9.53 * This code is free software; you can redistribute it and/or modify it 24.26/9.53 * under the terms of the GNU General Public License version 2 only, as 24.26/9.53 * published by the Free Software Foundation. Sun designates this 24.26/9.53 * particular file as subject to the "Classpath" exception as provided 24.26/9.53 * by Sun in the LICENSE file that accompanied this code. 24.26/9.53 * 24.26/9.53 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.53 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.53 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.53 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.53 * accompanied this code). 24.26/9.53 * 24.26/9.53 * You should have received a copy of the GNU General Public License version 24.26/9.53 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.53 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.53 * 24.26/9.53 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.53 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.53 * have any questions. 24.26/9.53 */ 24.26/9.53 24.26/9.53 package javaUtilEx; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Thrown to indicate that the requested operation is not supported.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

To implement an unmodifiable map, the programmer needs only to extend this 24.26/9.53 * class and provide an implementation for the entrySet method, which 24.26/9.53 * returns a set-view of the map's mappings. Typically, the returned set 24.26/9.53 * will, in turn, be implemented atop AbstractSet. This set should 24.26/9.53 * not support the add or remove methods, and its iterator 24.26/9.53 * should not support the remove method. 24.26/9.53 * 24.26/9.53 *

To implement a modifiable map, the programmer must additionally override 24.26/9.53 * this class's put method (which otherwise throws an 24.26/9.53 * UnsupportedOperationException), and the iterator returned by 24.26/9.53 * entrySet().iterator() must additionally implement its 24.26/9.53 * remove method. 24.26/9.53 * 24.26/9.53 *

The programmer should generally provide a void (no argument) and map 24.26/9.53 * constructor, as per the recommendation in the Map interface 24.26/9.53 * specification. 24.26/9.53 * 24.26/9.53 *

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

This class is a member of the 24.26/9.53 * 24.26/9.53 * Java Collections Framework. 24.26/9.53 * 24.26/9.53 * @param the type of keys maintained by this map 24.26/9.53 * @param the type of mapped values 24.26/9.53 * 24.26/9.53 * @author Josh Bloch 24.26/9.53 * @author Neal Gafter 24.26/9.53 * @see Map 24.26/9.53 * @see Collection 24.26/9.53 * @since 1.2 24.26/9.53 */ 24.26/9.53 24.26/9.53 public abstract class AbstractMap implements Map { 24.26/9.53 /** 24.26/9.53 * Sole constructor. (For invocation by subclass constructors, typically 24.26/9.53 * implicit.) 24.26/9.53 */ 24.26/9.53 protected AbstractMap() { 24.26/9.53 } 24.26/9.53 24.26/9.53 // Query Operations 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation returns entrySet().size(). 24.26/9.53 */ 24.26/9.53 public int size() { 24.26/9.53 return entrySet().size(); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

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

This implementation iterates over entrySet() searching 24.26/9.53 * for an entry with the specified value. If such an entry is found, 24.26/9.53 * true is returned. If the iteration terminates without 24.26/9.53 * finding such an entry, false is returned. Note that this 24.26/9.53 * implementation requires linear time in the size of the map. 24.26/9.53 * 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public boolean containsValue(Object value) { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 if (value==null) { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (e.getValue()==null) 24.26/9.53 return true; 24.26/9.53 } 24.26/9.53 } else { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (value.equals(e.getValue())) 24.26/9.53 return true; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 return false; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation iterates over entrySet() searching 24.26/9.53 * for an entry with the specified key. If such an entry is found, 24.26/9.53 * true is returned. If the iteration terminates without 24.26/9.53 * finding such an entry, false is returned. Note that this 24.26/9.53 * implementation requires linear time in the size of the map; many 24.26/9.53 * implementations will override this method. 24.26/9.53 * 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public boolean containsKey(Object key) { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 if (key==null) { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (e.getKey()==null) 24.26/9.53 return true; 24.26/9.53 } 24.26/9.53 } else { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (key.equals(e.getKey())) 24.26/9.53 return true; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 return false; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation iterates over entrySet() searching 24.26/9.53 * for an entry with the specified key. If such an entry is found, 24.26/9.53 * the entry's value is returned. If the iteration terminates without 24.26/9.53 * finding such an entry, null is returned. Note that this 24.26/9.53 * implementation requires linear time in the size of the map; many 24.26/9.53 * implementations will override this method. 24.26/9.53 * 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public V get(Object key) { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 if (key==null) { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (e.getKey()==null) 24.26/9.53 return e.getValue(); 24.26/9.53 } 24.26/9.53 } else { 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (key.equals(e.getKey())) 24.26/9.53 return e.getValue(); 24.26/9.53 } 24.26/9.53 } 24.26/9.53 return null; 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 // Modification Operations 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation always throws an 24.26/9.53 * UnsupportedOperationException. 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 * @throws IllegalArgumentException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public V put(K key, V value) { 24.26/9.53 throw new UnsupportedOperationException(); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation iterates over entrySet() searching for an 24.26/9.53 * entry with the specified key. If such an entry is found, its value is 24.26/9.53 * obtained with its getValue operation, the entry is removed 24.26/9.53 * from the collection (and the backing map) with the iterator's 24.26/9.53 * remove operation, and the saved value is returned. If the 24.26/9.53 * iteration terminates without finding such an entry, null is 24.26/9.53 * returned. Note that this implementation requires linear time in the 24.26/9.53 * size of the map; many implementations will override this method. 24.26/9.53 * 24.26/9.53 *

Note that this implementation throws an 24.26/9.53 * UnsupportedOperationException if the entrySet 24.26/9.53 * iterator does not support the remove method and this map 24.26/9.53 * contains a mapping for the specified key. 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public V remove(Object key) { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 Entry correctEntry = null; 24.26/9.53 if (key==null) { 24.26/9.53 while (correctEntry==null && i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (e.getKey()==null) 24.26/9.53 correctEntry = e; 24.26/9.53 } 24.26/9.53 } else { 24.26/9.53 while (correctEntry==null && i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 if (key.equals(e.getKey())) 24.26/9.53 correctEntry = e; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 24.26/9.53 V oldValue = null; 24.26/9.53 if (correctEntry !=null) { 24.26/9.53 oldValue = correctEntry.getValue(); 24.26/9.53 i.remove(); 24.26/9.53 } 24.26/9.53 return oldValue; 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 // Bulk Operations 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation iterates over the specified map's 24.26/9.53 * entrySet() collection, and calls this map's put 24.26/9.53 * operation once for each entry returned by the iteration. 24.26/9.53 * 24.26/9.53 *

Note that this implementation throws an 24.26/9.53 * UnsupportedOperationException if this map does not support 24.26/9.53 * the put operation and the specified map is nonempty. 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.53 * @throws ClassCastException {@inheritDoc} 24.26/9.53 * @throws NullPointerException {@inheritDoc} 24.26/9.53 * @throws IllegalArgumentException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public void putAll(Map m) { 24.26/9.53 Iterator it = m.entrySet().iterator(); 24.26/9.53 while (it.hasNext()) { 24.26/9.53 Map.Entry e = (Map.Entry) it.next(); 24.26/9.53 put((K) e.getKey(), (V) e.getValue()); 24.26/9.53 } 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation calls entrySet().clear(). 24.26/9.53 * 24.26/9.53 *

Note that this implementation throws an 24.26/9.53 * UnsupportedOperationException if the entrySet 24.26/9.53 * does not support the clear operation. 24.26/9.53 * 24.26/9.53 * @throws UnsupportedOperationException {@inheritDoc} 24.26/9.53 */ 24.26/9.53 public void clear() { 24.26/9.53 entrySet().clear(); 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 // Views 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Each of these fields are initialized to contain an instance of the 24.26/9.53 * appropriate view the first time this view is requested. The views are 24.26/9.53 * stateless, so there's no reason to create more than one of each. 24.26/9.53 */ 24.26/9.53 transient volatile Set keySet = null; 24.26/9.53 transient volatile Collection values = null; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation returns a set that subclasses {@link AbstractSet}. 24.26/9.53 * The subclass's iterator method returns a "wrapper object" over this 24.26/9.53 * map's entrySet() iterator. The size method 24.26/9.53 * delegates to this map's size method and the 24.26/9.53 * contains method delegates to this map's 24.26/9.53 * containsKey method. 24.26/9.53 * 24.26/9.53 *

The set is created the first time this method is called, 24.26/9.53 * and returned in response to all subsequent calls. No synchronization 24.26/9.53 * is performed, so there is a slight chance that multiple calls to this 24.26/9.53 * method will not all return the same set. 24.26/9.53 */ 24.26/9.53 public Set keySet() { 24.26/9.53 if (keySet == null) { 24.26/9.53 keySet = new AbstractSet() { 24.26/9.53 public Iterator iterator() { 24.26/9.53 return new Iterator() { 24.26/9.53 private Iterator> i = entrySet().iterator(); 24.26/9.53 24.26/9.53 public boolean hasNext() { 24.26/9.53 return i.hasNext(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public K next() { 24.26/9.53 return i.next().getKey(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public void remove() { 24.26/9.53 i.remove(); 24.26/9.53 } 24.26/9.53 }; 24.26/9.53 } 24.26/9.53 24.26/9.53 public int size() { 24.26/9.53 return AbstractMap.this.size(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public boolean isEmpty() { 24.26/9.53 return AbstractMap.this.isEmpty(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public void clear() { 24.26/9.53 AbstractMap.this.clear(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public boolean contains(Object k) { 24.26/9.53 return AbstractMap.this.containsKey(k); 24.26/9.53 } 24.26/9.53 24.26/9.53 public Object[] toArray() { 24.26/9.53 Object[] res = new Object[AbstractMap.this.size()]; 24.26/9.53 Iterator> it = entrySet().iterator(); 24.26/9.53 int i = 0; 24.26/9.53 while (it.hasNext()) 24.26/9.53 res[i++] = it.next().getKey(); 24.26/9.53 return res; 24.26/9.53 } 24.26/9.53 24.26/9.53 public T[] toArray(T[] a) { 24.26/9.53 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.53 a.getClass().getComponentType(), AbstractMap.this.size()); 24.26/9.53 Object[] res = a; 24.26/9.53 Iterator> it = entrySet().iterator(); 24.26/9.53 int i = 0; 24.26/9.53 while (it.hasNext()) 24.26/9.53 res[i++] = it.next().getKey(); 24.26/9.53 return a; 24.26/9.53 } 24.26/9.53 }; 24.26/9.53 } 24.26/9.53 return keySet; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * {@inheritDoc} 24.26/9.53 * 24.26/9.53 *

This implementation returns a collection that subclasses {@link 24.26/9.53 * AbstractCollection}. The subclass's iterator method returns a 24.26/9.53 * "wrapper object" over this map's entrySet() iterator. 24.26/9.53 * The size method delegates to this map's size 24.26/9.53 * method and the contains method delegates to this map's 24.26/9.53 * containsValue method. 24.26/9.53 * 24.26/9.53 *

The collection is created the first time this method is called, and 24.26/9.53 * returned in response to all subsequent calls. No synchronization is 24.26/9.53 * performed, so there is a slight chance that multiple calls to this 24.26/9.53 * method will not all return the same collection. 24.26/9.53 */ 24.26/9.53 public Collection values() { 24.26/9.53 if (values == null) { 24.26/9.53 values = new AbstractCollection() { 24.26/9.53 public Iterator iterator() { 24.26/9.53 return new Iterator() { 24.26/9.53 private Iterator> i = entrySet().iterator(); 24.26/9.53 24.26/9.53 public boolean hasNext() { 24.26/9.53 return i.hasNext(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public V next() { 24.26/9.53 return i.next().getValue(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public void remove() { 24.26/9.53 i.remove(); 24.26/9.53 } 24.26/9.53 }; 24.26/9.53 } 24.26/9.53 24.26/9.53 public int size() { 24.26/9.53 return AbstractMap.this.size(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public boolean isEmpty() { 24.26/9.53 return AbstractMap.this.isEmpty(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public void clear() { 24.26/9.53 AbstractMap.this.clear(); 24.26/9.53 } 24.26/9.53 24.26/9.53 public boolean contains(Object v) { 24.26/9.53 return AbstractMap.this.containsValue(v); 24.26/9.53 } 24.26/9.53 }; 24.26/9.53 } 24.26/9.53 return values; 24.26/9.53 } 24.26/9.53 24.26/9.53 public abstract Set> entrySet(); 24.26/9.53 24.26/9.53 24.26/9.53 // Comparison and hashing 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Compares the specified object with this map for equality. Returns 24.26/9.53 * true if the given object is also a map and the two maps 24.26/9.53 * represent the same mappings. More formally, two maps m1 and 24.26/9.53 * m2 represent the same mappings if 24.26/9.53 * m1.entrySet().equals(m2.entrySet()). This ensures that the 24.26/9.53 * equals method works properly across different implementations 24.26/9.53 * of the Map interface. 24.26/9.53 * 24.26/9.53 *

This implementation first checks if the specified object is this map; 24.26/9.53 * if so it returns true. Then, it checks if the specified 24.26/9.53 * object is a map whose size is identical to the size of this map; if 24.26/9.53 * not, it returns false. If so, it iterates over this map's 24.26/9.53 * entrySet collection, and checks that the specified map 24.26/9.53 * contains each mapping that this map contains. If the specified map 24.26/9.53 * fails to contain such a mapping, false is returned. If the 24.26/9.53 * iteration completes, true is returned. 24.26/9.53 * 24.26/9.53 * @param o object to be compared for equality with this map 24.26/9.53 * @return true if the specified object is equal to this map 24.26/9.53 */ 24.26/9.53 public boolean equals(Object o) { 24.26/9.53 if (o == this) 24.26/9.53 return true; 24.26/9.53 24.26/9.53 if (!(o instanceof Map)) 24.26/9.53 return false; 24.26/9.53 Map m = (Map) o; 24.26/9.53 if (m.size() != size()) 24.26/9.53 return false; 24.26/9.53 24.26/9.53 try { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 while (i.hasNext()) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 K key = e.getKey(); 24.26/9.53 V value = e.getValue(); 24.26/9.53 if (value == null) { 24.26/9.53 if (!(m.get(key)==null && m.containsKey(key))) 24.26/9.53 return false; 24.26/9.53 } else { 24.26/9.53 if (!value.equals(m.get(key))) 24.26/9.53 return false; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 } catch (ClassCastException unused) { 24.26/9.53 return false; 24.26/9.53 } catch (NullPointerException unused) { 24.26/9.53 return false; 24.26/9.53 } 24.26/9.53 24.26/9.53 return true; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the hash code value for this map. The hash code of a map is 24.26/9.53 * defined to be the sum of the hash codes of each entry in the map's 24.26/9.53 * entrySet() view. This ensures that m1.equals(m2) 24.26/9.53 * implies that m1.hashCode()==m2.hashCode() for any two maps 24.26/9.53 * m1 and m2, as required by the general contract of 24.26/9.53 * {@link Object#hashCode}. 24.26/9.53 * 24.26/9.53 *

This implementation iterates over entrySet(), calling 24.26/9.53 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the 24.26/9.53 * set, and adding up the results. 24.26/9.53 * 24.26/9.53 * @return the hash code value for this map 24.26/9.53 * @see Map.Entry#hashCode() 24.26/9.53 * @see Object#equals(Object) 24.26/9.53 * @see Set#equals(Object) 24.26/9.53 */ 24.26/9.53 public int hashCode() { 24.26/9.53 int h = 0; 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 while (i.hasNext()) 24.26/9.53 h += i.next().hashCode(); 24.26/9.53 return h; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns a string representation of this map. The string representation 24.26/9.53 * consists of a list of key-value mappings in the order returned by the 24.26/9.53 * map's entrySet view's iterator, enclosed in braces 24.26/9.53 * ("{}"). Adjacent mappings are separated by the characters 24.26/9.53 * ", " (comma and space). Each key-value mapping is rendered as 24.26/9.53 * the key followed by an equals sign ("=") followed by the 24.26/9.53 * associated value. Keys and values are converted to strings as by 24.26/9.53 * {@link String#valueOf(Object)}. 24.26/9.53 * 24.26/9.53 * @return a string representation of this map 24.26/9.53 */ 24.26/9.53 public String toString() { 24.26/9.53 Iterator> i = entrySet().iterator(); 24.26/9.53 if (! i.hasNext()) 24.26/9.53 return "{}"; 24.26/9.53 24.26/9.53 StringBuilder sb = new StringBuilder(); 24.26/9.53 sb.append('{'); 24.26/9.53 for (;;) { 24.26/9.53 Entry e = i.next(); 24.26/9.53 K key = e.getKey(); 24.26/9.53 V value = e.getValue(); 24.26/9.53 sb.append(key == this ? "(this Map)" : key); 24.26/9.53 sb.append('='); 24.26/9.53 sb.append(value == this ? "(this Map)" : value); 24.26/9.53 if (! i.hasNext()) 24.26/9.53 return sb.append('}').toString(); 24.26/9.53 sb.append(", "); 24.26/9.53 } 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns a shallow copy of this AbstractMap instance: the keys 24.26/9.53 * and values themselves are not cloned. 24.26/9.53 * 24.26/9.53 * @return a shallow copy of this map 24.26/9.53 */ 24.26/9.53 protected Object clone() throws CloneNotSupportedException { 24.26/9.53 AbstractMap result = (AbstractMap)super.clone(); 24.26/9.53 result.keySet = null; 24.26/9.53 result.values = null; 24.26/9.53 return result; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Utility method for SimpleEntry and SimpleImmutableEntry. 24.26/9.53 * Test for equality, checking for nulls. 24.26/9.53 */ 24.26/9.53 private static boolean eq(Object o1, Object o2) { 24.26/9.53 return o1 == null ? o2 == null : o1.equals(o2); 24.26/9.53 } 24.26/9.53 24.26/9.53 // Implementation Note: SimpleEntry and SimpleImmutableEntry 24.26/9.53 // are distinct unrelated classes, even though they share 24.26/9.53 // some code. Since you can't add or subtract final-ness 24.26/9.53 // of a field in a subclass, they can't share representations, 24.26/9.53 // and the amount of duplicated code is too small to warrant 24.26/9.53 // exposing a common abstract class. 24.26/9.53 24.26/9.53 24.26/9.53 /** 24.26/9.53 * An Entry maintaining a key and a value. The value may be 24.26/9.53 * changed using the setValue method. This class 24.26/9.53 * facilitates the process of building custom map 24.26/9.53 * implementations. For example, it may be convenient to return 24.26/9.53 * arrays of SimpleEntry instances in method 24.26/9.53 * Map.entrySet().toArray. 24.26/9.53 * 24.26/9.53 * @since 1.6 24.26/9.53 */ 24.26/9.53 public static class SimpleEntry 24.26/9.53 implements Entry, java.io.Serializable 24.26/9.53 { 24.26/9.53 private static final long serialVersionUID = -8499721149061103585L; 24.26/9.53 24.26/9.53 private final K key; 24.26/9.53 private V value; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Creates an entry representing a mapping from the specified 24.26/9.53 * key to the specified value. 24.26/9.53 * 24.26/9.53 * @param key the key represented by this entry 24.26/9.53 * @param value the value represented by this entry 24.26/9.53 */ 24.26/9.53 public SimpleEntry(K key, V value) { 24.26/9.53 this.key = key; 24.26/9.53 this.value = value; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Creates an entry representing the same mapping as the 24.26/9.53 * specified entry. 24.26/9.53 * 24.26/9.53 * @param entry the entry to copy 24.26/9.53 */ 24.26/9.53 public SimpleEntry(Entry entry) { 24.26/9.53 this.key = entry.getKey(); 24.26/9.53 this.value = entry.getValue(); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the key corresponding to this entry. 24.26/9.53 * 24.26/9.53 * @return the key corresponding to this entry 24.26/9.53 */ 24.26/9.53 public K getKey() { 24.26/9.53 return key; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the value corresponding to this entry. 24.26/9.53 * 24.26/9.53 * @return the value corresponding to this entry 24.26/9.53 */ 24.26/9.53 public V getValue() { 24.26/9.53 return value; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Replaces the value corresponding to this entry with the specified 24.26/9.53 * value. 24.26/9.53 * 24.26/9.53 * @param value new value to be stored in this entry 24.26/9.53 * @return the old value corresponding to the entry 24.26/9.53 */ 24.26/9.53 public V setValue(V value) { 24.26/9.53 V oldValue = this.value; 24.26/9.53 this.value = value; 24.26/9.53 return oldValue; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Compares the specified object with this entry for equality. 24.26/9.53 * Returns {@code true} if the given object is also a map entry and 24.26/9.53 * the two entries represent the same mapping. More formally, two 24.26/9.53 * entries {@code e1} and {@code e2} represent the same mapping 24.26/9.53 * if

24.26/9.53	         *   (e1.getKey()==null ?
24.26/9.53	         *    e2.getKey()==null :
24.26/9.53	         *    e1.getKey().equals(e2.getKey()))
24.26/9.53	         *   &&
24.26/9.53	         *   (e1.getValue()==null ?
24.26/9.53	         *    e2.getValue()==null :
24.26/9.53	         *    e1.getValue().equals(e2.getValue()))
24.26/9.53 * This ensures that the {@code equals} method works properly across 24.26/9.53 * different implementations of the {@code Map.Entry} interface. 24.26/9.53 * 24.26/9.53 * @param o object to be compared for equality with this map entry 24.26/9.53 * @return {@code true} if the specified object is equal to this map 24.26/9.53 * entry 24.26/9.53 * @see #hashCode 24.26/9.53 */ 24.26/9.53 public boolean equals(Object o) { 24.26/9.53 if (!(o instanceof Map.Entry)) 24.26/9.53 return false; 24.26/9.53 Map.Entry e = (Map.Entry)o; 24.26/9.53 return eq(key, e.getKey()) && eq(value, e.getValue()); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the hash code value for this map entry. The hash code 24.26/9.53 * of a map entry {@code e} is defined to be: 
24.26/9.53	         *   (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.53	         *   (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.53 * This ensures that {@code e1.equals(e2)} implies that 24.26/9.53 * {@code e1.hashCode()==e2.hashCode()} for any two Entries 24.26/9.53 * {@code e1} and {@code e2}, as required by the general 24.26/9.53 * contract of {@link Object#hashCode}. 24.26/9.53 * 24.26/9.53 * @return the hash code value for this map entry 24.26/9.53 * @see #equals 24.26/9.53 */ 24.26/9.53 public int hashCode() { 24.26/9.53 return (key == null ? 0 : key.hashCode()) ^ 24.26/9.53 (value == null ? 0 : value.hashCode()); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns a String representation of this map entry. This 24.26/9.53 * implementation returns the string representation of this 24.26/9.53 * entry's key followed by the equals character ("=") 24.26/9.53 * followed by the string representation of this entry's value. 24.26/9.53 * 24.26/9.53 * @return a String representation of this map entry 24.26/9.53 */ 24.26/9.53 public String toString() { 24.26/9.53 return key + "=" + value; 24.26/9.53 } 24.26/9.53 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * An Entry maintaining an immutable key and value. This class 24.26/9.53 * does not support method setValue. This class may be 24.26/9.53 * convenient in methods that return thread-safe snapshots of 24.26/9.53 * key-value mappings. 24.26/9.53 * 24.26/9.53 * @since 1.6 24.26/9.53 */ 24.26/9.53 public static class SimpleImmutableEntry 24.26/9.53 implements Entry, java.io.Serializable 24.26/9.53 { 24.26/9.53 private static final long serialVersionUID = 7138329143949025153L; 24.26/9.53 24.26/9.53 private final K key; 24.26/9.53 private final V value; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Creates an entry representing a mapping from the specified 24.26/9.53 * key to the specified value. 24.26/9.53 * 24.26/9.53 * @param key the key represented by this entry 24.26/9.53 * @param value the value represented by this entry 24.26/9.53 */ 24.26/9.53 public SimpleImmutableEntry(K key, V value) { 24.26/9.53 this.key = key; 24.26/9.53 this.value = value; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Creates an entry representing the same mapping as the 24.26/9.53 * specified entry. 24.26/9.53 * 24.26/9.53 * @param entry the entry to copy 24.26/9.53 */ 24.26/9.53 public SimpleImmutableEntry(Entry entry) { 24.26/9.53 this.key = entry.getKey(); 24.26/9.53 this.value = entry.getValue(); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the key corresponding to this entry. 24.26/9.53 * 24.26/9.53 * @return the key corresponding to this entry 24.26/9.53 */ 24.26/9.53 public K getKey() { 24.26/9.53 return key; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the value corresponding to this entry. 24.26/9.53 * 24.26/9.53 * @return the value corresponding to this entry 24.26/9.53 */ 24.26/9.53 public V getValue() { 24.26/9.53 return value; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Replaces the value corresponding to this entry with the specified 24.26/9.53 * value (optional operation). This implementation simply throws 24.26/9.53 * UnsupportedOperationException, as this class implements 24.26/9.53 * an immutable map entry. 24.26/9.53 * 24.26/9.53 * @param value new value to be stored in this entry 24.26/9.53 * @return (Does not return) 24.26/9.53 * @throws UnsupportedOperationException always 24.26/9.53 */ 24.26/9.53 public V setValue(V value) { 24.26/9.53 throw new UnsupportedOperationException(); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Compares the specified object with this entry for equality. 24.26/9.53 * Returns {@code true} if the given object is also a map entry and 24.26/9.53 * the two entries represent the same mapping. More formally, two 24.26/9.53 * entries {@code e1} and {@code e2} represent the same mapping 24.26/9.53 * if
24.26/9.53	         *   (e1.getKey()==null ?
24.26/9.53	         *    e2.getKey()==null :
24.26/9.53	         *    e1.getKey().equals(e2.getKey()))
24.26/9.53	         *   &&
24.26/9.53	         *   (e1.getValue()==null ?
24.26/9.53	         *    e2.getValue()==null :
24.26/9.53	         *    e1.getValue().equals(e2.getValue()))
24.26/9.53 * This ensures that the {@code equals} method works properly across 24.26/9.53 * different implementations of the {@code Map.Entry} interface. 24.26/9.53 * 24.26/9.53 * @param o object to be compared for equality with this map entry 24.26/9.53 * @return {@code true} if the specified object is equal to this map 24.26/9.53 * entry 24.26/9.53 * @see #hashCode 24.26/9.53 */ 24.26/9.53 public boolean equals(Object o) { 24.26/9.53 if (!(o instanceof Map.Entry)) 24.26/9.53 return false; 24.26/9.53 Map.Entry e = (Map.Entry)o; 24.26/9.53 return eq(key, e.getKey()) && eq(value, e.getValue()); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the hash code value for this map entry. The hash code 24.26/9.53 * of a map entry {@code e} is defined to be: 
24.26/9.53	         *   (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.53	         *   (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.53 * This ensures that {@code e1.equals(e2)} implies that 24.26/9.53 * {@code e1.hashCode()==e2.hashCode()} for any two Entries 24.26/9.53 * {@code e1} and {@code e2}, as required by the general 24.26/9.53 * contract of {@link Object#hashCode}. 24.26/9.53 * 24.26/9.53 * @return the hash code value for this map entry 24.26/9.53 * @see #equals 24.26/9.53 */ 24.26/9.53 public int hashCode() { 24.26/9.53 return (key == null ? 0 : key.hashCode()) ^ 24.26/9.53 (value == null ? 0 : value.hashCode()); 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns a String representation of this map entry. This 24.26/9.53 * implementation returns the string representation of this 24.26/9.53 * entry's key followed by the equals character ("=") 24.26/9.53 * followed by the string representation of this entry's value. 24.26/9.53 * 24.26/9.53 * @return a String representation of this map entry 24.26/9.53 */ 24.26/9.53 public String toString() { 24.26/9.53 return key + "=" + value; 24.26/9.53 } 24.26/9.53 24.26/9.53 } 24.26/9.53 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 /* 24.26/9.53 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.53 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.53 * 24.26/9.53 * This code is free software; you can redistribute it and/or modify it 24.26/9.53 * under the terms of the GNU General Public License version 2 only, as 24.26/9.53 * published by the Free Software Foundation. Sun designates this 24.26/9.53 * particular file as subject to the "Classpath" exception as provided 24.26/9.53 * by Sun in the LICENSE file that accompanied this code. 24.26/9.53 * 24.26/9.53 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.53 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.53 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.53 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.53 * accompanied this code). 24.26/9.53 * 24.26/9.53 * You should have received a copy of the GNU General Public License version 24.26/9.53 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.53 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.53 * 24.26/9.53 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.53 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.53 * have any questions. 24.26/9.53 */ 24.26/9.53 24.26/9.53 package javaUtilEx; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * This class provides a skeletal implementation of the Set 24.26/9.53 * interface to minimize the effort required to implement this 24.26/9.53 * interface.

24.26/9.53 * 24.26/9.53 * The process of implementing a set by extending this class is identical 24.26/9.53 * to that of implementing a Collection by extending AbstractCollection, 24.26/9.53 * except that all of the methods and constructors in subclasses of this 24.26/9.53 * class must obey the additional constraints imposed by the Set 24.26/9.53 * interface (for instance, the add method must not permit addition of 24.26/9.53 * multiple instances of an object to a set).

24.26/9.53 * 24.26/9.53 * Note that this class does not override any of the implementations from 24.26/9.53 * the AbstractCollection class. It merely adds implementations 24.26/9.53 * for equals and hashCode.

24.26/9.53 * 24.26/9.53 * This class is a member of the 24.26/9.53 * 24.26/9.53 * Java Collections Framework. 24.26/9.53 * 24.26/9.53 * @param the type of elements maintained by this set 24.26/9.53 * 24.26/9.53 * @author Josh Bloch 24.26/9.53 * @author Neal Gafter 24.26/9.53 * @see Collection 24.26/9.53 * @see AbstractCollection 24.26/9.53 * @see Set 24.26/9.53 * @since 1.2 24.26/9.53 */ 24.26/9.53 24.26/9.53 public abstract class AbstractSet extends AbstractCollection implements Set { 24.26/9.53 /** 24.26/9.53 * Sole constructor. (For invocation by subclass constructors, typically 24.26/9.53 * implicit.) 24.26/9.53 */ 24.26/9.53 protected AbstractSet() { 24.26/9.53 } 24.26/9.53 24.26/9.53 // Comparison and hashing 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Compares the specified object with this set for equality. Returns 24.26/9.53 * true if the given object is also a set, the two sets have 24.26/9.53 * the same size, and every member of the given set is contained in 24.26/9.53 * this set. This ensures that the equals method works 24.26/9.53 * properly across different implementations of the Set 24.26/9.53 * interface.

24.26/9.53 * 24.26/9.53 * This implementation first checks if the specified object is this 24.26/9.53 * set; if so it returns true. Then, it checks if the 24.26/9.53 * specified object is a set whose size is identical to the size of 24.26/9.53 * this set; if not, it returns false. If so, it returns 24.26/9.53 * containsAll((Collection) o). 24.26/9.53 * 24.26/9.53 * @param o object to be compared for equality with this set 24.26/9.53 * @return true if the specified object is equal to this set 24.26/9.53 */ 24.26/9.53 public boolean equals(Object o) { 24.26/9.53 if (o == this) 24.26/9.53 return true; 24.26/9.53 24.26/9.53 if (!(o instanceof Set)) 24.26/9.53 return false; 24.26/9.53 Collection c = (Collection) o; 24.26/9.53 if (c.size() != size()) 24.26/9.53 return false; 24.26/9.53 try { 24.26/9.53 return containsAll(c); 24.26/9.53 } catch (ClassCastException unused) { 24.26/9.53 return false; 24.26/9.53 } catch (NullPointerException unused) { 24.26/9.53 return false; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Returns the hash code value for this set. The hash code of a set is 24.26/9.53 * defined to be the sum of the hash codes of the elements in the set, 24.26/9.53 * where the hash code of a null element is defined to be zero. 24.26/9.53 * This ensures that s1.equals(s2) implies that 24.26/9.53 * s1.hashCode()==s2.hashCode() for any two sets s1 24.26/9.53 * and s2, as required by the general contract of 24.26/9.53 * {@link Object#hashCode}. 24.26/9.53 * 24.26/9.53 *

This implementation iterates over the set, calling the 24.26/9.53 * hashCode method on each element in the set, and adding up 24.26/9.53 * the results. 24.26/9.53 * 24.26/9.53 * @return the hash code value for this set 24.26/9.53 * @see Object#equals(Object) 24.26/9.53 * @see Set#equals(Object) 24.26/9.53 */ 24.26/9.53 public int hashCode() { 24.26/9.53 int h = 0; 24.26/9.53 Iterator i = iterator(); 24.26/9.53 while (i.hasNext()) { 24.26/9.53 E obj = i.next(); 24.26/9.53 if (obj != null) 24.26/9.53 h += obj.hashCode(); 24.26/9.53 } 24.26/9.53 return h; 24.26/9.53 } 24.26/9.53 24.26/9.53 /** 24.26/9.53 * Removes from this set all of its elements that are contained in the 24.26/9.53 * specified collection (optional operation). If the specified 24.26/9.53 * collection is also a set, this operation effectively modifies this 24.26/9.53 * set so that its value is the asymmetric set difference of 24.26/9.53 * the two sets. 24.26/9.53 * 24.26/9.53 *

This implementation determines which is the smaller of this set 24.26/9.53 * and the specified collection, by invoking the size 24.26/9.53 * method on each. If this set has fewer elements, then the 24.26/9.53 * implementation iterates over this set, checking each element 24.26/9.53 * returned by the iterator in turn to see if it is contained in 24.26/9.53 * the specified collection. If it is so contained, it is removed 24.26/9.53 * from this set with the iterator's remove method. If 24.26/9.53 * the specified collection has fewer elements, then the 24.26/9.53 * implementation iterates over the specified collection, removing 24.26/9.53 * from this set each element returned by the iterator, using this 24.26/9.53 * set's remove method. 24.26/9.53 * 24.26/9.53 *

Note that this implementation will throw an 24.26/9.53 * UnsupportedOperationException if the iterator returned by the 24.26/9.53 * iterator method does not implement the remove method. 24.26/9.53 * 24.26/9.53 * @param c collection containing elements to be removed from this set 24.26/9.53 * @return true if this set changed as a result of the call 24.26/9.53 * @throws UnsupportedOperationException if the removeAll operation 24.26/9.53 * is not supported by this set 24.26/9.53 * @throws ClassCastException if the class of an element of this set 24.26/9.53 * is incompatible with the specified collection (optional) 24.26/9.53 * @throws NullPointerException if this set contains a null element and the 24.26/9.53 * specified collection does not permit null elements (optional), 24.26/9.53 * or if the specified collection is null 24.26/9.53 * @see #remove(Object) 24.26/9.53 * @see #contains(Object) 24.26/9.53 */ 24.26/9.53 public boolean removeAll(Collection c) { 24.26/9.53 boolean modified = false; 24.26/9.53 24.26/9.53 if (size() > c.size()) { 24.26/9.53 for (Iterator i = c.iterator(); i.hasNext(); ) 24.26/9.53 modified |= remove(i.next()); 24.26/9.53 } else { 24.26/9.53 for (Iterator i = iterator(); i.hasNext(); ) { 24.26/9.53 if (c.contains(i.next())) { 24.26/9.53 i.remove(); 24.26/9.53 modified = true; 24.26/9.53 } 24.26/9.53 } 24.26/9.53 } 24.26/9.53 return modified; 24.26/9.53 } 24.26/9.53 24.26/9.53 } 24.26/9.53 24.26/9.53 24.26/9.53 /* 24.26/9.53 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.53 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.53 * 24.26/9.53 * This code is free software; you can redistribute it and/or modify it 24.26/9.53 * under the terms of the GNU General Public License version 2 only, as 24.26/9.53 * published by the Free Software Foundation. Sun designates this 24.26/9.53 * particular file as subject to the "Classpath" exception as provided 24.26/9.53 * by Sun in the LICENSE file that accompanied this code. 24.26/9.53 * 24.26/9.53 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.53 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.53 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.53 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.53 * accompanied this code). 24.26/9.53 * 24.26/9.53 * You should have received a copy of the GNU General Public License version 24.26/9.53 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.53 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.53 * 24.26/9.53 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.53 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.53 * have any questions. 24.26/9.53 */ 24.26/9.53 24.26/9.53 package javaUtilEx; 24.26/9.53 24.26/9.53 /** 24.26/9.53 * The root interface in the collection hierarchy. A collection 24.26/9.53 * represents a group of objects, known as its elements. Some 24.26/9.53 * collections allow duplicate elements and others do not. Some are ordered 24.26/9.53 * and others unordered. The JDK does not provide any direct 24.26/9.53 * implementations of this interface: it provides implementations of more 24.26/9.53 * specific subinterfaces like Set and List. This interface 24.26/9.53 * is typically used to pass collections around and manipulate them where 24.26/9.53 * maximum generality is desired. 24.26/9.53 * 24.26/9.53 *

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

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

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

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

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

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

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

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

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

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

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

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

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

Note that fail-fast behavior cannot be guaranteed as it is, generally 24.26/9.54 * speaking, impossible to make any hard guarantees in the presence of 24.26/9.54 * unsynchronized concurrent modification. Fail-fast operations 24.26/9.54 * throw ConcurrentModificationException on a best-effort basis. 24.26/9.54 * Therefore, it would be wrong to write a program that depended on this 24.26/9.54 * exception for its correctness: ConcurrentModificationException 24.26/9.54 * should be used only to detect bugs. 24.26/9.54 * 24.26/9.54 * @author Josh Bloch 24.26/9.54 * @see Collection 24.26/9.54 * @see Iterator 24.26/9.54 * @see ListIterator 24.26/9.54 * @see Vector 24.26/9.54 * @see LinkedList 24.26/9.54 * @see HashSet 24.26/9.54 * @see Hashtable 24.26/9.54 * @see TreeMap 24.26/9.54 * @see AbstractList 24.26/9.54 * @since 1.2 24.26/9.54 */ 24.26/9.54 public class ConcurrentModificationException extends RuntimeException { 24.26/9.54 /** 24.26/9.54 * Constructs a ConcurrentModificationException with no 24.26/9.54 * detail message. 24.26/9.54 */ 24.26/9.54 public ConcurrentModificationException() { 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs a ConcurrentModificationException with the 24.26/9.54 * specified detail message. 24.26/9.54 * 24.26/9.54 * @param message the detail message pertaining to this exception. 24.26/9.54 */ 24.26/9.54 public ConcurrentModificationException(String message) { 24.26/9.54 super(message); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.54 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.54 * 24.26/9.54 * This code is free software; you can redistribute it and/or modify it 24.26/9.54 * under the terms of the GNU General Public License version 2 only, as 24.26/9.54 * published by the Free Software Foundation. Sun designates this 24.26/9.54 * particular file as subject to the "Classpath" exception as provided 24.26/9.54 * by Sun in the LICENSE file that accompanied this code. 24.26/9.54 * 24.26/9.54 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.54 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.54 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.54 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.54 * accompanied this code). 24.26/9.54 * 24.26/9.54 * You should have received a copy of the GNU General Public License version 24.26/9.54 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.54 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.54 * 24.26/9.54 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.54 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.54 * have any questions. 24.26/9.54 */ 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Hash table based implementation of the Map interface. This 24.26/9.54 * implementation provides all of the optional map operations, and permits 24.26/9.54 * null values and the null key. (The HashMap 24.26/9.54 * class is roughly equivalent to Hashtable, except that it is 24.26/9.54 * unsynchronized and permits nulls.) This class makes no guarantees as to 24.26/9.54 * the order of the map; in particular, it does not guarantee that the order 24.26/9.54 * will remain constant over time. 24.26/9.54 * 24.26/9.54 *

This implementation provides constant-time performance for the basic 24.26/9.54 * operations (get and put), assuming the hash function 24.26/9.54 * disperses the elements properly among the buckets. Iteration over 24.26/9.54 * collection views requires time proportional to the "capacity" of the 24.26/9.54 * HashMap instance (the number of buckets) plus its size (the number 24.26/9.54 * of key-value mappings). Thus, it's very important not to set the initial 24.26/9.54 * capacity too high (or the load factor too low) if iteration performance is 24.26/9.54 * important. 24.26/9.54 * 24.26/9.54 *

An instance of HashMap has two parameters that affect its 24.26/9.54 * performance: initial capacity and load factor. The 24.26/9.54 * capacity is the number of buckets in the hash table, and the initial 24.26/9.54 * capacity is simply the capacity at the time the hash table is created. The 24.26/9.54 * load factor is a measure of how full the hash table is allowed to 24.26/9.54 * get before its capacity is automatically increased. When the number of 24.26/9.54 * entries in the hash table exceeds the product of the load factor and the 24.26/9.54 * current capacity, the hash table is rehashed (that is, internal data 24.26/9.54 * structures are rebuilt) so that the hash table has approximately twice the 24.26/9.54 * number of buckets. 24.26/9.54 * 24.26/9.54 *

As a general rule, the default load factor (.75) offers a good tradeoff 24.26/9.54 * between time and space costs. Higher values decrease the space overhead 24.26/9.54 * but increase the lookup cost (reflected in most of the operations of the 24.26/9.54 * HashMap class, including get and put). The 24.26/9.54 * expected number of entries in the map and its load factor should be taken 24.26/9.54 * into account when setting its initial capacity, so as to minimize the 24.26/9.54 * number of rehash operations. If the initial capacity is greater 24.26/9.54 * than the maximum number of entries divided by the load factor, no 24.26/9.54 * rehash operations will ever occur. 24.26/9.54 * 24.26/9.54 *

If many mappings are to be stored in a HashMap instance, 24.26/9.54 * creating it with a sufficiently large capacity will allow the mappings to 24.26/9.54 * be stored more efficiently than letting it perform automatic rehashing as 24.26/9.54 * needed to grow the table. 24.26/9.54 * 24.26/9.54 *

Note that this implementation is not synchronized. 24.26/9.54 * If multiple threads access a hash map concurrently, and at least one of 24.26/9.54 * the threads modifies the map structurally, it must be 24.26/9.54 * synchronized externally. (A structural modification is any operation 24.26/9.54 * that adds or deletes one or more mappings; merely changing the value 24.26/9.54 * associated with a key that an instance already contains is not a 24.26/9.54 * structural modification.) This is typically accomplished by 24.26/9.54 * synchronizing on some object that naturally encapsulates the map. 24.26/9.54 * 24.26/9.54 * If no such object exists, the map should be "wrapped" using the 24.26/9.54 * {@link Collections#synchronizedMap Collections.synchronizedMap} 24.26/9.54 * method. This is best done at creation time, to prevent accidental 24.26/9.54 * unsynchronized access to the map:

24.26/9.54	 *   Map m = Collections.synchronizedMap(new HashMap(...));
24.26/9.54 * 24.26/9.54 *

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

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

This class is a member of the 24.26/9.54 * 24.26/9.54 * Java Collections Framework. 24.26/9.54 * 24.26/9.54 * @param the type of keys maintained by this map 24.26/9.54 * @param the type of mapped values 24.26/9.54 * 24.26/9.54 * @author Doug Lea 24.26/9.54 * @author Josh Bloch 24.26/9.54 * @author Arthur van Hoff 24.26/9.54 * @author Neal Gafter 24.26/9.54 * @see Object#hashCode() 24.26/9.54 * @see Collection 24.26/9.54 * @see Map 24.26/9.54 * @see TreeMap 24.26/9.54 * @see Hashtable 24.26/9.54 * @since 1.2 24.26/9.54 */ 24.26/9.54 24.26/9.54 public class HashMap 24.26/9.54 extends AbstractMap 24.26/9.54 implements Map, Cloneable 24.26/9.54 { 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The default initial capacity - MUST be a power of two. 24.26/9.54 */ 24.26/9.54 static final int DEFAULT_INITIAL_CAPACITY = 16; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The maximum capacity, used if a higher value is implicitly specified 24.26/9.54 * by either of the constructors with arguments. 24.26/9.54 * MUST be a power of two <= 1<<30. 24.26/9.54 */ 24.26/9.54 static final int MAXIMUM_CAPACITY = 1 << 30; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The load factor used when none specified in constructor. 24.26/9.54 */ 24.26/9.54 static final float DEFAULT_LOAD_FACTOR = 0.75f; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The table, resized as necessary. Length MUST Always be a power of two. 24.26/9.54 */ 24.26/9.54 transient Entry[] table; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The number of key-value mappings contained in this map. 24.26/9.54 */ 24.26/9.54 transient int size; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The next size value at which to resize (capacity * load factor). 24.26/9.54 * @serial 24.26/9.54 */ 24.26/9.54 int threshold; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The load factor for the hash table. 24.26/9.54 * 24.26/9.54 * @serial 24.26/9.54 */ 24.26/9.54 final float loadFactor; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * The number of times this HashMap has been structurally modified 24.26/9.54 * Structural modifications are those that change the number of mappings in 24.26/9.54 * the HashMap or otherwise modify its internal structure (e.g., 24.26/9.54 * rehash). This field is used to make iterators on Collection-views of 24.26/9.54 * the HashMap fail-fast. (See ConcurrentModificationException). 24.26/9.54 */ 24.26/9.54 transient volatile int modCount; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs an empty HashMap with the specified initial 24.26/9.54 * capacity and load factor. 24.26/9.54 * 24.26/9.54 * @param initialCapacity the initial capacity 24.26/9.54 * @param loadFactor the load factor 24.26/9.54 * @throws IllegalArgumentException if the initial capacity is negative 24.26/9.54 * or the load factor is nonpositive 24.26/9.54 */ 24.26/9.54 public HashMap(int initialCapacity, float loadFactor) { 24.26/9.54 if (initialCapacity < 0) 24.26/9.54 throw new IllegalArgumentException("Illegal initial capacity: " + 24.26/9.54 initialCapacity); 24.26/9.54 if (initialCapacity > MAXIMUM_CAPACITY) 24.26/9.54 initialCapacity = MAXIMUM_CAPACITY; 24.26/9.54 if (loadFactor <= 0 || Float.isNaN(loadFactor)) 24.26/9.54 throw new IllegalArgumentException("Illegal load factor: " + 24.26/9.54 loadFactor); 24.26/9.54 24.26/9.54 // Find a power of 2 >= initialCapacity 24.26/9.54 int capacity = 1; 24.26/9.54 while (capacity < initialCapacity) 24.26/9.54 capacity <<= 1; 24.26/9.54 24.26/9.54 this.loadFactor = loadFactor; 24.26/9.54 threshold = (int)(capacity * loadFactor); 24.26/9.54 table = new Entry[capacity]; 24.26/9.54 init(); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs an empty HashMap with the specified initial 24.26/9.54 * capacity and the default load factor (0.75). 24.26/9.54 * 24.26/9.54 * @param initialCapacity the initial capacity. 24.26/9.54 * @throws IllegalArgumentException if the initial capacity is negative. 24.26/9.54 */ 24.26/9.54 public HashMap(int initialCapacity) { 24.26/9.54 this(initialCapacity, DEFAULT_LOAD_FACTOR); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs an empty HashMap with the default initial capacity 24.26/9.54 * (16) and the default load factor (0.75). 24.26/9.54 */ 24.26/9.54 public HashMap() { 24.26/9.54 this.loadFactor = DEFAULT_LOAD_FACTOR; 24.26/9.54 threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR); 24.26/9.54 table = new Entry[DEFAULT_INITIAL_CAPACITY]; 24.26/9.54 init(); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs a new HashMap with the same mappings as the 24.26/9.54 * specified Map. The HashMap is created with 24.26/9.54 * default load factor (0.75) and an initial capacity sufficient to 24.26/9.54 * hold the mappings in the specified Map. 24.26/9.54 * 24.26/9.54 * @param m the map whose mappings are to be placed in this map 24.26/9.54 * @throws NullPointerException if the specified map is null 24.26/9.54 */ 24.26/9.54 public HashMap(Map m) { 24.26/9.54 this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) + 1, 24.26/9.54 DEFAULT_INITIAL_CAPACITY), DEFAULT_LOAD_FACTOR); 24.26/9.54 putAllForCreate(m); 24.26/9.54 } 24.26/9.54 24.26/9.54 // internal utilities 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Initialization hook for subclasses. This method is called 24.26/9.54 * in all constructors and pseudo-constructors (clone, readObject) 24.26/9.54 * after HashMap has been initialized but before any entries have 24.26/9.54 * been inserted. (In the absence of this method, readObject would 24.26/9.54 * require explicit knowledge of subclasses.) 24.26/9.54 */ 24.26/9.54 void init() { 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Applies a supplemental hash function to a given hashCode, which 24.26/9.54 * defends against poor quality hash functions. This is critical 24.26/9.54 * because HashMap uses power-of-two length hash tables, that 24.26/9.54 * otherwise encounter collisions for hashCodes that do not differ 24.26/9.54 * in lower bits. Note: Null keys always map to hash 0, thus index 0. 24.26/9.54 */ 24.26/9.54 static int hash(int h) { 24.26/9.54 // This function ensures that hashCodes that differ only by 24.26/9.54 // constant multiples at each bit position have a bounded 24.26/9.54 // number of collisions (approximately 8 at default load factor). 24.26/9.54 h ^= (h >>> 20) ^ (h >>> 12); 24.26/9.54 return h ^ (h >>> 7) ^ (h >>> 4); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns index for hash code h. 24.26/9.54 */ 24.26/9.54 static int indexFor(int h, int length) { 24.26/9.54 return h & (length-1); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the number of key-value mappings in this map. 24.26/9.54 * 24.26/9.54 * @return the number of key-value mappings in this map 24.26/9.54 */ 24.26/9.54 public int size() { 24.26/9.54 return size; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map contains no key-value mappings. 24.26/9.54 * 24.26/9.54 * @return true if this map contains no key-value mappings 24.26/9.54 */ 24.26/9.54 public boolean isEmpty() { 24.26/9.54 return size == 0; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the value to which the specified key is mapped, 24.26/9.54 * or {@code null} if this map contains no mapping for the key. 24.26/9.54 * 24.26/9.54 *

More formally, if this map contains a mapping from a key 24.26/9.54 * {@code k} to a value {@code v} such that {@code (key==null ? k==null : 24.26/9.54 * key.equals(k))}, then this method returns {@code v}; otherwise 24.26/9.54 * it returns {@code null}. (There can be at most one such mapping.) 24.26/9.54 * 24.26/9.54 *

A return value of {@code null} does not necessarily 24.26/9.54 * indicate that the map contains no mapping for the key; it's also 24.26/9.54 * possible that the map explicitly maps the key to {@code null}. 24.26/9.54 * The {@link #containsKey containsKey} operation may be used to 24.26/9.54 * distinguish these two cases. 24.26/9.54 * 24.26/9.54 * @see #put(Object, Object) 24.26/9.54 */ 24.26/9.54 public V get(Object key) { 24.26/9.54 if (key == null) 24.26/9.54 return getForNullKey(); 24.26/9.54 int hash = hash(key.hashCode()); 24.26/9.54 for (Entry e = table[indexFor(hash, table.length)]; 24.26/9.54 e != null; 24.26/9.54 e = e.next) { 24.26/9.54 Object k; 24.26/9.54 if (e.hash == hash && ((k = e.key) == key || key.equals(k))) 24.26/9.54 return e.value; 24.26/9.54 } 24.26/9.54 return null; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Offloaded version of get() to look up null keys. Null keys map 24.26/9.54 * to index 0. This null case is split out into separate methods 24.26/9.54 * for the sake of performance in the two most commonly used 24.26/9.54 * operations (get and put), but incorporated with conditionals in 24.26/9.54 * others. 24.26/9.54 */ 24.26/9.54 private V getForNullKey() { 24.26/9.54 for (Entry e = table[0]; e != null; e = e.next) { 24.26/9.54 if (e.key == null) 24.26/9.54 return e.value; 24.26/9.54 } 24.26/9.54 return null; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map contains a mapping for the 24.26/9.54 * specified key. 24.26/9.54 * 24.26/9.54 * @param key The key whose presence in this map is to be tested 24.26/9.54 * @return true if this map contains a mapping for the specified 24.26/9.54 * key. 24.26/9.54 */ 24.26/9.54 public boolean containsKey(Object key) { 24.26/9.54 return getEntry(key) != null; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the entry associated with the specified key in the 24.26/9.54 * HashMap. Returns null if the HashMap contains no mapping 24.26/9.54 * for the key. 24.26/9.54 */ 24.26/9.54 final Entry getEntry(Object key) { 24.26/9.54 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.54 for (Entry e = table[indexFor(hash, table.length)]; 24.26/9.54 e != null; 24.26/9.54 e = e.next) { 24.26/9.54 Object k; 24.26/9.54 if (e.hash == hash && 24.26/9.54 ((k = e.key) == key || (key != null && key.equals(k)))) 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 return null; 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Associates the specified value with the specified key in this map. 24.26/9.54 * If the map previously contained a mapping for the key, the old 24.26/9.54 * value is replaced. 24.26/9.54 * 24.26/9.54 * @param key key with which the specified value is to be associated 24.26/9.54 * @param value value to be associated with the specified key 24.26/9.54 * @return the previous value associated with key, or 24.26/9.54 * null if there was no mapping for key. 24.26/9.54 * (A null return can also indicate that the map 24.26/9.54 * previously associated null with key.) 24.26/9.54 */ 24.26/9.54 public V put(K key, V value) { 24.26/9.54 if (key == null) 24.26/9.54 return putForNullKey(value); 24.26/9.54 int hash = hash(key.hashCode()); 24.26/9.54 int i = indexFor(hash, table.length); 24.26/9.54 for (Entry e = table[i]; e != null; e = e.next) { 24.26/9.54 Object k; 24.26/9.54 if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { 24.26/9.54 V oldValue = e.value; 24.26/9.54 e.value = value; 24.26/9.54 e.recordAccess(this); 24.26/9.54 return oldValue; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 modCount++; 24.26/9.54 addEntry(hash, key, value, i); 24.26/9.54 return null; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Offloaded version of put for null keys 24.26/9.54 */ 24.26/9.54 private V putForNullKey(V value) { 24.26/9.54 for (Entry e = table[0]; e != null; e = e.next) { 24.26/9.54 if (e.key == null) { 24.26/9.54 V oldValue = e.value; 24.26/9.54 e.value = value; 24.26/9.54 e.recordAccess(this); 24.26/9.54 return oldValue; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 modCount++; 24.26/9.54 addEntry(0, null, value, 0); 24.26/9.54 return null; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * This method is used instead of put by constructors and 24.26/9.54 * pseudoconstructors (clone, readObject). It does not resize the table, 24.26/9.54 * check for comodification, etc. It calls createEntry rather than 24.26/9.54 * addEntry. 24.26/9.54 */ 24.26/9.54 private void putForCreate(K key, V value) { 24.26/9.54 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.54 int i = indexFor(hash, table.length); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Look for preexisting entry for key. This will never happen for 24.26/9.54 * clone or deserialize. It will only happen for construction if the 24.26/9.54 * input Map is a sorted map whose ordering is inconsistent w/ equals. 24.26/9.54 */ 24.26/9.54 for (Entry e = table[i]; e != null; e = e.next) { 24.26/9.54 Object k; 24.26/9.54 if (e.hash == hash && 24.26/9.54 ((k = e.key) == key || (key != null && key.equals(k)))) { 24.26/9.54 e.value = value; 24.26/9.54 return; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 createEntry(hash, key, value, i); 24.26/9.54 } 24.26/9.54 24.26/9.54 private void putAllForCreate(Map m) { 24.26/9.54 for (Iterator> i = m.entrySet().iterator(); i.hasNext(); ) { 24.26/9.54 Map.Entry e = i.next(); 24.26/9.54 putForCreate(e.getKey(), e.getValue()); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Rehashes the contents of this map into a new array with a 24.26/9.54 * larger capacity. This method is called automatically when the 24.26/9.54 * number of keys in this map reaches its threshold. 24.26/9.54 * 24.26/9.54 * If current capacity is MAXIMUM_CAPACITY, this method does not 24.26/9.54 * resize the map, but sets threshold to Integer.MAX_VALUE. 24.26/9.54 * This has the effect of preventing future calls. 24.26/9.54 * 24.26/9.54 * @param newCapacity the new capacity, MUST be a power of two; 24.26/9.54 * must be greater than current capacity unless current 24.26/9.54 * capacity is MAXIMUM_CAPACITY (in which case value 24.26/9.54 * is irrelevant). 24.26/9.54 */ 24.26/9.54 void resize(int newCapacity) { 24.26/9.54 Entry[] oldTable = table; 24.26/9.54 int oldCapacity = oldTable.length; 24.26/9.54 if (oldCapacity == MAXIMUM_CAPACITY) { 24.26/9.54 threshold = Integer.MAX_VALUE; 24.26/9.54 return; 24.26/9.54 } 24.26/9.54 24.26/9.54 Entry[] newTable = new Entry[newCapacity]; 24.26/9.54 transfer(newTable); 24.26/9.54 table = newTable; 24.26/9.54 threshold = (int)(newCapacity * loadFactor); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Transfers all entries from current table to newTable. 24.26/9.54 */ 24.26/9.54 void transfer(Entry[] newTable) { 24.26/9.54 Entry[] src = table; 24.26/9.54 int newCapacity = newTable.length; 24.26/9.54 for (int j = 0; j < src.length; j++) { 24.26/9.54 Entry e = src[j]; 24.26/9.54 if (e != null) { 24.26/9.54 src[j] = null; 24.26/9.54 do { 24.26/9.54 Entry next = e.next; 24.26/9.54 int i = indexFor(e.hash, newCapacity); 24.26/9.54 e.next = newTable[i]; 24.26/9.54 newTable[i] = e; 24.26/9.54 e = next; 24.26/9.54 } while (e != null); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Copies all of the mappings from the specified map to this map. 24.26/9.54 * These mappings will replace any mappings that this map had for 24.26/9.54 * any of the keys currently in the specified map. 24.26/9.54 * 24.26/9.54 * @param m mappings to be stored in this map 24.26/9.54 * @throws NullPointerException if the specified map is null 24.26/9.54 */ 24.26/9.54 public void putAll(Map m) { 24.26/9.54 int numKeysToBeAdded = m.size(); 24.26/9.54 if (numKeysToBeAdded == 0) 24.26/9.54 return; 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Expand the map if the map if the number of mappings to be added 24.26/9.54 * is greater than or equal to threshold. This is conservative; the 24.26/9.54 * obvious condition is (m.size() + size) >= threshold, but this 24.26/9.54 * condition could result in a map with twice the appropriate capacity, 24.26/9.54 * if the keys to be added overlap with the keys already in this map. 24.26/9.54 * By using the conservative calculation, we subject ourself 24.26/9.54 * to at most one extra resize. 24.26/9.54 */ 24.26/9.54 if (numKeysToBeAdded > threshold) { 24.26/9.54 int targetCapacity = (int)(numKeysToBeAdded / loadFactor + 1); 24.26/9.54 if (targetCapacity > MAXIMUM_CAPACITY) 24.26/9.54 targetCapacity = MAXIMUM_CAPACITY; 24.26/9.54 int newCapacity = table.length; 24.26/9.54 while (newCapacity < targetCapacity) 24.26/9.54 newCapacity <<= 1; 24.26/9.54 if (newCapacity > table.length) 24.26/9.54 resize(newCapacity); 24.26/9.54 } 24.26/9.54 24.26/9.54 for (Iterator> i = m.entrySet().iterator(); i.hasNext(); ) { 24.26/9.54 Map.Entry e = i.next(); 24.26/9.54 put(e.getKey(), e.getValue()); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes the mapping for the specified key from this map if present. 24.26/9.54 * 24.26/9.54 * @param key key whose mapping is to be removed from the map 24.26/9.54 * @return the previous value associated with key, or 24.26/9.54 * null if there was no mapping for key. 24.26/9.54 * (A null return can also indicate that the map 24.26/9.54 * previously associated null with key.) 24.26/9.54 */ 24.26/9.54 public V remove(Object key) { 24.26/9.54 Entry e = removeEntryForKey(key); 24.26/9.54 return (e == null ? null : e.value); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes and returns the entry associated with the specified key 24.26/9.54 * in the HashMap. Returns null if the HashMap contains no mapping 24.26/9.54 * for this key. 24.26/9.54 */ 24.26/9.54 final Entry removeEntryForKey(Object key) { 24.26/9.54 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.54 int i = indexFor(hash, table.length); 24.26/9.54 Entry prev = table[i]; 24.26/9.54 Entry e = prev; 24.26/9.54 24.26/9.54 while (e != null) { 24.26/9.54 Entry next = e.next; 24.26/9.54 Object k; 24.26/9.54 if (e.hash == hash && 24.26/9.54 ((k = e.key) == key || (key != null && key.equals(k)))) { 24.26/9.54 modCount++; 24.26/9.54 size--; 24.26/9.54 if (prev == e) 24.26/9.54 table[i] = next; 24.26/9.54 else 24.26/9.54 prev.next = next; 24.26/9.54 e.recordRemoval(this); 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 prev = e; 24.26/9.54 e = next; 24.26/9.54 } 24.26/9.54 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Special version of remove for EntrySet. 24.26/9.54 */ 24.26/9.54 final Entry removeMapping(Object o) { 24.26/9.54 if (!(o instanceof Map.Entry)) 24.26/9.54 return null; 24.26/9.54 24.26/9.54 Map.Entry entry = (Map.Entry) o; 24.26/9.54 Object key = entry.getKey(); 24.26/9.54 int hash = (key == null) ? 0 : hash(key.hashCode()); 24.26/9.54 int i = indexFor(hash, table.length); 24.26/9.54 Entry prev = table[i]; 24.26/9.54 Entry e = prev; 24.26/9.54 24.26/9.54 while (e != null) { 24.26/9.54 Entry next = e.next; 24.26/9.54 if (e.hash == hash && e.equals(entry)) { 24.26/9.54 modCount++; 24.26/9.54 size--; 24.26/9.54 if (prev == e) 24.26/9.54 table[i] = next; 24.26/9.54 else 24.26/9.54 prev.next = next; 24.26/9.54 e.recordRemoval(this); 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 prev = e; 24.26/9.54 e = next; 24.26/9.54 } 24.26/9.54 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes all of the mappings from this map. 24.26/9.54 * The map will be empty after this call returns. 24.26/9.54 */ 24.26/9.54 public void clear() { 24.26/9.54 modCount++; 24.26/9.54 Entry[] tab = table; 24.26/9.54 for (int i = 0; i < tab.length; i++) 24.26/9.54 tab[i] = null; 24.26/9.54 size = 0; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map maps one or more keys to the 24.26/9.54 * specified value. 24.26/9.54 * 24.26/9.54 * @param value value whose presence in this map is to be tested 24.26/9.54 * @return true if this map maps one or more keys to the 24.26/9.54 * specified value 24.26/9.54 */ 24.26/9.54 public boolean containsValue(Object value) { 24.26/9.54 if (value == null) 24.26/9.54 return containsNullValue(); 24.26/9.54 24.26/9.54 Entry[] tab = table; 24.26/9.54 for (int i = 0; i < tab.length ; i++) 24.26/9.54 for (Entry e = tab[i] ; e != null ; e = e.next) 24.26/9.54 if (value.equals(e.value)) 24.26/9.54 return true; 24.26/9.54 return false; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Special-case code for containsValue with null argument 24.26/9.54 */ 24.26/9.54 private boolean containsNullValue() { 24.26/9.54 Entry[] tab = table; 24.26/9.54 for (int i = 0; i < tab.length ; i++) 24.26/9.54 for (Entry e = tab[i] ; e != null ; e = e.next) 24.26/9.54 if (e.value == null) 24.26/9.54 return true; 24.26/9.54 return false; 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a shallow copy of this HashMap instance: the keys and 24.26/9.54 * values themselves are not cloned. 24.26/9.54 * 24.26/9.54 * @return a shallow copy of this map 24.26/9.54 */ 24.26/9.54 public Object clone() { 24.26/9.54 HashMap result = null; 24.26/9.54 try { 24.26/9.54 result = (HashMap)super.clone(); 24.26/9.54 } catch (CloneNotSupportedException e) { 24.26/9.54 // assert false; 24.26/9.54 } 24.26/9.54 result.table = new Entry[table.length]; 24.26/9.54 result.entrySet = null; 24.26/9.54 result.modCount = 0; 24.26/9.54 result.size = 0; 24.26/9.54 result.init(); 24.26/9.54 result.putAllForCreate(this); 24.26/9.54 24.26/9.54 return result; 24.26/9.54 } 24.26/9.54 24.26/9.54 static class Entry implements Map.Entry { 24.26/9.54 final K key; 24.26/9.54 V value; 24.26/9.54 Entry next; 24.26/9.54 final int hash; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Creates new entry. 24.26/9.54 */ 24.26/9.54 Entry(int h, K k, V v, Entry n) { 24.26/9.54 value = v; 24.26/9.54 next = n; 24.26/9.54 key = k; 24.26/9.54 hash = h; 24.26/9.54 } 24.26/9.54 24.26/9.54 public final K getKey() { 24.26/9.54 return key; 24.26/9.54 } 24.26/9.54 24.26/9.54 public final V getValue() { 24.26/9.54 return value; 24.26/9.54 } 24.26/9.54 24.26/9.54 public final V setValue(V newValue) { 24.26/9.54 V oldValue = value; 24.26/9.54 value = newValue; 24.26/9.54 return oldValue; 24.26/9.54 } 24.26/9.54 24.26/9.54 public final boolean equals(Object o) { 24.26/9.54 if (!(o instanceof Map.Entry)) 24.26/9.54 return false; 24.26/9.54 Map.Entry e = (Map.Entry)o; 24.26/9.54 Object k1 = getKey(); 24.26/9.54 Object k2 = e.getKey(); 24.26/9.54 if (k1 == k2 || (k1 != null && k1.equals(k2))) { 24.26/9.54 Object v1 = getValue(); 24.26/9.54 Object v2 = e.getValue(); 24.26/9.54 if (v1 == v2 || (v1 != null && v1.equals(v2))) 24.26/9.54 return true; 24.26/9.54 } 24.26/9.54 return false; 24.26/9.54 } 24.26/9.54 24.26/9.54 public final int hashCode() { 24.26/9.54 return (key==null ? 0 : key.hashCode()) ^ 24.26/9.54 (value==null ? 0 : value.hashCode()); 24.26/9.54 } 24.26/9.54 24.26/9.54 public final String toString() { 24.26/9.54 return getKey() + "=" + getValue(); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * This method is invoked whenever the value in an entry is 24.26/9.54 * overwritten by an invocation of put(k,v) for a key k that's already 24.26/9.54 * in the HashMap. 24.26/9.54 */ 24.26/9.54 void recordAccess(HashMap m) { 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * This method is invoked whenever the entry is 24.26/9.54 * removed from the table. 24.26/9.54 */ 24.26/9.54 void recordRemoval(HashMap m) { 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Adds a new entry with the specified key, value and hash code to 24.26/9.54 * the specified bucket. It is the responsibility of this 24.26/9.54 * method to resize the table if appropriate. 24.26/9.54 * 24.26/9.54 * Subclass overrides this to alter the behavior of put method. 24.26/9.54 */ 24.26/9.54 void addEntry(int hash, K key, V value, int bucketIndex) { 24.26/9.54 Entry e = table[bucketIndex]; 24.26/9.54 table[bucketIndex] = new Entry(hash, key, value, e); 24.26/9.54 if (size++ >= threshold) 24.26/9.54 resize(2 * table.length); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Like addEntry except that this version is used when creating entries 24.26/9.54 * as part of Map construction or "pseudo-construction" (cloning, 24.26/9.54 * deserialization). This version needn't worry about resizing the table. 24.26/9.54 * 24.26/9.54 * Subclass overrides this to alter the behavior of HashMap(Map), 24.26/9.54 * clone, and readObject. 24.26/9.54 */ 24.26/9.54 void createEntry(int hash, K key, V value, int bucketIndex) { 24.26/9.54 Entry e = table[bucketIndex]; 24.26/9.54 table[bucketIndex] = new Entry(hash, key, value, e); 24.26/9.54 size++; 24.26/9.54 } 24.26/9.54 24.26/9.54 private abstract class HashIterator implements Iterator { 24.26/9.54 Entry next; // next entry to return 24.26/9.54 int expectedModCount; // For fast-fail 24.26/9.54 int index; // current slot 24.26/9.54 Entry current; // current entry 24.26/9.54 24.26/9.54 HashIterator() { 24.26/9.54 expectedModCount = modCount; 24.26/9.54 if (size > 0) { // advance to first entry 24.26/9.54 Entry[] t = table; 24.26/9.54 while (index < t.length && (next = t[index++]) == null) 24.26/9.54 ; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 public final boolean hasNext() { 24.26/9.54 return next != null; 24.26/9.54 } 24.26/9.54 24.26/9.54 final Entry nextEntry() { 24.26/9.54 if (modCount != expectedModCount) 24.26/9.54 throw new ConcurrentModificationException(); 24.26/9.54 Entry e = next; 24.26/9.54 if (e == null) 24.26/9.54 throw new NoSuchElementException(); 24.26/9.54 24.26/9.54 if ((next = e.next) == null) { 24.26/9.54 Entry[] t = table; 24.26/9.54 while (index < t.length && (next = t[index++]) == null) 24.26/9.54 ; 24.26/9.54 } 24.26/9.54 current = e; 24.26/9.54 return e; 24.26/9.54 } 24.26/9.54 24.26/9.54 public void remove() { 24.26/9.54 if (current == null) 24.26/9.54 throw new IllegalStateException(); 24.26/9.54 if (modCount != expectedModCount) 24.26/9.54 throw new ConcurrentModificationException(); 24.26/9.54 Object k = current.key; 24.26/9.54 current = null; 24.26/9.54 HashMap.this.removeEntryForKey(k); 24.26/9.54 expectedModCount = modCount; 24.26/9.54 } 24.26/9.54 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class ValueIterator extends HashIterator { 24.26/9.54 public V next() { 24.26/9.54 return nextEntry().value; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class KeyIterator extends HashIterator { 24.26/9.54 public K next() { 24.26/9.54 return nextEntry().getKey(); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class EntryIterator extends HashIterator> { 24.26/9.54 public Map.Entry next() { 24.26/9.54 return nextEntry(); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 // Subclass overrides these to alter behavior of views' iterator() method 24.26/9.54 Iterator newKeyIterator() { 24.26/9.54 return new KeyIterator(); 24.26/9.54 } 24.26/9.54 Iterator newValueIterator() { 24.26/9.54 return new ValueIterator(); 24.26/9.54 } 24.26/9.54 Iterator> newEntryIterator() { 24.26/9.54 return new EntryIterator(); 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 // Views 24.26/9.54 24.26/9.54 private transient Set> entrySet = null; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Set} view of the keys contained in this map. 24.26/9.54 * The set is backed by the map, so changes to the map are 24.26/9.54 * reflected in the set, and vice-versa. If the map is modified 24.26/9.54 * while an iteration over the set is in progress (except through 24.26/9.54 * the iterator's own remove operation), the results of 24.26/9.54 * the iteration are undefined. The set supports element removal, 24.26/9.54 * which removes the corresponding mapping from the map, via the 24.26/9.54 * Iterator.remove, Set.remove, 24.26/9.54 * removeAll, retainAll, and clear 24.26/9.54 * operations. It does not support the add or addAll 24.26/9.54 * operations. 24.26/9.54 */ 24.26/9.54 public Set keySet() { 24.26/9.54 Set ks = keySet; 24.26/9.54 return (ks != null ? ks : (keySet = new KeySet())); 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class KeySet extends AbstractSet { 24.26/9.54 public Iterator iterator() { 24.26/9.54 return newKeyIterator(); 24.26/9.54 } 24.26/9.54 public int size() { 24.26/9.54 return size; 24.26/9.54 } 24.26/9.54 public boolean contains(Object o) { 24.26/9.54 return containsKey(o); 24.26/9.54 } 24.26/9.54 public boolean remove(Object o) { 24.26/9.54 return HashMap.this.removeEntryForKey(o) != null; 24.26/9.54 } 24.26/9.54 public void clear() { 24.26/9.54 HashMap.this.clear(); 24.26/9.54 } 24.26/9.54 public Object[] toArray() { 24.26/9.54 Object[] res = new Object[size]; 24.26/9.54 Iterator it = iterator(); 24.26/9.54 int i = 0; 24.26/9.54 while (it.hasNext()) 24.26/9.54 res[i++] = it.next(); 24.26/9.54 return res; 24.26/9.54 } 24.26/9.54 public T[] toArray(T[] a) { 24.26/9.54 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.54 a.getClass().getComponentType(), size); 24.26/9.54 Object[] res = a; 24.26/9.54 Iterator it = iterator(); 24.26/9.54 int i = 0; 24.26/9.54 while (it.hasNext()) 24.26/9.54 res[i++] = it.next(); 24.26/9.54 return a; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Collection} view of the values contained in this map. 24.26/9.54 * The collection is backed by the map, so changes to the map are 24.26/9.54 * reflected in the collection, and vice-versa. If the map is 24.26/9.54 * modified while an iteration over the collection is in progress 24.26/9.54 * (except through the iterator's own remove operation), 24.26/9.54 * the results of the iteration are undefined. The collection 24.26/9.54 * supports element removal, which removes the corresponding 24.26/9.54 * mapping from the map, via the Iterator.remove, 24.26/9.54 * Collection.remove, removeAll, 24.26/9.54 * retainAll and clear operations. It does not 24.26/9.54 * support the add or addAll operations. 24.26/9.54 */ 24.26/9.54 public Collection values() { 24.26/9.54 Collection vs = values; 24.26/9.54 return (vs != null ? vs : (values = new Values())); 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class Values extends AbstractCollection { 24.26/9.54 public Iterator iterator() { 24.26/9.54 return newValueIterator(); 24.26/9.54 } 24.26/9.54 public int size() { 24.26/9.54 return size; 24.26/9.54 } 24.26/9.54 public boolean contains(Object o) { 24.26/9.54 return containsValue(o); 24.26/9.54 } 24.26/9.54 public void clear() { 24.26/9.54 HashMap.this.clear(); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Set} view of the mappings contained in this map. 24.26/9.54 * The set is backed by the map, so changes to the map are 24.26/9.54 * reflected in the set, and vice-versa. If the map is modified 24.26/9.54 * while an iteration over the set is in progress (except through 24.26/9.54 * the iterator's own remove operation, or through the 24.26/9.54 * setValue operation on a map entry returned by the 24.26/9.54 * iterator) the results of the iteration are undefined. The set 24.26/9.54 * supports element removal, which removes the corresponding 24.26/9.54 * mapping from the map, via the Iterator.remove, 24.26/9.54 * Set.remove, removeAll, retainAll and 24.26/9.54 * clear operations. It does not support the 24.26/9.54 * add or addAll operations. 24.26/9.54 * 24.26/9.54 * @return a set view of the mappings contained in this map 24.26/9.54 */ 24.26/9.54 public Set> entrySet() { 24.26/9.54 return entrySet0(); 24.26/9.54 } 24.26/9.54 24.26/9.54 private Set> entrySet0() { 24.26/9.54 Set> es = entrySet; 24.26/9.54 return es != null ? es : (entrySet = new EntrySet()); 24.26/9.54 } 24.26/9.54 24.26/9.54 private final class EntrySet extends AbstractSet> { 24.26/9.54 public Iterator> iterator() { 24.26/9.54 return newEntryIterator(); 24.26/9.54 } 24.26/9.54 public boolean contains(Object o) { 24.26/9.54 if (!(o instanceof Map.Entry)) 24.26/9.54 return false; 24.26/9.54 Map.Entry e = (Map.Entry) o; 24.26/9.54 Entry candidate = getEntry(e.getKey()); 24.26/9.54 return candidate != null && candidate.equals(e); 24.26/9.54 } 24.26/9.54 public boolean remove(Object o) { 24.26/9.54 return removeMapping(o) != null; 24.26/9.54 } 24.26/9.54 public int size() { 24.26/9.54 return size; 24.26/9.54 } 24.26/9.54 public void clear() { 24.26/9.54 HashMap.this.clear(); 24.26/9.54 } 24.26/9.54 public Object[] toArray() { 24.26/9.54 Object[] res = new Object[size]; 24.26/9.54 Iterator> it = iterator(); 24.26/9.54 int i = 0; 24.26/9.54 while (it.hasNext()) 24.26/9.54 res[i++] = it.next(); 24.26/9.54 return res; 24.26/9.54 } 24.26/9.54 public T[] toArray(T[] a) { 24.26/9.54 a = (T[])java.lang.reflect.Array.newInstance( 24.26/9.54 a.getClass().getComponentType(), size); 24.26/9.54 Object[] res = a; 24.26/9.54 Iterator> it = iterator(); 24.26/9.54 int i = 0; 24.26/9.54 while (it.hasNext()) 24.26/9.54 res[i++] = it.next(); 24.26/9.54 return a; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 private static final long serialVersionUID = 362498820763181265L; 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Copyright 1994-2003 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.54 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.54 * 24.26/9.54 * This code is free software; you can redistribute it and/or modify it 24.26/9.54 * under the terms of the GNU General Public License version 2 only, as 24.26/9.54 * published by the Free Software Foundation. Sun designates this 24.26/9.54 * particular file as subject to the "Classpath" exception as provided 24.26/9.54 * by Sun in the LICENSE file that accompanied this code. 24.26/9.54 * 24.26/9.54 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.54 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.54 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.54 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.54 * accompanied this code). 24.26/9.54 * 24.26/9.54 * You should have received a copy of the GNU General Public License version 24.26/9.54 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.54 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.54 * 24.26/9.54 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.54 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.54 * have any questions. 24.26/9.54 */ 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Thrown to indicate that a method has been passed an illegal or 24.26/9.54 * inappropriate argument. 24.26/9.54 * 24.26/9.54 * @author unascribed 24.26/9.54 * @see java.lang.Thread#setPriority(int) 24.26/9.54 * @since JDK1.0 24.26/9.54 */ 24.26/9.54 public 24.26/9.54 class IllegalArgumentException extends RuntimeException { 24.26/9.54 /** 24.26/9.54 * Constructs an IllegalArgumentException with no 24.26/9.54 * detail message. 24.26/9.54 */ 24.26/9.54 public IllegalArgumentException() { 24.26/9.54 super(); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs an IllegalArgumentException with the 24.26/9.54 * specified detail message. 24.26/9.54 * 24.26/9.54 * @param s the detail message. 24.26/9.54 */ 24.26/9.54 public IllegalArgumentException(String s) { 24.26/9.54 super(s); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs a new exception with the specified detail message and 24.26/9.54 * cause. 24.26/9.54 * 24.26/9.54 *

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

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

    24.26/9.54 *
  • Iterators allow the caller to remove elements from the 24.26/9.54 * underlying collection during the iteration with well-defined 24.26/9.54 * semantics. 24.26/9.54 *
  • Method names have been improved. 24.26/9.54 *
24.26/9.54 * 24.26/9.54 *

This interface is a member of the 24.26/9.54 * 24.26/9.54 * Java Collections Framework. 24.26/9.54 * 24.26/9.54 * @author Josh Bloch 24.26/9.54 * @see Collection 24.26/9.54 * @see ListIterator 24.26/9.54 * @see Iterable 24.26/9.54 * @since 1.2 24.26/9.54 */ 24.26/9.54 public interface Iterator { 24.26/9.54 /** 24.26/9.54 * Returns {@code true} if the iteration has more elements. 24.26/9.54 * (In other words, returns {@code true} if {@link #next} would 24.26/9.54 * return an element rather than throwing an exception.) 24.26/9.54 * 24.26/9.54 * @return {@code true} if the iteration has more elements 24.26/9.54 */ 24.26/9.54 boolean hasNext(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the next element in the iteration. 24.26/9.54 * 24.26/9.54 * @return the next element in the iteration 24.26/9.54 * @throws NoSuchElementException if the iteration has no more elements 24.26/9.54 */ 24.26/9.54 E next(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes from the underlying collection the last element returned 24.26/9.54 * by this iterator (optional operation). This method can be called 24.26/9.54 * only once per call to {@link #next}. The behavior of an iterator 24.26/9.54 * is unspecified if the underlying collection is modified while the 24.26/9.54 * iteration is in progress in any way other than by calling this 24.26/9.54 * method. 24.26/9.54 * 24.26/9.54 * @throws UnsupportedOperationException if the {@code remove} 24.26/9.54 * operation is not supported by this iterator 24.26/9.54 * 24.26/9.54 * @throws IllegalStateException if the {@code next} method has not 24.26/9.54 * yet been called, or the {@code remove} method has already 24.26/9.54 * been called after the last call to the {@code next} 24.26/9.54 * method 24.26/9.54 */ 24.26/9.54 void remove(); 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 public class juHashMapCreate { 24.26/9.54 public static void main(String[] args) { 24.26/9.54 Random.args = args; 24.26/9.54 24.26/9.54 HashMap m = createMap(Random.random()); 24.26/9.54 } 24.26/9.54 24.26/9.54 public static HashMap createMap(int n) { 24.26/9.54 HashMap m = new HashMap(); 24.26/9.54 while (n > 0) { 24.26/9.54 Content key = new Content(Random.random()); 24.26/9.54 Content val = new Content(Random.random()); 24.26/9.54 m.put(key, val); 24.26/9.54 n--; 24.26/9.54 } 24.26/9.54 return m; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 final class Content { 24.26/9.54 int val; 24.26/9.54 24.26/9.54 public Content(int v) { 24.26/9.54 this.val = v; 24.26/9.54 } 24.26/9.54 24.26/9.54 public int hashCode() { 24.26/9.54 return val^31; 24.26/9.54 } 24.26/9.54 24.26/9.54 public boolean equals(Object o) { 24.26/9.54 if (o instanceof Content) { 24.26/9.54 return this.val == ((Content) o).val; 24.26/9.54 } 24.26/9.54 return false; 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.54 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.54 * 24.26/9.54 * This code is free software; you can redistribute it and/or modify it 24.26/9.54 * under the terms of the GNU General Public License version 2 only, as 24.26/9.54 * published by the Free Software Foundation. Sun designates this 24.26/9.54 * particular file as subject to the "Classpath" exception as provided 24.26/9.54 * by Sun in the LICENSE file that accompanied this code. 24.26/9.54 * 24.26/9.54 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.54 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.54 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.54 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.54 * accompanied this code). 24.26/9.54 * 24.26/9.54 * You should have received a copy of the GNU General Public License version 24.26/9.54 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.54 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.54 * 24.26/9.54 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.54 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.54 * have any questions. 24.26/9.54 */ 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * An object that maps keys to values. A map cannot contain duplicate keys; 24.26/9.54 * each key can map to at most one value. 24.26/9.54 * 24.26/9.54 *

This interface takes the place of the Dictionary class, which 24.26/9.54 * was a totally abstract class rather than an interface. 24.26/9.54 * 24.26/9.54 *

The Map interface provides three collection views, which 24.26/9.54 * allow a map's contents to be viewed as a set of keys, collection of values, 24.26/9.54 * or set of key-value mappings. The order of a map is defined as 24.26/9.54 * the order in which the iterators on the map's collection views return their 24.26/9.54 * elements. Some map implementations, like the TreeMap class, make 24.26/9.54 * specific guarantees as to their order; others, like the HashMap 24.26/9.54 * class, do not. 24.26/9.54 * 24.26/9.54 *

Note: great care must be exercised if mutable objects are used as map 24.26/9.54 * keys. The behavior of a map is not specified if the value of an object is 24.26/9.54 * changed in a manner that affects equals comparisons while the 24.26/9.54 * object is a key in the map. A special case of this prohibition is that it 24.26/9.54 * is not permissible for a map to contain itself as a key. While it is 24.26/9.54 * permissible for a map to contain itself as a value, extreme caution is 24.26/9.54 * advised: the equals and hashCode methods are no longer 24.26/9.54 * well defined on such a map. 24.26/9.54 * 24.26/9.54 *

All general-purpose map implementation classes should provide two 24.26/9.54 * "standard" constructors: a void (no arguments) constructor which creates an 24.26/9.54 * empty map, and a constructor with a single argument of type Map, 24.26/9.54 * which creates a new map with the same key-value mappings as its argument. 24.26/9.54 * In effect, the latter constructor allows the user to copy any map, 24.26/9.54 * producing an equivalent map of the desired class. There is no way to 24.26/9.54 * enforce this recommendation (as interfaces cannot contain constructors) but 24.26/9.54 * all of the general-purpose map implementations in the JDK comply. 24.26/9.54 * 24.26/9.54 *

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

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

This interface is a member of the 24.26/9.54 * 24.26/9.54 * Java Collections Framework. 24.26/9.54 * 24.26/9.54 *

Many methods in Collections Framework interfaces are defined 24.26/9.54 * in terms of the {@link Object#equals(Object) equals} method. For 24.26/9.54 * example, the specification for the {@link #containsKey(Object) 24.26/9.54 * containsKey(Object key)} method says: "returns true if and 24.26/9.54 * only if this map contains a mapping for a key k such that 24.26/9.54 * (key==null ? k==null : key.equals(k))." This specification should 24.26/9.54 * not be construed to imply that invoking Map.containsKey 24.26/9.54 * with a non-null argument key will cause key.equals(k) to 24.26/9.54 * be invoked for any key k. Implementations are free to 24.26/9.54 * implement optimizations whereby the equals invocation is avoided, 24.26/9.54 * for example, by first comparing the hash codes of the two keys. (The 24.26/9.54 * {@link Object#hashCode()} specification guarantees that two objects with 24.26/9.54 * unequal hash codes cannot be equal.) More generally, implementations of 24.26/9.54 * the various Collections Framework interfaces are free to take advantage of 24.26/9.54 * the specified behavior of underlying {@link Object} methods wherever the 24.26/9.54 * implementor deems it appropriate. 24.26/9.54 * 24.26/9.54 * @param the type of keys maintained by this map 24.26/9.54 * @param the type of mapped values 24.26/9.54 * 24.26/9.54 * @author Josh Bloch 24.26/9.54 * @see HashMap 24.26/9.54 * @see TreeMap 24.26/9.54 * @see Hashtable 24.26/9.54 * @see SortedMap 24.26/9.54 * @see Collection 24.26/9.54 * @see Set 24.26/9.54 * @since 1.2 24.26/9.54 */ 24.26/9.54 public interface Map { 24.26/9.54 // Query Operations 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the number of key-value mappings in this map. If the 24.26/9.54 * map contains more than Integer.MAX_VALUE elements, returns 24.26/9.54 * Integer.MAX_VALUE. 24.26/9.54 * 24.26/9.54 * @return the number of key-value mappings in this map 24.26/9.54 */ 24.26/9.54 int size(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map contains no key-value mappings. 24.26/9.54 * 24.26/9.54 * @return true if this map contains no key-value mappings 24.26/9.54 */ 24.26/9.54 boolean isEmpty(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map contains a mapping for the specified 24.26/9.54 * key. More formally, returns true if and only if 24.26/9.54 * this map contains a mapping for a key k such that 24.26/9.54 * (key==null ? k==null : key.equals(k)). (There can be 24.26/9.54 * at most one such mapping.) 24.26/9.54 * 24.26/9.54 * @param key key whose presence in this map is to be tested 24.26/9.54 * @return true if this map contains a mapping for the specified 24.26/9.54 * key 24.26/9.54 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.54 * this map (optional) 24.26/9.54 * @throws NullPointerException if the specified key is null and this map 24.26/9.54 * does not permit null keys (optional) 24.26/9.54 */ 24.26/9.54 boolean containsKey(Object key); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns true if this map maps one or more keys to the 24.26/9.54 * specified value. More formally, returns true if and only if 24.26/9.54 * this map contains at least one mapping to a value v such that 24.26/9.54 * (value==null ? v==null : value.equals(v)). This operation 24.26/9.54 * will probably require time linear in the map size for most 24.26/9.54 * implementations of the Map interface. 24.26/9.54 * 24.26/9.54 * @param value value whose presence in this map is to be tested 24.26/9.54 * @return true if this map maps one or more keys to the 24.26/9.54 * specified value 24.26/9.54 * @throws ClassCastException if the value is of an inappropriate type for 24.26/9.54 * this map (optional) 24.26/9.54 * @throws NullPointerException if the specified value is null and this 24.26/9.54 * map does not permit null values (optional) 24.26/9.54 */ 24.26/9.54 boolean containsValue(Object value); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the value to which the specified key is mapped, 24.26/9.54 * or {@code null} if this map contains no mapping for the key. 24.26/9.54 * 24.26/9.54 *

More formally, if this map contains a mapping from a key 24.26/9.54 * {@code k} to a value {@code v} such that {@code (key==null ? k==null : 24.26/9.54 * key.equals(k))}, then this method returns {@code v}; otherwise 24.26/9.54 * it returns {@code null}. (There can be at most one such mapping.) 24.26/9.54 * 24.26/9.54 *

If this map permits null values, then a return value of 24.26/9.54 * {@code null} does not necessarily indicate that the map 24.26/9.54 * contains no mapping for the key; it's also possible that the map 24.26/9.54 * explicitly maps the key to {@code null}. The {@link #containsKey 24.26/9.54 * containsKey} operation may be used to distinguish these two cases. 24.26/9.54 * 24.26/9.54 * @param key the key whose associated value is to be returned 24.26/9.54 * @return the value to which the specified key is mapped, or 24.26/9.54 * {@code null} if this map contains no mapping for the key 24.26/9.54 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.54 * this map (optional) 24.26/9.54 * @throws NullPointerException if the specified key is null and this map 24.26/9.54 * does not permit null keys (optional) 24.26/9.54 */ 24.26/9.54 V get(Object key); 24.26/9.54 24.26/9.54 // Modification Operations 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Associates the specified value with the specified key in this map 24.26/9.54 * (optional operation). If the map previously contained a mapping for 24.26/9.54 * the key, the old value is replaced by the specified value. (A map 24.26/9.54 * m is said to contain a mapping for a key k if and only 24.26/9.54 * if {@link #containsKey(Object) m.containsKey(k)} would return 24.26/9.54 * true.) 24.26/9.54 * 24.26/9.54 * @param key key with which the specified value is to be associated 24.26/9.54 * @param value value to be associated with the specified key 24.26/9.54 * @return the previous value associated with key, or 24.26/9.54 * null if there was no mapping for key. 24.26/9.54 * (A null return can also indicate that the map 24.26/9.54 * previously associated null with key, 24.26/9.54 * if the implementation supports null values.) 24.26/9.54 * @throws UnsupportedOperationException if the put operation 24.26/9.54 * is not supported by this map 24.26/9.54 * @throws ClassCastException if the class of the specified key or value 24.26/9.54 * prevents it from being stored in this map 24.26/9.54 * @throws NullPointerException if the specified key or value is null 24.26/9.54 * and this map does not permit null keys or values 24.26/9.54 * @throws IllegalArgumentException if some property of the specified key 24.26/9.54 * or value prevents it from being stored in this map 24.26/9.54 */ 24.26/9.54 V put(K key, V value); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes the mapping for a key from this map if it is present 24.26/9.54 * (optional operation). More formally, if this map contains a mapping 24.26/9.54 * from key k to value v such that 24.26/9.54 * (key==null ? k==null : key.equals(k)), that mapping 24.26/9.54 * is removed. (The map can contain at most one such mapping.) 24.26/9.54 * 24.26/9.54 *

Returns the value to which this map previously associated the key, 24.26/9.54 * or null if the map contained no mapping for the key. 24.26/9.54 * 24.26/9.54 *

If this map permits null values, then a return value of 24.26/9.54 * null does not necessarily indicate that the map 24.26/9.54 * contained no mapping for the key; it's also possible that the map 24.26/9.54 * explicitly mapped the key to null. 24.26/9.54 * 24.26/9.54 *

The map will not contain a mapping for the specified key once the 24.26/9.54 * call returns. 24.26/9.54 * 24.26/9.54 * @param key key whose mapping is to be removed from the map 24.26/9.54 * @return the previous value associated with key, or 24.26/9.54 * null if there was no mapping for key. 24.26/9.54 * @throws UnsupportedOperationException if the remove operation 24.26/9.54 * is not supported by this map 24.26/9.54 * @throws ClassCastException if the key is of an inappropriate type for 24.26/9.54 * this map (optional) 24.26/9.54 * @throws NullPointerException if the specified key is null and this 24.26/9.54 * map does not permit null keys (optional) 24.26/9.54 */ 24.26/9.54 V remove(Object key); 24.26/9.54 24.26/9.54 24.26/9.54 // Bulk Operations 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Copies all of the mappings from the specified map to this map 24.26/9.54 * (optional operation). The effect of this call is equivalent to that 24.26/9.54 * of calling {@link #put(Object,Object) put(k, v)} on this map once 24.26/9.54 * for each mapping from key k to value v in the 24.26/9.54 * specified map. The behavior of this operation is undefined if the 24.26/9.54 * specified map is modified while the operation is in progress. 24.26/9.54 * 24.26/9.54 * @param m mappings to be stored in this map 24.26/9.54 * @throws UnsupportedOperationException if the putAll operation 24.26/9.54 * is not supported by this map 24.26/9.54 * @throws ClassCastException if the class of a key or value in the 24.26/9.54 * specified map prevents it from being stored in this map 24.26/9.54 * @throws NullPointerException if the specified map is null, or if 24.26/9.54 * this map does not permit null keys or values, and the 24.26/9.54 * specified map contains null keys or values 24.26/9.54 * @throws IllegalArgumentException if some property of a key or value in 24.26/9.54 * the specified map prevents it from being stored in this map 24.26/9.54 */ 24.26/9.54 void putAll(Map m); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Removes all of the mappings from this map (optional operation). 24.26/9.54 * The map will be empty after this call returns. 24.26/9.54 * 24.26/9.54 * @throws UnsupportedOperationException if the clear operation 24.26/9.54 * is not supported by this map 24.26/9.54 */ 24.26/9.54 void clear(); 24.26/9.54 24.26/9.54 24.26/9.54 // Views 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Set} view of the keys contained in this map. 24.26/9.54 * The set is backed by the map, so changes to the map are 24.26/9.54 * reflected in the set, and vice-versa. If the map is modified 24.26/9.54 * while an iteration over the set is in progress (except through 24.26/9.54 * the iterator's own remove operation), the results of 24.26/9.54 * the iteration are undefined. The set supports element removal, 24.26/9.54 * which removes the corresponding mapping from the map, via the 24.26/9.54 * Iterator.remove, Set.remove, 24.26/9.54 * removeAll, retainAll, and clear 24.26/9.54 * operations. It does not support the add or addAll 24.26/9.54 * operations. 24.26/9.54 * 24.26/9.54 * @return a set view of the keys contained in this map 24.26/9.54 */ 24.26/9.54 Set keySet(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Collection} view of the values contained in this map. 24.26/9.54 * The collection is backed by the map, so changes to the map are 24.26/9.54 * reflected in the collection, and vice-versa. If the map is 24.26/9.54 * modified while an iteration over the collection is in progress 24.26/9.54 * (except through the iterator's own remove operation), 24.26/9.54 * the results of the iteration are undefined. The collection 24.26/9.54 * supports element removal, which removes the corresponding 24.26/9.54 * mapping from the map, via the Iterator.remove, 24.26/9.54 * Collection.remove, removeAll, 24.26/9.54 * retainAll and clear operations. It does not 24.26/9.54 * support the add or addAll operations. 24.26/9.54 * 24.26/9.54 * @return a collection view of the values contained in this map 24.26/9.54 */ 24.26/9.54 Collection values(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns a {@link Set} view of the mappings contained in this map. 24.26/9.54 * The set is backed by the map, so changes to the map are 24.26/9.54 * reflected in the set, and vice-versa. If the map is modified 24.26/9.54 * while an iteration over the set is in progress (except through 24.26/9.54 * the iterator's own remove operation, or through the 24.26/9.54 * setValue operation on a map entry returned by the 24.26/9.54 * iterator) the results of the iteration are undefined. The set 24.26/9.54 * supports element removal, which removes the corresponding 24.26/9.54 * mapping from the map, via the Iterator.remove, 24.26/9.54 * Set.remove, removeAll, retainAll and 24.26/9.54 * clear operations. It does not support the 24.26/9.54 * add or addAll operations. 24.26/9.54 * 24.26/9.54 * @return a set view of the mappings contained in this map 24.26/9.54 */ 24.26/9.54 Set> entrySet(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * A map entry (key-value pair). The Map.entrySet method returns 24.26/9.54 * a collection-view of the map, whose elements are of this class. The 24.26/9.54 * only way to obtain a reference to a map entry is from the 24.26/9.54 * iterator of this collection-view. These Map.Entry objects are 24.26/9.54 * valid only for the duration of the iteration; more formally, 24.26/9.54 * the behavior of a map entry is undefined if the backing map has been 24.26/9.54 * modified after the entry was returned by the iterator, except through 24.26/9.54 * the setValue operation on the map entry. 24.26/9.54 * 24.26/9.54 * @see Map#entrySet() 24.26/9.54 * @since 1.2 24.26/9.54 */ 24.26/9.54 interface Entry { 24.26/9.54 /** 24.26/9.54 * Returns the key corresponding to this entry. 24.26/9.54 * 24.26/9.54 * @return the key corresponding to this entry 24.26/9.54 * @throws IllegalStateException implementations may, but are not 24.26/9.54 * required to, throw this exception if the entry has been 24.26/9.54 * removed from the backing map. 24.26/9.54 */ 24.26/9.54 K getKey(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the value corresponding to this entry. If the mapping 24.26/9.54 * has been removed from the backing map (by the iterator's 24.26/9.54 * remove operation), the results of this call are undefined. 24.26/9.54 * 24.26/9.54 * @return the value corresponding to this entry 24.26/9.54 * @throws IllegalStateException implementations may, but are not 24.26/9.54 * required to, throw this exception if the entry has been 24.26/9.54 * removed from the backing map. 24.26/9.54 */ 24.26/9.54 V getValue(); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Replaces the value corresponding to this entry with the specified 24.26/9.54 * value (optional operation). (Writes through to the map.) The 24.26/9.54 * behavior of this call is undefined if the mapping has already been 24.26/9.54 * removed from the map (by the iterator's remove operation). 24.26/9.54 * 24.26/9.54 * @param value new value to be stored in this entry 24.26/9.54 * @return old value corresponding to the entry 24.26/9.54 * @throws UnsupportedOperationException if the put operation 24.26/9.54 * is not supported by the backing map 24.26/9.54 * @throws ClassCastException if the class of the specified value 24.26/9.54 * prevents it from being stored in the backing map 24.26/9.54 * @throws NullPointerException if the backing map does not permit 24.26/9.54 * null values, and the specified value is null 24.26/9.54 * @throws IllegalArgumentException if some property of this value 24.26/9.54 * prevents it from being stored in the backing map 24.26/9.54 * @throws IllegalStateException implementations may, but are not 24.26/9.54 * required to, throw this exception if the entry has been 24.26/9.54 * removed from the backing map. 24.26/9.54 */ 24.26/9.54 V setValue(V value); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Compares the specified object with this entry for equality. 24.26/9.54 * Returns true if the given object is also a map entry and 24.26/9.54 * the two entries represent the same mapping. More formally, two 24.26/9.54 * entries e1 and e2 represent the same mapping 24.26/9.54 * if

24.26/9.54	         *     (e1.getKey()==null ?
24.26/9.54	         *      e2.getKey()==null : e1.getKey().equals(e2.getKey()))  &&
24.26/9.54	         *     (e1.getValue()==null ?
24.26/9.54	         *      e2.getValue()==null : e1.getValue().equals(e2.getValue()))
24.26/9.54	         *
24.26/9.54 * This ensures that the equals method works properly across 24.26/9.54 * different implementations of the Map.Entry interface. 24.26/9.54 * 24.26/9.54 * @param o object to be compared for equality with this map entry 24.26/9.54 * @return true if the specified object is equal to this map 24.26/9.54 * entry 24.26/9.54 */ 24.26/9.54 boolean equals(Object o); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the hash code value for this map entry. The hash code 24.26/9.54 * of a map entry e is defined to be: 
24.26/9.54	         *     (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
24.26/9.54	         *     (e.getValue()==null ? 0 : e.getValue().hashCode())
24.26/9.54	         *
24.26/9.54 * This ensures that e1.equals(e2) implies that 24.26/9.54 * e1.hashCode()==e2.hashCode() for any two Entries 24.26/9.54 * e1 and e2, as required by the general 24.26/9.54 * contract of Object.hashCode. 24.26/9.54 * 24.26/9.54 * @return the hash code value for this map entry 24.26/9.54 * @see Object#hashCode() 24.26/9.54 * @see Object#equals(Object) 24.26/9.54 * @see #equals(Object) 24.26/9.54 */ 24.26/9.54 int hashCode(); 24.26/9.54 } 24.26/9.54 24.26/9.54 // Comparison and hashing 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Compares the specified object with this map for equality. Returns 24.26/9.54 * true if the given object is also a map and the two maps 24.26/9.54 * represent the same mappings. More formally, two maps m1 and 24.26/9.54 * m2 represent the same mappings if 24.26/9.54 * m1.entrySet().equals(m2.entrySet()). This ensures that the 24.26/9.54 * equals method works properly across different implementations 24.26/9.54 * of the Map interface. 24.26/9.54 * 24.26/9.54 * @param o object to be compared for equality with this map 24.26/9.54 * @return true if the specified object is equal to this map 24.26/9.54 */ 24.26/9.54 boolean equals(Object o); 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Returns the hash code value for this map. The hash code of a map is 24.26/9.54 * defined to be the sum of the hash codes of each entry in the map's 24.26/9.54 * entrySet() view. This ensures that m1.equals(m2) 24.26/9.54 * implies that m1.hashCode()==m2.hashCode() for any two maps 24.26/9.54 * m1 and m2, as required by the general contract of 24.26/9.54 * {@link Object#hashCode}. 24.26/9.54 * 24.26/9.54 * @return the hash code value for this map 24.26/9.54 * @see Map.Entry#hashCode() 24.26/9.54 * @see Object#equals(Object) 24.26/9.54 * @see #equals(Object) 24.26/9.54 */ 24.26/9.54 int hashCode(); 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.54 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.54 * 24.26/9.54 * This code is free software; you can redistribute it and/or modify it 24.26/9.54 * under the terms of the GNU General Public License version 2 only, as 24.26/9.54 * published by the Free Software Foundation. Sun designates this 24.26/9.54 * particular file as subject to the "Classpath" exception as provided 24.26/9.54 * by Sun in the LICENSE file that accompanied this code. 24.26/9.54 * 24.26/9.54 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.54 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.54 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.54 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.54 * accompanied this code). 24.26/9.54 * 24.26/9.54 * You should have received a copy of the GNU General Public License version 24.26/9.54 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.54 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.54 * 24.26/9.54 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.54 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.54 * have any questions. 24.26/9.54 */ 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Thrown by the nextElement method of an 24.26/9.54 * Enumeration to indicate that there are no more 24.26/9.54 * elements in the enumeration. 24.26/9.54 * 24.26/9.54 * @author unascribed 24.26/9.54 * @see java.util.Enumeration 24.26/9.54 * @see java.util.Enumeration#nextElement() 24.26/9.54 * @since JDK1.0 24.26/9.54 */ 24.26/9.54 public 24.26/9.54 class NoSuchElementException extends RuntimeException { 24.26/9.54 /** 24.26/9.54 * Constructs a NoSuchElementException with null 24.26/9.54 * as its error message string. 24.26/9.54 */ 24.26/9.54 public NoSuchElementException() { 24.26/9.54 super(); 24.26/9.54 } 24.26/9.54 24.26/9.54 /** 24.26/9.54 * Constructs a NoSuchElementException, saving a reference 24.26/9.54 * to the error message string s for later retrieval by the 24.26/9.54 * getMessage method. 24.26/9.54 * 24.26/9.54 * @param s the detail message. 24.26/9.54 */ 24.26/9.54 public NoSuchElementException(String s) { 24.26/9.54 super(s); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 package javaUtilEx; 24.26/9.54 24.26/9.54 public class Random { 24.26/9.54 static String[] args; 24.26/9.54 static int index = 0; 24.26/9.54 24.26/9.54 public static int random() { 24.26/9.54 String string = args[index]; 24.26/9.54 index++; 24.26/9.54 return string.length(); 24.26/9.54 } 24.26/9.54 } 24.26/9.54 24.26/9.54 24.26/9.54 /* 24.26/9.54 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.54 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.54 * 24.26/9.54 * This code is free software; you can redistribute it and/or modify it 24.26/9.54 * under the terms of the GNU General Public License version 2 only, as 24.26/9.54 * published by the Free Software Foundation. Sun designates this 24.26/9.54 * particular file as subject to the "Classpath" exception as provided 24.26/9.54 * by Sun in the LICENSE file that accompanied this code. 24.26/9.55 * 24.26/9.55 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.55 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.55 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.55 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.55 * accompanied this code). 24.26/9.55 * 24.26/9.55 * You should have received a copy of the GNU General Public License version 24.26/9.55 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.55 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.55 * 24.26/9.55 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.55 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.55 * have any questions. 24.26/9.55 */ 24.26/9.55 24.26/9.55 package javaUtilEx; 24.26/9.55 24.26/9.55 /** 24.26/9.55 * A collection that contains no duplicate elements. More formally, sets 24.26/9.55 * contain no pair of elements e1 and e2 such that 24.26/9.55 * e1.equals(e2), and at most one null element. As implied by 24.26/9.55 * its name, this interface models the mathematical set abstraction. 24.26/9.55 * 24.26/9.55 *

The Set interface places additional stipulations, beyond those 24.26/9.55 * inherited from the Collection interface, on the contracts of all 24.26/9.55 * constructors and on the contracts of the add, equals and 24.26/9.55 * hashCode methods. Declarations for other inherited methods are 24.26/9.55 * also included here for convenience. (The specifications accompanying these 24.26/9.55 * declarations have been tailored to the Set interface, but they do 24.26/9.55 * not contain any additional stipulations.) 24.26/9.55 * 24.26/9.55 *

The additional stipulation on constructors is, not surprisingly, 24.26/9.55 * that all constructors must create a set that contains no duplicate elements 24.26/9.55 * (as defined above). 24.26/9.55 * 24.26/9.55 *

Note: Great care must be exercised if mutable objects are used as set 24.26/9.55 * elements. The behavior of a set is not specified if the value of an object 24.26/9.55 * is changed in a manner that affects equals comparisons while the 24.26/9.55 * object is an element in the set. A special case of this prohibition is 24.26/9.55 * that it is not permissible for a set to contain itself as an element. 24.26/9.55 * 24.26/9.55 *

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

This interface is a member of the 24.26/9.55 * 24.26/9.55 * Java Collections Framework. 24.26/9.55 * 24.26/9.55 * @param the type of elements maintained by this set 24.26/9.55 * 24.26/9.55 * @author Josh Bloch 24.26/9.55 * @author Neal Gafter 24.26/9.55 * @see Collection 24.26/9.55 * @see List 24.26/9.55 * @see SortedSet 24.26/9.55 * @see HashSet 24.26/9.55 * @see TreeSet 24.26/9.55 * @see AbstractSet 24.26/9.55 * @see Collections#singleton(java.lang.Object) 24.26/9.55 * @see Collections#EMPTY_SET 24.26/9.55 * @since 1.2 24.26/9.55 */ 24.26/9.55 24.26/9.55 public interface Set extends Collection { 24.26/9.55 // Query Operations 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns the number of elements in this set (its cardinality). If this 24.26/9.55 * set contains more than Integer.MAX_VALUE elements, returns 24.26/9.55 * Integer.MAX_VALUE. 24.26/9.55 * 24.26/9.55 * @return the number of elements in this set (its cardinality) 24.26/9.55 */ 24.26/9.55 int size(); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns true if this set contains no elements. 24.26/9.55 * 24.26/9.55 * @return true if this set contains no elements 24.26/9.55 */ 24.26/9.55 boolean isEmpty(); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns true if this set contains the specified element. 24.26/9.55 * More formally, returns true if and only if this set 24.26/9.55 * contains an element e such that 24.26/9.55 * (o==null ? e==null : o.equals(e)). 24.26/9.55 * 24.26/9.55 * @param o element whose presence in this set is to be tested 24.26/9.55 * @return true if this set contains the specified element 24.26/9.55 * @throws ClassCastException if the type of the specified element 24.26/9.55 * is incompatible with this set (optional) 24.26/9.55 * @throws NullPointerException if the specified element is null and this 24.26/9.55 * set does not permit null elements (optional) 24.26/9.55 */ 24.26/9.55 boolean contains(Object o); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns an iterator over the elements in this set. The elements are 24.26/9.55 * returned in no particular order (unless this set is an instance of some 24.26/9.55 * class that provides a guarantee). 24.26/9.55 * 24.26/9.55 * @return an iterator over the elements in this set 24.26/9.55 */ 24.26/9.55 Iterator iterator(); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns an array containing all of the elements in this set. 24.26/9.55 * If this set makes any guarantees as to what order its elements 24.26/9.55 * are returned by its iterator, this method must return the 24.26/9.55 * elements in the same order. 24.26/9.55 * 24.26/9.55 *

The returned array will be "safe" in that no references to it 24.26/9.55 * are maintained by this set. (In other words, this method must 24.26/9.55 * allocate a new array even if this set is backed by an array). 24.26/9.55 * The caller is thus free to modify the returned array. 24.26/9.55 * 24.26/9.55 *

This method acts as bridge between array-based and collection-based 24.26/9.55 * APIs. 24.26/9.55 * 24.26/9.55 * @return an array containing all the elements in this set 24.26/9.55 */ 24.26/9.55 Object[] toArray(); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns an array containing all of the elements in this set; the 24.26/9.55 * runtime type of the returned array is that of the specified array. 24.26/9.55 * If the set fits in the specified array, it is returned therein. 24.26/9.55 * Otherwise, a new array is allocated with the runtime type of the 24.26/9.55 * specified array and the size of this set. 24.26/9.55 * 24.26/9.55 *

If this set fits in the specified array with room to spare 24.26/9.55 * (i.e., the array has more elements than this set), the element in 24.26/9.55 * the array immediately following the end of the set is set to 24.26/9.55 * null. (This is useful in determining the length of this 24.26/9.55 * set only if the caller knows that this set does not contain 24.26/9.55 * any null elements.) 24.26/9.55 * 24.26/9.55 *

If this set makes any guarantees as to what order its elements 24.26/9.55 * are returned by its iterator, this method must return the elements 24.26/9.55 * in the same order. 24.26/9.55 * 24.26/9.55 *

Like the {@link #toArray()} method, this method acts as bridge between 24.26/9.55 * array-based and collection-based APIs. Further, this method allows 24.26/9.55 * precise control over the runtime type of the output array, and may, 24.26/9.55 * under certain circumstances, be used to save allocation costs. 24.26/9.55 * 24.26/9.55 *

Suppose x is a set known to contain only strings. 24.26/9.55 * The following code can be used to dump the set into a newly allocated 24.26/9.55 * array of String: 24.26/9.55 * 24.26/9.55 * 

24.26/9.55	     *     String[] y = x.toArray(new String[0]);
24.26/9.55 * 24.26/9.55 * Note that toArray(new Object[0]) is identical in function to 24.26/9.55 * toArray(). 24.26/9.55 * 24.26/9.55 * @param a the array into which the elements of this set are to be 24.26/9.55 * stored, if it is big enough; otherwise, a new array of the same 24.26/9.55 * runtime type is allocated for this purpose. 24.26/9.55 * @return an array containing all the elements in this set 24.26/9.55 * @throws ArrayStoreException if the runtime type of the specified array 24.26/9.55 * is not a supertype of the runtime type of every element in this 24.26/9.55 * set 24.26/9.55 * @throws NullPointerException if the specified array is null 24.26/9.55 */ 24.26/9.55 T[] toArray(T[] a); 24.26/9.55 24.26/9.55 24.26/9.55 // Modification Operations 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Adds the specified element to this set if it is not already present 24.26/9.55 * (optional operation). More formally, adds the specified element 24.26/9.55 * e to this set if the set contains no element e2 24.26/9.55 * such that 24.26/9.55 * (e==null ? e2==null : e.equals(e2)). 24.26/9.55 * If this set already contains the element, the call leaves the set 24.26/9.55 * unchanged and returns false. In combination with the 24.26/9.55 * restriction on constructors, this ensures that sets never contain 24.26/9.55 * duplicate elements. 24.26/9.55 * 24.26/9.55 *

The stipulation above does not imply that sets must accept all 24.26/9.55 * elements; sets may refuse to add any particular element, including 24.26/9.55 * null, and throw an exception, as described in the 24.26/9.55 * specification for {@link Collection#add Collection.add}. 24.26/9.55 * Individual set implementations should clearly document any 24.26/9.55 * restrictions on the elements that they may contain. 24.26/9.55 * 24.26/9.55 * @param e element to be added to this set 24.26/9.55 * @return true if this set did not already contain the specified 24.26/9.55 * element 24.26/9.55 * @throws UnsupportedOperationException if the add operation 24.26/9.55 * is not supported by this set 24.26/9.55 * @throws ClassCastException if the class of the specified element 24.26/9.55 * prevents it from being added to this set 24.26/9.55 * @throws NullPointerException if the specified element is null and this 24.26/9.55 * set does not permit null elements 24.26/9.55 * @throws IllegalArgumentException if some property of the specified element 24.26/9.55 * prevents it from being added to this set 24.26/9.55 */ 24.26/9.55 boolean add(E e); 24.26/9.55 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Removes the specified element from this set if it is present 24.26/9.55 * (optional operation). More formally, removes an element e 24.26/9.55 * such that 24.26/9.55 * (o==null ? e==null : o.equals(e)), if 24.26/9.55 * this set contains such an element. Returns true if this set 24.26/9.55 * contained the element (or equivalently, if this set changed as a 24.26/9.55 * result of the call). (This set will not contain the element once the 24.26/9.55 * call returns.) 24.26/9.55 * 24.26/9.55 * @param o object to be removed from this set, if present 24.26/9.55 * @return true if this set contained the specified element 24.26/9.55 * @throws ClassCastException if the type of the specified element 24.26/9.55 * is incompatible with this set (optional) 24.26/9.55 * @throws NullPointerException if the specified element is null and this 24.26/9.55 * set does not permit null elements (optional) 24.26/9.55 * @throws UnsupportedOperationException if the remove operation 24.26/9.55 * is not supported by this set 24.26/9.55 */ 24.26/9.55 boolean remove(Object o); 24.26/9.55 24.26/9.55 24.26/9.55 // Bulk Operations 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns true if this set contains all of the elements of the 24.26/9.55 * specified collection. If the specified collection is also a set, this 24.26/9.55 * method returns true if it is a subset of this set. 24.26/9.55 * 24.26/9.55 * @param c collection to be checked for containment in this set 24.26/9.55 * @return true if this set contains all of the elements of the 24.26/9.55 * specified collection 24.26/9.55 * @throws ClassCastException if the types of one or more elements 24.26/9.55 * in the specified collection are incompatible with this 24.26/9.55 * set (optional) 24.26/9.55 * @throws NullPointerException if the specified collection contains one 24.26/9.55 * or more null elements and this set does not permit null 24.26/9.55 * elements (optional), or if the specified collection is null 24.26/9.55 * @see #contains(Object) 24.26/9.55 */ 24.26/9.55 boolean containsAll(Collection c); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Adds all of the elements in the specified collection to this set if 24.26/9.55 * they're not already present (optional operation). If the specified 24.26/9.55 * collection is also a set, the addAll operation effectively 24.26/9.55 * modifies this set so that its value is the union of the two 24.26/9.55 * sets. The behavior of this operation is undefined if the specified 24.26/9.55 * collection is modified while the operation is in progress. 24.26/9.55 * 24.26/9.55 * @param c collection containing elements to be added to this set 24.26/9.55 * @return true if this set changed as a result of the call 24.26/9.55 * 24.26/9.55 * @throws UnsupportedOperationException if the addAll operation 24.26/9.55 * is not supported by this set 24.26/9.55 * @throws ClassCastException if the class of an element of the 24.26/9.55 * specified collection prevents it from being added to this set 24.26/9.55 * @throws NullPointerException if the specified collection contains one 24.26/9.55 * or more null elements and this set does not permit null 24.26/9.55 * elements, or if the specified collection is null 24.26/9.55 * @throws IllegalArgumentException if some property of an element of the 24.26/9.55 * specified collection prevents it from being added to this set 24.26/9.55 * @see #add(Object) 24.26/9.55 */ 24.26/9.55 boolean addAll(Collection c); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Retains only the elements in this set that are contained in the 24.26/9.55 * specified collection (optional operation). In other words, removes 24.26/9.55 * from this set all of its elements that are not contained in the 24.26/9.55 * specified collection. If the specified collection is also a set, this 24.26/9.55 * operation effectively modifies this set so that its value is the 24.26/9.55 * intersection of the two sets. 24.26/9.55 * 24.26/9.55 * @param c collection containing elements to be retained in this set 24.26/9.55 * @return true if this set changed as a result of the call 24.26/9.55 * @throws UnsupportedOperationException if the retainAll operation 24.26/9.55 * is not supported by this set 24.26/9.55 * @throws ClassCastException if the class of an element of this set 24.26/9.55 * is incompatible with the specified collection (optional) 24.26/9.55 * @throws NullPointerException if this set contains a null element and the 24.26/9.55 * specified collection does not permit null elements (optional), 24.26/9.55 * or if the specified collection is null 24.26/9.55 * @see #remove(Object) 24.26/9.55 */ 24.26/9.55 boolean retainAll(Collection c); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Removes from this set all of its elements that are contained in the 24.26/9.55 * specified collection (optional operation). If the specified 24.26/9.55 * collection is also a set, this operation effectively modifies this 24.26/9.55 * set so that its value is the asymmetric set difference of 24.26/9.55 * the two sets. 24.26/9.55 * 24.26/9.55 * @param c collection containing elements to be removed from this set 24.26/9.55 * @return true if this set changed as a result of the call 24.26/9.55 * @throws UnsupportedOperationException if the removeAll operation 24.26/9.55 * is not supported by this set 24.26/9.55 * @throws ClassCastException if the class of an element of this set 24.26/9.55 * is incompatible with the specified collection (optional) 24.26/9.55 * @throws NullPointerException if this set contains a null element and the 24.26/9.55 * specified collection does not permit null elements (optional), 24.26/9.55 * or if the specified collection is null 24.26/9.55 * @see #remove(Object) 24.26/9.55 * @see #contains(Object) 24.26/9.55 */ 24.26/9.55 boolean removeAll(Collection c); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Removes all of the elements from this set (optional operation). 24.26/9.55 * The set will be empty after this call returns. 24.26/9.55 * 24.26/9.55 * @throws UnsupportedOperationException if the clear method 24.26/9.55 * is not supported by this set 24.26/9.55 */ 24.26/9.55 void clear(); 24.26/9.55 24.26/9.55 24.26/9.55 // Comparison and hashing 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Compares the specified object with this set for equality. Returns 24.26/9.55 * true if the specified object is also a set, the two sets 24.26/9.55 * have the same size, and every member of the specified set is 24.26/9.55 * contained in this set (or equivalently, every member of this set is 24.26/9.55 * contained in the specified set). This definition ensures that the 24.26/9.55 * equals method works properly across different implementations of the 24.26/9.55 * set interface. 24.26/9.55 * 24.26/9.55 * @param o object to be compared for equality with this set 24.26/9.55 * @return true if the specified object is equal to this set 24.26/9.55 */ 24.26/9.55 boolean equals(Object o); 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Returns the hash code value for this set. The hash code of a set is 24.26/9.55 * defined to be the sum of the hash codes of the elements in the set, 24.26/9.55 * where the hash code of a null element is defined to be zero. 24.26/9.55 * This ensures that s1.equals(s2) implies that 24.26/9.55 * s1.hashCode()==s2.hashCode() for any two sets s1 24.26/9.55 * and s2, as required by the general contract of 24.26/9.55 * {@link Object#hashCode}. 24.26/9.55 * 24.26/9.55 * @return the hash code value for this set 24.26/9.55 * @see Object#equals(Object) 24.26/9.55 * @see Set#equals(Object) 24.26/9.55 */ 24.26/9.55 int hashCode(); 24.26/9.55 } 24.26/9.55 24.26/9.55 24.26/9.55 /* 24.26/9.55 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. 24.26/9.55 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 24.26/9.55 * 24.26/9.55 * This code is free software; you can redistribute it and/or modify it 24.26/9.55 * under the terms of the GNU General Public License version 2 only, as 24.26/9.55 * published by the Free Software Foundation. Sun designates this 24.26/9.55 * particular file as subject to the "Classpath" exception as provided 24.26/9.55 * by Sun in the LICENSE file that accompanied this code. 24.26/9.55 * 24.26/9.55 * This code is distributed in the hope that it will be useful, but WITHOUT 24.26/9.55 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 24.26/9.55 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 24.26/9.55 * version 2 for more details (a copy is included in the LICENSE file that 24.26/9.55 * accompanied this code). 24.26/9.55 * 24.26/9.55 * You should have received a copy of the GNU General Public License version 24.26/9.55 * 2 along with this work; if not, write to the Free Software Foundation, 24.26/9.55 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 24.26/9.55 * 24.26/9.55 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 24.26/9.55 * CA 95054 USA or visit www.sun.com if you need additional information or 24.26/9.55 * have any questions. 24.26/9.55 */ 24.26/9.55 24.26/9.55 package javaUtilEx; 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Thrown to indicate that the requested operation is not supported.

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

Note that the detail message associated with cause is 24.26/9.55 * not automatically incorporated in this exception's detail 24.26/9.55 * message. 24.26/9.55 * 24.26/9.55 * @param message the detail message (which is saved for later retrieval 24.26/9.55 * by the {@link Throwable#getMessage()} method). 24.26/9.55 * @param cause the cause (which is saved for later retrieval by the 24.26/9.55 * {@link Throwable#getCause()} method). (A null value 24.26/9.55 * is permitted, and indicates that the cause is nonexistent or 24.26/9.55 * unknown.) 24.26/9.55 * @since 1.5 24.26/9.55 */ 24.26/9.55 public UnsupportedOperationException(String message, Throwable cause) { 24.26/9.55 super(message, cause); 24.26/9.55 } 24.26/9.55 24.26/9.55 /** 24.26/9.55 * Constructs a new exception with the specified cause and a detail 24.26/9.55 * message of (cause==null ? null : cause.toString()) (which 24.26/9.55 * typically contains the class and detail message of cause). 24.26/9.55 * This constructor is useful for exceptions that are little more than 24.26/9.55 * wrappers for other throwables (for example, {@link 24.26/9.55 * java.security.PrivilegedActionException}). 24.26/9.55 * 24.26/9.55 * @param cause the cause (which is saved for later retrieval by the 24.26/9.55 * {@link Throwable#getCause()} method). (A null value is 24.26/9.55 * permitted, and indicates that the cause is nonexistent or 24.26/9.55 * unknown.) 24.26/9.55 * @since 1.5 24.26/9.55 */ 24.26/9.55 public UnsupportedOperationException(Throwable cause) { 24.26/9.55 super(cause); 24.26/9.55 } 24.26/9.55 24.26/9.55 static final long serialVersionUID = -1242599979055084673L; 24.26/9.55 } 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (3) JBCToGraph (EQUIVALENT) 24.26/9.55 Constructed TerminationGraph. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (4) 24.26/9.55 Obligation: 24.26/9.55 Termination Graph based on JBC Program: 24.26/9.55 javaUtilEx.juHashMapCreate.main([Ljava/lang/String;)V: Graph of 123 nodes with 0 SCCs. 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 javaUtilEx.juHashMapCreate.createMap(I)LjavaUtilEx/HashMap;: Graph of 248 nodes with 1 SCC. 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;: Graph of 493 nodes with 2 SCCs. 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 javaUtilEx.Content.hashCode()I: Graph of 6 nodes with 0 SCCs. 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 javaUtilEx.Content.equals(Ljava/lang/Object;)Z: Graph of 31 nodes with 0 SCCs. 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (5) TerminationGraphToSCCProof (SOUND) 24.26/9.55 Splitted TerminationGraph to 3 SCCss. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (6) 24.26/9.55 Complex Obligation (AND) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (7) 24.26/9.55 Obligation: 24.26/9.55 SCC of termination graph based on JBC Program. 24.26/9.55 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 24.26/9.55 SCC calls the following helper methods: 24.26/9.55 Performed SCC analyses: 24.26/9.55 *Used field analysis yielded the following read fields: 24.26/9.55 *javaUtilEx.HashMap$Entry: [next, hash] 24.26/9.55 *Marker field analysis yielded the following relations that could be markers: 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (8) SCCToIRSProof (SOUND) 24.26/9.55 Transformed FIGraph SCCs to intTRSs. Log: 24.26/9.55 Generated rules. Obtained 58 IRulesP rules: 24.26/9.55 f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909) -> f9274_0_transfer_ArrayLength(EOS(STATIC_9274), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, java.lang.Object(ARRAY(i3908))) :|: TRUE 24.26/9.55 f9274_0_transfer_ArrayLength(EOS(STATIC_9274), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, java.lang.Object(ARRAY(i3908))) -> f9275_0_transfer_GE(EOS(STATIC_9275), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, i3908) :|: i3908 >= 0 24.26/9.55 f9275_0_transfer_GE(EOS(STATIC_9275), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, i3908) -> f9277_0_transfer_GE(EOS(STATIC_9277), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, i3908) :|: i3909 < i3908 24.26/9.55 f9277_0_transfer_GE(EOS(STATIC_9277), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909, i3908) -> f9279_0_transfer_Load(EOS(STATIC_9279), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) :|: i3909 < i3908 24.26/9.55 f9279_0_transfer_Load(EOS(STATIC_9279), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) -> f9281_0_transfer_Load(EOS(STATIC_9281), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908))) :|: TRUE 24.26/9.55 f9281_0_transfer_Load(EOS(STATIC_9281), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908))) -> f9283_0_transfer_ArrayAccess(EOS(STATIC_9283), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908)), i3909) :|: TRUE 24.26/9.55 f9283_0_transfer_ArrayAccess(EOS(STATIC_9283), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908)), i3909) -> f9285_0_transfer_ArrayAccess(EOS(STATIC_9285), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908)), i3909) :|: TRUE 24.26/9.55 f9285_0_transfer_ArrayAccess(EOS(STATIC_9285), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(ARRAY(i3908)), i3909) -> f9288_0_transfer_Store(EOS(STATIC_9288), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4241) :|: i3909 < i3908 24.26/9.55 f9288_0_transfer_Store(EOS(STATIC_9288), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4241) -> f9291_0_transfer_Load(EOS(STATIC_9291), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4241) :|: TRUE 24.26/9.55 f9291_0_transfer_Load(EOS(STATIC_9291), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4241) -> f9293_0_transfer_NULL(EOS(STATIC_9293), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4241, o4241) :|: TRUE 24.26/9.55 f9293_0_transfer_NULL(EOS(STATIC_9293), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(o4243sub)) -> f9296_0_transfer_NULL(EOS(STATIC_9296), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(o4243sub)) :|: TRUE 24.26/9.55 f9293_0_transfer_NULL(EOS(STATIC_9293), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) -> f9297_0_transfer_NULL(EOS(STATIC_9297), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) :|: TRUE 24.26/9.55 f9296_0_transfer_NULL(EOS(STATIC_9296), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(o4243sub)) -> f9300_0_transfer_Load(EOS(STATIC_9300), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub)) :|: TRUE 24.26/9.55 f9300_0_transfer_Load(EOS(STATIC_9300), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub)) -> f9303_0_transfer_Load(EOS(STATIC_9303), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908))) :|: TRUE 24.26/9.55 f9303_0_transfer_Load(EOS(STATIC_9303), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908))) -> f9307_0_transfer_ConstantStackPush(EOS(STATIC_9307), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909) :|: TRUE 24.26/9.55 f9307_0_transfer_ConstantStackPush(EOS(STATIC_9307), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909) -> f9311_0_transfer_ArrayAccess(EOS(STATIC_9311), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909, NULL) :|: TRUE 24.26/9.55 f9311_0_transfer_ArrayAccess(EOS(STATIC_9311), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909, NULL) -> f9313_0_transfer_ArrayAccess(EOS(STATIC_9313), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909, NULL) :|: TRUE 24.26/9.55 f9313_0_transfer_ArrayAccess(EOS(STATIC_9313), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(ARRAY(i3908)), i3909, NULL) -> f9317_0_transfer_Load(EOS(STATIC_9317), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243put)) :|: i3909 < i3908 24.26/9.55 f9317_0_transfer_Load(EOS(STATIC_9317), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub)) -> f9321_0_transfer_FieldAccess(EOS(STATIC_9321), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4243sub), java.lang.Object(o4243sub)) :|: TRUE 24.26/9.55 f9321_0_transfer_FieldAccess(EOS(STATIC_9321), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) -> f9323_0_transfer_FieldAccess(EOS(STATIC_9323), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) :|: TRUE 24.26/9.55 f9323_0_transfer_FieldAccess(EOS(STATIC_9323), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) -> f9327_0_transfer_Store(EOS(STATIC_9327), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255) :|: TRUE 24.26/9.55 f9327_0_transfer_Store(EOS(STATIC_9327), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255) -> f9330_0_transfer_Load(EOS(STATIC_9330), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255) :|: TRUE 24.26/9.55 f9330_0_transfer_Load(EOS(STATIC_9330), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255) -> f9332_0_transfer_FieldAccess(EOS(STATIC_9332), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) :|: TRUE 24.26/9.55 f9332_0_transfer_FieldAccess(EOS(STATIC_9332), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) -> f9335_0_transfer_Load(EOS(STATIC_9335), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920) :|: TRUE 24.26/9.55 f9335_0_transfer_Load(EOS(STATIC_9335), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920) -> f9338_0_transfer_InvokeMethod(EOS(STATIC_9338), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) :|: TRUE 24.26/9.55 f9338_0_transfer_InvokeMethod(EOS(STATIC_9338), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) -> f9340_0_indexFor_Load(EOS(STATIC_9340), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) :|: TRUE 24.26/9.55 f9340_0_indexFor_Load(EOS(STATIC_9340), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) -> f9345_0_indexFor_Load(EOS(STATIC_9345), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3750, i3920) :|: TRUE 24.26/9.55 f9345_0_indexFor_Load(EOS(STATIC_9345), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3750, i3920) -> f9347_0_indexFor_ConstantStackPush(EOS(STATIC_9347), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) :|: TRUE 24.26/9.55 f9347_0_indexFor_ConstantStackPush(EOS(STATIC_9347), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750) -> f9350_0_indexFor_IntArithmetic(EOS(STATIC_9350), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750, 1) :|: TRUE 24.26/9.55 f9350_0_indexFor_IntArithmetic(EOS(STATIC_9350), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750, matching1) -> f9353_0_indexFor_IntArithmetic(EOS(STATIC_9353), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3750 - 1) :|: i3750 >= 0 && matching1 = 1 24.26/9.55 f9353_0_indexFor_IntArithmetic(EOS(STATIC_9353), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3920, i3937) -> f9355_0_indexFor_Return(EOS(STATIC_9355), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) :|: TRUE 24.26/9.55 f9355_0_indexFor_Return(EOS(STATIC_9355), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) -> f9358_0_transfer_Store(EOS(STATIC_9358), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) :|: TRUE 24.26/9.55 f9358_0_transfer_Store(EOS(STATIC_9358), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) -> f9361_0_transfer_Load(EOS(STATIC_9361), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) :|: TRUE 24.26/9.55 f9361_0_transfer_Load(EOS(STATIC_9361), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938) -> f9364_0_transfer_Load(EOS(STATIC_9364), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) :|: TRUE 24.26/9.55 f9364_0_transfer_Load(EOS(STATIC_9364), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920))) -> f9367_0_transfer_Load(EOS(STATIC_9367), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750))) :|: TRUE 24.26/9.55 f9367_0_transfer_Load(EOS(STATIC_9367), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750))) -> f9370_0_transfer_ArrayAccess(EOS(STATIC_9370), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750)), i3938) :|: TRUE 24.26/9.55 f9370_0_transfer_ArrayAccess(EOS(STATIC_9370), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750)), i3938) -> f9373_0_transfer_ArrayAccess(EOS(STATIC_9373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750)), i3938) :|: TRUE 24.26/9.55 f9373_0_transfer_ArrayAccess(EOS(STATIC_9373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), java.lang.Object(ARRAY(i3750)), i3938) -> f9377_0_transfer_FieldAccess(EOS(STATIC_9377), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4275) :|: i3938 < i3750 24.26/9.55 f9377_0_transfer_FieldAccess(EOS(STATIC_9377), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4255, i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255, i3920)), o4275) -> f9381_0_transfer_Load(EOS(STATIC_9381), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, i3938) :|: TRUE 24.26/9.55 f9381_0_transfer_Load(EOS(STATIC_9381), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, i3938) -> f9383_0_transfer_Load(EOS(STATIC_9383), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, i3938, java.lang.Object(ARRAY(i3750))) :|: TRUE 24.26/9.55 f9383_0_transfer_Load(EOS(STATIC_9383), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, i3938, java.lang.Object(ARRAY(i3750))) -> f9387_0_transfer_Load(EOS(STATIC_9387), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, java.lang.Object(ARRAY(i3750)), i3938) :|: TRUE 24.26/9.55 f9387_0_transfer_Load(EOS(STATIC_9387), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920)), o4255, java.lang.Object(ARRAY(i3750)), i3938) -> f9390_0_transfer_ArrayAccess(EOS(STATIC_9390), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255, java.lang.Object(ARRAY(i3750)), i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920))) :|: TRUE 24.26/9.55 f9390_0_transfer_ArrayAccess(EOS(STATIC_9390), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255, java.lang.Object(ARRAY(i3750)), i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920))) -> f9392_0_transfer_ArrayAccess(EOS(STATIC_9392), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255, java.lang.Object(ARRAY(i3750)), i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920))) :|: TRUE 24.26/9.55 f9392_0_transfer_ArrayAccess(EOS(STATIC_9392), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255, java.lang.Object(ARRAY(i3750)), i3938, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4275, i3920))) -> f9396_0_transfer_Load(EOS(STATIC_9396), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) :|: i3938 < i3750 24.26/9.55 f9396_0_transfer_Load(EOS(STATIC_9396), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) -> f9400_0_transfer_Store(EOS(STATIC_9400), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) :|: TRUE 24.26/9.55 f9400_0_transfer_Store(EOS(STATIC_9400), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) -> f9401_0_transfer_Load(EOS(STATIC_9401), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) :|: TRUE 24.26/9.55 f9401_0_transfer_Load(EOS(STATIC_9401), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255) -> f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, o4255, o4255) :|: TRUE 24.26/9.55 f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub), java.lang.Object(o4298sub)) -> f9407_0_transfer_NONNULL(EOS(STATIC_9407), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub), java.lang.Object(o4298sub)) :|: TRUE 24.26/9.55 f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) -> f9408_0_transfer_NONNULL(EOS(STATIC_9408), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) :|: TRUE 24.26/9.55 f9407_0_transfer_NONNULL(EOS(STATIC_9407), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub), java.lang.Object(o4298sub)) -> f9409_0_transfer_Load(EOS(STATIC_9409), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub)) :|: TRUE 24.26/9.55 f9409_0_transfer_Load(EOS(STATIC_9409), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub)) -> f9317_0_transfer_Load(EOS(STATIC_9317), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, java.lang.Object(o4298sub)) :|: TRUE 24.26/9.55 f9408_0_transfer_NONNULL(EOS(STATIC_9408), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) -> f9410_0_transfer_Inc(EOS(STATIC_9410), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) :|: TRUE 24.26/9.55 f9410_0_transfer_Inc(EOS(STATIC_9410), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) -> f9413_0_transfer_JMP(EOS(STATIC_9413), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909 + 1) :|: TRUE 24.26/9.55 f9413_0_transfer_JMP(EOS(STATIC_9413), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3956) -> f9416_0_transfer_Load(EOS(STATIC_9416), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3956) :|: TRUE 24.26/9.55 f9416_0_transfer_Load(EOS(STATIC_9416), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3956) -> f9272_0_transfer_Load(EOS(STATIC_9272), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3956) :|: TRUE 24.26/9.55 f9272_0_transfer_Load(EOS(STATIC_9272), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) -> f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, i3909) :|: TRUE 24.26/9.55 f9297_0_transfer_NULL(EOS(STATIC_9297), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909, NULL, NULL) -> f9301_0_transfer_Inc(EOS(STATIC_9301), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) :|: TRUE 24.26/9.55 f9301_0_transfer_Inc(EOS(STATIC_9301), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) -> f9410_0_transfer_Inc(EOS(STATIC_9410), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750, java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3750)), java.lang.Object(ARRAY(i3908)), i3750, i3909) :|: TRUE 24.26/9.55 Combined rules. Obtained 4 IRulesP rules: 24.26/9.55 f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255:0, i3920:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o4255:0, i3920:0))) -> f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, o4255:0, o4255:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, NULL, NULL) -> f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0 + 1, i3909:0 + 1) :|: TRUE 24.26/9.55 f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, i3909:0) -> f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0 + 1, i3909:0 + 1) :|: i3908:0 > -1 && i3909:0 < i3908:0 24.26/9.55 f9273_0_transfer_Load(EOS(STATIC_9273), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, i3909:0) -> f9404_0_transfer_NONNULL(EOS(STATIC_9404), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3750:0, java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3750:0, i3909:0, o4255:0, o4255:0) :|: i3908:0 > -1 && i3909:0 < i3908:0 && i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 Filtered constant ground arguments: 24.26/9.55 f9404_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f9404_0_transfer_NONNULL(x4, x5, x6, x7, x8, x9, x10, x11) 24.26/9.55 f9273_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> f9273_0_transfer_Load(x4, x5, x6, x7, x8, x9, x10) 24.26/9.55 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 24.26/9.55 javaUtilEx.HashMap$Entry(x1, x2, x3) -> javaUtilEx.HashMap$Entry(x2, x3) 24.26/9.55 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 24.26/9.55 Filtered duplicate arguments: 24.26/9.55 f9404_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8) -> f9404_0_transfer_NONNULL(x3, x4, x6, x8) 24.26/9.55 f9273_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7) -> f9273_0_transfer_Load(x3, x4, x7) 24.26/9.55 Filtered unneeded arguments: 24.26/9.55 javaUtilEx.HashMap$Entry(x1, x2) -> javaUtilEx.HashMap$Entry(x1) 24.26/9.55 Finished conversion. Obtained 4 rules.P rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0)), i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, NULL, i3750:0, i3908:0) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0 + 1, i3750:0, i3908:0) :|: TRUE 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, i3750:0, i3908:0) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0 + 1, i3750:0, i3908:0) :|: i3908:0 > -1 && i3909:0 < i3908:0 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3909:0 < i3908:0 && i3908:0 > -1 && i3938:0 < i3750:0 && i3750:0 > -1 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (9) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0)), i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2 + 1, x, x1) :|: TRUE 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x3, x4) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5 + 1, x3, x4) :|: x4 > -1 && x5 < x4 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x6, x7) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x9, x6, x7) :|: x8 < x7 && x7 > -1 && x10 < x6 && x6 > -1 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (10) IRSFormatTransformerProof (EQUIVALENT) 24.26/9.55 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (11) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0)), i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x6, x7) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x9, x6, x7) :|: x8 < x7 && x7 > -1 && x10 < x6 && x6 > -1 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (12) IRSwTTerminationDigraphProof (EQUIVALENT) 24.26/9.55 Constructed termination digraph! 24.26/9.55 Nodes: 24.26/9.55 (1) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0)), i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 (2) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 24.26/9.55 (3) f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 24.26/9.55 (4) f9273_0_transfer_Load(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x6, x7) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x9, x6, x7) :|: x8 < x7 && x7 > -1 && x10 < x6 && x6 > -1 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1), (2) 24.26/9.55 (2) -> (3), (4) 24.26/9.55 (3) -> (3), (4) 24.26/9.55 (4) -> (1), (2) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (13) 24.26/9.55 Obligation: 24.26/9.55 24.26/9.55 Termination digraph: 24.26/9.55 Nodes: 24.26/9.55 (1) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0)), i3750:0, i3908:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0)), java.lang.Object(ARRAY(i3908:0)), i3909:0, o4255:0, i3750:0, i3908:0) :|: i3750:0 > -1 && i3938:0 < i3750:0 24.26/9.55 (2) f9273_0_transfer_Load(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x6, x7) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x6)), java.lang.Object(ARRAY(x7)), x8, x9, x6, x7) :|: x8 < x7 && x7 > -1 && x10 < x6 && x6 > -1 24.26/9.55 (3) f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 24.26/9.55 (4) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1), (4) 24.26/9.55 (2) -> (1), (4) 24.26/9.55 (3) -> (2), (3) 24.26/9.55 (4) -> (2), (3) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (14) IntTRSCompressionProof (EQUIVALENT) 24.26/9.55 Compressed rules. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (15) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x6:0)), java.lang.Object(ARRAY(x7:0)), x8:0, x6:0, x7:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x6:0)), java.lang.Object(ARRAY(x7:0)), x8:0, x9:0, x6:0, x7:0) :|: x6:0 > x10:0 && x6:0 > -1 && x7:0 > -1 && x8:0 < x7:0 24.26/9.55 f9273_0_transfer_Load(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0 + 1, x11:0, x12:0) :|: x12:0 > -1 && x13:0 < x12:0 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: i3750:0:0 > -1 && i3938:0:0 < i3750:0:0 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, NULL, x:0, x1:0) -> f9273_0_transfer_Load(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0 + 1, x:0, x1:0) :|: TRUE 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (16) TempFilterProof (SOUND) 24.26/9.55 Used the following sort dictionary for filtering: 24.26/9.55 f9273_0_transfer_Load(VARIABLE, VARIABLE, INTEGER, VARIABLE, VARIABLE) 24.26/9.55 java.lang.Object(VARIABLE) 24.26/9.55 ARRAY(VARIABLE) 24.26/9.55 f9404_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE) 24.26/9.55 javaUtilEx.HashMap$Entry(VARIABLE) 24.26/9.55 NULL() 24.26/9.55 Replaced non-predefined constructor symbols by 0.The following proof was generated: 24.26/9.55 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 24.26/9.55 24.26/9.55 24.26/9.55 Termination of the given IntTRS could not be shown: 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 24.26/9.55 Rules: 24.26/9.55 f9273_0_transfer_Load(c, c1, x8:0, x6:0, x7:0) -> f9404_0_transfer_NONNULL(c2, c3, x8:0, x9:0, x6:0, x7:0) :|: c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)) && (x6:0 > x10:0 && x6:0 > -1 && x7:0 > -1 && x8:0 < x7:0) 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 f9404_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f9273_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 24.26/9.55 24.26/9.55 Found the following polynomial interpretation: 24.26/9.55 [f9273_0_transfer_Load(x, x1, x2, x3, x4)] = c*x + c1*x1 - x2 + x3 + x4 24.26/9.55 [f9404_0_transfer_NONNULL(x5, x6, x7, x8, x9, x10)] = -1 + x10 + c5*x5 + c6*x6 - x7 + x9 24.26/9.55 24.26/9.55 The following rules are decreasing: 24.26/9.55 f9273_0_transfer_Load(c, c1, x8:0, x6:0, x7:0) -> f9404_0_transfer_NONNULL(c2, c3, x8:0, x9:0, x6:0, x7:0) :|: c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)) && (x6:0 > x10:0 && x6:0 > -1 && x7:0 > -1 && x8:0 < x7:0) 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 The following rules are bounded: 24.26/9.55 f9273_0_transfer_Load(c, c1, x8:0, x6:0, x7:0) -> f9404_0_transfer_NONNULL(c2, c3, x8:0, x9:0, x6:0, x7:0) :|: c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)) && (x6:0 > x10:0 && x6:0 > -1 && x7:0 > -1 && x8:0 < x7:0) 24.26/9.55 24.26/9.55 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 24.26/9.55 Rules: 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 f9404_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f9273_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 24.26/9.55 24.26/9.55 Found the following polynomial interpretation: 24.26/9.55 [f9273_0_transfer_Load(x, x1, x2, x3, x4)] = c*x + c1*x1 24.26/9.55 [f9404_0_transfer_NONNULL(x5, x6, x7, x8, x9, x10)] = 1 + c5*x5 + c6*x6 24.26/9.55 24.26/9.55 The following rules are decreasing: 24.26/9.55 f9404_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f9273_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 24.26/9.55 The following rules are bounded: 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 f9404_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f9273_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 24.26/9.55 24.26/9.55 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 - IntTRS 24.26/9.55 - RankingReductionPairProof 24.26/9.55 24.26/9.55 Rules: 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 24.26/9.55 Interpretation: 24.26/9.55 [ f9273_0_transfer_Load ] = f9273_0_transfer_Load_5 + -1*f9273_0_transfer_Load_3 24.26/9.55 [ f9404_0_transfer_NONNULL ] = 0 24.26/9.55 24.26/9.55 The following rules are decreasing: 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 24.26/9.55 The following rules are bounded: 24.26/9.55 f9273_0_transfer_Load(c4, c5, x13:0, x11:0, x12:0) -> f9273_0_transfer_Load(c6, c7, c8, x11:0, x12:0) :|: c8 = x13:0 + 1 && (c7 = 0 && (c6 = 0 && (c5 = 0 && c4 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 - IntTRS 24.26/9.55 - PolynomialOrderProcessor 24.26/9.55 - IntTRS 24.26/9.55 - RankingReductionPairProof 24.26/9.55 - IntTRS 24.26/9.55 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(c9, c10, i3909:0:0, c11, i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(c12, c13, i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i3750:0:0 > -1 && i3938:0:0 < i3750:0:0) 24.26/9.55 24.26/9.55 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (17) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: i3750:0:0 > -1 && i3938:0:0 < i3750:0:0 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (18) IRSwTTerminationDigraphProof (EQUIVALENT) 24.26/9.55 Constructed termination digraph! 24.26/9.55 Nodes: 24.26/9.55 (1) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: i3750:0:0 > -1 && i3938:0:0 < i3750:0:0 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (19) 24.26/9.55 Obligation: 24.26/9.55 24.26/9.55 Termination digraph: 24.26/9.55 Nodes: 24.26/9.55 (1) f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), i3909:0:0, o4255:0:0, i3750:0:0, i3908:0:0) :|: i3750:0:0 > -1 && i3938:0:0 < i3750:0:0 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (20) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 24.26/9.55 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 24.26/9.55 24.26/9.55 f9404_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6) -> f9404_0_transfer_NONNULL(x1, x2, x4, x5, x6) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (21) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3750:0:0, i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), o4255:0:0, i3750:0:0, i3908:0:0) :|: i3750:0:0 > -1 && i3938:0:0 < i3750:0:0 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (22) TempFilterProof (SOUND) 24.26/9.55 Used the following sort dictionary for filtering: 24.26/9.55 f9404_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, INTEGER, VARIABLE) 24.26/9.55 java.lang.Object(VARIABLE) 24.26/9.55 ARRAY(VARIABLE) 24.26/9.55 javaUtilEx.HashMap$Entry(VARIABLE) 24.26/9.55 Removed predefined arithmetic. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (23) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), o4255:0:0, i3908:0:0) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (24) IRSwTToQDPProof (SOUND) 24.26/9.55 Removed the integers and created a QDP-Problem. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (25) 24.26/9.55 Obligation: 24.26/9.55 Q DP problem: 24.26/9.55 The TRS P consists of the following rules: 24.26/9.55 24.26/9.55 f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), o4255:0:0, i3908:0:0) 24.26/9.55 24.26/9.55 R is empty. 24.26/9.55 Q is empty. 24.26/9.55 We have to consider all (P,Q,R)-chains. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (26) QDPSizeChangeProof (EQUIVALENT) 24.26/9.55 By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 24.26/9.55 24.26/9.55 From the DPs we obtained the following set of size-change graphs: 24.26/9.55 *f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o4255:0:0)), i3908:0:0) -> f9404_0_transfer_NONNULL(java.lang.Object(ARRAY(i3750:0:0)), java.lang.Object(ARRAY(i3908:0:0)), o4255:0:0, i3908:0:0) 24.26/9.55 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 2 > 4, 4 >= 4 24.26/9.55 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (27) 24.26/9.55 YES 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (28) 24.26/9.55 Obligation: 24.26/9.55 SCC of termination graph based on JBC Program. 24.26/9.55 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 24.26/9.55 SCC calls the following helper methods: javaUtilEx.Content.equals(Ljava/lang/Object;)Z 24.26/9.55 Performed SCC analyses: 24.26/9.55 *Used field analysis yielded the following read fields: 24.26/9.55 *javaUtilEx.HashMap$Entry: [hash, next, key] 24.26/9.55 *Marker field analysis yielded the following relations that could be markers: 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (29) SCCToIRSProof (SOUND) 24.26/9.55 Transformed FIGraph SCCs to intTRSs. Log: 24.26/9.55 Generated rules. Obtained 57 IRulesP rules: 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub), java.lang.Object(o3772sub)) -> f8691_0_put_NULL(EOS(STATIC_8691), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub), java.lang.Object(o3772sub)) :|: TRUE 24.26/9.55 f8691_0_put_NULL(EOS(STATIC_8691), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub), java.lang.Object(o3772sub)) -> f8694_0_put_Load(EOS(STATIC_8694), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub)) :|: TRUE 24.26/9.55 f8694_0_put_Load(EOS(STATIC_8694), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub)) -> f8697_0_put_FieldAccess(EOS(STATIC_8697), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(o3772sub), java.lang.Object(o3772sub)) :|: TRUE 24.26/9.55 f8697_0_put_FieldAccess(EOS(STATIC_8697), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) -> f8700_0_put_FieldAccess(EOS(STATIC_8700), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) :|: TRUE 24.26/9.55 f8700_0_put_FieldAccess(EOS(STATIC_8700), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) -> f8703_0_put_Load(EOS(STATIC_8703), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469) :|: TRUE 24.26/9.55 f8703_0_put_Load(EOS(STATIC_8703), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469) -> f8706_0_put_NE(EOS(STATIC_8706), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469, i3464) :|: TRUE 24.26/9.55 f8706_0_put_NE(EOS(STATIC_8706), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469, i3464) -> f8709_0_put_NE(EOS(STATIC_8709), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469, i3464) :|: !(i3469 = i3464) 24.26/9.55 f8706_0_put_NE(EOS(STATIC_8706), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), i3464, i3464) -> f8710_0_put_NE(EOS(STATIC_8710), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), i3464, i3464) :|: i3469 = i3464 24.26/9.55 f8709_0_put_NE(EOS(STATIC_8709), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774)), i3469, i3464) -> f8713_0_put_Load(EOS(STATIC_8713), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) :|: !(i3469 = i3464) 24.26/9.55 f8713_0_put_Load(EOS(STATIC_8713), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) -> f8717_0_put_FieldAccess(EOS(STATIC_8717), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) :|: TRUE 24.26/9.55 f8717_0_put_FieldAccess(EOS(STATIC_8717), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469, o3776, o3774))) -> f8721_0_put_Store(EOS(STATIC_8721), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8721_0_put_Store(EOS(STATIC_8721), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) -> f8725_0_put_JMP(EOS(STATIC_8725), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8725_0_put_JMP(EOS(STATIC_8725), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) -> f8729_0_put_Load(EOS(STATIC_8729), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8729_0_put_Load(EOS(STATIC_8729), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) -> f8687_0_put_Load(EOS(STATIC_8687), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8687_0_put_Load(EOS(STATIC_8687), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3761) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3761, o3761) :|: TRUE 24.26/9.55 f8710_0_put_NE(EOS(STATIC_8710), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), i3464, i3464) -> f8714_0_put_Load(EOS(STATIC_8714), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774))) :|: TRUE 24.26/9.55 f8714_0_put_Load(EOS(STATIC_8714), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774))) -> f8718_0_put_FieldAccess(EOS(STATIC_8718), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774))) :|: TRUE 24.26/9.55 f8718_0_put_FieldAccess(EOS(STATIC_8718), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774))) -> f8722_0_put_Duplicate(EOS(STATIC_8722), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774) :|: TRUE 24.26/9.55 f8722_0_put_Duplicate(EOS(STATIC_8722), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774) -> f8726_0_put_Store(EOS(STATIC_8726), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774, o3774) :|: TRUE 24.26/9.55 f8726_0_put_Store(EOS(STATIC_8726), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774, o3774) -> f8730_0_put_Load(EOS(STATIC_8730), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774, o3774) :|: TRUE 24.26/9.55 f8730_0_put_Load(EOS(STATIC_8730), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774, o3774) -> f8733_0_put_EQ(EOS(STATIC_8733), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, o3774)), o3774, o3774, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8733_0_put_EQ(EOS(STATIC_8733), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f8735_0_put_EQ(EOS(STATIC_8735), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8733_0_put_EQ(EOS(STATIC_8733), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f8736_0_put_EQ(EOS(STATIC_8736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8735_0_put_EQ(EOS(STATIC_8735), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f8739_0_put_Load(EOS(STATIC_8739), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub)) :|: TRUE 24.26/9.55 f8739_0_put_Load(EOS(STATIC_8739), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub)) -> f8742_0_put_Load(EOS(STATIC_8742), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8742_0_put_Load(EOS(STATIC_8742), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f8746_0_put_InvokeMethod(EOS(STATIC_8746), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) :|: TRUE 24.26/9.55 f8746_0_put_InvokeMethod(EOS(STATIC_8746), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) -> f8749_0_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) :|: TRUE 24.26/9.55 f8746_0_put_InvokeMethod(EOS(STATIC_8746), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) -> f8749_1_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) :|: TRUE 24.26/9.55 f8749_0_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) -> f9620_0_equals_Load(EOS(STATIC_9620), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3791sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub)) :|: TRUE 24.26/9.55 f8768_0_equals_Return(EOS(STATIC_8768), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub))), matching1) -> f8779_0_put_EQ(EOS(STATIC_8779), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub))), 0) :|: TRUE && matching1 = 0 24.26/9.55 f8779_0_put_EQ(EOS(STATIC_8779), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub))), matching1) -> f8783_0_put_Load(EOS(STATIC_8783), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub)))) :|: TRUE && matching1 = 0 24.26/9.55 f8783_0_put_Load(EOS(STATIC_8783), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub)))) -> f8789_0_put_FieldAccess(EOS(STATIC_8789), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub)))) :|: TRUE 24.26/9.55 f8789_0_put_FieldAccess(EOS(STATIC_8789), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub)))) -> f8795_0_put_Store(EOS(STATIC_8795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8795_0_put_Store(EOS(STATIC_8795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) -> f8721_0_put_Store(EOS(STATIC_8721), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8769_0_equals_Return(EOS(STATIC_8769), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f8771_0_equals_Return(EOS(STATIC_8771), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 24.26/9.55 f8771_0_equals_Return(EOS(STATIC_8771), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC)))), i3620) -> f8780_0_put_EQ(EOS(STATIC_8780), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC)))), i3620) :|: TRUE 24.26/9.55 f8780_0_put_EQ(EOS(STATIC_8780), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f8785_0_put_EQ(EOS(STATIC_8785), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 24.26/9.55 f8785_0_put_EQ(EOS(STATIC_8785), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f8791_0_put_Load(EOS(STATIC_8791), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE && matching1 = 0 24.26/9.55 f8791_0_put_Load(EOS(STATIC_8791), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC))))) -> f8797_0_put_FieldAccess(EOS(STATIC_8797), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE 24.26/9.55 f8797_0_put_FieldAccess(EOS(STATIC_8797), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3920, java.lang.Object(javaUtilEx.Content(EOC))))) -> f8801_0_put_Store(EOS(STATIC_8801), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3920) :|: TRUE 24.26/9.55 f8801_0_put_Store(EOS(STATIC_8801), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3920) -> f8721_0_put_Store(EOS(STATIC_8721), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3920) :|: TRUE 24.26/9.55 f8770_0_equals_Return(EOS(STATIC_8770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f8771_0_equals_Return(EOS(STATIC_8771), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE && matching1 = 1 24.26/9.55 f8736_0_put_EQ(EOS(STATIC_8736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f8740_0_put_Load(EOS(STATIC_8740), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL) :|: TRUE 24.26/9.55 f8740_0_put_Load(EOS(STATIC_8740), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL) -> f8743_0_put_Load(EOS(STATIC_8743), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8743_0_put_Load(EOS(STATIC_8743), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f8747_0_put_InvokeMethod(EOS(STATIC_8747), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 24.26/9.55 f8747_0_put_InvokeMethod(EOS(STATIC_8747), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f8750_0_equals_Load(EOS(STATIC_8750), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 24.26/9.55 f8747_0_put_InvokeMethod(EOS(STATIC_8747), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f8750_1_equals_Load(EOS(STATIC_8750), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 24.26/9.55 f8750_0_equals_Load(EOS(STATIC_8750), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f9676_0_equals_Load(EOS(STATIC_9676), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 24.26/9.55 f8773_0_equals_Return(EOS(STATIC_8773), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), matching1) -> f8781_0_put_EQ(EOS(STATIC_8781), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), 0) :|: TRUE && matching1 = 0 24.26/9.55 f8781_0_put_EQ(EOS(STATIC_8781), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), matching1) -> f8786_0_put_Load(EOS(STATIC_8786), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL))) :|: TRUE && matching1 = 0 24.26/9.55 f8786_0_put_Load(EOS(STATIC_8786), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL))) -> f8792_0_put_FieldAccess(EOS(STATIC_8792), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL))) :|: TRUE 24.26/9.55 f8792_0_put_FieldAccess(EOS(STATIC_8792), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL))) -> f8798_0_put_Store(EOS(STATIC_8798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8798_0_put_Store(EOS(STATIC_8798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) -> f8721_0_put_Store(EOS(STATIC_8721), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, o3776) :|: TRUE 24.26/9.55 f8749_1_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3855sub)) -> f8768_0_equals_Return(EOS(STATIC_8768), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(o3855sub))), 0) :|: TRUE 24.26/9.55 f8749_1_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8769_0_equals_Return(EOS(STATIC_8769), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE 24.26/9.55 f8749_1_equals_Load(EOS(STATIC_8749), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8770_0_equals_Return(EOS(STATIC_8770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE 24.26/9.55 f8750_1_equals_Load(EOS(STATIC_8750), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f8773_0_equals_Return(EOS(STATIC_8773), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464, o3776, NULL)), 0) :|: TRUE 24.26/9.55 Combined rules. Obtained 7 IRulesP rules: 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, o3776:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469:0, o3776:0, o3774:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469:0, o3776:0, o3774:0))) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, o3776:0, o3776:0) :|: i3469:0 < i3464:0 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469:0, o3776:0, o3774:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3469:0, o3776:0, o3774:0))) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, o3776:0, o3776:0) :|: i3469:0 > i3464:0 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(o3791sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(o3791sub:0)))) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, o3776:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(javaUtilEx.Content(EOC))))) -> f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, o3776:0, o3776:0) :|: TRUE 24.26/9.55 Removed following non-SCC rules: 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(o3791sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(o3791sub:0)))) -> f9620_0_equals_Load(EOS(STATIC_9620), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub:0), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, java.lang.Object(o3791sub:0))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3791sub:0)) :|: TRUE 24.26/9.55 f8689_0_put_NULL(EOS(STATIC_8689), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3464:0, o3776:0, NULL))) -> f9676_0_equals_Load(EOS(STATIC_9676), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 24.26/9.55 Filtered constant ground arguments: 24.26/9.55 f8689_0_put_NULL(x1, x2, x3, x4, x5, x6, x7) -> f8689_0_put_NULL(x5, x6, x7) 24.26/9.55 EOS(x1) -> EOS 24.26/9.55 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 24.26/9.55 javaUtilEx.Content(x1) -> javaUtilEx.Content 24.26/9.55 javaUtilEx.HashMap$Entry(x1, x2, x3, x4) -> javaUtilEx.HashMap$Entry(x2, x3, x4) 24.26/9.55 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 24.26/9.55 Filtered duplicate arguments: 24.26/9.55 f8689_0_put_NULL(x1, x2, x3) -> f8689_0_put_NULL(x1, x3) 24.26/9.55 Finished conversion. Obtained 5 rules.P rules: 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3469:0, o3776:0, o3774:0))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: i3469:0 < i3464:0 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3469:0, o3776:0, o3774:0))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: i3469:0 > i3464:0 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, java.lang.Object(o3791sub:0)))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (30) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f8689_0_put_NULL(x, x2) :|: x1 < x 24.26/9.55 f8689_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f8689_0_put_NULL(x4, x6) :|: x5 > x4 24.26/9.55 f8689_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f8689_0_put_NULL(x8, x9) :|: TRUE 24.26/9.55 f8689_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11, x12) :|: TRUE 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (31) IRSFormatTransformerProof (EQUIVALENT) 24.26/9.55 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (32) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f8689_0_put_NULL(x, x2) :|: x1 < x 24.26/9.55 f8689_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f8689_0_put_NULL(x4, x6) :|: x5 > x4 24.26/9.55 f8689_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f8689_0_put_NULL(x8, x9) :|: TRUE 24.26/9.55 f8689_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11, x12) :|: TRUE 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (33) IRSwTTerminationDigraphProof (EQUIVALENT) 24.26/9.55 Constructed termination digraph! 24.26/9.55 Nodes: 24.26/9.55 (1) f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 (2) f8689_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f8689_0_put_NULL(x, x2) :|: x1 < x 24.26/9.55 (3) f8689_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f8689_0_put_NULL(x4, x6) :|: x5 > x4 24.26/9.55 (4) f8689_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f8689_0_put_NULL(x8, x9) :|: TRUE 24.26/9.55 (5) f8689_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11, x12) :|: TRUE 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1), (2), (3), (4), (5) 24.26/9.55 (2) -> (1), (2), (3), (4), (5) 24.26/9.55 (3) -> (1), (2), (3), (4), (5) 24.26/9.55 (4) -> (1), (2), (3), (4), (5) 24.26/9.55 (5) -> (1), (2), (3), (4), (5) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (34) 24.26/9.55 Obligation: 24.26/9.55 24.26/9.55 Termination digraph: 24.26/9.55 Nodes: 24.26/9.55 (1) f8689_0_put_NULL(i3464:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0, o3776:0, NULL))) -> f8689_0_put_NULL(i3464:0, o3776:0) :|: TRUE 24.26/9.55 (2) f8689_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f8689_0_put_NULL(x, x2) :|: x1 < x 24.26/9.55 (3) f8689_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f8689_0_put_NULL(x4, x6) :|: x5 > x4 24.26/9.55 (4) f8689_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f8689_0_put_NULL(x8, x9) :|: TRUE 24.26/9.55 (5) f8689_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11, x12) :|: TRUE 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1), (2), (3), (4), (5) 24.26/9.55 (2) -> (1), (2), (3), (4), (5) 24.26/9.55 (3) -> (1), (2), (3), (4), (5) 24.26/9.55 (4) -> (1), (2), (3), (4), (5) 24.26/9.55 (5) -> (1), (2), (3), (4), (5) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (35) IntTRSCompressionProof (EQUIVALENT) 24.26/9.55 Compressed rules. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (36) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8689_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f8689_0_put_NULL(x4:0, x6:0) :|: x5:0 > x4:0 24.26/9.55 f8689_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f8689_0_put_NULL(x:0, x2:0) :|: x:0 > x1:0 24.26/9.55 f8689_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f8689_0_put_NULL(x8:0, x9:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11:0, x12:0) :|: TRUE 24.26/9.55 f8689_0_put_NULL(i3464:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0:0, o3776:0:0, NULL))) -> f8689_0_put_NULL(i3464:0:0, o3776:0:0) :|: TRUE 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (37) TempFilterProof (SOUND) 24.26/9.55 Used the following sort dictionary for filtering: 24.26/9.55 f8689_0_put_NULL(VARIABLE, VARIABLE) 24.26/9.55 java.lang.Object(VARIABLE) 24.26/9.55 javaUtilEx.HashMap$Entry(VARIABLE, VARIABLE, VARIABLE) 24.26/9.55 javaUtilEx.Content() 24.26/9.55 NULL() 24.26/9.55 Removed predefined arithmetic. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (38) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8689_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f8689_0_put_NULL(x4:0, x6:0) 24.26/9.55 f8689_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f8689_0_put_NULL(x8:0, x9:0) 24.26/9.55 f8689_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11:0, x12:0) 24.26/9.55 f8689_0_put_NULL(i3464:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0:0, o3776:0:0, NULL))) -> f8689_0_put_NULL(i3464:0:0, o3776:0:0) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (39) IRSwTToQDPProof (SOUND) 24.26/9.55 Removed the integers and created a QDP-Problem. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (40) 24.26/9.55 Obligation: 24.26/9.55 Q DP problem: 24.26/9.55 The TRS P consists of the following rules: 24.26/9.55 24.26/9.55 f8689_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f8689_0_put_NULL(x4:0, x6:0) 24.26/9.55 f8689_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f8689_0_put_NULL(x8:0, x9:0) 24.26/9.55 f8689_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11:0, x12:0) 24.26/9.55 f8689_0_put_NULL(i3464:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0:0, o3776:0:0, NULL))) -> f8689_0_put_NULL(i3464:0:0, o3776:0:0) 24.26/9.55 24.26/9.55 R is empty. 24.26/9.55 Q is empty. 24.26/9.55 We have to consider all (P,Q,R)-chains. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (41) QDPSizeChangeProof (EQUIVALENT) 24.26/9.55 By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 24.26/9.55 24.26/9.55 From the DPs we obtained the following set of size-change graphs: 24.26/9.55 *f8689_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f8689_0_put_NULL(x4:0, x6:0) 24.26/9.55 The graph contains the following edges 1 >= 1, 2 > 2 24.26/9.55 24.26/9.55 24.26/9.55 *f8689_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f8689_0_put_NULL(x8:0, x9:0) 24.26/9.55 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 24.26/9.55 24.26/9.55 24.26/9.55 *f8689_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f8689_0_put_NULL(x11:0, x12:0) 24.26/9.55 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 24.26/9.55 24.26/9.55 24.26/9.55 *f8689_0_put_NULL(i3464:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3464:0:0, o3776:0:0, NULL))) -> f8689_0_put_NULL(i3464:0:0, o3776:0:0) 24.26/9.55 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 24.26/9.55 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (42) 24.26/9.55 YES 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (43) 24.26/9.55 Obligation: 24.26/9.55 SCC of termination graph based on JBC Program. 24.26/9.55 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreate.createMap(I)LjavaUtilEx/HashMap; 24.26/9.55 SCC calls the following helper methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;, javaUtilEx.Content.hashCode()I, javaUtilEx.Content.equals(Ljava/lang/Object;)Z 24.26/9.55 Performed SCC analyses: 24.26/9.55 *Used field analysis yielded the following read fields: 24.26/9.55 *java.lang.String: [count] 24.26/9.55 *Marker field analysis yielded the following relations that could be markers: 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (44) SCCToIRSProof (SOUND) 24.26/9.55 Transformed FIGraph SCCs to intTRSs. Log: 24.26/9.55 Generated rules. Obtained 81 IRulesP rules: 24.26/9.55 f8293_0_createMap_LE(EOS(STATIC_8293(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227) -> f8297_0_createMap_LE(EOS(STATIC_8297(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227) :|: TRUE 24.26/9.55 f8297_0_createMap_LE(EOS(STATIC_8297(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227) -> f8302_0_createMap_New(EOS(STATIC_8302(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: i3227 > 0 24.26/9.55 f8302_0_createMap_New(EOS(STATIC_8302(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8307_0_createMap_Duplicate(EOS(STATIC_8307(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8307_0_createMap_Duplicate(EOS(STATIC_8307(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f8311_0_createMap_InvokeMethod(EOS(STATIC_8311(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8311_0_createMap_InvokeMethod(EOS(STATIC_8311(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8315_0_random_FieldAccess(EOS(STATIC_8315(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8315_0_random_FieldAccess(EOS(STATIC_8315(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8325_0_random_FieldAccess(EOS(STATIC_8325(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3558sub)) :|: TRUE 24.26/9.55 f8325_0_random_FieldAccess(EOS(STATIC_8325(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3558sub)) -> f8330_0_random_ArrayAccess(EOS(STATIC_8330(java.lang.Object(o3558sub), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3558sub), i3208) :|: TRUE 24.26/9.55 f8330_0_random_ArrayAccess(EOS(STATIC_8330(java.lang.Object(ARRAY(i3255)), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3208) -> f8335_0_random_ArrayAccess(EOS(STATIC_8335(java.lang.Object(ARRAY(i3255)), i3208)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3208) :|: i3255 >= 0 24.26/9.55 f8335_0_random_ArrayAccess(EOS(STATIC_8335(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3257) -> f8340_0_random_ArrayAccess(EOS(STATIC_8340(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3257) :|: TRUE 24.26/9.55 f8340_0_random_ArrayAccess(EOS(STATIC_8340(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3257) -> f8346_0_random_ArrayAccess(EOS(STATIC_8346(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3257) :|: TRUE 24.26/9.55 f8346_0_random_ArrayAccess(EOS(STATIC_8346(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3257) -> f8351_0_random_Store(EOS(STATIC_8351(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) :|: i3257 < i3255 24.26/9.55 f8351_0_random_Store(EOS(STATIC_8351(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) -> f8356_0_random_FieldAccess(EOS(STATIC_8356(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) :|: TRUE 24.26/9.55 f8356_0_random_FieldAccess(EOS(STATIC_8356(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) -> f8361_0_random_ConstantStackPush(EOS(STATIC_8361(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3257) :|: TRUE 24.26/9.55 f8361_0_random_ConstantStackPush(EOS(STATIC_8361(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3257) -> f8366_0_random_IntArithmetic(EOS(STATIC_8366(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3257, 1) :|: TRUE 24.26/9.55 f8366_0_random_IntArithmetic(EOS(STATIC_8366(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3257, matching1) -> f8371_0_random_FieldAccess(EOS(STATIC_8371(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3257 + 1) :|: i3257 >= 0 && matching1 = 1 24.26/9.55 f8371_0_random_FieldAccess(EOS(STATIC_8371(java.lang.Object(ARRAY(i3255)), i3257)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589, i3260) -> f8377_0_random_Load(EOS(STATIC_8377(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) :|: TRUE 24.26/9.55 f8377_0_random_Load(EOS(STATIC_8377(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) -> f8383_0_random_InvokeMethod(EOS(STATIC_8383(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3589) :|: TRUE 24.26/9.55 f8383_0_random_InvokeMethod(EOS(STATIC_8383(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3599sub)) -> f8387_0_random_InvokeMethod(EOS(STATIC_8387(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3599sub)) :|: TRUE 24.26/9.55 f8387_0_random_InvokeMethod(EOS(STATIC_8387(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) -> f8393_0_random_InvokeMethod(EOS(STATIC_8393(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) :|: TRUE 24.26/9.55 f8393_0_random_InvokeMethod(EOS(STATIC_8393(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) -> f8399_0_length_Load(EOS(STATIC_8399(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) :|: TRUE 24.26/9.55 f8399_0_length_Load(EOS(STATIC_8399(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) -> f8410_0_length_FieldAccess(EOS(STATIC_8410(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3605sub)) :|: TRUE 24.26/9.55 f8410_0_length_FieldAccess(EOS(STATIC_8410(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3265))) -> f8416_0_length_FieldAccess(EOS(STATIC_8416(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3265))) :|: i3265 >= 0 24.26/9.55 f8416_0_length_FieldAccess(EOS(STATIC_8416(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3265))) -> f8420_0_length_Return(EOS(STATIC_8420(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8420_0_length_Return(EOS(STATIC_8420(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8425_0_random_Return(EOS(STATIC_8425(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8425_0_random_Return(EOS(STATIC_8425(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8431_0_createMap_InvokeMethod(EOS(STATIC_8431(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8431_0_createMap_InvokeMethod(EOS(STATIC_8431(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8435_0__init__Load(EOS(STATIC_8435(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8435_0__init__Load(EOS(STATIC_8435(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8446_0__init__InvokeMethod(EOS(STATIC_8446(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8446_0__init__InvokeMethod(EOS(STATIC_8446(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265, java.lang.Object(javaUtilEx.Content(EOC))) -> f8450_0__init__Load(EOS(STATIC_8450(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8450_0__init__Load(EOS(STATIC_8450(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8456_0__init__Load(EOS(STATIC_8456(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3265, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8456_0__init__Load(EOS(STATIC_8456(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3265, java.lang.Object(javaUtilEx.Content(EOC))) -> f8462_0__init__FieldAccess(EOS(STATIC_8462(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) :|: TRUE 24.26/9.55 f8462_0__init__FieldAccess(EOS(STATIC_8462(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3265) -> f8468_0__init__Return(EOS(STATIC_8468(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8468_0__init__Return(EOS(STATIC_8468(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f8474_0_createMap_Store(EOS(STATIC_8474(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8474_0_createMap_Store(EOS(STATIC_8474(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f8480_0_createMap_New(EOS(STATIC_8480(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8480_0_createMap_New(EOS(STATIC_8480(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f8486_0_createMap_Duplicate(EOS(STATIC_8486(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8486_0_createMap_Duplicate(EOS(STATIC_8486(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8492_0_createMap_InvokeMethod(EOS(STATIC_8492(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8492_0_createMap_InvokeMethod(EOS(STATIC_8492(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8498_0_random_FieldAccess(EOS(STATIC_8498(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8498_0_random_FieldAccess(EOS(STATIC_8498(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8507_0_random_FieldAccess(EOS(STATIC_8507(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255))) :|: TRUE 24.26/9.55 f8507_0_random_FieldAccess(EOS(STATIC_8507(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255))) -> f8511_0_random_ArrayAccess(EOS(STATIC_8511(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3260) :|: TRUE 24.26/9.55 f8511_0_random_ArrayAccess(EOS(STATIC_8511(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3260) -> f8515_0_random_ArrayAccess(EOS(STATIC_8515(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3260) :|: TRUE 24.26/9.55 f8515_0_random_ArrayAccess(EOS(STATIC_8515(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3255)), i3260) -> f8519_0_random_Store(EOS(STATIC_8519(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) :|: i3260 < i3255 24.26/9.55 f8519_0_random_Store(EOS(STATIC_8519(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) -> f8523_0_random_FieldAccess(EOS(STATIC_8523(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) :|: TRUE 24.26/9.55 f8523_0_random_FieldAccess(EOS(STATIC_8523(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) -> f8524_0_random_ConstantStackPush(EOS(STATIC_8524(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3260) :|: TRUE 24.26/9.55 f8524_0_random_ConstantStackPush(EOS(STATIC_8524(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3260) -> f8527_0_random_IntArithmetic(EOS(STATIC_8527(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3260, 1) :|: TRUE 24.26/9.55 f8527_0_random_IntArithmetic(EOS(STATIC_8527(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3260, matching1) -> f8529_0_random_FieldAccess(EOS(STATIC_8529(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3260 + 1) :|: i3260 > 0 && matching1 = 1 24.26/9.55 f8529_0_random_FieldAccess(EOS(STATIC_8529(java.lang.Object(ARRAY(i3255)), i3260)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686, i3348) -> f8530_0_random_Load(EOS(STATIC_8530(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) :|: TRUE 24.26/9.55 f8530_0_random_Load(EOS(STATIC_8530(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) -> f8532_0_random_InvokeMethod(EOS(STATIC_8532(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o3686) :|: TRUE 24.26/9.55 f8532_0_random_InvokeMethod(EOS(STATIC_8532(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3699sub)) -> f8534_0_random_InvokeMethod(EOS(STATIC_8534(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3699sub)) :|: TRUE 24.26/9.55 f8534_0_random_InvokeMethod(EOS(STATIC_8534(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) -> f8536_0_random_InvokeMethod(EOS(STATIC_8536(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) :|: TRUE 24.26/9.55 f8536_0_random_InvokeMethod(EOS(STATIC_8536(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) -> f8539_0_length_Load(EOS(STATIC_8539(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) :|: TRUE 24.26/9.55 f8539_0_length_Load(EOS(STATIC_8539(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) -> f8542_0_length_FieldAccess(EOS(STATIC_8542(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o3700sub)) :|: TRUE 24.26/9.55 f8542_0_length_FieldAccess(EOS(STATIC_8542(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3361))) -> f8545_0_length_FieldAccess(EOS(STATIC_8545(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3361))) :|: i3361 >= 0 24.26/9.55 f8545_0_length_FieldAccess(EOS(STATIC_8545(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(java.lang.String(EOC, i3361))) -> f8547_0_length_Return(EOS(STATIC_8547(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8547_0_length_Return(EOS(STATIC_8547(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8549_0_random_Return(EOS(STATIC_8549(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8549_0_random_Return(EOS(STATIC_8549(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8552_0_createMap_InvokeMethod(EOS(STATIC_8552(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8552_0_createMap_InvokeMethod(EOS(STATIC_8552(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8554_0__init__Load(EOS(STATIC_8554(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8554_0__init__Load(EOS(STATIC_8554(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8559_0__init__InvokeMethod(EOS(STATIC_8559(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8559_0__init__InvokeMethod(EOS(STATIC_8559(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361, java.lang.Object(javaUtilEx.Content(EOC))) -> f8561_0__init__Load(EOS(STATIC_8561(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8561_0__init__Load(EOS(STATIC_8561(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8564_0__init__Load(EOS(STATIC_8564(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8564_0__init__Load(EOS(STATIC_8564(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361, java.lang.Object(javaUtilEx.Content(EOC))) -> f8567_0__init__FieldAccess(EOS(STATIC_8567(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) :|: TRUE 24.26/9.55 f8567_0__init__FieldAccess(EOS(STATIC_8567(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3361) -> f8570_0__init__Return(EOS(STATIC_8570(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8570_0__init__Return(EOS(STATIC_8570(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8573_0_createMap_Store(EOS(STATIC_8573(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8573_0_createMap_Store(EOS(STATIC_8573(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8576_0_createMap_Load(EOS(STATIC_8576(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8576_0_createMap_Load(EOS(STATIC_8576(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8579_0_createMap_Load(EOS(STATIC_8579(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8579_0_createMap_Load(EOS(STATIC_8579(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8582_0_createMap_Load(EOS(STATIC_8582(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8582_0_createMap_Load(EOS(STATIC_8582(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f8585_0_createMap_InvokeMethod(EOS(STATIC_8585(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8585_0_createMap_InvokeMethod(EOS(STATIC_8585(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8588_0_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3255)), i3348)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: i3228 >= 1 && i3227 >= 1 && i3348 > 1 && i3228 >= i3227 24.26/9.55 f8585_0_createMap_InvokeMethod(EOS(STATIC_8585(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8588_1_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3255)), i3348)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: i3228 >= 1 && i3227 >= 1 && i3348 > 1 && i3228 >= i3227 24.26/9.55 f8588_0_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3255)), i3348)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9890_0_put_Load(EOS(STATIC_9890(java.lang.Object(ARRAY(i3255)), i3348)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 24.26/9.55 f8835_0_put_Return(EOS(STATIC_8835(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8838_0_createMap_StackPop(EOS(STATIC_8838(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8838_0_createMap_StackPop(EOS(STATIC_8838(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8841_0_createMap_Inc(EOS(STATIC_8841(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8841_0_createMap_Inc(EOS(STATIC_8841(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8844_0_createMap_JMP(EOS(STATIC_8844(java.lang.Object(ARRAY(i3692)), i3694)), i3227 + -1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8844_0_createMap_JMP(EOS(STATIC_8844(java.lang.Object(ARRAY(i3692)), i3694)), i3695, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8847_0_createMap_Load(EOS(STATIC_8847(java.lang.Object(ARRAY(i3692)), i3694)), i3695, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8847_0_createMap_Load(EOS(STATIC_8847(java.lang.Object(ARRAY(i3692)), i3694)), i3695, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8290_0_createMap_Load(EOS(STATIC_8290(java.lang.Object(ARRAY(i3692)), i3694)), i3695, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8290_0_createMap_Load(EOS(STATIC_8290(java.lang.Object(o3558sub), i3208)), i3210, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8293_0_createMap_LE(EOS(STATIC_8293(java.lang.Object(o3558sub), i3208)), i3210, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3210) :|: TRUE 24.26/9.55 f8891_0_put_Return(EOS(STATIC_8891(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f8894_0_createMap_StackPop(EOS(STATIC_8894(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 24.26/9.55 f8894_0_createMap_StackPop(EOS(STATIC_8894(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f8897_0_createMap_Inc(EOS(STATIC_8897(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8897_0_createMap_Inc(EOS(STATIC_8897(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f8841_0_createMap_Inc(EOS(STATIC_8841(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f9331_0_put_Return(EOS(STATIC_9331(java.lang.Object(ARRAY(i3928)), i3930)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f8891_0_put_Return(EOS(STATIC_8891(java.lang.Object(ARRAY(i3928)), i3930)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 24.26/9.55 f8588_1_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8835_0_put_Return(EOS(STATIC_8835(java.lang.Object(ARRAY(i3692)), i3694)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 24.26/9.55 f8588_1_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f8891_0_put_Return(EOS(STATIC_8891(java.lang.Object(ARRAY(i3727)), i3729)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 24.26/9.55 f8588_1_put_Load(EOS(STATIC_8588(java.lang.Object(ARRAY(i3928)), i3930)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9331_0_put_Return(EOS(STATIC_9331(java.lang.Object(ARRAY(i3928)), i3930)), i3227, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 24.26/9.55 Combined rules. Obtained 2 IRulesP rules: 24.26/9.55 f8293_0_createMap_LE(EOS(STATIC_8293(java.lang.Object(ARRAY(i3255:0)), i3208:0)), i3227:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227:0) -> f8293_0_createMap_LE(EOS(STATIC_8293(java.lang.Object(ARRAY(i3255:0)), i3208:0 + 2)), i3227:0 - 1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227:0 - 1) :|: i3255:0 > i3208:0 + 1 && i3227:0 > 0 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 > 0 && i3228:0 >= i3227:0 24.26/9.55 Removed following non-SCC rules: 24.26/9.55 f8293_0_createMap_LE(EOS(STATIC_8293(java.lang.Object(ARRAY(i3255:0)), i3208:0)), i3227:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3227:0) -> f9890_0_put_Load(EOS(STATIC_9890(java.lang.Object(ARRAY(i3255:0)), i3208:0 + 2)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: i3255:0 > i3208:0 + 1 && i3227:0 > 0 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 > 0 && i3228:0 >= i3227:0 24.26/9.55 Filtered constant ground arguments: 24.26/9.55 f8293_0_createMap_LE(x1, x2, x3, x4) -> f8293_0_createMap_LE(x1, x2, x4) 24.26/9.55 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 24.26/9.55 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 24.26/9.55 Filtered duplicate arguments: 24.26/9.55 f8293_0_createMap_LE(x1, x2, x3) -> f8293_0_createMap_LE(x1, x3) 24.26/9.55 Finished conversion. Obtained 1 rules.P rules: 24.26/9.55 f8293_0_createMap_LE(i3227:0, i3255:0, i3208:0) -> f8293_0_createMap_LE(i3227:0 - 1, i3255:0, i3208:0 + 2) :|: i3227:0 > 0 && i3255:0 > i3208:0 + 1 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 >= i3227:0 && i3228:0 > 0 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (45) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8293_0_createMap_LE(i3227:0, i3255:0, i3208:0) -> f8293_0_createMap_LE(i3227:0 - 1, i3255:0, i3208:0 + 2) :|: i3227:0 > 0 && i3255:0 > i3208:0 + 1 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 >= i3227:0 && i3228:0 > 0 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (46) IRSFormatTransformerProof (EQUIVALENT) 24.26/9.55 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (47) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8293_0_createMap_LE(i3227:0, i3255:0, i3208:0) -> f8293_0_createMap_LE(arith, i3255:0, arith1) :|: i3227:0 > 0 && i3255:0 > i3208:0 + 1 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 >= i3227:0 && i3228:0 > 0 && arith = i3227:0 - 1 && arith1 = i3208:0 + 2 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (48) IRSwTTerminationDigraphProof (EQUIVALENT) 24.26/9.55 Constructed termination digraph! 24.26/9.55 Nodes: 24.26/9.55 (1) f8293_0_createMap_LE(i3227:0, i3255:0, i3208:0) -> f8293_0_createMap_LE(arith, i3255:0, arith1) :|: i3227:0 > 0 && i3255:0 > i3208:0 + 1 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 >= i3227:0 && i3228:0 > 0 && arith = i3227:0 - 1 && arith1 = i3208:0 + 2 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (49) 24.26/9.55 Obligation: 24.26/9.55 24.26/9.55 Termination digraph: 24.26/9.55 Nodes: 24.26/9.55 (1) f8293_0_createMap_LE(i3227:0, i3255:0, i3208:0) -> f8293_0_createMap_LE(arith, i3255:0, arith1) :|: i3227:0 > 0 && i3255:0 > i3208:0 + 1 && i3255:0 > -1 && i3208:0 > -1 && i3265:0 > -1 && i3361:0 > -1 && i3228:0 >= i3227:0 && i3228:0 > 0 && arith = i3227:0 - 1 && arith1 = i3208:0 + 2 24.26/9.55 24.26/9.55 Arcs: 24.26/9.55 (1) -> (1) 24.26/9.55 24.26/9.55 This digraph is fully evaluated! 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (50) IntTRSCompressionProof (EQUIVALENT) 24.26/9.55 Compressed rules. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (51) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8293_0_createMap_LE(i3227:0:0, i3255:0:0, i3208:0:0) -> f8293_0_createMap_LE(i3227:0:0 - 1, i3255:0:0, i3208:0:0 + 2) :|: i3228:0:0 >= i3227:0:0 && i3228:0:0 > 0 && i3361:0:0 > -1 && i3265:0:0 > -1 && i3208:0:0 > -1 && i3255:0:0 > -1 && i3255:0:0 > i3208:0:0 + 1 && i3227:0:0 > 0 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (52) TempFilterProof (SOUND) 24.26/9.55 Used the following sort dictionary for filtering: 24.26/9.55 f8293_0_createMap_LE(INTEGER, INTEGER, INTEGER) 24.26/9.55 Replaced non-predefined constructor symbols by 0. 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (53) 24.26/9.55 Obligation: 24.26/9.55 Rules: 24.26/9.55 f8293_0_createMap_LE(i3227:0:0, i3255:0:0, i3208:0:0) -> f8293_0_createMap_LE(c, i3255:0:0, c1) :|: c1 = i3208:0:0 + 2 && c = i3227:0:0 - 1 && (i3228:0:0 >= i3227:0:0 && i3228:0:0 > 0 && i3361:0:0 > -1 && i3265:0:0 > -1 && i3208:0:0 > -1 && i3255:0:0 > -1 && i3255:0:0 > i3208:0:0 + 1 && i3227:0:0 > 0) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (54) PolynomialOrderProcessor (EQUIVALENT) 24.26/9.55 Found the following polynomial interpretation: 24.26/9.55 [f8293_0_createMap_LE(x, x1, x2)] = x 24.26/9.55 24.26/9.55 The following rules are decreasing: 24.26/9.55 f8293_0_createMap_LE(i3227:0:0, i3255:0:0, i3208:0:0) -> f8293_0_createMap_LE(c, i3255:0:0, c1) :|: c1 = i3208:0:0 + 2 && c = i3227:0:0 - 1 && (i3228:0:0 >= i3227:0:0 && i3228:0:0 > 0 && i3361:0:0 > -1 && i3265:0:0 > -1 && i3208:0:0 > -1 && i3255:0:0 > -1 && i3255:0:0 > i3208:0:0 + 1 && i3227:0:0 > 0) 24.26/9.55 The following rules are bounded: 24.26/9.55 f8293_0_createMap_LE(i3227:0:0, i3255:0:0, i3208:0:0) -> f8293_0_createMap_LE(c, i3255:0:0, c1) :|: c1 = i3208:0:0 + 2 && c = i3227:0:0 - 1 && (i3228:0:0 >= i3227:0:0 && i3228:0:0 > 0 && i3361:0:0 > -1 && i3265:0:0 > -1 && i3208:0:0 > -1 && i3255:0:0 > -1 && i3255:0:0 > i3208:0:0 + 1 && i3227:0:0 > 0) 24.26/9.55 24.26/9.55 ---------------------------------------- 24.26/9.55 24.26/9.55 (55) 24.26/9.55 YES 24.26/9.60 EOF