/libcore/ojluni/src/main/java/java/util/ |
H A D | NavigableMap.java | 46 * and {@link #higherEntry} return {@code Map.Entry} objects 198 Map.Entry<K,V> higherEntry(K key); method in interface:NavigableMap
|
H A D | Collections.java | 1951 public Entry<K, V> higherEntry(K key) { method in class:Collections.UnmodifiableNavigableMap 1952 Entry<K,V> higher = (Entry<K, V>) nm.higherEntry(key); 2920 public Entry<K, V> higherEntry(K key) method in class:Collections.SynchronizedNavigableMap 2921 { synchronized (mutex) { return nm.higherEntry(key); } } 4124 public Entry<K, V> higherEntry(K key) { method in class:Collections.CheckedNavigableMap 4125 Entry<K,V> higher = nm.higherEntry(key);
|
H A D | TreeMap.java | 766 public Map.Entry<K,V> higherEntry(K key) { method in class:TreeMap 1542 public final Map.Entry<K,V> higherEntry(K key) { method in class:TreeMap.NavigableSubMap
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | TreeSubMapTest.java | 263 * higherEntry returns next entry. 267 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); 815 * higherEntry returns next entry. 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(m [all...] |
H A D | ConcurrentSkipListSubMapTest.java | 376 * higherEntry returns next entry. 380 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); 1050 * higherEntry returns next entry. 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(m [all...] |
H A D | ConcurrentSkipListMapTest.java | 464 * higherEntry returns next entry. 468 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); 518 * lowerEntry, higherEntry, ceilingEntry, and floorEntry return 529 e = map.higherEntry(zero);
|
H A D | TreeMapTest.java | 377 * higherEntry returns next entry. 381 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/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | TreeMapTest.java | 1172 * {@link java.util.TreeMap#higherEntry(Object) 1179 assertEquals(objArray[0], tm.higherEntry(testint.toString()).getValue()); 1180 assertEquals(objArray[101], tm.higherEntry(testint100.toString()) 1182 assertEquals(objArray[101], tm.higherEntry(testint10000.toString()) 1187 assertEquals(objArray[0], tm.higherEntry(testint.toString()).getValue()); 1188 assertEquals(testint, tm.higherEntry(testint100.toString()).getValue()); 1189 Entry entry = tm.higherEntry(testint10000.toString()); 1192 assertNull(tm.higherEntry(testint9999.toString())); 1194 tm.higherEntry(testint100); 1200 tm.higherEntry(nul [all...] |
H A D | TreeMapExtendTest.java | 115 assertNull(treeMap.higherEntry(1)); 149 assertEquals(tm.higherEntry(key), treeMap.higherEntry(key)); 2177 assertNull(decendingMap.higherEntry(value.toString())); 2181 entry = decendingMap.higherEntry(value.toString()); 2186 entry = decendingMap.higherEntry(value.toString()); 2192 entry = decendingTailMap.higherEntry(value.toString()); 2197 assertNull(decendingMap.higherEntry(value.toString())); 2201 entry = decendingMap.higherEntry(value.toString()); 2206 entry = decendingMap.higherEntry(valu [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | TreeMapTest.java | 128 assertImmutable(map.higherEntry("A"));
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 2193 public Map.Entry<K,V> higherEntry(K key) { method in class:ConcurrentSkipListMap 3017 public Map.Entry<K,V> higherEntry(K key) { method in class:ConcurrentSkipListMap.SubMap
|