| /external/guava/guava/src/com/google/common/collect/ |
| D | ContiguousSet.java | 57 @Override ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, in subSet() argument
62 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
78 /*@Override*/ abstract ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, in subSetImpl() argument
|
| D | EmptyContiguousSet.java | 66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
|
| D | RegularContiguousSet.java | 56 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
|
| D | RegularImmutableSortedSet.java | 214 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
215 return tailSetImpl(fromElement, fromInclusive) in subSetImpl()
|
| D | ImmutableSortedSet.java | 624 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
628 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
658 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive); in subSetImpl() argument
|
| D | EmptyImmutableSortedSet.java | 111 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
|
| D | ImmutableSortedMap.java | 682 ImmutableSortedMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey,
687 return tailMap(fromKey, fromInclusive).headMap(toKey, toInclusive);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | EmptyContiguousSet.java | 64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
|
| D | RegularContiguousSet.java | 54 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
|
| D | ImmutableSortedSet.java | 337 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, in subSet() argument
343 if (cmp == 0 && !(fromInclusive && toInclusive)) { in subSet()
346 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); in subSet()
|
| D | ImmutableSortedMap.java | 291 ImmutableSortedMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive){ in subMap() argument
295 return tailMap(fromKey, fromInclusive).headMap(toKey, toInclusive); in subMap()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | SafeTreeSet.java | 172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
174 delegate.subSet(checkValid(fromElement), fromInclusive, in subSet()
|
| D | SafeTreeMap.java | 212 K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { in subMap() argument
214 checkValid(fromKey), fromInclusive, checkValid(toKey), toInclusive)); in subMap()
|