Home
last modified time | relevance | path

Searched refs:entrySet (Results 1 – 25 of 72) sorted by relevance

123

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DTreeMapExtendTest.java150 assertEquals(tm.entrySet(), treeMap.entrySet()); in test_TreeMap_Constructor_Map()
159 assertEquals(subMap_default.entrySet(), treeMap.entrySet()); in test_TreeMap_Constructor_SortedMap()
325 Set entrySet = subMap_default.entrySet(); in test_SubMap_entrySet() local
326 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
327 assertEquals(9, entrySet.size()); in test_SubMap_entrySet()
329 entrySet = subMap_startExcluded_endExcluded.entrySet(); in test_SubMap_entrySet()
330 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
331 assertEquals(8, entrySet.size()); in test_SubMap_entrySet()
333 entrySet = subMap_startExcluded_endIncluded.entrySet(); in test_SubMap_entrySet()
334 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
[all …]
DSortedMapTestBase.java77 Set<Map.Entry<Integer, Integer>> refSet = ref.entrySet(); in testEntrySet()
78 Set<Map.Entry<Integer, Integer>> mapSet = map.entrySet(); in testEntrySet()
85 assertEquals(ref.entrySet(), map.entrySet()); in testEntrySet()
230 Map.Entry<Integer, Integer> refE = ref.entrySet().iterator().next(); in testSubMap()
231 Map.Entry<Integer, Integer> mapE = map.entrySet().iterator().next(); in testSubMap()
268 assertTrue("Should not have entries", !map.entrySet().iterator() in testIsEmpty2()
275 assertTrue("Should not have entries", !map.entrySet().iterator() in testIsEmpty2()
282 assertFalse(map.entrySet().iterator().hasNext()); in testIsEmpty2()
332 assertEquals(ref.entrySet(), map.entrySet()); in testViews()
333 compareIterators(ref.entrySet(), map.entrySet()); in testViews()
DWeakHashMapTest.java34 public Set entrySet() { in entrySet() method in WeakHashMapTest.MockMap
187 Set entrySet = whm.entrySet(); in test_entrySet() local
189 + entrySet.size(), entrySet.size() == 100); in test_entrySet()
190 Iterator it = entrySet.iterator(); in test_entrySet()
212 } while (entrySet.size() != 99 && in test_entrySet()
217 + entrySet.size(), entrySet.size() == 99); in test_entrySet()
DAbstractMapTest.java68 public Set entrySet() { in entrySet() method in AbstractMapTest.MyMap
159 public Set entrySet() { in entrySet() method in AbstractMapTest.MocAbstractMap
258 public Set entrySet() { in test_clone() method in AbstractMapTest.MyMap
259 return map.entrySet(); in test_clone()
281 Map.Entry entry = (Map.Entry) map.entrySet().iterator().next(); in test_clone()
294 public Set entrySet() { in entrySet() method in AbstractMapTest.AMT
376 testNullsOnView(nullHostile.entrySet());
DHashMapTest.java39 public Set entrySet() { in entrySet() method in HashMapTest.MockMap
49 public Set entrySet() { in entrySet() method in HashMapTest.MockMapNull
269 Set s = hm.entrySet(); in test_entrySet()
288 Set s1 = hm.entrySet(); in test_entrySetEquals()
289 Set s2 = new HashMap(hm).entrySet(); in test_entrySetEquals()
303 assertTrue(hm.entrySet().remove(m2.entrySet().iterator().next())); in test_removeFromViews()
681 Set entrySet = map.entrySet(); in test_EntrySet() local
682 Iterator e = entrySet.iterator(); in test_EntrySet()
686 assertTrue(entrySet.contains(copyEntry)); in test_EntrySet()
688 entrySet.remove(copyEntry); in test_EntrySet()
[all …]
DRefSortedMap.java107 public Set<java.util.Map.Entry<K, V>> entrySet() { in entrySet() method in RefSortedMap.SubMap
270 public Set<Map.Entry<K, V>> entrySet() {
271 return tailMap(firstKey()).entrySet();
340 for (Map.Entry<? extends K, ? extends V> e : arg0.entrySet()) {
383 for (Map.Entry<K, V> e : entrySet()) {
DLinkedHashMapTest.java54 public Set entrySet() { in entrySet() method in LinkedHashMapTest.MockMapNull
177 for (Map.Entry<String, String> e : m.entrySet()) { in test_putPresent()
221 Set s = hm.entrySet(); in test_entrySet()
241 Set<Map.Entry<String, String>> s1 = m1.entrySet(); in entrySetRemoveHelper()
242 s1.remove(m2.entrySet().iterator().next()); in entrySetRemoveHelper()
409 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator(); in test_clone_ordered()
415 iterator = hm2.entrySet().iterator(); in test_clone_ordered()
524 Set s1 = lhm.entrySet(); in test_ordered_entrySet()
539 Set s3 = lruhm.entrySet(); in test_ordered_entrySet()
557 Set s2 = lruhm.entrySet(); in test_ordered_entrySet()
DTreeMapTest.java242 Set anEntrySet = tm.entrySet(); in test_entrySet()
313 Set<Map.Entry<Integer, Double>> entrySet = smap.entrySet(); in test_headMapLjava_lang_Object() local
314 assertEquals(0, entrySet.size()); in test_headMapLjava_lang_Object()
584 Set entrySet = subMap.entrySet(); in test_subMap_Iterator() local
585 Iterator iter = entrySet.iterator(); in test_subMap_Iterator()
842 Set entrySet = subMap.entrySet(); in test_subMap_Iterator2() local
843 Iterator iter = entrySet.iterator(); in test_subMap_Iterator2()
880 assertFalse(headMap.entrySet() instanceof Serializable); in test_SubMap_Serializable()
1793 Set<Entry<String, String>> entrySet = map.entrySet(); in illegalFirstNullKeyMapTester() local
1794 assertTrue(!entrySet.isEmpty()); in illegalFirstNullKeyMapTester()
[all …]
DSimpleEntryTest.java52 Entry entryToPut = (Entry) map.entrySet().iterator().next(); in test_SimpleEntry_Constructor_LEntry()
97 Entry entryToPut = (Entry) map.entrySet().iterator().next(); in test_SimpleEntry_equals()
DSimpleImmutableEntryTest.java53 Entry entryToPut = (Entry) map.entrySet().iterator().next(); in test_SimpleImmutableEntry_Constructor_LEntry()
107 Entry entryToPut = (Entry) map.entrySet().iterator().next(); in test_SimpleImmutableEntry_equals()
/libcore/luni/src/main/java/java/util/
DAbstractMap.java180 entrySet().clear(); in clear()
190 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); in containsKey()
214 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); in containsValue()
231 public abstract Set<Map.Entry<K, V>> entrySet(); in entrySet() method in AbstractMap
253 for (Entry<K, V> entry : entrySet()) { in equals()
282 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); in get()
309 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); in hashCode()
344 Iterator<Map.Entry<K, V>> setIterator = entrySet().iterator(); in keySet()
380 for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
392 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); in remove()
[all …]
DHashtable.java97 private transient Set<Entry<K, V>> entrySet; field in Hashtable
184 for (Entry<? extends K, ? extends V> e : map.entrySet()) { in constructorPutAll()
225 result.entrySet = null; in clone()
424 for (Entry<? extends K, ? extends V> e : map.entrySet()) { in putAll()
619 public synchronized Set<Entry<K, V>> entrySet() { in entrySet() method in Hashtable
620 Set<Entry<K, V>> es = entrySet; in entrySet()
621 return (es != null) ? es : (entrySet = new EntrySet()); in entrySet()
848 entrySet().equals(((Map<?, ?>)object).entrySet()); in equals()
853 for (Entry<K, V> e : entrySet()) { in hashCode()
879 Iterator<Entry<K, V>> i = entrySet().iterator(); in toString()
[all …]
DEnumMap.java49 private transient EnumMapEntrySet<K, V> entrySet = null; field in EnumMap
538 public Set<Map.Entry<K, V>> entrySet() {
539 if (entrySet == null) {
540 entrySet = new EnumMapEntrySet<K, V>(this);
542 return entrySet;
731 Iterator<Map.Entry<K, V>> iterator = entrySet().iterator();
766 Iterator iter = map.entrySet().iterator();
DMap.java121 public Set<Map.Entry<K,V>> entrySet(); in entrySet() method
DTreeMap.java107 for (Map.Entry<? extends K, ? extends V> entry : copyFrom.entrySet()) { in TreeMap()
150 for (Map.Entry<K, ? extends V> entry : copyFrom.entrySet()) { in TreeMap()
160 map.entrySet = null; in clone()
679 private EntrySet entrySet; field in TreeMap
682 @Override public Set<Entry<K, V>> entrySet() { in entrySet() method in TreeMap
683 EntrySet result = entrySet; in entrySet()
684 return result != null ? result : (entrySet = new EntrySet()); in entrySet()
1126 return count(entrySet().iterator());
1379 private transient BoundedEntrySet entrySet;
1382 @Override public Set<Entry<K, V>> entrySet() {
[all …]
DHashMap.java118 private transient Set<Entry<K, V>> entrySet; field in HashMap
208 for (Entry<? extends K, ? extends V> e : map.entrySet()) { in constructorPutAll()
248 result.entrySet = null; in clone()
713 public Set<Entry<K, V>> entrySet() { in entrySet() method in HashMap
714 Set<Entry<K, V>> es = entrySet; in entrySet()
715 return (es != null) ? es : (entrySet = new EntrySet()); in entrySet()
974 for (Entry<K, V> e : entrySet()) { in writeObject()
DIdentityHashMap.java597 public Set<Map.Entry<K, V>> entrySet() {
746 Set<Map.Entry<K, V>> set = entrySet();
748 return set.equals(map.entrySet());
797 Iterator<?> iterator = entrySet().iterator();
820 if (map.entrySet() != null) {
/libcore/support/src/test/java/tests/support/
DSupport_MapTest.java54 testEntrySet(modifiableMap.entrySet(), unmodifiableMap.entrySet()); in runTest()
85 Set<Map.Entry<String, Integer>> entrySet) { in testEntrySet() argument
88 assertEquals(100, entrySet.size()); in testEntrySet()
93 crossCheckOrdering(referenceEntrySet, entrySet, Map.Entry.class); in testEntrySet()
DSupport_MapTest2.java42 assertTrue("Should not have entries", !map.entrySet().iterator() in runTest()
56 assertTrue("Should not have entries", !map.entrySet().iterator() in runTest()
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
DMessageDigest2Test.java80 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_clone()
242 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_digest$B()
255 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_digest$BII()
287 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getAlgorithm()
299 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getDigestLength()
311 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getInstanceLjava_lang_String()
330 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getInstanceLjava_lang_StringLjava_lang_String()
375 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getInstanceLjava_lang_StringLjava_security_Provider()
405 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) { in test_getProvider()
/libcore/luni/src/main/java/org/apache/harmony/security/utils/
DAlgNameMapper.java184 Set<Map.Entry<Object, Object>> entrySet = p.entrySet(); in selectEntries() local
187 for (Entry<Object, Object> me : entrySet) { in selectEntries()
/libcore/luni/src/test/java/libcore/java/util/
DOldMapEntryTest.java74 i = mhm.entrySet().iterator(); in testSetValue()
107 i = hm.entrySet().iterator(); in setUp()
DTreeMapTest.java42 Iterator<Entry<String, String>> iterator = map.entrySet().iterator(); in testEntrySetSetValue()
69 Iterator<Entry<String, String>> iterator = subMap.entrySet().iterator(); in testSubMapEntrySetSetValue()
142 Iterator<Entry<String,String>> iterator = map.entrySet().iterator(); in testConcurrentModificationDetection()
159 Iterator<Entry<String,String>> iterator = map.entrySet().iterator(); in testIteratorRemoves()
174 assertTrue(map.entrySet().contains(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
175 assertTrue(map.entrySet().remove(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/
DAttributesTest.java84 Set<Map.Entry<Object, Object>> entrySet = a.entrySet(); in test_entrySet() local
88 assertEquals(4, entrySet.size()); in test_entrySet()
89 i = entrySet.iterator(); in test_entrySet()
/libcore/luni/src/main/java/java/util/jar/
DAttributes.java248 public Set<Map.Entry<Object, Object>> entrySet() { in entrySet() method in Attributes
249 return map.entrySet(); in entrySet()

123