/openjdk9/jdk/test/java/util/TreeMap/ |
H A D | HeadTailTypeError.java | 65 m.headSet(new Object()); 66 throw new Exception("headSet, natural ordering"); 79 m.headSet(new Integer(0)); 80 throw new Exception("headSet, explicit comparator"); 122 m.headSet(null); 123 throw new Exception("(null endpoint)headSet, natural ordering"); 136 m.headSet(null); 137 throw new Exception("(null endpoint)headSet, explicit comparator"); 157 s.headSet(new Integer(0)); 160 s.headSet("dram [all...] |
/openjdk9/jdk/src/java.base/share/classes/java/util/ |
H A D | NavigableSet.java | 56 * {@link #headSet(Object, boolean) headSet(E, boolean)}, and 73 * {@link #headSet(Object) headSet(E)}, and 260 NavigableSet<E> headSet(E toElement, boolean inclusive); method in interface:NavigableSet 305 * <p>Equivalent to {@code headSet(toElement, false)}. 311 SortedSet<E> headSet(E toElement); method in interface:NavigableSet
|
H A D | SortedSet.java | 178 SortedSet<E> headSet(E toElement); method in interface:SortedSet
|
H A D | TreeSet.java | 337 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:TreeSet 371 public SortedSet<E> headSet(E toElement) { method in class:TreeSet 372 return headSet(toElement, false);
|
H A D | Collections.java | 1140 * {@code subSet}, {@code headSet}, or {@code tailSet} views, result in 1171 public SortedSet<E> headSet(E toElement) { method in class:Collections.UnmodifiableSortedSet 1172 return new UnmodifiableSortedSet<>(ss.headSet(toElement)); 1188 * {@code subSet}, {@code headSet}, or {@code tailSet} views, result in 1260 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:Collections.UnmodifiableNavigableSet 1262 ns.headSet(toElement, inclusive)); 2154 * {@code headSet}, or {@code tailSet} views via {@link Iterator}, 2168 * SortedSet s2 = s.headSet(foo); 2219 public SortedSet<E> headSet(E toElement) { method in class:Collections.SynchronizedSortedSet 2221 return new SynchronizedSortedSet<>(ss.headSet(toElemen 2324 public NavigableSet<E> headSet(E toElement) { method in class:Collections.SynchronizedNavigableSet 2341 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:Collections.SynchronizedNavigableSet 3298 public SortedSet<E> headSet(E toElement) { method in class:Collections.CheckedSortedSet 3368 public NavigableSet<E> headSet(E toElement) { method in class:Collections.CheckedNavigableSet 3379 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:Collections.CheckedNavigableSet [all...] |
H A D | TreeMap.java | 1161 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:TreeMap.KeySet 1170 public SortedSet<E> headSet(E toElement) { method in class:TreeMap.KeySet 1171 return headSet(toElement, false);
|
/openjdk9/jdk/test/java/util/Collections/ |
H A D | EmptyNavigableSet.java | 191 * Tests the headSet() method. 196 () -> { NavigableSet ns = navigableSet.headSet(null, false); }, 200 () -> { NavigableSet ns = navigableSet.headSet(new Object(), true); }, 203 NavigableSet ns = navigableSet.headSet("1", false); 313 NavigableSet subSet = navigableSet.headSet(BigInteger.ONE, true); 316 subSet.headSet(BigInteger.ONE, true); 319 NavigableSet ns = subSet.headSet(BigInteger.ONE, false); 323 ns.headSet(BigInteger.ONE, true); 328 subSet.headSet(isDescending(subSet) ? BigInteger.TEN : BigInteger.ZERO, true);
|
H A D | SyncSubMutexes.java | 61 assertSame(getSyncCollectionMutex(instance.headSet("Echo")), getSyncCollectionMutex(instance)); 70 assertSame(getSyncCollectionMutex(instance.headSet("Echo")), getSyncCollectionMutex(instance)); 71 assertSame(getSyncCollectionMutex(instance.headSet("Echo", true)), getSyncCollectionMutex(instance)); 190 instances.add(new Object[] {Collections.synchronizedSortedSet(new TreeSet<>(BASE_COLLECTION)).headSet("Foxtrot")}); 203 instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).headSet("Foxtrot")}); 204 instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).headSet("Foxtrot", true)});
|
/openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListSet.java | 429 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:ConcurrentSkipListSet 457 public NavigableSet<E> headSet(E toElement) { method in class:ConcurrentSkipListSet 458 return headSet(toElement, false);
|
H A D | ConcurrentSkipListMap.java | 2436 public NavigableSet<K> headSet(K toElement, boolean inclusive) { method in class:ConcurrentSkipListMap.KeySet 2445 public NavigableSet<K> headSet(K toElement) { method in class:ConcurrentSkipListMap.KeySet 2446 return headSet(toElement, false);
|
/openjdk9/jdk/test/java/util/NavigableMap/ |
H A D | LockStep.java | 154 ? s.headSet(Integer.MAX_VALUE, true) 155 : s.headSet(Integer.MIN_VALUE, true); 252 equal2(s, s.headSet(z, true)); 257 testEmptySet(s.headSet(a, false)); 260 equal2(s.headSet(a, true), singleton(a)); 344 equalNavigableSetsLeaf(s1.headSet(max, true), 345 s2.headSet(max, true)); 350 equalNavigableSetsLeaf((NavigableSet) s1.headSet(max), 351 (NavigableSet) s2.headSet(max)); 573 s.tailSet(e,true).headSet( [all...] |
/openjdk9/jdk/test/java/util/concurrent/tck/ |
H A D | ConcurrentSkipListSetTest.java | 635 * headSet returns set with keys in requested range 639 SortedSet sm = set.headSet(four); 824 // headSet - pick direction and endpoint inclusion randomly 826 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
|
H A D | TreeSetTest.java | 631 * headSet returns set with keys in requested range 635 SortedSet sm = set.headSet(four); 819 // headSet - pick direction and endpoint inclusion randomly 821 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
|
H A D | ConcurrentSkipListSubSetTest.java | 585 * headSet returns set with keys in requested range 589 SortedSet sm = set.headSet(four); 1084 * headSet returns set with keys in requested range 1088 SortedSet sm = set.headSet(m4);
|
H A D | TreeSubSetTest.java | 582 * headSet returns set with keys in requested range 586 SortedSet sm = set.headSet(four); 1071 * headSet returns set with keys in requested range 1075 SortedSet sm = set.headSet(m4);
|
/openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | HierarchicalLayoutManager.java | 772 SortedSet<LayoutNode> headSet = treeSet.headSet(n); 776 if (!headSet.isEmpty()) { 777 leftNeighbor = headSet.last();
|
/openjdk9/jdk/test/java/util/Collection/ |
H A D | MOAT.java | 975 testNavigableSet(ns.headSet(6, false)); 976 testNavigableSet(ns.headSet(5, true)); 1343 check(m.navigableKeySet().headSet(86, true).remove(k)); }}, 1351 check(m.descendingKeySet().headSet(-86, false).remove(k)); }},
|
/openjdk9/jdk/test/java/util/Spliterator/ |
H A D | SpliteratorTraversingAndSplittingTest.java | 332 public SortedSet<Integer> headSet(Integer toElement) { 333 return s.headSet(toElement);
|