| /libcore/ojluni/src/main/java/java/util/ |
| H A D | NavigableSet.java | 197 * {@code fromElement} to {@code toElement}. If {@code fromElement} and
198 * {@code toElement} are equal, the returned set is empty unless {@code
210 * @param toElement high endpoint of the returned set
214 * {@code fromElement}, inclusive, to {@code toElement}, exclusive
216 * {@code toElement} cannot be compared to one another using this
220 * {@code toElement} cannot be compared to elements currently in
223 * {@code toElement} is null and this set does
226 * greater than {@code toElement}; or if this set itself
228 * {@code toElement} lies outside the bounds of the range.
231 E toElement, boolea
230 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
260 headSet(E toElement, boolean inclusive) argument
300 subSet(E fromElement, E toElement) argument
311 headSet(E toElement) 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
133 * @param toElement high endpoint (exclusive) of the returned set
135 * <tt>fromElement</tt>, inclusive, to <tt>toElement</tt>, exclusive
137 * <tt>toElement</tt> cannot be compared to one another using this
141 * <tt>toElement</tt> cannot be compared to elements currently in
144 * <tt>toElement</tt> is null and this set does not permit null
147 * greater than <tt>toElement</tt>; or if this set itself
149 * <tt>toElement</tt> lies outside the bounds of the range
151 SortedSet<E> subSet(E fromElement, E toElement); argument
178 headSet(E toElement) argument
[all...] |
| H A D | TreeSet.java | 317 * @throws NullPointerException if {@code fromElement} or {@code toElement}
324 E toElement, boolean toInclusive) {
326 toElement, toInclusive));
331 * @throws NullPointerException if {@code toElement} is null and
337 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
338 return new TreeSet<>(m.headMap(toElement, inclusive));
356 * {@code toElement} is null and this set uses natural ordering,
360 public SortedSet<E> subSet(E fromElement, E toElement) { argument
361 return subSet(fromElement, true, toElement, false);
366 * @throws NullPointerException if {@code toElement} i
323 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
371 headSet(E toElement) 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));
1212 public SortedSet<E> headSet(E toElement) { argument
1213 return new UnmodifiableSortedSet<>(ss.headSet(toElement));
1296 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { argument
1298 ns.subSet(fromElement, fromInclusive, toElement, toInclusive));
1301 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
1303 ns.headSet(toElement, inclusive));
2254 public SortedSet<E> subSet(E fromElement, E toElement) { argument
2257 ss.subSet(fromElement, toElement), mute
2260 headSet(E toElement) argument
2359 subSet(E fromElement, E toElement) argument
2364 headSet(E toElement) argument
2375 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
2381 headSet(E toElement, boolean inclusive) argument
3332 subSet(E fromElement, E toElement) argument
3335 headSet(E toElement) argument
3402 subSet(E fromElement, E toElement) argument
3405 headSet(E toElement) argument
3412 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
3416 headSet(E toElement, boolean inclusive) argument
[all...] |
| H A D | TreeMap.java | 1161 E toElement, boolean toInclusive) {
1163 toElement, toInclusive));
1165 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
1166 return new KeySet<>(m.headMap(toElement, inclusive));
1171 public SortedSet<E> subSet(E fromElement, E toElement) { argument
1172 return subSet(fromElement, true, toElement, false);
1174 public SortedSet<E> headSet(E toElement) { argument
1175 return headSet(toElement, false);
1160 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListSet.java | 411 * {@code toElement} is null
416 E toElement,
420 toElement, toInclusive));
425 * @throws NullPointerException if {@code toElement} is null
428 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
429 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive));
444 * {@code toElement} is null
447 public NavigableSet<E> subSet(E fromElement, E toElement) { argument
448 return subSet(fromElement, true, toElement, false);
453 * @throws NullPointerException if {@code toElement} i
414 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
456 headSet(E toElement) argument
[all...] |
| H A D | ConcurrentSkipListMap.java | 2409 K toElement,
2412 toElement, toInclusive));
2414 public NavigableSet<K> headSet(K toElement, boolean inclusive) { argument
2415 return new KeySet<>(m.headMap(toElement, inclusive));
2420 public NavigableSet<K> subSet(K fromElement, K toElement) { argument
2421 return subSet(fromElement, true, toElement, false);
2423 public NavigableSet<K> headSet(K toElement) { argument
2424 return headSet(toElement, false);
2407 subSet(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) argument
|