Searched refs:higherEntry (Results 1 - 9 of 9) sorted by relevance

/openjdk9/jdk/src/java.base/share/classes/java/util/
H A DNavigableMap.java42 * and {@link #higherEntry} return {@code Map.Entry} objects
198 Map.Entry<K,V> higherEntry(K key); method in interface:NavigableMap
H A DCollections.java1908 public Entry<K, V> higherEntry(K key) { method in class:Collections.UnmodifiableNavigableMap
1909 Entry<K,V> higher = (Entry<K, V>) nm.higherEntry(key);
2884 public Entry<K, V> higherEntry(K key) method in class:Collections.SynchronizedNavigableMap
2885 { synchronized (mutex) { return nm.higherEntry(key); } }
4084 public Entry<K, V> higherEntry(K key) { method in class:Collections.CheckedNavigableMap
4085 Entry<K,V> higher = nm.higherEntry(key);
H A DTreeMap.java762 public Map.Entry<K,V> higherEntry(K key) { method in class:TreeMap
1533 public final Map.Entry<K,V> higherEntry(K key) { method in class:TreeMap.NavigableSubMap
/openjdk9/jdk/test/java/util/concurrent/tck/
H A DTreeSubMapTest.java285 * higherEntry returns next entry.
289 Map.Entry e1 = map.higherEntry(three);
292 Map.Entry e2 = map.higherEntry(zero);
295 Map.Entry e3 = map.higherEntry(five);
298 Map.Entry e4 = map.higherEntry(six);
837 * higherEntry returns next entry.
841 Map.Entry e1 = map.higherEntry(m3);
844 Map.Entry e2 = map.higherEntry(zero);
847 Map.Entry e3 = map.higherEntry(m5);
850 Map.Entry e4 = map.higherEntry(m
[all...]
H A DConcurrentSkipListSubMapTest.java398 * higherEntry returns next entry.
402 Map.Entry e1 = map.higherEntry(three);
405 Map.Entry e2 = map.higherEntry(zero);
408 Map.Entry e3 = map.higherEntry(five);
411 Map.Entry e4 = map.higherEntry(six);
1072 * higherEntry returns next entry.
1076 Map.Entry e1 = map.higherEntry(m3);
1079 Map.Entry e2 = map.higherEntry(zero);
1082 Map.Entry e3 = map.higherEntry(m5);
1085 Map.Entry e4 = map.higherEntry(m
[all...]
H A DConcurrentSkipListMapTest.java486 * higherEntry returns next entry.
490 Map.Entry e1 = map.higherEntry(three);
493 Map.Entry e2 = map.higherEntry(zero);
496 Map.Entry e3 = map.higherEntry(five);
499 Map.Entry e4 = map.higherEntry(six);
540 * lowerEntry, higherEntry, ceilingEntry, and floorEntry return
551 e = map.higherEntry(zero);
H A DTreeMapTest.java399 * higherEntry returns next entry.
403 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);
/openjdk9/jdk/test/java/util/NavigableMap/
H A DLockStep.java396 equal(null, m.higherEntry(1));
/openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/
H A DConcurrentSkipListMap.java2215 public Map.Entry<K,V> higherEntry(K key) { method in class:ConcurrentSkipListMap
3039 public Map.Entry<K,V> higherEntry(K key) { method in class:ConcurrentSkipListMap.SubMap

Completed in 136 milliseconds