| /libcore/luni/src/main/java/java/util/ |
| H A D | SortedSet.java | 66 public SortedSet<E> headSet(E end); method in interface:SortedSet
|
| H A D | NavigableSet.java | 27 * null}. Methods {@code subSet}, {@code headSet},
44 * {@link #headSet(Object) headSet(E)}, and
227 NavigableSet<E> headSet(E toElement, boolean inclusive); method in interface:NavigableSet
272 * <p>Equivalent to {@code headSet(toElement, false)}.
278 SortedSet<E> headSet(E toElement); method in interface:NavigableSet
|
| H A D | TreeSet.java | 370 * @see java.util.NavigableSet#headSet(Object, boolean)
374 public NavigableSet<E> headSet(E end, boolean endInclusive) { method in class:TreeSet
445 public SortedSet<E> headSet(E end) { method in class:TreeSet
446 return headSet(end, false);
|
| H A D | Collections.java | 886 @Override public SortedSet<E> headSet(E end) { method in class:Collections.SynchronizedSortedSet
888 return new SynchronizedSortedSet<E>(ss.headSet(end), mutex);
1376 @Override public SortedSet<E> headSet(E before) { method in class:Collections.UnmodifiableSortedSet
1377 return new UnmodifiableSortedSet<E>(ss.headSet(before));
3341 @Override public SortedSet<E> headSet(E toElement) { method in class:Collections.CheckedSortedSet
3342 return new CheckedSortedSet<E>(ss.headSet(toElement), type);
|
| H A D | TreeMap.java | 1038 public NavigableSet<K> headSet(K to, boolean inclusive) { method in class:TreeMap.KeySet
1042 public SortedSet<K> headSet(K toExclusive) { method in class:TreeMap.KeySet
1622 public NavigableSet<K> headSet(K to, boolean inclusive) { method in class:TreeMap.BoundedMap.BoundedKeySet
1626 public SortedSet<K> headSet(K toExclusive) { method in class:TreeMap.BoundedMap.BoundedKeySet
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | TreeMapExtendTest.java | 3945 Set entrySet, headSet;
3958 headSet = descendingSubMapEntrySet.headSet(entry);
3959 headSetIterator = headSet.iterator();
3971 headSet = descendingSubMapEntrySet.headSet(entry, false);
3972 headSetIterator = headSet.iterator();
3984 headSet = descendingSubMapEntrySet.headSet(entry, true);
3985 headSetIterator = headSet
[all...] |
| H A D | TreeSetTest.java | 192 * java.util.TreeSet#headSet(java.lang.Object)
196 // java.util.TreeSet.headSet(java.lang.Object)
197 Set s = ts.headSet(new Integer(100));
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | OldTreeSetTest.java | 136 // java.util.TreeSet.headSet(java.lang.Object)
137 Set s = ts.headSet(new Integer(100));
142 SortedSet sort = ts.headSet(new Integer(100));
144 sort.headSet(new Integer(101));
151 ts.headSet(this);
158 ts.headSet(null);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListSet.java | 387 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:ConcurrentSkipListSet
415 public NavigableSet<E> headSet(E toElement) { method in class:ConcurrentSkipListSet
416 return headSet(toElement, false);
|
| H A D | ConcurrentSkipListMap.java | 2332 public NavigableSet<E> headSet(E toElement, boolean inclusive) { method in class:ConcurrentSkipListMap.KeySet
2341 public NavigableSet<E> headSet(E toElement) { method in class:ConcurrentSkipListMap.KeySet
2342 return headSet(toElement, false);
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | ConcurrentSkipListSetTest.java | 603 * headSet returns set with keys in requested range
607 SortedSet sm = set.headSet(four);
791 // headSet - pick direction and endpoint inclusion randomly
793 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
|
| H A D | TreeSetTest.java | 608 * headSet returns set with keys in requested range
612 SortedSet sm = set.headSet(four);
795 // headSet - pick direction and endpoint inclusion randomly
797 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
|
| H A D | ConcurrentSkipListSubSetTest.java | 566 * headSet returns set with keys in requested range
570 SortedSet sm = set.headSet(four);
1066 * headSet returns set with keys in requested range
1070 SortedSet sm = set.headSet(m4);
|
| H A D | TreeSubSetTest.java | 558 * headSet returns set with keys in requested range
562 SortedSet sm = set.headSet(four);
1048 * headSet returns set with keys in requested range
1052 SortedSet sm = set.headSet(m4);
|
| /libcore/benchmarks/libs/ |
| H A D | caliper.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ... |