| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | TreeSetTest.java | 114 NavigableSet<String> descendingSet = set.descendingSet();
115 new SerializationTester<NavigableSet<String>>(descendingSet, s) {
|
| /libcore/luni/src/main/java/java/util/ |
| H A D | NavigableSet.java | 21 * descendingSet} method returns a view of the set with the senses of
147 * The expression {@code s.descendingSet().descendingSet()} returns a
152 NavigableSet<E> descendingSet(); method in interface:NavigableSet
156 * Equivalent in effect to {@code descendingSet().iterator()}.
|
| H A D | TreeSet.java | 41 private transient NavigableSet<E> descendingSet; field in class:TreeSet
227 return descendingSet().iterator();
340 * @see java.util.NavigableSet#descendingSet()
343 public NavigableSet<E> descendingSet() { method in class:TreeSet
344 return (descendingSet != null) ? descendingSet
345 : (descendingSet = new TreeSet<E>(backingMap.descendingMap()));
|
| H A D | TreeMap.java | 1054 public NavigableSet<K> descendingSet() { method in class:TreeMap.KeySet
1638 public NavigableSet<K> descendingSet() { method in class:TreeMap.BoundedMap.BoundedKeySet
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | TreeMapExtendTest.java | 3437 NavigableSet descendingSet;
3444 descendingSet = ((NavigableSet) entrySet).descendingSet();
3446 comparator = descendingSet.comparator();
3449 entryArray = (Entry[]) descendingSet
3450 .toArray(new Entry[descendingSet.size()]);
3461 descendingSet = ((NavigableSet) entrySet).descendingSet();
3463 comparator = descendingSet.comparator();
3466 entryArray = (Entry[]) descendingSet
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | ConcurrentSkipListSetTest.java | 674 check(set.descendingSet(), 0, setSize - 1, false, bs);
678 check(set.descendingSet(), 0, setSize - 1, false, bs);
780 check(set.descendingSet(), min, max, !ascending, bs);
784 check(set.descendingSet(), min, max, !ascending, bs);
798 bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
804 bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
815 bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
821 bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
841 bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
850 bashSubSet(sm.descendingSet(), endpoint
[all...] |
| H A D | TreeSetTest.java | 680 check(set.descendingSet(), 0, setSize - 1, false);
684 check(set.descendingSet(), 0, setSize - 1, false);
784 check(set.descendingSet(), min, max, !ascending);
788 check(set.descendingSet(), min, max, !ascending);
802 bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
808 bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
819 bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
825 bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
845 bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
854 bashSubSet(sm.descendingSet(), endpoint
[all...] |
| H A D | ConcurrentSkipListSubSetTest.java | 80 NavigableSet s = q.descendingSet();
|
| H A D | TreeSubSetTest.java | 72 NavigableSet s = q.descendingSet();
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListSet.java | 435 * The expression {@code s.descendingSet().descendingSet()} returns a
440 public NavigableSet<E> descendingSet() { method in class:ConcurrentSkipListSet
|
| H A D | ConcurrentSkipListMap.java | 2323 return descendingSet().iterator();
2347 public NavigableSet<E> descendingSet() { method in class:ConcurrentSkipListMap.KeySet
|