Searched refs:higher (Results 1 - 12 of 12) sorted by relevance

/libcore/luni/src/main/java/java/util/
H A DNavigableSet.java16 * {@code floor}, {@code ceiling}, and {@code higher} return elements
112 E higher(E e); method in interface:NavigableSet
H A DTreeSet.java300 * @see java.util.NavigableSet#higher(java.lang.Object)
303 public E higher(E e) { method in class:TreeSet
H A DTreeMap.java306 * nearest nodes, one lower and one higher.
309 if (comparison < 0) { // nearest.key is higher
1012 public K higher(K key) { method in class:TreeMap.KeySet
1321 relation = CEILING; // we already went higher
1602 public K higher(K key) { method in class:TreeMap.BoundedMap.BoundedKeySet
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListSetTest.java391 * higher returns next element
395 Object e1 = q.higher(three);
398 Object e2 = q.higher(zero);
401 Object e3 = q.higher(five);
404 Object e4 = q.higher(six);
874 int higher(int element) {
949 assertEq(set.higher(element), rs.higher(element));
H A DTreeSetTest.java395 * higher returns next element
399 Object e1 = q.higher(three);
402 Object e2 = q.higher(zero);
405 Object e3 = q.higher(five);
408 Object e4 = q.higher(six);
877 int higher(int element) {
952 assertEq(set.higher(element), rs.higher(element));
H A DConcurrentSkipListSubSetTest.java353 * higher returns next element
357 Object e1 = q.higher(three);
360 Object e2 = q.higher(zero);
363 Object e3 = q.higher(five);
366 Object e4 = q.higher(six);
852 * higher returns next element
856 Object e1 = q.higher(m3);
859 Object e2 = q.higher(zero);
862 Object e3 = q.higher(m5);
865 Object e4 = q.higher(m
[all...]
H A DTreeSubSetTest.java345 * higher returns next element
349 Object e1 = q.higher(three);
352 Object e2 = q.higher(zero);
355 Object e3 = q.higher(five);
358 Object e4 = q.higher(six);
833 * higher returns next element
837 Object e1 = q.higher(m3);
840 Object e2 = q.higher(zero);
843 Object e3 = q.higher(m5);
846 Object e4 = q.higher(m
[all...]
H A DConcurrentSkipListMapTest.java1156 int higher(int key) {
1230 assertEq(map.higherKey(key), rs.higher(key));
H A DTreeMapTest.java961 int higher(int key) {
1035 assertEq(map.higherKey(key), rs.higher(key));
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DTreeMapExtendTest.java4769 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4780 Object x = descendingSubMapEntrySet.higher(afterEnd);
4785 Object y = descendingSubMapEntrySet.higher(beforeStart);
4796 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4813 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4830 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4849 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4861 higherEntry = (Entry) descendingSubMapEntrySet.higher(entry);
4872 Object x = descendingSubMapEntrySet.higher(afterEnd);
4877 Object y = descendingSubMapEntrySet.higher(beforeStar
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentSkipListSet.java331 public E higher(E e) { method in class:ConcurrentSkipListSet
H A DConcurrentSkipListMap.java1294 * Utility for ceiling, floor, lower, higher methods.
2192 /** Advances next to higher entry. */
2288 public E higher(E e) { return m.higherKey(e); } method in class:ConcurrentSkipListMap.KeySet

Completed in 385 milliseconds