/external/guava/guava/src/com/google/common/collect/ |
H A D | ContiguousSet.java | 109 @Override public ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, argument 114 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); 134 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, argument
|
H A D | DescendingImmutableSortedSet.java | 53 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 54 return forward.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); 52 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
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 | EmptyImmutableSortedSet.java | 113 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 112 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | ForwardingNavigableSet.java | 178 boolean fromInclusive, 181 return delegate().subSet(fromElement, fromInclusive, toElement, toInclusive); 192 boolean fromInclusive, 195 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); 176 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 190 standardSubSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | SortedMultisets.java | 136 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 138 fromElement, BoundType.forBoolean(fromInclusive), 135 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | ForwardingNavigableMap.java | 367 public NavigableMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { argument 368 return delegate().subMap(fromKey, fromInclusive, toKey, toInclusive);
|
H A D | ImmutableRangeSet.java | 449 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { 450 if (!fromInclusive && !toInclusive && Range.compareOrThrow(fromElement, toElement) == 0) { 454 fromElement, BoundType.forBoolean(fromInclusive), 448 subSetImpl( C fromElement, boolean fromInclusive, C 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),
|
H A D | RegularImmutableSortedSet.java | 231 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 232 return tailSetImpl(fromElement, fromInclusive) 230 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | TreeRangeSet.java | 272 Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) { 274 fromKey, BoundType.forBoolean(fromInclusive), 433 Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) { 435 fromKey, BoundType.forBoolean(fromInclusive), 656 Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) { 658 fromKey, BoundType.forBoolean(fromInclusive), toKey, BoundType.forBoolean(toInclusive))); 271 subMap( Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) argument 432 subMap( Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) argument 655 subMap( Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive) argument
|
H A D | ImmutableSortedMap.java | 536 public ImmutableSortedMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, argument 542 return headMap(toKey, toInclusive).tailMap(fromKey, fromInclusive);
|
H A D | ImmutableSortedSet.java | 652 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 656 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); 691 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive); 651 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 690 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | Sets.java | 982 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 984 unfiltered().subSet(fromElement, fromInclusive, toElement, toInclusive), predicate); 1462 boolean fromInclusive, 1467 fromInclusive, 1621 boolean fromInclusive, 1624 return forward.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); 981 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 1460 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument 1619 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | AbstractMapBasedMultimap.java | 741 V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { 743 getSortedSetDelegate().subSet(fromElement, fromInclusive, toElement, toInclusive)); 1090 K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) { 1092 sortedMap().subMap(fromElement, fromInclusive, toElement, toInclusive)); 1539 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 1540 return new NavigableAsMap(sortedMap().subMap(fromKey, fromInclusive, toKey, toInclusive)); 740 subSet( V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) argument 1089 subSet( K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) argument 1538 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
|
H A D | Maps.java | 907 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 908 return asMap(set.subSet(fromKey, fromInclusive, toKey, toInclusive), function); 1067 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, 1070 fromElement, fromInclusive, toElement, toInclusive)); 2053 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 2055 fromMap().subMap(fromKey, fromInclusive, toKey, toInclusive), 3002 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 3004 unfiltered.subMap(fromKey, fromInclusive, toKey, toInclusive), entryPredicate); 3227 subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { argument 3230 fromInclusive, 906 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument 2052 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument 3001 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument 3624 subSet( K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) argument 3945 subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ContiguousSet.java | 103 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, argument
|
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),
|
H A D | ImmutableSortedMap.java | 281 ImmutableSortedMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { argument 285 return tailMap(fromKey, fromInclusive).headMap(toKey, toInclusive);
|
H A D | ImmutableSortedSet.java | 353 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, argument 359 if (cmp == 0 && !(fromInclusive && toInclusive)) { 362 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SynchronizedNavigableSetTest.java | 114 boolean fromInclusive, E toElement, boolean toInclusive) { 117 fromElement, fromInclusive, toElement, toInclusive); 113 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|
H A D | SynchronizedNavigableMapTest.java | 192 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 194 return delegate().subMap(fromKey, fromInclusive, toKey, toInclusive); 191 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | SafeTreeMap.java | 249 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { 251 checkValid(fromKey), fromInclusive, checkValid(toKey), toInclusive)); 248 subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
|
H A D | SafeTreeSet.java | 172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { 174 delegate.subSet(checkValid(fromElement), fromInclusive, 171 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
|