/libcore/ojluni/src/main/java/java/util/ |
H A D | NavigableSet.java | 197 * {@code fromElement} to {@code toElement}. If {@code fromElement} and 207 * @param fromElement low endpoint of the returned set 214 * {@code fromElement}, inclusive, to {@code toElement}, exclusive 215 * @throws ClassCastException if {@code fromElement} and 219 * to, throw this exception if {@code fromElement} or 222 * @throws NullPointerException if {@code fromElement} or 225 * @throws IllegalArgumentException if {@code fromElement} is 227 * has a restricted range, and {@code fromElement} or 230 NavigableSet<E> subSet(E fromElement, boolea argument 289 tailSet(E fromElement, boolean inclusive) argument 300 subSet(E fromElement, E toElement) argument 322 tailSet(E fromElement) argument [all...] |
H A D | SortedSet.java | 122 * from <tt>fromElement</tt>, inclusive, to <tt>toElement</tt>, 123 * exclusive. (If <tt>fromElement</tt> and <tt>toElement</tt> are 132 * @param fromElement low endpoint (inclusive) of the returned set 135 * <tt>fromElement</tt>, inclusive, to <tt>toElement</tt>, exclusive 136 * @throws ClassCastException if <tt>fromElement</tt> and 140 * to, throw this exception if <tt>fromElement</tt> or 143 * @throws NullPointerException if <tt>fromElement</tt> or 146 * @throws IllegalArgumentException if <tt>fromElement</tt> is 148 * has a restricted range, and <tt>fromElement</tt> or 151 SortedSet<E> subSet(E fromElement, argument 205 tailSet(E fromElement) argument [all...] |
H A D | TreeSet.java | 317 * @throws NullPointerException if {@code fromElement} or {@code toElement} 323 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, argument 325 return new TreeSet<>(m.subMap(fromElement, fromInclusive, 343 * @throws NullPointerException if {@code fromElement} is null and 349 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 350 return new TreeSet<>(m.tailMap(fromElement, inclusive)); 355 * @throws NullPointerException if {@code fromElement} or 360 public SortedSet<E> subSet(E fromElement, E toElement) { argument 361 return subSet(fromElement, true, toElement, false); 377 * @throws NullPointerException if {@code fromElement} i 382 tailSet(E fromElement) argument [all...] |
H A D | Collections.java | 1209 public SortedSet<E> subSet(E fromElement, E toElement) { argument 1210 return new UnmodifiableSortedSet<>(ss.subSet(fromElement,toElement)); 1215 public SortedSet<E> tailSet(E fromElement) { argument 1216 return new UnmodifiableSortedSet<>(ss.tailSet(fromElement)); 1296 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { argument 1298 ns.subSet(fromElement, fromInclusive, toElement, toInclusive)); 1306 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 1308 ns.tailSet(fromElement, inclusive)); 2254 public SortedSet<E> subSet(E fromElement, E toElement) { argument 2257 ss.subSet(fromElement, toElemen 2265 tailSet(E fromElement) argument 2359 subSet(E fromElement, E toElement) argument 2369 tailSet(E fromElement) argument 2375 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 2387 tailSet(E fromElement, boolean inclusive) argument 3332 subSet(E fromElement, E toElement) argument 3338 tailSet(E fromElement) argument 3402 subSet(E fromElement, E toElement) argument 3408 tailSet(E fromElement) argument 3412 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 3420 tailSet(E fromElement, boolean inclusive) argument [all...] |
H A D | TreeMap.java | 1160 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, argument 1162 return new KeySet<>(m.subMap(fromElement, fromInclusive, 1168 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 1169 return new KeySet<>(m.tailMap(fromElement, inclusive)); 1171 public SortedSet<E> subSet(E fromElement, E toElement) { argument 1172 return subSet(fromElement, true, toElement, false); 1177 public SortedSet<E> tailSet(E fromElement) { argument 1178 return tailSet(fromElement, true);
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListSet.java | 410 * @throws NullPointerException if {@code fromElement} or 414 public NavigableSet<E> subSet(E fromElement, argument 419 (m.subMap(fromElement, fromInclusive, 434 * @throws NullPointerException if {@code fromElement} is null 437 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 438 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive)); 443 * @throws NullPointerException if {@code fromElement} or 447 public NavigableSet<E> subSet(E fromElement, E toElement) { argument 448 return subSet(fromElement, true, toElement, false); 462 * @throws NullPointerException if {@code fromElement} i 465 tailSet(E fromElement) argument [all...] |
H A D | ConcurrentSkipListMap.java | 2407 public NavigableSet<K> subSet(K fromElement, argument 2411 return new KeySet<>(m.subMap(fromElement, fromInclusive, 2417 public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { argument 2418 return new KeySet<>(m.tailMap(fromElement, inclusive)); 2420 public NavigableSet<K> subSet(K fromElement, K toElement) { argument 2421 return subSet(fromElement, true, toElement, false); 2426 public NavigableSet<K> tailSet(K fromElement) { argument 2427 return tailSet(fromElement, true);
|