| /external/guava/guava/src/com/google/common/collect/ |
| ContiguousSet.java | 50 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) {
51 checkNotNull(fromElement);
53 checkArgument(comparator().compare(fromElement, toElement) <= 0);
54 return subSet(fromElement, true, toElement, false);
57 @Override ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement,
59 checkNotNull(fromElement);
61 checkArgument(comparator().compare(fromElement, toElement) <= 0);
62 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive);
65 @Override public ContiguousSet<C> tailSet(C fromElement) {
66 return tailSet(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 | 50 @Override public SortedSet<E> subSet(E fromElement, E toElement) {
51 return multiset().subMultiset(fromElement, BoundType.CLOSED, toElement,
59 @Override public SortedSet<E> tailSet(E fromElement) {
60 return multiset().tailMultiset(fromElement, BoundType.CLOSED)
127 @Override public SortedMultiset<E> subMultiset(E fromElement,
129 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement,
133 @Override public SortedMultiset<E> tailMultiset(E fromElement,
135 return forwardMultiset().headMultiset(fromElement, boundType)
|
| StandardRowSortedTable.java | 103 public SortedSet<R> subSet(R fromElement, R toElement) {
104 checkNotNull(fromElement);
107 sortedBackingMap().subMap(fromElement, toElement), factory)
112 public SortedSet<R> tailSet(R fromElement) {
113 checkNotNull(fromElement);
115 sortedBackingMap().tailMap(fromElement), factory).rowKeySet();
|
| ImmutableSortedSet.java | 612 * {@code fromElement} smaller than an earlier {@code fromElement}. However,
614 * the original {@code fromElement}. Similarly, this method keeps the
619 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) {
620 return subSet(fromElement, true, toElement, false);
624 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
625 checkNotNull(fromElement);
627 checkArgument(comparator.compare(fromElement, toElement) <= 0);
628 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive);
638 * {@code fromElement} smaller than an earlier {@code fromElement}. However
[all...] |
| EmptyContiguousSet.java | 66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) {
|
| EmptyImmutableSortedSet.java | 111 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
116 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) {
|
| RegularImmutableSortedSet.java | 214 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
215 return tailSetImpl(fromElement, fromInclusive)
220 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) {
224 elements, checkNotNull(fromElement), comparator(), FIRST_PRESENT, NEXT_HIGHER);
227 elements, checkNotNull(fromElement), comparator(), FIRST_AFTER, NEXT_HIGHER);
|
| AbstractSortedMultiset.java | 105 public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement,
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
|
| RegularContiguousSet.java | 56 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement,
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
63 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) {
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
|
| Constraints.java | 178 @Override public SortedSet<E> subSet(E fromElement, E toElement) {
180 delegate.subSet(fromElement, toElement), constraint);
182 @Override public SortedSet<E> tailSet(E fromElement) {
183 return constrainedSortedSet(delegate.tailSet(fromElement), constraint);
|
| AbstractMultimap.java | 692 public SortedSet<V> subSet(V fromElement, V toElement) {
695 getKey(), getSortedSetDelegate().subSet(fromElement, toElement),
700 public SortedSet<V> tailSet(V fromElement) {
703 getKey(), getSortedSetDelegate().tailSet(fromElement),
980 public SortedSet<K> subSet(K fromElement, K toElement) {
981 return new SortedKeySet(sortedMap().subMap(fromElement, toElement));
985 public SortedSet<K> tailSet(K fromElement) {
986 return new SortedKeySet(sortedMap().tailMap(fromElement));
[all...] |
| Sets.java | [all...] |
| Synchronized.java | 260 public SortedSet<E> subSet(E fromElement, E toElement) {
262 return sortedSet(delegate().subSet(fromElement, toElement), mutex);
274 public SortedSet<E> tailSet(E fromElement) {
276 return sortedSet(delegate().tailSet(fromElement), mutex);
|
| /libcore/luni/src/main/java/java/util/ |
| NavigableSet.java | 164 * {@code fromElement} to {@code toElement}. If {@code fromElement} and
174 * @param fromElement low endpoint of the returned set
181 * {@code fromElement}, inclusive, to {@code toElement}, exclusive
182 * @throws ClassCastException if {@code fromElement} and
186 * to, throw this exception if {@code fromElement} or
189 * @throws NullPointerException if {@code fromElement} or
192 * @throws IllegalArgumentException if {@code fromElement} is
194 * has a restricted range, and {@code fromElement} or
197 NavigableSet<E> subSet(E fromElement, boolean fromInclusive
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableSortedSet.java | 333 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) {
334 return subSet(fromElement, true, toElement, false);
337 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement,
339 checkNotNull(fromElement);
341 int cmp = comparator().compare(fromElement, toElement);
342 checkArgument(cmp <= 0, "fromElement (%s) is less than toElement (%s)", fromElement, toElement);
346 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive);
349 public ImmutableSortedSet<E> tailSet(E fromElement) {
350 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 | 54 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement,
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
61 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) {
62 return range.intersection(Ranges.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 delegate.tailSet(checkValid(fromElement), inclusive);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 369 * @throws NullPointerException if {@code fromElement} or
373 public NavigableSet<E> subSet(E fromElement,
378 (m.subMap(fromElement, fromInclusive,
393 * @throws NullPointerException if {@code fromElement} is null
396 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
397 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
402 * @throws NullPointerException if {@code fromElement} or
406 public NavigableSet<E> subSet(E fromElement, E toElement) {
407 return subSet(fromElement, true, toElement, false);
421 * @throws NullPointerException if {@code fromElement} is nul
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ForwardingSortedSetTest.java | 100 @Override public SortedSet<T> subSet(T fromElement, T toElement) {
101 return standardSubSet(fromElement, toElement);
|
| /external/smali/util/src/main/java/org/jf/util/ |
| ArraySortedSet.java | 136 public SortedSet<T> subSet(T fromElement, T toElement) {
146 public SortedSet<T> tailSet(T fromElement) {
|
| /cts/tests/tests/hardware/src/android/hardware/camera2/cts/rs/ |
| AllocationInfo.java | 302 public static ElementInfo fromElement(Element element) {
359 ElementInfo.fromElement(mElement), mUsage);
|
| /external/chromium_org/third_party/WebKit/Source/core/events/ |
| MouseEvent.idl | 59 [MeasureAs=MouseEventFromElement] readonly attribute Node fromElement;
|
| MouseEvent.h | 85 Node* fromElement() const;
|
