Searched refs:tailMap (Results 1 - 19 of 19) sorted by relevance

/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentNavigableMap.java77 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:ConcurrentNavigableMap
98 ConcurrentNavigableMap<K,V> tailMap(K fromKey); method in interface:ConcurrentNavigableMap
H A DConcurrentSkipListSet.java438 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
H A DConcurrentSkipListMap.java2078 public ConcurrentNavigableMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap
2109 public ConcurrentNavigableMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap
2110 return tailMap(fromKey, true);
2418 return new KeySet<>(m.tailMap(fromElement, inclusive));
2561 * only using the {@code subMap}, {@code headMap}, and {@code tailMap}
2968 public SubMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:ConcurrentSkipListMap.SubMap
2982 public SubMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap.SubMap
2983 return tailMap(fromKey, true);
/libcore/ojluni/src/main/java/java/util/
H A DSortedMap.java208 SortedMap<K,V> tailMap(K fromKey); method in interface:SortedMap
H A DNavigableMap.java62 * {@link #tailMap(Object, boolean) tailMap(K, boolean)}
83 * {@link #tailMap(Object) tailMap(K)}
392 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:NavigableMap
419 * <p>Equivalent to {@code tailMap(fromKey, true)}.
425 SortedMap<K,V> tailMap(K fromKey); method in interface:NavigableMap
H A DCollections.java1816 * <tt>subMap</tt>, <tt>headMap</tt>, or <tt>tailMap</tt> views, result in
1848 public SortedMap<K,V> tailMap(K fromKey) method in class:Collections.UnmodifiableSortedMap
1849 { return new UnmodifiableSortedMap<>(sm.tailMap(fromKey)); }
1860 * {@code subMap}, {@code headMap}, or {@code tailMap} views, result in
1992 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) method in class:Collections.UnmodifiableNavigableMap
1993 { return unmodifiableNavigableMap(nm.tailMap(fromKey, inclusive)); }
2748 * <tt>tailMap</tt> views.
2822 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.SynchronizedSortedMap
2824 return new SynchronizedSortedMap<>(sm.tailMap(fromKey),mutex);
2845 * {@code tailMap} view
2968 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.SynchronizedNavigableMap
2988 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { method in class:Collections.SynchronizedNavigableMap
4030 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.CheckedSortedMap
4189 public NavigableMap<K,V> tailMap(K fromKey) { method in class:Collections.CheckedNavigableMap
4201 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { method in class:Collections.CheckedNavigableMap
[all...]
H A DTreeSet.java350 return new TreeSet<>(m.tailMap(fromElement, inclusive));
H A DTreeMap.java941 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap
976 public SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap
977 return tailMap(fromKey, true);
1169 return new KeySet<>(m.tailMap(fromElement, inclusive));
1625 public final SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap.NavigableSubMap
1626 return tailMap(fromKey, true);
1891 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.AscendingSubMap
1984 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.DescendingSubMap
2060 public SortedMap<K,V> tailMap(K fromKey) { throw new InternalError(); } method in class:TreeMap.SubMap
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DTreeMapTest.java428 .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(nul
[all...]
H A DRefSortedMap.java221 public SortedMap<K, V> tailMap(K key) { method in class:RefSortedMap.SubMap
271 return tailMap(firstKey()).entrySet();
283 return tailMap(firstKey()).keySet();
294 public SortedMap<K, V> tailMap(K key) { method in class:RefSortedMap
299 return tailMap(firstKey()).values();
H A DSortedMapTestBase.java155 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));
H A DTreeMapExtendTest.java1358 subMap_default.tailMap(startKey);
1365 subMap_startExcluded_endExcluded.tailMap(startKey);
1372 subMap_startExcluded_endIncluded.tailMap(startKey);
1379 subMap_startIncluded_endExcluded.tailMap(startKey);
1386 subMap_startIncluded_endIncluded.tailMap(startKey);
1391 SortedMap tailMap = null;
1394 tailMap = subMap_default.tailMap(startKey);
1395 assertEquals(9, tailMap.size());
1398 subMap_startExcluded_endExcluded.tailMap(startKe
[all...]
/libcore/luni/src/test/java/libcore/java/util/
H A DOldTreeMapTest.java453 // 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);
H A DTreeMapTest.java474 * Taking a headMap or tailMap (exclusive or inclusive of the bound) of
506 // new TreeMap<>().headMap(0, false).tailMap(0, false)
507 // and new TreeMap<>().tailMap(0, false).headMap(0, false)
516 * vs. tailMap) because the inclusive bound of the submap is not
529 * vs. tailMap) because the inclusive bound of the submap is
542 * vs. tailMap) because the exclusive bound of the submap is
549 * {@code new TreeMap<>().tailMap(0, true).headMap(0, false)}
551 * {@code new TreeMap<>().headMap(0, false).tailMap(0, true)}
561 new TreeMap<>().tailMap(0, true).headMap(0, false);
565 new TreeMap<>().headMap(0, false).tailMap(
[all...]
H A DCollectionsTest.java853 map.tailMap(key),
859 map.tailMap(key, true /* inclusive */),
865 map.tailMap(key, false /* inclusive */),
874 map.tailMap(higherKey, true /* inclusive */),
889 map.tailMap(absentKey, true /* inclusive */),
1025 check_map_isChecked(map.tailMap(presentKey, true /* inclusive */),
/libcore/jsr166-tests/src/test/java/jsr166/
H A DTreeSubMapTest.java54 return map.tailMap(one, true);
546 SortedMap sm = map.tailMap(two);
580 SortedMap ssm = sm.tailMap(four);
1073 SortedMap sm = map.tailMap(m2);
1107 SortedMap ssm = sm.tailMap(m4);
H A DConcurrentSkipListSubMapTest.java71 return map.tailMap(one, true);
711 SortedMap sm = map.tailMap(two);
745 SortedMap ssm = sm.tailMap(four);
1385 SortedMap sm = map.tailMap(m2);
1419 SortedMap ssm = sm.tailMap(m4);
H A DConcurrentSkipListMapTest.java922 * tailMap returns map with keys in requested range
926 NavigableMap sm = map.tailMap(two, true);
970 NavigableMap ssm = sm.tailMap(four, true);
1115 // tailMap - pick direction and endpoint inclusion randomly
1117 NavigableMap<Integer,Integer> tm = map.tailMap(midPoint,incl);
H A DTreeMapTest.java731 NavigableMap sm = map.tailMap(two, true);
775 NavigableMap ssm = sm.tailMap(four, true);
920 // tailMap - pick direction and endpoint inclusion randomly
922 NavigableMap<Integer,Integer> tm = map.tailMap(midPoint,incl);

Completed in 168 milliseconds