/libcore/ojluni/src/main/java/java/util/ |
H A D | SortedMap.java | 34 * {@code entrySet}, {@code keySet} and {@code values} methods). 283 Set<Map.Entry<K, V>> entrySet(); method in interface:SortedMap
|
H A D | AbstractMap.java | 34 * class and provide an implementation for the <tt>entrySet</tt> method, which 43 * <tt>entrySet().iterator()</tt> must additionally implement its 82 * This implementation returns <tt>entrySet().size()</tt>. 85 return entrySet().size(); 102 * This implementation iterates over <tt>entrySet()</tt> searching 112 Iterator<Entry<K,V>> i = entrySet().iterator(); 133 * This implementation iterates over <tt>entrySet()</tt> searching 144 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); 165 * This implementation iterates over <tt>entrySet()</tt> searching 176 Iterator<Entry<K,V>> i = entrySet() 448 public abstract Set<Entry<K,V>> entrySet(); method in class:AbstractMap [all...] |
H A D | EnumMap.java | 41 * {@link #entrySet()}, and {@link #values()}). 370 private transient Set<Map.Entry<K,V>> entrySet; field in class:EnumMap 465 public Set<Map.Entry<K,V>> entrySet() { method in class:EnumMap 466 Set<Map.Entry<K,V>> es = entrySet; 470 return entrySet = new EntrySet(); 735 result.entrySet = null;
|
H A D | Map.java | 360 Set<Map.Entry<K, V>> entrySet(); method in interface:Map 363 * A map entry (key-value pair). The {@code Map.entrySet} method returns 372 * @see Map#entrySet() 538 * {@code m1.entrySet().equals(m2.entrySet())}. This ensures that the 550 * {@code entrySet()} view. This ensures that {@code m1.equals(m2)} 603 * for (Map.Entry<K, V> entry : map.entrySet()) 620 for (Map.Entry<K, V> entry : entrySet()) { 643 * for (Map.Entry<K, V> entry : map.entrySet()) 675 for (Map.Entry<K, V> entry : entrySet()) { [all...] |
H A D | LinkedHashMap.java | 199 * LinkedHashMap.Entry<K, V> entry = map.entrySet().iterator.next() 203 * entrySet()'s elements. 668 public Set<Map.Entry<K,V>> entrySet() { method in class:LinkedHashMap 670 return (es = entrySet) == null ? (entrySet = new LinkedEntrySet()) : es;
|
H A D | Hashtable.java | 524 for (Map.Entry<? extends K, ? extends V> e : t.entrySet()) 555 t.entrySet = null; 581 Iterator<Map.Entry<K,V>> it = entrySet().iterator(); 623 private transient volatile Set<Map.Entry<K,V>> entrySet; field in class:Hashtable 681 public Set<Map.Entry<K,V>> entrySet() { method in class:Hashtable 682 if (entrySet==null) 683 entrySet = Collections.synchronizedSet(new EntrySet(), this); 684 return entrySet; 806 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); 1258 // Hashtable.Entry<K, V> entry = hashtable.entrySet() [all...] |
H A D | IdentityHashMap.java | 505 for (Entry<? extends K, ? extends V> e : m.entrySet()) 627 * <tt>this.entrySet().equals(m.entrySet())</tt>. 656 return entrySet().equals(m.entrySet()); 665 * <tt>entrySet()</tt> view. This ensures that <tt>m1.equals(m2)</tt> 672 * <tt>entrySet</tt> method, it is possible that the contractual 704 m.entrySet = null; 925 private transient Set<Map.Entry<K,V>> entrySet; field in class:IdentityHashMap 1176 public Set<Map.Entry<K,V>> entrySet() { method in class:IdentityHashMap [all...] |
H A D | WeakHashMap.java | 565 for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) 851 private transient Set<Map.Entry<K,V>> entrySet; field in class:WeakHashMap 964 public Set<Map.Entry<K,V>> entrySet() { method in class:WeakHashMap 965 Set<Map.Entry<K,V>> es = entrySet; 966 return es != null ? es : (entrySet = new EntrySet());
|
H A D | HashMap.java | 398 * Holds cached entrySet(). Note that AbstractMap fields are used 401 transient Set<Map.Entry<K,V>> entrySet; field in class:HashMap 511 for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) { 1006 public Set<Map.Entry<K,V>> entrySet() { method in class:HashMap 1008 return (es = entrySet) == null ? (entrySet = new EntrySet()) : es; 1769 entrySet = null;
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | EvilMapTest.java | 41 @Override public Set<Entry<K, V>> entrySet() { return entries; } method in class:EvilMapTest.EvilMap
|
H A D | OldAbstractMapTest.java | 110 @Override public Set<Entry<String, String>> entrySet() { method in class:OldAbstractMapTest.AMT
|
/libcore/support/src/test/java/tests/support/ |
H A D | Support_MapTest.java | 53 // entrySet() 54 testEntrySet(modifiableMap.entrySet(), unmodifiableMap.entrySet()); 85 Set<Map.Entry<String, Integer>> entrySet) { 86 // entrySet should be a set of mappings {"0", 0}, {"1",1}... {"99", 99} 88 assertEquals(100, entrySet.size()); 93 crossCheckOrdering(referenceEntrySet, entrySet, Map.Entry.class); 83 testEntrySet( Set<Map.Entry<String, Integer>> referenceEntrySet, Set<Map.Entry<String, Integer>> entrySet) argument
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | AbstractMapTest.java | 68 public Set entrySet() { method in class:AbstractMapTest.MyMap 147 // Special entrySet return a Set with no clear method. 159 public Set entrySet() { method in class:AbstractMapTest.MocAbstractMap 258 public Set entrySet() { 259 return map.entrySet(); 281 Map.Entry entry = (Map.Entry) map.entrySet().iterator().next(); 294 public Set entrySet() { method in class:AbstractMapTest.AMT 376 testNullsOnView(nullHostile.entrySet());
|
H A D | IdentityHashMap2Test.java | 38 public Set entrySet() { method in class:IdentityHashMap2Test.MockMap 208 * java.util.IdentityHashMap#entrySet() 211 // Test for method java.util.Set java.util.IdentityHashMap.entrySet() 212 Set s = hm.entrySet();
|
H A D | IdentityHashMapTest.java | 45 public Set entrySet() { method in class:IdentityHashMapTest.MockMap 201 * java.util.IdentityHashMap#entrySet() 204 // Test for method java.util.Set java.util.IdentityHashMap.entrySet() 205 Set s = hm.entrySet(); 581 * java.util.IdentityHashMap#entrySet() 597 Set entries = map.entrySet(); 617 * java.util.IdentityHashMap#entrySet() 625 Set set = map.entrySet(); 632 assertTrue("entrySet iterator still has elements", !it.hasNext()); 854 Set<Map.Entry<String, String>> set = ihm.entrySet(); [all...] |
H A D | LinkedHashMapTest.java | 60 public Set entrySet() { method in class:LinkedHashMapTest.MockMapNull 183 for (Map.Entry<String, String> e : m.entrySet()) { 223 * java.util.LinkedHashMap#entrySet() 226 // Test for method java.util.Set java.util.LinkedHashMap.entrySet() 227 Set s = hm.entrySet(); 247 Set<Map.Entry<String, String>> s1 = m1.entrySet(); 248 s1.remove(m2.entrySet().iterator().next()); 415 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator(); 421 iterator = hm2.entrySet().iterator(); 519 * java.util.LinkedHashMap#entrySet() [all...] |
H A D | RefSortedMap.java | 107 public Set<java.util.Map.Entry<K, V>> entrySet() { method in class:RefSortedMap.SubMap 270 public Set<Map.Entry<K, V>> entrySet() { method in class:RefSortedMap 271 return tailMap(firstKey()).entrySet(); 340 for (Map.Entry<? extends K, ? extends V> e : arg0.entrySet()) { 383 for (Map.Entry<K, V> e : entrySet()) {
|
H A D | WeakHashMapTest.java | 41 public Set entrySet() { method in class:WeakHashMapTest.MockMap 179 * java.util.WeakHashMap#entrySet() 182 // Test for method java.util.Set java.util.WeakHashMap.entrySet() 188 Set entrySet = whm.entrySet(); 189 assertTrue("Incorrect number of entries returned--wanted 100, got: " + entrySet.size(), 190 entrySet.size() == 100); 191 Iterator it = entrySet.iterator(); 211 } while (entrySet.size() != 99 && 214 assertEquals("Incorrect number of keys returned after gc,", 99, entrySet [all...] |
H A D | HashMapTest.java | 44 public Set entrySet() { method in class:HashMapTest.MockMap 54 public Set entrySet() { method in class:HashMapTest.MockMapNull 270 * java.util.HashMap#entrySet() 273 // Test for method java.util.Set java.util.HashMap.entrySet() 274 Set s = hm.entrySet(); 290 * java.util.HashMap#entrySet() 293 Set s1 = hm.entrySet(); 294 Set s2 = new HashMap(hm).entrySet(); 299 * java.util.HashMap#entrySet() 308 assertTrue(hm.entrySet() [all...] |
H A D | CollectionsTest.java | 1465 // entrySet() / keySet() methods: iterator(), toArray(T[]) and toArray(). See bug 72073. 1784 Iterator entrySetIterator = c.entrySet().iterator(); 1795 Object[] array = c.entrySet().toArray(); 1805 Map.Entry[] array2 = (Map.Entry[]) c.entrySet().toArray( 2267 // entrySet() 2268 testEntrySet(modifiableMap.entrySet(), unmodifiableMap.entrySet()); 2299 Set<Map.Entry<String, Integer>> entrySet) { 2300 // entrySet should be a set of mappings {"0", 0}, {"1",1}... {"99", 99} 2302 assertEquals(100, entrySet 2297 testEntrySet( Set<Map.Entry<String, Integer>> referenceEntrySet, Set<Map.Entry<String, Integer>> entrySet) argument [all...] |
/libcore/ojluni/src/main/java/java/util/jar/ |
H A D | Attributes.java | 216 for (Map.Entry<?,?> me : (attr).entrySet()) 259 public Set<Map.Entry<Object,Object>> entrySet() { method in class:Attributes 260 return map.entrySet(); 300 Iterator<Map.Entry<Object, Object>> it = entrySet().iterator(); 344 Iterator<Map.Entry<Object, Object>> it = entrySet().iterator();
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ProcessEnvironment.java | 251 public Set<Map.Entry<String,String>> entrySet() { method in class:ProcessEnvironment.StringEnvironment 252 return new StringEntrySet(m.entrySet()); 272 for (Map.Entry<Variable,Value> entry : m.entrySet()) { 280 for (Map.Entry<Variable,Value> entry : m.entrySet()) {
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Collectors.java | 319 for (Map.Entry<K,V> e : m2.entrySet()) 1552 public Set<Map.Entry<Boolean, T>> entrySet() { method in class:Collectors.Partition
|
/libcore/ojluni/src/main/java/java/text/ |
H A D | AttributedString.java | 164 Iterator<? extends Map.Entry<? extends Attribute, ?>> iterator = attributes.entrySet().iterator(); 395 attributes.entrySet().iterator(); 716 Iterator<Map.Entry<Attribute, Object>> iterator = attrs.entrySet().iterator(); 1067 public Set<Map.Entry<Attribute, Object>> entrySet() { method in class:AttributedString.AttributeMap
|
/libcore/ojluni/src/main/java/java/security/ |
H A D | Provider.java | 130 private transient Set<Map.Entry<Object,Object>> entrySet = null; field in class:Provider 266 public synchronized Set<Map.Entry<Object,Object>> entrySet() { method in class:Provider 268 if (entrySet == null) { 270 entrySet = Collections.unmodifiableMap(this).entrySet(); 272 return super.entrySet(); // Recursive call 276 // Collections.unmodifiableMap.entrySet() is changed such that it 277 // no longer calls entrySet() on the backing Map. (Provider's 278 // entrySet implementation depends on this "implementation detail", 283 return entrySet; [all...] |