/external/guava/guava/src/com/google/common/collect/ |
H A D | ContiguousSet.java | 98 @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 D | ForwardingSortedSet.java | 86 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 D | 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) { argument 59 return forward.headSet(fromElement, inclusive).descendingSet(); 52 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | SortedMultisets.java | 63 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument 64 return multiset().subMultiset(fromElement, CLOSED, toElement, OPEN).elementSet(); 71 @Override public SortedSet<E> tailSet(E fromElement) { argument 72 return multiset().tailMultiset(fromElement, CLOSED).elementSet();
|
H A D | DescendingMultiset.java | 72 @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 D | ImmutableSortedSet.java | 633 * {@code fromElement} smaller than an earlier {@code fromElement}. However, 635 * the original {@code fromElement}. Similarly, this method keeps the 640 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { argument 641 return subSet(fromElement, true, toElement, false); 649 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 650 checkNotNull(fromElement); 652 checkArgument(comparator.compare(fromElement, toElement) <= 0); 653 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); 663 * {@code fromElement} smalle 648 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 668 tailSet(E fromElement) argument 676 tailSet(E fromElement, boolean inclusive) argument 686 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 689 tailSetImpl(E fromElement, boolean inclusive) argument [all...] |
H A D | EmptyImmutableSortedSet.java | 113 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 D | RegularImmutableSortedSet.java | 231 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 D | RegularContiguousSet.java | 54 @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 D | AbstractSortedMultiset.java | 102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, argument 107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
|
H A D | EmptyContiguousSet.java | 66 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 D | Constraints.java | 186 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument 188 delegate.subSet(fromElement, toElement), constraint); 190 @Override public SortedSet<E> tailSet(E fromElement) { argument 191 return constrainedSortedSet(delegate.tailSet(fromElement), constraint);
|
H A D | AbstractMapBasedMultimap.java | 664 public SortedSet<V> subSet(V fromElement, V toElement) { argument 667 getKey(), getSortedSetDelegate().subSet(fromElement, toElement), 672 public SortedSet<V> tailSet(V fromElement) { argument 675 getKey(), getSortedSetDelegate().tailSet(fromElement), 935 public SortedSet<K> subSet(K fromElement, K toElement) { argument 936 return new SortedKeySet(sortedMap().subMap(fromElement, toElement)); 940 public SortedSet<K> tailSet(K fromElement) { argument 941 return new SortedKeySet(sortedMap().tailMap(fromElement));
|
H A D | Maps.java | 896 public SortedSet<E> subSet(E fromElement, E toElement) { 897 return removeOnlySortedSet(super.subSet(fromElement, toElement)); 901 public SortedSet<E> tailSet(E fromElement) { 902 return removeOnlySortedSet(super.tailSet(fromElement)); 2305 public SortedSet<K> subSet(K fromElement, K toElement) { argument 2306 return (SortedSet<K>) subMap(fromElement, toElement).keySet(); 2315 public SortedSet<K> tailSet(K fromElement) { argument 2316 return (SortedSet<K>) tailMap(fromElement).keySet(); 2677 public SortedSet<K> subSet(K fromElement, K toElement) { argument 2678 return new SortedKeySet<K, V>(map().subMap(fromElement, toElemen 2687 tailSet(K fromElement) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ContiguousSet.java | 87 @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 D | SortedMultisets.java | 61 @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 D | DescendingMultiset.java | 72 @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 D | ImmutableSortedSet.java | 349 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 D | EmptyContiguousSet.java | 64 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 D | RegularContiguousSet.java | 52 @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 D | AbstractSortedMultiset.java | 102 public SortedMultiset<E> subMultiset(@Nullable E fromElement, BoundType fromBoundType, argument 107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
|
H A D | AbstractMapBasedMultimap.java | 663 public SortedSet<V> subSet(V fromElement, V toElement) { argument 666 getKey(), getSortedSetDelegate().subSet(fromElement, toElement), 671 public SortedSet<V> tailSet(V fromElement) { argument 674 getKey(), getSortedSetDelegate().tailSet(fromElement), 934 public SortedSet<K> subSet(K fromElement, K toElement) { argument 935 return new SortedKeySet(sortedMap().subMap(fromElement, toElement)); 939 public SortedSet<K> tailSet(K fromElement) { argument 940 return new SortedKeySet(sortedMap().tailMap(fromElement));
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | SafeTreeSet.java | 130 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument 131 return new SafeTreeSet<E>(delegate.subSet(checkValid(fromElement), checkValid(toElement))); 134 @Override public SortedSet<E> tailSet(E fromElement) { argument 135 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement)));
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ForwardingSortedSetTest.java | 100 @Override public SortedSet<T> subSet(T fromElement, T toElement) { argument 101 return standardSubSet(fromElement, toElement);
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | ArraySortedSet.java | 136 public SortedSet<T> subSet(T fromElement, T toElement) { argument 146 public SortedSet<T> tailSet(T fromElement) { argument
|