Home
last modified time | relevance | path

Searched refs:higherEntry (Results 1 – 15 of 15) sorted by relevance

/libcore/jsr166-tests/src/test/java/jsr166/
DTreeSubMapTest.java267 Map.Entry e1 = map.higherEntry(three);
270 Map.Entry e2 = map.higherEntry(zero);
273 Map.Entry e3 = map.higherEntry(five);
276 Map.Entry e4 = map.higherEntry(six);
819 Map.Entry e1 = map.higherEntry(m3);
822 Map.Entry e2 = map.higherEntry(zero);
825 Map.Entry e3 = map.higherEntry(m5);
828 Map.Entry e4 = map.higherEntry(m6);
DConcurrentSkipListSubMapTest.java380 Map.Entry e1 = map.higherEntry(three);
383 Map.Entry e2 = map.higherEntry(zero);
386 Map.Entry e3 = map.higherEntry(five);
389 Map.Entry e4 = map.higherEntry(six);
1054 Map.Entry e1 = map.higherEntry(m3);
1057 Map.Entry e2 = map.higherEntry(zero);
1060 Map.Entry e3 = map.higherEntry(m5);
1063 Map.Entry e4 = map.higherEntry(m6);
DConcurrentSkipListMapTest.java468 Map.Entry e1 = map.higherEntry(three);
471 Map.Entry e2 = map.higherEntry(zero);
474 Map.Entry e3 = map.higherEntry(five);
477 Map.Entry e4 = map.higherEntry(six);
529 e = map.higherEntry(zero);
DTreeMapTest.java381 Map.Entry e1 = map.higherEntry(three);
384 Map.Entry e2 = map.higherEntry(zero);
387 Map.Entry e3 = map.higherEntry(five);
390 Map.Entry e4 = map.higherEntry(six);
/libcore/ojluni/src/test/java/util/concurrent/tck/
DTreeSubMapTest.java290 Map.Entry e1 = map.higherEntry(three);
293 Map.Entry e2 = map.higherEntry(zero);
296 Map.Entry e3 = map.higherEntry(five);
299 Map.Entry e4 = map.higherEntry(six);
842 Map.Entry e1 = map.higherEntry(m3);
845 Map.Entry e2 = map.higherEntry(zero);
848 Map.Entry e3 = map.higherEntry(m5);
851 Map.Entry e4 = map.higherEntry(m6);
DConcurrentSkipListSubMapTest.java403 Map.Entry e1 = map.higherEntry(three);
406 Map.Entry e2 = map.higherEntry(zero);
409 Map.Entry e3 = map.higherEntry(five);
412 Map.Entry e4 = map.higherEntry(six);
1077 Map.Entry e1 = map.higherEntry(m3);
1080 Map.Entry e2 = map.higherEntry(zero);
1083 Map.Entry e3 = map.higherEntry(m5);
1086 Map.Entry e4 = map.higherEntry(m6);
DConcurrentSkipListMapTest.java491 Map.Entry e1 = map.higherEntry(three);
494 Map.Entry e2 = map.higherEntry(zero);
497 Map.Entry e3 = map.higherEntry(five);
500 Map.Entry e4 = map.higherEntry(six);
552 e = map.higherEntry(zero);
DTreeMapTest.java404 Map.Entry e1 = map.higherEntry(three);
407 Map.Entry e2 = map.higherEntry(zero);
410 Map.Entry e3 = map.higherEntry(five);
413 Map.Entry e4 = map.higherEntry(six);
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DTreeMapTest.java1179 assertEquals(objArray[0], tm.higherEntry(testint.toString()).getValue()); in test_higherEntry()
1180 assertEquals(objArray[101], tm.higherEntry(testint100.toString()) in test_higherEntry()
1182 assertEquals(objArray[101], tm.higherEntry(testint10000.toString()) in test_higherEntry()
1187 assertEquals(objArray[0], tm.higherEntry(testint.toString()).getValue()); in test_higherEntry()
1188 assertEquals(testint, tm.higherEntry(testint100.toString()).getValue()); in test_higherEntry()
1189 Entry entry = tm.higherEntry(testint10000.toString()); in test_higherEntry()
1192 assertNull(tm.higherEntry(testint9999.toString())); in test_higherEntry()
1194 tm.higherEntry(testint100); in test_higherEntry()
1200 tm.higherEntry(null); in test_higherEntry()
1206 assertNull(tm.higherEntry(testint.toString())); in test_higherEntry()
/libcore/ojluni/annotations/sdk/nullability/java/util/
DNavigableMap.annotated.java55 …<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> higherEntry(@libcore.util.N… in higherEntry() method
DTreeMap.annotated.java86 …<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> higherEntry(@libcore.util.N… in higherEntry() method in TreeMap
/libcore/ojluni/src/main/java/java/util/
DCollections.java1958 public Entry<K, V> higherEntry(K key) {
1959 Entry<K,V> higher = (Entry<K, V>) nm.higherEntry(key);
2927 public Entry<K, V> higherEntry(K key)
2928 { synchronized (mutex) { return nm.higherEntry(key); } }
4133 public Entry<K, V> higherEntry(K key) {
4134 Entry<K,V> higher = nm.higherEntry(key);
DTreeMap.java766 public Map.Entry<K,V> higherEntry(K key) { in higherEntry() method in TreeMap
1542 public final Map.Entry<K,V> higherEntry(K key) { in higherEntry() method in TreeMap.NavigableSubMap
/libcore/luni/src/test/java/libcore/java/util/
DTreeMapTest.java128 assertImmutable(map.higherEntry("A")); in assertAllEntryMethodsReturnImmutableEntries()
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentSkipListMap.java2193 public Map.Entry<K,V> higherEntry(K key) { in higherEntry() method in ConcurrentSkipListMap
3017 public Map.Entry<K,V> higherEntry(K key) { in higherEntry() method in ConcurrentSkipListMap.SubMap