/libcore/ojluni/src/main/java/java/util/ |
NavigableSet.java | 196 * {@code fromElement} to {@code toElement}. If {@code fromElement} and 206 * @param fromElement low endpoint of the returned set 213 * {@code fromElement}, inclusive, to {@code toElement}, exclusive 214 * @throws ClassCastException if {@code fromElement} and 218 * to, throw this exception if {@code fromElement} or 221 * @throws NullPointerException if {@code fromElement} or 224 * @throws IllegalArgumentException if {@code fromElement} is 226 * has a restricted range, and {@code fromElement} or 229 NavigableSet<E> subSet(E fromElement, boolean fromInclusive [all...] |
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, E toElement) [all...] |
TreeSet.java | 317 * @throws NullPointerException if {@code fromElement} or {@code toElement} 323 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, 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) { 350 return new TreeSet<>(m.tailMap(fromElement, inclusive)); 355 * @throws NullPointerException if {@code fromElement} or 360 public SortedSet<E> subSet(E fromElement, E toElement) { 361 return subSet(fromElement, true, toElement, false); 377 * @throws NullPointerException if {@code fromElement} is nul [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ForwardingNavigableSet.java | 177 E fromElement, 181 return delegate().subSet(fromElement, fromInclusive, toElement, toInclusive); 191 E fromElement, 195 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); 205 protected SortedSet<E> standardSubSet(E fromElement, E toElement) { 206 return subSet(fromElement, true, toElement, false); 225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 226 return delegate().tailSet(fromElement, inclusive); 235 protected SortedSet<E> standardTailSet(E fromElement) { 236 return tailSet(fromElement, true) [all...] |
ContiguousSet.java | 98 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { 99 checkNotNull(fromElement); 101 checkArgument(comparator().compare(fromElement, toElement) <= 0); 102 return subSetImpl(fromElement, true, toElement, false); 109 @Override public ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, 111 checkNotNull(fromElement); 113 checkArgument(comparator().compare(fromElement, toElement) <= 0); 114 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); 117 @Override public ContiguousSet<C> tailSet(C fromElement) { 118 return tailSetImpl(checkNotNull(fromElement), true) [all...] |
ForwardingSortedSet.java | 86 public SortedSet<E> subSet(E fromElement, E toElement) { 87 return delegate().subSet(fromElement, toElement); 91 public SortedSet<E> tailSet(E fromElement) { 92 return delegate().tailSet(fromElement); 163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) { 164 return tailSet(fromElement).headSet(toElement);
|
SortedMultisets.java | 64 @Override public SortedSet<E> subSet(E fromElement, E toElement) { 65 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet(); 72 @Override public SortedSet<E> tailSet(E fromElement) { 73 return multiset().tailMultiset(fromElement, CLOSED).elementSet(); 136 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 138 fromElement, BoundType.forBoolean(fromInclusive), 149 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 151 multiset().tailMultiset(fromElement, BoundType.forBoolean(inclusive)));
|
DescendingImmutableSortedSet.java | 53 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 54 return forward.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); 58 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { 59 return forward.headSet(fromElement, inclusive).descendingSet();
|
DescendingMultiset.java | 72 @Override public SortedMultiset<E> subMultiset(E fromElement, 74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement, 78 @Override public SortedMultiset<E> tailMultiset(E fromElement, 80 return forwardMultiset().headMultiset(fromElement, boundType)
|
ImmutableSortedSet.java | 635 * {@code fromElement} smaller than an earlier {@code fromElement}. However, 637 * the original {@code fromElement}. Similarly, this method keeps the 642 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { 643 return subSet(fromElement, true, toElement, false); 652 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 653 checkNotNull(fromElement); 655 checkArgument(comparator.compare(fromElement, toElement) <= 0); 656 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); 666 * {@code fromElement} smaller than an earlier {@code fromElement}. However [all...] |
EmptyImmutableSortedSet.java | 113 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 118 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) {
|
RegularImmutableSortedSet.java | 231 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 232 return tailSetImpl(fromElement, fromInclusive) 237 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { 238 return getSubSet(tailIndex(fromElement, inclusive), size()); 241 int tailIndex(E fromElement, boolean inclusive) { 244 checkNotNull(fromElement),
|
RegularContiguousSet.java | 54 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, 56 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) { 61 fromElement, BoundType.forBoolean(fromInclusive), 65 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { 66 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive)));
|
Sets.java | [all...] |
AbstractSortedMultiset.java | 102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, 107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
|
EmptyContiguousSet.java | 66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { 70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) {
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
ContiguousSet.java | 87 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { 88 checkNotNull(fromElement); 90 checkArgument(comparator().compare(fromElement, toElement) <= 0); 91 return subSetImpl(fromElement, true, toElement, false); 94 @Override public ContiguousSet<C> tailSet(C fromElement) { 95 return tailSetImpl(checkNotNull(fromElement), true); 103 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, 106 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive);
|
SortedMultisets.java | 61 @Override public SortedSet<E> subSet(E fromElement, E toElement) { 62 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet(); 69 @Override public SortedSet<E> tailSet(E fromElement) { 70 return multiset().tailMultiset(fromElement, CLOSED).elementSet();
|
DescendingMultiset.java | 72 @Override public SortedMultiset<E> subMultiset(E fromElement, 74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement, 78 @Override public SortedMultiset<E> tailMultiset(E fromElement, 80 return forwardMultiset().headMultiset(fromElement, boundType)
|
ImmutableSortedSet.java | 349 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { 350 return subSet(fromElement, true, toElement, false); 353 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, 355 checkNotNull(fromElement); 357 int cmp = comparator().compare(fromElement, toElement); 358 checkArgument(cmp <= 0, "fromElement (%s) is less than toElement (%s)", fromElement, toElement); 362 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); 365 public ImmutableSortedSet<E> tailSet(E fromElement) { 366 checkNotNull(fromElement); [all...] |
EmptyContiguousSet.java | 64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { 68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) {
|
RegularContiguousSet.java | 52 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, 54 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) { 59 fromElement, BoundType.forBoolean(fromInclusive), 63 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { 64 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive)));
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
SafeTreeSet.java | 172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 174 delegate.subSet(checkValid(fromElement), fromInclusive, 178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { 179 return subSet(fromElement, true, toElement, false); 182 @Override public SortedSet<E> tailSet(E fromElement) { 183 return tailSet(fromElement, true); 186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive));
|
/external/guava/guava-tests/test/com/google/common/collect/ |
SynchronizedNavigableSetTest.java | 113 @Override public NavigableSet<E> subSet(E fromElement, 117 fromElement, fromInclusive, toElement, toInclusive); 120 @Override public SortedSet<E> subSet(E fromElement, E toElement) { 121 return subSet(fromElement, true, toElement, false); 124 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 126 return delegate().tailSet(fromElement, inclusive); 129 @Override public SortedSet<E> tailSet(E fromElement) { 130 return tailSet(fromElement, true);
|
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentSkipListSet.java | 381 * @throws NullPointerException if {@code fromElement} or 385 public NavigableSet<E> subSet(E fromElement, 390 (m.subMap(fromElement, fromInclusive, 405 * @throws NullPointerException if {@code fromElement} is null 408 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 409 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive)); 414 * @throws NullPointerException if {@code fromElement} or 418 public NavigableSet<E> subSet(E fromElement, E toElement) { 419 return subSet(fromElement, true, toElement, false); 433 * @throws NullPointerException if {@code fromElement} is nul [all...] |