| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | TreeMapExtendTest.java | 4169 Set entrySet, tailSet;
4182 tailSet = descendingSubMapEntrySet.tailSet(entry);
4183 tailSetIterator = tailSet.iterator();
4196 tailSet = descendingSubMapEntrySet.tailSet(entry, false);
4197 tailSetIterator = tailSet.iterator();
4210 tailSet = descendingSubMapEntrySet.tailSet(entry, true);
4211 tailSetIterator = tailSet.iterator();
4233 tailSet = descendingSubMapEntrySet.tailSet(entry);
4234 tailSetIterator = tailSet.iterator();
4247 tailSet = descendingSubMapEntrySet.tailSet(entry, false);
[all …]
|
| D | TreeSetTest.java | 299 Set s = ts.tailSet(new Integer(900)); in test_tailSetLjava_lang_Object()
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| D | OldTreeSetTest.java | 223 Set s = ts.tailSet(new Integer(900)); in test_tailSetLjava_lang_Object()
228 SortedSet sort = ts.tailSet(new Integer(101)); in test_tailSetLjava_lang_Object()
231 sort.tailSet(new Integer(100)); in test_tailSetLjava_lang_Object()
238 ts.tailSet(this); in test_tailSetLjava_lang_Object()
245 ts.tailSet(null); in test_tailSetLjava_lang_Object()
|
| D | CollectionsTest.java | 1096 check_unmodifiableSet(set.tailSet(sampleElement), absentElement); in check_unmodifiableNavigableSet()
1123 set.tailSet(element), in check_navigableSet()
1126 set.tailSet(element, true /* inclusive */), in check_navigableSet()
1129 set.tailSet(element, false /* inclusive */), in check_navigableSet()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | NavigableSet.java | 289 NavigableSet<E> tailSet(E fromElement, boolean inclusive); in tailSet() method
322 SortedSet<E> tailSet(E fromElement); in tailSet() method
|
| D | TreeSet.java | 349 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() method in TreeSet
382 public SortedSet<E> tailSet(E fromElement) { in tailSet() method in TreeSet
383 return tailSet(fromElement, true); in tailSet()
|
| D | SortedSet.java | 205 SortedSet<E> tailSet(E fromElement); in tailSet() method
|
| D | Collections.java | 1215 public SortedSet<E> tailSet(E fromElement) { in tailSet() method in UnmodifiableSortedSet
1216 return new UnmodifiableSortedSet<>(ss.tailSet(fromElement)); in tailSet()
1306 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() method in UnmodifiableNavigableSet
1308 ns.tailSet(fromElement, inclusive)); in tailSet()
2265 public SortedSet<E> tailSet(E fromElement) {
2267 return new SynchronizedSortedSet<>(ss.tailSet(fromElement),mutex);
2369 public NavigableSet<E> tailSet(E fromElement) {
2371 return new SynchronizedNavigableSet<>(ns.tailSet(fromElement, true), mutex);
2387 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
2389 return new SynchronizedNavigableSet<>(ns.tailSet(fromElement, inclusive), mutex);
[all …]
|
| D | TreeMap.java | 1194 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() method in TreeMap.KeySet
1203 public SortedSet<E> tailSet(E fromElement) { in tailSet() method in TreeMap.KeySet
1204 return tailSet(fromElement, true); in tailSet()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentSkipListSet.java | 437 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() method in ConcurrentSkipListSet
465 public NavigableSet<E> tailSet(E fromElement) { in tailSet() method in ConcurrentSkipListSet
466 return tailSet(fromElement, true); in tailSet()
|
| D | ConcurrentSkipListMap.java | 2417 public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { in tailSet() method in ConcurrentSkipListMap.KeySet
2426 public NavigableSet<K> tailSet(K fromElement) { in tailSet() method in ConcurrentSkipListMap.KeySet
2427 return tailSet(fromElement, true); in tailSet()
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | ConcurrentSkipListSubSetTest.java | 94 return set.tailSet(m1, true); in set0()
593 SortedSet sm = set.tailSet(two); in testTailSetContents()
611 SortedSet ssm = sm.tailSet(four); in testTailSetContents()
1092 SortedSet sm = set.tailSet(m2); in testDescendingTailSetContents()
1110 SortedSet ssm = sm.tailSet(m4); in testDescendingTailSetContents()
|
| D | TreeSubSetTest.java | 91 return set.tailSet(m1, false); in set0()
590 SortedSet sm = set.tailSet(two); in testTailSetContents()
608 SortedSet ssm = sm.tailSet(four); in testTailSetContents()
1079 SortedSet sm = set.tailSet(m2); in testDescendingTailSetContents()
1097 SortedSet ssm = sm.tailSet(m4); in testDescendingTailSetContents()
|
| D | TreeSetTest.java | 639 SortedSet sm = set.tailSet(two); in testTailSetContents()
657 SortedSet ssm = sm.tailSet(four); in testTailSetContents()
815 NavigableSet<Integer> tm = set.tailSet(midPoint,incl); in bashSubSet()
|
| D | ConcurrentSkipListSetTest.java | 636 SortedSet sm = set.tailSet(two); in testTailSetContents()
654 SortedSet ssm = sm.tailSet(four); in testTailSetContents()
813 NavigableSet<Integer> tm = set.tailSet(midPoint,incl); in bashSubSet()
|