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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 29.95/14.40 * 29.95/14.40 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

29.95/14.41	 *   Map m = Collections.synchronizedMap(new HashMap(...));
29.95/14.41 * 29.95/14.41 *

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

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

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

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

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

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

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

29.95/14.41 * 29.95/14.41 *

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

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

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

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

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

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

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

This interface is a member of the 29.95/14.41 * 29.95/14.41 * Java Collections Framework. 29.95/14.41 * 29.95/14.41 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This implementation calls entrySet().clear(). 29.95/14.42 * 29.95/14.42 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

29.95/14.43	 *   Map m = Collections.synchronizedMap(new HashMap(...));
29.95/14.43 * 29.95/14.43 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This interface is a member of the 30.16/14.44 * 30.16/14.44 * Java Collections Framework. 30.16/14.44 * 30.16/14.44 *

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Note that the detail message associated with cause is 30.16/14.44 * not automatically incorporated in this exception's detail 30.16/14.44 * message. 30.16/14.44 * 30.16/14.44 * @param message the detail message (which is saved for later retrieval 30.16/14.44 * by the {@link Throwable#getMessage()} method). 30.16/14.44 * @param cause the cause (which is saved for later retrieval by the 30.16/14.44 * {@link Throwable#getCause()} method). (A null value 30.16/14.44 * is permitted, and indicates that the cause is nonexistent or 30.16/14.44 * unknown.) 30.16/14.44 * @since 1.5 30.16/14.44 */ 30.16/14.44 public UnsupportedOperationException(String message, Throwable cause) { 30.16/14.44 super(message, cause); 30.16/14.44 } 30.16/14.44 30.16/14.44 /** 30.16/14.44 * Constructs a new exception with the specified cause and a detail 30.16/14.44 * message of (cause==null ? null : cause.toString()) (which 30.16/14.44 * typically contains the class and detail message of cause). 30.16/14.44 * This constructor is useful for exceptions that are little more than 30.16/14.44 * wrappers for other throwables (for example, {@link 30.16/14.44 * java.security.PrivilegedActionException}). 30.16/14.44 * 30.16/14.44 * @param cause the cause (which is saved for later retrieval by the 30.16/14.44 * {@link Throwable#getCause()} method). (A null value is 30.16/14.44 * permitted, and indicates that the cause is nonexistent or 30.16/14.44 * unknown.) 30.16/14.44 * @since 1.5 30.16/14.44 */ 30.16/14.44 public UnsupportedOperationException(Throwable cause) { 30.16/14.44 super(cause); 30.16/14.44 } 30.16/14.44 30.16/14.44 static final long serialVersionUID = -1242599979055084673L; 30.16/14.44 } 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (3) JBCToGraph (EQUIVALENT) 30.16/14.44 Constructed TerminationGraph. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (4) 30.16/14.44 Obligation: 30.16/14.44 Termination Graph based on JBC Program: 30.16/14.44 javaUtilEx.juHashMapCreateIteratorValueLoop.main([Ljava/lang/String;)V: Graph of 405 nodes with 2 SCCs. 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 javaUtilEx.juHashMapCreateIteratorValueLoop.createMap(I)LjavaUtilEx/HashMap;: Graph of 248 nodes with 1 SCC. 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;: Graph of 493 nodes with 2 SCCs. 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 javaUtilEx.Content.hashCode()I: Graph of 6 nodes with 0 SCCs. 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 javaUtilEx.Content.equals(Ljava/lang/Object;)Z: Graph of 31 nodes with 0 SCCs. 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (5) TerminationGraphToSCCProof (SOUND) 30.16/14.44 Splitted TerminationGraph to 5 SCCss. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (6) 30.16/14.44 Complex Obligation (AND) 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (7) 30.16/14.44 Obligation: 30.16/14.44 SCC of termination graph based on JBC Program. 30.16/14.44 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 30.16/14.44 SCC calls the following helper methods: 30.16/14.44 Performed SCC analyses: 30.16/14.44 *Used field analysis yielded the following read fields: 30.16/14.44 *javaUtilEx.HashMap$Entry: [next, hash] 30.16/14.44 *Marker field analysis yielded the following relations that could be markers: 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (8) SCCToIRSProof (SOUND) 30.16/14.44 Transformed FIGraph SCCs to intTRSs. Log: 30.16/14.44 Generated rules. Obtained 58 IRulesP rules: 30.16/14.44 f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572) -> f11992_0_transfer_ArrayLength(EOS(STATIC_11992), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, java.lang.Object(ARRAY(i4571))) :|: TRUE 30.16/14.44 f11992_0_transfer_ArrayLength(EOS(STATIC_11992), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, java.lang.Object(ARRAY(i4571))) -> f11994_0_transfer_GE(EOS(STATIC_11994), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, i4571) :|: i4571 >= 0 30.16/14.44 f11994_0_transfer_GE(EOS(STATIC_11994), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, i4571) -> f11997_0_transfer_GE(EOS(STATIC_11997), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, i4571) :|: i4572 < i4571 30.16/14.44 f11997_0_transfer_GE(EOS(STATIC_11997), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572, i4571) -> f12000_0_transfer_Load(EOS(STATIC_12000), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) :|: i4572 < i4571 30.16/14.44 f12000_0_transfer_Load(EOS(STATIC_12000), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) -> f12003_0_transfer_Load(EOS(STATIC_12003), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571))) :|: TRUE 30.16/14.44 f12003_0_transfer_Load(EOS(STATIC_12003), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571))) -> f12005_0_transfer_ArrayAccess(EOS(STATIC_12005), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571)), i4572) :|: TRUE 30.16/14.44 f12005_0_transfer_ArrayAccess(EOS(STATIC_12005), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571)), i4572) -> f12007_0_transfer_ArrayAccess(EOS(STATIC_12007), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571)), i4572) :|: TRUE 30.16/14.44 f12007_0_transfer_ArrayAccess(EOS(STATIC_12007), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(ARRAY(i4571)), i4572) -> f12010_0_transfer_Store(EOS(STATIC_12010), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7396) :|: i4572 < i4571 30.16/14.44 f12010_0_transfer_Store(EOS(STATIC_12010), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7396) -> f12013_0_transfer_Load(EOS(STATIC_12013), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7396) :|: TRUE 30.16/14.44 f12013_0_transfer_Load(EOS(STATIC_12013), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7396) -> f12015_0_transfer_NULL(EOS(STATIC_12015), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7396, o7396) :|: TRUE 30.16/14.44 f12015_0_transfer_NULL(EOS(STATIC_12015), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(o7398sub)) -> f12018_0_transfer_NULL(EOS(STATIC_12018), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(o7398sub)) :|: TRUE 30.16/14.44 f12015_0_transfer_NULL(EOS(STATIC_12015), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) -> f12019_0_transfer_NULL(EOS(STATIC_12019), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) :|: TRUE 30.16/14.44 f12018_0_transfer_NULL(EOS(STATIC_12018), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(o7398sub)) -> f12022_0_transfer_Load(EOS(STATIC_12022), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub)) :|: TRUE 30.16/14.44 f12022_0_transfer_Load(EOS(STATIC_12022), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub)) -> f12025_0_transfer_Load(EOS(STATIC_12025), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571))) :|: TRUE 30.16/14.44 f12025_0_transfer_Load(EOS(STATIC_12025), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571))) -> f12029_0_transfer_ConstantStackPush(EOS(STATIC_12029), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572) :|: TRUE 30.16/14.44 f12029_0_transfer_ConstantStackPush(EOS(STATIC_12029), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572) -> f12033_0_transfer_ArrayAccess(EOS(STATIC_12033), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572, NULL) :|: TRUE 30.16/14.44 f12033_0_transfer_ArrayAccess(EOS(STATIC_12033), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572, NULL) -> f12035_0_transfer_ArrayAccess(EOS(STATIC_12035), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572, NULL) :|: TRUE 30.16/14.44 f12035_0_transfer_ArrayAccess(EOS(STATIC_12035), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(ARRAY(i4571)), i4572, NULL) -> f12039_0_transfer_Load(EOS(STATIC_12039), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398put)) :|: i4572 < i4571 30.16/14.44 f12039_0_transfer_Load(EOS(STATIC_12039), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub)) -> f12043_0_transfer_FieldAccess(EOS(STATIC_12043), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7398sub), java.lang.Object(o7398sub)) :|: TRUE 30.16/14.44 f12043_0_transfer_FieldAccess(EOS(STATIC_12043), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) -> f12045_0_transfer_FieldAccess(EOS(STATIC_12045), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) :|: TRUE 30.16/14.44 f12045_0_transfer_FieldAccess(EOS(STATIC_12045), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) -> f12049_0_transfer_Store(EOS(STATIC_12049), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410) :|: TRUE 30.16/14.44 f12049_0_transfer_Store(EOS(STATIC_12049), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410) -> f12052_0_transfer_Load(EOS(STATIC_12052), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410) :|: TRUE 30.16/14.44 f12052_0_transfer_Load(EOS(STATIC_12052), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410) -> f12054_0_transfer_FieldAccess(EOS(STATIC_12054), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) :|: TRUE 30.16/14.44 f12054_0_transfer_FieldAccess(EOS(STATIC_12054), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) -> f12057_0_transfer_Load(EOS(STATIC_12057), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587) :|: TRUE 30.16/14.44 f12057_0_transfer_Load(EOS(STATIC_12057), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587) -> f12060_0_transfer_InvokeMethod(EOS(STATIC_12060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) :|: TRUE 30.16/14.44 f12060_0_transfer_InvokeMethod(EOS(STATIC_12060), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) -> f12062_0_indexFor_Load(EOS(STATIC_12062), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) :|: TRUE 30.16/14.44 f12062_0_indexFor_Load(EOS(STATIC_12062), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) -> f12067_0_indexFor_Load(EOS(STATIC_12067), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4282, i4587) :|: TRUE 30.16/14.44 f12067_0_indexFor_Load(EOS(STATIC_12067), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4282, i4587) -> f12069_0_indexFor_ConstantStackPush(EOS(STATIC_12069), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) :|: TRUE 30.16/14.44 f12069_0_indexFor_ConstantStackPush(EOS(STATIC_12069), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282) -> f12072_0_indexFor_IntArithmetic(EOS(STATIC_12072), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282, 1) :|: TRUE 30.16/14.44 f12072_0_indexFor_IntArithmetic(EOS(STATIC_12072), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282, matching1) -> f12075_0_indexFor_IntArithmetic(EOS(STATIC_12075), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4282 - 1) :|: i4282 >= 0 && matching1 = 1 30.16/14.44 f12075_0_indexFor_IntArithmetic(EOS(STATIC_12075), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4587, i4604) -> f12077_0_indexFor_Return(EOS(STATIC_12077), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) :|: TRUE 30.16/14.44 f12077_0_indexFor_Return(EOS(STATIC_12077), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) -> f12080_0_transfer_Store(EOS(STATIC_12080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) :|: TRUE 30.16/14.44 f12080_0_transfer_Store(EOS(STATIC_12080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) -> f12083_0_transfer_Load(EOS(STATIC_12083), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) :|: TRUE 30.16/14.44 f12083_0_transfer_Load(EOS(STATIC_12083), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605) -> f12086_0_transfer_Load(EOS(STATIC_12086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) :|: TRUE 30.16/14.44 f12086_0_transfer_Load(EOS(STATIC_12086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587))) -> f12089_0_transfer_Load(EOS(STATIC_12089), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282))) :|: TRUE 30.16/14.44 f12089_0_transfer_Load(EOS(STATIC_12089), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282))) -> f12092_0_transfer_ArrayAccess(EOS(STATIC_12092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282)), i4605) :|: TRUE 30.16/14.44 f12092_0_transfer_ArrayAccess(EOS(STATIC_12092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282)), i4605) -> f12095_0_transfer_ArrayAccess(EOS(STATIC_12095), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282)), i4605) :|: TRUE 30.16/14.44 f12095_0_transfer_ArrayAccess(EOS(STATIC_12095), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), java.lang.Object(ARRAY(i4282)), i4605) -> f12099_0_transfer_FieldAccess(EOS(STATIC_12099), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7430) :|: i4605 < i4282 30.16/14.44 f12099_0_transfer_FieldAccess(EOS(STATIC_12099), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7410, i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410, i4587)), o7430) -> f12103_0_transfer_Load(EOS(STATIC_12103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, i4605) :|: TRUE 30.16/14.44 f12103_0_transfer_Load(EOS(STATIC_12103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, i4605) -> f12105_0_transfer_Load(EOS(STATIC_12105), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, i4605, java.lang.Object(ARRAY(i4282))) :|: TRUE 30.16/14.44 f12105_0_transfer_Load(EOS(STATIC_12105), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, i4605, java.lang.Object(ARRAY(i4282))) -> f12109_0_transfer_Load(EOS(STATIC_12109), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, java.lang.Object(ARRAY(i4282)), i4605) :|: TRUE 30.16/14.44 f12109_0_transfer_Load(EOS(STATIC_12109), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587)), o7410, java.lang.Object(ARRAY(i4282)), i4605) -> f12112_0_transfer_ArrayAccess(EOS(STATIC_12112), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410, java.lang.Object(ARRAY(i4282)), i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587))) :|: TRUE 30.16/14.44 f12112_0_transfer_ArrayAccess(EOS(STATIC_12112), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410, java.lang.Object(ARRAY(i4282)), i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587))) -> f12114_0_transfer_ArrayAccess(EOS(STATIC_12114), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410, java.lang.Object(ARRAY(i4282)), i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587))) :|: TRUE 30.16/14.44 f12114_0_transfer_ArrayAccess(EOS(STATIC_12114), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410, java.lang.Object(ARRAY(i4282)), i4605, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7430, i4587))) -> f12118_0_transfer_Load(EOS(STATIC_12118), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) :|: i4605 < i4282 30.16/14.44 f12118_0_transfer_Load(EOS(STATIC_12118), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) -> f12122_0_transfer_Store(EOS(STATIC_12122), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) :|: TRUE 30.16/14.44 f12122_0_transfer_Store(EOS(STATIC_12122), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) -> f12123_0_transfer_Load(EOS(STATIC_12123), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) :|: TRUE 30.16/14.44 f12123_0_transfer_Load(EOS(STATIC_12123), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410) -> f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, o7410, o7410) :|: TRUE 30.16/14.44 f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub), java.lang.Object(o7453sub)) -> f12129_0_transfer_NONNULL(EOS(STATIC_12129), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub), java.lang.Object(o7453sub)) :|: TRUE 30.16/14.44 f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) -> f12130_0_transfer_NONNULL(EOS(STATIC_12130), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) :|: TRUE 30.16/14.44 f12129_0_transfer_NONNULL(EOS(STATIC_12129), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub), java.lang.Object(o7453sub)) -> f12131_0_transfer_Load(EOS(STATIC_12131), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub)) :|: TRUE 30.16/14.44 f12131_0_transfer_Load(EOS(STATIC_12131), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub)) -> f12039_0_transfer_Load(EOS(STATIC_12039), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, java.lang.Object(o7453sub)) :|: TRUE 30.16/14.44 f12130_0_transfer_NONNULL(EOS(STATIC_12130), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) -> f12132_0_transfer_Inc(EOS(STATIC_12132), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) :|: TRUE 30.16/14.44 f12132_0_transfer_Inc(EOS(STATIC_12132), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) -> f12135_0_transfer_JMP(EOS(STATIC_12135), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572 + 1) :|: TRUE 30.16/14.44 f12135_0_transfer_JMP(EOS(STATIC_12135), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4623) -> f12138_0_transfer_Load(EOS(STATIC_12138), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4623) :|: TRUE 30.16/14.44 f12138_0_transfer_Load(EOS(STATIC_12138), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4623) -> f11988_0_transfer_Load(EOS(STATIC_11988), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4623) :|: TRUE 30.16/14.44 f11988_0_transfer_Load(EOS(STATIC_11988), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) -> f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, i4572) :|: TRUE 30.16/14.44 f12019_0_transfer_NULL(EOS(STATIC_12019), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572, NULL, NULL) -> f12023_0_transfer_Inc(EOS(STATIC_12023), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) :|: TRUE 30.16/14.44 f12023_0_transfer_Inc(EOS(STATIC_12023), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) -> f12132_0_transfer_Inc(EOS(STATIC_12132), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282, java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4282)), java.lang.Object(ARRAY(i4571)), i4282, i4572) :|: TRUE 30.16/14.44 Combined rules. Obtained 4 IRulesP rules: 30.16/14.44 f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, i4572:0) -> f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, o7410:0, o7410:0) :|: i4571:0 > -1 && i4572:0 < i4571:0 && i4282:0 > -1 && i4605:0 < i4282:0 30.16/14.44 f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410:0, i4587:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7410:0, i4587:0))) -> f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, o7410:0, o7410:0) :|: i4282:0 > -1 && i4605:0 < i4282:0 30.16/14.44 f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, i4572:0) -> f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0 + 1, i4572:0 + 1) :|: i4571:0 > -1 && i4572:0 < i4571:0 30.16/14.44 f12126_0_transfer_NONNULL(EOS(STATIC_12126), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0, NULL, NULL) -> f11990_0_transfer_Load(EOS(STATIC_11990), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i4282:0, java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4282:0, i4572:0 + 1, i4572:0 + 1) :|: TRUE 30.16/14.44 Filtered constant ground arguments: 30.16/14.44 f11990_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> f11990_0_transfer_Load(x4, x5, x6, x7, x8, x9, x10) 30.16/14.44 f12126_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f12126_0_transfer_NONNULL(x4, x5, x6, x7, x8, x9, x10, x11) 30.16/14.44 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 30.16/14.44 javaUtilEx.HashMap$Entry(x1, x2, x3) -> javaUtilEx.HashMap$Entry(x2, x3) 30.16/14.44 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 30.16/14.44 Filtered duplicate arguments: 30.16/14.44 f11990_0_transfer_Load(x1, x2, x3, x4, x5, x6, x7) -> f11990_0_transfer_Load(x3, x4, x7) 30.16/14.44 f12126_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6, x7, x8) -> f12126_0_transfer_NONNULL(x3, x4, x6, x8) 30.16/14.44 Filtered unneeded arguments: 30.16/14.44 javaUtilEx.HashMap$Entry(x1, x2) -> javaUtilEx.HashMap$Entry(x1) 30.16/14.44 Finished conversion. Obtained 4 rules.P rules: 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4572:0 < i4571:0 && i4571:0 > -1 && i4605:0 < i4282:0 && i4282:0 > -1 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7410:0)), i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4282:0 > -1 && i4605:0 < i4282:0 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0 + 1, i4282:0, i4571:0) :|: i4571:0 > -1 && i4572:0 < i4571:0 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, NULL, i4282:0, i4571:0) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0 + 1, i4282:0, i4571:0) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (9) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4572:0 < i4571:0 && i4571:0 > -1 && i4605:0 < i4282:0 && i4282:0 > -1 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x, x1) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x > -1 && x4 < x 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, x5, x6) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7 + 1, x5, x6) :|: x6 > -1 && x7 < x6 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10, NULL, x8, x9) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x8)), java.lang.Object(ARRAY(x9)), x10 + 1, x8, x9) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (10) IRSFormatTransformerProof (EQUIVALENT) 30.16/14.44 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (11) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4572:0 < i4571:0 && i4571:0 > -1 && i4605:0 < i4282:0 && i4282:0 > -1 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x, x1) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x > -1 && x4 < x 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, x5, x6) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: x6 > -1 && x7 < x6 && arith = x7 + 1 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, NULL, x11, x12) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: TRUE && x14 = x13 + 1 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (12) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.44 Constructed termination digraph! 30.16/14.44 Nodes: 30.16/14.44 (1) f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4572:0 < i4571:0 && i4571:0 > -1 && i4605:0 < i4282:0 && i4282:0 > -1 30.16/14.44 (2) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x, x1) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x > -1 && x4 < x 30.16/14.44 (3) f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, x5, x6) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: x6 > -1 && x7 < x6 && arith = x7 + 1 30.16/14.44 (4) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, NULL, x11, x12) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: TRUE && x14 = x13 + 1 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (2), (4) 30.16/14.44 (2) -> (2), (4) 30.16/14.44 (3) -> (1), (3) 30.16/14.44 (4) -> (1), (3) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (13) 30.16/14.44 Obligation: 30.16/14.44 30.16/14.44 Termination digraph: 30.16/14.44 Nodes: 30.16/14.44 (1) f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, i4282:0, i4571:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0)), java.lang.Object(ARRAY(i4571:0)), i4572:0, o7410:0, i4282:0, i4571:0) :|: i4572:0 < i4571:0 && i4571:0 > -1 && i4605:0 < i4282:0 && i4282:0 > -1 30.16/14.44 (2) f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), x7, x5, x6) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x5)), java.lang.Object(ARRAY(x6)), arith, x5, x6) :|: x6 > -1 && x7 < x6 && arith = x7 + 1 30.16/14.44 (3) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x13, NULL, x11, x12) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x11)), java.lang.Object(ARRAY(x12)), x14, x11, x12) :|: TRUE && x14 = x13 + 1 30.16/14.44 (4) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x, x1) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x)), java.lang.Object(ARRAY(x1)), x2, x3, x, x1) :|: x > -1 && x4 < x 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (3), (4) 30.16/14.44 (2) -> (1), (2) 30.16/14.44 (3) -> (1), (2) 30.16/14.44 (4) -> (3), (4) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (14) IntTRSCompressionProof (EQUIVALENT) 30.16/14.44 Compressed rules. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (15) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(x5:0)), java.lang.Object(ARRAY(x6:0)), x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x5:0)), java.lang.Object(ARRAY(x6:0)), x7:0 + 1, x5:0, x6:0) :|: x6:0 > -1 && x7:0 < x6:0 30.16/14.44 f11990_0_transfer_Load(java.lang.Object(ARRAY(i4282:0:0)), java.lang.Object(ARRAY(i4571:0:0)), i4572:0:0, i4282:0:0, i4571:0:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(i4282:0:0)), java.lang.Object(ARRAY(i4571:0:0)), i4572:0:0, o7410:0:0, i4282:0:0, i4571:0:0) :|: i4605:0:0 < i4282:0:0 && i4282:0:0 > -1 && i4571:0:0 > -1 && i4572:0:0 < i4571:0:0 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0, NULL, x11:0, x12:0) -> f11990_0_transfer_Load(java.lang.Object(ARRAY(x11:0)), java.lang.Object(ARRAY(x12:0)), x13:0 + 1, x11:0, x12:0) :|: TRUE 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x:0, x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x3:0, x:0, x1:0) :|: x:0 > -1 && x:0 > x4:0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (16) TempFilterProof (SOUND) 30.16/14.44 Used the following sort dictionary for filtering: 30.16/14.44 f11990_0_transfer_Load(VARIABLE, VARIABLE, INTEGER, VARIABLE, VARIABLE) 30.16/14.44 java.lang.Object(VARIABLE) 30.16/14.44 ARRAY(VARIABLE) 30.16/14.44 f12126_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE) 30.16/14.44 NULL() 30.16/14.44 javaUtilEx.HashMap$Entry(VARIABLE) 30.16/14.44 Replaced non-predefined constructor symbols by 0.The following proof was generated: 30.16/14.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.16/14.44 30.16/14.44 30.16/14.44 Termination of the given IntTRS could not be shown: 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f11990_0_transfer_Load(c5, c6, i4572:0:0, i4282:0:0, i4571:0:0) -> f12126_0_transfer_NONNULL(c7, c8, i4572:0:0, o7410:0:0, i4282:0:0, i4571:0:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (i4605:0:0 < i4282:0:0 && i4282:0:0 > -1 && i4571:0:0 > -1 && i4572:0:0 < i4571:0:0) 30.16/14.44 f12126_0_transfer_NONNULL(c9, c10, x13:0, c11, x11:0, x12:0) -> f11990_0_transfer_Load(c12, c13, c14, x11:0, x12:0) :|: c14 = x13:0 + 1 && (c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0)))) && TRUE 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 Interpretation: 30.16/14.44 [ f11990_0_transfer_Load ] = 2*f11990_0_transfer_Load_5 + -2*f11990_0_transfer_Load_3 + 2*f11990_0_transfer_Load_4 + 2 30.16/14.44 [ f12126_0_transfer_NONNULL ] = -2*f12126_0_transfer_NONNULL_3 + 2*f12126_0_transfer_NONNULL_5 + 2*f12126_0_transfer_NONNULL_6 + 1 30.16/14.44 30.16/14.44 The following rules are decreasing: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f11990_0_transfer_Load(c5, c6, i4572:0:0, i4282:0:0, i4571:0:0) -> f12126_0_transfer_NONNULL(c7, c8, i4572:0:0, o7410:0:0, i4282:0:0, i4571:0:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (i4605:0:0 < i4282:0:0 && i4282:0:0 > -1 && i4571:0:0 > -1 && i4572:0:0 < i4571:0:0) 30.16/14.44 f12126_0_transfer_NONNULL(c9, c10, x13:0, c11, x11:0, x12:0) -> f11990_0_transfer_Load(c12, c13, c14, x11:0, x12:0) :|: c14 = x13:0 + 1 && (c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0)))) && TRUE 30.16/14.44 30.16/14.44 The following rules are bounded: 30.16/14.44 f11990_0_transfer_Load(c5, c6, i4572:0:0, i4282:0:0, i4571:0:0) -> f12126_0_transfer_NONNULL(c7, c8, i4572:0:0, o7410:0:0, i4282:0:0, i4571:0:0) :|: c8 = 0 && (c7 = 0 && (c6 = 0 && c5 = 0)) && (i4605:0:0 < i4282:0:0 && i4282:0:0 > -1 && i4571:0:0 > -1 && i4572:0:0 < i4571:0:0) 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f12126_0_transfer_NONNULL(c9, c10, x13:0, c11, x11:0, x12:0) -> f11990_0_transfer_Load(c12, c13, c14, x11:0, x12:0) :|: c14 = x13:0 + 1 && (c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0)))) && TRUE 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 Interpretation: 30.16/14.44 [ f11990_0_transfer_Load ] = -1 30.16/14.44 [ f12126_0_transfer_NONNULL ] = 0 30.16/14.44 30.16/14.44 The following rules are decreasing: 30.16/14.44 f12126_0_transfer_NONNULL(c9, c10, x13:0, c11, x11:0, x12:0) -> f11990_0_transfer_Load(c12, c13, c14, x11:0, x12:0) :|: c14 = x13:0 + 1 && (c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0)))) && TRUE 30.16/14.44 30.16/14.44 The following rules are bounded: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f12126_0_transfer_NONNULL(c9, c10, x13:0, c11, x11:0, x12:0) -> f11990_0_transfer_Load(c12, c13, c14, x11:0, x12:0) :|: c14 = x13:0 + 1 && (c13 = 0 && (c12 = 0 && (c11 = 0 && (c10 = 0 && c9 = 0)))) && TRUE 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 - IntTRS 30.16/14.44 - PolynomialOrderProcessor 30.16/14.44 30.16/14.44 Rules: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 Found the following polynomial interpretation: 30.16/14.44 [f11990_0_transfer_Load(x, x1, x2, x3, x4)] = c*x + c1*x1 - x2 + x4 30.16/14.44 [f12126_0_transfer_NONNULL(x5, x6, x7, x8, x9, x10)] = c5*x5 + c6*x6 30.16/14.44 30.16/14.44 The following rules are decreasing: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 The following rules are bounded: 30.16/14.44 f11990_0_transfer_Load(c, c1, x7:0, x5:0, x6:0) -> f11990_0_transfer_Load(c2, c3, c4, x5:0, x6:0) :|: c4 = x7:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))) && (x6:0 > -1 && x7:0 < x6:0) 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 - IntTRS 30.16/14.44 - RankingReductionPairProof 30.16/14.44 - IntTRS 30.16/14.44 - PolynomialOrderProcessor 30.16/14.44 - IntTRS 30.16/14.44 30.16/14.44 Rules: 30.16/14.44 f12126_0_transfer_NONNULL(c15, c16, x2:0, c17, x:0, x1:0) -> f12126_0_transfer_NONNULL(c18, c19, x2:0, x3:0, x:0, x1:0) :|: c19 = 0 && (c18 = 0 && (c17 = 0 && (c16 = 0 && c15 = 0))) && (x:0 > -1 && x:0 > x4:0) 30.16/14.44 30.16/14.44 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (17) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x:0, x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x3:0, x:0, x1:0) :|: x:0 > -1 && x:0 > x4:0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (18) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.44 Constructed termination digraph! 30.16/14.44 Nodes: 30.16/14.44 (1) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x:0, x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x3:0, x:0, x1:0) :|: x:0 > -1 && x:0 > x4:0 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (19) 30.16/14.44 Obligation: 30.16/14.44 30.16/14.44 Termination digraph: 30.16/14.44 Nodes: 30.16/14.44 (1) f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x:0, x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x2:0, x3:0, x:0, x1:0) :|: x:0 > -1 && x:0 > x4:0 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (20) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 30.16/14.44 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 30.16/14.44 30.16/14.44 f12126_0_transfer_NONNULL(x1, x2, x3, x4, x5, x6) -> f12126_0_transfer_NONNULL(x1, x2, x4, x5, x6) 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (21) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x:0, x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x3:0, x:0, x1:0) :|: x:0 > -1 && x:0 > x4:0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (22) TempFilterProof (SOUND) 30.16/14.44 Used the following sort dictionary for filtering: 30.16/14.44 f12126_0_transfer_NONNULL(VARIABLE, VARIABLE, VARIABLE, INTEGER, VARIABLE) 30.16/14.44 java.lang.Object(VARIABLE) 30.16/14.44 ARRAY(VARIABLE) 30.16/14.44 javaUtilEx.HashMap$Entry(VARIABLE) 30.16/14.44 Removed predefined arithmetic. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (23) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x3:0, x1:0) 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (24) IRSwTToQDPProof (SOUND) 30.16/14.44 Removed the integers and created a QDP-Problem. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (25) 30.16/14.44 Obligation: 30.16/14.44 Q DP problem: 30.16/14.44 The TRS P consists of the following rules: 30.16/14.44 30.16/14.44 f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x3:0, x1:0) 30.16/14.44 30.16/14.44 R is empty. 30.16/14.44 Q is empty. 30.16/14.44 We have to consider all (P,Q,R)-chains. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (26) QDPSizeChangeProof (EQUIVALENT) 30.16/14.44 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. 30.16/14.44 30.16/14.44 From the DPs we obtained the following set of size-change graphs: 30.16/14.44 *f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x1:0) -> f12126_0_transfer_NONNULL(java.lang.Object(ARRAY(x:0)), java.lang.Object(ARRAY(x1:0)), x3:0, x1:0) 30.16/14.44 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 2 > 4, 4 >= 4 30.16/14.44 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (27) 30.16/14.44 YES 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (28) 30.16/14.44 Obligation: 30.16/14.44 SCC of termination graph based on JBC Program. 30.16/14.44 SCC contains nodes from the following methods: javaUtilEx.HashMap.put(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; 30.16/14.44 SCC calls the following helper methods: javaUtilEx.Content.equals(Ljava/lang/Object;)Z 30.16/14.44 Performed SCC analyses: 30.16/14.44 *Used field analysis yielded the following read fields: 30.16/14.44 *javaUtilEx.HashMap$Entry: [hash, next, key] 30.16/14.44 *Marker field analysis yielded the following relations that could be markers: 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (29) SCCToIRSProof (SOUND) 30.16/14.44 Transformed FIGraph SCCs to intTRSs. Log: 30.16/14.44 Generated rules. Obtained 57 IRulesP rules: 30.16/14.44 f11033_0_put_NULL(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)), i3924, java.lang.Object(o6264sub), java.lang.Object(o6264sub)) -> f11039_0_put_NULL(EOS(STATIC_11039), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(o6264sub), java.lang.Object(o6264sub)) :|: TRUE 30.16/14.44 f11039_0_put_NULL(EOS(STATIC_11039), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(o6264sub), java.lang.Object(o6264sub)) -> f11045_0_put_Load(EOS(STATIC_11045), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(o6264sub)) :|: TRUE 30.16/14.44 f11045_0_put_Load(EOS(STATIC_11045), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(o6264sub)) -> f11051_0_put_FieldAccess(EOS(STATIC_11051), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(o6264sub), java.lang.Object(o6264sub)) :|: TRUE 30.16/14.44 f11051_0_put_FieldAccess(EOS(STATIC_11051), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) -> 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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) :|: TRUE 30.16/14.44 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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) -> f11059_0_put_Load(EOS(STATIC_11059), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947) :|: TRUE 30.16/14.44 f11059_0_put_Load(EOS(STATIC_11059), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947) -> f11063_0_put_NE(EOS(STATIC_11063), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947, i3924) :|: TRUE 30.16/14.44 f11063_0_put_NE(EOS(STATIC_11063), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947, i3924) -> f11067_0_put_NE(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947, i3924) :|: !(i3947 = i3924) 30.16/14.44 f11063_0_put_NE(EOS(STATIC_11063), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), i3924, i3924) -> f11068_0_put_NE(EOS(STATIC_11068), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), i3924, i3924) :|: i3947 = i3924 30.16/14.44 f11067_0_put_NE(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286)), i3947, i3924) -> 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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) :|: !(i3947 = i3924) 30.16/14.44 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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) -> f11079_0_put_FieldAccess(EOS(STATIC_11079), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) :|: TRUE 30.16/14.44 f11079_0_put_FieldAccess(EOS(STATIC_11079), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947, o6288, o6286))) -> f11085_0_put_Store(EOS(STATIC_11085), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11085_0_put_Store(EOS(STATIC_11085), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) -> f11091_0_put_JMP(EOS(STATIC_11091), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11091_0_put_JMP(EOS(STATIC_11091), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) -> f11097_0_put_Load(EOS(STATIC_11097), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11097_0_put_Load(EOS(STATIC_11097), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) -> f11028_0_put_Load(EOS(STATIC_11028), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11028_0_put_Load(EOS(STATIC_11028), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6248) -> f11033_0_put_NULL(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)), i3924, o6248, o6248) :|: TRUE 30.16/14.44 f11068_0_put_NE(EOS(STATIC_11068), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), i3924, i3924) -> f11074_0_put_Load(EOS(STATIC_11074), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286))) :|: TRUE 30.16/14.44 f11074_0_put_Load(EOS(STATIC_11074), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286))) -> f11080_0_put_FieldAccess(EOS(STATIC_11080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286))) :|: TRUE 30.16/14.44 f11080_0_put_FieldAccess(EOS(STATIC_11080), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286))) -> f11086_0_put_Duplicate(EOS(STATIC_11086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286) :|: TRUE 30.16/14.44 f11086_0_put_Duplicate(EOS(STATIC_11086), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286) -> f11092_0_put_Store(EOS(STATIC_11092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286, o6286) :|: TRUE 30.16/14.44 f11092_0_put_Store(EOS(STATIC_11092), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286, o6286) -> f11098_0_put_Load(EOS(STATIC_11098), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286, o6286) :|: TRUE 30.16/14.44 f11098_0_put_Load(EOS(STATIC_11098), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286, o6286) -> f11103_0_put_EQ(EOS(STATIC_11103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, o6286)), o6286, o6286, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f11103_0_put_EQ(EOS(STATIC_11103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11107_0_put_EQ(EOS(STATIC_11107), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f11103_0_put_EQ(EOS(STATIC_11103), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11108_0_put_EQ(EOS(STATIC_11108), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f11107_0_put_EQ(EOS(STATIC_11107), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11113_0_put_Load(EOS(STATIC_11113), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub)) :|: TRUE 30.16/14.44 f11113_0_put_Load(EOS(STATIC_11113), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub)) -> f11118_0_put_Load(EOS(STATIC_11118), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f11118_0_put_Load(EOS(STATIC_11118), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.Content(EOC))) -> f11124_0_put_InvokeMethod(EOS(STATIC_11124), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) :|: TRUE 30.16/14.44 f11124_0_put_InvokeMethod(EOS(STATIC_11124), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) -> f11128_0_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) :|: TRUE 30.16/14.44 f11124_0_put_InvokeMethod(EOS(STATIC_11124), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) -> f11128_1_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) :|: TRUE 30.16/14.44 f11128_0_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) -> f12342_0_equals_Load(EOS(STATIC_12342), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6315sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub)) :|: TRUE 30.16/14.44 f11162_0_equals_Return(EOS(STATIC_11162), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub))), matching1) -> f11176_0_put_EQ(EOS(STATIC_11176), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub))), 0) :|: TRUE && matching1 = 0 30.16/14.44 f11176_0_put_EQ(EOS(STATIC_11176), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub))), matching1) -> f11183_0_put_Load(EOS(STATIC_11183), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub)))) :|: TRUE && matching1 = 0 30.16/14.44 f11183_0_put_Load(EOS(STATIC_11183), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub)))) -> f11191_0_put_FieldAccess(EOS(STATIC_11191), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub)))) :|: TRUE 30.16/14.44 f11191_0_put_FieldAccess(EOS(STATIC_11191), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub)))) -> f11198_0_put_Store(EOS(STATIC_11198), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11198_0_put_Store(EOS(STATIC_11198), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) -> f11085_0_put_Store(EOS(STATIC_11085), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11163_0_equals_Return(EOS(STATIC_11163), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11165_0_equals_Return(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 30.16/14.44 f11165_0_equals_Return(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC)))), i4101) -> f11177_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC)))), i4101) :|: TRUE 30.16/14.44 f11177_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11185_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE && matching1 = 0 30.16/14.44 f11185_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11193_0_put_Load(EOS(STATIC_11193), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE && matching1 = 0 30.16/14.44 f11193_0_put_Load(EOS(STATIC_11193), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11200_0_put_FieldAccess(EOS(STATIC_11200), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC))))) :|: TRUE 30.16/14.44 f11200_0_put_FieldAccess(EOS(STATIC_11200), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6461, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11206_0_put_Store(EOS(STATIC_11206), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6461) :|: TRUE 30.16/14.44 f11206_0_put_Store(EOS(STATIC_11206), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6461) -> f11085_0_put_Store(EOS(STATIC_11085), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6461) :|: TRUE 30.16/14.44 f11164_0_equals_Return(EOS(STATIC_11164), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), matching1) -> f11165_0_equals_Return(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE && matching1 = 1 30.16/14.44 f11108_0_put_EQ(EOS(STATIC_11108), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL, NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11114_0_put_Load(EOS(STATIC_11114), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL) :|: TRUE 30.16/14.44 f11114_0_put_Load(EOS(STATIC_11114), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL) -> f11119_0_put_Load(EOS(STATIC_11119), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f11119_0_put_Load(EOS(STATIC_11119), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), NULL, java.lang.Object(javaUtilEx.Content(EOC))) -> f11125_0_put_InvokeMethod(EOS(STATIC_11125), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 30.16/14.44 f11125_0_put_InvokeMethod(EOS(STATIC_11125), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11129_0_equals_Load(EOS(STATIC_11129), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 30.16/14.44 f11125_0_put_InvokeMethod(EOS(STATIC_11125), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11129_1_equals_Load(EOS(STATIC_11129), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 30.16/14.44 f11129_0_equals_Load(EOS(STATIC_11129), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f12398_0_equals_Load(EOS(STATIC_12398), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 30.16/14.44 f11167_0_equals_Return(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), matching1) -> f11178_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), 0) :|: TRUE && matching1 = 0 30.16/14.44 f11178_0_put_EQ(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), matching1) -> f11186_0_put_Load(EOS(STATIC_11186), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL))) :|: TRUE && matching1 = 0 30.16/14.44 f11186_0_put_Load(EOS(STATIC_11186), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL))) -> f11194_0_put_FieldAccess(EOS(STATIC_11194), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL))) :|: TRUE 30.16/14.44 f11194_0_put_FieldAccess(EOS(STATIC_11194), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL))) -> f11201_0_put_Store(EOS(STATIC_11201), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11201_0_put_Store(EOS(STATIC_11201), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) -> f11085_0_put_Store(EOS(STATIC_11085), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, o6288) :|: TRUE 30.16/14.44 f11128_1_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6393sub)) -> f11162_0_equals_Return(EOS(STATIC_11162), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(o6393sub))), 0) :|: TRUE 30.16/14.44 f11128_1_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11163_0_equals_Return(EOS(STATIC_11163), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), 0) :|: TRUE 30.16/14.44 f11128_1_equals_Load(EOS(STATIC_11128), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f11164_0_equals_Return(EOS(STATIC_11164), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, java.lang.Object(javaUtilEx.Content(EOC)))), 1) :|: TRUE 30.16/14.44 f11129_1_equals_Load(EOS(STATIC_11129), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), java.lang.Object(javaUtilEx.Content(EOC)), NULL) -> f11167_0_equals_Return(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)), i3924, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924, o6288, NULL)), 0) :|: TRUE 30.16/14.44 Combined rules. Obtained 7 IRulesP rules: 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947:0, o6288:0, o6286:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(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)), i3924:0, o6288:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947:0, o6288:0, o6286:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(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)), i3924:0, o6288:0, o6288:0) :|: i3947:0 > i3924:0 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(o6315sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(o6315sub:0)))) -> f11033_0_put_NULL(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)), i3924:0, o6288:0, o6288:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(javaUtilEx.Content(EOC)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(javaUtilEx.Content(EOC))))) -> f11033_0_put_NULL(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)), i3924:0, o6288:0, o6288:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, NULL))) -> f11033_0_put_NULL(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)), i3924:0, o6288:0, o6288:0) :|: TRUE 30.16/14.44 Removed following non-SCC rules: 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(o6315sub:0))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(o6315sub:0)))) -> f12342_0_equals_Load(EOS(STATIC_12342), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub:0), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, java.lang.Object(o6315sub:0))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o6315sub:0)) :|: TRUE 30.16/14.44 f11033_0_put_NULL(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)), i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, NULL)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, i3924:0, o6288:0, NULL))) -> f12398_0_equals_Load(EOS(STATIC_12398), java.lang.Object(javaUtilEx.Content(EOC)), NULL, java.lang.Object(javaUtilEx.Content(EOC)), NULL) :|: TRUE 30.16/14.44 Filtered constant ground arguments: 30.16/14.44 f11033_0_put_NULL(x1, x2, x3, x4, x5, x6, x7) -> f11033_0_put_NULL(x5, x6, x7) 30.16/14.44 EOS(x1) -> EOS 30.16/14.44 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 30.16/14.44 javaUtilEx.Content(x1) -> javaUtilEx.Content 30.16/14.44 javaUtilEx.HashMap$Entry(x1, x2, x3, x4) -> javaUtilEx.HashMap$Entry(x2, x3, x4) 30.16/14.44 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 30.16/14.44 Filtered duplicate arguments: 30.16/14.44 f11033_0_put_NULL(x1, x2, x3) -> f11033_0_put_NULL(x1, x3) 30.16/14.44 Finished conversion. Obtained 5 rules.P rules: 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 > i3924:0 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3924:0, o6288:0, java.lang.Object(o6315sub:0)))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3924:0, o6288:0, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3924:0, o6288:0, NULL))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (30) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 f11033_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11033_0_put_NULL(x, x2) :|: x1 > x 30.16/14.44 f11033_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11033_0_put_NULL(x4, x5) :|: TRUE 30.16/14.44 f11033_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7, x8) :|: TRUE 30.16/14.44 f11033_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, NULL))) -> f11033_0_put_NULL(x9, x10) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (31) IRSFormatTransformerProof (EQUIVALENT) 30.16/14.44 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (32) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 f11033_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11033_0_put_NULL(x, x2) :|: x1 > x 30.16/14.44 f11033_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11033_0_put_NULL(x4, x5) :|: TRUE 30.16/14.44 f11033_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7, x8) :|: TRUE 30.16/14.44 f11033_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, NULL))) -> f11033_0_put_NULL(x9, x10) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (33) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.44 Constructed termination digraph! 30.16/14.44 Nodes: 30.16/14.44 (1) f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 (2) f11033_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11033_0_put_NULL(x, x2) :|: x1 > x 30.16/14.44 (3) f11033_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11033_0_put_NULL(x4, x5) :|: TRUE 30.16/14.44 (4) f11033_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7, x8) :|: TRUE 30.16/14.44 (5) f11033_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, NULL))) -> f11033_0_put_NULL(x9, x10) :|: TRUE 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1), (2), (3), (4), (5) 30.16/14.44 (2) -> (1), (2), (3), (4), (5) 30.16/14.44 (3) -> (1), (2), (3), (4), (5) 30.16/14.44 (4) -> (1), (2), (3), (4), (5) 30.16/14.44 (5) -> (1), (2), (3), (4), (5) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (34) 30.16/14.44 Obligation: 30.16/14.44 30.16/14.44 Termination digraph: 30.16/14.44 Nodes: 30.16/14.44 (1) f11033_0_put_NULL(i3924:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0, o6288:0, o6286:0))) -> f11033_0_put_NULL(i3924:0, o6288:0) :|: i3947:0 < i3924:0 30.16/14.44 (2) f11033_0_put_NULL(x, java.lang.Object(javaUtilEx.HashMap$Entry(x1, x2, x3))) -> f11033_0_put_NULL(x, x2) :|: x1 > x 30.16/14.44 (3) f11033_0_put_NULL(x4, java.lang.Object(javaUtilEx.HashMap$Entry(x4, x5, java.lang.Object(x6)))) -> f11033_0_put_NULL(x4, x5) :|: TRUE 30.16/14.44 (4) f11033_0_put_NULL(x7, java.lang.Object(javaUtilEx.HashMap$Entry(x7, x8, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7, x8) :|: TRUE 30.16/14.44 (5) f11033_0_put_NULL(x9, java.lang.Object(javaUtilEx.HashMap$Entry(x9, x10, NULL))) -> f11033_0_put_NULL(x9, x10) :|: TRUE 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1), (2), (3), (4), (5) 30.16/14.44 (2) -> (1), (2), (3), (4), (5) 30.16/14.44 (3) -> (1), (2), (3), (4), (5) 30.16/14.44 (4) -> (1), (2), (3), (4), (5) 30.16/14.44 (5) -> (1), (2), (3), (4), (5) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (35) IntTRSCompressionProof (EQUIVALENT) 30.16/14.44 Compressed rules. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (36) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11033_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7:0, x8:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(i3924:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0:0, o6288:0:0, o6286:0:0))) -> f11033_0_put_NULL(i3924:0:0, o6288:0:0) :|: i3947:0:0 < i3924:0:0 30.16/14.44 f11033_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, NULL))) -> f11033_0_put_NULL(x9:0, x10:0) :|: TRUE 30.16/14.44 f11033_0_put_NULL(x:0, java.lang.Object(javaUtilEx.HashMap$Entry(x1:0, x2:0, x3:0))) -> f11033_0_put_NULL(x:0, x2:0) :|: x:0 < x1:0 30.16/14.44 f11033_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11033_0_put_NULL(x4:0, x5:0) :|: TRUE 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (37) TempFilterProof (SOUND) 30.16/14.44 Used the following sort dictionary for filtering: 30.16/14.44 f11033_0_put_NULL(VARIABLE, VARIABLE) 30.16/14.44 java.lang.Object(VARIABLE) 30.16/14.44 javaUtilEx.HashMap$Entry(VARIABLE, VARIABLE, VARIABLE) 30.16/14.44 javaUtilEx.Content() 30.16/14.44 NULL() 30.16/14.44 Removed predefined arithmetic. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (38) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f11033_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7:0, x8:0) 30.16/14.44 f11033_0_put_NULL(i3924:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0:0, o6288:0:0, o6286:0:0))) -> f11033_0_put_NULL(i3924:0:0, o6288:0:0) 30.16/14.44 f11033_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, NULL))) -> f11033_0_put_NULL(x9:0, x10:0) 30.16/14.44 f11033_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11033_0_put_NULL(x4:0, x5:0) 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (39) IRSwTToQDPProof (SOUND) 30.16/14.44 Removed the integers and created a QDP-Problem. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (40) 30.16/14.44 Obligation: 30.16/14.44 Q DP problem: 30.16/14.44 The TRS P consists of the following rules: 30.16/14.44 30.16/14.44 f11033_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7:0, x8:0) 30.16/14.44 f11033_0_put_NULL(i3924:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0:0, o6288:0:0, o6286:0:0))) -> f11033_0_put_NULL(i3924:0:0, o6288:0:0) 30.16/14.44 f11033_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, NULL))) -> f11033_0_put_NULL(x9:0, x10:0) 30.16/14.44 f11033_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11033_0_put_NULL(x4:0, x5:0) 30.16/14.44 30.16/14.44 R is empty. 30.16/14.44 Q is empty. 30.16/14.44 We have to consider all (P,Q,R)-chains. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (41) QDPSizeChangeProof (EQUIVALENT) 30.16/14.44 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. 30.16/14.44 30.16/14.44 From the DPs we obtained the following set of size-change graphs: 30.16/14.44 *f11033_0_put_NULL(x7:0, java.lang.Object(javaUtilEx.HashMap$Entry(x7:0, x8:0, java.lang.Object(javaUtilEx.Content)))) -> f11033_0_put_NULL(x7:0, x8:0) 30.16/14.44 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 30.16/14.44 30.16/14.44 30.16/14.44 *f11033_0_put_NULL(i3924:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(i3947:0:0, o6288:0:0, o6286:0:0))) -> f11033_0_put_NULL(i3924:0:0, o6288:0:0) 30.16/14.44 The graph contains the following edges 1 >= 1, 2 > 2 30.16/14.44 30.16/14.44 30.16/14.44 *f11033_0_put_NULL(x9:0, java.lang.Object(javaUtilEx.HashMap$Entry(x9:0, x10:0, NULL))) -> f11033_0_put_NULL(x9:0, x10:0) 30.16/14.44 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 30.16/14.44 30.16/14.44 30.16/14.44 *f11033_0_put_NULL(x4:0, java.lang.Object(javaUtilEx.HashMap$Entry(x4:0, x5:0, java.lang.Object(x6:0)))) -> f11033_0_put_NULL(x4:0, x5:0) 30.16/14.44 The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2 30.16/14.44 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (42) 30.16/14.44 YES 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (43) 30.16/14.44 Obligation: 30.16/14.44 SCC of termination graph based on JBC Program. 30.16/14.44 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreateIteratorValueLoop.createMap(I)LjavaUtilEx/HashMap; 30.16/14.44 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 30.16/14.44 Performed SCC analyses: 30.16/14.44 *Used field analysis yielded the following read fields: 30.16/14.44 *java.lang.String: [count] 30.16/14.44 *Marker field analysis yielded the following relations that could be markers: 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (44) SCCToIRSProof (SOUND) 30.16/14.44 Transformed FIGraph SCCs to intTRSs. Log: 30.16/14.44 Generated rules. Obtained 81 IRulesP rules: 30.16/14.44 f10435_0_createMap_LE(EOS(STATIC_10435(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677) -> f10439_0_createMap_LE(EOS(STATIC_10439(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677) :|: TRUE 30.16/14.44 f10439_0_createMap_LE(EOS(STATIC_10439(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677) -> f10444_0_createMap_New(EOS(STATIC_10444(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: i3677 > 0 30.16/14.44 f10444_0_createMap_New(EOS(STATIC_10444(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10449_0_createMap_Duplicate(EOS(STATIC_10449(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10449_0_createMap_Duplicate(EOS(STATIC_10449(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10453_0_createMap_InvokeMethod(EOS(STATIC_10453(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10453_0_createMap_InvokeMethod(EOS(STATIC_10453(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10457_0_random_FieldAccess(EOS(STATIC_10457(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10457_0_random_FieldAccess(EOS(STATIC_10457(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10467_0_random_FieldAccess(EOS(STATIC_10467(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5922sub)) :|: TRUE 30.16/14.44 f10467_0_random_FieldAccess(EOS(STATIC_10467(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5922sub)) -> f10472_0_random_ArrayAccess(EOS(STATIC_10472(java.lang.Object(o5922sub), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5922sub), i3658) :|: TRUE 30.16/14.44 f10472_0_random_ArrayAccess(EOS(STATIC_10472(java.lang.Object(ARRAY(i3705)), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3658) -> f10477_0_random_ArrayAccess(EOS(STATIC_10477(java.lang.Object(ARRAY(i3705)), i3658)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3658) :|: i3705 >= 0 30.16/14.44 f10477_0_random_ArrayAccess(EOS(STATIC_10477(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3707) -> f10483_0_random_ArrayAccess(EOS(STATIC_10483(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3707) :|: TRUE 30.16/14.44 f10483_0_random_ArrayAccess(EOS(STATIC_10483(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3707) -> f10489_0_random_ArrayAccess(EOS(STATIC_10489(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3707) :|: TRUE 30.16/14.44 f10489_0_random_ArrayAccess(EOS(STATIC_10489(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(ARRAY(i3705)), i3707) -> f10495_0_random_Store(EOS(STATIC_10495(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) :|: i3707 < i3705 30.16/14.44 f10495_0_random_Store(EOS(STATIC_10495(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) -> f10501_0_random_FieldAccess(EOS(STATIC_10501(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) :|: TRUE 30.16/14.44 f10501_0_random_FieldAccess(EOS(STATIC_10501(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) -> f10507_0_random_ConstantStackPush(EOS(STATIC_10507(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3707) :|: TRUE 30.16/14.44 f10507_0_random_ConstantStackPush(EOS(STATIC_10507(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3707) -> f10513_0_random_IntArithmetic(EOS(STATIC_10513(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3707, 1) :|: TRUE 30.16/14.44 f10513_0_random_IntArithmetic(EOS(STATIC_10513(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3707, matching1) -> f10519_0_random_FieldAccess(EOS(STATIC_10519(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3707 + 1) :|: i3707 >= 0 && matching1 = 1 30.16/14.44 f10519_0_random_FieldAccess(EOS(STATIC_10519(java.lang.Object(ARRAY(i3705)), i3707)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953, i3710) -> f10526_0_random_Load(EOS(STATIC_10526(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) :|: TRUE 30.16/14.44 f10526_0_random_Load(EOS(STATIC_10526(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) -> f10533_0_random_InvokeMethod(EOS(STATIC_10533(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), o5953) :|: TRUE 30.16/14.44 f10533_0_random_InvokeMethod(EOS(STATIC_10533(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5964sub)) -> f10538_0_random_InvokeMethod(EOS(STATIC_10538(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5964sub)) :|: TRUE 30.16/14.44 f10538_0_random_InvokeMethod(EOS(STATIC_10538(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) -> f10545_0_random_InvokeMethod(EOS(STATIC_10545(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) :|: TRUE 30.16/14.44 f10545_0_random_InvokeMethod(EOS(STATIC_10545(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) -> f10552_0_length_Load(EOS(STATIC_10552(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) :|: TRUE 30.16/14.44 f10552_0_length_Load(EOS(STATIC_10552(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) -> f10564_0_length_FieldAccess(EOS(STATIC_10564(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(o5970sub)) :|: TRUE 30.16/14.44 f10564_0_length_FieldAccess(EOS(STATIC_10564(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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, i3715))) -> f10571_0_length_FieldAccess(EOS(STATIC_10571(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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, i3715))) :|: i3715 >= 0 30.16/14.44 f10571_0_length_FieldAccess(EOS(STATIC_10571(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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, i3715))) -> f10576_0_length_Return(EOS(STATIC_10576(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10576_0_length_Return(EOS(STATIC_10576(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10582_0_random_Return(EOS(STATIC_10582(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10582_0_random_Return(EOS(STATIC_10582(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10588_0_createMap_InvokeMethod(EOS(STATIC_10588(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10588_0_createMap_InvokeMethod(EOS(STATIC_10588(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10593_0__init__Load(EOS(STATIC_10593(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10593_0__init__Load(EOS(STATIC_10593(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10606_0__init__InvokeMethod(EOS(STATIC_10606(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10606_0__init__InvokeMethod(EOS(STATIC_10606(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715, java.lang.Object(javaUtilEx.Content(EOC))) -> f10611_0__init__Load(EOS(STATIC_10611(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10611_0__init__Load(EOS(STATIC_10611(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10618_0__init__Load(EOS(STATIC_10618(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3715, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10618_0__init__Load(EOS(STATIC_10618(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), i3715, java.lang.Object(javaUtilEx.Content(EOC))) -> f10624_0__init__FieldAccess(EOS(STATIC_10624(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) :|: TRUE 30.16/14.44 f10624_0__init__FieldAccess(EOS(STATIC_10624(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3715) -> f10631_0__init__Return(EOS(STATIC_10631(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10631_0__init__Return(EOS(STATIC_10631(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10638_0_createMap_Store(EOS(STATIC_10638(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10638_0_createMap_Store(EOS(STATIC_10638(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10645_0_createMap_New(EOS(STATIC_10645(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10645_0_createMap_New(EOS(STATIC_10645(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC))) -> f10652_0_createMap_Duplicate(EOS(STATIC_10652(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10652_0_createMap_Duplicate(EOS(STATIC_10652(java.lang.Object(ARRAY(i3705)), i3710)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10659_0_createMap_InvokeMethod(EOS(STATIC_10659(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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 30.16/14.44 f10659_0_createMap_InvokeMethod(EOS(STATIC_10659(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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))) -> f10666_0_random_FieldAccess(EOS(STATIC_10666(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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 30.16/14.44 f10666_0_random_FieldAccess(EOS(STATIC_10666(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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))) -> f10677_0_random_FieldAccess(EOS(STATIC_10677(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705))) :|: TRUE 30.16/14.44 f10677_0_random_FieldAccess(EOS(STATIC_10677(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705))) -> f10682_0_random_ArrayAccess(EOS(STATIC_10682(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705)), i3710) :|: TRUE 30.16/14.44 f10682_0_random_ArrayAccess(EOS(STATIC_10682(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705)), i3710) -> f10686_0_random_ArrayAccess(EOS(STATIC_10686(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705)), i3710) :|: TRUE 30.16/14.44 f10686_0_random_ArrayAccess(EOS(STATIC_10686(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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(i3705)), i3710) -> f10691_0_random_Store(EOS(STATIC_10691(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051) :|: i3710 < i3705 30.16/14.44 f10691_0_random_Store(EOS(STATIC_10691(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051) -> f10696_0_random_FieldAccess(EOS(STATIC_10696(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051) :|: TRUE 30.16/14.44 f10696_0_random_FieldAccess(EOS(STATIC_10696(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051) -> f10698_0_random_ConstantStackPush(EOS(STATIC_10698(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3710) :|: TRUE 30.16/14.44 f10698_0_random_ConstantStackPush(EOS(STATIC_10698(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3710) -> f10701_0_random_IntArithmetic(EOS(STATIC_10701(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3710, 1) :|: TRUE 30.16/14.44 f10701_0_random_IntArithmetic(EOS(STATIC_10701(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3710, matching1) -> f10704_0_random_FieldAccess(EOS(STATIC_10704(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3710 + 1) :|: i3710 > 0 && matching1 = 1 30.16/14.44 f10704_0_random_FieldAccess(EOS(STATIC_10704(java.lang.Object(ARRAY(i3705)), i3710)), i3677, 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)), o6051, i3798) -> f10706_0_random_Load(EOS(STATIC_10706(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), o6051) :|: TRUE 30.16/14.44 f10706_0_random_Load(EOS(STATIC_10706(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), o6051) -> f10709_0_random_InvokeMethod(EOS(STATIC_10709(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), o6051) :|: TRUE 30.16/14.44 f10709_0_random_InvokeMethod(EOS(STATIC_10709(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6065sub)) -> f10712_0_random_InvokeMethod(EOS(STATIC_10712(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6065sub)) :|: TRUE 30.16/14.44 f10712_0_random_InvokeMethod(EOS(STATIC_10712(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) -> f10715_0_random_InvokeMethod(EOS(STATIC_10715(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) :|: TRUE 30.16/14.44 f10715_0_random_InvokeMethod(EOS(STATIC_10715(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) -> f10718_0_length_Load(EOS(STATIC_10718(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) :|: TRUE 30.16/14.44 f10718_0_length_Load(EOS(STATIC_10718(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) -> f10723_0_length_FieldAccess(EOS(STATIC_10723(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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(o6066sub)) :|: TRUE 30.16/14.44 f10723_0_length_FieldAccess(EOS(STATIC_10723(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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, i3811))) -> f10727_0_length_FieldAccess(EOS(STATIC_10727(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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, i3811))) :|: i3811 >= 0 30.16/14.44 f10727_0_length_FieldAccess(EOS(STATIC_10727(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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, i3811))) -> f10729_0_length_Return(EOS(STATIC_10729(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10729_0_length_Return(EOS(STATIC_10729(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10732_0_random_Return(EOS(STATIC_10732(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10732_0_random_Return(EOS(STATIC_10732(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10736_0_createMap_InvokeMethod(EOS(STATIC_10736(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10736_0_createMap_InvokeMethod(EOS(STATIC_10736(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10739_0__init__Load(EOS(STATIC_10739(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10739_0__init__Load(EOS(STATIC_10739(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10746_0__init__InvokeMethod(EOS(STATIC_10746(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10746_0__init__InvokeMethod(EOS(STATIC_10746(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811, java.lang.Object(javaUtilEx.Content(EOC))) -> f10749_0__init__Load(EOS(STATIC_10749(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10749_0__init__Load(EOS(STATIC_10749(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10752_0__init__Load(EOS(STATIC_10752(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3811, java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10752_0__init__Load(EOS(STATIC_10752(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC)), i3811, java.lang.Object(javaUtilEx.Content(EOC))) -> f10756_0__init__FieldAccess(EOS(STATIC_10756(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) :|: TRUE 30.16/14.44 f10756_0__init__FieldAccess(EOS(STATIC_10756(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)), i3811) -> f10760_0__init__Return(EOS(STATIC_10760(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10760_0__init__Return(EOS(STATIC_10760(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10764_0_createMap_Store(EOS(STATIC_10764(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10764_0_createMap_Store(EOS(STATIC_10764(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10768_0_createMap_Load(EOS(STATIC_10768(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) :|: TRUE 30.16/14.44 f10768_0_createMap_Load(EOS(STATIC_10768(java.lang.Object(ARRAY(i3705)), i3798)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), java.lang.Object(javaUtilEx.Content(EOC)), java.lang.Object(javaUtilEx.Content(EOC))) -> f10772_0_createMap_Load(EOS(STATIC_10772(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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 30.16/14.44 f10772_0_createMap_Load(EOS(STATIC_10772(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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)))) -> f10776_0_createMap_Load(EOS(STATIC_10776(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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 30.16/14.44 f10776_0_createMap_Load(EOS(STATIC_10776(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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))) -> f10780_0_createMap_InvokeMethod(EOS(STATIC_10780(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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 30.16/14.44 f10780_0_createMap_InvokeMethod(EOS(STATIC_10780(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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))) -> f10784_0_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i3705)), i3798)), 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))) :|: i3678 >= 1 && i3677 >= 1 && i3798 > 1 && i3678 >= i3677 30.16/14.44 f10780_0_createMap_InvokeMethod(EOS(STATIC_10780(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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))) -> f10784_1_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i3705)), i3798)), i3677, 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))) :|: i3678 >= 1 && i3677 >= 1 && i3798 > 1 && i3678 >= i3677 30.16/14.44 f10784_0_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i3705)), i3798)), 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))) -> f12612_0_put_Load(EOS(STATIC_12612(java.lang.Object(ARRAY(i3705)), i3798)), 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 30.16/14.44 f11263_0_put_Return(EOS(STATIC_11263(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11268_0_createMap_StackPop(EOS(STATIC_11268(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f11268_0_createMap_StackPop(EOS(STATIC_11268(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11272_0_createMap_Inc(EOS(STATIC_11272(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f11272_0_createMap_Inc(EOS(STATIC_11272(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11277_0_createMap_JMP(EOS(STATIC_11277(java.lang.Object(ARRAY(i4204)), i4206)), i3677 + -1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f11277_0_createMap_JMP(EOS(STATIC_11277(java.lang.Object(ARRAY(i4204)), i4206)), i4218, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11282_0_createMap_Load(EOS(STATIC_11282(java.lang.Object(ARRAY(i4204)), i4206)), i4218, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f11282_0_createMap_Load(EOS(STATIC_11282(java.lang.Object(ARRAY(i4204)), i4206)), i4218, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10432_0_createMap_Load(EOS(STATIC_10432(java.lang.Object(ARRAY(i4204)), i4206)), i4218, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f10432_0_createMap_Load(EOS(STATIC_10432(java.lang.Object(o5922sub), i3658)), i3660, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f10435_0_createMap_LE(EOS(STATIC_10435(java.lang.Object(o5922sub), i3658)), i3660, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3660) :|: TRUE 30.16/14.44 f11354_0_put_Return(EOS(STATIC_11354(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11359_0_createMap_StackPop(EOS(STATIC_11359(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 30.16/14.44 f11359_0_createMap_StackPop(EOS(STATIC_11359(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11364_0_createMap_Inc(EOS(STATIC_11364(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f11364_0_createMap_Inc(EOS(STATIC_11364(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) -> f11272_0_createMap_Inc(EOS(STATIC_11272(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f12053_0_put_Return(EOS(STATIC_12053(java.lang.Object(ARRAY(i4595)), i4597)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) -> f11354_0_put_Return(EOS(STATIC_11354(java.lang.Object(ARRAY(i4595)), i4597)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 30.16/14.44 f10784_1_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i4204)), i4206)), i3677, 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))) -> f11263_0_put_Return(EOS(STATIC_11263(java.lang.Object(ARRAY(i4204)), i4206)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC)))) :|: TRUE 30.16/14.44 f10784_1_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i4253)), i4255)), i3677, 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))) -> f11354_0_put_Return(EOS(STATIC_11354(java.lang.Object(ARRAY(i4253)), i4255)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 30.16/14.44 f10784_1_put_Load(EOS(STATIC_10784(java.lang.Object(ARRAY(i4595)), i4597)), i3677, 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))) -> f12053_0_put_Return(EOS(STATIC_12053(java.lang.Object(ARRAY(i4595)), i4597)), i3677, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), NULL) :|: TRUE 30.16/14.44 Combined rules. Obtained 2 IRulesP rules: 30.16/14.44 f10435_0_createMap_LE(EOS(STATIC_10435(java.lang.Object(ARRAY(i3705:0)), i3658:0)), i3677:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677:0) -> f10435_0_createMap_LE(EOS(STATIC_10435(java.lang.Object(ARRAY(i3705:0)), i3658:0 + 2)), i3677:0 - 1, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677:0 - 1) :|: i3705:0 > i3658:0 + 1 && i3677:0 > 0 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 > 0 && i3678:0 >= i3677:0 30.16/14.44 Removed following non-SCC rules: 30.16/14.44 f10435_0_createMap_LE(EOS(STATIC_10435(java.lang.Object(ARRAY(i3705:0)), i3658:0)), i3677:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC))), i3677:0) -> f12612_0_put_Load(EOS(STATIC_12612(java.lang.Object(ARRAY(i3705:0)), i3658: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))) :|: i3705:0 > i3658:0 + 1 && i3677:0 > 0 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 > 0 && i3678:0 >= i3677:0 30.16/14.44 Filtered constant ground arguments: 30.16/14.44 f10435_0_createMap_LE(x1, x2, x3, x4) -> f10435_0_createMap_LE(x1, x2, x4) 30.16/14.44 javaUtilEx.AbstractMap(x1) -> javaUtilEx.AbstractMap 30.16/14.44 javaUtilEx.HashMap(x1) -> javaUtilEx.HashMap 30.16/14.44 Filtered duplicate arguments: 30.16/14.44 f10435_0_createMap_LE(x1, x2, x3) -> f10435_0_createMap_LE(x1, x3) 30.16/14.44 Finished conversion. Obtained 1 rules.P rules: 30.16/14.44 f10435_0_createMap_LE(i3677:0, i3705:0, i3658:0) -> f10435_0_createMap_LE(i3677:0 - 1, i3705:0, i3658:0 + 2) :|: i3677:0 > 0 && i3705:0 > i3658:0 + 1 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 >= i3677:0 && i3678:0 > 0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (45) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f10435_0_createMap_LE(i3677:0, i3705:0, i3658:0) -> f10435_0_createMap_LE(i3677:0 - 1, i3705:0, i3658:0 + 2) :|: i3677:0 > 0 && i3705:0 > i3658:0 + 1 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 >= i3677:0 && i3678:0 > 0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (46) IRSFormatTransformerProof (EQUIVALENT) 30.16/14.44 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (47) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f10435_0_createMap_LE(i3677:0, i3705:0, i3658:0) -> f10435_0_createMap_LE(arith, i3705:0, arith1) :|: i3677:0 > 0 && i3705:0 > i3658:0 + 1 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 >= i3677:0 && i3678:0 > 0 && arith = i3677:0 - 1 && arith1 = i3658:0 + 2 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (48) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.44 Constructed termination digraph! 30.16/14.44 Nodes: 30.16/14.44 (1) f10435_0_createMap_LE(i3677:0, i3705:0, i3658:0) -> f10435_0_createMap_LE(arith, i3705:0, arith1) :|: i3677:0 > 0 && i3705:0 > i3658:0 + 1 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 >= i3677:0 && i3678:0 > 0 && arith = i3677:0 - 1 && arith1 = i3658:0 + 2 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (49) 30.16/14.44 Obligation: 30.16/14.44 30.16/14.44 Termination digraph: 30.16/14.44 Nodes: 30.16/14.44 (1) f10435_0_createMap_LE(i3677:0, i3705:0, i3658:0) -> f10435_0_createMap_LE(arith, i3705:0, arith1) :|: i3677:0 > 0 && i3705:0 > i3658:0 + 1 && i3705:0 > -1 && i3658:0 > -1 && i3715:0 > -1 && i3811:0 > -1 && i3678:0 >= i3677:0 && i3678:0 > 0 && arith = i3677:0 - 1 && arith1 = i3658:0 + 2 30.16/14.44 30.16/14.44 Arcs: 30.16/14.44 (1) -> (1) 30.16/14.44 30.16/14.44 This digraph is fully evaluated! 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (50) IntTRSCompressionProof (EQUIVALENT) 30.16/14.44 Compressed rules. 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (51) 30.16/14.44 Obligation: 30.16/14.44 Rules: 30.16/14.44 f10435_0_createMap_LE(i3677:0:0, i3705:0:0, i3658:0:0) -> f10435_0_createMap_LE(i3677:0:0 - 1, i3705:0:0, i3658:0:0 + 2) :|: i3678:0:0 >= i3677:0:0 && i3678:0:0 > 0 && i3811:0:0 > -1 && i3715:0:0 > -1 && i3658:0:0 > -1 && i3705:0:0 > -1 && i3705:0:0 > i3658:0:0 + 1 && i3677:0:0 > 0 30.16/14.44 30.16/14.44 ---------------------------------------- 30.16/14.44 30.16/14.44 (52) TempFilterProof (SOUND) 30.16/14.44 Used the following sort dictionary for filtering: 30.16/14.45 f10435_0_createMap_LE(INTEGER, INTEGER, INTEGER) 30.16/14.45 Replaced non-predefined constructor symbols by 0. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (53) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f10435_0_createMap_LE(i3677:0:0, i3705:0:0, i3658:0:0) -> f10435_0_createMap_LE(c, i3705:0:0, c1) :|: c1 = i3658:0:0 + 2 && c = i3677:0:0 - 1 && (i3678:0:0 >= i3677:0:0 && i3678:0:0 > 0 && i3811:0:0 > -1 && i3715:0:0 > -1 && i3658:0:0 > -1 && i3705:0:0 > -1 && i3705:0:0 > i3658:0:0 + 1 && i3677:0:0 > 0) 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (54) RankingReductionPairProof (EQUIVALENT) 30.16/14.45 Interpretation: 30.16/14.45 [ f10435_0_createMap_LE ] = f10435_0_createMap_LE_1 30.16/14.45 30.16/14.45 The following rules are decreasing: 30.16/14.45 f10435_0_createMap_LE(i3677:0:0, i3705:0:0, i3658:0:0) -> f10435_0_createMap_LE(c, i3705:0:0, c1) :|: c1 = i3658:0:0 + 2 && c = i3677:0:0 - 1 && (i3678:0:0 >= i3677:0:0 && i3678:0:0 > 0 && i3811:0:0 > -1 && i3715:0:0 > -1 && i3658:0:0 > -1 && i3705:0:0 > -1 && i3705:0:0 > i3658:0:0 + 1 && i3677:0:0 > 0) 30.16/14.45 30.16/14.45 The following rules are bounded: 30.16/14.45 f10435_0_createMap_LE(i3677:0:0, i3705:0:0, i3658:0:0) -> f10435_0_createMap_LE(c, i3705:0:0, c1) :|: c1 = i3658:0:0 + 2 && c = i3677:0:0 - 1 && (i3678:0:0 >= i3677:0:0 && i3678:0:0 > 0 && i3811:0:0 > -1 && i3715:0:0 > -1 && i3658:0:0 > -1 && i3705:0:0 > -1 && i3705:0:0 > i3658:0:0 + 1 && i3677:0:0 > 0) 30.16/14.45 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (55) 30.16/14.45 YES 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (56) 30.16/14.45 Obligation: 30.16/14.45 SCC of termination graph based on JBC Program. 30.16/14.45 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreateIteratorValueLoop.main([Ljava/lang/String;)V 30.16/14.45 SCC calls the following helper methods: 30.16/14.45 Performed SCC analyses: 30.16/14.45 *Used field analysis yielded the following read fields: 30.16/14.45 *javaUtilEx.HashMap$HashIterator: [index, next, this$0, expectedModCount] 30.16/14.45 *javaUtilEx.HashMap$Entry: [value, next] 30.16/14.45 *javaUtilEx.HashMap: [modCount, table] 30.16/14.45 *Marker field analysis yielded the following relations that could be markers: 30.16/14.45 *javaUtilEx.HashMap$HashIterator.index > i4430 (Introduced counter i4626) 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (57) SCCToIRSProof (SOUND) 30.16/14.45 Transformed FIGraph SCCs to intTRSs. Log: 30.16/14.45 Generated rules. Obtained 84 IRulesP rules: 30.16/14.45 f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4429, i4626) -> f11865_0_nextEntry_Load(EOS(STATIC_11865), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: i4430 < i4429 30.16/14.45 f11865_0_nextEntry_Load(EOS(STATIC_11865), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) -> f11869_0_nextEntry_Load(EOS(STATIC_11869), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11869_0_nextEntry_Load(EOS(STATIC_11869), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11872_0_nextEntry_Load(EOS(STATIC_11872), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11872_0_nextEntry_Load(EOS(STATIC_11872), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4626) -> f11875_0_nextEntry_Duplicate(EOS(STATIC_11875), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11875_0_nextEntry_Duplicate(EOS(STATIC_11875), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11878_0_nextEntry_FieldAccess(EOS(STATIC_11878), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11878_0_nextEntry_FieldAccess(EOS(STATIC_11878), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11881_0_nextEntry_Duplicate(EOS(STATIC_11881), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, i4626) :|: TRUE 30.16/14.45 f11881_0_nextEntry_Duplicate(EOS(STATIC_11881), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, i4626) -> f11884_0_nextEntry_ConstantStackPush(EOS(STATIC_11884), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, i4626) :|: TRUE 30.16/14.45 f11884_0_nextEntry_ConstantStackPush(EOS(STATIC_11884), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, i4626) -> f11887_0_nextEntry_IntArithmetic(EOS(STATIC_11887), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, 1, i4626) :|: TRUE 30.16/14.45 f11887_0_nextEntry_IntArithmetic(EOS(STATIC_11887), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430, matching1, i4626) -> f11890_0_nextEntry_FieldAccess(EOS(STATIC_11890), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4430 + 1, i4626) :|: TRUE && matching1 = 1 30.16/14.45 f11890_0_nextEntry_FieldAccess(EOS(STATIC_11890), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4490, i4626) -> f11894_0_nextEntry_ArrayAccess(EOS(STATIC_11894), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4430, i4626 + 1) :|: i4626 >= 0 30.16/14.45 f11894_0_nextEntry_ArrayAccess(EOS(STATIC_11894), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4505, i4626) -> f11897_0_nextEntry_ArrayAccess(EOS(STATIC_11897), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4505, i4626) :|: TRUE 30.16/14.45 f11897_0_nextEntry_ArrayAccess(EOS(STATIC_11897), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4505, i4626) -> f11901_0_nextEntry_ArrayAccess(EOS(STATIC_11901), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4505, i4626) :|: TRUE 30.16/14.45 f11901_0_nextEntry_ArrayAccess(EOS(STATIC_11901), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(ARRAY(i4429)), i4505, i4626) -> f11904_0_nextEntry_Duplicate(EOS(STATIC_11904), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7209, i4626) :|: i4505 < i4429 30.16/14.45 f11904_0_nextEntry_Duplicate(EOS(STATIC_11904), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7209, i4626) -> f11909_0_nextEntry_FieldAccess(EOS(STATIC_11909), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), o7209, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7209, i4626) :|: TRUE 30.16/14.45 f11909_0_nextEntry_FieldAccess(EOS(STATIC_11909), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), o7209, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7209, i4626) -> f11913_0_nextEntry_NONNULL(EOS(STATIC_11913), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, o7209, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, o7209, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), o7209, i4626) :|: TRUE 30.16/14.45 f11913_0_nextEntry_NONNULL(EOS(STATIC_11913), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(o7231sub), i4626) -> f11917_0_nextEntry_NONNULL(EOS(STATIC_11917), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(o7231sub), i4626) :|: TRUE 30.16/14.45 f11913_0_nextEntry_NONNULL(EOS(STATIC_11913), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), NULL, i4626) -> f11918_0_nextEntry_NONNULL(EOS(STATIC_11918), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), NULL, i4626) :|: TRUE 30.16/14.45 f11917_0_nextEntry_NONNULL(EOS(STATIC_11917), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(o7231sub), i4626) -> f11922_0_nextEntry_Load(EOS(STATIC_11922), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11922_0_nextEntry_Load(EOS(STATIC_11922), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11927_0_nextEntry_Load(EOS(STATIC_11927), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11927_0_nextEntry_Load(EOS(STATIC_11927), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11931_0_nextEntry_FieldAccess(EOS(STATIC_11931), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11931_0_nextEntry_FieldAccess(EOS(STATIC_11931), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11934_0_nextEntry_Load(EOS(STATIC_11934), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11934_0_nextEntry_Load(EOS(STATIC_11934), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11937_0_nextEntry_Return(EOS(STATIC_11937), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11937_0_nextEntry_Return(EOS(STATIC_11937), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11940_0_next_FieldAccess(EOS(STATIC_11940), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11940_0_next_FieldAccess(EOS(STATIC_11940), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11944_0_next_Return(EOS(STATIC_11944), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11944_0_next_Return(EOS(STATIC_11944), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11947_0_main_StackPop(EOS(STATIC_11947), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11947_0_main_StackPop(EOS(STATIC_11947), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11950_0_main_JMP(EOS(STATIC_11950), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11950_0_main_JMP(EOS(STATIC_11950), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11954_0_main_Load(EOS(STATIC_11954), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11954_0_main_Load(EOS(STATIC_11954), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11679_0_main_Load(EOS(STATIC_11679), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, java.lang.Object(o7231sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11679_0_main_Load(EOS(STATIC_11679), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11682_0_main_InvokeMethod(EOS(STATIC_11682), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11682_0_main_InvokeMethod(EOS(STATIC_11682), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11685_0_hasNext_Load(EOS(STATIC_11685), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11685_0_hasNext_Load(EOS(STATIC_11685), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11691_0_hasNext_FieldAccess(EOS(STATIC_11691), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11691_0_hasNext_FieldAccess(EOS(STATIC_11691), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11695_0_hasNext_NULL(EOS(STATIC_11695), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11695_0_hasNext_NULL(EOS(STATIC_11695), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) -> f11698_0_hasNext_ConstantStackPush(EOS(STATIC_11698), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11698_0_hasNext_ConstantStackPush(EOS(STATIC_11698), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11702_0_hasNext_JMP(EOS(STATIC_11702), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), 1, i4626) :|: TRUE 30.16/14.45 f11702_0_hasNext_JMP(EOS(STATIC_11702), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), matching1, i4626) -> f11707_0_hasNext_Return(EOS(STATIC_11707), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), 1, i4626) :|: TRUE && matching1 = 1 30.16/14.45 f11707_0_hasNext_Return(EOS(STATIC_11707), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), matching1, i4626) -> f11711_0_main_EQ(EOS(STATIC_11711), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), 1, i4626) :|: TRUE && matching1 = 1 30.16/14.45 f11711_0_main_EQ(EOS(STATIC_11711), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), matching1, i4626) -> f11716_0_main_Load(EOS(STATIC_11716), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: 1 > 0 && matching1 = 1 30.16/14.45 f11716_0_main_Load(EOS(STATIC_11716), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11721_0_main_InvokeMethod(EOS(STATIC_11721), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11721_0_main_InvokeMethod(EOS(STATIC_11721), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11724_0_next_Load(EOS(STATIC_11724), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11724_0_next_Load(EOS(STATIC_11724), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11733_0_next_InvokeMethod(EOS(STATIC_11733), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11733_0_next_InvokeMethod(EOS(STATIC_11733), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11736_0_nextEntry_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11736_0_nextEntry_Load(EOS(STATIC_11736), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11745_0_nextEntry_FieldAccess(EOS(STATIC_11745), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11745_0_nextEntry_FieldAccess(EOS(STATIC_11745), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11747_0_nextEntry_FieldAccess(EOS(STATIC_11747), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i4626) :|: TRUE 30.16/14.45 f11747_0_nextEntry_FieldAccess(EOS(STATIC_11747), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i4626) -> f11752_0_nextEntry_Load(EOS(STATIC_11752), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, i4626) :|: TRUE 30.16/14.45 f11752_0_nextEntry_Load(EOS(STATIC_11752), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, i4626) -> f11756_0_nextEntry_FieldAccess(EOS(STATIC_11756), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11756_0_nextEntry_FieldAccess(EOS(STATIC_11756), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11759_0_nextEntry_EQ(EOS(STATIC_11759), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, i3693, i4626) :|: TRUE 30.16/14.45 f11759_0_nextEntry_EQ(EOS(STATIC_11759), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i3693, i3693, i4626) -> f11763_0_nextEntry_Load(EOS(STATIC_11763), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11763_0_nextEntry_Load(EOS(STATIC_11763), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11766_0_nextEntry_FieldAccess(EOS(STATIC_11766), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11766_0_nextEntry_FieldAccess(EOS(STATIC_11766), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11769_0_nextEntry_Store(EOS(STATIC_11769), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11769_0_nextEntry_Store(EOS(STATIC_11769), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) -> f11773_0_nextEntry_Load(EOS(STATIC_11773), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11773_0_nextEntry_Load(EOS(STATIC_11773), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) -> f11777_0_nextEntry_NONNULL(EOS(STATIC_11777), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11777_0_nextEntry_NONNULL(EOS(STATIC_11777), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), java.lang.Object(o6991sub), i4626) -> f11780_0_nextEntry_Load(EOS(STATIC_11780), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11780_0_nextEntry_Load(EOS(STATIC_11780), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) -> f11784_0_nextEntry_Load(EOS(STATIC_11784), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11784_0_nextEntry_Load(EOS(STATIC_11784), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11788_0_nextEntry_FieldAccess(EOS(STATIC_11788), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o6991sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(o6991sub), i4626) :|: TRUE 30.16/14.45 f11788_0_nextEntry_FieldAccess(EOS(STATIC_11788), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), i4626) -> f11792_0_nextEntry_FieldAccess(EOS(STATIC_11792), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), i4626) :|: TRUE 30.16/14.45 f11792_0_nextEntry_FieldAccess(EOS(STATIC_11792), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), i4626) -> f11796_0_nextEntry_Duplicate(EOS(STATIC_11796), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7064, i4626) :|: TRUE 30.16/14.45 f11796_0_nextEntry_Duplicate(EOS(STATIC_11796), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7064, i4626) -> f11800_0_nextEntry_FieldAccess(EOS(STATIC_11800), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), o7064, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7064, i4626) :|: TRUE 30.16/14.45 f11800_0_nextEntry_FieldAccess(EOS(STATIC_11800), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), o7064, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), o7064, i4626) -> f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, o7064, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, o7064, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, o7064)), o7064, i4626) :|: TRUE 30.16/14.45 f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(o7071sub), i4626) -> f11809_0_nextEntry_NONNULL(EOS(STATIC_11809), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(o7071sub), i4626) :|: TRUE 30.16/14.45 f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), NULL, i4626) -> f11810_0_nextEntry_NONNULL(EOS(STATIC_11810), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), NULL, i4626) :|: TRUE 30.16/14.45 f11809_0_nextEntry_NONNULL(EOS(STATIC_11809), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(o7071sub), i4626) -> f11815_0_nextEntry_Load(EOS(STATIC_11815), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) :|: TRUE 30.16/14.45 f11815_0_nextEntry_Load(EOS(STATIC_11815), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) -> f11819_0_nextEntry_Load(EOS(STATIC_11819), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11819_0_nextEntry_Load(EOS(STATIC_11819), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11825_0_nextEntry_FieldAccess(EOS(STATIC_11825), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) :|: TRUE 30.16/14.45 f11825_0_nextEntry_FieldAccess(EOS(STATIC_11825), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) -> f11830_0_nextEntry_Load(EOS(STATIC_11830), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) :|: TRUE 30.16/14.45 f11830_0_nextEntry_Load(EOS(STATIC_11830), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) -> f11834_0_nextEntry_Return(EOS(STATIC_11834), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) :|: TRUE 30.16/14.45 f11834_0_nextEntry_Return(EOS(STATIC_11834), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) -> f11840_0_next_FieldAccess(EOS(STATIC_11840), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) :|: TRUE 30.16/14.45 f11840_0_next_FieldAccess(EOS(STATIC_11840), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, java.lang.Object(o7071sub))), i4626) -> f11846_0_next_Return(EOS(STATIC_11846), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11846_0_next_Return(EOS(STATIC_11846), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11849_0_main_StackPop(EOS(STATIC_11849), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11849_0_main_StackPop(EOS(STATIC_11849), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11854_0_main_JMP(EOS(STATIC_11854), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11854_0_main_JMP(EOS(STATIC_11854), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11859_0_main_Load(EOS(STATIC_11859), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11859_0_main_Load(EOS(STATIC_11859), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11679_0_main_Load(EOS(STATIC_11679), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, java.lang.Object(o7071sub), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11810_0_nextEntry_NONNULL(EOS(STATIC_11810), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), NULL, i4626) -> f11816_0_nextEntry_Load(EOS(STATIC_11816), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) :|: TRUE 30.16/14.45 f11816_0_nextEntry_Load(EOS(STATIC_11816), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), i4626) -> f11820_0_nextEntry_FieldAccess(EOS(STATIC_11820), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11820_0_nextEntry_FieldAccess(EOS(STATIC_11820), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11826_0_nextEntry_FieldAccess(EOS(STATIC_11826), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i4626) :|: TRUE 30.16/14.45 f11826_0_nextEntry_FieldAccess(EOS(STATIC_11826), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i4626) -> f11831_0_nextEntry_Store(EOS(STATIC_11831), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11831_0_nextEntry_Store(EOS(STATIC_11831), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) -> f11835_0_nextEntry_Load(EOS(STATIC_11835), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11835_0_nextEntry_Load(EOS(STATIC_11835), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) -> f11841_0_nextEntry_FieldAccess(EOS(STATIC_11841), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) :|: TRUE 30.16/14.45 f11841_0_nextEntry_FieldAccess(EOS(STATIC_11841), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), i4626) -> f11847_0_nextEntry_Load(EOS(STATIC_11847), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4626) :|: TRUE 30.16/14.45 f11847_0_nextEntry_Load(EOS(STATIC_11847), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4626) -> f11850_0_nextEntry_ArrayLength(EOS(STATIC_11850), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11850_0_nextEntry_ArrayLength(EOS(STATIC_11850), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, java.lang.Object(ARRAY(i4429)), i4626) -> f11855_0_nextEntry_GE(EOS(STATIC_11855), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4429, i4626) :|: i4429 >= 0 30.16/14.45 f11855_0_nextEntry_GE(EOS(STATIC_11855), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4429, i4626) -> f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4430, i4429, i4626) :|: i4430 < i4429 30.16/14.45 f11918_0_nextEntry_NONNULL(EOS(STATIC_11918), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), NULL, i4626) -> f11923_0_nextEntry_JMP(EOS(STATIC_11923), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11923_0_nextEntry_JMP(EOS(STATIC_11923), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) -> f11928_0_nextEntry_Load(EOS(STATIC_11928), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 f11928_0_nextEntry_Load(EOS(STATIC_11928), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) -> f11835_0_nextEntry_Load(EOS(STATIC_11835), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4490, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693, java.lang.Object(ARRAY(i4429))))), i3693)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063, NULL)), java.lang.Object(ARRAY(i4429)), i4626) :|: TRUE 30.16/14.45 Combined rules. Obtained 4 IRulesP rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:1, java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, o7064:0)), i4626:0) -> f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, o7064:0)), o7064:0, i4626:0) :|: TRUE 30.16/14.45 f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, NULL)), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0) -> f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0 + 1, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0 + 1, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:1, o7064:0)), o7064:0, i4626:0 + 1) :|: i4430:0 < i4429:0 && i4626:0 > -1 30.16/14.45 f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, NULL)), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0) -> f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0 + 1, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0 + 1, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, NULL)), java.lang.Object(ARRAY(i4429:0)), i4430:0 + 1, i4429:0, i4626:0 + 1) :|: i4430:0 + 1 < i4429:0 && i4429:0 > -1 && i4626:0 > -1 30.16/14.45 f11804_0_nextEntry_NONNULL(EOS(STATIC_11804), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, NULL)), NULL, i4626:0) -> f11861_0_nextEntry_GE(EOS(STATIC_11861), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(EOC, i3693:0, java.lang.Object(ARRAY(i4429:0))))), i3693:0)), java.lang.Object(javaUtilEx.HashMap$Entry(EOC, o7063:0, NULL)), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0) :|: i4430:0 < i4429:0 && i4429:0 > -1 30.16/14.45 Filtered constant ground arguments: 30.16/14.45 f11804_0_nextEntry_NONNULL(x1, x2, x3, x4, x5, x6) -> f11804_0_nextEntry_NONNULL(x2, x3, x4, x5, x6) 30.16/14.45 f11861_0_nextEntry_GE(x1, x2, x3, x4, x5, x6, x7, x8) -> f11861_0_nextEntry_GE(x2, x3, x4, x5, x6, x7, x8) 30.16/14.45 javaUtilEx.HashMap$HashIterator(x1, x2, x3, x4, x5) -> javaUtilEx.HashMap$HashIterator(x2, x3, x4, x5) 30.16/14.45 javaUtilEx.HashMap$Entry(x1, x2, x3) -> javaUtilEx.HashMap$Entry(x2, x3) 30.16/14.45 javaUtilEx.HashMap$ValueIterator(x1) -> javaUtilEx.HashMap$ValueIterator 30.16/14.45 javaUtilEx.HashMap(x1, x2, x3) -> javaUtilEx.HashMap(x2, x3) 30.16/14.45 Filtered duplicate arguments: 30.16/14.45 f11804_0_nextEntry_NONNULL(x1, x2, x3, x4, x5) -> f11804_0_nextEntry_NONNULL(x2, x3, x4, x5) 30.16/14.45 f11861_0_nextEntry_GE(x1, x2, x3, x4, x5, x6, x7) -> f11861_0_nextEntry_GE(x2, x3, x4, x5, x6, x7) 30.16/14.45 Filtered unneeded arguments: 30.16/14.45 javaUtilEx.HashMap$HashIterator(x1, x2, x3, x4) -> javaUtilEx.HashMap$HashIterator(x1, x2, x3) 30.16/14.45 javaUtilEx.HashMap$Entry(x1, x2) -> javaUtilEx.HashMap$Entry(x2) 30.16/14.45 f11861_0_nextEntry_GE(x1, x2, x3, x4, x5, x6) -> f11861_0_nextEntry_GE(x1, x3, x4, x5, x6) 30.16/14.45 javaUtilEx.HashMap(x1, x2) -> javaUtilEx.HashMap(x2) 30.16/14.45 Finished conversion. Obtained 4 rules.P rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), i4626:0, i4430:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0, i4430:0, i4429:0) :|: TRUE 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0, i4430:0, i4429:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0 + 1, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0 + 1, i4430:0 + 1, i4429:0) :|: i4430:0 < i4429:0 && i4626:0 > -1 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0, i4430:0, i4429:0, i4429:0) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0 + 1, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(ARRAY(i4429:0)), i4430:0 + 1, i4429:0, i4626:0 + 1, i4430:0 + 1, i4429:0, i4429:0) :|: i4429:0 > -1 && i4626:0 > -1 && i4430:0 + 1 < i4429:0 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, i4626:0, i4430:0, i4429:0) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(ARRAY(i4429:0)), i4430:0, i4429:0, i4626:0, i4430:0, i4429:0, i4429:0) :|: i4430:0 < i4429:0 && i4429:0 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (58) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), i4626:0, i4430:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0, i4430:0, i4429:0) :|: TRUE 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(ARRAY(x1)), x, x1, x2, x, x1, x1) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x + 1, x3, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x3, x2 + 1, x + 1, x1) :|: x < x1 && x2 > -1 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x4, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x5))))))), java.lang.Object(ARRAY(x5)), x4, x5, x6, x4, x5, x5) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x4 + 1, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x5))))))), java.lang.Object(ARRAY(x5)), x4 + 1, x5, x6 + 1, x4 + 1, x5, x5) :|: x5 > -1 && x6 > -1 && x4 + 1 < x5 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, x9, x7, x8) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(ARRAY(x8)), x7, x8, x9, x7, x8, x8) :|: x7 < x8 && x8 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (59) IRSFormatTransformerProof (EQUIVALENT) 30.16/14.45 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (60) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), i4626:0, i4430:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0, i4430:0, i4429:0) :|: TRUE 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(ARRAY(x1)), x, x1, x2, x, x1, x1) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith1, x3, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x3, arith, arith1, x1) :|: x < x1 && x2 > -1 && arith = x2 + 1 && arith1 = x + 1 && arith1 = x + 1 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x10, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x10, x11, x12, x10, x11, x11) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x13, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x13, x11, x14, x13, x11, x11) :|: x11 > -1 && x12 > -1 && x10 + 1 < x11 && x13 = x10 + 1 && x14 = x12 + 1 && x13 = x10 + 1 && x13 = x10 + 1 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, x9, x7, x8) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(ARRAY(x8)), x7, x8, x9, x7, x8, x8) :|: x7 < x8 && x8 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (61) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.45 Constructed termination digraph! 30.16/14.45 Nodes: 30.16/14.45 (1) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), i4626:0, i4430:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0, i4430:0, i4429:0) :|: TRUE 30.16/14.45 (2) f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(ARRAY(x1)), x, x1, x2, x, x1, x1) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith1, x3, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x3, arith, arith1, x1) :|: x < x1 && x2 > -1 && arith = x2 + 1 && arith1 = x + 1 && arith1 = x + 1 30.16/14.45 (3) f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x10, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x10, x11, x12, x10, x11, x11) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x13, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x13, x11, x14, x13, x11, x11) :|: x11 > -1 && x12 > -1 && x10 + 1 < x11 && x13 = x10 + 1 && x14 = x12 + 1 && x13 = x10 + 1 && x13 = x10 + 1 30.16/14.45 (4) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, x9, x7, x8) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(ARRAY(x8)), x7, x8, x9, x7, x8, x8) :|: x7 < x8 && x8 > -1 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1), (4) 30.16/14.45 (2) -> (1), (4) 30.16/14.45 (3) -> (2), (3) 30.16/14.45 (4) -> (2), (3) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (62) 30.16/14.45 Obligation: 30.16/14.45 30.16/14.45 Termination digraph: 30.16/14.45 Nodes: 30.16/14.45 (1) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), i4626:0, i4430:0, i4429:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0, o7064:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0)), o7064:0, i4626:0, i4430:0, i4429:0) :|: TRUE 30.16/14.45 (2) f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(ARRAY(x1)), x, x1, x2, x, x1, x1) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith1, x3, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1))))))), java.lang.Object(javaUtilEx.HashMap$Entry(x3)), x3, arith, arith1, x1) :|: x < x1 && x2 > -1 && arith = x2 + 1 && arith1 = x + 1 && arith1 = x + 1 30.16/14.45 (3) f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x10, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x10, x11, x12, x10, x11, x11) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x13, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11))))))), java.lang.Object(ARRAY(x11)), x13, x11, x14, x13, x11, x11) :|: x11 > -1 && x12 > -1 && x10 + 1 < x11 && x13 = x10 + 1 && x14 = x12 + 1 && x13 = x10 + 1 && x13 = x10 + 1 30.16/14.45 (4) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, x9, x7, x8) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8))))))), java.lang.Object(ARRAY(x8)), x7, x8, x9, x7, x8, x8) :|: x7 < x8 && x8 > -1 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1), (4) 30.16/14.45 (2) -> (1), (4) 30.16/14.45 (3) -> (2), (3) 30.16/14.45 (4) -> (2), (3) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (63) IntTRSCompressionProof (EQUIVALENT) 30.16/14.45 Compressed rules. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (64) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x10:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11:0))))))), java.lang.Object(ARRAY(x11:0)), x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x10:0 + 1, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x11:0))))))), java.lang.Object(ARRAY(x11:0)), x10:0 + 1, x11:0, x12:0 + 1, x10:0 + 1, x11:0, x11:0) :|: x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, o7064:0:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: TRUE 30.16/14.45 f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1:0))))))), java.lang.Object(ARRAY(x1:0)), x:0, x1:0, x2:0, x:0, x1:0, x1:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x:0 + 1, x3:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x1:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(x3:0)), x3:0, x2:0 + 1, x:0 + 1, x1:0) :|: x:0 < x1:0 && x2:0 > -1 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(NULL)), NULL, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(x7:0, NULL, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(x8:0))))))), java.lang.Object(ARRAY(x8:0)), x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: x8:0 > x7:0 && x8:0 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (65) TempFilterProof (SOUND) 30.16/14.45 Used the following sort dictionary for filtering: 30.16/14.45 f11861_0_nextEntry_GE(VARIABLE, VARIABLE, INTEGER, INTEGER, VARIABLE, INTEGER, INTEGER, INTEGER) 30.16/14.45 java.lang.Object(VARIABLE) 30.16/14.45 javaUtilEx.HashMap$HashIterator(VARIABLE, VARIABLE, VARIABLE) 30.16/14.45 NULL() 30.16/14.45 javaUtilEx.AbstractMap(VARIABLE) 30.16/14.45 javaUtilEx.HashMap(VARIABLE) 30.16/14.45 ARRAY(VARIABLE) 30.16/14.45 f11804_0_nextEntry_NONNULL(VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE, VARIABLE) 30.16/14.45 javaUtilEx.HashMap$Entry(VARIABLE) 30.16/14.45 Replaced non-predefined constructor symbols by 0.The following proof was generated: 30.16/14.45 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.16/14.45 30.16/14.45 30.16/14.45 Termination of the given IntTRS could not be shown: 30.16/14.45 30.16/14.45 30.16/14.45 30.16/14.45 - IntTRS 30.16/14.45 - RankingReductionPairProof 30.16/14.45 30.16/14.45 Rules: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 f11861_0_nextEntry_GE(c12, c13, x:0, x1:0, x2:0, x:0, x1:0, x1:0) -> f11804_0_nextEntry_NONNULL(c14, c15, x3:0, c16, c17, x1:0) :|: c17 = x:0 + 1 && (c16 = x2:0 + 1 && (c15 = 0 && (c14 = 0 && (c13 = 0 && c12 = 0)))) && (x:0 < x1:0 && x2:0 > -1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c18, c19, c20, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(c21, c22, x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: c22 = 0 && (c21 = 0 && (c20 = 0 && (c19 = 0 && c18 = 0))) && (x8:0 > x7:0 && x8:0 > -1) 30.16/14.45 30.16/14.45 Interpretation: 30.16/14.45 [ f11861_0_nextEntry_GE ] = 4*f11861_0_nextEntry_GE_8 + 2*f11861_0_nextEntry_GE_5 + -4*f11861_0_nextEntry_GE_6 30.16/14.45 [ f11804_0_nextEntry_NONNULL ] = 2*f11804_0_nextEntry_NONNULL_4 + -4*f11804_0_nextEntry_NONNULL_5 + 4*f11804_0_nextEntry_NONNULL_6 + 1 30.16/14.45 30.16/14.45 The following rules are decreasing: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11861_0_nextEntry_GE(c12, c13, x:0, x1:0, x2:0, x:0, x1:0, x1:0) -> f11804_0_nextEntry_NONNULL(c14, c15, x3:0, c16, c17, x1:0) :|: c17 = x:0 + 1 && (c16 = x2:0 + 1 && (c15 = 0 && (c14 = 0 && (c13 = 0 && c12 = 0)))) && (x:0 < x1:0 && x2:0 > -1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c18, c19, c20, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(c21, c22, x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: c22 = 0 && (c21 = 0 && (c20 = 0 && (c19 = 0 && c18 = 0))) && (x8:0 > x7:0 && x8:0 > -1) 30.16/14.45 30.16/14.45 The following rules are bounded: 30.16/14.45 f11861_0_nextEntry_GE(c12, c13, x:0, x1:0, x2:0, x:0, x1:0, x1:0) -> f11804_0_nextEntry_NONNULL(c14, c15, x3:0, c16, c17, x1:0) :|: c17 = x:0 + 1 && (c16 = x2:0 + 1 && (c15 = 0 && (c14 = 0 && (c13 = 0 && c12 = 0)))) && (x:0 < x1:0 && x2:0 > -1) 30.16/14.45 30.16/14.45 30.16/14.45 30.16/14.45 - IntTRS 30.16/14.45 - RankingReductionPairProof 30.16/14.45 - IntTRS 30.16/14.45 - PolynomialOrderProcessor 30.16/14.45 30.16/14.45 Rules: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 f11804_0_nextEntry_NONNULL(c18, c19, c20, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(c21, c22, x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: c22 = 0 && (c21 = 0 && (c20 = 0 && (c19 = 0 && c18 = 0))) && (x8:0 > x7:0 && x8:0 > -1) 30.16/14.45 30.16/14.45 Found the following polynomial interpretation: 30.16/14.45 [f11861_0_nextEntry_GE(x, x1, x2, x3, x4, x5, x6, x7)] = c*x + c1*x1 30.16/14.45 [f11804_0_nextEntry_NONNULL(x8, x9, x10, x11, x12, x13)] = 1 + c8*x8 + c9*x9 30.16/14.45 30.16/14.45 The following rules are decreasing: 30.16/14.45 f11804_0_nextEntry_NONNULL(c18, c19, c20, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(c21, c22, x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: c22 = 0 && (c21 = 0 && (c20 = 0 && (c19 = 0 && c18 = 0))) && (x8:0 > x7:0 && x8:0 > -1) 30.16/14.45 The following rules are bounded: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 f11804_0_nextEntry_NONNULL(c18, c19, c20, x9:0, x7:0, x8:0) -> f11861_0_nextEntry_GE(c21, c22, x7:0, x8:0, x9:0, x7:0, x8:0, x8:0) :|: c22 = 0 && (c21 = 0 && (c20 = 0 && (c19 = 0 && c18 = 0))) && (x8:0 > x7:0 && x8:0 > -1) 30.16/14.45 30.16/14.45 30.16/14.45 - IntTRS 30.16/14.45 - RankingReductionPairProof 30.16/14.45 - IntTRS 30.16/14.45 - PolynomialOrderProcessor 30.16/14.45 - IntTRS 30.16/14.45 - PolynomialOrderProcessor 30.16/14.45 30.16/14.45 Rules: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 30.16/14.45 Found the following polynomial interpretation: 30.16/14.45 [f11861_0_nextEntry_GE(x, x1, x2, x3, x4, x5, x6, x7)] = c*x + c1*x1 - x2 + x7 30.16/14.45 [f11804_0_nextEntry_NONNULL(x8, x9, x10, x11, x12, x13)] = c8*x8 + c9*x9 30.16/14.45 30.16/14.45 The following rules are decreasing: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 The following rules are bounded: 30.16/14.45 f11861_0_nextEntry_GE(c, c1, x10:0, x11:0, x12:0, x10:0, x11:0, x11:0) -> f11861_0_nextEntry_GE(c2, c3, c4, x11:0, c5, c6, x11:0, x11:0) :|: c6 = x10:0 + 1 && (c5 = x12:0 + 1 && (c4 = x10:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (x11:0 > -1 && x12:0 > -1 && x11:0 > x10:0 + 1) 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 30.16/14.45 30.16/14.45 - IntTRS 30.16/14.45 - RankingReductionPairProof 30.16/14.45 - IntTRS 30.16/14.45 - PolynomialOrderProcessor 30.16/14.45 - IntTRS 30.16/14.45 - PolynomialOrderProcessor 30.16/14.45 - IntTRS 30.16/14.45 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(c7, c8, c9, i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(c10, c11, o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: c11 = 0 && (c10 = 0 && (c9 = 0 && (c8 = 0 && c7 = 0))) && TRUE 30.16/14.45 30.16/14.45 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (66) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, o7064:0:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: TRUE 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (67) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.45 Constructed termination digraph! 30.16/14.45 Nodes: 30.16/14.45 (1) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, o7064:0:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: TRUE 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (68) 30.16/14.45 Obligation: 30.16/14.45 30.16/14.45 Termination digraph: 30.16/14.45 Nodes: 30.16/14.45 (1) f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), i4626:0:0, i4430:0:0, i4429:0:0) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(i4430:0:0, o7064:0:0, java.lang.Object(javaUtilEx.AbstractMap(javaUtilEx.HashMap(java.lang.Object(ARRAY(i4429:0:0))))))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0, i4626:0:0, i4430:0:0, i4429:0:0) :|: TRUE 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (69) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 30.16/14.45 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 30.16/14.45 30.16/14.45 f11804_0_nextEntry_NONNULL(x1, x2, x3, x4, x5, x6) -> f11804_0_nextEntry_NONNULL(x1, x2, x3) 30.16/14.45 javaUtilEx.HashMap$HashIterator(x1, x2, x3) -> javaUtilEx.HashMap$HashIterator(x2) 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (70) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0))) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(o7064:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0) :|: TRUE 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (71) TempFilterProof (SOUND) 30.16/14.45 Used the following sort dictionary for filtering: 30.16/14.45 f11804_0_nextEntry_NONNULL(VARIABLE, VARIABLE, VARIABLE) 30.16/14.45 java.lang.Object(VARIABLE) 30.16/14.45 javaUtilEx.HashMap$HashIterator(VARIABLE) 30.16/14.45 javaUtilEx.HashMap$Entry(VARIABLE) 30.16/14.45 Removed predefined arithmetic. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (72) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0))) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(o7064:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0) 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (73) IRSwTToQDPProof (SOUND) 30.16/14.45 Removed the integers and created a QDP-Problem. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (74) 30.16/14.45 Obligation: 30.16/14.45 Q DP problem: 30.16/14.45 The TRS P consists of the following rules: 30.16/14.45 30.16/14.45 f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0))) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(o7064:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0) 30.16/14.45 30.16/14.45 R is empty. 30.16/14.45 Q is empty. 30.16/14.45 We have to consider all (P,Q,R)-chains. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (75) QDPSizeChangeProof (EQUIVALENT) 30.16/14.45 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. 30.16/14.45 30.16/14.45 From the DPs we obtained the following set of size-change graphs: 30.16/14.45 *f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)))), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0))) -> f11804_0_nextEntry_NONNULL(java.lang.Object(javaUtilEx.HashMap$HashIterator(o7064:0:0)), java.lang.Object(javaUtilEx.HashMap$Entry(o7064:0:0)), o7064:0:0) 30.16/14.45 The graph contains the following edges 1 > 2, 2 > 2, 3 >= 2, 1 > 3, 2 > 3, 3 > 3 30.16/14.45 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (76) 30.16/14.45 YES 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (77) 30.16/14.45 Obligation: 30.16/14.45 SCC of termination graph based on JBC Program. 30.16/14.45 SCC contains nodes from the following methods: javaUtilEx.juHashMapCreateIteratorValueLoop.main([Ljava/lang/String;)V 30.16/14.45 SCC calls the following helper methods: 30.16/14.45 Performed SCC analyses: 30.16/14.45 *Used field analysis yielded the following read fields: 30.16/14.45 *javaUtilEx.HashMap$HashIterator: [index] 30.16/14.45 *Marker field analysis yielded the following relations that could be markers: 30.16/14.45 *javaUtilEx.HashMap$HashIterator.index > i3943 (Introduced counter i4627) 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (78) SCCToIRSProof (SOUND) 30.16/14.45 Transformed FIGraph SCCs to intTRSs. Log: 30.16/14.45 Generated rules. Obtained 23 IRulesP rules: 30.16/14.45 f11072_0__init__GE(EOS(STATIC_11072), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i3942, i4627) -> f11078_0__init__Load(EOS(STATIC_11078), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i4627) :|: i3943 < i3942 30.16/14.45 f11078_0__init__Load(EOS(STATIC_11078), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i4627) -> f11084_0__init__Load(EOS(STATIC_11084), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) :|: TRUE 30.16/14.45 f11084_0__init__Load(EOS(STATIC_11084), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) -> f11090_0__init__Load(EOS(STATIC_11090), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i4627) :|: TRUE 30.16/14.45 f11090_0__init__Load(EOS(STATIC_11090), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i4627) -> f11096_0__init__Duplicate(EOS(STATIC_11096), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) :|: TRUE 30.16/14.45 f11096_0__init__Duplicate(EOS(STATIC_11096), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) -> f11102_0__init__FieldAccess(EOS(STATIC_11102), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) :|: TRUE 30.16/14.45 f11102_0__init__FieldAccess(EOS(STATIC_11102), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) -> f11106_0__init__Duplicate(EOS(STATIC_11106), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, i4627) :|: TRUE 30.16/14.45 f11106_0__init__Duplicate(EOS(STATIC_11106), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, i4627) -> f11112_0__init__ConstantStackPush(EOS(STATIC_11112), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, i4627) :|: TRUE 30.16/14.45 f11112_0__init__ConstantStackPush(EOS(STATIC_11112), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, i4627) -> f11117_0__init__IntArithmetic(EOS(STATIC_11117), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, 1, i4627) :|: TRUE 30.16/14.45 f11117_0__init__IntArithmetic(EOS(STATIC_11117), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943, matching1, i4627) -> f11123_0__init__FieldAccess(EOS(STATIC_11123), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3943 + 1, i4627) :|: i3943 >= 0 && matching1 = 1 30.16/14.45 f11123_0__init__FieldAccess(EOS(STATIC_11123), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i3971, i4627) -> f11127_0__init__ArrayAccess(EOS(STATIC_11127), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i3943, i4627 + 1) :|: i4627 >= 0 30.16/14.45 f11127_0__init__ArrayAccess(EOS(STATIC_11127), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i3943, i4627) -> f11134_0__init__ArrayAccess(EOS(STATIC_11134), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i3943, i4627) :|: TRUE 30.16/14.45 f11134_0__init__ArrayAccess(EOS(STATIC_11134), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i3943, i4627) -> f11142_0__init__Duplicate(EOS(STATIC_11142), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), o6351, i4627) :|: i3943 < i3942 30.16/14.45 f11142_0__init__Duplicate(EOS(STATIC_11142), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), o6351, i4627) -> f11149_0__init__FieldAccess(EOS(STATIC_11149), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), o6351, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), o6351, i4627) :|: TRUE 30.16/14.45 f11149_0__init__FieldAccess(EOS(STATIC_11149), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), o6351, java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), o6351, i4627) -> f11152_0__init__NONNULL(EOS(STATIC_11152), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), o6351, i4627) :|: TRUE 30.16/14.45 f11152_0__init__NONNULL(EOS(STATIC_11152), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), NULL, i4627) -> f11158_0__init__NONNULL(EOS(STATIC_11158), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), NULL, i4627) :|: TRUE 30.16/14.45 f11158_0__init__NONNULL(EOS(STATIC_11158), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), NULL, i4627) -> f11175_0__init__JMP(EOS(STATIC_11175), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i4627) :|: TRUE 30.16/14.45 f11175_0__init__JMP(EOS(STATIC_11175), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i4627) -> f11181_0__init__Load(EOS(STATIC_11181), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i4627) :|: TRUE 30.16/14.45 f11181_0__init__Load(EOS(STATIC_11181), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i4627) -> f11050_0__init__Load(EOS(STATIC_11050), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3971)), java.lang.Object(ARRAY(i3942)), i4627) :|: TRUE 30.16/14.45 f11050_0__init__Load(EOS(STATIC_11050), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i4627) -> f11054_0__init__FieldAccess(EOS(STATIC_11054), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) :|: TRUE 30.16/14.45 f11054_0__init__FieldAccess(EOS(STATIC_11054), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), i4627) -> f11058_0__init__Load(EOS(STATIC_11058), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i4627) :|: TRUE 30.16/14.45 f11058_0__init__Load(EOS(STATIC_11058), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i4627) -> f11062_0__init__ArrayLength(EOS(STATIC_11062), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(ARRAY(i3942)), i4627) :|: TRUE 30.16/14.45 f11062_0__init__ArrayLength(EOS(STATIC_11062), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, java.lang.Object(ARRAY(i3942)), i4627) -> f11066_0__init__GE(EOS(STATIC_11066), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i3942, i4627) :|: i3942 >= 0 30.16/14.45 f11066_0__init__GE(EOS(STATIC_11066), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i3942, i4627) -> f11072_0__init__GE(EOS(STATIC_11072), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943)), java.lang.Object(ARRAY(i3942)), i3943, i3942, i4627) :|: i3943 < i3942 30.16/14.45 Combined rules. Obtained 1 IRulesP rules: 30.16/14.45 f11072_0__init__GE(EOS(STATIC_11072), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943:0)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0) -> f11072_0__init__GE(EOS(STATIC_11072), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943:0 + 1)), java.lang.Object(javaUtilEx.HashMap$HashIterator(javaUtilEx.HashMap$ValueIterator(EOC), i3943:0 + 1)), java.lang.Object(ARRAY(i3942:0)), i3943:0 + 1, i3942:0, i4627:0 + 1) :|: i3943:0 + 1 < i3942:0 && i3943:0 > -1 && i3942:0 > -1 && i4627:0 > -1 30.16/14.45 Filtered constant ground arguments: 30.16/14.45 f11072_0__init__GE(x1, x2, x3, x4, x5, x6, x7) -> f11072_0__init__GE(x2, x3, x4, x5, x6, x7) 30.16/14.45 EOS(x1) -> EOS 30.16/14.45 javaUtilEx.HashMap$HashIterator(x1, x2) -> javaUtilEx.HashMap$HashIterator(x2) 30.16/14.45 javaUtilEx.HashMap$ValueIterator(x1) -> javaUtilEx.HashMap$ValueIterator 30.16/14.45 Filtered duplicate arguments: 30.16/14.45 f11072_0__init__GE(x1, x2, x3, x4, x5, x6) -> f11072_0__init__GE(x2, x3, x4, x5, x6) 30.16/14.45 Finished conversion. Obtained 1 rules.P rules: 30.16/14.45 f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0, i3943:0, i3942:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0 + 1)), java.lang.Object(ARRAY(i3942:0)), i3943:0 + 1, i3942:0, i4627:0 + 1, i3943:0 + 1, i3942:0) :|: i3943:0 > -1 && i3943:0 + 1 < i3942:0 && i4627:0 > -1 && i3942:0 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (79) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0, i3943:0, i3942:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0 + 1)), java.lang.Object(ARRAY(i3942:0)), i3943:0 + 1, i3942:0, i4627:0 + 1, i3943:0 + 1, i3942:0) :|: i3943:0 > -1 && i3943:0 + 1 < i3942:0 && i4627:0 > -1 && i3942:0 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (80) IRSFormatTransformerProof (EQUIVALENT) 30.16/14.45 Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (81) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0, i3943:0, i3942:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith)), java.lang.Object(ARRAY(i3942:0)), arith, i3942:0, arith1, arith, i3942:0) :|: i3943:0 > -1 && i3943:0 + 1 < i3942:0 && i4627:0 > -1 && i3942:0 > -1 && arith = i3943:0 + 1 && arith1 = i4627:0 + 1 && arith = i3943:0 + 1 && arith = i3943:0 + 1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (82) IRSwTTerminationDigraphProof (EQUIVALENT) 30.16/14.45 Constructed termination digraph! 30.16/14.45 Nodes: 30.16/14.45 (1) f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0, i3943:0, i3942:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith)), java.lang.Object(ARRAY(i3942:0)), arith, i3942:0, arith1, arith, i3942:0) :|: i3943:0 > -1 && i3943:0 + 1 < i3942:0 && i4627:0 > -1 && i3942:0 > -1 && arith = i3943:0 + 1 && arith1 = i4627:0 + 1 && arith = i3943:0 + 1 && arith = i3943:0 + 1 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (83) 30.16/14.45 Obligation: 30.16/14.45 30.16/14.45 Termination digraph: 30.16/14.45 Nodes: 30.16/14.45 (1) f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0)), java.lang.Object(ARRAY(i3942:0)), i3943:0, i3942:0, i4627:0, i3943:0, i3942:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(arith)), java.lang.Object(ARRAY(i3942:0)), arith, i3942:0, arith1, arith, i3942:0) :|: i3943:0 > -1 && i3943:0 + 1 < i3942:0 && i4627:0 > -1 && i3942:0 > -1 && arith = i3943:0 + 1 && arith1 = i4627:0 + 1 && arith = i3943:0 + 1 && arith = i3943:0 + 1 30.16/14.45 30.16/14.45 Arcs: 30.16/14.45 (1) -> (1) 30.16/14.45 30.16/14.45 This digraph is fully evaluated! 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (84) IntTRSCompressionProof (EQUIVALENT) 30.16/14.45 Compressed rules. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (85) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0:0)), java.lang.Object(ARRAY(i3942:0:0)), i3943:0:0, i3942:0:0, i4627:0:0, i3943:0:0, i3942:0:0) -> f11072_0__init__GE(java.lang.Object(javaUtilEx.HashMap$HashIterator(i3943:0:0 + 1)), java.lang.Object(ARRAY(i3942:0:0)), i3943:0:0 + 1, i3942:0:0, i4627:0:0 + 1, i3943:0:0 + 1, i3942:0:0) :|: i4627:0:0 > -1 && i3942:0:0 > -1 && i3943:0:0 + 1 < i3942:0:0 && i3943:0:0 > -1 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (86) TempFilterProof (SOUND) 30.16/14.45 Used the following sort dictionary for filtering: 30.16/14.45 f11072_0__init__GE(VARIABLE, VARIABLE, INTEGER, INTEGER, INTEGER, INTEGER, INTEGER) 30.16/14.45 java.lang.Object(VARIABLE) 30.16/14.45 javaUtilEx.HashMap$HashIterator(INTEGER) 30.16/14.45 ARRAY(INTEGER) 30.16/14.45 Replaced non-predefined constructor symbols by 0. 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (87) 30.16/14.45 Obligation: 30.16/14.45 Rules: 30.16/14.45 f11072_0__init__GE(c, c1, i3943:0:0, i3942:0:0, i4627:0:0, i3943:0:0, i3942:0:0) -> f11072_0__init__GE(c2, c3, c4, i3942:0:0, c5, c6, i3942:0:0) :|: c6 = i3943:0:0 + 1 && (c5 = i4627:0:0 + 1 && (c4 = i3943:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (i4627:0:0 > -1 && i3942:0:0 > -1 && i3943:0:0 + 1 < i3942:0:0 && i3943:0:0 > -1) 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (88) PolynomialOrderProcessor (EQUIVALENT) 30.16/14.45 Found the following polynomial interpretation: 30.16/14.45 [f11072_0__init__GE(x, x1, x2, x3, x4, x5, x6)] = c*x + c1*x1 - x2 + x3 30.16/14.45 30.16/14.45 The following rules are decreasing: 30.16/14.45 f11072_0__init__GE(c, c1, i3943:0:0, i3942:0:0, i4627:0:0, i3943:0:0, i3942:0:0) -> f11072_0__init__GE(c2, c3, c4, i3942:0:0, c5, c6, i3942:0:0) :|: c6 = i3943:0:0 + 1 && (c5 = i4627:0:0 + 1 && (c4 = i3943:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (i4627:0:0 > -1 && i3942:0:0 > -1 && i3943:0:0 + 1 < i3942:0:0 && i3943:0:0 > -1) 30.16/14.45 The following rules are bounded: 30.16/14.45 f11072_0__init__GE(c, c1, i3943:0:0, i3942:0:0, i4627:0:0, i3943:0:0, i3942:0:0) -> f11072_0__init__GE(c2, c3, c4, i3942:0:0, c5, c6, i3942:0:0) :|: c6 = i3943:0:0 + 1 && (c5 = i4627:0:0 + 1 && (c4 = i3943:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0))))) && (i4627:0:0 > -1 && i3942:0:0 > -1 && i3943:0:0 + 1 < i3942:0:0 && i3943:0:0 > -1) 30.16/14.45 30.16/14.45 ---------------------------------------- 30.16/14.45 30.16/14.45 (89) 30.16/14.45 YES 30.22/14.48 EOF