Home
last modified time | relevance | path

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

1234

/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.java41 public Set entrySet() { in entrySet() method in WeakHashMapTest.MockMap
188 Set entrySet = whm.entrySet(); in test_entrySet() local
189 assertTrue("Incorrect number of entries returned--wanted 100, got: " + entrySet.size(), in test_entrySet()
190 entrySet.size() == 100); in test_entrySet()
191 Iterator it = entrySet.iterator(); in test_entrySet()
211 } while (entrySet.size() != 99 && in test_entrySet()
214 assertEquals("Incorrect number of keys returned after gc,", 99, entrySet.size()); in test_entrySet()
423 map.entrySet().forEach((v) -> entrySetOutput.add(v)); in test_forEach()
424 assertEquals(map.entrySet(), entrySetOutput); in test_forEach()
445 map.entrySet().forEach(null); in test_forEach_NPE()
[all …]
DHashMapTest.java44 public Set entrySet() { in entrySet() method in HashMapTest.MockMap
54 public Set entrySet() { in entrySet() method in HashMapTest.MockMapNull
274 Set s = hm.entrySet(); in test_entrySet()
293 Set s1 = hm.entrySet(); in test_entrySetEquals()
294 Set s2 = new HashMap(hm).entrySet(); in test_entrySetEquals()
308 assertTrue(hm.entrySet().remove(m2.entrySet().iterator().next())); in test_removeFromViews()
686 Set entrySet = map.entrySet(); in test_EntrySet() local
687 Iterator e = entrySet.iterator(); in test_EntrySet()
691 assertTrue(entrySet.contains(copyEntry)); in test_EntrySet()
693 entrySet.remove(copyEntry); in test_EntrySet()
[all …]
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());
DLinkedHashMapTest.java60 public Set entrySet() { in entrySet() method in LinkedHashMapTest.MockMapNull
183 for (Map.Entry<String, String> e : m.entrySet()) { in test_putPresent()
227 Set s = hm.entrySet(); in test_entrySet()
247 Set<Map.Entry<String, String>> s1 = m1.entrySet(); in entrySetRemoveHelper()
248 s1.remove(m2.entrySet().iterator().next()); in entrySetRemoveHelper()
415 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator(); in test_clone_ordered()
421 iterator = hm2.entrySet().iterator(); in test_clone_ordered()
530 Set s1 = lhm.entrySet(); in test_ordered_entrySet()
545 Set s3 = lruhm.entrySet(); in test_ordered_entrySet()
563 Set s2 = lruhm.entrySet(); in test_ordered_entrySet()
[all …]
DTreeMapTest.java244 Set anEntrySet = tm.entrySet(); in test_entrySet()
315 Set<Map.Entry<Integer, Double>> entrySet = smap.entrySet(); in test_headMapLjava_lang_Object() local
316 assertEquals(0, entrySet.size()); in test_headMapLjava_lang_Object()
588 Set entrySet = subMap.entrySet(); in test_subMap_Iterator() local
589 Iterator iter = entrySet.iterator(); in test_subMap_Iterator()
846 Set entrySet = subMap.entrySet(); in test_subMap_Iterator2() local
847 Iterator iter = entrySet.iterator(); in test_subMap_Iterator2()
884 assertFalse(headMap.entrySet() instanceof Serializable); in test_SubMap_Serializable()
1797 Set<Entry<String, String>> entrySet = map.entrySet(); in illegalFirstNullKeyMapTester() local
1798 assertTrue(!entrySet.isEmpty()); in illegalFirstNullKeyMapTester()
[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()) {
/libcore/luni/src/test/java/libcore/java/util/
DLinkedHashMapTest.java39 for (Map.Entry<String, String> e : m.entrySet()) { in test_getOrDefault()
60 for (Map.Entry<String, String> e : m.entrySet()) { in test_putIfAbsent()
68 for (Map.Entry<String, String> e : m.entrySet()) { in test_putIfAbsent()
92 for (Map.Entry<String, String> e : m.entrySet()) { in test_replace$K$V$V()
101 for (Map.Entry<String, String> e : m.entrySet()) { in test_replace$K$V$V()
119 for (Map.Entry<String, String> e : m.entrySet()) { in test_replace$K$V()
137 for (Map.Entry<String, String> e : m.entrySet()) { in test_computeIfAbsent()
146 for (Map.Entry<String, String> e : m.entrySet()) { in test_computeIfAbsent()
163 for (Map.Entry<String, String> e : m.entrySet()) { in test_computeIfPresent()
180 for (Map.Entry<String, String> e : m.entrySet()) { in test_compute()
[all …]
DOldMapEntryTest.java74 i = mhm.entrySet().iterator(); in testSetValue()
107 i = hm.entrySet().iterator(); in setUp()
DTreeMapTest.java49 Iterator<Entry<String, String>> iterator = map.entrySet().iterator(); in testEntrySetSetValue()
76 Iterator<Entry<String, String>> iterator = subMap.entrySet().iterator(); in testSubMapEntrySetSetValue()
149 Iterator<Entry<String,String>> iterator = map.entrySet().iterator(); in testConcurrentModificationDetection()
166 Iterator<Entry<String,String>> iterator = map.entrySet().iterator(); in testIteratorRemoves()
181 assertTrue(map.entrySet().contains(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
182 assertTrue(map.entrySet().remove(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
555 Set<Map.Entry<String, String>> values = treeMap.entrySet(); in test_spliterator_entrySet()
/libcore/ojluni/src/main/java/java/util/
DAbstractMap.java84 return entrySet().size(); in size()
109 Iterator<Entry<K,V>> i = entrySet().iterator(); in containsValue()
140 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); in containsKey()
171 Iterator<Entry<K,V>> i = entrySet().iterator(); in get()
228 Iterator<Entry<K,V>> i = entrySet().iterator(); in remove()
272 for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) in putAll()
288 entrySet().clear(); in clear()
322 private Iterator<Entry<K,V>> i = entrySet().iterator(); in keySet()
378 private Iterator<Entry<K,V>> i = entrySet().iterator(); in values()
414 public abstract Set<Entry<K,V>> entrySet(); in entrySet() method in AbstractMap
[all …]
DSortedMap.java283 Set<Map.Entry<K, V>> entrySet(); in entrySet() method
DHashtable.java514 for (Map.Entry<? extends K, ? extends V> e : t.entrySet()) in putAll()
545 t.entrySet = null; in clone()
571 Iterator<Map.Entry<K,V>> it = entrySet().iterator(); in toString()
613 private transient volatile Set<Map.Entry<K,V>> entrySet = null; field in Hashtable
671 public Set<Map.Entry<K,V>> entrySet() { in entrySet() method in Hashtable
672 if (entrySet==null) in entrySet()
673 entrySet = Collections.synchronizedSet(new EntrySet(), this); in entrySet()
674 return entrySet; in entrySet()
795 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); in equals()
/libcore/ojluni/src/main/java/sun/misc/
DSoftCache.java224 return entrySet().size(); in size()
231 return entrySet().isEmpty(); in isEmpty()
392 Set hashEntries = hash.entrySet();
449 private Set entrySet = null;
454 public Set entrySet() { in entrySet() method
455 if (entrySet == null) entrySet = new EntrySet(); in entrySet()
456 return entrySet; in entrySet()
/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/ojluni/src/main/java/java/security/cert/
DPKIXRevocationChecker.java194 for (Map.Entry<X509Certificate, byte[]> e : responses.entrySet()) { in setOcspResponses()
213 for (Map.Entry<X509Certificate, byte[]> e : ocspResponses.entrySet()) { in getOcspResponses()
264 copy.ocspResponses.entrySet()) in clone()
/libcore/ojluni/src/main/java/java/security/
DProvider.java124 private transient Set<Map.Entry<Object,Object>> entrySet = null; field in Provider
261 public synchronized Set<Map.Entry<Object,Object>> entrySet() { in entrySet() method in Provider
263 if (entrySet == null) { in entrySet()
265 entrySet = Collections.unmodifiableMap(this).entrySet(); in entrySet()
267 return super.entrySet(); // Recursive call in entrySet()
278 return entrySet; in entrySet()
457 for (Map.Entry<Object,Object> entry : super.entrySet()) { in readObject()
473 for (Map.Entry e : ((Map<?,?>)t).entrySet()) { in implPutAll()
581 for (Map.Entry<String,String> entry : legacyStrings.entrySet()) { in ensureLegacyParsed()
593 for (Iterator t = map.entrySet().iterator(); t.hasNext(); ) { in removeInvalidServices()
[all …]
DUnresolvedPermissionCollection.java168 Set<Map.Entry<String, List<UnresolvedPermission>>> set = perms.entrySet(); in writeObject()
205 Set<Map.Entry<String, Vector<UnresolvedPermission>>> set = permissions.entrySet(); in readObject()
/libcore/ojluni/src/main/java/java/util/jar/
DAttributes.java216 for (Map.Entry<?,?> me : (attr).entrySet()) in putAll()
259 public Set<Map.Entry<Object,Object>> entrySet() { in entrySet() method in Attributes
260 return map.entrySet(); in entrySet()
300 Iterator it = entrySet().iterator(); in write()
344 Iterator it = entrySet().iterator(); in writeMain()
/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/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DReduceByOpTest.java54 for (Map.Entry<Boolean, Integer> entry : result.entrySet()) { in testOps()
64 for (Map.Entry<Integer, Integer> entry : miResult.entrySet()) { in testOps()
/libcore/ojluni/src/main/java/sun/util/locale/
DLocaleExtensions.java86 for (Entry<CaseInsensitiveChar, String> ext : extensions.entrySet()) { in LocaleExtensions()
115 for (Entry<CaseInsensitiveString, String> kwd : ukeywords.entrySet()) { in LocaleExtensions()
197 for (Entry<Character, Extension> entry : map.entrySet()) { in toID()

1234