Searched refs:entrySet (Results 1 - 25 of 93) sorted by relevance

1234

/libcore/support/src/test/java/tests/support/
H A DSupport_MapTest2.java42 assertTrue("Should not have entries", !map.entrySet().iterator()
56 assertTrue("Should not have entries", !map.entrySet().iterator()
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 DTreeMapExtendTest.java150 assertEquals(tm.entrySet(), treeMap.entrySet());
159 assertEquals(subMap_default.entrySet(), treeMap.entrySet());
325 Set entrySet = subMap_default.entrySet();
326 assertFalse(entrySet.isEmpty());
327 assertEquals(9, entrySet.size());
329 entrySet = subMap_startExcluded_endExcluded.entrySet();
[all...]
H A DSortedMapTestBase.java77 Set<Map.Entry<Integer, Integer>> refSet = ref.entrySet();
78 Set<Map.Entry<Integer, Integer>> mapSet = map.entrySet();
85 assertEquals(ref.entrySet(), map.entrySet());
230 Map.Entry<Integer, Integer> refE = ref.entrySet().iterator().next();
231 Map.Entry<Integer, Integer> mapE = map.entrySet().iterator().next();
268 assertTrue("Should not have entries", !map.entrySet().iterator()
275 assertTrue("Should not have entries", !map.entrySet().iterator()
282 assertFalse(map.entrySet().iterator().hasNext());
332 assertEquals(ref.entrySet(), ma
[all...]
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.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 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 DSimpleEntryTest.java52 Entry entryToPut = (Entry) map.entrySet().iterator().next();
97 Entry entryToPut = (Entry) map.entrySet().iterator().next();
H A DSimpleImmutableEntryTest.java53 Entry entryToPut = (Entry) map.entrySet().iterator().next();
107 Entry entryToPut = (Entry) map.entrySet().iterator().next();
/libcore/ojluni/src/main/java/java/util/
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 DSortedMap.java34 * {@code entrySet}, {@code keySet} and {@code values} methods).
283 Set<Map.Entry<K, V>> entrySet(); method in interface:SortedMap
/libcore/luni/src/test/java/libcore/java/util/
H A DLinkedHashMapTest.java39 for (Map.Entry<String, String> e : m.entrySet()) {
60 for (Map.Entry<String, String> e : m.entrySet()) {
68 for (Map.Entry<String, String> e : m.entrySet()) {
92 for (Map.Entry<String, String> e : m.entrySet()) {
101 for (Map.Entry<String, String> e : m.entrySet()) {
119 for (Map.Entry<String, String> e : m.entrySet()) {
137 for (Map.Entry<String, String> e : m.entrySet()) {
146 for (Map.Entry<String, String> e : m.entrySet()) {
163 for (Map.Entry<String, String> e : m.entrySet()) {
180 for (Map.Entry<String, String> e : m.entrySet()) {
[all...]
H A DOldMapEntryTest.java74 i = mhm.entrySet().iterator();
107 i = hm.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/security/cert/
H A DPKIXRevocationChecker.java194 for (Map.Entry<X509Certificate, byte[]> e : responses.entrySet()) {
213 for (Map.Entry<X509Certificate, byte[]> e : ocspResponses.entrySet()) {
264 copy.ocspResponses.entrySet())
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
H A DMessageDigest2Test.java80 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
242 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
255 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
287 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
299 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
311 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
330 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
375 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
405 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
H A DProvider2Test.java52 * java.security.Provider#entrySet()
55 // test method of java.security.provider.entrySet
59 provTest.entrySet().add(new MyEntry());
60 fail("was able to modify the entrySet");
/libcore/ojluni/src/main/java/java/security/
H A DUnresolvedPermissionCollection.java168 Set<Map.Entry<String, List<UnresolvedPermission>>> set = perms.entrySet();
205 Set<Map.Entry<String, Vector<UnresolvedPermission>>> set = permissions.entrySet();
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...]
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
H A DReduceByOpTest.java54 for (Map.Entry<Boolean, Integer> entry : result.entrySet()) {
64 for (Map.Entry<Integer, Integer> entry : miResult.entrySet()) {
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/
H A DAttributesTest.java81 * java.util.jar.Attributes#entrySet()
84 Set<Map.Entry<Object, Object>> entrySet = a.entrySet();
88 assertEquals(4, entrySet.size());
89 i = entrySet.iterator();
/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/java/beans/
H A DChangeListenerMap.java178 for (Entry<String, L[]> entry : this.map.entrySet()) {
230 ? this.map.entrySet()
/libcore/luni/src/main/java/org/apache/harmony/xml/parsers/
H A DSAXParserImpl.java51 for (Map.Entry<String,Boolean> entry : initialFeatures.entrySet()) {

Completed in 888 milliseconds

1234