| /libcore/luni/src/main/java/java/util/ |
| SortedSet.java | 118 public SortedSet<E> tailSet(E start);
|
| NavigableSet.java | 191 NavigableSet<E> tailSet(E start, boolean startInclusive);
|
| TreeSet.java | 388 * @see java.util.NavigableSet#tailSet(Object, boolean)
392 public NavigableSet<E> tailSet(E start, boolean startInclusive) {
468 public SortedSet<E> tailSet(E start) {
469 return tailSet(start, true);
|
| Collections.java | 953 public SortedSet<E> tailSet(E start) {
955 return new SynchronizedSortedSet<E>(ss.tailSet(start), mutex);
[all...] |
| TreeMap.java | [all...] |
| /external/guava/src/com/google/common/collect/ |
| ForwardingSortedSet.java | 60 public SortedSet<E> tailSet(E fromElement) {
61 return delegate().tailSet(fromElement);
|
| TreeMultiset.java | 172 public SortedSet<E> tailSet(E fromElement) {
|
| AbstractMultimap.java | 678 public SortedSet<V> tailSet(V fromElement) {
681 getKey(), getSortedSetDelegate().tailSet(fromElement),
935 public SortedSet<K> tailSet(K fromElement) {
[all...] |
| ImmutableSortedSet.java | 48 * <p>The sets returned by {@link #headSet}, {@link #tailSet}, and
627 * <p>The {@link SortedSet#tailSet} documentation states that a subset of a
633 public ImmutableSortedSet<E> tailSet(E fromElement) {
638 * These methods perform most headSet, subSet, and tailSet logic, besides
|
| Synchronized.java | 327 public SortedSet<E> tailSet(E fromElement) {
329 return sortedSet(delegate().tailSet(fromElement), mutex);
[all...] |
| /frameworks/base/tests/CoreTests/android/core/ |
| TreeSetTest.java | 305 * Tests performance of tailSet(Integer arg0) - TreeSet
314 set = tSet.tailSet(value);
315 set = tSet.tailSet(value);
316 set = tSet.tailSet(value);
317 set = tSet.tailSet(value);
318 set = tSet.tailSet(value);
319 set = tSet.tailSet(value);
320 set = tSet.tailSet(value);
321 set = tSet.tailSet(value);
322 set = tSet.tailSet(value)
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldTreeSetTest.java | 297 * @tests java.util.TreeSet#tailSet(java.lang.Object)
302 method = "tailSet",
307 // java.util.TreeSet.tailSet(java.lang.Object)
308 Set s = ts.tailSet(new Integer(900));
313 SortedSet sort = ts.tailSet(new Integer(101));
316 sort.tailSet(new Integer(100));
323 ts.tailSet(this);
330 ts.tailSet(null);
|
| /development/tools/idegen/src/ |
| Eclipse.java | 122 SortedSet<File> nextRoots = c.sourceRoots.tailSet(sourceRoot);
146 SortedSet<File> excludedDirs = c.excludedDirs.tailSet(sourceRoot);
|
| Configuration.java | 232 SortedSet<File> tailSet = excludedDirs.tailSet(sourceRoot);
233 for (File file : tailSet) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 406 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
434 public NavigableSet<E> tailSet(E fromElement) {
435 return tailSet(fromElement, true);
|
| ConcurrentSkipListMap.java | [all...] |
| /libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
| ConcurrentSkipListSubSetTest.java | 82 return set.tailSet(m1, true);
584 * tailSet returns set with keys in requested range
588 SortedSet sm = set.tailSet(two);
606 SortedSet ssm = sm.tailSet(four);
1086 * tailSet returns set with keys in requested range
1090 SortedSet sm = set.tailSet(m2);
1108 SortedSet ssm = sm.tailSet(m4);
|
| ConcurrentSkipListSetTest.java | 621 * tailSet returns set with keys in requested range
625 SortedSet sm = set.tailSet(two);
643 SortedSet ssm = sm.tailSet(four);
788 // tailSet - pick direction and endpoint inclusion randomly
790 NavigableSet<Integer> tm = set.tailSet(midPoint,incl);
|
| /frameworks/base/services/java/com/android/server/ |
| DropBoxManagerService.java | 253 for (EntryFile entry : list.contents.tailSet(new EntryFile(millis + 1))) {
607 SortedSet<EntryFile> tail = mAllFiles.contents.tailSet(new EntryFile(t + 10000));
|
| /prebuilt/sdk/5/ |
| android.jar | |
| /prebuilt/sdk/7/ |
| android.jar | |
| /prebuilt/sdk/8/ |
| android.jar | |
