Searched refs:headSet (Results 1 - 11 of 11) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/
H A DSortedSet.java178 SortedSet<E> headSet(E toElement); method in interface:SortedSet
H A DNavigableSet.java52 * null}. Methods {@code subSet}, {@code headSet},
69 * {@link #headSet(Object) headSet(E)}, and
256 NavigableSet<E> headSet(E toElement, boolean inclusive); method in interface:NavigableSet
301 * <p>Equivalent to {@code headSet(toElement, false)}.
307 SortedSet<E> headSet(E toElement); method in interface:NavigableSet
H A DTreeSet.java337 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 DCollections.java1133 * <tt>subSet</tt>, <tt>headSet</tt>, or <tt>tailSet</tt> views, result in
1163 public SortedSet<E> headSet(E toElement) { method in class:Collections.UnmodifiableSortedSet
1164 return new UnmodifiableSortedSet<>(ss.headSet(toElement));
1731 * <tt>headSet</tt>, or <tt>tailSet</tt> views.
1744 * SortedSet s2 = s.headSet(foo);
1794 public SortedSet<E> headSet(E toElement) { method in class:Collections.SynchronizedSortedSet
1796 return new SynchronizedSortedSet<>(ss.headSet(toElement), mutex);
2459 public SortedSet<E> headSet(E toElement) { method in class:Collections.CheckedSortedSet
2460 return checkedSortedSet(ss.headSet(toElement), type);
H A DTreeMap.java1072 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:TreeMap.KeySet
1081 public SortedSet<E> headSet(E toElement) { method in class:TreeMap.KeySet
1082 return headSet(toElement, false);
/openjdk7/jdk/test/java/util/TreeMap/
H A DHeadTailTypeError.java66 m.headSet(new Object());
67 throw new Exception("headSet, natural ordering");
80 m.headSet(new Integer(0));
81 throw new Exception("headSet, explicit comparator");
123 m.headSet(null);
124 throw new Exception("(null endpoint)headSet, natural ordering");
137 m.headSet(null);
138 throw new Exception("(null endpoint)headSet, explicit comparator");
158 s.headSet(new Integer(0));
161 s.headSet("dram
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentSkipListSet.java417 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:ConcurrentSkipListSet
445 public NavigableSet<E> headSet(E toElement) { method in class:ConcurrentSkipListSet
446 return headSet(toElement, false);
H A DConcurrentSkipListMap.java2361 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:ConcurrentSkipListMap.KeySet
2370 public NavigableSet<E> headSet(E toElement) { method in class:ConcurrentSkipListMap.KeySet
2371 return headSet(toElement, false);
/openjdk7/jdk/test/java/util/NavigableMap/
H A DLockStep.java145 ? s.headSet(Integer.MAX_VALUE, true)
146 : s.headSet(Integer.MIN_VALUE, true);
228 equal2(s, s.headSet(z, true));
233 testEmptySet(s.headSet(a, false));
236 equal2(s.headSet(a, true), singleton(a));
312 equalNavigableSetsLeaf(s1.headSet(max, true),
313 s2.headSet(max, true));
318 equalNavigableSetsLeaf((NavigableSet) s1.headSet(max),
319 (NavigableSet) s2.headSet(max));
543 s.tailSet(e,true).headSet(
[all...]
/openjdk7/jdk/test/java/util/Collection/
H A DMOAT.java721 testNavigableSet(ns.headSet(6, false));
722 testNavigableSet(ns.headSet(5, true));
1060 check(m.navigableKeySet().headSet(86, true).remove(k)); }},
1068 check(m.descendingKeySet().headSet(-86, false).remove(k)); }},
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java715 SortedSet<LayoutNode> headSet = treeSet.headSet(n);
719 if (!headSet.isEmpty()) {
720 leftNeighbor = headSet.last();

Completed in 406 milliseconds