HomeSort by relevance Sort by last modified time
    Searched refs:tailMap (Results 1 - 25 of 167) sorted by null

1 2 3 4 5 6 7

  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentNavigableMap.java 48 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive);
69 ConcurrentNavigableMap<K,V> tailMap(K fromKey);
  /external/guava/guava/src/com/google/common/collect/
ForwardingSortedMap.java 91 public SortedMap<K, V> tailMap(K fromKey) {
92 return delegate().tailMap(fromKey);
123 * firstKey()} method of {@link #tailMap}. If you override {@link #tailMap},
134 Object ceilingKey = self.tailMap(key).firstKey();
147 * terms of {@link #headMap(Object)} and {@link #tailMap(Object)}. In some
155 return tailMap(fromKey).headMap(toKey);
AbstractNavigableMap.java 100 return tailMap(key, true).firstEntry();
106 return tailMap(key, false).firstEntry();
144 public SortedMap<K, V> tailMap(K fromKey) {
145 return tailMap(fromKey, true);
ForwardingNavigableMap.java 124 * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override
128 return tailMap(key, true).firstEntry();
152 * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override
156 return tailMap(key, false).firstEntry();
377 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
378 return delegate().tailMap(fromKey, inclusive);
391 * A sensible definition of {@link #tailMap(Object)} in terms of
392 * {@link #tailMap(Object, boolean)}. If you override {@code tailMap(K, boolean)}, you may wis
    [all...]
StandardRowSortedTable.java 133 public SortedMap<R, Map<C, V>> tailMap(R fromKey) {
136 sortedBackingMap().tailMap(fromKey), factory).rowMap();
EmptyImmutableSortedMap.java 103 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) {
ImmutableSortedMap.java 542 return headMap(toKey, toInclusive).tailMap(fromKey, fromInclusive);
549 * <p>The {@link SortedMap#tailMap} documentation states that a submap of a
556 public ImmutableSortedMap<K, V> tailMap(K fromKey) {
557 return tailMap(fromKey, true);
565 * <p>The {@link SortedMap#tailMap} documentation states that a submap of a
574 public abstract ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive);
598 return tailMap(key, true).firstEntry();
608 return tailMap(key, false).firstEntry();
RegularImmutableSortedMap.java 118 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) {
TreeRangeSet.java 246 * upperBoundWindow represents the headMap/subMap/tailMap view of the entire "ranges by upper
284 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) {
333 backingItr = rangesByLowerBound.tailMap(lowerEntry.getKey(), true).values().iterator();
335 backingItr = rangesByLowerBound.tailMap(upperBoundWindow.lowerEndpoint(), true)
405 * complementLowerBoundWindow represents the headMap/subMap/tailMap view of the entire
445 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) {
467 positiveRanges = positiveRangesByUpperBound.tailMap(
576 // tailMap respects the current window
577 Entry<Cut<C>, Range<C>> firstEntry = tailMap(cut, true).firstEntry();
623 * lowerBoundWindow is the headMap/subMap/tailMap view; it only restricts the keys, and does no
    [all...]
  /libcore/ojluni/src/main/java/java/util/
SortedMap.java 208 SortedMap<K,V> tailMap(K fromKey);
NavigableMap.java 61 * {@link #tailMap(Object, boolean) tailMap(K, boolean)}
82 * {@link #tailMap(Object) tailMap(K)}
391 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive);
418 * <p>Equivalent to {@code tailMap(fromKey, true)}.
424 SortedMap<K,V> tailMap(K fromKey);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
SortedMapInterfaceTest.java 72 SortedMap<K, V> subMap = map.tailMap(key);
99 SortedMap<K, V> subMap = map.tailMap(key);
122 SortedMap<K, V> subMap = map.tailMap(key);
SafeTreeMap.java 258 @Override public SortedMap<K, V> tailMap(K fromKey) {
259 return tailMap(fromKey, true);
262 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
264 delegate.tailMap(checkValid(fromKey), inclusive));
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
ImmutableSortedMap.java 163 = map.tailMap(key).entrySet().iterator().next();
285 return tailMap(fromKey, fromInclusive).headMap(toKey, toInclusive);
288 public ImmutableSortedMap<K, V> tailMap(K fromKey) {
290 return newView(sortedDelegate.tailMap(fromKey));
293 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) {
301 return tailMap(fromKey);
  /external/guava/guava-tests/test/com/google/common/collect/
SynchronizedNavigableMapTest.java 201 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
203 return delegate().tailMap(fromKey, inclusive);
206 @Override public SortedMap<K, V> tailMap(K fromKey) {
207 return tailMap(fromKey, true);
377 SortedMap<String, Integer> subMap = map.tailMap("a");
384 NavigableMap<String, Integer> subMap = map.tailMap("a", true);
TreeBasedTableTest.java 302 = sortedTable.rowMap().tailMap("cat");
396 entrySet = row.tailMap(15).entrySet();
409 Set<Map.Entry<Integer, Character>> entrySet = row.tailMap(15).entrySet();
427 assertEquals(row.tailMap(15).size(), 1);
433 SortedMap<Integer, Character> subRow = row.tailMap(2);
MapsTest.java 691 assertThat(map.tailMap("onea").entrySet()).has().exactly(
745 map.tailMap("a").keySet().add("a");
755 map.headMap("r").tailMap("m").keySet().add("a");
787 assertThat(map.tailMap("onea").entrySet()).has().exactly(
795 map.tailMap("three", true));
817 map.descendingMap().tailMap("three", true));
818 assertThat(map.tailMap("three", false).entrySet()).has().item(
820 assertNull(map.tailMap("three", true).lowerEntry("three"));
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
TreeMapTest.java 428 .tailMap("123").lastKey());
502 assertEquals("Returned incorrect size", 553, tm.tailMap("500").size());
503 assertEquals("Returned incorrect size", 0, tm.tailMap("null").size());
504 assertEquals("Returned incorrect size", 1000, tm.tailMap("").size());
505 assertEquals("Returned incorrect size", 552, tm.tailMap("500a").size());
613 * java.util.TreeMap#tailMap(java.lang.Object)
617 // java.util.TreeMap.tailMap(java.lang.Object)
618 Map tail = tm.tailMap(objArray[900].toString());
635 sub = intMap.tailMap(size);
646 SortedMap th = t.tailMap(null)
    [all...]
RefSortedMap.java 221 public SortedMap<K, V> tailMap(K key) {
271 return tailMap(firstKey()).entrySet();
283 return tailMap(firstKey()).keySet();
294 public SortedMap<K, V> tailMap(K key) {
299 return tailMap(firstKey()).values();
SortedMapTestBase.java 155 int key = ref.tailMap((ref.firstKey() + ref.lastKey()) / 2)
241 checkSubMap(ref.tailMap(key), map.tailMap(key));
243 checkSubMap(ref.tailMap(2 * N + 1), map.tailMap(2 * N + 1));
TreeMapExtendTest.java     [all...]
  /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
TreeBasedTableTest.java 259 = sortedTable.rowMap().tailMap("cat");
353 entrySet = row.tailMap(15).entrySet();
366 Set<Map.Entry<Integer, Character>> entrySet = row.tailMap(15).entrySet();
384 assertEquals(row.tailMap(15).size(), 1);
390 SortedMap<Integer, Character> subRow = row.tailMap(2);
ImmutableSortedMapTest.java 146 .tailMap("b");
161 .tailMap("a", false);
629 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", true);
637 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", false);
  /libcore/luni/src/test/java/libcore/java/util/
OldTreeMapTest.java 453 // java.util.TreeMap.tailMap(java.lang.Object)
454 Map tail = tm.tailMap(objArray[900].toString());
462 SortedMap sort = tm.tailMap("99");
465 sort.tailMap("101");
472 tm.tailMap(this);
479 tm.tailMap(null);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
SortedMapNavigationTester.java 112 assertTrue(navigableMap.tailMap(a.getKey()).containsKey(a.getKey()));
130 assertThat(navigableMap.tailMap(entries.get(i).getKey()).entrySet())

Completed in 1156 milliseconds

1 2 3 4 5 6 7