Searched refs:descendingMap (Results 1 - 16 of 16) sorted by relevance

/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentNavigableMap.java107 * The expression {@code m.descendingMap().descendingMap()} returns a
112 ConcurrentNavigableMap<K,V> descendingMap(); method in interface:ConcurrentNavigableMap
H A DConcurrentSkipListSet.java482 return new ConcurrentSkipListSet<E>(m.descendingMap());
H A DConcurrentSkipListMap.java384 private transient ConcurrentNavigableMap<K,V> descendingMap; field in class:ConcurrentSkipListMap
395 descendingMap = null;
1895 public ConcurrentNavigableMap<K,V> descendingMap() { method in class:ConcurrentSkipListMap
1896 ConcurrentNavigableMap<K,V> dm = descendingMap;
1897 return (dm != null) ? dm : (descendingMap = new SubMap<K,V>
1902 return descendingMap().navigableKeySet();
2430 return new KeySet<>(m.descendingMap());
2986 public SubMap<K,V> descendingMap() { method in class:ConcurrentSkipListMap.SubMap
3072 return descendingMap().navigableKeySet();
/libcore/ojluni/src/main/java/java/util/
H A DNavigableMap.java55 * ascending or descending key order. The {@link #descendingMap}
260 * The expression {@code m.descendingMap().descendingMap()} returns a
265 NavigableMap<K,V> descendingMap(); method in interface:NavigableMap
H A DTreeMap.java643 clone.descendingMap = null;
790 private transient NavigableMap<K,V> descendingMap; field in class:TreeMap
833 return descendingMap().navigableKeySet();
896 public NavigableMap<K, V> descendingMap() { method in class:TreeMap
897 NavigableMap<K, V> km = descendingMap;
899 (descendingMap = new DescendingSubMap<>(this,
1181 return new KeySet<>(m.descendingMap());
1614 return descendingMap().navigableKeySet();
1903 public NavigableMap<K,V> descendingMap() { method in class:TreeMap.AscendingSubMap
1996 public NavigableMap<K,V> descendingMap() { method in class:TreeMap.DescendingSubMap
[all...]
H A DTreeSet.java198 return new TreeSet<>(m.descendingMap());
H A DCollections.java1978 public NavigableMap<K, V> descendingMap() method in class:Collections.UnmodifiableNavigableMap
1979 { return unmodifiableNavigableMap(nm.descendingMap()); }
2933 public NavigableMap<K, V> descendingMap() { method in class:Collections.SynchronizedNavigableMap
2936 new SynchronizedNavigableMap<>(nm.descendingMap(), mutex);
4161 public NavigableMap<K, V> descendingMap() { method in class:Collections.CheckedNavigableMap
4162 return checkedNavigableMap(nm.descendingMap(), keyType, valueType);
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListMapTest.java308 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);
1105 bashSubMap(hm.descendingMap(), min, midPoint - (incl ? 0 : 1),
1111 bashSubMap(hm.descendingMap(), midPoint + (incl ? 0 : 1), max,
1122 bashSubMap(tm.descendingMap(), midPoint + (incl ? 0 : 1), max,
1128 bashSubMap(tm.descendingMap(), mi
[all...]
H A DTreeMapTest.java291 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(), mi
[all...]
H A DTreeSubMapTest.java70 return map.descendingMap();
H A DConcurrentSkipListSubMapTest.java65 return map.descendingMap();
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DTreeMapExtendTest.java1607 NavigableMap descendingMap = navigableMap_startExcluded_endExcluded
1608 .descendingMap();
1610 descendingMap.size());
1611 assertNotNull(descendingMap.comparator());
1614 descendingMap.lastKey());
1616 descendingMap.lastEntry());
1619 descendingMap.firstKey());
1621 descendingMap.firstEntry());
1623 descendingMap = navigableMap_startExcluded_endIncluded.descendingMap();
[all...]
H A DTreeMapTest.java701 vals = tm.descendingMap().values();
797 vals = myTreeMap.descendingMap().headMap(400).values();
813 vals = myTreeMap.descendingMap().tailMap(400).values();
1445 s = tm.descendingMap();
1732 NavigableMap<Integer, Object> descMap = tm.descendingMap();
1737 // sub map of sub map of descendingMap
1742 mapIntObj = mapIntObj.descendingMap();
/libcore/luni/src/test/java/libcore/java/util/
H A DCollectionsTest.java756 NavigableSet<String> set = map.descendingMap().descendingKeySet();
771 Set<String> set = map.descendingMap().keySet();
778 NavigableSet<String> set = map.descendingMap().navigableKeySet();
792 Collection<Integer> values = map.descendingMap().values();
815 check_unmodifiableOrderedMap_defaultMethods(map.descendingMap(), reverseKeys,
986 // descendingMap -> descendingKeySet
988 map.descendingMap().descendingKeySet(), keysInOrder, absentKey);
993 // descendingMap -> keySet
994 check_unmodifiableSet(map.descendingMap().keySet(), absentKey);
995 check_orderedSet(map.descendingMap()
[all...]
H A DTreeMapTest.java210 map.descendingMap().put(null, "b");
416 NavigableMap<String, String> descendingMap = map.descendingMap();
417 new SerializationTester<NavigableMap<String, String>>(descendingMap, s) {
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
H A DCollectionAndMapModifyStreamTest.java122 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));

Completed in 304 milliseconds