Searched defs:entrySet (Results 1 - 25 of 26) sorted by relevance

12

/libcore/luni/src/test/java/libcore/java/util/
H A DEvilMapTest.java41 @Override public Set<Entry<K, V>> entrySet() { return entries; } method in class:EvilMapTest.EvilMap
H A DOldAbstractMapTest.java110 @Override public Set<Entry<String, String>> entrySet() { method in class:OldAbstractMapTest.AMT
/libcore/luni/src/main/java/java/util/
H A DMap.java121 public Set<Map.Entry<K,V>> entrySet(); method in interface:Map
132 * @see #entrySet()
241 * "wrapper object" over the iterator of this {@code Map}'s {@link #entrySet()}. The {@link AbstractCollection#size} method
H A DAbstractMap.java177 * <p>This implementation calls {@code entrySet().clear()}.
180 entrySet().clear();
190 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
214 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
231 public abstract Set<Map.Entry<K, V>> entrySet(); method in class:AbstractMap
253 for (Entry<K, V> entry : entrySet()) {
282 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
309 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
344 Iterator<Map.Entry<K, V>> setIterator = entrySet().iterator();
380 for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) {
[all...]
H A DEnumMap.java49 private transient EnumMapEntrySet<K, V> entrySet = null; field in class:EnumMap
538 public Set<Map.Entry<K, V>> entrySet() { method in class:EnumMap
539 if (entrySet == null) {
540 entrySet = new EnumMapEntrySet<K, V>(this);
542 return entrySet;
554 * @see #entrySet()
731 Iterator<Map.Entry<K, V>> iterator = entrySet().iterator();
766 Iterator iter = map.entrySet().iterator();
H A DWeakHashMap.java293 public Set<Map.Entry<K, V>> entrySet() { method in class:WeakHashMap
400 * "wrapper object" over the iterator of map's entrySet(). The size method
709 if (map.entrySet() != null) {
H A DHashMap.java118 private transient Set<Entry<K, V>> entrySet; field in class:HashMap
208 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
248 result.entrySet = null;
688 * "wrapper object" over the iterator of map's entrySet(). The {@code size}
713 public Set<Entry<K, V>> entrySet() { method in class:HashMap
714 Set<Entry<K, V>> es = entrySet;
715 return (es != null) ? es : (entrySet = new EntrySet());
974 for (Entry<K, V> e : entrySet()) {
H A DIdentityHashMap.java597 public Set<Map.Entry<K, V>> entrySet() { method in class:IdentityHashMap
658 * "wrapper object" over the iterator of map's entrySet(). The {@code size}
730 * AbstractMap.equals will call ((Map) object).entrySet().contains() to
746 Set<Map.Entry<K, V>> set = entrySet();
748 return set.equals(map.entrySet());
797 Iterator<?> iterator = entrySet().iterator();
820 if (map.entrySet() != null) {
H A DHashtable.java97 private transient Set<Entry<K, V>> entrySet; field in class:Hashtable
184 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
225 result.entrySet = null;
424 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
619 public synchronized Set<Entry<K, V>> entrySet() { method in class:Hashtable
620 Set<Entry<K, V>> es = entrySet;
621 return (es != null) ? es : (entrySet = new EntrySet());
848 entrySet().equals(((Map<?, ?>)object).entrySet());
853 for (Entry<K, V> e : entrySet()) {
[all...]
H A DTreeMap.java107 for (Map.Entry<? extends K, ? extends V> entry : copyFrom.entrySet()) {
150 for (Map.Entry<K, ? extends V> entry : copyFrom.entrySet()) {
160 map.entrySet = null;
679 private EntrySet entrySet; field in class:TreeMap
682 @Override public Set<Entry<K, V>> entrySet() { method in class:TreeMap
683 EntrySet result = entrySet;
684 return result != null ? result : (entrySet = new EntrySet());
1126 return count(entrySet().iterator());
1379 private transient BoundedEntrySet entrySet; field in class:TreeMap.BoundedMap
1382 @Override public Set<Entry<K, V>> entrySet() { method in class:TreeMap.BoundedMap
1711 @Override public Set<Entry<K, V>> entrySet() { method in class:TreeMap.NavigableSubMap
1746 @Override public Set<Entry<K, V>> entrySet() { method in class:TreeMap.SubMap
[all...]
H A DCollections.java143 @Override public Set entrySet() { method in class:Collections.EmptyMap
318 @Override public Set<Map.Entry<K, V>> entrySet() { method in class:Collections.SingletonMap
688 @Override public Set<Map.Entry<K, V>> entrySet() { method in class:Collections.SynchronizedMap
690 return new SynchronizedSet<Map.Entry<K, V>>(m.entrySet(), mutex);
1255 @Override public Set<Map.Entry<K, V>> entrySet() { method in class:Collections.UnmodifiableMap
1256 return new UnmodifiableEntrySet<K, V>(m.entrySet());
3125 .entrySet().iterator();
3149 @Override public Set<Map.Entry<K, V>> entrySet() { method in class:Collections.CheckedMap
3150 return new CheckedEntrySet<K, V>(m.entrySet(), valueType);
/libcore/support/src/test/java/tests/support/
H A DSupport_MapTest.java53 // 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 DAbstractMapTest.java68 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 DWeakHashMapTest.java34 public Set entrySet() { method in class:WeakHashMapTest.MockMap
178 * java.util.WeakHashMap#entrySet()
181 // Test for method java.util.Set java.util.WeakHashMap.entrySet()
187 Set entrySet = whm.entrySet();
189 + entrySet.size(), entrySet.size() == 100);
190 Iterator it = entrySet.iterator();
212 } while (entrySet.size() != 99 &&
217 + entrySet
[all...]
H A DIdentityHashMap2Test.java38 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 DIdentityHashMapTest.java41 public Set entrySet() { method in class:IdentityHashMapTest.MockMap
197 * java.util.IdentityHashMap#entrySet()
200 // Test for method java.util.Set java.util.IdentityHashMap.entrySet()
201 Set s = hm.entrySet();
577 * java.util.IdentityHashMap#entrySet()
593 Set entries = map.entrySet();
613 * java.util.IdentityHashMap#entrySet()
621 Set set = map.entrySet();
628 assertTrue("entrySet iterator still has elements", !it.hasNext());
850 Set<Map.Entry<String, String>> set = ihm.entrySet();
[all...]
H A DLinkedHashMapTest.java54 public Set entrySet() { method in class:LinkedHashMapTest.MockMapNull
177 for (Map.Entry<String, String> e : m.entrySet()) {
217 * java.util.LinkedHashMap#entrySet()
220 // Test for method java.util.Set java.util.LinkedHashMap.entrySet()
221 Set s = hm.entrySet();
241 Set<Map.Entry<String, String>> s1 = m1.entrySet();
242 s1.remove(m2.entrySet().iterator().next());
409 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator();
415 iterator = hm2.entrySet().iterator();
513 * java.util.LinkedHashMap#entrySet()
[all...]
H A DRefSortedMap.java107 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 DHashMapTest.java39 public Set entrySet() { method in class:HashMapTest.MockMap
49 public Set entrySet() { method in class:HashMapTest.MockMapNull
265 * java.util.HashMap#entrySet()
268 // Test for method java.util.Set java.util.HashMap.entrySet()
269 Set s = hm.entrySet();
285 * java.util.HashMap#entrySet()
288 Set s1 = hm.entrySet();
289 Set s2 = new HashMap(hm).entrySet();
294 * java.util.HashMap#entrySet()
303 assertTrue(hm.entrySet()
[all...]
H A DCollectionsTest.java1463 // entrySet() / keySet() methods: iterator(), toArray(T[]) and toArray(). See bug 72073.
1768 Iterator entrySetIterator = c.entrySet().iterator();
1779 Object[] array = c.entrySet().toArray();
1789 Map.Entry[] array2 = (Map.Entry[]) c.entrySet().toArray(
2245 // entrySet()
2246 testEntrySet(modifiableMap.entrySet(), unmodifiableMap.entrySet());
2277 Set<Map.Entry<String, Integer>> entrySet) {
2278 // entrySet should be a set of mappings {"0", 0}, {"1",1}... {"99", 99}
2280 assertEquals(100, entrySet
2275 testEntrySet( Set<Map.Entry<String, Integer>> referenceEntrySet, Set<Map.Entry<String, Integer>> entrySet) argument
[all...]
/libcore/luni/src/main/java/java/util/jar/
H A DAttributes.java248 public Set<Map.Entry<Object, Object>> entrySet() { method in class:Attributes
249 return map.entrySet();
/libcore/luni/src/main/java/java/lang/
H A DSystem.java1159 @Override public Set<Entry<String, String>> entrySet() { method in class:System.SystemEnvironment
1160 return map.entrySet();
/libcore/luni/src/main/java/java/security/
H A DProvider.java198 Iterator<? extends Map.Entry<?, ?>> it = t.entrySet().iterator();
222 public synchronized Set<Map.Entry<Object,Object>> entrySet() { method in class:Provider
223 return Collections.unmodifiableSet(super.entrySet());
536 for (Map.Entry<String, String> entry : s.attributes.entrySet()) {
558 for (Map.Entry<String, String> entry : s.attributes.entrySet()) {
647 for (Iterator<Map.Entry<Object, Object>> it = changedProperties.entrySet().iterator(); it
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java625 private transient EntrySetView<K,V> entrySet; field in class:ConcurrentHashMap
893 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1085 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentHashMap
1087 return (es = entrySet) != null ? es : (entrySet = new EntrySetView<K,V>(this));
1165 for (Map.Entry<?,?> e : m.entrySet()) {
2952 * {@link #entrySet()}.
H A DConcurrentSkipListMap.java328 private transient EntrySet<K,V> entrySet; field in class:ConcurrentSkipListMap
341 entrySet = null;
1448 map.entrySet().iterator();
1785 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentSkipListMap
1786 EntrySet<K,V> es = entrySet;
1787 return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
1807 * {@code m1.entrySet().equals(m2.entrySet())}. This
1821 for (Map.Entry<K,V> e : this.entrySet())
1824 for (Map.Entry<?,?> e : m.entrySet()) {
2947 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentSkipListMap.SubMap
[all...]

Completed in 2397 milliseconds

12