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.java401 * higher returns next element
405 Object e1 = q.higher(three);
408 Object e2 = q.higher(zero);
411 Object e3 = q.higher(five);
414 Object e4 = q.higher(six);
878 int higher(int element) {
953 assertEq(set.higher(element), rs.higher(element));
H A DTreeSetTest.java405 * higher returns next element
409 Object e1 = q.higher(three);
412 Object e2 = q.higher(zero);
415 Object e3 = q.higher(five);
418 Object e4 = q.higher(six);
879 int higher(int element) {
954 assertEq(set.higher(element), rs.higher(element));
H A DConcurrentSkipListSubSetTest.java358 * higher returns next element
362 Object e1 = q.higher(three);
365 Object e2 = q.higher(zero);
368 Object e3 = q.higher(five);
371 Object e4 = q.higher(six);
848 * higher returns next element
852 Object e1 = q.higher(m3);
855 Object e2 = q.higher(zero);
858 Object e3 = q.higher(m5);
861 Object e4 = q.higher(m
[all...]
H A DTreeSubSetTest.java355 * higher returns next element
359 Object e1 = q.higher(three);
362 Object e2 = q.higher(zero);
365 Object e3 = q.higher(five);
368 Object e4 = q.higher(six);
834 * higher returns next element
838 Object e1 = q.higher(m3);
841 Object e2 = q.higher(zero);
844 Object e3 = q.higher(m5);
847 Object e4 = q.higher(m
[all...]
H A DConcurrentSkipListMapTest.java1177 int higher(int key) {
1251 assertEq(map.higherKey(key), rs.higher(key));
H A DTreeMapTest.java982 int higher(int key) {
1056 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.java332 public E higher(E e) { method in class:ConcurrentSkipListSet
H A DConcurrentSkipListMap.java1303 * Utility for ceiling, floor, lower, higher methods.
2201 /** Advances next to higher entry. */
2297 public E higher(E e) { return m.higherKey(e); } method in class:ConcurrentSkipListMap.KeySet

Completed in 103 milliseconds