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

12

/libcore/ojluni/src/main/java/java/util/
H A DSortedMap.java34 * {@code entrySet}, {@code keySet} and {@code values} methods).
283 Set<Map.Entry<K, V>> entrySet(); method in interface:SortedMap
H A DAbstractMap.java34 * class and provide an implementation for the <tt>entrySet</tt> method, which
43 * <tt>entrySet().iterator()</tt> must additionally implement its
81 * <p>This implementation returns <tt>entrySet().size()</tt>.
84 return entrySet().size();
99 * <p>This implementation iterates over <tt>entrySet()</tt> searching
109 Iterator<Entry<K,V>> i = entrySet().iterator();
129 * <p>This implementation iterates over <tt>entrySet()</tt> searching
140 Iterator<Map.Entry<K,V>> i = entrySet().iterator();
160 * <p>This implementation iterates over <tt>entrySet()</tt> searching
171 Iterator<Entry<K,V>> i = entrySet()
414 public abstract Set<Entry<K,V>> entrySet(); method in class:AbstractMap
[all...]
H A DEnumMap.java41 * {@link #entrySet()}, and {@link #values()}).
370 private transient Set<Map.Entry<K,V>> entrySet = null; field in class:EnumMap
463 public Set<Map.Entry<K,V>> entrySet() { method in class:EnumMap
464 Set<Map.Entry<K,V>> es = entrySet;
468 return entrySet = new EntrySet();
732 result.entrySet = null;
H A DMap.java362 Set<Map.Entry<K, V>> entrySet(); method in interface:Map
365 * A map entry (key-value pair). The {@code Map.entrySet} method returns
374 * @see Map#entrySet()
540 * {@code m1.entrySet().equals(m2.entrySet())}. This ensures that the
552 * {@code entrySet()} view. This ensures that {@code m1.equals(m2)}
605 * for (Map.Entry<K, V> entry : map.entrySet())
622 for (Map.Entry<K, V> entry : entrySet()) {
645 * for (Map.Entry<K, V> entry : map.entrySet())
677 for (Map.Entry<K, V> entry : entrySet()) {
[all...]
H A DHashtable.java514 for (Map.Entry<? extends K, ? extends V> e : t.entrySet())
545 t.entrySet = null;
571 Iterator<Map.Entry<K,V>> it = entrySet().iterator();
613 private transient volatile Set<Map.Entry<K,V>> entrySet = null; field in class:Hashtable
671 public Set<Map.Entry<K,V>> entrySet() { method in class:Hashtable
672 if (entrySet==null)
673 entrySet = Collections.synchronizedSet(new EntrySet(), this);
674 return entrySet;
795 Iterator<Map.Entry<K,V>> i = entrySet().iterator();
H A DIdentityHashMap.java510 for (Entry<? extends K, ? extends V> e : m.entrySet())
633 * <tt>this.entrySet().equals(m.entrySet())</tt>.
662 return entrySet().equals(m.entrySet());
671 * <tt>entrySet()</tt> view. This ensures that <tt>m1.equals(m2)</tt>
678 * <tt>entrySet</tt> method, it is possible that the contractual
710 m.entrySet = null;
931 private transient Set<Map.Entry<K,V>> entrySet = null; field in class:IdentityHashMap
1180 public Set<Map.Entry<K,V>> entrySet() { method in class:IdentityHashMap
[all...]
H A DWeakHashMap.java547 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
834 private transient Set<Map.Entry<K,V>> entrySet = null; field in class:WeakHashMap
939 public Set<Map.Entry<K,V>> entrySet() { method in class:WeakHashMap
940 Set<Map.Entry<K,V>> es = entrySet;
941 return es != null ? es : (entrySet = new EntrySet());
H A DHashMap.java485 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
570 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
720 result.entrySet = null;
1166 private transient Set<Map.Entry<K,V>> entrySet = null; field in class:HashMap
1298 public Set<Map.Entry<K,V>> entrySet() { method in class:HashMap
1303 Set<Map.Entry<K,V>> es = entrySet;
1304 return es != null ? es : (entrySet = new EntrySet());
/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/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 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.java45 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 DLinkedHashMapTest.java60 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 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 DWeakHashMapTest.java41 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 DHashMapTest.java44 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 DCollectionsTest.java1463 // entrySet() / keySet() methods: iterator(), toArray(T[]) and toArray(). See bug 72073.
1782 Iterator entrySetIterator = c.entrySet().iterator();
1793 Object[] array = c.entrySet().toArray();
1803 Map.Entry[] array2 = (Map.Entry[]) c.entrySet().toArray(
2265 // entrySet()
2266 testEntrySet(modifiableMap.entrySet(), unmodifiableMap.entrySet());
2297 Set<Map.Entry<String, Integer>> entrySet) {
2298 // entrySet should be a set of mappings {"0", 0}, {"1",1}... {"99", 99}
2300 assertEquals(100, entrySet
2295 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 DAttributes.java216 for (Map.Entry<?,?> me : (attr).entrySet())
259 public Set<Map.Entry<Object,Object>> entrySet() { method in class:Attributes
260 return map.entrySet();
300 Iterator it = entrySet().iterator();
344 Iterator it = entrySet().iterator();
/libcore/ojluni/src/main/java/sun/misc/
H A DSoftCache.java224 return entrySet().size();
231 return entrySet().isEmpty();
392 Set hashEntries = hash.entrySet();
449 private Set entrySet = null; field in class:SoftCache
454 public Set entrySet() { method in class:SoftCache
455 if (entrySet == null) entrySet = new EntrySet();
456 return entrySet;
/libcore/ojluni/src/main/java/java/lang/
H A DProcessEnvironment.java250 public Set<Map.Entry<String,String>> entrySet() { method in class:ProcessEnvironment.StringEnvironment
251 return new StringEntrySet(m.entrySet());
271 for (Map.Entry<Variable,Value> entry : m.entrySet()) {
279 for (Map.Entry<Variable,Value> entry : m.entrySet()) {
/libcore/ojluni/src/main/java/java/util/stream/
H A DCollectors.java319 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 DAttributedString.java163 Iterator iterator = attributes.entrySet().iterator();
393 Iterator iterator = attributes.entrySet().iterator();
704 Iterator iterator = attrs.entrySet().iterator();
1055 public Set entrySet() { method in class:AttributedString.AttributeMap
/libcore/ojluni/src/main/java/java/security/
H A DProvider.java124 private transient Set<Map.Entry<Object,Object>> entrySet = null; field in class:Provider
261 public synchronized Set<Map.Entry<Object,Object>> entrySet() { method in class:Provider
263 if (entrySet == null) {
265 entrySet = Collections.unmodifiableMap(this).entrySet();
267 return super.entrySet(); // Recursive call
271 // Collections.unmodifiableMap.entrySet() is changed such that it
272 // no longer calls entrySet() on the backing Map. (Provider's
273 // entrySet implementation depends on this "implementation detail",
278 return entrySet;
[all...]

Completed in 2312 milliseconds

12