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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 24.90/7.79 * 24.90/7.79 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

25.12/7.80	 *   Map m = Collections.synchronizedMap(new HashMap(...));
25.12/7.80 * 25.12/7.80 *

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

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

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

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

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

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

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

25.12/7.81 * 25.12/7.81 *

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

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

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

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

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

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

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

This interface is a member of the 25.12/7.81 * 25.12/7.81 * Java Collections Framework. 25.12/7.81 * 25.12/7.81 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 25.12/7.81 * 25.12/7.81 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

25.12/7.82	 *   Map m = Collections.synchronizedMap(new HashMap(...));
25.12/7.82 * 25.12/7.82 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This interface is a member of the 25.12/7.83 * 25.12/7.83 * Java Collections Framework. 25.12/7.83 * 25.12/7.83 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Note that the detail message associated with cause is 25.12/7.83 * not automatically incorporated in this exception's detail 25.12/7.83 * message. 25.12/7.83 * 25.12/7.83 * @param message the detail message (which is saved for later retrieval 25.12/7.83 * by the {@link Throwable#getMessage()} method). 25.12/7.83 * @param cause the cause (which is saved for later retrieval by the 25.12/7.83 * {@link Throwable#getCause()} method). (A null value 25.12/7.83 * is permitted, and indicates that the cause is nonexistent or 25.12/7.83 * unknown.) 25.12/7.83 * @since 1.5 25.12/7.83 */ 25.12/7.83 public UnsupportedOperationException(String message, Throwable cause) { 25.12/7.83 super(message, cause); 25.12/7.83 } 25.12/7.83 25.12/7.83 /** 25.12/7.83 * Constructs a new exception with the specified cause and a detail 25.12/7.83 * message of (cause==null ? null : cause.toString()) (which 25.12/7.83 * typically contains the class and detail message of cause). 25.12/7.83 * This constructor is useful for exceptions that are little more than 25.12/7.83 * wrappers for other throwables (for example, {@link 25.12/7.83 * java.security.PrivilegedActionException}). 25.12/7.83 * 25.12/7.83 * @param cause the cause (which is saved for later retrieval by the 25.12/7.83 * {@link Throwable#getCause()} method). (A null value is 25.12/7.83 * permitted, and indicates that the cause is nonexistent or 25.12/7.83 * unknown.) 25.12/7.83 * @since 1.5 25.12/7.83 */ 25.12/7.83 public UnsupportedOperationException(Throwable cause) { 25.12/7.83 super(cause); 25.12/7.83 } 25.12/7.83 25.12/7.83 static final long serialVersionUID = -1242599979055084673L; 25.12/7.83 } 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (3) JBCToGraph (EQUIVALENT) 25.12/7.83 Constructed TerminationGraph. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (4) 25.12/7.83 Obligation: 25.12/7.83 Termination Graph based on JBC Program: 25.12/7.83 javaUtilEx.juHashMapCreatePut.main([Ljava/lang/String;)V: Graph of 320 nodes with 0 SCCs. 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 javaUtilEx.juHashMapCreatePut.createMap(I)LjavaUtilEx/HashMap;: Graph of 249 nodes with 1 SCC. 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;: Graph of 493 nodes with 2 SCCs. 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 javaUtilEx.Content.hashCode()I: Graph of 6 nodes with 0 SCCs. 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 javaUtilEx.Content.equals(Ljava/lang/Object;)Z: Graph of 31 nodes with 0 SCCs. 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (5) TerminationGraphToSCCProof (SOUND) 25.12/7.83 Splitted TerminationGraph to 3 SCCss. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (6) 25.12/7.83 Complex Obligation (AND) 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (7) 25.12/7.83 Obligation: 25.12/7.83 SCC of termination graph based on JBC Program. 25.12/7.83 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 25.12/7.83 SCC calls the following helper methods: 25.12/7.83 Performed SCC analyses: 25.12/7.83 *Used field analysis yielded the following read fields: 25.12/7.83 *javaUtilEx.HashMap$Entry: [next, hash] 25.12/7.83 *Marker field analysis yielded the following relations that could be markers: 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (8) SCCToIRSProof (SOUND) 25.12/7.83 Transformed FIGraph SCCs to intTRSs. Log: 25.12/7.83 Generated rules. Obtained 58 IRulesP rules: 25.12/7.83 f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200) -> f10374_0_transfer_ArrayLength(EOS(STATIC_10374), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, java.lang.Object(ARRAY(i4199))) :|: TRUE 25.12/7.83 f10374_0_transfer_ArrayLength(EOS(STATIC_10374), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, java.lang.Object(ARRAY(i4199))) -> f10375_0_transfer_GE(EOS(STATIC_10375), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, i4199) :|: i4199 >= 0 25.12/7.83 f10375_0_transfer_GE(EOS(STATIC_10375), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, i4199) -> f10377_0_transfer_GE(EOS(STATIC_10377), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, i4199) :|: i4200 < i4199 25.12/7.83 f10377_0_transfer_GE(EOS(STATIC_10377), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200, i4199) -> f10379_0_transfer_Load(EOS(STATIC_10379), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) :|: i4200 < i4199 25.12/7.83 f10379_0_transfer_Load(EOS(STATIC_10379), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) -> f10381_0_transfer_Load(EOS(STATIC_10381), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199))) :|: TRUE 25.12/7.83 f10381_0_transfer_Load(EOS(STATIC_10381), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199))) -> f10383_0_transfer_ArrayAccess(EOS(STATIC_10383), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199)), i4200) :|: TRUE 25.12/7.83 f10383_0_transfer_ArrayAccess(EOS(STATIC_10383), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199)), i4200) -> f10385_0_transfer_ArrayAccess(EOS(STATIC_10385), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199)), i4200) :|: TRUE 25.12/7.83 f10385_0_transfer_ArrayAccess(EOS(STATIC_10385), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(ARRAY(i4199)), i4200) -> f10388_0_transfer_Store(EOS(STATIC_10388), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o6972) :|: i4200 < i4199 25.12/7.83 f10388_0_transfer_Store(EOS(STATIC_10388), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o6972) -> f10391_0_transfer_Load(EOS(STATIC_10391), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o6972) :|: TRUE 25.12/7.83 f10391_0_transfer_Load(EOS(STATIC_10391), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o6972) -> f10393_0_transfer_NULL(EOS(STATIC_10393), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o6972, o6972) :|: TRUE 25.12/7.83 f10393_0_transfer_NULL(EOS(STATIC_10393), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(o6977sub)) -> f10396_0_transfer_NULL(EOS(STATIC_10396), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(o6977sub)) :|: TRUE 25.12/7.83 f10393_0_transfer_NULL(EOS(STATIC_10393), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) -> f10397_0_transfer_NULL(EOS(STATIC_10397), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) :|: TRUE 25.12/7.83 f10396_0_transfer_NULL(EOS(STATIC_10396), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(o6977sub)) -> f10400_0_transfer_Load(EOS(STATIC_10400), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub)) :|: TRUE 25.12/7.83 f10400_0_transfer_Load(EOS(STATIC_10400), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub)) -> f10403_0_transfer_Load(EOS(STATIC_10403), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199))) :|: TRUE 25.12/7.83 f10403_0_transfer_Load(EOS(STATIC_10403), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199))) -> f10407_0_transfer_ConstantStackPush(EOS(STATIC_10407), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200) :|: TRUE 25.12/7.83 f10407_0_transfer_ConstantStackPush(EOS(STATIC_10407), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200) -> f10411_0_transfer_ArrayAccess(EOS(STATIC_10411), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200, NULL) :|: TRUE 25.12/7.83 f10411_0_transfer_ArrayAccess(EOS(STATIC_10411), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200, NULL) -> f10413_0_transfer_ArrayAccess(EOS(STATIC_10413), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200, NULL) :|: TRUE 25.12/7.83 f10413_0_transfer_ArrayAccess(EOS(STATIC_10413), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(ARRAY(i4199)), i4200, NULL) -> f10417_0_transfer_Load(EOS(STATIC_10417), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977put)) :|: i4200 < i4199 25.12/7.83 f10417_0_transfer_Load(EOS(STATIC_10417), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub)) -> f10421_0_transfer_FieldAccess(EOS(STATIC_10421), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o6977sub), java.lang.Object(o6977sub)) :|: TRUE 25.12/7.83 f10421_0_transfer_FieldAccess(EOS(STATIC_10421), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) -> f10423_0_transfer_FieldAccess(EOS(STATIC_10423), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) :|: TRUE 25.12/7.83 f10423_0_transfer_FieldAccess(EOS(STATIC_10423), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) -> f10427_0_transfer_Store(EOS(STATIC_10427), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003) :|: TRUE 25.12/7.83 f10427_0_transfer_Store(EOS(STATIC_10427), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003) -> f10430_0_transfer_Load(EOS(STATIC_10430), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003) :|: TRUE 25.12/7.83 f10430_0_transfer_Load(EOS(STATIC_10430), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003) -> f10433_0_transfer_FieldAccess(EOS(STATIC_10433), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) :|: TRUE 25.12/7.83 f10433_0_transfer_FieldAccess(EOS(STATIC_10433), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) -> f10436_0_transfer_Load(EOS(STATIC_10436), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211) :|: TRUE 25.12/7.83 f10436_0_transfer_Load(EOS(STATIC_10436), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211) -> f10439_0_transfer_InvokeMethod(EOS(STATIC_10439), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) :|: TRUE 25.12/7.83 f10439_0_transfer_InvokeMethod(EOS(STATIC_10439), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) -> f10441_0_indexFor_Load(EOS(STATIC_10441), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) :|: TRUE 25.12/7.83 f10441_0_indexFor_Load(EOS(STATIC_10441), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) -> f10446_0_indexFor_Load(EOS(STATIC_10446), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4027, i4211) :|: TRUE 25.12/7.83 f10446_0_indexFor_Load(EOS(STATIC_10446), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4027, i4211) -> f10448_0_indexFor_ConstantStackPush(EOS(STATIC_10448), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) :|: TRUE 25.12/7.83 f10448_0_indexFor_ConstantStackPush(EOS(STATIC_10448), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027) -> f10451_0_indexFor_IntArithmetic(EOS(STATIC_10451), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027, 1) :|: TRUE 25.12/7.83 f10451_0_indexFor_IntArithmetic(EOS(STATIC_10451), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027, matching1) -> f10454_0_indexFor_IntArithmetic(EOS(STATIC_10454), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4027 - 1) :|: i4027 >= 0 && matching1 = 1 25.12/7.83 f10454_0_indexFor_IntArithmetic(EOS(STATIC_10454), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4211, i4232) -> f10456_0_indexFor_Return(EOS(STATIC_10456), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) :|: TRUE 25.12/7.83 f10456_0_indexFor_Return(EOS(STATIC_10456), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) -> f10459_0_transfer_Store(EOS(STATIC_10459), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) :|: TRUE 25.12/7.83 f10459_0_transfer_Store(EOS(STATIC_10459), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) -> f10462_0_transfer_Load(EOS(STATIC_10462), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) :|: TRUE 25.12/7.83 f10462_0_transfer_Load(EOS(STATIC_10462), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233) -> f10465_0_transfer_Load(EOS(STATIC_10465), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) :|: TRUE 25.12/7.83 f10465_0_transfer_Load(EOS(STATIC_10465), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211))) -> f10468_0_transfer_Load(EOS(STATIC_10468), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027))) :|: TRUE 25.12/7.83 f10468_0_transfer_Load(EOS(STATIC_10468), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027))) -> f10471_0_transfer_ArrayAccess(EOS(STATIC_10471), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027)), i4233) :|: TRUE 25.12/7.83 f10471_0_transfer_ArrayAccess(EOS(STATIC_10471), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027)), i4233) -> f10474_0_transfer_ArrayAccess(EOS(STATIC_10474), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027)), i4233) :|: TRUE 25.12/7.83 f10474_0_transfer_ArrayAccess(EOS(STATIC_10474), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), java.lang.Object(ARRAY(i4027)), i4233) -> f10478_0_transfer_FieldAccess(EOS(STATIC_10478), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7138) :|: i4233 < i4027 25.12/7.83 f10478_0_transfer_FieldAccess(EOS(STATIC_10478), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7003, i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003, i4211)), o7138) -> f10482_0_transfer_Load(EOS(STATIC_10482), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, i4233) :|: TRUE 25.12/7.83 f10482_0_transfer_Load(EOS(STATIC_10482), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, i4233) -> f10484_0_transfer_Load(EOS(STATIC_10484), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, i4233, java.lang.Object(ARRAY(i4027))) :|: TRUE 25.12/7.83 f10484_0_transfer_Load(EOS(STATIC_10484), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, i4233, java.lang.Object(ARRAY(i4027))) -> f10489_0_transfer_Load(EOS(STATIC_10489), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, java.lang.Object(ARRAY(i4027)), i4233) :|: TRUE 25.12/7.83 f10489_0_transfer_Load(EOS(STATIC_10489), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211)), o7003, java.lang.Object(ARRAY(i4027)), i4233) -> f10492_0_transfer_ArrayAccess(EOS(STATIC_10492), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003, java.lang.Object(ARRAY(i4027)), i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211))) :|: TRUE 25.12/7.83 f10492_0_transfer_ArrayAccess(EOS(STATIC_10492), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003, java.lang.Object(ARRAY(i4027)), i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211))) -> f10494_0_transfer_ArrayAccess(EOS(STATIC_10494), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003, java.lang.Object(ARRAY(i4027)), i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211))) :|: TRUE 25.12/7.83 f10494_0_transfer_ArrayAccess(EOS(STATIC_10494), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003, java.lang.Object(ARRAY(i4027)), i4233, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7138, i4211))) -> f10498_0_transfer_Load(EOS(STATIC_10498), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) :|: i4233 < i4027 25.12/7.83 f10498_0_transfer_Load(EOS(STATIC_10498), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) -> f10502_0_transfer_Store(EOS(STATIC_10502), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) :|: TRUE 25.12/7.83 f10502_0_transfer_Store(EOS(STATIC_10502), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) -> f10503_0_transfer_Load(EOS(STATIC_10503), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) :|: TRUE 25.12/7.83 f10503_0_transfer_Load(EOS(STATIC_10503), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003) -> f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, o7003, o7003) :|: TRUE 25.12/7.83 f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub), java.lang.Object(o7214sub)) -> f10509_0_transfer_NONNULL(EOS(STATIC_10509), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub), java.lang.Object(o7214sub)) :|: TRUE 25.12/7.83 f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) -> f10510_0_transfer_NONNULL(EOS(STATIC_10510), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) :|: TRUE 25.12/7.83 f10509_0_transfer_NONNULL(EOS(STATIC_10509), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub), java.lang.Object(o7214sub)) -> f10511_0_transfer_Load(EOS(STATIC_10511), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub)) :|: TRUE 25.12/7.83 f10511_0_transfer_Load(EOS(STATIC_10511), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub)) -> f10417_0_transfer_Load(EOS(STATIC_10417), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, java.lang.Object(o7214sub)) :|: TRUE 25.12/7.83 f10510_0_transfer_NONNULL(EOS(STATIC_10510), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) -> f10512_0_transfer_Inc(EOS(STATIC_10512), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) :|: TRUE 25.12/7.83 f10512_0_transfer_Inc(EOS(STATIC_10512), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) -> f10515_0_transfer_JMP(EOS(STATIC_10515), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200 + 1) :|: TRUE 25.12/7.83 f10515_0_transfer_JMP(EOS(STATIC_10515), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4255) -> f10518_0_transfer_Load(EOS(STATIC_10518), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4255) :|: TRUE 25.12/7.83 f10518_0_transfer_Load(EOS(STATIC_10518), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4255) -> f10372_0_transfer_Load(EOS(STATIC_10372), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4255) :|: TRUE 25.12/7.83 f10372_0_transfer_Load(EOS(STATIC_10372), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) -> f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, i4200) :|: TRUE 25.12/7.83 f10397_0_transfer_NULL(EOS(STATIC_10397), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200, NULL, NULL) -> f10401_0_transfer_Inc(EOS(STATIC_10401), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) :|: TRUE 25.12/7.83 f10401_0_transfer_Inc(EOS(STATIC_10401), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) -> f10512_0_transfer_Inc(EOS(STATIC_10512), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027, java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4027)), java.lang.Object(ARRAY(i4199)), i4027, i4200) :|: TRUE 25.12/7.83 Combined rules. Obtained 4 IRulesP rules: 25.12/7.83 f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003:0, i4211:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7003:0, i4211:0))) -> f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, o7003:0, o7003:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, i4200:0) -> f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, o7003:0, o7003:0) :|: i4199:0 > -1 && i4200:0 < i4199:0 && i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 f10506_0_transfer_NONNULL(EOS(STATIC_10506), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, NULL, NULL) -> f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0 + 1, i4200:0 + 1) :|: TRUE 25.12/7.83 f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0, i4200:0) -> f10373_0_transfer_Load(EOS(STATIC_10373), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4027:0, java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4027:0, i4200:0 + 1, i4200:0 + 1) :|: i4199:0 > -1 && i4200:0 < i4199:0 25.12/7.83 Filtered constant ground arguments: 25.12/7.83 f10506_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f10506_0_transfer_NONNULL(x4, x5, x6, x7, x8, x9, x10, x11) 25.12/7.83 f10373_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> f10373_0_transfer_Load(x4, x5, x6, x7, x8, x9, x10) 25.12/7.83 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 25.12/7.83 javaUtilEx.HashMap$Entry(x1, x2, x3) -> javaUtilEx.HashMap$Entry(x2, x3) 25.12/7.83 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 25.12/7.83 Filtered duplicate arguments: 25.12/7.83 f10506_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8) -> f10506_0_transfer_NONNULL(x3, x4, x6, x8) 25.12/7.83 f10373_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7) -> f10373_0_transfer_Load(x3, x4, x7) 25.12/7.83 Filtered unneeded arguments: 25.12/7.83 javaUtilEx.HashMap$Entry(x1, x2) -> javaUtilEx.HashMap$Entry(x1) 25.12/7.83 Finished conversion. Obtained 4 rules.P rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0)), i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4200:0 < i4199:0 && i4199:0 > -1 && i4233:0 < i4027:0 && i4027:0 > -1 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, NULL, i4027:0, i4199:0) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0 + 1, i4027:0, i4199:0) :|: TRUE 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, i4027:0, i4199:0) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0 + 1, i4027:0, i4199:0) :|: i4199:0 > -1 && i4200:0 < i4199:0 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (9) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0)), i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x, x1) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x2 < x1 && x1 > -1 && x4 < x && x > -1 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, NULL, x5, x6) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7 + 1, x5, x6) :|: TRUE 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10, x8, x9) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10 + 1, x8, x9) :|: x9 > -1 && x10 < x9 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (10) IRSFormatTransformerProof (EQUIVALENT) 25.12/7.83 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (11) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0)), i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x, x1) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x2 < x1 && x1 > -1 && x4 < x && x > -1 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, NULL, x5, x6) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: TRUE && arith = x7 + 1 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (12) IRSwTTerminationDigraphProof (EQUIVALENT) 25.12/7.83 Constructed termination digraph! 25.12/7.83 Nodes: 25.12/7.83 (1) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0)), i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 (2) f10373_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x, x1) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x2 < x1 && x1 > -1 && x4 < x && x > -1 25.12/7.83 (3) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, NULL, x5, x6) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: TRUE && arith = x7 + 1 25.12/7.83 (4) f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 25.12/7.83 25.12/7.83 Arcs: 25.12/7.83 (1) -> (1), (3) 25.12/7.83 (2) -> (1), (3) 25.12/7.83 (3) -> (2), (4) 25.12/7.83 (4) -> (2), (4) 25.12/7.83 25.12/7.83 This digraph is fully evaluated! 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (13) 25.12/7.83 Obligation: 25.12/7.83 25.12/7.83 Termination digraph: 25.12/7.83 Nodes: 25.12/7.83 (1) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0)), i4027:0, i4199:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0)), java.lang.Object(ARRAY(i4199:0)), i4200:0, o7003:0, i4027:0, i4199:0) :|: i4027:0 > -1 && i4233:0 < i4027:0 25.12/7.83 (2) f10373_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x, x1) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x2 < x1 && x1 > -1 && x4 < x && x > -1 25.12/7.83 (3) f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 25.12/7.83 (4) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, NULL, x5, x6) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: TRUE && arith = x7 + 1 25.12/7.83 25.12/7.83 Arcs: 25.12/7.83 (1) -> (1), (4) 25.12/7.83 (2) -> (1), (4) 25.12/7.83 (3) -> (2), (3) 25.12/7.83 (4) -> (2), (3) 25.12/7.83 25.12/7.83 This digraph is fully evaluated! 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (14) IntTRSCompressionProof (EQUIVALENT) 25.12/7.83 Compressed rules. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (15) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: i4027:0:0 > -1 && i4233:0:0 < i4027:0:0 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x:0, x1:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x3:0, x:0, x1:0) :|: x:0 > x4:0 && x:0 > -1 && x1:0 > -1 && x2:0 < x1:0 25.12/7.83 f10373_0_transfer_Load(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0, x11:0, x12:0) -> f10373_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 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(x5:0)), java.lang.Object(ARRAY(x6:0)), x7:0, NULL, x5:0, x6:0) -> f10373_0_transfer_Load(java.lang.Object(ARRAY(x5:0)), java.lang.Object(ARRAY(x6:0)), x7:0 + 1, x5:0, x6:0) :|: TRUE 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (16) TempFilterProof (SOUND) 25.12/7.83 Used the following sort dictionary for filtering: 25.12/7.83 f10506_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE) 25.12/7.83 java.lang.Object(VARIABLE) 25.12/7.83 ARRAY(VARIABLE) 25.12/7.83 javaUtilEx.HashMap$Entry(VARIABLE) 25.12/7.83 f10373_0_transfer_Load(VARIABLE, VARIABLE, INTEGER, VARIABLE, VARIABLE) 25.12/7.83 NULL() 25.12/7.83 Replaced non-predefined constructor symbols by 0.The following proof was generated: 25.12/7.83 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.12/7.83 25.12/7.83 25.12/7.83 Termination of the given IntTRS could not be shown: 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 f10373_0_transfer_Load(c5, c6, x2:0, x:0, x1:0) -> f10506_0_transfer_NONNULL(c7, c8, x2:0, x3:0, x:0, x1:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x:0 > x4:0 && x:0 > -1 && x1:0 > -1 && x2:0 < x1:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 f10506_0_transfer_NONNULL(c14, c15, x7:0, c16, x5:0, x6:0) -> f10373_0_transfer_Load(c17, c18, c19, x5:0, x6:0) :|: c19 = x7:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 25.12/7.83 25.12/7.83 Interpretation: 25.12/7.83 [ f10506_0_transfer_NONNULL ] = 2*f10506_0_transfer_NONNULL_5 + -2*f10506_0_transfer_NONNULL_3 + 2*f10506_0_transfer_NONNULL_6 + -1 25.12/7.83 [ f10373_0_transfer_Load ] = 2*f10373_0_transfer_Load_4 + 2*f10373_0_transfer_Load_5 + -2*f10373_0_transfer_Load_3 25.12/7.83 25.12/7.83 The following rules are decreasing: 25.12/7.83 f10373_0_transfer_Load(c5, c6, x2:0, x:0, x1:0) -> f10506_0_transfer_NONNULL(c7, c8, x2:0, x3:0, x:0, x1:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x:0 > x4:0 && x:0 > -1 && x1:0 > -1 && x2:0 < x1:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 f10506_0_transfer_NONNULL(c14, c15, x7:0, c16, x5:0, x6:0) -> f10373_0_transfer_Load(c17, c18, c19, x5:0, x6:0) :|: c19 = x7:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 25.12/7.83 25.12/7.83 The following rules are bounded: 25.12/7.83 f10373_0_transfer_Load(c5, c6, x2:0, x:0, x1:0) -> f10506_0_transfer_NONNULL(c7, c8, x2:0, x3:0, x:0, x1:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x:0 > x4:0 && x:0 > -1 && x1:0 > -1 && x2:0 < x1:0) 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 - IntTRS 25.12/7.83 - PolynomialOrderProcessor 25.12/7.83 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 f10506_0_transfer_NONNULL(c14, c15, x7:0, c16, x5:0, x6:0) -> f10373_0_transfer_Load(c17, c18, c19, x5:0, x6:0) :|: c19 = x7:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 25.12/7.83 25.12/7.83 Found the following polynomial interpretation: 25.12/7.83 [f10506_0_transfer_NONNULL(x, x1, x2, x3, x4, x5)] = 1 + c*x + c1*x1 25.12/7.83 [f10373_0_transfer_Load(x6, x7, x8, x9, x10)] = c6*x6 + c7*x7 25.12/7.83 25.12/7.83 The following rules are decreasing: 25.12/7.83 f10506_0_transfer_NONNULL(c14, c15, x7:0, c16, x5:0, x6:0) -> f10373_0_transfer_Load(c17, c18, c19, x5:0, x6:0) :|: c19 = x7:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 25.12/7.83 The following rules are bounded: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 f10506_0_transfer_NONNULL(c14, c15, x7:0, c16, x5:0, x6:0) -> f10373_0_transfer_Load(c17, c18, c19, x5:0, x6:0) :|: c19 = x7:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 25.12/7.83 25.12/7.83 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 - IntTRS 25.12/7.83 - PolynomialOrderProcessor 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 25.12/7.83 Interpretation: 25.12/7.83 [ f10506_0_transfer_NONNULL ] = 0 25.12/7.83 [ f10373_0_transfer_Load ] = f10373_0_transfer_Load_5 + -1*f10373_0_transfer_Load_3 25.12/7.83 25.12/7.83 The following rules are decreasing: 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 25.12/7.83 The following rules are bounded: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 f10373_0_transfer_Load(c9, c10, x13:0, x11:0, x12:0) -> f10373_0_transfer_Load(c11, c12, c13, x11:0, x12:0) :|: c13 = x13:0 + 1 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (x12:0 > -1 && x13:0 < x12:0) 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 - IntTRS 25.12/7.83 - PolynomialOrderProcessor 25.12/7.83 - IntTRS 25.12/7.83 - RankingReductionPairProof 25.12/7.83 - IntTRS 25.12/7.83 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(c, c1, i4200:0:0, c2, i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(c3, c4, i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: c4 = 0 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (i4027:0:0 > -1 && i4233:0:0 < i4027:0:0) 25.12/7.83 25.12/7.83 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (17) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: i4027:0:0 > -1 && i4233:0:0 < i4027:0:0 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (18) IRSwTTerminationDigraphProof (EQUIVALENT) 25.12/7.83 Constructed termination digraph! 25.12/7.83 Nodes: 25.12/7.83 (1) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: i4027:0:0 > -1 && i4233:0:0 < i4027:0:0 25.12/7.83 25.12/7.83 Arcs: 25.12/7.83 (1) -> (1) 25.12/7.83 25.12/7.83 This digraph is fully evaluated! 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (19) 25.12/7.83 Obligation: 25.12/7.83 25.12/7.83 Termination digraph: 25.12/7.83 Nodes: 25.12/7.83 (1) f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), i4200:0:0, o7003:0:0, i4027:0:0, i4199:0:0) :|: i4027:0:0 > -1 && i4233:0:0 < i4027:0:0 25.12/7.83 25.12/7.83 Arcs: 25.12/7.83 (1) -> (1) 25.12/7.83 25.12/7.83 This digraph is fully evaluated! 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (20) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 25.12/7.83 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 25.12/7.83 25.12/7.83 f10506_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6) -> f10506_0_transfer_NONNULL(x1, x2, x4, x5, x6) 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (21) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4027:0:0, i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), o7003:0:0, i4027:0:0, i4199:0:0) :|: i4027:0:0 > -1 && i4233:0:0 < i4027:0:0 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (22) TempFilterProof (SOUND) 25.12/7.83 Used the following sort dictionary for filtering: 25.12/7.83 f10506_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, INTEGER, VARIABLE) 25.12/7.83 java.lang.Object(VARIABLE) 25.12/7.83 ARRAY(VARIABLE) 25.12/7.83 javaUtilEx.HashMap$Entry(VARIABLE) 25.12/7.83 Removed predefined arithmetic. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (23) 25.12/7.83 Obligation: 25.12/7.83 Rules: 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), o7003:0:0, i4199:0:0) 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (24) IRSwTToQDPProof (SOUND) 25.12/7.83 Removed the integers and created a QDP-Problem. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (25) 25.12/7.83 Obligation: 25.12/7.83 Q DP problem: 25.12/7.83 The TRS P consists of the following rules: 25.12/7.83 25.12/7.83 f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), o7003:0:0, i4199:0:0) 25.12/7.83 25.12/7.83 R is empty. 25.12/7.83 Q is empty. 25.12/7.83 We have to consider all (P,Q,R)-chains. 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (26) QDPSizeChangeProof (EQUIVALENT) 25.12/7.83 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. 25.12/7.83 25.12/7.83 From the DPs we obtained the following set of size-change graphs: 25.12/7.83 *f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7003:0:0)), i4199:0:0) -> f10506_0_transfer_NONNULL(java.lang.Object(ARRAY(i4027:0:0)), java.lang.Object(ARRAY(i4199:0:0)), o7003:0:0, i4199:0:0) 25.12/7.83 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 2 > 4, 4 >= 4 25.12/7.83 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (27) 25.12/7.83 YES 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (28) 25.12/7.83 Obligation: 25.12/7.83 SCC of termination graph based on JBC Program. 25.12/7.83 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 25.12/7.83 SCC calls the following helper methods: javaUtilEx.Content.equals(Ljava/lang/Object;)Z 25.12/7.83 Performed SCC analyses: 25.12/7.83 *Used field analysis yielded the following read fields: 25.12/7.83 *javaUtilEx.HashMap$Entry: [hash, next, key] 25.12/7.83 *Marker field analysis yielded the following relations that could be markers: 25.12/7.83 25.12/7.83 ---------------------------------------- 25.12/7.83 25.12/7.83 (29) SCCToIRSProof (SOUND) 25.12/7.83 Transformed FIGraph SCCs to intTRSs. Log: 25.12/7.83 Generated rules. Obtained 57 IRulesP rules: 25.12/7.83 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub), java.lang.Object(o5983sub)) -> f9772_0_put_NULL(EOS(STATIC_9772), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub), java.lang.Object(o5983sub)) :|: TRUE 25.12/7.83 f9772_0_put_NULL(EOS(STATIC_9772), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub), java.lang.Object(o5983sub)) -> f9775_0_put_Load(EOS(STATIC_9775), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub)) :|: TRUE 25.12/7.83 f9775_0_put_Load(EOS(STATIC_9775), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub)) -> f9778_0_put_FieldAccess(EOS(STATIC_9778), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(o5983sub), java.lang.Object(o5983sub)) :|: TRUE 25.12/7.83 f9778_0_put_FieldAccess(EOS(STATIC_9778), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) -> f9781_0_put_FieldAccess(EOS(STATIC_9781), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) :|: TRUE 25.12/7.83 f9781_0_put_FieldAccess(EOS(STATIC_9781), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) -> f9784_0_put_Load(EOS(STATIC_9784), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777) :|: TRUE 25.12/7.83 f9784_0_put_Load(EOS(STATIC_9784), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777) -> f9787_0_put_NE(EOS(STATIC_9787), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777, i3772) :|: TRUE 25.12/7.83 f9787_0_put_NE(EOS(STATIC_9787), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777, i3772) -> f9790_0_put_NE(EOS(STATIC_9790), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777, i3772) :|: !(i3777 = i3772) 25.12/7.83 f9787_0_put_NE(EOS(STATIC_9787), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), i3772, i3772) -> f9791_0_put_NE(EOS(STATIC_9791), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), i3772, i3772) :|: i3777 = i3772 25.12/7.83 f9790_0_put_NE(EOS(STATIC_9790), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985)), i3777, i3772) -> f9794_0_put_Load(EOS(STATIC_9794), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) :|: !(i3777 = i3772) 25.12/7.83 f9794_0_put_Load(EOS(STATIC_9794), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) -> f9798_0_put_FieldAccess(EOS(STATIC_9798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) :|: TRUE 25.12/7.83 f9798_0_put_FieldAccess(EOS(STATIC_9798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777, o5987, o5985))) -> f9802_0_put_Store(EOS(STATIC_9802), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.83 f9802_0_put_Store(EOS(STATIC_9802), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) -> f9806_0_put_JMP(EOS(STATIC_9806), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.83 f9806_0_put_JMP(EOS(STATIC_9806), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) -> f9810_0_put_Load(EOS(STATIC_9810), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.83 f9810_0_put_Load(EOS(STATIC_9810), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) -> f9768_0_put_Load(EOS(STATIC_9768), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.83 f9768_0_put_Load(EOS(STATIC_9768), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5968) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5968, o5968) :|: TRUE 25.12/7.83 f9791_0_put_NE(EOS(STATIC_9791), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), i3772, i3772) -> f9795_0_put_Load(EOS(STATIC_9795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985))) :|: TRUE 25.12/7.83 f9795_0_put_Load(EOS(STATIC_9795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985))) -> f9799_0_put_FieldAccess(EOS(STATIC_9799), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985))) :|: TRUE 25.12/7.83 f9799_0_put_FieldAccess(EOS(STATIC_9799), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985))) -> f9803_0_put_Duplicate(EOS(STATIC_9803), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985) :|: TRUE 25.12/7.83 f9803_0_put_Duplicate(EOS(STATIC_9803), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985) -> f9807_0_put_Store(EOS(STATIC_9807), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985, o5985) :|: TRUE 25.12/7.83 f9807_0_put_Store(EOS(STATIC_9807), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985, o5985) -> f9811_0_put_Load(EOS(STATIC_9811), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985, o5985) :|: TRUE 25.12/7.83 f9811_0_put_Load(EOS(STATIC_9811), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985, o5985) -> f9814_0_put_EQ(EOS(STATIC_9814), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, o5985)), o5985, o5985, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.83 f9814_0_put_EQ(EOS(STATIC_9814), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f9816_0_put_EQ(EOS(STATIC_9816), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.83 f9814_0_put_EQ(EOS(STATIC_9814), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f9817_0_put_EQ(EOS(STATIC_9817), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9816_0_put_EQ(EOS(STATIC_9816), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f9821_0_put_Load(EOS(STATIC_9821), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub)) :|: TRUE 25.12/7.84 f9821_0_put_Load(EOS(STATIC_9821), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub)) -> f9825_0_put_Load(EOS(STATIC_9825), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9825_0_put_Load(EOS(STATIC_9825), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f9830_0_put_InvokeMethod(EOS(STATIC_9830), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) :|: TRUE 25.12/7.84 f9830_0_put_InvokeMethod(EOS(STATIC_9830), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) -> f9833_0_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) :|: TRUE 25.12/7.84 f9830_0_put_InvokeMethod(EOS(STATIC_9830), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) -> f9833_1_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) :|: TRUE 25.12/7.84 f9833_0_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) -> f10722_0_equals_Load(EOS(STATIC_10722), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6011sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub)) :|: TRUE 25.12/7.84 f9852_0_equals_Return(EOS(STATIC_9852), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub))), matching1) -> f9863_0_put_EQ(EOS(STATIC_9863), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub))), 0) :|: TRUE && matching1 = 0 25.12/7.84 f9863_0_put_EQ(EOS(STATIC_9863), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub))), matching1) -> f9867_0_put_Load(EOS(STATIC_9867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub)))) :|: TRUE && matching1 = 0 25.12/7.84 f9867_0_put_Load(EOS(STATIC_9867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub)))) -> f9873_0_put_FieldAccess(EOS(STATIC_9873), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub)))) :|: TRUE 25.12/7.84 f9873_0_put_FieldAccess(EOS(STATIC_9873), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub)))) -> f9879_0_put_Store(EOS(STATIC_9879), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.84 f9879_0_put_Store(EOS(STATIC_9879), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) -> f9802_0_put_Store(EOS(STATIC_9802), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.84 f9853_0_equals_Return(EOS(STATIC_9853), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f9855_0_equals_Return(EOS(STATIC_9855), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 25.12/7.84 f9855_0_equals_Return(EOS(STATIC_9855), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC)))), i3906) -> f9864_0_put_EQ(EOS(STATIC_9864), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC)))), i3906) :|: TRUE 25.12/7.84 f9864_0_put_EQ(EOS(STATIC_9864), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f9869_0_put_EQ(EOS(STATIC_9869), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 25.12/7.84 f9869_0_put_EQ(EOS(STATIC_9869), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f9875_0_put_Load(EOS(STATIC_9875), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE && matching1 = 0 25.12/7.84 f9875_0_put_Load(EOS(STATIC_9875), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC))))) -> f9881_0_put_FieldAccess(EOS(STATIC_9881), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE 25.12/7.84 f9881_0_put_FieldAccess(EOS(STATIC_9881), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o6206, java.lang.Object(javaUtilEx.Content(EOC))))) -> f9885_0_put_Store(EOS(STATIC_9885), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o6206) :|: TRUE 25.12/7.84 f9885_0_put_Store(EOS(STATIC_9885), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o6206) -> f9802_0_put_Store(EOS(STATIC_9802), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o6206) :|: TRUE 25.12/7.84 f9854_0_equals_Return(EOS(STATIC_9854), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f9855_0_equals_Return(EOS(STATIC_9855), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE && matching1 = 1 25.12/7.84 f9817_0_put_EQ(EOS(STATIC_9817), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f9822_0_put_Load(EOS(STATIC_9822), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL) :|: TRUE 25.12/7.84 f9822_0_put_Load(EOS(STATIC_9822), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL) -> f9826_0_put_Load(EOS(STATIC_9826), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9826_0_put_Load(EOS(STATIC_9826), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f9831_0_put_InvokeMethod(EOS(STATIC_9831), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 25.12/7.84 f9831_0_put_InvokeMethod(EOS(STATIC_9831), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f9834_0_equals_Load(EOS(STATIC_9834), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 25.12/7.84 f9831_0_put_InvokeMethod(EOS(STATIC_9831), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f9834_1_equals_Load(EOS(STATIC_9834), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 25.12/7.84 f9834_0_equals_Load(EOS(STATIC_9834), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f10778_0_equals_Load(EOS(STATIC_10778), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 25.12/7.84 f9857_0_equals_Return(EOS(STATIC_9857), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), matching1) -> f9865_0_put_EQ(EOS(STATIC_9865), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), 0) :|: TRUE && matching1 = 0 25.12/7.84 f9865_0_put_EQ(EOS(STATIC_9865), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), matching1) -> f9870_0_put_Load(EOS(STATIC_9870), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL))) :|: TRUE && matching1 = 0 25.12/7.84 f9870_0_put_Load(EOS(STATIC_9870), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL))) -> f9876_0_put_FieldAccess(EOS(STATIC_9876), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL))) :|: TRUE 25.12/7.84 f9876_0_put_FieldAccess(EOS(STATIC_9876), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL))) -> f9882_0_put_Store(EOS(STATIC_9882), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.84 f9882_0_put_Store(EOS(STATIC_9882), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) -> f9802_0_put_Store(EOS(STATIC_9802), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, o5987) :|: TRUE 25.12/7.84 f9833_1_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6098sub)) -> f9852_0_equals_Return(EOS(STATIC_9852), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(o6098sub))), 0) :|: TRUE 25.12/7.84 f9833_1_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9853_0_equals_Return(EOS(STATIC_9853), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE 25.12/7.84 f9833_1_equals_Load(EOS(STATIC_9833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9854_0_equals_Return(EOS(STATIC_9854), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE 25.12/7.84 f9834_1_equals_Load(EOS(STATIC_9834), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f9857_0_equals_Return(EOS(STATIC_9857), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772, o5987, NULL)), 0) :|: TRUE 25.12/7.84 Combined rules. Obtained 7 IRulesP rules: 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, o5987:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777:0, o5987:0, o5985:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777:0, o5987:0, o5985:0))) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, o5987:0, o5987:0) :|: i3777:0 < i3772:0 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777:0, o5987:0, o5985:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3777:0, o5987:0, o5985:0))) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, o5987:0, o5987:0) :|: i3777:0 > i3772:0 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(o6011sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(o6011sub:0)))) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, o5987:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(javaUtilEx.Content(EOC))))) -> f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, o5987:0, o5987:0) :|: TRUE 25.12/7.84 Removed following non-SCC rules: 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, NULL))) -> f10778_0_equals_Load(EOS(STATIC_10778), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 25.12/7.84 f9770_0_put_NULL(EOS(STATIC_9770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(o6011sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(o6011sub:0)))) -> f10722_0_equals_Load(EOS(STATIC_10722), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub:0), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3772:0, o5987:0, java.lang.Object(o6011sub:0))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6011sub:0)) :|: TRUE 25.12/7.84 Filtered constant ground arguments: 25.12/7.84 f9770_0_put_NULL(x1, x2, x3, x4, x5, x6, x7) -> f9770_0_put_NULL(x5, x6, x7) 25.12/7.84 EOS(x1) -> EOS 25.12/7.84 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 25.12/7.84 javaUtilEx.Content(x1) -> javaUtilEx.Content 25.12/7.84 javaUtilEx.HashMap$Entry(x1, x2, x3, x4) -> javaUtilEx.HashMap$Entry(x2, x3, x4) 25.12/7.84 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 25.12/7.84 Filtered duplicate arguments: 25.12/7.84 f9770_0_put_NULL(x1, x2, x3) -> f9770_0_put_NULL(x1, x3) 25.12/7.84 Finished conversion. Obtained 5 rules.P rules: 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3777:0, o5987:0, o5985:0))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: i3777:0 < i3772:0 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3777:0, o5987:0, o5985:0))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: i3777:0 > i3772:0 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, java.lang.Object(o6011sub:0)))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (30) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f9770_0_put_NULL(x, x2) :|: x1 < x 25.12/7.84 f9770_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f9770_0_put_NULL(x4, x6) :|: x5 > x4 25.12/7.84 f9770_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f9770_0_put_NULL(x8, x9) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11, x12) :|: TRUE 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (31) IRSFormatTransformerProof (EQUIVALENT) 25.12/7.84 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (32) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f9770_0_put_NULL(x, x2) :|: x1 < x 25.12/7.84 f9770_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f9770_0_put_NULL(x4, x6) :|: x5 > x4 25.12/7.84 f9770_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f9770_0_put_NULL(x8, x9) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11, x12) :|: TRUE 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (33) IRSwTTerminationDigraphProof (EQUIVALENT) 25.12/7.84 Constructed termination digraph! 25.12/7.84 Nodes: 25.12/7.84 (1) f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 (2) f9770_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f9770_0_put_NULL(x, x2) :|: x1 < x 25.12/7.84 (3) f9770_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f9770_0_put_NULL(x4, x6) :|: x5 > x4 25.12/7.84 (4) f9770_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f9770_0_put_NULL(x8, x9) :|: TRUE 25.12/7.84 (5) f9770_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11, x12) :|: TRUE 25.12/7.84 25.12/7.84 Arcs: 25.12/7.84 (1) -> (1), (2), (3), (4), (5) 25.12/7.84 (2) -> (1), (2), (3), (4), (5) 25.12/7.84 (3) -> (1), (2), (3), (4), (5) 25.12/7.84 (4) -> (1), (2), (3), (4), (5) 25.12/7.84 (5) -> (1), (2), (3), (4), (5) 25.12/7.84 25.12/7.84 This digraph is fully evaluated! 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (34) 25.12/7.84 Obligation: 25.12/7.84 25.12/7.84 Termination digraph: 25.12/7.84 Nodes: 25.12/7.84 (1) f9770_0_put_NULL(i3772:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0, o5987:0, NULL))) -> f9770_0_put_NULL(i3772:0, o5987:0) :|: TRUE 25.12/7.84 (2) f9770_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f9770_0_put_NULL(x, x2) :|: x1 < x 25.12/7.84 (3) f9770_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f9770_0_put_NULL(x4, x6) :|: x5 > x4 25.12/7.84 (4) f9770_0_put_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x8, x9, java.lang.Object(x10)))) -> f9770_0_put_NULL(x8, x9) :|: TRUE 25.12/7.84 (5) f9770_0_put_NULL(x11, java.lang.Object(javaUtilEx.HashMap$Entry(x11, x12, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11, x12) :|: TRUE 25.12/7.84 25.12/7.84 Arcs: 25.12/7.84 (1) -> (1), (2), (3), (4), (5) 25.12/7.84 (2) -> (1), (2), (3), (4), (5) 25.12/7.84 (3) -> (1), (2), (3), (4), (5) 25.12/7.84 (4) -> (1), (2), (3), (4), (5) 25.12/7.84 (5) -> (1), (2), (3), (4), (5) 25.12/7.84 25.12/7.84 This digraph is fully evaluated! 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (35) IntTRSCompressionProof (EQUIVALENT) 25.12/7.84 Compressed rules. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (36) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9770_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f9770_0_put_NULL(x:0, x2:0) :|: x:0 > x1:0 25.12/7.84 f9770_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11:0, x12:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(i3772:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0:0, o5987:0:0, NULL))) -> f9770_0_put_NULL(i3772:0:0, o5987:0:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f9770_0_put_NULL(x8:0, x9:0) :|: TRUE 25.12/7.84 f9770_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f9770_0_put_NULL(x4:0, x6:0) :|: x5:0 > x4:0 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (37) TempFilterProof (SOUND) 25.12/7.84 Used the following sort dictionary for filtering: 25.12/7.84 f9770_0_put_NULL(VARIABLE, VARIABLE) 25.12/7.84 java.lang.Object(VARIABLE) 25.12/7.84 javaUtilEx.HashMap$Entry(VARIABLE, VARIABLE, VARIABLE) 25.12/7.84 javaUtilEx.Content() 25.12/7.84 NULL() 25.12/7.84 Removed predefined arithmetic. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (38) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9770_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f9770_0_put_NULL(x:0, x2:0) 25.12/7.84 f9770_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11:0, x12:0) 25.12/7.84 f9770_0_put_NULL(i3772:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0:0, o5987:0:0, NULL))) -> f9770_0_put_NULL(i3772:0:0, o5987:0:0) 25.12/7.84 f9770_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f9770_0_put_NULL(x8:0, x9:0) 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (39) IRSwTToQDPProof (SOUND) 25.12/7.84 Removed the integers and created a QDP-Problem. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (40) 25.12/7.84 Obligation: 25.12/7.84 Q DP problem: 25.12/7.84 The TRS P consists of the following rules: 25.12/7.84 25.12/7.84 f9770_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f9770_0_put_NULL(x:0, x2:0) 25.12/7.84 f9770_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11:0, x12:0) 25.12/7.84 f9770_0_put_NULL(i3772:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0:0, o5987:0:0, NULL))) -> f9770_0_put_NULL(i3772:0:0, o5987:0:0) 25.12/7.84 f9770_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f9770_0_put_NULL(x8:0, x9:0) 25.12/7.84 25.12/7.84 R is empty. 25.12/7.84 Q is empty. 25.12/7.84 We have to consider all (P,Q,R)-chains. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (41) QDPSizeChangeProof (EQUIVALENT) 25.12/7.84 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. 25.12/7.84 25.12/7.84 From the DPs we obtained the following set of size-change graphs: 25.12/7.84 *f9770_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f9770_0_put_NULL(x:0, x2:0) 25.12/7.84 The graph contains the following edges 1 >= 1, 2 > 2 25.12/7.84 25.12/7.84 25.12/7.84 *f9770_0_put_NULL(x11:0, java.lang.Object(javaUtilEx.HashMap$Entry(x11:0, x12:0, java.lang.Object(javaUtilEx.Content)))) -> f9770_0_put_NULL(x11:0, x12:0) 25.12/7.84 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 25.12/7.84 25.12/7.84 25.12/7.84 *f9770_0_put_NULL(i3772:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3772:0:0, o5987:0:0, NULL))) -> f9770_0_put_NULL(i3772:0:0, o5987:0:0) 25.12/7.84 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 25.12/7.84 25.12/7.84 25.12/7.84 *f9770_0_put_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x8:0, x9:0, java.lang.Object(x10:0)))) -> f9770_0_put_NULL(x8:0, x9:0) 25.12/7.84 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 25.12/7.84 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (42) 25.12/7.84 YES 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (43) 25.12/7.84 Obligation: 25.12/7.84 SCC of termination graph based on JBC Program. 25.12/7.84 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreatePut.createMap(I)LjavaUtilEx/HashMap; 25.12/7.84 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 25.12/7.84 Performed SCC analyses: 25.12/7.84 *Used field analysis yielded the following read fields: 25.12/7.84 *java.lang.String: [count] 25.12/7.84 *Marker field analysis yielded the following relations that could be markers: 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (44) SCCToIRSProof (SOUND) 25.12/7.84 Transformed FIGraph SCCs to intTRSs. Log: 25.12/7.84 Generated rules. Obtained 81 IRulesP rules: 25.12/7.84 f9192_0_createMap_LE(EOS(STATIC_9192(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398) -> f9196_0_createMap_LE(EOS(STATIC_9196(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398) :|: TRUE 25.12/7.84 f9196_0_createMap_LE(EOS(STATIC_9196(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398) -> f9201_0_createMap_New(EOS(STATIC_9201(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: i3398 > 0 25.12/7.84 f9201_0_createMap_New(EOS(STATIC_9201(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9206_0_createMap_Duplicate(EOS(STATIC_9206(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9206_0_createMap_Duplicate(EOS(STATIC_9206(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f9210_0_createMap_InvokeMethod(EOS(STATIC_9210(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9210_0_createMap_InvokeMethod(EOS(STATIC_9210(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9214_0_random_FieldAccess(EOS(STATIC_9214(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9214_0_random_FieldAccess(EOS(STATIC_9214(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9224_0_random_FieldAccess(EOS(STATIC_9224(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5363sub)) :|: TRUE 25.12/7.84 f9224_0_random_FieldAccess(EOS(STATIC_9224(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5363sub)) -> f9229_0_random_ArrayAccess(EOS(STATIC_9229(java.lang.Object(o5363sub), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5363sub), i3379) :|: TRUE 25.12/7.84 f9229_0_random_ArrayAccess(EOS(STATIC_9229(java.lang.Object(ARRAY(i3426)), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3379) -> f9234_0_random_ArrayAccess(EOS(STATIC_9234(java.lang.Object(ARRAY(i3426)), i3379)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3379) :|: i3426 >= 0 25.12/7.84 f9234_0_random_ArrayAccess(EOS(STATIC_9234(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3428) -> f9240_0_random_ArrayAccess(EOS(STATIC_9240(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3428) :|: TRUE 25.12/7.84 f9240_0_random_ArrayAccess(EOS(STATIC_9240(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3428) -> f9247_0_random_ArrayAccess(EOS(STATIC_9247(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3428) :|: TRUE 25.12/7.84 f9247_0_random_ArrayAccess(EOS(STATIC_9247(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3426)), i3428) -> f9253_0_random_Store(EOS(STATIC_9253(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) :|: i3428 < i3426 25.12/7.84 f9253_0_random_Store(EOS(STATIC_9253(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) -> f9258_0_random_FieldAccess(EOS(STATIC_9258(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) :|: TRUE 25.12/7.84 f9258_0_random_FieldAccess(EOS(STATIC_9258(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) -> f9264_0_random_ConstantStackPush(EOS(STATIC_9264(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3428) :|: TRUE 25.12/7.84 f9264_0_random_ConstantStackPush(EOS(STATIC_9264(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3428) -> f9270_0_random_IntArithmetic(EOS(STATIC_9270(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3428, 1) :|: TRUE 25.12/7.84 f9270_0_random_IntArithmetic(EOS(STATIC_9270(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3428, matching1) -> f9277_0_random_FieldAccess(EOS(STATIC_9277(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3428 + 1) :|: i3428 >= 0 && matching1 = 1 25.12/7.84 f9277_0_random_FieldAccess(EOS(STATIC_9277(java.lang.Object(ARRAY(i3426)), i3428)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462, i3437) -> f9286_0_random_Load(EOS(STATIC_9286(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) :|: TRUE 25.12/7.84 f9286_0_random_Load(EOS(STATIC_9286(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) -> f9294_0_random_InvokeMethod(EOS(STATIC_9294(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5462) :|: TRUE 25.12/7.84 f9294_0_random_InvokeMethod(EOS(STATIC_9294(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5508sub)) -> f9300_0_random_InvokeMethod(EOS(STATIC_9300(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5508sub)) :|: TRUE 25.12/7.84 f9300_0_random_InvokeMethod(EOS(STATIC_9300(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) -> f9309_0_random_InvokeMethod(EOS(STATIC_9309(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) :|: TRUE 25.12/7.84 f9309_0_random_InvokeMethod(EOS(STATIC_9309(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) -> f9317_0_length_Load(EOS(STATIC_9317(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) :|: TRUE 25.12/7.84 f9317_0_length_Load(EOS(STATIC_9317(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) -> f9333_0_length_FieldAccess(EOS(STATIC_9333(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5527sub)) :|: TRUE 25.12/7.84 f9333_0_length_FieldAccess(EOS(STATIC_9333(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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, i3457))) -> f9341_0_length_FieldAccess(EOS(STATIC_9341(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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, i3457))) :|: i3457 >= 0 25.12/7.84 f9341_0_length_FieldAccess(EOS(STATIC_9341(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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, i3457))) -> f9348_0_length_Return(EOS(STATIC_9348(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9348_0_length_Return(EOS(STATIC_9348(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9357_0_random_Return(EOS(STATIC_9357(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9357_0_random_Return(EOS(STATIC_9357(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9365_0_createMap_InvokeMethod(EOS(STATIC_9365(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9365_0_createMap_InvokeMethod(EOS(STATIC_9365(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9371_0__init__Load(EOS(STATIC_9371(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9371_0__init__Load(EOS(STATIC_9371(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9388_0__init__InvokeMethod(EOS(STATIC_9388(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9388_0__init__InvokeMethod(EOS(STATIC_9388(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457, java.lang.Object(javaUtilEx.Content(EOC))) -> f9395_0__init__Load(EOS(STATIC_9395(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9395_0__init__Load(EOS(STATIC_9395(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9405_0__init__Load(EOS(STATIC_9405(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3457, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9405_0__init__Load(EOS(STATIC_9405(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3457, java.lang.Object(javaUtilEx.Content(EOC))) -> f9414_0__init__FieldAccess(EOS(STATIC_9414(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) :|: TRUE 25.12/7.84 f9414_0__init__FieldAccess(EOS(STATIC_9414(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3457) -> f9424_0__init__Return(EOS(STATIC_9424(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9424_0__init__Return(EOS(STATIC_9424(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f9433_0_createMap_Store(EOS(STATIC_9433(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9433_0_createMap_Store(EOS(STATIC_9433(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f9442_0_createMap_New(EOS(STATIC_9442(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9442_0_createMap_New(EOS(STATIC_9442(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f9452_0_createMap_Duplicate(EOS(STATIC_9452(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9452_0_createMap_Duplicate(EOS(STATIC_9452(java.lang.Object(ARRAY(i3426)), i3437)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9462_0_createMap_InvokeMethod(EOS(STATIC_9462(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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 25.12/7.84 f9462_0_createMap_InvokeMethod(EOS(STATIC_9462(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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))) -> f9472_0_random_FieldAccess(EOS(STATIC_9472(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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 25.12/7.84 f9472_0_random_FieldAccess(EOS(STATIC_9472(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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))) -> f9489_0_random_FieldAccess(EOS(STATIC_9489(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426))) :|: TRUE 25.12/7.84 f9489_0_random_FieldAccess(EOS(STATIC_9489(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426))) -> f9497_0_random_ArrayAccess(EOS(STATIC_9497(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426)), i3437) :|: TRUE 25.12/7.84 f9497_0_random_ArrayAccess(EOS(STATIC_9497(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426)), i3437) -> f9505_0_random_ArrayAccess(EOS(STATIC_9505(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426)), i3437) :|: TRUE 25.12/7.84 f9505_0_random_ArrayAccess(EOS(STATIC_9505(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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(i3426)), i3437) -> f9513_0_random_Store(EOS(STATIC_9513(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832) :|: i3437 < i3426 25.12/7.84 f9513_0_random_Store(EOS(STATIC_9513(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832) -> f9520_0_random_FieldAccess(EOS(STATIC_9520(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832) :|: TRUE 25.12/7.84 f9520_0_random_FieldAccess(EOS(STATIC_9520(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832) -> f9524_0_random_ConstantStackPush(EOS(STATIC_9524(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3437) :|: TRUE 25.12/7.84 f9524_0_random_ConstantStackPush(EOS(STATIC_9524(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3437) -> f9529_0_random_IntArithmetic(EOS(STATIC_9529(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3437, 1) :|: TRUE 25.12/7.84 f9529_0_random_IntArithmetic(EOS(STATIC_9529(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3437, matching1) -> f9534_0_random_FieldAccess(EOS(STATIC_9534(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3437 + 1) :|: i3437 > 0 && matching1 = 1 25.12/7.84 f9534_0_random_FieldAccess(EOS(STATIC_9534(java.lang.Object(ARRAY(i3426)), i3437)), i3398, 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)), o5832, i3618) -> f9538_0_random_Load(EOS(STATIC_9538(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), o5832) :|: TRUE 25.12/7.84 f9538_0_random_Load(EOS(STATIC_9538(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), o5832) -> f9542_0_random_InvokeMethod(EOS(STATIC_9542(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), o5832) :|: TRUE 25.12/7.84 f9542_0_random_InvokeMethod(EOS(STATIC_9542(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5855sub)) -> f9546_0_random_InvokeMethod(EOS(STATIC_9546(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5855sub)) :|: TRUE 25.12/7.84 f9546_0_random_InvokeMethod(EOS(STATIC_9546(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) -> f9550_0_random_InvokeMethod(EOS(STATIC_9550(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) :|: TRUE 25.12/7.84 f9550_0_random_InvokeMethod(EOS(STATIC_9550(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) -> f9554_0_length_Load(EOS(STATIC_9554(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) :|: TRUE 25.12/7.84 f9554_0_length_Load(EOS(STATIC_9554(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) -> f9561_0_length_FieldAccess(EOS(STATIC_9561(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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(o5856sub)) :|: TRUE 25.12/7.84 f9561_0_length_FieldAccess(EOS(STATIC_9561(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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, i3636))) -> f9566_0_length_FieldAccess(EOS(STATIC_9566(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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, i3636))) :|: i3636 >= 0 25.12/7.84 f9566_0_length_FieldAccess(EOS(STATIC_9566(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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, i3636))) -> f9571_0_length_Return(EOS(STATIC_9571(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9571_0_length_Return(EOS(STATIC_9571(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9575_0_random_Return(EOS(STATIC_9575(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9575_0_random_Return(EOS(STATIC_9575(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9579_0_createMap_InvokeMethod(EOS(STATIC_9579(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9579_0_createMap_InvokeMethod(EOS(STATIC_9579(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9584_0__init__Load(EOS(STATIC_9584(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9584_0__init__Load(EOS(STATIC_9584(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9593_0__init__InvokeMethod(EOS(STATIC_9593(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9593_0__init__InvokeMethod(EOS(STATIC_9593(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636, java.lang.Object(javaUtilEx.Content(EOC))) -> f9598_0__init__Load(EOS(STATIC_9598(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9598_0__init__Load(EOS(STATIC_9598(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9603_0__init__Load(EOS(STATIC_9603(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3636, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9603_0__init__Load(EOS(STATIC_9603(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3636, java.lang.Object(javaUtilEx.Content(EOC))) -> f9609_0__init__FieldAccess(EOS(STATIC_9609(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) :|: TRUE 25.12/7.84 f9609_0__init__FieldAccess(EOS(STATIC_9609(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)), i3636) -> f9614_0__init__Return(EOS(STATIC_9614(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9614_0__init__Return(EOS(STATIC_9614(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9619_0_createMap_Store(EOS(STATIC_9619(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9619_0_createMap_Store(EOS(STATIC_9619(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9625_0_createMap_Load(EOS(STATIC_9625(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 25.12/7.84 f9625_0_createMap_Load(EOS(STATIC_9625(java.lang.Object(ARRAY(i3426)), i3618)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f9631_0_createMap_Load(EOS(STATIC_9631(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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 25.12/7.84 f9631_0_createMap_Load(EOS(STATIC_9631(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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)))) -> f9637_0_createMap_Load(EOS(STATIC_9637(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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 25.12/7.84 f9637_0_createMap_Load(EOS(STATIC_9637(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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))) -> f9643_0_createMap_InvokeMethod(EOS(STATIC_9643(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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 25.12/7.84 f9643_0_createMap_InvokeMethod(EOS(STATIC_9643(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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))) -> f9649_0_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i3618)), 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))) :|: i3399 >= 1 && i3398 >= 1 && i3618 > 1 && i3399 >= i3398 25.12/7.84 f9643_0_createMap_InvokeMethod(EOS(STATIC_9643(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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))) -> f9649_1_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i3618)), i3398, 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))) :|: i3399 >= 1 && i3398 >= 1 && i3618 > 1 && i3399 >= i3398 25.12/7.84 f9649_0_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i3618)), 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))) -> f10992_0_put_Load(EOS(STATIC_10992(java.lang.Object(ARRAY(i3426)), i3618)), 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 25.12/7.84 f9919_0_put_Return(EOS(STATIC_9919(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9923_0_createMap_StackPop(EOS(STATIC_9923(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9923_0_createMap_StackPop(EOS(STATIC_9923(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9927_0_createMap_Inc(EOS(STATIC_9927(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9927_0_createMap_Inc(EOS(STATIC_9927(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9931_0_createMap_JMP(EOS(STATIC_9931(java.lang.Object(ARRAY(i3426)), i3956)), i3398 + -1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9931_0_createMap_JMP(EOS(STATIC_9931(java.lang.Object(ARRAY(i3426)), i3956)), i3964, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9935_0_createMap_Load(EOS(STATIC_9935(java.lang.Object(ARRAY(i3426)), i3956)), i3964, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9935_0_createMap_Load(EOS(STATIC_9935(java.lang.Object(ARRAY(i3426)), i3956)), i3964, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9189_0_createMap_Load(EOS(STATIC_9189(java.lang.Object(ARRAY(i3426)), i3956)), i3964, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9189_0_createMap_Load(EOS(STATIC_9189(java.lang.Object(o5363sub), i3379)), i3381, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9192_0_createMap_LE(EOS(STATIC_9192(java.lang.Object(o5363sub), i3379)), i3381, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3381) :|: TRUE 25.12/7.84 f9981_0_put_Return(EOS(STATIC_9981(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f9985_0_createMap_StackPop(EOS(STATIC_9985(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 25.12/7.84 f9985_0_createMap_StackPop(EOS(STATIC_9985(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f9989_0_createMap_Inc(EOS(STATIC_9989(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9989_0_createMap_Inc(EOS(STATIC_9989(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f9927_0_createMap_Inc(EOS(STATIC_9927(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f10431_0_put_Return(EOS(STATIC_10431(java.lang.Object(ARRAY(i3426)), i4218)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f9981_0_put_Return(EOS(STATIC_9981(java.lang.Object(ARRAY(i3426)), i4218)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 25.12/7.84 f9649_1_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i3956)), i3398, 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))) -> f9919_0_put_Return(EOS(STATIC_9919(java.lang.Object(ARRAY(i3426)), i3956)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 25.12/7.84 f9649_1_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i3999)), i3398, 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))) -> f9981_0_put_Return(EOS(STATIC_9981(java.lang.Object(ARRAY(i3426)), i3999)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 25.12/7.84 f9649_1_put_Load(EOS(STATIC_9649(java.lang.Object(ARRAY(i3426)), i4218)), i3398, 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))) -> f10431_0_put_Return(EOS(STATIC_10431(java.lang.Object(ARRAY(i3426)), i4218)), i3398, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 25.12/7.84 Combined rules. Obtained 2 IRulesP rules: 25.12/7.84 f9192_0_createMap_LE(EOS(STATIC_9192(java.lang.Object(ARRAY(i3426:0)), i3379:0)), i3398:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398:0) -> f9192_0_createMap_LE(EOS(STATIC_9192(java.lang.Object(ARRAY(i3426:0)), i3379:0 + 2)), i3398:0 - 1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398:0 - 1) :|: i3426:0 > i3379:0 + 1 && i3398:0 > 0 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 > 0 && i3399:0 >= i3398:0 25.12/7.84 Removed following non-SCC rules: 25.12/7.84 f9192_0_createMap_LE(EOS(STATIC_9192(java.lang.Object(ARRAY(i3426:0)), i3379:0)), i3398:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3398:0) -> f10992_0_put_Load(EOS(STATIC_10992(java.lang.Object(ARRAY(i3426:0)), i3379: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))) :|: i3426:0 > i3379:0 + 1 && i3398:0 > 0 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 > 0 && i3399:0 >= i3398:0 25.12/7.84 Filtered constant ground arguments: 25.12/7.84 f9192_0_createMap_LE(x1, x2, x3, x4) -> f9192_0_createMap_LE(x1, x2, x4) 25.12/7.84 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 25.12/7.84 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 25.12/7.84 Filtered duplicate arguments: 25.12/7.84 f9192_0_createMap_LE(x1, x2, x3) -> f9192_0_createMap_LE(x1, x3) 25.12/7.84 Finished conversion. Obtained 1 rules.P rules: 25.12/7.84 f9192_0_createMap_LE(i3398:0, i3426:0, i3379:0) -> f9192_0_createMap_LE(i3398:0 - 1, i3426:0, i3379:0 + 2) :|: i3398:0 > 0 && i3426:0 > i3379:0 + 1 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 >= i3398:0 && i3399:0 > 0 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (45) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9192_0_createMap_LE(i3398:0, i3426:0, i3379:0) -> f9192_0_createMap_LE(i3398:0 - 1, i3426:0, i3379:0 + 2) :|: i3398:0 > 0 && i3426:0 > i3379:0 + 1 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 >= i3398:0 && i3399:0 > 0 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (46) IRSFormatTransformerProof (EQUIVALENT) 25.12/7.84 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (47) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9192_0_createMap_LE(i3398:0, i3426:0, i3379:0) -> f9192_0_createMap_LE(arith, i3426:0, arith1) :|: i3398:0 > 0 && i3426:0 > i3379:0 + 1 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 >= i3398:0 && i3399:0 > 0 && arith = i3398:0 - 1 && arith1 = i3379:0 + 2 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (48) IRSwTTerminationDigraphProof (EQUIVALENT) 25.12/7.84 Constructed termination digraph! 25.12/7.84 Nodes: 25.12/7.84 (1) f9192_0_createMap_LE(i3398:0, i3426:0, i3379:0) -> f9192_0_createMap_LE(arith, i3426:0, arith1) :|: i3398:0 > 0 && i3426:0 > i3379:0 + 1 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 >= i3398:0 && i3399:0 > 0 && arith = i3398:0 - 1 && arith1 = i3379:0 + 2 25.12/7.84 25.12/7.84 Arcs: 25.12/7.84 (1) -> (1) 25.12/7.84 25.12/7.84 This digraph is fully evaluated! 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (49) 25.12/7.84 Obligation: 25.12/7.84 25.12/7.84 Termination digraph: 25.12/7.84 Nodes: 25.12/7.84 (1) f9192_0_createMap_LE(i3398:0, i3426:0, i3379:0) -> f9192_0_createMap_LE(arith, i3426:0, arith1) :|: i3398:0 > 0 && i3426:0 > i3379:0 + 1 && i3426:0 > -1 && i3379:0 > -1 && i3457:0 > -1 && i3636:0 > -1 && i3399:0 >= i3398:0 && i3399:0 > 0 && arith = i3398:0 - 1 && arith1 = i3379:0 + 2 25.12/7.84 25.12/7.84 Arcs: 25.12/7.84 (1) -> (1) 25.12/7.84 25.12/7.84 This digraph is fully evaluated! 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (50) IntTRSCompressionProof (EQUIVALENT) 25.12/7.84 Compressed rules. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (51) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9192_0_createMap_LE(i3398:0:0, i3426:0:0, i3379:0:0) -> f9192_0_createMap_LE(i3398:0:0 - 1, i3426:0:0, i3379:0:0 + 2) :|: i3399:0:0 >= i3398:0:0 && i3399:0:0 > 0 && i3636:0:0 > -1 && i3457:0:0 > -1 && i3379:0:0 > -1 && i3426:0:0 > -1 && i3426:0:0 > i3379:0:0 + 1 && i3398:0:0 > 0 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (52) TempFilterProof (SOUND) 25.12/7.84 Used the following sort dictionary for filtering: 25.12/7.84 f9192_0_createMap_LE(INTEGER, INTEGER, INTEGER) 25.12/7.84 Replaced non-predefined constructor symbols by 0. 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (53) 25.12/7.84 Obligation: 25.12/7.84 Rules: 25.12/7.84 f9192_0_createMap_LE(i3398:0:0, i3426:0:0, i3379:0:0) -> f9192_0_createMap_LE(c, i3426:0:0, c1) :|: c1 = i3379:0:0 + 2 && c = i3398:0:0 - 1 && (i3399:0:0 >= i3398:0:0 && i3399:0:0 > 0 && i3636:0:0 > -1 && i3457:0:0 > -1 && i3379:0:0 > -1 && i3426:0:0 > -1 && i3426:0:0 > i3379:0:0 + 1 && i3398:0:0 > 0) 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (54) RankingReductionPairProof (EQUIVALENT) 25.12/7.84 Interpretation: 25.12/7.84 [ f9192_0_createMap_LE ] = f9192_0_createMap_LE_1 25.12/7.84 25.12/7.84 The following rules are decreasing: 25.12/7.84 f9192_0_createMap_LE(i3398:0:0, i3426:0:0, i3379:0:0) -> f9192_0_createMap_LE(c, i3426:0:0, c1) :|: c1 = i3379:0:0 + 2 && c = i3398:0:0 - 1 && (i3399:0:0 >= i3398:0:0 && i3399:0:0 > 0 && i3636:0:0 > -1 && i3457:0:0 > -1 && i3379:0:0 > -1 && i3426:0:0 > -1 && i3426:0:0 > i3379:0:0 + 1 && i3398:0:0 > 0) 25.12/7.84 25.12/7.84 The following rules are bounded: 25.12/7.84 f9192_0_createMap_LE(i3398:0:0, i3426:0:0, i3379:0:0) -> f9192_0_createMap_LE(c, i3426:0:0, c1) :|: c1 = i3379:0:0 + 2 && c = i3398:0:0 - 1 && (i3399:0:0 >= i3398:0:0 && i3399:0:0 > 0 && i3636:0:0 > -1 && i3457:0:0 > -1 && i3379:0:0 > -1 && i3426:0:0 > -1 && i3426:0:0 > i3379:0:0 + 1 && i3398:0:0 > 0) 25.12/7.84 25.12/7.84 25.12/7.84 ---------------------------------------- 25.12/7.84 25.12/7.84 (55) 25.12/7.84 YES 25.26/7.97 EOF