Home
last modified time | relevance | path

Searched refs:fromElement (Results 1 – 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DNavigableSet.java230 NavigableSet<E> subSet(E fromElement, boolean fromInclusive, in subSet() argument
289 NavigableSet<E> tailSet(E fromElement, boolean inclusive); in tailSet() argument
300 SortedSet<E> subSet(E fromElement, E toElement); in subSet() argument
322 SortedSet<E> tailSet(E fromElement); in tailSet() argument
DTreeSet.java323 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, in subSet() argument
325 return new TreeSet<>(m.subMap(fromElement, fromInclusive, in subSet()
349 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
350 return new TreeSet<>(m.tailMap(fromElement, inclusive)); in tailSet()
360 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
361 return subSet(fromElement, true, toElement, false); in subSet()
382 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
383 return tailSet(fromElement, true); in tailSet()
DSortedSet.java151 SortedSet<E> subSet(E fromElement, E toElement); in subSet() argument
205 SortedSet<E> tailSet(E fromElement); in tailSet() argument
DCollections.java1214 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
1215 return new UnmodifiableSortedSet<>(ss.subSet(fromElement,toElement)); in subSet()
1220 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
1221 return new UnmodifiableSortedSet<>(ss.tailSet(fromElement)); in tailSet()
1301 …public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusi… in subSet() argument
1303 ns.subSet(fromElement, fromInclusive, toElement, toInclusive)); in subSet()
1311 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
1313 ns.tailSet(fromElement, inclusive)); in tailSet()
2261 public SortedSet<E> subSet(E fromElement, E toElement) {
2264 ss.subSet(fromElement, toElement), mutex);
[all …]
DTreeMap.java1160 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, in subSet() argument
1162 return new KeySet<>(m.subMap(fromElement, fromInclusive, in subSet()
1168 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
1169 return new KeySet<>(m.tailMap(fromElement, inclusive)); in tailSet()
1171 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
1172 return subSet(fromElement, true, toElement, false); in subSet()
1177 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
1178 return tailSet(fromElement, true); in tailSet()
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentSkipListSet.java414 public NavigableSet<E> subSet(E fromElement, in subSet() argument
419 (m.subMap(fromElement, fromInclusive, in subSet()
437 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
438 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive)); in tailSet()
447 public NavigableSet<E> subSet(E fromElement, E toElement) { in subSet() argument
448 return subSet(fromElement, true, toElement, false); in subSet()
465 public NavigableSet<E> tailSet(E fromElement) { in tailSet() argument
466 return tailSet(fromElement, true); in tailSet()
DConcurrentSkipListMap.java2407 public NavigableSet<K> subSet(K fromElement, in subSet() argument
2411 return new KeySet<>(m.subMap(fromElement, fromInclusive, in subSet()
2417 public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { in tailSet() argument
2418 return new KeySet<>(m.tailMap(fromElement, inclusive)); in tailSet()
2420 public NavigableSet<K> subSet(K fromElement, K toElement) { in subSet() argument
2421 return subSet(fromElement, true, toElement, false); in subSet()
2426 public NavigableSet<K> tailSet(K fromElement) { in tailSet() argument
2427 return tailSet(fromElement, true); in tailSet()
/libcore/ojluni/annotations/hiddenapi/java/util/
DCollections.java1193 public java.util.NavigableSet<E> subSet(E fromElement, E toElement) { in subSet() argument
1201 public java.util.NavigableSet<E> tailSet(E fromElement) { in tailSet() argument
1206 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
1214 public java.util.NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
1375 public java.util.SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
1383 public java.util.SortedSet<E> tailSet(E fromElement) { in tailSet() argument
2686 public java.util.NavigableSet<E> subSet(E fromElement, E toElement) { in subSet() argument
2694 public java.util.NavigableSet<E> tailSet(E fromElement) { in tailSet() argument
2699 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
2707 public java.util.NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
[all …]