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

/libcore/luni/src/test/java/libcore/java/util/
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.java292 public Set<Map.Entry<K, V>> entrySet() { method in class:WeakHashMap
419 * "wrapper object" over the iterator of map's entrySet(). The size method
728 if (map.entrySet() != null) {
H A DIdentityHashMap.java598 public Set<Map.Entry<K, V>> entrySet() { method in class:IdentityHashMap
659 * "wrapper object" over the iterator of map's entrySet(). The {@code size}
731 * AbstractMap.equals will call ((Map) object).entrySet().contains() to
747 Set<Map.Entry<K, V>> set = entrySet();
749 return set.equals(map.entrySet());
798 Iterator<?> iterator = entrySet().iterator();
821 if (map.entrySet() != null) {
H A DHashMap.java118 private transient Set<Entry<K, V>> entrySet; field in class:HashMap
205 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
245 result.entrySet = null;
693 * "wrapper object" over the iterator of map's entrySet(). The {@code size}
718 public Set<Entry<K, V>> entrySet() { method in class:HashMap
719 Set<Entry<K, V>> es = entrySet;
720 return (es != null) ? es : (entrySet = new EntrySet());
1011 for (Entry<K, V> e : entrySet()) {
H A DHashtable.java97 private transient Set<Entry<K, V>> entrySet; field in class:Hashtable
181 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
222 result.entrySet = null;
429 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
624 public synchronized Set<Entry<K, V>> entrySet() { method in class:Hashtable
625 Set<Entry<K, V>> es = entrySet;
626 return (es != null) ? es : (entrySet = new EntrySet());
853 entrySet().equals(((Map<?, ?>)object).entrySet());
858 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());
3132 .entrySet().iterator();
3156 @Override public Set<Map.Entry<K, V>> entrySet() { method in class:Collections.CheckedMap
3157 return new CheckedEntrySet<K, V>(m.entrySet(), valueType);
/libcore/luni/src/test/java/tests/api/java/util/
H A DWeakHashMapTest.java34 public Set entrySet() { method in class:WeakHashMapTest.MockMap
184 * java.util.WeakHashMap#entrySet()
187 // Test for method java.util.Set java.util.WeakHashMap.entrySet()
193 Set entrySet = whm.entrySet();
195 + entrySet.size(), entrySet.size() == 100);
196 Iterator it = entrySet.iterator();
214 } while (count <= 5 && entrySet.size() == 100);
218 + entrySet
[all...]
H A DAbstractMapTest.java68 public Set entrySet() { method in class:AbstractMapTest.MyMap
170 public Set entrySet() {
171 return map.entrySet();
193 Map.Entry entry = (Map.Entry) map.entrySet().iterator().next();
206 public Set entrySet() { method in class:AbstractMapTest.AMT
288 testNullsOnView(nullHostile.entrySet());
H A DIdentityHashMapTest.java40 public Set entrySet() { method in class:IdentityHashMapTest.MockMap
196 * java.util.IdentityHashMap#entrySet()
199 // Test for method java.util.Set java.util.IdentityHashMap.entrySet()
200 Set s = hm.entrySet();
H A DHashMapTest.java27 public Set entrySet() { method in class:HashMapTest.MockMap
36 public Set entrySet() { method in class:HashMapTest.MockMapNull
211 * java.util.HashMap#entrySet()
214 // Test for method java.util.Set java.util.HashMap.entrySet()
215 Set s = hm.entrySet();
227 * java.util.HashMap#entrySet()
230 Set s1 = hm.entrySet();
231 Set s2 = new HashMap(hm).entrySet();
236 * java.util.HashMap#entrySet()
245 assertTrue(hm.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...]
/libcore/luni/src/main/java/java/util/jar/
H A DAttributes.java245 public Set<Map.Entry<Object, Object>> entrySet() { method in class:Attributes
246 return map.entrySet();
/libcore/luni/src/main/java/java/lang/
H A DSystem.java664 @Override public Set<Entry<String, String>> entrySet() { method in class:System.SystemEnvironment
665 return map.entrySet();
/libcore/luni/src/main/java/java/security/
H A DProvider.java199 Iterator<? extends Map.Entry<?, ?>> it = t.entrySet().iterator();
223 public synchronized Set<Map.Entry<Object,Object>> entrySet() { method in class:Provider
224 return Collections.unmodifiableSet(super.entrySet());
537 for (Map.Entry<String, String> entry : s.attributes.entrySet()) {
559 for (Map.Entry<String, String> entry : s.attributes.entrySet()) {
648 for (Iterator<Map.Entry<Object, Object>> it = changedProperties.entrySet().iterator(); it
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java165 transient Set<Map.Entry<K,V>> entrySet; field in class:ConcurrentHashMap
1054 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1183 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentHashMap
1184 Set<Map.Entry<K,V>> es = entrySet;
1185 return (es != null) ? es : (entrySet = new EntrySet());
H A DConcurrentSkipListMap.java327 private transient EntrySet<K,V> entrySet; field in class:ConcurrentSkipListMap
340 entrySet = null;
1447 map.entrySet().iterator();
1786 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentSkipListMap
1787 EntrySet<K,V> es = entrySet;
1788 return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
1808 * <tt>m1.entrySet().equals(m2.entrySet())</tt>. This
1822 for (Map.Entry<K,V> e : this.entrySet())
1825 for (Map.Entry<?,?> e : m.entrySet()) {
2948 public Set<Map.Entry<K,V>> entrySet() { method in class:ConcurrentSkipListMap.SubMap
[all...]

Completed in 275 milliseconds