/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentNavigableMap.java | 47 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); 68 ConcurrentNavigableMap<K,V> tailMap(K fromKey);
|
/libcore/luni/src/main/java/java/util/ |
SortedMap.java | 121 public SortedMap<K,V> tailMap(K startKey);
|
NavigableMap.java | 31 * and {@code tailMap} differ from the like-named {@code 52 * {@link #tailMap(Object) tailMap(K)} 355 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); 382 * <p>Equivalent to {@code tailMap(fromKey, true)}. 388 SortedMap<K,V> tailMap(K fromKey);
|
TreeMap.java | 716 public NavigableMap<K, V> tailMap(K from, boolean inclusive) { 721 public SortedMap<K, V> tailMap(K fromInclusive) { [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ForwardingSortedMap.java | 92 public SortedMap<K, V> tailMap(K fromKey) { 93 return delegate().tailMap(fromKey); 124 * firstKey()} method of {@link #tailMap}. If you override {@link #tailMap}, 135 Object ceilingKey = self.tailMap(key).firstKey(); 148 * iterator()} of the {@code entrySet()} of {@link #tailMap}. If you override 149 * {@link #tailMap}, you may wish to override {@link #remove} to forward 166 self.tailMap(key).entrySet().iterator(); 185 * terms of {@link #headMap(Object)} and {@link #tailMap(Object)}. In some 193 return tailMap(fromKey).headMap(toKey) [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 | 539 return headMap(toKey, toInclusive).tailMap(fromKey, fromInclusive); 546 * <p>The {@link SortedMap#tailMap} documentation states that a submap of a 553 public ImmutableSortedMap<K, V> tailMap(K fromKey) { 554 return tailMap(fromKey, true); 562 * <p>The {@link SortedMap#tailMap} documentation states that a submap of a 570 public abstract ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive); 589 return tailMap(key, true).firstEntry(); 597 return tailMap(key, false).firstEntry();
|
RegularImmutableSortedMap.java | 118 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) {
|
TreeBasedTable.java | 227 @Override public SortedMap<C, V> tailMap(C fromKey) { 272 map = map.tailMap(lowerBound);
|
/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 | 180 @Override public SortedMap<K, V> tailMap(K fromKey) { 181 return new SafeTreeMap<K, V>(delegate.tailMap(checkValid(fromKey)));
|
/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);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
TreeMapTest.java | 426 .tailMap("123").lastKey()); 500 assertEquals("Returned incorrect size", 553, tm.tailMap("500").size()); 501 assertEquals("Returned incorrect size", 0, tm.tailMap("null").size()); 502 assertEquals("Returned incorrect size", 1000, tm.tailMap("").size()); 503 assertEquals("Returned incorrect size", 552, tm.tailMap("500a").size()); 609 * java.util.TreeMap#tailMap(java.lang.Object) 613 // java.util.TreeMap.tailMap(java.lang.Object) 614 Map tail = tm.tailMap(objArray[900].toString()); 631 sub = intMap.tailMap(size); 642 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);
|
TreeMultimapNaturalTest.java | 198 asMap.tailMap("g"));
|
/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 ASSERT.that(navigableMap.tailMap(entries.get(i).getKey()).entrySet())
|
/external/guava/guava-tests/test/com/google/common/collect/ |
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);
|
ForwardingSortedMapTest.java | 216 forward().tailMap("last"); 217 assertEquals("[tailMap(Object)]", getCalls());
|
/frameworks/base/media/java/android/media/ |
SubtitleTrack.java | 475 tail = mCues.tailMap(timeMs + 1); 551 mRemainingCues.tailMap(mCurrentTimeMs + 1);
|