| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentNavigableMap.java | 78 * The expression {@code m.descendingMap().descendingMap()} returns a
83 ConcurrentNavigableMap<K,V> descendingMap();
|
| ConcurrentSkipListSet.java | 453 return new ConcurrentSkipListSet<E>(m.descendingMap());
|
| /external/guava/guava/src/com/google/common/collect/ |
| EmptyImmutableSortedMap.java | 41 Comparator<? super K> comparator, ImmutableSortedMap<K, V> descendingMap) {
42 super(descendingMap);
|
| ForwardingNavigableMap.java | 208 * {@link #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may
212 return Iterables.getFirst(descendingMap().entrySet(), null);
249 * {@code entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish
253 return Iterators.pollNext(descendingMap().entrySet().iterator());
257 public NavigableMap<K, V> descendingMap() {
258 return delegate().descendingMap();
262 * A sensible implementation of {@link NavigableMap#descendingMap} in terms of the methods of
264 * {@link ForwardingNavigableMap#descendingMap} to forward to this implementation or a subclas
[all...] |
| RegularImmutableSortedMap.java | 43 ImmutableSortedMap<K, V> descendingMap) {
44 super(descendingMap);
|
| AbstractNavigableMap.java | 178 return descendingMap().navigableKeySet();
182 public NavigableMap<K, V> descendingMap() {
183 return new DescendingMap();
186 private final class DescendingMap extends Maps.DescendingMap<K, V> {
|
| ImmutableSortedMap.java | 415 ImmutableSortedMap(ImmutableSortedMap<K, V> descendingMap) {
416 this.descendingMap = descendingMap;
650 private transient ImmutableSortedMap<K, V> descendingMap;
653 public ImmutableSortedMap<K, V> descendingMap() {
654 ImmutableSortedMap<K, V> result = descendingMap;
656 result = descendingMap = createDescendingMap();
|
| Maps.java | 950 return descendingMap().entrySet().iterator();
[all...] |
| TreeRangeSet.java | 360 .descendingMap().values();
362 candidates = rangesByLowerBound.descendingMap().values();
524 .descendingMap().values().iterator());
756 .descendingMap().values().iterator();
|
| AbstractMapBasedMultimap.java | 1065 return new NavigableKeySet(sortedMap().descendingMap());
[all...] |
| Synchronized.java | [all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| NavigableMap.java | 54 * ascending or descending key order. The {@link #descendingMap}
259 * The expression {@code m.descendingMap().descendingMap()} returns a
264 NavigableMap<K,V> descendingMap();
|
| TreeMap.java | 667 clone.descendingMap = null;
814 private transient NavigableMap<K,V> descendingMap = null;
857 return descendingMap().navigableKeySet();
[all...] |
| TreeSet.java | 198 return new TreeSet<>(m.descendingMap());
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedNavigableMapTest.java | 122 @Override public NavigableMap<K, V> descendingMap() {
124 return delegate().descendingMap();
279 NavigableMap<String, Integer> descendingMap = map.descendingMap();
280 assertTrue(descendingMap instanceof SynchronizedNavigableMap);
282 ((SynchronizedNavigableMap<String, Integer>) descendingMap).mutex);
|
| ForwardingNavigableMapTest.java | 181 public NavigableMap<K, V> descendingMap() {
349 forward().descendingMap();
350 assertEquals("[descendingMap]", getCalls());
|
| TreeRangeSetTest.java | 121 assertThat(navigableMap.headMap(key, inclusive).descendingMap().entrySet())
122 .has().exactlyAs(expected.headMap(key, inclusive).descendingMap().entrySet()).inOrder();
123 assertThat(navigableMap.tailMap(key, inclusive).descendingMap().entrySet())
124 .has().exactlyAs(expected.tailMap(key, inclusive).descendingMap().entrySet()).inOrder();
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ConcurrentSkipListMapTest.java | 308 Set s = map.descendingMap().entrySet();
341 Set s = map.descendingMap().entrySet();
993 check(map.descendingMap(), 0, mapSize - 1, false);
997 check(map.descendingMap(), 0, mapSize - 1, false);
1087 check(map.descendingMap(), min, max, !ascending);
1091 check(map.descendingMap(), min, max, !ascending);
[all...] |
| TreeMapTest.java | 291 Set s = map.descendingMap().entrySet();
324 Set s = map.descendingMap().entrySet();
798 check(map.descendingMap(), 0, mapSize - 1, false);
802 check(map.descendingMap(), 0, mapSize - 1, false);
892 check(map.descendingMap(), min, max, !ascending);
896 check(map.descendingMap(), min, max, !ascending);
910 bashSubMap(hm.descendingMap(), min, midPoint - (incl ? 0 : 1),
916 bashSubMap(hm.descendingMap(), midPoint + (incl ? 0 : 1), max,
927 bashSubMap(tm.descendingMap(), midPoint + (incl ? 0 : 1), max,
933 bashSubMap(tm.descendingMap(), min, midPoint - (incl ? 0 : 1)
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| TreeMapTest.java | 701 vals = tm.descendingMap().values();
797 vals = myTreeMap.descendingMap().headMap(400).values();
813 vals = myTreeMap.descendingMap().tailMap(400).values();
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| TreeMapTest.java | 209 map.descendingMap().put(null, "b");
388 NavigableMap<String, String> descendingMap = map.descendingMap();
389 new SerializationTester<NavigableMap<String, String>>(descendingMap, s) {
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeMap.java | 113 @Override public NavigableMap<K, V> descendingMap() {
114 return new SafeTreeMap<K, V>(delegate.descendingMap());
|
| NavigableMapTestSuiteBuilder.java | 128 return map.descendingMap();
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| CollectionAndMapModifyStreamTest.java | 122 maps.put(TreeMap.class.getName() + ".descendingMap()", () -> new TreeMap<>(content).descendingMap());
125 // maps.put(TreeMap.class.getName() + ".descendingMap().descendingMap()", () -> new TreeMap<>(content).descendingMap().descendingMap());
127 // maps.put(TreeMap.class.getName() + ".descendingMap().headMap()", () -> new TreeMap<>(content).descendingMap().tailMap(content.size() - 1, false));
|
