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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 27.07/10.35 * 27.07/10.35 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

27.07/10.36	 *   Map m = Collections.synchronizedMap(new HashMap(...));
27.07/10.36 * 27.07/10.36 *

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

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

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

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

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

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

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

27.07/10.37 * 27.07/10.37 *

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

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

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

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

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

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

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

This interface is a member of the 27.07/10.37 * 27.07/10.37 * Java Collections Framework. 27.07/10.37 * 27.07/10.37 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 27.07/10.37 * 27.07/10.37 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

27.07/10.38	 *   Map m = Collections.synchronizedMap(new HashMap(...));
27.07/10.38 * 27.07/10.38 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This interface is a member of the 27.07/10.39 * 27.07/10.39 * Java Collections Framework. 27.07/10.39 * 27.07/10.39 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Note that the detail message associated with cause is 27.07/10.39 * not automatically incorporated in this exception's detail 27.07/10.39 * message. 27.07/10.39 * 27.07/10.39 * @param message the detail message (which is saved for later retrieval 27.07/10.39 * by the {@link Throwable#getMessage()} method). 27.07/10.39 * @param cause the cause (which is saved for later retrieval by the 27.07/10.39 * {@link Throwable#getCause()} method). (A null value 27.07/10.39 * is permitted, and indicates that the cause is nonexistent or 27.07/10.39 * unknown.) 27.07/10.39 * @since 1.5 27.07/10.39 */ 27.07/10.39 public UnsupportedOperationException(String message, Throwable cause) { 27.07/10.39 super(message, cause); 27.07/10.39 } 27.07/10.39 27.07/10.39 /** 27.07/10.39 * Constructs a new exception with the specified cause and a detail 27.07/10.39 * message of (cause==null ? null : cause.toString()) (which 27.07/10.39 * typically contains the class and detail message of cause). 27.07/10.39 * This constructor is useful for exceptions that are little more than 27.07/10.39 * wrappers for other throwables (for example, {@link 27.07/10.39 * java.security.PrivilegedActionException}). 27.07/10.39 * 27.07/10.39 * @param cause the cause (which is saved for later retrieval by the 27.07/10.39 * {@link Throwable#getCause()} method). (A null value is 27.07/10.39 * permitted, and indicates that the cause is nonexistent or 27.07/10.39 * unknown.) 27.07/10.39 * @since 1.5 27.07/10.39 */ 27.07/10.39 public UnsupportedOperationException(Throwable cause) { 27.07/10.39 super(cause); 27.07/10.39 } 27.07/10.39 27.07/10.39 static final long serialVersionUID = -1242599979055084673L; 27.07/10.39 } 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (3) JBCToGraph (EQUIVALENT) 27.07/10.39 Constructed TerminationGraph. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (4) 27.07/10.39 Obligation: 27.07/10.39 Termination Graph based on JBC Program: 27.07/10.39 javaUtilEx.juHashMapCreateRemove.main([Ljava/lang/String;)V: Graph of 258 nodes with 0 SCCs. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 javaUtilEx.juHashMapCreateRemove.createMap(I)LjavaUtilEx/HashMap;: Graph of 248 nodes with 1 SCC. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 javaUtilEx.HashMap.removeEntryForKey(Ljava/lang/Object;)LjavaUtilEx/HashMap$Entry;: Graph of 204 nodes with 1 SCC. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 javaUtilEx.Content.hashCode()I: Graph of 6 nodes with 0 SCCs. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;: Graph of 494 nodes with 2 SCCs. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 javaUtilEx.Content.equals(Ljava/lang/Object;)Z: Graph of 31 nodes with 0 SCCs. 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (5) TerminationGraphToSCCProof (SOUND) 27.07/10.39 Splitted TerminationGraph to 4 SCCss. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (6) 27.07/10.39 Complex Obligation (AND) 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (7) 27.07/10.39 Obligation: 27.07/10.39 SCC of termination graph based on JBC Program. 27.07/10.39 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 27.07/10.39 SCC calls the following helper methods: 27.07/10.39 Performed SCC analyses: 27.07/10.39 *Used field analysis yielded the following read fields: 27.07/10.39 *javaUtilEx.HashMap$Entry: [next, hash] 27.07/10.39 *Marker field analysis yielded the following relations that could be markers: 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (8) SCCToIRSProof (SOUND) 27.07/10.39 Transformed FIGraph SCCs to intTRSs. Log: 27.07/10.39 Generated rules. Obtained 58 IRulesP rules: 27.07/10.39 f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327) -> f11737_0_transfer_ArrayLength(EOS(STATIC_11737), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, java.lang.Object(ARRAY(i5326))) :|: TRUE 27.07/10.39 f11737_0_transfer_ArrayLength(EOS(STATIC_11737), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, java.lang.Object(ARRAY(i5326))) -> f11738_0_transfer_GE(EOS(STATIC_11738), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, i5326) :|: i5326 >= 0 27.07/10.39 f11738_0_transfer_GE(EOS(STATIC_11738), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, i5326) -> f11740_0_transfer_GE(EOS(STATIC_11740), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, i5326) :|: i5327 < i5326 27.07/10.39 f11740_0_transfer_GE(EOS(STATIC_11740), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327, i5326) -> f11742_0_transfer_Load(EOS(STATIC_11742), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) :|: i5327 < i5326 27.07/10.39 f11742_0_transfer_Load(EOS(STATIC_11742), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) -> f11744_0_transfer_Load(EOS(STATIC_11744), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326))) :|: TRUE 27.07/10.39 f11744_0_transfer_Load(EOS(STATIC_11744), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326))) -> f11746_0_transfer_ArrayAccess(EOS(STATIC_11746), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326)), i5327) :|: TRUE 27.07/10.39 f11746_0_transfer_ArrayAccess(EOS(STATIC_11746), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326)), i5327) -> f11748_0_transfer_ArrayAccess(EOS(STATIC_11748), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326)), i5327) :|: TRUE 27.07/10.39 f11748_0_transfer_ArrayAccess(EOS(STATIC_11748), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(ARRAY(i5326)), i5327) -> f11751_0_transfer_Store(EOS(STATIC_11751), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8432) :|: i5327 < i5326 27.07/10.39 f11751_0_transfer_Store(EOS(STATIC_11751), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8432) -> f11754_0_transfer_Load(EOS(STATIC_11754), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8432) :|: TRUE 27.07/10.39 f11754_0_transfer_Load(EOS(STATIC_11754), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8432) -> f11756_0_transfer_NULL(EOS(STATIC_11756), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8432, o8432) :|: TRUE 27.07/10.39 f11756_0_transfer_NULL(EOS(STATIC_11756), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(o8434sub)) -> f11759_0_transfer_NULL(EOS(STATIC_11759), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(o8434sub)) :|: TRUE 27.07/10.39 f11756_0_transfer_NULL(EOS(STATIC_11756), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) -> f11760_0_transfer_NULL(EOS(STATIC_11760), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) :|: TRUE 27.07/10.39 f11759_0_transfer_NULL(EOS(STATIC_11759), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(o8434sub)) -> f11763_0_transfer_Load(EOS(STATIC_11763), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub)) :|: TRUE 27.07/10.39 f11763_0_transfer_Load(EOS(STATIC_11763), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub)) -> f11766_0_transfer_Load(EOS(STATIC_11766), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326))) :|: TRUE 27.07/10.39 f11766_0_transfer_Load(EOS(STATIC_11766), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326))) -> f11770_0_transfer_ConstantStackPush(EOS(STATIC_11770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327) :|: TRUE 27.07/10.39 f11770_0_transfer_ConstantStackPush(EOS(STATIC_11770), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327) -> f11774_0_transfer_ArrayAccess(EOS(STATIC_11774), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327, NULL) :|: TRUE 27.07/10.39 f11774_0_transfer_ArrayAccess(EOS(STATIC_11774), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327, NULL) -> f11776_0_transfer_ArrayAccess(EOS(STATIC_11776), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327, NULL) :|: TRUE 27.07/10.39 f11776_0_transfer_ArrayAccess(EOS(STATIC_11776), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(ARRAY(i5326)), i5327, NULL) -> f11780_0_transfer_Load(EOS(STATIC_11780), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434put)) :|: i5327 < i5326 27.07/10.39 f11780_0_transfer_Load(EOS(STATIC_11780), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub)) -> f11784_0_transfer_FieldAccess(EOS(STATIC_11784), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8434sub), java.lang.Object(o8434sub)) :|: TRUE 27.07/10.39 f11784_0_transfer_FieldAccess(EOS(STATIC_11784), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) -> f11786_0_transfer_FieldAccess(EOS(STATIC_11786), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) :|: TRUE 27.07/10.39 f11786_0_transfer_FieldAccess(EOS(STATIC_11786), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) -> f11790_0_transfer_Store(EOS(STATIC_11790), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446) :|: TRUE 27.07/10.39 f11790_0_transfer_Store(EOS(STATIC_11790), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446) -> f11793_0_transfer_Load(EOS(STATIC_11793), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446) :|: TRUE 27.07/10.39 f11793_0_transfer_Load(EOS(STATIC_11793), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446) -> f11795_0_transfer_FieldAccess(EOS(STATIC_11795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) :|: TRUE 27.07/10.39 f11795_0_transfer_FieldAccess(EOS(STATIC_11795), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) -> f11798_0_transfer_Load(EOS(STATIC_11798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338) :|: TRUE 27.07/10.39 f11798_0_transfer_Load(EOS(STATIC_11798), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338) -> f11801_0_transfer_InvokeMethod(EOS(STATIC_11801), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) :|: TRUE 27.07/10.39 f11801_0_transfer_InvokeMethod(EOS(STATIC_11801), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) -> f11803_0_indexFor_Load(EOS(STATIC_11803), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) :|: TRUE 27.07/10.39 f11803_0_indexFor_Load(EOS(STATIC_11803), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) -> f11808_0_indexFor_Load(EOS(STATIC_11808), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5168, i5338) :|: TRUE 27.07/10.39 f11808_0_indexFor_Load(EOS(STATIC_11808), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5168, i5338) -> f11810_0_indexFor_ConstantStackPush(EOS(STATIC_11810), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) :|: TRUE 27.07/10.39 f11810_0_indexFor_ConstantStackPush(EOS(STATIC_11810), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168) -> f11813_0_indexFor_IntArithmetic(EOS(STATIC_11813), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168, 1) :|: TRUE 27.07/10.39 f11813_0_indexFor_IntArithmetic(EOS(STATIC_11813), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168, matching1) -> f11816_0_indexFor_IntArithmetic(EOS(STATIC_11816), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5168 - 1) :|: i5168 >= 0 && matching1 = 1 27.07/10.39 f11816_0_indexFor_IntArithmetic(EOS(STATIC_11816), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5338, i5355) -> f11818_0_indexFor_Return(EOS(STATIC_11818), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) :|: TRUE 27.07/10.39 f11818_0_indexFor_Return(EOS(STATIC_11818), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) -> f11821_0_transfer_Store(EOS(STATIC_11821), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) :|: TRUE 27.07/10.39 f11821_0_transfer_Store(EOS(STATIC_11821), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) -> f11824_0_transfer_Load(EOS(STATIC_11824), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) :|: TRUE 27.07/10.39 f11824_0_transfer_Load(EOS(STATIC_11824), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356) -> f11827_0_transfer_Load(EOS(STATIC_11827), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) :|: TRUE 27.07/10.39 f11827_0_transfer_Load(EOS(STATIC_11827), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338))) -> f11830_0_transfer_Load(EOS(STATIC_11830), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168))) :|: TRUE 27.07/10.39 f11830_0_transfer_Load(EOS(STATIC_11830), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168))) -> f11833_0_transfer_ArrayAccess(EOS(STATIC_11833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168)), i5356) :|: TRUE 27.07/10.39 f11833_0_transfer_ArrayAccess(EOS(STATIC_11833), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168)), i5356) -> f11836_0_transfer_ArrayAccess(EOS(STATIC_11836), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168)), i5356) :|: TRUE 27.07/10.39 f11836_0_transfer_ArrayAccess(EOS(STATIC_11836), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), java.lang.Object(ARRAY(i5168)), i5356) -> f11840_0_transfer_FieldAccess(EOS(STATIC_11840), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8466) :|: i5356 < i5168 27.07/10.39 f11840_0_transfer_FieldAccess(EOS(STATIC_11840), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8446, i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446, i5338)), o8466) -> f11844_0_transfer_Load(EOS(STATIC_11844), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, i5356) :|: TRUE 27.07/10.39 f11844_0_transfer_Load(EOS(STATIC_11844), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, i5356) -> f11846_0_transfer_Load(EOS(STATIC_11846), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, i5356, java.lang.Object(ARRAY(i5168))) :|: TRUE 27.07/10.39 f11846_0_transfer_Load(EOS(STATIC_11846), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, i5356, java.lang.Object(ARRAY(i5168))) -> f11850_0_transfer_Load(EOS(STATIC_11850), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, java.lang.Object(ARRAY(i5168)), i5356) :|: TRUE 27.07/10.39 f11850_0_transfer_Load(EOS(STATIC_11850), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338)), o8446, java.lang.Object(ARRAY(i5168)), i5356) -> f11853_0_transfer_ArrayAccess(EOS(STATIC_11853), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446, java.lang.Object(ARRAY(i5168)), i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338))) :|: TRUE 27.07/10.39 f11853_0_transfer_ArrayAccess(EOS(STATIC_11853), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446, java.lang.Object(ARRAY(i5168)), i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338))) -> f11855_0_transfer_ArrayAccess(EOS(STATIC_11855), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446, java.lang.Object(ARRAY(i5168)), i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338))) :|: TRUE 27.07/10.39 f11855_0_transfer_ArrayAccess(EOS(STATIC_11855), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446, java.lang.Object(ARRAY(i5168)), i5356, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8466, i5338))) -> f11859_0_transfer_Load(EOS(STATIC_11859), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) :|: i5356 < i5168 27.07/10.39 f11859_0_transfer_Load(EOS(STATIC_11859), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) -> f11863_0_transfer_Store(EOS(STATIC_11863), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) :|: TRUE 27.07/10.39 f11863_0_transfer_Store(EOS(STATIC_11863), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) -> f11864_0_transfer_Load(EOS(STATIC_11864), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) :|: TRUE 27.07/10.39 f11864_0_transfer_Load(EOS(STATIC_11864), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446) -> f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, o8446, o8446) :|: TRUE 27.07/10.39 f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub), java.lang.Object(o8489sub)) -> f11870_0_transfer_NONNULL(EOS(STATIC_11870), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub), java.lang.Object(o8489sub)) :|: TRUE 27.07/10.39 f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) -> f11871_0_transfer_NONNULL(EOS(STATIC_11871), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) :|: TRUE 27.07/10.39 f11870_0_transfer_NONNULL(EOS(STATIC_11870), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub), java.lang.Object(o8489sub)) -> f11872_0_transfer_Load(EOS(STATIC_11872), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub)) :|: TRUE 27.07/10.39 f11872_0_transfer_Load(EOS(STATIC_11872), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub)) -> f11780_0_transfer_Load(EOS(STATIC_11780), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, java.lang.Object(o8489sub)) :|: TRUE 27.07/10.39 f11871_0_transfer_NONNULL(EOS(STATIC_11871), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) -> f11873_0_transfer_Inc(EOS(STATIC_11873), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) :|: TRUE 27.07/10.39 f11873_0_transfer_Inc(EOS(STATIC_11873), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) -> f11876_0_transfer_JMP(EOS(STATIC_11876), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327 + 1) :|: TRUE 27.07/10.39 f11876_0_transfer_JMP(EOS(STATIC_11876), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5374) -> f11879_0_transfer_Load(EOS(STATIC_11879), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5374) :|: TRUE 27.07/10.39 f11879_0_transfer_Load(EOS(STATIC_11879), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5374) -> f11735_0_transfer_Load(EOS(STATIC_11735), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5374) :|: TRUE 27.07/10.39 f11735_0_transfer_Load(EOS(STATIC_11735), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) -> f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, i5327) :|: TRUE 27.07/10.39 f11760_0_transfer_NULL(EOS(STATIC_11760), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327, NULL, NULL) -> f11764_0_transfer_Inc(EOS(STATIC_11764), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) :|: TRUE 27.07/10.39 f11764_0_transfer_Inc(EOS(STATIC_11764), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) -> f11873_0_transfer_Inc(EOS(STATIC_11873), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168, java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5168)), java.lang.Object(ARRAY(i5326)), i5168, i5327) :|: TRUE 27.07/10.39 Combined rules. Obtained 4 IRulesP rules: 27.07/10.39 f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446:0, i5338:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o8446:0, i5338:0))) -> f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, o8446:0, o8446:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, NULL, NULL) -> f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0 + 1, i5327:0 + 1) :|: TRUE 27.07/10.39 f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, i5327:0) -> f11867_0_transfer_NONNULL(EOS(STATIC_11867), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, o8446:0, o8446:0) :|: i5326:0 > -1 && i5327:0 < i5326:0 && i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0, i5327:0) -> f11736_0_transfer_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i5168:0, java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5168:0, i5327:0 + 1, i5327:0 + 1) :|: i5326:0 > -1 && i5327:0 < i5326:0 27.07/10.39 Filtered constant ground arguments: 27.07/10.39 f11867_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f11867_0_transfer_NONNULL(x4, x5, x6, x7, x8, x9, x10, x11) 27.07/10.39 f11736_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> f11736_0_transfer_Load(x4, x5, x6, x7, x8, x9, x10) 27.07/10.39 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 27.07/10.39 javaUtilEx.HashMap$Entry(x1, x2, x3) -> javaUtilEx.HashMap$Entry(x2, x3) 27.07/10.39 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 27.07/10.39 Filtered duplicate arguments: 27.07/10.39 f11867_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8) -> f11867_0_transfer_NONNULL(x3, x4, x6, x8) 27.07/10.39 f11736_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7) -> f11736_0_transfer_Load(x3, x4, x7) 27.07/10.39 Filtered unneeded arguments: 27.07/10.39 javaUtilEx.HashMap$Entry(x1, x2) -> javaUtilEx.HashMap$Entry(x1) 27.07/10.39 Finished conversion. Obtained 4 rules.P rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0)), i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, NULL, i5168:0, i5326:0) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0 + 1, i5168:0, i5326:0) :|: TRUE 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5327:0 < i5326:0 && i5326:0 > -1 && i5356:0 < i5168:0 && i5168:0 > -1 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, i5168:0, i5326:0) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0 + 1, i5168:0, i5326:0) :|: i5326:0 > -1 && i5327:0 < i5326:0 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (9) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0)), i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2 + 1, x, x1) :|: TRUE 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x3, x4) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x6, x3, x4) :|: x5 < x4 && x4 > -1 && x7 < x3 && x3 > -1 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10, x8, x9) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10 + 1, x8, x9) :|: x9 > -1 && x10 < x9 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (10) IRSFormatTransformerProof (EQUIVALENT) 27.07/10.39 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (11) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0)), i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x3, x4) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x6, x3, x4) :|: x5 < x4 && x4 > -1 && x7 < x3 && x3 > -1 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (12) IRSwTTerminationDigraphProof (EQUIVALENT) 27.07/10.39 Constructed termination digraph! 27.07/10.39 Nodes: 27.07/10.39 (1) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0)), i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 (2) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 27.07/10.39 (3) f11736_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x3, x4) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x6, x3, x4) :|: x5 < x4 && x4 > -1 && x7 < x3 && x3 > -1 27.07/10.39 (4) f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1), (2) 27.07/10.39 (2) -> (3), (4) 27.07/10.39 (3) -> (1), (2) 27.07/10.39 (4) -> (3), (4) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (13) 27.07/10.39 Obligation: 27.07/10.39 27.07/10.39 Termination digraph: 27.07/10.39 Nodes: 27.07/10.39 (1) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0)), i5168:0, i5326:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0)), java.lang.Object(ARRAY(i5326:0)), i5327:0, o8446:0, i5168:0, i5326:0) :|: i5168:0 > -1 && i5356:0 < i5168:0 27.07/10.39 (2) f11736_0_transfer_Load(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x3, x4) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x3)), java.lang.Object(ARRAY(x4)), x5, x6, x3, x4) :|: x5 < x4 && x4 > -1 && x7 < x3 && x3 > -1 27.07/10.39 (3) f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, x11, x12) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: x12 > -1 && x13 < x12 && x14 = x13 + 1 27.07/10.39 (4) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, NULL, x, x1) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), arith, x, x1) :|: TRUE && arith = x2 + 1 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1), (4) 27.07/10.39 (2) -> (1), (4) 27.07/10.39 (3) -> (2), (3) 27.07/10.39 (4) -> (2), (3) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (14) IntTRSCompressionProof (EQUIVALENT) 27.07/10.39 Compressed rules. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (15) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0, x11:0, x12:0) -> f11736_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 27.07/10.39 f11736_0_transfer_Load(java.lang.Object(ARRAY(x3:0)), java.lang.Object(ARRAY(x4:0)), x5:0, x3:0, x4:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x3:0)), java.lang.Object(ARRAY(x4:0)), x5:0, x6:0, x3:0, x4:0) :|: x7:0 < x3:0 && x3:0 > -1 && x4:0 > -1 && x5:0 < x4:0 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: i5168:0:0 > -1 && i5356:0:0 < i5168:0:0 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, NULL, x:0, x1:0) -> f11736_0_transfer_Load(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0 + 1, x:0, x1:0) :|: TRUE 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (16) TempFilterProof (SOUND) 27.07/10.39 Used the following sort dictionary for filtering: 27.07/10.39 f11736_0_transfer_Load(VARIABLE, VARIABLE, INTEGER, VARIABLE, VARIABLE) 27.07/10.39 java.lang.Object(VARIABLE) 27.07/10.39 ARRAY(VARIABLE) 27.07/10.39 f11867_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE) 27.07/10.39 javaUtilEx.HashMap$Entry(VARIABLE) 27.07/10.39 NULL() 27.07/10.39 Replaced non-predefined constructor symbols by 0.The following proof was generated: 27.07/10.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 27.07/10.39 27.07/10.39 27.07/10.39 Termination of the given IntTRS could not be shown: 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 - IntTRS 27.07/10.39 - RankingReductionPairProof 27.07/10.39 27.07/10.39 Rules: 27.07/10.39 f11736_0_transfer_Load(c, c1, x13:0, x11:0, x12:0) -> f11736_0_transfer_Load(c2, c3, c4, x11:0, x12:0) :|: c4 = x13:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x12:0 > -1 && x13:0 < x12:0) 27.07/10.39 f11736_0_transfer_Load(c5, c6, x5:0, x3:0, x4:0) -> f11867_0_transfer_NONNULL(c7, c8, x5:0, x6:0, x3:0, x4:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x7:0 < x3:0 && x3:0 > -1 && x4:0 > -1 && x5:0 < x4:0) 27.07/10.39 f11867_0_transfer_NONNULL(c9, c10, i5327:0:0, c11, i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(c12, c13, i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i5168:0:0 > -1 && i5356:0:0 < i5168:0:0) 27.07/10.39 f11867_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f11736_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 27.07/10.39 27.07/10.39 Interpretation: 27.07/10.39 [ f11736_0_transfer_Load ] = 2*f11736_0_transfer_Load_5 + -2*f11736_0_transfer_Load_3 + 2 27.07/10.39 [ f11867_0_transfer_NONNULL ] = -2*f11867_0_transfer_NONNULL_3 + 2*f11867_0_transfer_NONNULL_6 + 1 27.07/10.39 27.07/10.39 The following rules are decreasing: 27.07/10.39 f11736_0_transfer_Load(c, c1, x13:0, x11:0, x12:0) -> f11736_0_transfer_Load(c2, c3, c4, x11:0, x12:0) :|: c4 = x13:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x12:0 > -1 && x13:0 < x12:0) 27.07/10.39 f11736_0_transfer_Load(c5, c6, x5:0, x3:0, x4:0) -> f11867_0_transfer_NONNULL(c7, c8, x5:0, x6:0, x3:0, x4:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x7:0 < x3:0 && x3:0 > -1 && x4:0 > -1 && x5:0 < x4:0) 27.07/10.39 f11867_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f11736_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 27.07/10.39 27.07/10.39 The following rules are bounded: 27.07/10.39 f11736_0_transfer_Load(c, c1, x13:0, x11:0, x12:0) -> f11736_0_transfer_Load(c2, c3, c4, x11:0, x12:0) :|: c4 = x13:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x12:0 > -1 && x13:0 < x12:0) 27.07/10.39 f11736_0_transfer_Load(c5, c6, x5:0, x3:0, x4:0) -> f11867_0_transfer_NONNULL(c7, c8, x5:0, x6:0, x3:0, x4:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (x7:0 < x3:0 && x3:0 > -1 && x4:0 > -1 && x5:0 < x4:0) 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 - IntTRS 27.07/10.39 - RankingReductionPairProof 27.07/10.39 - IntTRS 27.07/10.39 - PolynomialOrderProcessor 27.07/10.39 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(c9, c10, i5327:0:0, c11, i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(c12, c13, i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i5168:0:0 > -1 && i5356:0:0 < i5168:0:0) 27.07/10.39 f11867_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f11736_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 27.07/10.39 27.07/10.39 Found the following polynomial interpretation: 27.07/10.39 [f11867_0_transfer_NONNULL(x, x1, x2, x3, x4, x5)] = 1 + c*x + c1*x1 27.07/10.39 [f11736_0_transfer_Load(x6, x7, x8, x9, x10)] = c6*x6 + c7*x7 27.07/10.39 27.07/10.39 The following rules are decreasing: 27.07/10.39 f11867_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f11736_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 27.07/10.39 The following rules are bounded: 27.07/10.39 f11867_0_transfer_NONNULL(c9, c10, i5327:0:0, c11, i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(c12, c13, i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i5168:0:0 > -1 && i5356:0:0 < i5168:0:0) 27.07/10.39 f11867_0_transfer_NONNULL(c14, c15, x2:0, c16, x:0, x1:0) -> f11736_0_transfer_Load(c17, c18, c19, x:0, x1:0) :|: c19 = x2:0 + 1 && (c18 = 0 && (c17 = 0 && (c16 = 0 && (c15 = 0 && c14 = 0)))) && TRUE 27.07/10.39 27.07/10.39 27.07/10.39 - IntTRS 27.07/10.39 - RankingReductionPairProof 27.07/10.39 - IntTRS 27.07/10.39 - PolynomialOrderProcessor 27.07/10.39 - IntTRS 27.07/10.39 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(c9, c10, i5327:0:0, c11, i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(c12, c13, i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0))) && (i5168:0:0 > -1 && i5356:0:0 < i5168:0:0) 27.07/10.39 27.07/10.39 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (17) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: i5168:0:0 > -1 && i5356:0:0 < i5168:0:0 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (18) IRSwTTerminationDigraphProof (EQUIVALENT) 27.07/10.39 Constructed termination digraph! 27.07/10.39 Nodes: 27.07/10.39 (1) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: i5168:0:0 > -1 && i5356:0:0 < i5168:0:0 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (19) 27.07/10.39 Obligation: 27.07/10.39 27.07/10.39 Termination digraph: 27.07/10.39 Nodes: 27.07/10.39 (1) f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), i5327:0:0, o8446:0:0, i5168:0:0, i5326:0:0) :|: i5168:0:0 > -1 && i5356:0:0 < i5168:0:0 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (20) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 27.07/10.39 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 27.07/10.39 27.07/10.39 f11867_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6) -> f11867_0_transfer_NONNULL(x1, x2, x4, x5, x6) 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (21) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5168:0:0, i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), o8446:0:0, i5168:0:0, i5326:0:0) :|: i5168:0:0 > -1 && i5356:0:0 < i5168:0:0 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (22) TempFilterProof (SOUND) 27.07/10.39 Used the following sort dictionary for filtering: 27.07/10.39 f11867_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, INTEGER, VARIABLE) 27.07/10.39 java.lang.Object(VARIABLE) 27.07/10.39 ARRAY(VARIABLE) 27.07/10.39 javaUtilEx.HashMap$Entry(VARIABLE) 27.07/10.39 Removed predefined arithmetic. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (23) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), o8446:0:0, i5326:0:0) 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (24) IRSwTToQDPProof (SOUND) 27.07/10.39 Removed the integers and created a QDP-Problem. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (25) 27.07/10.39 Obligation: 27.07/10.39 Q DP problem: 27.07/10.39 The TRS P consists of the following rules: 27.07/10.39 27.07/10.39 f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), o8446:0:0, i5326:0:0) 27.07/10.39 27.07/10.39 R is empty. 27.07/10.39 Q is empty. 27.07/10.39 We have to consider all (P,Q,R)-chains. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (26) QDPSizeChangeProof (EQUIVALENT) 27.07/10.39 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. 27.07/10.39 27.07/10.39 From the DPs we obtained the following set of size-change graphs: 27.07/10.39 *f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o8446:0:0)), i5326:0:0) -> f11867_0_transfer_NONNULL(java.lang.Object(ARRAY(i5168:0:0)), java.lang.Object(ARRAY(i5326:0:0)), o8446:0:0, i5326:0:0) 27.07/10.39 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 2 > 4, 4 >= 4 27.07/10.39 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (27) 27.07/10.39 YES 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (28) 27.07/10.39 Obligation: 27.07/10.39 SCC of termination graph based on JBC Program. 27.07/10.39 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 27.07/10.39 SCC calls the following helper methods: javaUtilEx.Content.equals(Ljava/lang/Object;)Z 27.07/10.39 Performed SCC analyses: 27.07/10.39 *Used field analysis yielded the following read fields: 27.07/10.39 *javaUtilEx.HashMap$Entry: [hash, next, key] 27.07/10.39 *Marker field analysis yielded the following relations that could be markers: 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (29) SCCToIRSProof (SOUND) 27.07/10.39 Transformed FIGraph SCCs to intTRSs. Log: 27.07/10.39 Generated rules. Obtained 57 IRulesP rules: 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub), java.lang.Object(o7446sub)) -> f11016_0_put_NULL(EOS(STATIC_11016), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub), java.lang.Object(o7446sub)) :|: TRUE 27.07/10.39 f11016_0_put_NULL(EOS(STATIC_11016), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub), java.lang.Object(o7446sub)) -> f11020_0_put_Load(EOS(STATIC_11020), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub)) :|: TRUE 27.07/10.39 f11020_0_put_Load(EOS(STATIC_11020), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub)) -> f11025_0_put_FieldAccess(EOS(STATIC_11025), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(o7446sub), java.lang.Object(o7446sub)) :|: TRUE 27.07/10.39 f11025_0_put_FieldAccess(EOS(STATIC_11025), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) -> f11029_0_put_FieldAccess(EOS(STATIC_11029), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) :|: TRUE 27.07/10.39 f11029_0_put_FieldAccess(EOS(STATIC_11029), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) -> f11033_0_put_Load(EOS(STATIC_11033), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762) :|: TRUE 27.07/10.39 f11033_0_put_Load(EOS(STATIC_11033), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762) -> f11037_0_put_NE(EOS(STATIC_11037), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762, i4733) :|: TRUE 27.07/10.39 f11037_0_put_NE(EOS(STATIC_11037), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762, i4733) -> f11042_0_put_NE(EOS(STATIC_11042), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762, i4733) :|: !(i4762 = i4733) 27.07/10.39 f11037_0_put_NE(EOS(STATIC_11037), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), i4733, i4733) -> f11043_0_put_NE(EOS(STATIC_11043), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), i4733, i4733) :|: i4762 = i4733 27.07/10.39 f11042_0_put_NE(EOS(STATIC_11042), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450)), i4762, i4733) -> f11048_0_put_Load(EOS(STATIC_11048), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) :|: !(i4762 = i4733) 27.07/10.39 f11048_0_put_Load(EOS(STATIC_11048), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) -> f11054_0_put_FieldAccess(EOS(STATIC_11054), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) :|: TRUE 27.07/10.39 f11054_0_put_FieldAccess(EOS(STATIC_11054), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762, o7452, o7450))) -> f11060_0_put_Store(EOS(STATIC_11060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11060_0_put_Store(EOS(STATIC_11060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) -> f11066_0_put_JMP(EOS(STATIC_11066), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11066_0_put_JMP(EOS(STATIC_11066), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) -> f11072_0_put_Load(EOS(STATIC_11072), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11072_0_put_Load(EOS(STATIC_11072), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) -> f11008_0_put_Load(EOS(STATIC_11008), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11008_0_put_Load(EOS(STATIC_11008), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7431) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7431, o7431) :|: TRUE 27.07/10.39 f11043_0_put_NE(EOS(STATIC_11043), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), i4733, i4733) -> f11049_0_put_Load(EOS(STATIC_11049), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450))) :|: TRUE 27.07/10.39 f11049_0_put_Load(EOS(STATIC_11049), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450))) -> f11055_0_put_FieldAccess(EOS(STATIC_11055), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450))) :|: TRUE 27.07/10.39 f11055_0_put_FieldAccess(EOS(STATIC_11055), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450))) -> f11061_0_put_Duplicate(EOS(STATIC_11061), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450) :|: TRUE 27.07/10.39 f11061_0_put_Duplicate(EOS(STATIC_11061), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450) -> f11067_0_put_Store(EOS(STATIC_11067), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450, o7450) :|: TRUE 27.07/10.39 f11067_0_put_Store(EOS(STATIC_11067), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450, o7450) -> f11073_0_put_Load(EOS(STATIC_11073), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450, o7450) :|: TRUE 27.07/10.39 f11073_0_put_Load(EOS(STATIC_11073), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450, o7450) -> f11078_0_put_EQ(EOS(STATIC_11078), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, o7450)), o7450, o7450, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.39 f11078_0_put_EQ(EOS(STATIC_11078), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11082_0_put_EQ(EOS(STATIC_11082), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.39 f11078_0_put_EQ(EOS(STATIC_11078), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11083_0_put_EQ(EOS(STATIC_11083), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.39 f11082_0_put_EQ(EOS(STATIC_11082), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11088_0_put_Load(EOS(STATIC_11088), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub)) :|: TRUE 27.07/10.39 f11088_0_put_Load(EOS(STATIC_11088), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub)) -> f11093_0_put_Load(EOS(STATIC_11093), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.39 f11093_0_put_Load(EOS(STATIC_11093), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11099_0_put_InvokeMethod(EOS(STATIC_11099), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) :|: TRUE 27.07/10.39 f11099_0_put_InvokeMethod(EOS(STATIC_11099), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) -> f11104_0_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) :|: TRUE 27.07/10.39 f11099_0_put_InvokeMethod(EOS(STATIC_11099), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) -> f11104_1_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) :|: TRUE 27.07/10.39 f11104_0_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) -> f12083_0_equals_Load(EOS(STATIC_12083), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7474sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub)) :|: TRUE 27.07/10.39 f11130_0_equals_Return(EOS(STATIC_11130), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub))), matching1) -> f11141_0_put_EQ(EOS(STATIC_11141), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub))), 0) :|: TRUE && matching1 = 0 27.07/10.39 f11141_0_put_EQ(EOS(STATIC_11141), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub))), matching1) -> f11156_0_put_Load(EOS(STATIC_11156), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub)))) :|: TRUE && matching1 = 0 27.07/10.39 f11156_0_put_Load(EOS(STATIC_11156), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub)))) -> f11165_0_put_FieldAccess(EOS(STATIC_11165), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub)))) :|: TRUE 27.07/10.39 f11165_0_put_FieldAccess(EOS(STATIC_11165), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub)))) -> f11175_0_put_Store(EOS(STATIC_11175), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11175_0_put_Store(EOS(STATIC_11175), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) -> f11060_0_put_Store(EOS(STATIC_11060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11131_0_equals_Return(EOS(STATIC_11131), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11133_0_equals_Return(EOS(STATIC_11133), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 27.07/10.39 f11133_0_equals_Return(EOS(STATIC_11133), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC)))), i4883) -> f11142_0_put_EQ(EOS(STATIC_11142), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC)))), i4883) :|: TRUE 27.07/10.39 f11142_0_put_EQ(EOS(STATIC_11142), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11158_0_put_EQ(EOS(STATIC_11158), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 27.07/10.39 f11158_0_put_EQ(EOS(STATIC_11158), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11167_0_put_Load(EOS(STATIC_11167), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE && matching1 = 0 27.07/10.39 f11167_0_put_Load(EOS(STATIC_11167), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11177_0_put_FieldAccess(EOS(STATIC_11177), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE 27.07/10.39 f11177_0_put_FieldAccess(EOS(STATIC_11177), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7673, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11185_0_put_Store(EOS(STATIC_11185), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7673) :|: TRUE 27.07/10.39 f11185_0_put_Store(EOS(STATIC_11185), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7673) -> f11060_0_put_Store(EOS(STATIC_11060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7673) :|: TRUE 27.07/10.39 f11132_0_equals_Return(EOS(STATIC_11132), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11133_0_equals_Return(EOS(STATIC_11133), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE && matching1 = 1 27.07/10.39 f11083_0_put_EQ(EOS(STATIC_11083), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11089_0_put_Load(EOS(STATIC_11089), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL) :|: TRUE 27.07/10.39 f11089_0_put_Load(EOS(STATIC_11089), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL) -> f11094_0_put_Load(EOS(STATIC_11094), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.39 f11094_0_put_Load(EOS(STATIC_11094), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11100_0_put_InvokeMethod(EOS(STATIC_11100), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.39 f11100_0_put_InvokeMethod(EOS(STATIC_11100), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11105_0_equals_Load(EOS(STATIC_11105), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.39 f11100_0_put_InvokeMethod(EOS(STATIC_11100), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11105_1_equals_Load(EOS(STATIC_11105), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.39 f11105_0_equals_Load(EOS(STATIC_11105), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f12139_0_equals_Load(EOS(STATIC_12139), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.39 f11135_0_equals_Return(EOS(STATIC_11135), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), matching1) -> f11143_0_put_EQ(EOS(STATIC_11143), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), 0) :|: TRUE && matching1 = 0 27.07/10.39 f11143_0_put_EQ(EOS(STATIC_11143), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), matching1) -> f11159_0_put_Load(EOS(STATIC_11159), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL))) :|: TRUE && matching1 = 0 27.07/10.39 f11159_0_put_Load(EOS(STATIC_11159), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL))) -> f11168_0_put_FieldAccess(EOS(STATIC_11168), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL))) :|: TRUE 27.07/10.39 f11168_0_put_FieldAccess(EOS(STATIC_11168), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL))) -> f11178_0_put_Store(EOS(STATIC_11178), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11178_0_put_Store(EOS(STATIC_11178), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) -> f11060_0_put_Store(EOS(STATIC_11060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, o7452) :|: TRUE 27.07/10.39 f11104_1_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7593sub)) -> f11130_0_equals_Return(EOS(STATIC_11130), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(o7593sub))), 0) :|: TRUE 27.07/10.39 f11104_1_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11131_0_equals_Return(EOS(STATIC_11131), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE 27.07/10.39 f11104_1_equals_Load(EOS(STATIC_11104), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11132_0_equals_Return(EOS(STATIC_11132), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE 27.07/10.39 f11105_1_equals_Load(EOS(STATIC_11105), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11135_0_equals_Return(EOS(STATIC_11135), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733, o7452, NULL)), 0) :|: TRUE 27.07/10.39 Combined rules. Obtained 7 IRulesP rules: 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762:0, o7452:0, o7450:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, o7452:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762:0, o7452:0, o7450:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, o7452:0, o7452:0) :|: i4762:0 > i4733:0 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(o7474sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(o7474sub:0)))) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, o7452:0, o7452:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, NULL))) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, o7452:0, o7452:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, o7452:0, o7452:0) :|: TRUE 27.07/10.39 Removed following non-SCC rules: 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(o7474sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(o7474sub:0)))) -> f12083_0_equals_Load(EOS(STATIC_12083), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub:0), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, java.lang.Object(o7474sub:0))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7474sub:0)) :|: TRUE 27.07/10.39 f11012_0_put_NULL(EOS(STATIC_11012), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i4733:0, o7452:0, NULL))) -> f12139_0_equals_Load(EOS(STATIC_12139), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.39 Filtered constant ground arguments: 27.07/10.39 f11012_0_put_NULL(x1, x2, x3, x4, x5, x6, x7) -> f11012_0_put_NULL(x5, x6, x7) 27.07/10.39 EOS(x1) -> EOS 27.07/10.39 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 27.07/10.39 javaUtilEx.Content(x1) -> javaUtilEx.Content 27.07/10.39 javaUtilEx.HashMap$Entry(x1, x2, x3, x4) -> javaUtilEx.HashMap$Entry(x2, x3, x4) 27.07/10.39 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 27.07/10.39 Filtered duplicate arguments: 27.07/10.39 f11012_0_put_NULL(x1, x2, x3) -> f11012_0_put_NULL(x1, x3) 27.07/10.39 Finished conversion. Obtained 5 rules.P rules: 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 > i4733:0 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4733:0, o7452:0, java.lang.Object(o7474sub:0)))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4733:0, o7452:0, NULL))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4733:0, o7452:0, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: TRUE 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (30) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 f11012_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11012_0_put_NULL(x, x2) :|: x1 > x 27.07/10.39 f11012_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11012_0_put_NULL(x4, x5) :|: TRUE 27.07/10.39 f11012_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, NULL))) -> f11012_0_put_NULL(x7, x8) :|: TRUE 27.07/10.39 f11012_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9, x10) :|: TRUE 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (31) IRSFormatTransformerProof (EQUIVALENT) 27.07/10.39 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (32) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 f11012_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11012_0_put_NULL(x, x2) :|: x1 > x 27.07/10.39 f11012_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11012_0_put_NULL(x4, x5) :|: TRUE 27.07/10.39 f11012_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, NULL))) -> f11012_0_put_NULL(x7, x8) :|: TRUE 27.07/10.39 f11012_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9, x10) :|: TRUE 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (33) IRSwTTerminationDigraphProof (EQUIVALENT) 27.07/10.39 Constructed termination digraph! 27.07/10.39 Nodes: 27.07/10.39 (1) f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 (2) f11012_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11012_0_put_NULL(x, x2) :|: x1 > x 27.07/10.39 (3) f11012_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11012_0_put_NULL(x4, x5) :|: TRUE 27.07/10.39 (4) f11012_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, NULL))) -> f11012_0_put_NULL(x7, x8) :|: TRUE 27.07/10.39 (5) f11012_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9, x10) :|: TRUE 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1), (2), (3), (4), (5) 27.07/10.39 (2) -> (1), (2), (3), (4), (5) 27.07/10.39 (3) -> (1), (2), (3), (4), (5) 27.07/10.39 (4) -> (1), (2), (3), (4), (5) 27.07/10.39 (5) -> (1), (2), (3), (4), (5) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (34) 27.07/10.39 Obligation: 27.07/10.39 27.07/10.39 Termination digraph: 27.07/10.39 Nodes: 27.07/10.39 (1) f11012_0_put_NULL(i4733:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0, o7452:0, o7450:0))) -> f11012_0_put_NULL(i4733:0, o7452:0) :|: i4762:0 < i4733:0 27.07/10.39 (2) f11012_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11012_0_put_NULL(x, x2) :|: x1 > x 27.07/10.39 (3) f11012_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11012_0_put_NULL(x4, x5) :|: TRUE 27.07/10.39 (4) f11012_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, NULL))) -> f11012_0_put_NULL(x7, x8) :|: TRUE 27.07/10.39 (5) f11012_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9, x10) :|: TRUE 27.07/10.39 27.07/10.39 Arcs: 27.07/10.39 (1) -> (1), (2), (3), (4), (5) 27.07/10.39 (2) -> (1), (2), (3), (4), (5) 27.07/10.39 (3) -> (1), (2), (3), (4), (5) 27.07/10.39 (4) -> (1), (2), (3), (4), (5) 27.07/10.39 (5) -> (1), (2), (3), (4), (5) 27.07/10.39 27.07/10.39 This digraph is fully evaluated! 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (35) IntTRSCompressionProof (EQUIVALENT) 27.07/10.39 Compressed rules. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (36) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11012_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11012_0_put_NULL(x4:0, x5:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f11012_0_put_NULL(x:0, x2:0) :|: x:0 < x1:0 27.07/10.39 f11012_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9:0, x10:0) :|: TRUE 27.07/10.39 f11012_0_put_NULL(i4733:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i4762:0:0, o7452:0:0, o7450:0:0))) -> f11012_0_put_NULL(i4733:0:0, o7452:0:0) :|: i4762:0:0 < i4733:0:0 27.07/10.39 f11012_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, NULL))) -> f11012_0_put_NULL(x7:0, x8:0) :|: TRUE 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (37) TempFilterProof (SOUND) 27.07/10.39 Used the following sort dictionary for filtering: 27.07/10.39 f11012_0_put_NULL(VARIABLE, VARIABLE) 27.07/10.39 java.lang.Object(VARIABLE) 27.07/10.39 javaUtilEx.HashMap$Entry(VARIABLE, VARIABLE, VARIABLE) 27.07/10.39 javaUtilEx.Content() 27.07/10.39 NULL() 27.07/10.39 Removed predefined arithmetic. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (38) 27.07/10.39 Obligation: 27.07/10.39 Rules: 27.07/10.39 f11012_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11012_0_put_NULL(x4:0, x5:0) 27.07/10.39 f11012_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f11012_0_put_NULL(x:0, x2:0) 27.07/10.39 f11012_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9:0, x10:0) 27.07/10.39 f11012_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, NULL))) -> f11012_0_put_NULL(x7:0, x8:0) 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (39) IRSwTToQDPProof (SOUND) 27.07/10.39 Removed the integers and created a QDP-Problem. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (40) 27.07/10.39 Obligation: 27.07/10.39 Q DP problem: 27.07/10.39 The TRS P consists of the following rules: 27.07/10.39 27.07/10.39 f11012_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11012_0_put_NULL(x4:0, x5:0) 27.07/10.39 f11012_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f11012_0_put_NULL(x:0, x2:0) 27.07/10.39 f11012_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9:0, x10:0) 27.07/10.39 f11012_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, NULL))) -> f11012_0_put_NULL(x7:0, x8:0) 27.07/10.39 27.07/10.39 R is empty. 27.07/10.39 Q is empty. 27.07/10.39 We have to consider all (P,Q,R)-chains. 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (41) QDPSizeChangeProof (EQUIVALENT) 27.07/10.39 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. 27.07/10.39 27.07/10.39 From the DPs we obtained the following set of size-change graphs: 27.07/10.39 *f11012_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11012_0_put_NULL(x4:0, x5:0) 27.07/10.39 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.39 27.07/10.39 27.07/10.39 *f11012_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f11012_0_put_NULL(x:0, x2:0) 27.07/10.39 The graph contains the following edges 1 >= 1, 2 > 2 27.07/10.39 27.07/10.39 27.07/10.39 *f11012_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, java.lang.Object(javaUtilEx.Content)))) -> f11012_0_put_NULL(x9:0, x10:0) 27.07/10.39 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.39 27.07/10.39 27.07/10.39 *f11012_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, NULL))) -> f11012_0_put_NULL(x7:0, x8:0) 27.07/10.39 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.39 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (42) 27.07/10.39 YES 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (43) 27.07/10.39 Obligation: 27.07/10.39 SCC of termination graph based on JBC Program. 27.07/10.39 SCC contains nodes from the following methods: javaUtilEx.HashMap.removeEntryForKey(Ljava/lang/Object;)LjavaUtilEx/HashMap$Entry; 27.07/10.39 SCC calls the following helper methods: javaUtilEx.Content.equals(Ljava/lang/Object;)Z 27.07/10.39 Performed SCC analyses: 27.07/10.39 *Used field analysis yielded the following read fields: 27.07/10.39 *javaUtilEx.HashMap$Entry: [next, hash, key] 27.07/10.39 *Marker field analysis yielded the following relations that could be markers: 27.07/10.39 27.07/10.39 ---------------------------------------- 27.07/10.39 27.07/10.39 (44) SCCToIRSProof (SOUND) 27.07/10.39 Transformed FIGraph SCCs to intTRSs. Log: 27.07/10.39 Generated rules. Obtained 74 IRulesP rules: 27.07/10.39 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub), java.lang.Object(o7421sub)) -> f11000_0_removeEntryForKey_NULL(EOS(STATIC_11000), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub), java.lang.Object(o7421sub)) :|: TRUE 27.07/10.40 f11000_0_removeEntryForKey_NULL(EOS(STATIC_11000), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub), java.lang.Object(o7421sub)) -> f11005_0_removeEntryForKey_Load(EOS(STATIC_11005), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub)) :|: TRUE 27.07/10.40 f11005_0_removeEntryForKey_Load(EOS(STATIC_11005), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub)) -> f11010_0_removeEntryForKey_FieldAccess(EOS(STATIC_11010), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(o7421sub), java.lang.Object(o7421sub)) :|: TRUE 27.07/10.40 f11010_0_removeEntryForKey_FieldAccess(EOS(STATIC_11010), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) -> f11014_0_removeEntryForKey_FieldAccess(EOS(STATIC_11014), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) :|: TRUE 27.07/10.40 f11014_0_removeEntryForKey_FieldAccess(EOS(STATIC_11014), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) -> f11019_0_removeEntryForKey_Store(EOS(STATIC_11019), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11019_0_removeEntryForKey_Store(EOS(STATIC_11019), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11023_0_removeEntryForKey_Load(EOS(STATIC_11023), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11023_0_removeEntryForKey_Load(EOS(STATIC_11023), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11028_0_removeEntryForKey_FieldAccess(EOS(STATIC_11028), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) :|: TRUE 27.07/10.40 f11028_0_removeEntryForKey_FieldAccess(EOS(STATIC_11028), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) -> f11032_0_removeEntryForKey_Load(EOS(STATIC_11032), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757) :|: TRUE 27.07/10.40 f11032_0_removeEntryForKey_Load(EOS(STATIC_11032), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757) -> f11036_0_removeEntryForKey_NE(EOS(STATIC_11036), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757, i4712) :|: TRUE 27.07/10.40 f11036_0_removeEntryForKey_NE(EOS(STATIC_11036), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757, i4712) -> f11040_0_removeEntryForKey_NE(EOS(STATIC_11040), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757, i4712) :|: !(i4757 = i4712) 27.07/10.40 f11036_0_removeEntryForKey_NE(EOS(STATIC_11036), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, i4712, i4712) -> f11041_0_removeEntryForKey_NE(EOS(STATIC_11041), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, i4712, i4712) :|: i4757 = i4712 27.07/10.40 f11040_0_removeEntryForKey_NE(EOS(STATIC_11040), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445, i4757, i4712) -> f11046_0_removeEntryForKey_Load(EOS(STATIC_11046), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: !(i4757 = i4712) 27.07/10.40 f11046_0_removeEntryForKey_Load(EOS(STATIC_11046), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11052_0_removeEntryForKey_Store(EOS(STATIC_11052), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) :|: TRUE 27.07/10.40 f11052_0_removeEntryForKey_Store(EOS(STATIC_11052), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443))) -> f11058_0_removeEntryForKey_Load(EOS(STATIC_11058), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11058_0_removeEntryForKey_Load(EOS(STATIC_11058), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11064_0_removeEntryForKey_Store(EOS(STATIC_11064), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11064_0_removeEntryForKey_Store(EOS(STATIC_11064), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11070_0_removeEntryForKey_JMP(EOS(STATIC_11070), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11070_0_removeEntryForKey_JMP(EOS(STATIC_11070), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f11076_0_removeEntryForKey_Load(EOS(STATIC_11076), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f11076_0_removeEntryForKey_Load(EOS(STATIC_11076), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) -> f10990_0_removeEntryForKey_Load(EOS(STATIC_10990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4757, o7443)), o7445) :|: TRUE 27.07/10.40 f10990_0_removeEntryForKey_Load(EOS(STATIC_10990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, o7408) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, o7408, o7408) :|: TRUE 27.07/10.40 f11041_0_removeEntryForKey_NE(EOS(STATIC_11041), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, i4712, i4712) -> f11047_0_removeEntryForKey_Load(EOS(STATIC_11047), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445) :|: TRUE 27.07/10.40 f11047_0_removeEntryForKey_Load(EOS(STATIC_11047), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445) -> f11053_0_removeEntryForKey_FieldAccess(EOS(STATIC_11053), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443))) :|: TRUE 27.07/10.40 f11053_0_removeEntryForKey_FieldAccess(EOS(STATIC_11053), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443))) -> f11059_0_removeEntryForKey_Duplicate(EOS(STATIC_11059), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443) :|: TRUE 27.07/10.40 f11059_0_removeEntryForKey_Duplicate(EOS(STATIC_11059), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443) -> f11065_0_removeEntryForKey_Store(EOS(STATIC_11065), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443, o7443) :|: TRUE 27.07/10.40 f11065_0_removeEntryForKey_Store(EOS(STATIC_11065), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443, o7443) -> f11071_0_removeEntryForKey_Load(EOS(STATIC_11071), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443, o7443) :|: TRUE 27.07/10.40 f11071_0_removeEntryForKey_Load(EOS(STATIC_11071), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443, o7443) -> f11077_0_removeEntryForKey_EQ(EOS(STATIC_11077), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, o7443)), o7445, o7443, o7443, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11077_0_removeEntryForKey_EQ(EOS(STATIC_11077), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11080_0_removeEntryForKey_EQ(EOS(STATIC_11080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11077_0_removeEntryForKey_EQ(EOS(STATIC_11077), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11081_0_removeEntryForKey_EQ(EOS(STATIC_11081), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11080_0_removeEntryForKey_EQ(EOS(STATIC_11080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11086_0_removeEntryForKey_Load(EOS(STATIC_11086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11086_0_removeEntryForKey_Load(EOS(STATIC_11086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub)) -> f11091_0_removeEntryForKey_NULL(EOS(STATIC_11091), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11091_0_removeEntryForKey_NULL(EOS(STATIC_11091), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11097_0_removeEntryForKey_Load(EOS(STATIC_11097), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11097_0_removeEntryForKey_Load(EOS(STATIC_11097), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub)) -> f11102_0_removeEntryForKey_Load(EOS(STATIC_11102), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11102_0_removeEntryForKey_Load(EOS(STATIC_11102), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(o7473sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11109_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11109), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11109_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11109), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) -> f11116_0_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub), o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11109_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11109), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) -> f11116_1_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11116_0_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub), o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) -> f12287_0_equals_Load(EOS(STATIC_12287), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub), o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7473sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub)) :|: TRUE 27.07/10.40 f11147_0_equals_Return(EOS(STATIC_11147), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445, matching1) -> f11162_0_removeEntryForKey_EQ(EOS(STATIC_11162), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445, 0) :|: TRUE && matching1 = 0 27.07/10.40 f11162_0_removeEntryForKey_EQ(EOS(STATIC_11162), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445, matching1) -> f11171_0_removeEntryForKey_Load(EOS(STATIC_11171), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE && matching1 = 0 27.07/10.40 f11171_0_removeEntryForKey_Load(EOS(STATIC_11171), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) -> f11180_0_removeEntryForKey_Store(EOS(STATIC_11180), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub)))) :|: TRUE 27.07/10.40 f11180_0_removeEntryForKey_Store(EOS(STATIC_11180), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub)))) -> f11188_0_removeEntryForKey_Load(EOS(STATIC_11188), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE 27.07/10.40 f11188_0_removeEntryForKey_Load(EOS(STATIC_11188), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) -> f11195_0_removeEntryForKey_Store(EOS(STATIC_11195), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE 27.07/10.40 f11195_0_removeEntryForKey_Store(EOS(STATIC_11195), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) -> f11201_0_removeEntryForKey_JMP(EOS(STATIC_11201), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE 27.07/10.40 f11201_0_removeEntryForKey_JMP(EOS(STATIC_11201), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) -> f11208_0_removeEntryForKey_Load(EOS(STATIC_11208), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE 27.07/10.40 f11208_0_removeEntryForKey_Load(EOS(STATIC_11208), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) -> f10990_0_removeEntryForKey_Load(EOS(STATIC_10990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445) :|: TRUE 27.07/10.40 f11148_0_equals_Return(EOS(STATIC_11148), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, matching1) -> f11150_0_equals_Return(EOS(STATIC_11150), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, 0) :|: TRUE && matching1 = 0 27.07/10.40 f11150_0_equals_Return(EOS(STATIC_11150), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7839, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842, i4957) -> f11163_0_removeEntryForKey_EQ(EOS(STATIC_11163), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7839, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842, i4957) :|: TRUE 27.07/10.40 f11163_0_removeEntryForKey_EQ(EOS(STATIC_11163), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7839, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842, matching1) -> f11173_0_removeEntryForKey_EQ(EOS(STATIC_11173), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7839, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842, 0) :|: TRUE && matching1 = 0 27.07/10.40 f11173_0_removeEntryForKey_EQ(EOS(STATIC_11173), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7839, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842, matching1) -> f11182_0_removeEntryForKey_Load(EOS(STATIC_11182), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE && matching1 = 0 27.07/10.40 f11182_0_removeEntryForKey_Load(EOS(STATIC_11182), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) -> f11190_0_removeEntryForKey_Store(EOS(STATIC_11190), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7842, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE 27.07/10.40 f11190_0_removeEntryForKey_Store(EOS(STATIC_11190), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7842, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11197_0_removeEntryForKey_Load(EOS(STATIC_11197), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE 27.07/10.40 f11197_0_removeEntryForKey_Load(EOS(STATIC_11197), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) -> f11203_0_removeEntryForKey_Store(EOS(STATIC_11203), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE 27.07/10.40 f11203_0_removeEntryForKey_Store(EOS(STATIC_11203), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) -> f11210_0_removeEntryForKey_JMP(EOS(STATIC_11210), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE 27.07/10.40 f11210_0_removeEntryForKey_JMP(EOS(STATIC_11210), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) -> f11215_0_removeEntryForKey_Load(EOS(STATIC_11215), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE 27.07/10.40 f11215_0_removeEntryForKey_Load(EOS(STATIC_11215), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) -> f10990_0_removeEntryForKey_Load(EOS(STATIC_10990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7842, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7842) :|: TRUE 27.07/10.40 f11149_0_equals_Return(EOS(STATIC_11149), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, matching1) -> f11150_0_equals_Return(EOS(STATIC_11150), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, 1) :|: TRUE && matching1 = 1 27.07/10.40 f11081_0_removeEntryForKey_EQ(EOS(STATIC_11081), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11087_0_removeEntryForKey_Load(EOS(STATIC_11087), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL) :|: TRUE 27.07/10.40 f11087_0_removeEntryForKey_Load(EOS(STATIC_11087), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL) -> f11092_0_removeEntryForKey_NULL(EOS(STATIC_11092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11092_0_removeEntryForKey_NULL(EOS(STATIC_11092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11098_0_removeEntryForKey_Load(EOS(STATIC_11098), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL) :|: TRUE 27.07/10.40 f11098_0_removeEntryForKey_Load(EOS(STATIC_11098), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL) -> f11103_0_removeEntryForKey_Load(EOS(STATIC_11103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f11103_0_removeEntryForKey_Load(EOS(STATIC_11103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11110_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11110), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.40 f11110_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11110), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11117_0_equals_Load(EOS(STATIC_11117), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.40 f11110_0_removeEntryForKey_InvokeMethod(EOS(STATIC_11110), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11117_1_equals_Load(EOS(STATIC_11117), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.40 f11117_0_equals_Load(EOS(STATIC_11117), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f12359_0_equals_Load(EOS(STATIC_12359), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.40 f11152_0_equals_Return(EOS(STATIC_11152), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, matching1) -> f11164_0_removeEntryForKey_EQ(EOS(STATIC_11164), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, 0) :|: TRUE && matching1 = 0 27.07/10.40 f11164_0_removeEntryForKey_EQ(EOS(STATIC_11164), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, matching1) -> f11174_0_removeEntryForKey_Load(EOS(STATIC_11174), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE && matching1 = 0 27.07/10.40 f11174_0_removeEntryForKey_Load(EOS(STATIC_11174), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) -> f11183_0_removeEntryForKey_Store(EOS(STATIC_11183), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL))) :|: TRUE 27.07/10.40 f11183_0_removeEntryForKey_Store(EOS(STATIC_11183), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7445, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL))) -> f11191_0_removeEntryForKey_Load(EOS(STATIC_11191), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE 27.07/10.40 f11191_0_removeEntryForKey_Load(EOS(STATIC_11191), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) -> f11198_0_removeEntryForKey_Store(EOS(STATIC_11198), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE 27.07/10.40 f11198_0_removeEntryForKey_Store(EOS(STATIC_11198), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) -> f11204_0_removeEntryForKey_JMP(EOS(STATIC_11204), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE 27.07/10.40 f11204_0_removeEntryForKey_JMP(EOS(STATIC_11204), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) -> f11211_0_removeEntryForKey_Load(EOS(STATIC_11211), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE 27.07/10.40 f11211_0_removeEntryForKey_Load(EOS(STATIC_11211), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) -> f10990_0_removeEntryForKey_Load(EOS(STATIC_10990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445) :|: TRUE 27.07/10.40 f11116_1_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7719sub)) -> f11147_0_equals_Return(EOS(STATIC_11147), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(o7719sub))), o7445, 0) :|: TRUE 27.07/10.40 f11116_1_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11148_0_equals_Return(EOS(STATIC_11148), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, 0) :|: TRUE 27.07/10.40 f11116_1_equals_Load(EOS(STATIC_11116), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11149_0_equals_Return(EOS(STATIC_11149), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, java.lang.Object(javaUtilEx.Content(EOC)))), o7445, 1) :|: TRUE 27.07/10.40 f11117_1_equals_Load(EOS(STATIC_11117), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11152_0_equals_Return(EOS(STATIC_11152), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712, o7407, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445, i4712, NULL)), o7445, 0) :|: TRUE 27.07/10.40 Combined rules. Obtained 7 IRulesP rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0))), o7445:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(javaUtilEx.Content(EOC))))) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(javaUtilEx.Content(EOC)))), o7445:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, NULL))) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, NULL)), o7445:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0))) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0)), o7445:0, o7445:0) :|: i4757:0 < i4712:0 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0))) -> f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4757:0, o7443:0)), o7445:0, o7445:0) :|: i4757:0 > i4712:0 27.07/10.40 Removed following non-SCC rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, NULL))) -> f12359_0_equals_Load(EOS(STATIC_12359), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(EOS(STATIC_10995), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4712:0, o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f12287_0_equals_Load(EOS(STATIC_12287), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub:0), o7407:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7445:0, i4712:0, java.lang.Object(o7473sub:0))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7473sub:0)) :|: TRUE 27.07/10.40 Filtered constant ground arguments: 27.07/10.40 f10995_0_removeEntryForKey_NULL(x1, x2, x3, x4, x5, x6, x7) -> f10995_0_removeEntryForKey_NULL(x4, x5, x6, x7) 27.07/10.40 EOS(x1) -> EOS 27.07/10.40 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 27.07/10.40 javaUtilEx.Content(x1) -> javaUtilEx.Content 27.07/10.40 javaUtilEx.HashMap$Entry(x1, x2, x3, x4) -> javaUtilEx.HashMap$Entry(x2, x3, x4) 27.07/10.40 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 27.07/10.40 Filtered duplicate arguments: 27.07/10.40 f10995_0_removeEntryForKey_NULL(x1, x2, x3, x4) -> f10995_0_removeEntryForKey_NULL(x1, x2, x4) 27.07/10.40 Filtered unneeded arguments: 27.07/10.40 f10995_0_removeEntryForKey_NULL(x1, x2, x3) -> f10995_0_removeEntryForKey_NULL(x1, x3) 27.07/10.40 Finished conversion. Obtained 5 rules.P rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, NULL))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4757:0, o7443:0))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: i4757:0 < i4712:0 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4757:0, o7443:0))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: i4757:0 > i4712:0 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (45) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x, x1) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3, x2, NULL))) -> f10995_0_removeEntryForKey_NULL(x2, x3) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f10995_0_removeEntryForKey_NULL(x4, x5) :|: x6 < x4 27.07/10.40 f10995_0_removeEntryForKey_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, x11))) -> f10995_0_removeEntryForKey_NULL(x8, x9) :|: x10 > x8 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (46) IRSFormatTransformerProof (EQUIVALENT) 27.07/10.40 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (47) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x, x1) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3, x2, NULL))) -> f10995_0_removeEntryForKey_NULL(x2, x3) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f10995_0_removeEntryForKey_NULL(x4, x5) :|: x6 < x4 27.07/10.40 f10995_0_removeEntryForKey_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, x11))) -> f10995_0_removeEntryForKey_NULL(x8, x9) :|: x10 > x8 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (48) IRSwTTerminationDigraphProof (EQUIVALENT) 27.07/10.40 Constructed termination digraph! 27.07/10.40 Nodes: 27.07/10.40 (1) f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 (2) f10995_0_removeEntryForKey_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x, x1) :|: TRUE 27.07/10.40 (3) f10995_0_removeEntryForKey_NULL(x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3, x2, NULL))) -> f10995_0_removeEntryForKey_NULL(x2, x3) :|: TRUE 27.07/10.40 (4) f10995_0_removeEntryForKey_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f10995_0_removeEntryForKey_NULL(x4, x5) :|: x6 < x4 27.07/10.40 (5) f10995_0_removeEntryForKey_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, x11))) -> f10995_0_removeEntryForKey_NULL(x8, x9) :|: x10 > x8 27.07/10.40 27.07/10.40 Arcs: 27.07/10.40 (1) -> (1), (2), (3), (4), (5) 27.07/10.40 (2) -> (1), (2), (3), (4), (5) 27.07/10.40 (3) -> (1), (2), (3), (4), (5) 27.07/10.40 (4) -> (1), (2), (3), (4), (5) 27.07/10.40 (5) -> (1), (2), (3), (4), (5) 27.07/10.40 27.07/10.40 This digraph is fully evaluated! 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (49) 27.07/10.40 Obligation: 27.07/10.40 27.07/10.40 Termination digraph: 27.07/10.40 Nodes: 27.07/10.40 (1) f10995_0_removeEntryForKey_NULL(i4712:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0, i4712:0, java.lang.Object(o7473sub:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0, o7445:0) :|: TRUE 27.07/10.40 (2) f10995_0_removeEntryForKey_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x, x1) :|: TRUE 27.07/10.40 (3) f10995_0_removeEntryForKey_NULL(x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3, x2, NULL))) -> f10995_0_removeEntryForKey_NULL(x2, x3) :|: TRUE 27.07/10.40 (4) f10995_0_removeEntryForKey_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x5, x6, x7))) -> f10995_0_removeEntryForKey_NULL(x4, x5) :|: x6 < x4 27.07/10.40 (5) f10995_0_removeEntryForKey_NULL(x8, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, x11))) -> f10995_0_removeEntryForKey_NULL(x8, x9) :|: x10 > x8 27.07/10.40 27.07/10.40 Arcs: 27.07/10.40 (1) -> (1), (2), (3), (4), (5) 27.07/10.40 (2) -> (1), (2), (3), (4), (5) 27.07/10.40 (3) -> (1), (2), (3), (4), (5) 27.07/10.40 (4) -> (1), (2), (3), (4), (5) 27.07/10.40 (5) -> (1), (2), (3), (4), (5) 27.07/10.40 27.07/10.40 This digraph is fully evaluated! 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (50) IntTRSCompressionProof (EQUIVALENT) 27.07/10.40 Compressed rules. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (51) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, x11:0))) -> f10995_0_removeEntryForKey_NULL(x8:0, x9:0) :|: x8:0 < x10:0 27.07/10.40 f10995_0_removeEntryForKey_NULL(x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0, x2:0, NULL))) -> f10995_0_removeEntryForKey_NULL(x2:0, x3:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x:0, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x:0, x1:0) :|: TRUE 27.07/10.40 f10995_0_removeEntryForKey_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x5:0, x6:0, x7:0))) -> f10995_0_removeEntryForKey_NULL(x4:0, x5:0) :|: x6:0 < x4:0 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0:0, i4712:0:0, java.lang.Object(o7473sub:0:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0:0, o7445:0:0) :|: TRUE 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (52) TempFilterProof (SOUND) 27.07/10.40 Used the following sort dictionary for filtering: 27.07/10.40 f10995_0_removeEntryForKey_NULL(VARIABLE, VARIABLE) 27.07/10.40 java.lang.Object(VARIABLE) 27.07/10.40 javaUtilEx.HashMap$Entry(VARIABLE, VARIABLE, VARIABLE) 27.07/10.40 NULL() 27.07/10.40 javaUtilEx.Content() 27.07/10.40 Removed predefined arithmetic. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (53) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10995_0_removeEntryForKey_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, x11:0))) -> f10995_0_removeEntryForKey_NULL(x8:0, x9:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0, x2:0, NULL))) -> f10995_0_removeEntryForKey_NULL(x2:0, x3:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x:0, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x:0, x1:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0:0, i4712:0:0, java.lang.Object(o7473sub:0:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0:0, o7445:0:0) 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (54) IRSwTToQDPProof (SOUND) 27.07/10.40 Removed the integers and created a QDP-Problem. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (55) 27.07/10.40 Obligation: 27.07/10.40 Q DP problem: 27.07/10.40 The TRS P consists of the following rules: 27.07/10.40 27.07/10.40 f10995_0_removeEntryForKey_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, x11:0))) -> f10995_0_removeEntryForKey_NULL(x8:0, x9:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0, x2:0, NULL))) -> f10995_0_removeEntryForKey_NULL(x2:0, x3:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x:0, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x:0, x1:0) 27.07/10.40 f10995_0_removeEntryForKey_NULL(i4712:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0:0, i4712:0:0, java.lang.Object(o7473sub:0:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0:0, o7445:0:0) 27.07/10.40 27.07/10.40 R is empty. 27.07/10.40 Q is empty. 27.07/10.40 We have to consider all (P,Q,R)-chains. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (56) QDPSizeChangeProof (EQUIVALENT) 27.07/10.40 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. 27.07/10.40 27.07/10.40 From the DPs we obtained the following set of size-change graphs: 27.07/10.40 *f10995_0_removeEntryForKey_NULL(x8:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, x11:0))) -> f10995_0_removeEntryForKey_NULL(x8:0, x9:0) 27.07/10.40 The graph contains the following edges 1 >= 1, 2 > 2 27.07/10.40 27.07/10.40 27.07/10.40 *f10995_0_removeEntryForKey_NULL(x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0, x2:0, NULL))) -> f10995_0_removeEntryForKey_NULL(x2:0, x3:0) 27.07/10.40 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.40 27.07/10.40 27.07/10.40 *f10995_0_removeEntryForKey_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x:0, java.lang.Object(javaUtilEx.Content)))) -> f10995_0_removeEntryForKey_NULL(x:0, x1:0) 27.07/10.40 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.40 27.07/10.40 27.07/10.40 *f10995_0_removeEntryForKey_NULL(i4712:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7445:0:0, i4712:0:0, java.lang.Object(o7473sub:0:0)))) -> f10995_0_removeEntryForKey_NULL(i4712:0:0, o7445:0:0) 27.07/10.40 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 27.07/10.40 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (57) 27.07/10.40 YES 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (58) 27.07/10.40 Obligation: 27.07/10.40 SCC of termination graph based on JBC Program. 27.07/10.40 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreateRemove.createMap(I)LjavaUtilEx/HashMap; 27.07/10.40 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 27.07/10.40 Performed SCC analyses: 27.07/10.40 *Used field analysis yielded the following read fields: 27.07/10.40 *java.lang.String: [count] 27.07/10.40 *Marker field analysis yielded the following relations that could be markers: 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (59) SCCToIRSProof (SOUND) 27.07/10.40 Transformed FIGraph SCCs to intTRSs. Log: 27.07/10.40 Generated rules. Obtained 81 IRulesP rules: 27.07/10.40 f10353_0_createMap_LE(EOS(STATIC_10353(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373) -> f10357_0_createMap_LE(EOS(STATIC_10357(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373) :|: TRUE 27.07/10.40 f10357_0_createMap_LE(EOS(STATIC_10357(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373) -> f10362_0_createMap_New(EOS(STATIC_10362(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: i4373 > 0 27.07/10.40 f10362_0_createMap_New(EOS(STATIC_10362(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10367_0_createMap_Duplicate(EOS(STATIC_10367(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10367_0_createMap_Duplicate(EOS(STATIC_10367(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10371_0_createMap_InvokeMethod(EOS(STATIC_10371(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10371_0_createMap_InvokeMethod(EOS(STATIC_10371(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10375_0_random_FieldAccess(EOS(STATIC_10375(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10375_0_random_FieldAccess(EOS(STATIC_10375(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10385_0_random_FieldAccess(EOS(STATIC_10385(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7049sub)) :|: TRUE 27.07/10.40 f10385_0_random_FieldAccess(EOS(STATIC_10385(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7049sub)) -> f10390_0_random_ArrayAccess(EOS(STATIC_10390(java.lang.Object(o7049sub), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7049sub), i4354) :|: TRUE 27.07/10.40 f10390_0_random_ArrayAccess(EOS(STATIC_10390(java.lang.Object(ARRAY(i4401)), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4354) -> f10395_0_random_ArrayAccess(EOS(STATIC_10395(java.lang.Object(ARRAY(i4401)), i4354)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4354) :|: i4401 >= 0 27.07/10.40 f10395_0_random_ArrayAccess(EOS(STATIC_10395(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4403) -> f10401_0_random_ArrayAccess(EOS(STATIC_10401(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4403) :|: TRUE 27.07/10.40 f10401_0_random_ArrayAccess(EOS(STATIC_10401(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4403) -> f10408_0_random_ArrayAccess(EOS(STATIC_10408(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4403) :|: TRUE 27.07/10.40 f10408_0_random_ArrayAccess(EOS(STATIC_10408(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i4401)), i4403) -> f10414_0_random_Store(EOS(STATIC_10414(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) :|: i4403 < i4401 27.07/10.40 f10414_0_random_Store(EOS(STATIC_10414(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) -> f10419_0_random_FieldAccess(EOS(STATIC_10419(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) :|: TRUE 27.07/10.40 f10419_0_random_FieldAccess(EOS(STATIC_10419(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) -> f10425_0_random_ConstantStackPush(EOS(STATIC_10425(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4403) :|: TRUE 27.07/10.40 f10425_0_random_ConstantStackPush(EOS(STATIC_10425(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4403) -> f10431_0_random_IntArithmetic(EOS(STATIC_10431(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4403, 1) :|: TRUE 27.07/10.40 f10431_0_random_IntArithmetic(EOS(STATIC_10431(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4403, matching1) -> f10438_0_random_FieldAccess(EOS(STATIC_10438(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4403 + 1) :|: i4403 >= 0 && matching1 = 1 27.07/10.40 f10438_0_random_FieldAccess(EOS(STATIC_10438(java.lang.Object(ARRAY(i4401)), i4403)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081, i4412) -> f10447_0_random_Load(EOS(STATIC_10447(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) :|: TRUE 27.07/10.40 f10447_0_random_Load(EOS(STATIC_10447(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) -> f10455_0_random_InvokeMethod(EOS(STATIC_10455(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o7081) :|: TRUE 27.07/10.40 f10455_0_random_InvokeMethod(EOS(STATIC_10455(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7099sub)) -> f10461_0_random_InvokeMethod(EOS(STATIC_10461(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7099sub)) :|: TRUE 27.07/10.40 f10461_0_random_InvokeMethod(EOS(STATIC_10461(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) -> f10470_0_random_InvokeMethod(EOS(STATIC_10470(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) :|: TRUE 27.07/10.40 f10470_0_random_InvokeMethod(EOS(STATIC_10470(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) -> f10478_0_length_Load(EOS(STATIC_10478(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) :|: TRUE 27.07/10.40 f10478_0_length_Load(EOS(STATIC_10478(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) -> f10494_0_length_FieldAccess(EOS(STATIC_10494(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o7107sub)) :|: TRUE 27.07/10.40 f10494_0_length_FieldAccess(EOS(STATIC_10494(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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, i4432))) -> f10502_0_length_FieldAccess(EOS(STATIC_10502(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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, i4432))) :|: i4432 >= 0 27.07/10.40 f10502_0_length_FieldAccess(EOS(STATIC_10502(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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, i4432))) -> f10509_0_length_Return(EOS(STATIC_10509(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10509_0_length_Return(EOS(STATIC_10509(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10518_0_random_Return(EOS(STATIC_10518(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10518_0_random_Return(EOS(STATIC_10518(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10526_0_createMap_InvokeMethod(EOS(STATIC_10526(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10526_0_createMap_InvokeMethod(EOS(STATIC_10526(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10532_0__init__Load(EOS(STATIC_10532(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10532_0__init__Load(EOS(STATIC_10532(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10549_0__init__InvokeMethod(EOS(STATIC_10549(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10549_0__init__InvokeMethod(EOS(STATIC_10549(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432, java.lang.Object(javaUtilEx.Content(EOC))) -> f10556_0__init__Load(EOS(STATIC_10556(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10556_0__init__Load(EOS(STATIC_10556(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10566_0__init__Load(EOS(STATIC_10566(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4432, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10566_0__init__Load(EOS(STATIC_10566(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i4432, java.lang.Object(javaUtilEx.Content(EOC))) -> f10575_0__init__FieldAccess(EOS(STATIC_10575(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) :|: TRUE 27.07/10.40 f10575_0__init__FieldAccess(EOS(STATIC_10575(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4432) -> f10585_0__init__Return(EOS(STATIC_10585(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10585_0__init__Return(EOS(STATIC_10585(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10594_0_createMap_Store(EOS(STATIC_10594(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10594_0_createMap_Store(EOS(STATIC_10594(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10603_0_createMap_New(EOS(STATIC_10603(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10603_0_createMap_New(EOS(STATIC_10603(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10613_0_createMap_Duplicate(EOS(STATIC_10613(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10613_0_createMap_Duplicate(EOS(STATIC_10613(java.lang.Object(ARRAY(i4401)), i4412)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10623_0_createMap_InvokeMethod(EOS(STATIC_10623(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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 27.07/10.40 f10623_0_createMap_InvokeMethod(EOS(STATIC_10623(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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))) -> f10633_0_random_FieldAccess(EOS(STATIC_10633(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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 27.07/10.40 f10633_0_random_FieldAccess(EOS(STATIC_10633(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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))) -> f10650_0_random_FieldAccess(EOS(STATIC_10650(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401))) :|: TRUE 27.07/10.40 f10650_0_random_FieldAccess(EOS(STATIC_10650(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401))) -> f10658_0_random_ArrayAccess(EOS(STATIC_10658(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401)), i4412) :|: TRUE 27.07/10.40 f10658_0_random_ArrayAccess(EOS(STATIC_10658(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401)), i4412) -> f10665_0_random_ArrayAccess(EOS(STATIC_10665(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401)), i4412) :|: TRUE 27.07/10.40 f10665_0_random_ArrayAccess(EOS(STATIC_10665(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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(i4401)), i4412) -> f10673_0_random_Store(EOS(STATIC_10673(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248) :|: i4412 < i4401 27.07/10.40 f10673_0_random_Store(EOS(STATIC_10673(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248) -> f10681_0_random_FieldAccess(EOS(STATIC_10681(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248) :|: TRUE 27.07/10.40 f10681_0_random_FieldAccess(EOS(STATIC_10681(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248) -> f10685_0_random_ConstantStackPush(EOS(STATIC_10685(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4412) :|: TRUE 27.07/10.40 f10685_0_random_ConstantStackPush(EOS(STATIC_10685(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4412) -> f10690_0_random_IntArithmetic(EOS(STATIC_10690(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4412, 1) :|: TRUE 27.07/10.40 f10690_0_random_IntArithmetic(EOS(STATIC_10690(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4412, matching1) -> f10694_0_random_FieldAccess(EOS(STATIC_10694(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4412 + 1) :|: i4412 > 0 && matching1 = 1 27.07/10.40 f10694_0_random_FieldAccess(EOS(STATIC_10694(java.lang.Object(ARRAY(i4401)), i4412)), i4373, 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)), o7248, i4589) -> f10697_0_random_Load(EOS(STATIC_10697(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), o7248) :|: TRUE 27.07/10.40 f10697_0_random_Load(EOS(STATIC_10697(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), o7248) -> f10701_0_random_InvokeMethod(EOS(STATIC_10701(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), o7248) :|: TRUE 27.07/10.40 f10701_0_random_InvokeMethod(EOS(STATIC_10701(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7278sub)) -> f10705_0_random_InvokeMethod(EOS(STATIC_10705(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7278sub)) :|: TRUE 27.07/10.40 f10705_0_random_InvokeMethod(EOS(STATIC_10705(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) -> f10708_0_random_InvokeMethod(EOS(STATIC_10708(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) :|: TRUE 27.07/10.40 f10708_0_random_InvokeMethod(EOS(STATIC_10708(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) -> f10712_0_length_Load(EOS(STATIC_10712(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) :|: TRUE 27.07/10.40 f10712_0_length_Load(EOS(STATIC_10712(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) -> f10717_0_length_FieldAccess(EOS(STATIC_10717(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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(o7279sub)) :|: TRUE 27.07/10.40 f10717_0_length_FieldAccess(EOS(STATIC_10717(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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, i4614))) -> f10720_0_length_FieldAccess(EOS(STATIC_10720(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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, i4614))) :|: i4614 >= 0 27.07/10.40 f10720_0_length_FieldAccess(EOS(STATIC_10720(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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, i4614))) -> f10722_0_length_Return(EOS(STATIC_10722(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10722_0_length_Return(EOS(STATIC_10722(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10724_0_random_Return(EOS(STATIC_10724(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10724_0_random_Return(EOS(STATIC_10724(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10729_0_createMap_InvokeMethod(EOS(STATIC_10729(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10729_0_createMap_InvokeMethod(EOS(STATIC_10729(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10732_0__init__Load(EOS(STATIC_10732(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10732_0__init__Load(EOS(STATIC_10732(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10738_0__init__InvokeMethod(EOS(STATIC_10738(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10738_0__init__InvokeMethod(EOS(STATIC_10738(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614, java.lang.Object(javaUtilEx.Content(EOC))) -> f10741_0__init__Load(EOS(STATIC_10741(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10741_0__init__Load(EOS(STATIC_10741(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10745_0__init__Load(EOS(STATIC_10745(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4614, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10745_0__init__Load(EOS(STATIC_10745(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i4614, java.lang.Object(javaUtilEx.Content(EOC))) -> f10749_0__init__FieldAccess(EOS(STATIC_10749(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) :|: TRUE 27.07/10.40 f10749_0__init__FieldAccess(EOS(STATIC_10749(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)), i4614) -> f10753_0__init__Return(EOS(STATIC_10753(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10753_0__init__Return(EOS(STATIC_10753(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10757_0_createMap_Store(EOS(STATIC_10757(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10757_0_createMap_Store(EOS(STATIC_10757(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10761_0_createMap_Load(EOS(STATIC_10761(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 27.07/10.40 f10761_0_createMap_Load(EOS(STATIC_10761(java.lang.Object(ARRAY(i4401)), i4589)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10765_0_createMap_Load(EOS(STATIC_10765(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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 27.07/10.40 f10765_0_createMap_Load(EOS(STATIC_10765(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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)))) -> f10769_0_createMap_Load(EOS(STATIC_10769(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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 27.07/10.40 f10769_0_createMap_Load(EOS(STATIC_10769(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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))) -> f10773_0_createMap_InvokeMethod(EOS(STATIC_10773(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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 27.07/10.40 f10773_0_createMap_InvokeMethod(EOS(STATIC_10773(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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))) -> f10777_0_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i4401)), i4589)), 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))) :|: i4374 >= 1 && i4373 >= 1 && i4589 > 1 && i4374 >= i4373 27.07/10.40 f10773_0_createMap_InvokeMethod(EOS(STATIC_10773(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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))) -> f10777_1_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i4401)), i4589)), i4373, 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))) :|: i4374 >= 1 && i4373 >= 1 && i4589 > 1 && i4374 >= i4373 27.07/10.40 f10777_0_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i4401)), i4589)), 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))) -> f12579_0_put_Load(EOS(STATIC_12579(java.lang.Object(ARRAY(i4401)), i4589)), 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 27.07/10.40 f11245_0_put_Return(EOS(STATIC_11245(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11249_0_createMap_StackPop(EOS(STATIC_11249(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11249_0_createMap_StackPop(EOS(STATIC_11249(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11254_0_createMap_Inc(EOS(STATIC_11254(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11254_0_createMap_Inc(EOS(STATIC_11254(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11260_0_createMap_JMP(EOS(STATIC_11260(java.lang.Object(ARRAY(i5076)), i5078)), i4373 + -1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11260_0_createMap_JMP(EOS(STATIC_11260(java.lang.Object(ARRAY(i5076)), i5078)), i5079, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11265_0_createMap_Load(EOS(STATIC_11265(java.lang.Object(ARRAY(i5076)), i5078)), i5079, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11265_0_createMap_Load(EOS(STATIC_11265(java.lang.Object(ARRAY(i5076)), i5078)), i5079, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10350_0_createMap_Load(EOS(STATIC_10350(java.lang.Object(ARRAY(i5076)), i5078)), i5079, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f10350_0_createMap_Load(EOS(STATIC_10350(java.lang.Object(o7049sub), i4354)), i4356, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10353_0_createMap_LE(EOS(STATIC_10353(java.lang.Object(o7049sub), i4354)), i4356, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4356) :|: TRUE 27.07/10.40 f11343_0_put_Return(EOS(STATIC_11343(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11348_0_createMap_StackPop(EOS(STATIC_11348(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 27.07/10.40 f11348_0_createMap_StackPop(EOS(STATIC_11348(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11353_0_createMap_Inc(EOS(STATIC_11353(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11353_0_createMap_Inc(EOS(STATIC_11353(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11254_0_createMap_Inc(EOS(STATIC_11254(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f11794_0_put_Return(EOS(STATIC_11794(java.lang.Object(ARRAY(i5346)), i5348)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11343_0_put_Return(EOS(STATIC_11343(java.lang.Object(ARRAY(i5346)), i5348)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 27.07/10.40 f10777_1_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i5076)), i5078)), i4373, 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))) -> f11245_0_put_Return(EOS(STATIC_11245(java.lang.Object(ARRAY(i5076)), i5078)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 27.07/10.40 f10777_1_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i5131)), i5133)), i4373, 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))) -> f11343_0_put_Return(EOS(STATIC_11343(java.lang.Object(ARRAY(i5131)), i5133)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 27.07/10.40 f10777_1_put_Load(EOS(STATIC_10777(java.lang.Object(ARRAY(i5346)), i5348)), i4373, 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))) -> f11794_0_put_Return(EOS(STATIC_11794(java.lang.Object(ARRAY(i5346)), i5348)), i4373, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 27.07/10.40 Combined rules. Obtained 2 IRulesP rules: 27.07/10.40 f10353_0_createMap_LE(EOS(STATIC_10353(java.lang.Object(ARRAY(i4401:0)), i4354:0)), i4373:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373:0) -> f10353_0_createMap_LE(EOS(STATIC_10353(java.lang.Object(ARRAY(i4401:0)), i4354:0 + 2)), i4373:0 - 1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373:0 - 1) :|: i4401:0 > i4354:0 + 1 && i4373:0 > 0 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 > 0 && i4374:0 >= i4373:0 27.07/10.40 Removed following non-SCC rules: 27.07/10.40 f10353_0_createMap_LE(EOS(STATIC_10353(java.lang.Object(ARRAY(i4401:0)), i4354:0)), i4373:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4373:0) -> f12579_0_put_Load(EOS(STATIC_12579(java.lang.Object(ARRAY(i4401:0)), i4354: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))) :|: i4401:0 > i4354:0 + 1 && i4373:0 > 0 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 > 0 && i4374:0 >= i4373:0 27.07/10.40 Filtered constant ground arguments: 27.07/10.40 f10353_0_createMap_LE(x1, x2, x3, x4) -> f10353_0_createMap_LE(x1, x2, x4) 27.07/10.40 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 27.07/10.40 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 27.07/10.40 Filtered duplicate arguments: 27.07/10.40 f10353_0_createMap_LE(x1, x2, x3) -> f10353_0_createMap_LE(x1, x3) 27.07/10.40 Finished conversion. Obtained 1 rules.P rules: 27.07/10.40 f10353_0_createMap_LE(i4373:0, i4401:0, i4354:0) -> f10353_0_createMap_LE(i4373:0 - 1, i4401:0, i4354:0 + 2) :|: i4373:0 > 0 && i4401:0 > i4354:0 + 1 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 >= i4373:0 && i4374:0 > 0 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (60) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10353_0_createMap_LE(i4373:0, i4401:0, i4354:0) -> f10353_0_createMap_LE(i4373:0 - 1, i4401:0, i4354:0 + 2) :|: i4373:0 > 0 && i4401:0 > i4354:0 + 1 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 >= i4373:0 && i4374:0 > 0 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (61) IRSFormatTransformerProof (EQUIVALENT) 27.07/10.40 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (62) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10353_0_createMap_LE(i4373:0, i4401:0, i4354:0) -> f10353_0_createMap_LE(arith, i4401:0, arith1) :|: i4373:0 > 0 && i4401:0 > i4354:0 + 1 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 >= i4373:0 && i4374:0 > 0 && arith = i4373:0 - 1 && arith1 = i4354:0 + 2 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (63) IRSwTTerminationDigraphProof (EQUIVALENT) 27.07/10.40 Constructed termination digraph! 27.07/10.40 Nodes: 27.07/10.40 (1) f10353_0_createMap_LE(i4373:0, i4401:0, i4354:0) -> f10353_0_createMap_LE(arith, i4401:0, arith1) :|: i4373:0 > 0 && i4401:0 > i4354:0 + 1 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 >= i4373:0 && i4374:0 > 0 && arith = i4373:0 - 1 && arith1 = i4354:0 + 2 27.07/10.40 27.07/10.40 Arcs: 27.07/10.40 (1) -> (1) 27.07/10.40 27.07/10.40 This digraph is fully evaluated! 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (64) 27.07/10.40 Obligation: 27.07/10.40 27.07/10.40 Termination digraph: 27.07/10.40 Nodes: 27.07/10.40 (1) f10353_0_createMap_LE(i4373:0, i4401:0, i4354:0) -> f10353_0_createMap_LE(arith, i4401:0, arith1) :|: i4373:0 > 0 && i4401:0 > i4354:0 + 1 && i4401:0 > -1 && i4354:0 > -1 && i4432:0 > -1 && i4614:0 > -1 && i4374:0 >= i4373:0 && i4374:0 > 0 && arith = i4373:0 - 1 && arith1 = i4354:0 + 2 27.07/10.40 27.07/10.40 Arcs: 27.07/10.40 (1) -> (1) 27.07/10.40 27.07/10.40 This digraph is fully evaluated! 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (65) IntTRSCompressionProof (EQUIVALENT) 27.07/10.40 Compressed rules. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (66) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10353_0_createMap_LE(i4373:0:0, i4401:0:0, i4354:0:0) -> f10353_0_createMap_LE(i4373:0:0 - 1, i4401:0:0, i4354:0:0 + 2) :|: i4374:0:0 >= i4373:0:0 && i4374:0:0 > 0 && i4614:0:0 > -1 && i4432:0:0 > -1 && i4354:0:0 > -1 && i4401:0:0 > -1 && i4401:0:0 > i4354:0:0 + 1 && i4373:0:0 > 0 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (67) TempFilterProof (SOUND) 27.07/10.40 Used the following sort dictionary for filtering: 27.07/10.40 f10353_0_createMap_LE(INTEGER, INTEGER, INTEGER) 27.07/10.40 Replaced non-predefined constructor symbols by 0. 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (68) 27.07/10.40 Obligation: 27.07/10.40 Rules: 27.07/10.40 f10353_0_createMap_LE(i4373:0:0, i4401:0:0, i4354:0:0) -> f10353_0_createMap_LE(c, i4401:0:0, c1) :|: c1 = i4354:0:0 + 2 && c = i4373:0:0 - 1 && (i4374:0:0 >= i4373:0:0 && i4374:0:0 > 0 && i4614:0:0 > -1 && i4432:0:0 > -1 && i4354:0:0 > -1 && i4401:0:0 > -1 && i4401:0:0 > i4354:0:0 + 1 && i4373:0:0 > 0) 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (69) PolynomialOrderProcessor (EQUIVALENT) 27.07/10.40 Found the following polynomial interpretation: 27.07/10.40 [f10353_0_createMap_LE(x, x1, x2)] = x 27.07/10.40 27.07/10.40 The following rules are decreasing: 27.07/10.40 f10353_0_createMap_LE(i4373:0:0, i4401:0:0, i4354:0:0) -> f10353_0_createMap_LE(c, i4401:0:0, c1) :|: c1 = i4354:0:0 + 2 && c = i4373:0:0 - 1 && (i4374:0:0 >= i4373:0:0 && i4374:0:0 > 0 && i4614:0:0 > -1 && i4432:0:0 > -1 && i4354:0:0 > -1 && i4401:0:0 > -1 && i4401:0:0 > i4354:0:0 + 1 && i4373:0:0 > 0) 27.07/10.40 The following rules are bounded: 27.07/10.40 f10353_0_createMap_LE(i4373:0:0, i4401:0:0, i4354:0:0) -> f10353_0_createMap_LE(c, i4401:0:0, c1) :|: c1 = i4354:0:0 + 2 && c = i4373:0:0 - 1 && (i4374:0:0 >= i4373:0:0 && i4374:0:0 > 0 && i4614:0:0 > -1 && i4432:0:0 > -1 && i4354:0:0 > -1 && i4401:0:0 > -1 && i4401:0:0 > i4354:0:0 + 1 && i4373:0:0 > 0) 27.07/10.40 27.07/10.40 ---------------------------------------- 27.07/10.40 27.07/10.40 (70) 27.07/10.40 YES 27.27/10.43 EOF