Searched refs:fromElement (Results 1 - 25 of 58) sorted by relevance

123

/external/guava/guava/src/com/google/common/collect/
H A DForwardingNavigableSet.java177 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) { argument
206 return subSet(fromElement, true, toElement, false);
225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
226 return delegate().tailSet(fromElement, inclusive);
235 protected SortedSet<E> standardTailSet(E fromElement) { argument
236 return tailSet(fromElement, tru
176 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
190 standardSubSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
[all...]
H A DContiguousSet.java98 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { argument
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, argument
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) { argument
118 return tailSetImpl(checkNotNull(fromElement), tru
125 tailSet(C fromElement, boolean inclusive) argument
134 subSetImpl(C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
137 tailSetImpl(C fromElement, boolean inclusive) argument
[all...]
H A DForwardingSortedSet.java86 public SortedSet<E> subSet(E fromElement, E toElement) { argument
87 return delegate().subSet(fromElement, toElement);
91 public SortedSet<E> tailSet(E fromElement) { argument
92 return delegate().tailSet(fromElement);
163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) { argument
164 return tailSet(fromElement).headSet(toElement);
H A DSortedMultisets.java64 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
65 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet();
72 @Override public SortedSet<E> tailSet(E fromElement) { argument
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) { argument
151 multiset().tailMultiset(fromElement, BoundType.forBoolean(inclusive)));
135 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DDescendingImmutableSortedSet.java53 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) { argument
59 return forward.headSet(fromElement, inclusive).descendingSet();
52 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DDescendingMultiset.java72 @Override public SortedMultiset<E> subMultiset(E fromElement, argument
74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement,
78 @Override public SortedMultiset<E> tailMultiset(E fromElement, argument
80 return forwardMultiset().headMultiset(fromElement, boundType)
H A DImmutableSortedSet.java635 * {@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) { argument
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} smalle
651 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
671 tailSet(E fromElement) argument
680 tailSet(E fromElement, boolean inclusive) argument
690 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
693 tailSetImpl(E fromElement, boolean inclusive) argument
[all...]
H A DEmptyImmutableSortedSet.java113 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
118 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
112 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DRegularImmutableSortedSet.java231 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
232 return tailSetImpl(fromElement, fromInclusive)
237 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
238 return getSubSet(tailIndex(fromElement, inclusive), size());
241 int tailIndex(E fromElement, boolean inclusive) { argument
244 checkNotNull(fromElement),
230 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DRegularContiguousSet.java54 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, argument
56 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
61 fromElement, BoundType.forBoolean(fromInclusive),
65 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
66 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive)));
H A DSets.java842 public SortedSet<E> subSet(E fromElement, E toElement) { argument
843 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
853 public SortedSet<E> tailSet(E fromElement) { argument
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) { argument
994 return filter(unfiltered().tailSet(fromElement, inclusive), predicate);
1461 E fromElement,
1466 fromElement,
981 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
1460 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
1478 tailSet(E fromElement, boolean inclusive) argument
1619 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
1633 tailSet(E fromElement, boolean inclusive) argument
1669 subSet(E fromElement, E toElement) argument
1674 tailSet(E fromElement) argument
[all...]
H A DAbstractSortedMultiset.java102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, argument
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
H A DEmptyContiguousSet.java66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { argument
65 subSetImpl( C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
H A DAbstractMapBasedMultimap.java666 public SortedSet<V> subSet(V fromElement, V toElement) { argument
669 getKey(), getSortedSetDelegate().subSet(fromElement, toElement),
674 public SortedSet<V> tailSet(V fromElement) { argument
677 getKey(), getSortedSetDelegate().tailSet(fromElement),
741 V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) {
743 getSortedSetDelegate().subSet(fromElement, fromInclusive, toElement, toInclusive));
752 public NavigableSet<V> tailSet(V fromElement, boolean inclusive) { argument
753 return wrap(getSortedSetDelegate().tailSet(fromElement, inclusive));
1012 public SortedSet<K> subSet(K fromElement, K toElement) { argument
1013 return new SortedKeySet(sortedMap().subMap(fromElement, toElemen
740 subSet( V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) argument
1017 tailSet(K fromElement) argument
1084 subSet(K fromElement, K toElement) argument
1089 subSet( K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) argument
1096 tailSet(K fromElement) argument
1101 tailSet(K fromElement, boolean inclusive) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DContiguousSet.java87 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { argument
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) { argument
95 return tailSetImpl(checkNotNull(fromElement), true);
103 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, argument
106 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive); argument
H A DSortedMultisets.java61 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
62 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet();
69 @Override public SortedSet<E> tailSet(E fromElement) { argument
70 return multiset().tailMultiset(fromElement, CLOSED).elementSet();
H A DDescendingMultiset.java72 @Override public SortedMultiset<E> subMultiset(E fromElement, argument
74 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement,
78 @Override public SortedMultiset<E> tailMultiset(E fromElement, argument
80 return forwardMultiset().headMultiset(fromElement, boundType)
H A DImmutableSortedSet.java349 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { argument
350 return subSet(fromElement, true, toElement, false);
353 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, argument
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) { argument
366 checkNotNull(fromElement);
374 tailSet(E fromElement, boolean inclusive) argument
[all...]
H A DEmptyContiguousSet.java64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { argument
63 subSetImpl( C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
H A DRegularContiguousSet.java52 @Override ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, argument
54 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
59 fromElement, BoundType.forBoolean(fromInclusive),
63 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
64 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive)));
H A DAbstractSortedMultiset.java102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, argument
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSafeTreeSet.java172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
174 delegate.subSet(checkValid(fromElement), fromInclusive,
178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
179 return subSet(fromElement, true, toElement, false);
182 @Override public SortedSet<E> tailSet(E fromElement) { argument
183 return tailSet(fromElement, true);
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive));
171 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
/external/guava/guava-tests/test/com/google/common/collect/
H A DSynchronizedNavigableSetTest.java113 @Override public NavigableSet<E> subSet(E fromElement, argument
117 fromElement, fromInclusive, toElement, toInclusive);
120 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
121 return subSet(fromElement, true, toElement, false);
124 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
126 return delegate().tailSet(fromElement, inclusive);
129 @Override public SortedSet<E> tailSet(E fromElement) { argument
130 return tailSet(fromElement, true);
H A DForwardingNavigableSetTest.java102 @Override public SortedSet<T> subSet(T fromElement, T toElement) { argument
103 return standardSubSet(fromElement, toElement);
142 public SortedSet<T> tailSet(T fromElement) { argument
143 return standardTailSet(fromElement);
H A DForwardingSortedSetTest.java100 @Override public SortedSet<T> subSet(T fromElement, T toElement) { argument
101 return standardSubSet(fromElement, toElement);

Completed in 308 milliseconds

123