| /libcore/luni/src/main/java/java/util/ |
| SortedSet.java | 66 public SortedSet<E> headSet(E end);
|
| NavigableSet.java | 169 NavigableSet<E> headSet(E end, boolean endInclusive);
|
| TreeSet.java | 370 * @see java.util.NavigableSet#headSet(Object, boolean)
374 public NavigableSet<E> headSet(E end, boolean endInclusive) {
445 public SortedSet<E> headSet(E end) {
446 return headSet(end, false);
|
| Collections.java | 934 public SortedSet<E> headSet(E end) {
936 return new SynchronizedSortedSet<E>(ss.headSet(end), mutex);
[all...] |
| TreeMap.java | [all...] |
| /external/guava/src/com/google/common/collect/ |
| ForwardingSortedSet.java | 48 public SortedSet<E> headSet(E toElement) {
49 return delegate().headSet(toElement);
|
| TreeMultiset.java | 163 public SortedSet<E> headSet(E toElement) {
|
| AbstractMultimap.java | 664 public SortedSet<V> headSet(V toElement) {
667 getKey(), getSortedSetDelegate().headSet(toElement),
923 public SortedSet<K> headSet(K toElement) {
[all...] |
| ImmutableSortedSet.java | 48 * <p>The sets returned by {@link #headSet}, {@link #tailSet}, and
592 * <p>The {@link SortedSet#headSet} documentation states that a subset of a
598 public ImmutableSortedSet<E> headSet(E toElement) {
638 * These methods perform most headSet, subSet, and tailSet logic, besides
|
| Synchronized.java | 321 public SortedSet<E> headSet(E toElement) {
323 return sortedSet(delegate().headSet(toElement), mutex);
[all...] |
| /frameworks/base/tests/CoreTests/android/core/ |
| TreeSetTest.java | 254 * Tests performance of the java.util.TreeSet method- headSet(Integer arg0)
263 set = tSet.headSet(value);
264 set = tSet.headSet(value);
265 set = tSet.headSet(value);
266 set = tSet.headSet(value);
267 set = tSet.headSet(value);
268 set = tSet.headSet(value);
269 set = tSet.headSet(value);
270 set = tSet.headSet(value);
271 set = tSet.headSet(value)
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldTreeSetTest.java | 184 * @tests java.util.TreeSet#headSet(java.lang.Object)
189 method = "headSet",
194 // java.util.TreeSet.headSet(java.lang.Object)
195 Set s = ts.headSet(new Integer(100));
200 SortedSet sort = ts.headSet(new Integer(100));
202 sort.headSet(new Integer(101));
209 ts.headSet(this);
216 ts.headSet(null);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 397 public NavigableSet<E> headSet(E toElement, boolean inclusive) {
425 public NavigableSet<E> headSet(E toElement) {
426 return headSet(toElement, false);
|
| ConcurrentSkipListMap.java | [all...] |
| /libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
| ConcurrentSkipListSetTest.java | 595 * headSet returns set with keys in requested range
599 SortedSet sm = set.headSet(four);
771 // headSet - pick direction and endpoint inclusion randomly
773 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
|
| ConcurrentSkipListSubSetTest.java | 558 * headSet returns set with keys in requested range
562 SortedSet sm = set.headSet(four);
1060 * headSet returns set with keys in requested range
1064 SortedSet sm = set.headSet(m4);
|
| /prebuilt/sdk/5/ |
| android.jar | |
| /prebuilt/sdk/7/ |
| android.jar | |
| /prebuilt/sdk/8/ |
| android.jar | |
