| /libcore/ojluni/src/main/java/java/util/ |
| NavigableSet.java | 51 * ascending or descending order. The {@link #descendingSet} method
180 * The expression {@code s.descendingSet().descendingSet()} returns a
185 NavigableSet<E> descendingSet();
189 * Equivalent in effect to {@code descendingSet().iterator()}.
|
| TreeSet.java | 197 public NavigableSet<E> descendingSet() {
|
| Collections.java | [all...] |
| TreeMap.java | [all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| TreeSetTest.java | 114 NavigableSet<String> descendingSet = set.descendingSet();
115 new SerializationTester<NavigableSet<String>>(descendingSet, s) {
|
| CollectionsTest.java | [all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| DescendingImmutableSortedSet.java | 24 * Skeletal implementation of {@link ImmutableSortedSet#descendingSet()}.
48 return forward.tailSet(toElement, inclusive).descendingSet();
54 return forward.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet();
59 return forward.headSet(fromElement, inclusive).descendingSet();
64 public ImmutableSortedSet<E> descendingSet() {
|
| SortedMultisets.java | 115 public NavigableSet<E> descendingSet() {
121 return descendingSet().iterator();
|
| ForwardingNavigableSet.java | 149 public NavigableSet<E> descendingSet() {
150 return delegate().descendingSet();
154 * A sensible implementation of {@link NavigableSet#descendingSet} in terms of the other methods
157 * <p>In many cases, you may wish to override {@link ForwardingNavigableSet#descendingSet} to
163 protected class StandardDescendingSet extends Sets.DescendingSet<E> {
|
| ImmutableSortedSet.java | 770 transient ImmutableSortedSet<E> descendingSet;
777 public ImmutableSortedSet<E> descendingSet() {
779 ImmutableSortedSet<E> result = descendingSet;
781 result = descendingSet = createDescendingSet();
782 result.descendingSet = this;
|
| AbstractMapBasedMultimap.java | 730 public NavigableSet<V> descendingSet() {
731 return wrap(getSortedSetDelegate().descendingSet());
1064 public NavigableSet<K> descendingSet() {
1070 return descendingSet().iterator();
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedNavigableSetTest.java | 75 @Override public NavigableSet<E> descendingSet() {
77 return delegate().descendingSet();
179 NavigableSet<String> descendingSet = map.descendingSet();
180 assertTrue(descendingSet instanceof SynchronizedNavigableSet);
181 assertSame(MUTEX, ((SynchronizedNavigableSet<String>) descendingSet).mutex);
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeSet.java | 106 @Override public NavigableSet<E> descendingSet() {
107 return new SafeTreeSet<E>(delegate.descendingSet());
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ConcurrentSkipListSetTest.java | 493 assertIteratorExhausted(s.descendingSet().iterator());
677 check(set.descendingSet(), 0, setSize - 1, false, bs);
681 check(set.descendingSet(), 0, setSize - 1, false, bs);
783 check(set.descendingSet(), min, max, !ascending, bs);
787 check(set.descendingSet(), min, max, !ascending, bs);
801 bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
807 bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
818 bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
824 bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
844 bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1)
[all...] |
| TreeSetTest.java | 681 check(set.descendingSet(), 0, setSize - 1, false);
685 check(set.descendingSet(), 0, setSize - 1, false);
785 check(set.descendingSet(), min, max, !ascending);
789 check(set.descendingSet(), min, max, !ascending);
803 bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
809 bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
820 bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
826 bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
846 bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
855 bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1)
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 476 * The expression {@code s.descendingSet().descendingSet()} returns a
481 public NavigableSet<E> descendingSet() {
|
| ConcurrentSkipListMap.java | [all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| /prebuilts/tools/common/m2/repository/com/squareup/haha/haha/2.0.2/ |
| haha-2.0.2.jar | |
| /prebuilts/misc/common/robolectric/3.1.1/lib/ |
| backport-util-concurrent-3.1.jar | |
| /prebuilts/tools/common/m2/repository/backport-util-concurrent/backport-util-concurrent/3.1/ |
| backport-util-concurrent-3.1.jar | |
| /external/dagger2/lib/ |
| auto-value-1.4.1.jar | |
| /prebuilts/tools/common/m2/repository/com/google/auto/value/auto-value/1.3/ |
| auto-value-1.3.jar | |
| /prebuilts/tools/common/m2/repository/com/google/auto/value/auto-value/1.3-rc1/ |
| auto-value-1.3-rc1.jar | |
| /prebuilts/tools/common/m2/repository/com/google/auto/value/auto-value/1.5.2/ |
| auto-value-1.5.2.jar | |
