Home
last modified time | relevance | path

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

12

/external/guava/guava/src/com/google/common/collect/
DContiguousSet.java98 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { in subSet() argument
99 checkNotNull(fromElement); in subSet()
101 checkArgument(comparator().compare(fromElement, toElement) <= 0); in subSet()
102 return subSetImpl(fromElement, true, toElement, false); in subSet()
109 @Override public ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, in subSet() argument
111 checkNotNull(fromElement); in subSet()
113 checkArgument(comparator().compare(fromElement, toElement) <= 0); in subSet()
114 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
117 @Override public ContiguousSet<C> tailSet(C fromElement) { in tailSet() argument
118 return tailSetImpl(checkNotNull(fromElement), true); in tailSet()
[all …]
DForwardingNavigableSet.java177 E fromElement, in subSet() argument
181 return delegate().subSet(fromElement, fromInclusive, toElement, toInclusive); in subSet()
191 E fromElement, in standardSubSet() argument
195 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); in standardSubSet()
205 protected SortedSet<E> standardSubSet(E fromElement, E toElement) { in standardSubSet() argument
206 return subSet(fromElement, true, toElement, false); in standardSubSet()
225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
226 return delegate().tailSet(fromElement, inclusive); in tailSet()
235 protected SortedSet<E> standardTailSet(E fromElement) { in standardTailSet() argument
236 return tailSet(fromElement, true); in standardTailSet()
DSortedMultisets.java64 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
65 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet(); in subSet()
72 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
73 return multiset().tailMultiset(fromElement, CLOSED).elementSet(); in tailSet()
136 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
138 fromElement, BoundType.forBoolean(fromInclusive), in subSet()
149 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
151 multiset().tailMultiset(fromElement, BoundType.forBoolean(inclusive))); in tailSet()
DForwardingSortedSet.java86 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
87 return delegate().subSet(fromElement, toElement); in subSet()
91 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
92 return delegate().tailSet(fromElement); in tailSet()
163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) { in standardSubSet() argument
164 return tailSet(fromElement).headSet(toElement); in standardSubSet()
DImmutableSortedSet.java642 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
643 return subSet(fromElement, true, toElement, false); in subSet()
652 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
653 checkNotNull(fromElement); in subSet()
655 checkArgument(comparator.compare(fromElement, toElement) <= 0); in subSet()
656 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
671 public ImmutableSortedSet<E> tailSet(E fromElement) { in tailSet() argument
672 return tailSet(fromElement, true); in tailSet()
680 public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
681 return tailSetImpl(checkNotNull(fromElement), inclusive); in tailSet()
[all …]
DDescendingImmutableSortedSet.java53 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
54 return forward.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); in subSetImpl()
58 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
59 return forward.headSet(fromElement, inclusive).descendingSet(); in tailSetImpl()
DSets.java842 public SortedSet<E> subSet(E fromElement, E toElement) {
843 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
853 public SortedSet<E> tailSet(E fromElement) {
854 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).tailSet(fromElement), predicate);
982 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
984 unfiltered().subSet(fromElement, fromInclusive, toElement, toInclusive), predicate);
993 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
994 return filter(unfiltered().tailSet(fromElement, inclusive), predicate);
1461 E fromElement,
1466 fromElement,
[all …]
DRegularImmutableSortedSet.java231 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
232 return tailSetImpl(fromElement, fromInclusive) in subSetImpl()
237 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
238 return getSubSet(tailIndex(fromElement, inclusive), size()); in tailSetImpl()
241 int tailIndex(E fromElement, boolean inclusive) { in tailIndex() argument
244 checkNotNull(fromElement), in tailIndex()
DDescendingMultiset.java72 @Override public SortedMultiset<E> subMultiset(E fromElement, in subMultiset() argument
74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement, in subMultiset()
78 @Override public SortedMultiset<E> tailMultiset(E fromElement, in tailMultiset() argument
80 return forwardMultiset().headMultiset(fromElement, boundType) in tailMultiset()
DRegularContiguousSet.java54 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
56 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) { in subSetImpl()
61 fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
65 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument
66 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive))); in tailSetImpl()
DAbstractMapBasedMultimap.java666 public SortedSet<V> subSet(V fromElement, V toElement) { in subSet() argument
669 getKey(), getSortedSetDelegate().subSet(fromElement, toElement), in subSet()
674 public SortedSet<V> tailSet(V fromElement) { in tailSet() argument
677 getKey(), getSortedSetDelegate().tailSet(fromElement), in tailSet()
741 V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { in subSet() argument
743 getSortedSetDelegate().subSet(fromElement, fromInclusive, toElement, toInclusive)); in subSet()
752 public NavigableSet<V> tailSet(V fromElement, boolean inclusive) { in tailSet() argument
753 return wrap(getSortedSetDelegate().tailSet(fromElement, inclusive)); in tailSet()
1012 public SortedSet<K> subSet(K fromElement, K toElement) { in subSet() argument
1013 return new SortedKeySet(sortedMap().subMap(fromElement, toElement)); in subSet()
[all …]
DConstraints.java150 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
152 delegate.subSet(fromElement, toElement), constraint); in subSet()
154 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
155 return constrainedSortedSet(delegate.tailSet(fromElement), constraint); in tailSet()
DEmptyImmutableSortedSet.java113 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
118 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
DEmptyContiguousSet.java66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
DMaps.java1011 public SortedSet<E> subSet(E fromElement, E toElement) {
1012 return removeOnlySortedSet(super.subSet(fromElement, toElement));
1016 public SortedSet<E> tailSet(E fromElement) {
1017 return removeOnlySortedSet(super.tailSet(fromElement));
1046 public SortedSet<E> subSet(E fromElement, E toElement) {
1048 super.subSet(fromElement, toElement));
1052 public SortedSet<E> tailSet(E fromElement) {
1053 return removeOnlySortedSet(super.tailSet(fromElement));
1062 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
1063 return removeOnlyNavigableSet(super.tailSet(fromElement, inclusive));
[all …]
DAbstractSortedMultiset.java102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, in subMultiset() argument
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType); in subMultiset()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DContiguousSet.java87 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { in subSet() argument
88 checkNotNull(fromElement); in subSet()
90 checkArgument(comparator().compare(fromElement, toElement) <= 0); in subSet()
91 return subSetImpl(fromElement, true, toElement, false); in subSet()
94 @Override public ContiguousSet<C> tailSet(C fromElement) { in tailSet() argument
95 return tailSetImpl(checkNotNull(fromElement), true); in tailSet()
103 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, in subSetImpl() argument
106 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive); in tailSetImpl() argument
DImmutableSortedSet.java349 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
350 return subSet(fromElement, true, toElement, false); in subSet()
353 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, in subSet() argument
355 checkNotNull(fromElement); in subSet()
357 int cmp = comparator().compare(fromElement, toElement); in subSet()
358 checkArgument(cmp <= 0, "fromElement (%s) is less than toElement (%s)", fromElement, toElement); in subSet()
362 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); in subSet()
365 public ImmutableSortedSet<E> tailSet(E fromElement) { in tailSet() argument
366 checkNotNull(fromElement); in tailSet()
368 return unsafeDelegateSortedSet(sortedDelegate.tailSet(fromElement), true); in tailSet()
[all …]
DSortedMultisets.java61 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
62 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet(); in subSet()
69 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
70 return multiset().tailMultiset(fromElement, CLOSED).elementSet(); in tailSet()
DRegularContiguousSet.java52 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
54 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) { in subSetImpl()
59 fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
63 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument
64 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive))); in tailSetImpl()
DDescendingMultiset.java72 @Override public SortedMultiset<E> subMultiset(E fromElement, in subMultiset() argument
74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement, in subMultiset()
78 @Override public SortedMultiset<E> tailMultiset(E fromElement, in tailMultiset() argument
80 return forwardMultiset().headMultiset(fromElement, boundType) in tailMultiset()
DEmptyContiguousSet.java64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
/external/guava/guava-testlib/src/com/google/common/collect/testing/
DSafeTreeSet.java172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
174 delegate.subSet(checkValid(fromElement), fromInclusive, in subSet()
178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
179 return subSet(fromElement, true, toElement, false); in subSet()
182 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
183 return tailSet(fromElement, true); in tailSet()
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive)); in tailSet()
/external/guava/guava-tests/test/com/google/common/collect/
DSynchronizedNavigableSetTest.java113 @Override public NavigableSet<E> subSet(E fromElement, in subSet() argument
117 fromElement, fromInclusive, toElement, toInclusive); in subSet()
120 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
121 return subSet(fromElement, true, toElement, false); in subSet()
124 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
126 return delegate().tailSet(fromElement, inclusive); in tailSet()
129 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
130 return tailSet(fromElement, true); in tailSet()
DForwardingNavigableSetTest.java102 @Override public SortedSet<T> subSet(T fromElement, T toElement) { in subSet() argument
103 return standardSubSet(fromElement, toElement); in subSet()
142 public SortedSet<T> tailSet(T fromElement) { in tailSet() argument
143 return standardTailSet(fromElement); in tailSet()

12