Searched refs:tailMap (Results 1 - 23 of 23) sorted by relevance

/openjdk9/jdk/test/java/util/TreeMap/
H A DNullPermissiveComparator.java66 equal(m.tailMap("b"), "{b=B, c=C}");
68 equal(m.tailMap(null), "{a=A, b=B, c=C}");
74 equal(m.tailMap("b"), "{b=B, c=C}");
76 equal(m.tailMap(null), "{null=NULL, a=A, b=B, c=C}");
86 equal(m.tailMap("b"), "{b=B, c=C}");
88 equal(m.tailMap(null), "{}");
94 equal(m.tailMap("b"), "{b=B, c=C, null=NULL}");
96 equal(m.tailMap(null), "{null=NULL}");
H A DHeadTailTypeError.java44 m.tailMap(new Object());
45 throw new Exception("tailMap, natural ordering");
58 m.tailMap(new Integer(0));
59 throw new Exception("tailMap, explicit comparator");
100 m.tailMap(null);
101 throw new Exception("(null endpoint)tailMap, natural ordering");
115 m.tailMap(null);
116 throw new Exception("(null endpoint)tailMap, explicit comparator");
151 m.tailMap(new Integer(0));
154 m.tailMap("llam
[all...]
H A DNullAtEnd.java96 SortedMap<String,String> m3 = m2.tailMap("b");
/openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/
H A DConcurrentNavigableMap.java77 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:ConcurrentNavigableMap
98 ConcurrentNavigableMap<K,V> tailMap(K fromKey); method in interface:ConcurrentNavigableMap
H A DConcurrentSkipListSet.java439 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
H A DConcurrentSkipListMap.java2100 public ConcurrentNavigableMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap
2131 public ConcurrentNavigableMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap
2132 return tailMap(fromKey, true);
2440 return new KeySet<>(m.tailMap(fromElement, inclusive));
2583 * only using the {@code subMap}, {@code headMap}, and {@code tailMap}
2990 public SubMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:ConcurrentSkipListMap.SubMap
3004 public SubMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap.SubMap
3005 return tailMap(fromKey, true);
/openjdk9/jdk/src/java.base/share/classes/java/util/
H A DSortedMap.java208 SortedMap<K,V> tailMap(K fromKey); method in interface:SortedMap
H A DNavigableMap.java58 * {@link #tailMap(Object, boolean) tailMap(K, boolean)}
79 * {@link #tailMap(Object) tailMap(K)}
392 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:NavigableMap
419 * <p>Equivalent to {@code tailMap(fromKey, true)}.
425 SortedMap<K,V> tailMap(K fromKey); method in interface:NavigableMap
H A DTreeSet.java350 return new TreeSet<>(m.tailMap(fromElement, inclusive));
H A DCollections.java1773 * {@code subMap}, {@code headMap}, or {@code tailMap} views, result in
1805 public SortedMap<K,V> tailMap(K fromKey) method in class:Collections.UnmodifiableSortedMap
1806 { return new UnmodifiableSortedMap<>(sm.tailMap(fromKey)); }
1817 * {@code subMap}, {@code headMap}, or {@code tailMap} views, result in
1949 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) method in class:Collections.UnmodifiableNavigableMap
1950 { return unmodifiableNavigableMap(nm.tailMap(fromKey, inclusive)); }
2710 * {@code tailMap} views, via {@link Iterator}, {@link Spliterator} or
2785 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.SynchronizedSortedMap
2787 return new SynchronizedSortedMap<>(sm.tailMap(fromKey),mutex);
2808 * {@code tailMap} view
2932 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.SynchronizedNavigableMap
2952 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { method in class:Collections.SynchronizedNavigableMap
3990 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.CheckedSortedMap
4149 public NavigableMap<K,V> tailMap(K fromKey) { method in class:Collections.CheckedNavigableMap
4161 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { method in class:Collections.CheckedNavigableMap
[all...]
H A DTreeMap.java937 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap
972 public SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap
973 return tailMap(fromKey, true);
1165 return new KeySet<>(m.tailMap(fromElement, inclusive));
1616 public final SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap.NavigableSubMap
1617 return tailMap(fromKey, true);
1878 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.AscendingSubMap
1963 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.DescendingSubMap
2035 public SortedMap<K,V> tailMap(K fromKey) { throw new InternalError(); } method in class:TreeMap.SubMap
/openjdk9/jdk/test/java/util/Collections/
H A DViewSynch.java39 static Map m2 = m.tailMap(ZERO);
H A DEmptyNavigableMap.java307 NavigableMap subMap = navigableMap.tailMap(BigInteger.ONE, true);
310 subMap.tailMap(BigInteger.ONE, true);
313 NavigableMap ns = subMap.tailMap(BigInteger.ONE, false);
317 ns.tailMap(BigInteger.ONE, true);
322 subMap.tailMap(isDescending(subMap) ? BigInteger.ZERO : BigInteger.TEN, false);
326 * Tests the tailMap() method.
331 navigableMap.tailMap(null);
336 navigableMap.tailMap(new Object());
340 NavigableMap ss = navigableMap.tailMap("1", true);
H A DSyncSubMutexes.java91 assertSame(getSyncMapMutex(instance.tailMap("Charlie")), getSyncMapMutex(instance));
104 assertSame(getSyncMapMutex(instance.tailMap("Charlie")), getSyncMapMutex(instance));
105 assertSame(getSyncMapMutex(instance.tailMap("Charlie", true)), getSyncMapMutex(instance));
227 instances.add(new Object[] {Collections.synchronizedSortedMap(new TreeMap<>(BASE_MAP)).tailMap("Bravo")});
241 instances.add(new Object[] {Collections.synchronizedNavigableMap(new TreeMap<>(BASE_MAP)).tailMap("Bravo")});
242 instances.add(new Object[] {Collections.synchronizedNavigableMap(new TreeMap<>(BASE_MAP)).tailMap("Bravo", true)});
/openjdk9/jdk/test/java/util/NavigableMap/
H A DLockStep.java137 ? m.tailMap(Integer.MIN_VALUE, true)
138 : m.tailMap(Integer.MAX_VALUE, true);
404 equal2(m, m.tailMap(a));
411 testEmptyMap(m.tailMap(z, false));
414 equal2(m.tailMap(z, true), singletonMap(z, m.get(z)));
515 equalNavigableMapsLeaf(m1.tailMap(min, true),
516 m2.tailMap(min, true));
527 equalNavigableMapsLeaf((NavigableMap) m1.tailMap(min),
528 (NavigableMap) m2.tailMap(min));
553 m.tailMap(
[all...]
/openjdk9/jdk/test/java/util/concurrent/ConcurrentMap/
H A DConcurrentRemoveIf.java73 navActions.put(".headMap()/tailMap().entrySet().removeIf()",
76 ConcurrentMap<Integer, Integer> right = m.tailMap(HALF_SIZE, true);
80 navActions.put(".headMap()/tailMap().values().removeIf()",
83 ConcurrentMap<Integer, Integer> right = m.tailMap(HALF_SIZE, true);
/openjdk9/jdk/test/java/util/Collection/
H A DBiggernYours.java71 compareMaps(m1.tailMap(Integer.MIN_VALUE),
72 m2.tailMap(Integer.MIN_VALUE));
H A DMOAT.java1100 testNavigableMap(nm.tailMap(0, false));
1101 testNavigableMap(nm.tailMap(1, true));
1310 return m.tailMap(-99, false); }},
1328 equal(m.descendingMap().tailMap(86, true).remove(k), v); }},
1333 equal(m.tailMap(-86, true).remove(k), v); }},
/openjdk9/jdk/src/java.base/share/classes/com/sun/java/util/jar/pack/
H A DPropMap.java318 public SortedMap<String, String> tailMap(String fromKey) { method in class:PropMap
319 return theMap.tailMap(fromKey);
/openjdk9/jdk/test/java/util/concurrent/tck/
H A DTreeSubMapTest.java76 return map.tailMap(one, true);
568 SortedMap sm = map.tailMap(two);
602 SortedMap ssm = sm.tailMap(four);
1095 SortedMap sm = map.tailMap(m2);
1129 SortedMap ssm = sm.tailMap(m4);
H A DConcurrentSkipListSubMapTest.java93 return map.tailMap(one, true);
733 SortedMap sm = map.tailMap(two);
767 SortedMap ssm = sm.tailMap(four);
1407 SortedMap sm = map.tailMap(m2);
1441 SortedMap ssm = sm.tailMap(m4);
H A DConcurrentSkipListMapTest.java944 * tailMap returns map with keys in requested range
948 NavigableMap sm = map.tailMap(two, true);
992 NavigableMap ssm = sm.tailMap(four, true);
1137 // tailMap - pick direction and endpoint inclusion randomly
1139 NavigableMap<Integer,Integer> tm = map.tailMap(midPoint,incl);
H A DTreeMapTest.java753 NavigableMap sm = map.tailMap(two, true);
797 NavigableMap ssm = sm.tailMap(four, true);
942 // tailMap - pick direction and endpoint inclusion randomly
944 NavigableMap<Integer,Integer> tm = map.tailMap(midPoint,incl);

Completed in 175 milliseconds