| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingNavigableSet.java | 91 * {@link #tailSet(Object, boolean)}. If you override {@link #tailSet(Object, boolean)}, you may
95 return Iterators.getNext(tailSet(e, true).iterator(), null);
105 * {@link #tailSet(Object, boolean)}. If you override {@link #tailSet(Object, boolean)}, you may
109 return Iterators.getNext(tailSet(e, false).iterator(), null);
186 * {@code headSet} and {@code tailSet} methods. In many cases, you may wish to override
195 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive);
225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
226 return delegate().tailSet(fromElement, inclusive)
[all...] |
| ForwardingSortedSet.java | 91 public SortedSet<E> tailSet(E fromElement) {
92 return delegate().tailSet(fromElement);
106 * method of {@link #tailSet}. If you override {@link #tailSet}, you may wish
116 Object ceiling = self.tailSet(object).first();
129 * method of {@link #tailSet}. If you override {@link #tailSet}, you may wish
139 Iterator<Object> iterator = self.tailSet(object).iterator();
157 * terms of {@link #headSet(Object)} and {@link #tailSet(Object)}. In some
164 return tailSet(fromElement).headSet(toElement)
[all...] |
| ContiguousSet.java | 117 @Override public ContiguousSet<C> tailSet(C fromElement) {
125 @Override public ContiguousSet<C> tailSet(C fromElement, boolean inclusive) {
130 * These methods perform most headSet, subSet, and tailSet logic, besides parameter validation.
|
| SortedMultisets.java | 72 @Override public SortedSet<E> tailSet(E fromElement) {
149 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
|
| DescendingImmutableSortedSet.java | 48 return forward.tailSet(toElement, inclusive).descendingSet();
|
| ImmutableSortedSet.java | 52 * <p>The sets returned by the {@link #headSet}, {@link #tailSet}, and
664 * <p>The {@link SortedSet#tailSet} documentation states that a subset of a
671 public ImmutableSortedSet<E> tailSet(E fromElement) {
672 return tailSet(fromElement, true);
680 public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) {
685 * These methods perform most headSet, subSet, and tailSet logic, besides
719 return Iterables.getFirst(tailSet(e, true), null);
728 return Iterables.getFirst(tailSet(e, false), null);
|
| Sets.java | [all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| NavigableSet.java | 60 * {@link #tailSet(Object, boolean) tailSet(E, boolean)}
77 * {@link #tailSet(Object) tailSet(E)}
288 NavigableSet<E> tailSet(E fromElement, boolean inclusive);
315 * <p>Equivalent to {@code tailSet(fromElement, true)}.
321 SortedSet<E> tailSet(E fromElement);
|
| SortedSet.java | 205 SortedSet<E> tailSet(E fromElement);
|
| TreeSet.java | 349 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
382 public SortedSet<E> tailSet(E fromElement) {
383 return tailSet(fromElement, true);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedNavigableSetTest.java | 124 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
126 return delegate().tailSet(fromElement, inclusive);
129 @Override public SortedSet<E> tailSet(E fromElement) {
130 return tailSet(fromElement, true);
214 SortedSet<String> tailSet = map.tailSet("a");
215 assertTrue(tailSet instanceof SynchronizedSortedSet);
216 assertSame(MUTEX, ((SynchronizedSortedSet<String>) tailSet).mutex);
221 NavigableSet<String> tailSet = map.tailSet("a", true)
[all...] |
| ContiguousSetTest.java | 166 assertThat(set.tailSet(Integer.MIN_VALUE)).has().exactly(1, 2, 3).inOrder();
167 assertThat(set.tailSet(1)).has().exactly(1, 2, 3).inOrder();
168 assertThat(set.tailSet(2)).has().exactly(2, 3).inOrder();
169 assertThat(set.tailSet(3)).has().item(3);
170 assertThat(set.tailSet(Integer.MIN_VALUE, false)).has().exactly(1, 2, 3).inOrder();
171 assertThat(set.tailSet(1, false)).has().exactly(2, 3).inOrder();
172 assertThat(set.tailSet(2, false)).has().item(3);
173 assertThat(set.tailSet(3, false)).isEmpty();
177 assertThat(ContiguousSet.create(Range.closed(1, 3), integers()).tailSet(4)).isEmpty();
343 .named("Range.asSet, tailset")
[all...] |
| ImmutableSortedSetTest.java | 226 assertSame(set, set.tailSet("f"));
274 assertTrue(set.tailSet("c") instanceof ImmutableSortedSet);
275 assertThat(set.tailSet("c")).has().item("e");
276 assertThat(set.tailSet("e")).has().item("e");
277 assertSame(of(), set.tailSet("g"));
377 assertTrue(set.tailSet("e") instanceof ImmutableSortedSet);
378 assertThat(set.tailSet("e")).has().exactly("e", "f").inOrder();
379 assertThat(set.tailSet("a")).has().exactly("b", "c", "d", "e", "f").inOrder();
380 assertSame(of(), set.tailSet("g"));
474 assertTrue(set.tailSet("california") instanceof ImmutableSortedSet)
558 SortedSet<String> tailset = set.tailSet("d"); local
[all...] |
| ForwardingNavigableSetTest.java | 142 public SortedSet<T> tailSet(T fromElement) {
249 forward().tailSet("key", false);
250 assertEquals("[tailSet(Object,boolean)]", getCalls());
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldTreeSetTest.java | 222 // java.util.TreeSet.tailSet(java.lang.Object)
223 Set s = ts.tailSet(new Integer(900));
228 SortedSet sort = ts.tailSet(new Integer(101));
231 sort.tailSet(new Integer(100));
238 ts.tailSet(this);
245 ts.tailSet(null);
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableSortedSetTest.java | 114 assertSame(set, set.tailSet("f"));
155 assertTrue(set.tailSet("c") instanceof ImmutableSortedSet);
156 assertThat(set.tailSet("c")).has().item("e");
157 assertThat(set.tailSet("e")).has().item("e");
158 assertSame(of(), set.tailSet("g"));
251 assertTrue(set.tailSet("e") instanceof ImmutableSortedSet);
252 assertThat(set.tailSet("e")).has().exactly("e", "f").inOrder();
253 assertThat(set.tailSet("a")).has().exactly("b", "c", "d", "e", "f").inOrder();
254 assertSame(of(), set.tailSet("g"));
334 assertTrue(set.tailSet("california") instanceof ImmutableSortedSet)
400 SortedSet<String> tailset = set.tailSet("d"); local
[all...] |
| ContiguousSetTest.java | 128 assertThat(set.tailSet(Integer.MIN_VALUE)).has().exactly(1, 2, 3).inOrder();
129 assertThat(set.tailSet(1)).has().exactly(1, 2, 3).inOrder();
130 assertThat(set.tailSet(2)).has().exactly(2, 3).inOrder();
131 assertThat(set.tailSet(3)).has().item(3);
132 assertThat(set.tailSet(Integer.MIN_VALUE, false)).has().exactly(1, 2, 3).inOrder();
133 assertThat(set.tailSet(1, false)).has().exactly(2, 3).inOrder();
134 assertThat(set.tailSet(2, false)).has().item(3);
135 assertThat(set.tailSet(3, false)).isEmpty();
139 assertThat(ContiguousSet.create(Range.closed(1, 3), integers()).tailSet(4)).isEmpty();
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeSet.java | 182 @Override public SortedSet<E> tailSet(E fromElement) {
183 return tailSet(fromElement, true);
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive));
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableSortedSet.java | 323 Iterator<E> iterator = tailSet(e).iterator();
362 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive);
365 public ImmutableSortedSet<E> tailSet(E fromElement) {
368 return unsafeDelegateSortedSet(sortedDelegate.tailSet(fromElement), true);
374 ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) {
383 return tailSet(fromElement);
|
| SortedMultisets.java | 69 @Override public SortedSet<E> tailSet(E fromElement) {
|
| ContiguousSet.java | 94 @Override public ContiguousSet<C> tailSet(C fromElement) {
99 * These methods perform most headSet, subSet, and tailSet logic, besides parameter validation.
|
| /development/tools/idegen/src/ |
| Eclipse.java | 122 SortedSet<File> nextRoots = c.sourceRoots.tailSet(sourceRoot);
146 SortedSet<File> excludedDirs = c.excludedDirs.tailSet(sourceRoot);
|
| Configuration.java | 231 SortedSet<File> tailSet = excludedDirs.tailSet(sourceRoot);
232 for (File file : tailSet) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 408 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
436 public NavigableSet<E> tailSet(E fromElement) {
437 return tailSet(fromElement, true);
|
