Home
last modified time | relevance | path

Searched refs:SimpleEntry (Results 1 – 12 of 12) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DSimpleEntryTest.java23 import java.util.AbstractMap.SimpleEntry;
30 new AbstractMap.SimpleEntry<Integer, String>(1, "test"); in test_SimpleEntry_Constructor_K_V()
31 new AbstractMap.SimpleEntry(null, null); in test_SimpleEntry_Constructor_K_V()
53 Entry testEntry = new AbstractMap.SimpleEntry(entryToPut); in test_SimpleEntry_Constructor_LEntry()
58 testEntry = new AbstractMap.SimpleEntry(new NullEntry()); in test_SimpleEntry_Constructor_LEntry()
62 new AbstractMap.SimpleEntry(null); in test_SimpleEntry_Constructor_LEntry()
71 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test"); in test_SimpleEntry_getKey()
73 entry = new AbstractMap.SimpleEntry(null, null); in test_SimpleEntry_getKey()
78 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test"); in test_SimpleEntry_getValue()
80 entry = new AbstractMap.SimpleEntry(null, null); in test_SimpleEntry_getValue()
[all …]
/libcore/jsr166-tests/src/test/java/jsr166/
DEntryTest.java35 Map.Entry e = new AbstractMap.SimpleEntry(k1, v1); in testConstructor1()
53 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1); in testConstructor3()
54 Map.Entry e = new AbstractMap.SimpleEntry(e2); in testConstructor3()
74 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1); in testEquals()
75 Map.Entry e = new AbstractMap.SimpleEntry(e2); in testEquals()
92 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1); in testNotEquals()
93 Map.Entry e = new AbstractMap.SimpleEntry(k2, v1); in testNotEquals()
95 e = new AbstractMap.SimpleEntry(k1, v2); in testNotEquals()
97 e = new AbstractMap.SimpleEntry(k2, v2); in testNotEquals()
113 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1); in testSetValue1()
[all …]
DConcurrentHashMap8Test.java578 return new AbstractMap.SimpleEntry<Long,Long> in apply()
/libcore/ojluni/src/main/java/java/util/
DAbstractMap.java607 public static class SimpleEntry<K,V> class in AbstractMap
622 public SimpleEntry(K key, V value) { in SimpleEntry() method in AbstractMap.SimpleEntry
633 public SimpleEntry(Entry<? extends K, ? extends V> entry) { in SimpleEntry() method in AbstractMap.SimpleEntry
DEnumMap.java513 a[j++] = new AbstractMap.SimpleEntry<>( in fillEntryArray()
DWeakHashMap.java997 list.add(new AbstractMap.SimpleEntry<>(e)); in deepCopy()
DIdentityHashMap.java1242 a[ti++] = (T) new AbstractMap.SimpleEntry<>(unmaskNull(key), tab[si + 1]); in toArray()
/libcore/luni/src/test/java/libcore/java/util/
DOldAbstractMapTest.java106 entries.add(new AbstractMap.SimpleEntry<String, String>(key, value)); in put()
DTreeMapTest.java22 import java.util.AbstractMap.SimpleEntry;
182 assertTrue(map.entrySet().contains(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
183 assertTrue(map.entrySet().remove(new SimpleEntry<String, String>("abc", "a"))); in testEntrySetUsesComparatorOnly()
773 return new AbstractMap.SimpleEntry<>(key, value); in entry()
DEvilMapTest.java35 entries.add(new AbstractMap.SimpleEntry("hi", "there")); in EvilMap()
DMapDefaultMethodTester.java461 return new AbstractMap.SimpleEntry<>("key" + i, "value" + i); in test_entrySet_spliterator_unordered()
507 result.add(new AbstractMap.SimpleEntry<>(keysAndValues[i], keysAndValues[i+1])); in makeEntries()
DCollectionsTest.java898 assertEquals(new AbstractMap.SimpleEntry<>(key, value), map.floorEntry(key)); in check_unmodifiableNavigableMap_defaultMethods()
899 assertEquals(new AbstractMap.SimpleEntry<>(key, value), map.ceilingEntry(key)); in check_unmodifiableNavigableMap_defaultMethods()
1447 check_unmodifiableSet(map.entrySet(), new AbstractMap.SimpleEntry<>("absent element", 42)); in test_emptySortedMap()