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

/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentNavigableMap.java70 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); method in interface:ConcurrentNavigableMap
91 ConcurrentNavigableMap<K,V> headMap(K toKey); method in interface:ConcurrentNavigableMap
H A DConcurrentSkipListSet.java429 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive));
H A DConcurrentSkipListMap.java2065 public ConcurrentNavigableMap<K,V> headMap(K toKey, method in class:ConcurrentSkipListMap
2100 public ConcurrentNavigableMap<K,V> headMap(K toKey) { method in class:ConcurrentSkipListMap
2101 return headMap(toKey, false);
2415 return new KeySet<>(m.headMap(toElement, inclusive));
2561 * only using the {@code subMap}, {@code headMap}, and {@code tailMap}
2962 public SubMap<K,V> headMap(K toKey, boolean inclusive) { method in class:ConcurrentSkipListMap.SubMap
2978 public SubMap<K,V> headMap(K toKey) { method in class:ConcurrentSkipListMap.SubMap
2979 return headMap(toKey, false);
/libcore/ojluni/src/main/java/java/util/
H A DSortedMap.java181 SortedMap<K,V> headMap(K toKey); method in interface:SortedMap
H A DNavigableMap.java61 * {@link #headMap(Object, boolean) headMap(K, boolean)}, and
82 * {@link #headMap(Object) headMap(K)}, and
363 NavigableMap<K,V> headMap(K toKey, boolean inclusive); method in interface:NavigableMap
408 * <p>Equivalent to {@code headMap(toKey, false)}.
414 SortedMap<K,V> headMap(K toKey); method in interface:NavigableMap
H A DCollections.java1816 * <tt>subMap</tt>, <tt>headMap</tt>, or <tt>tailMap</tt> views, result in
1846 public SortedMap<K,V> headMap(K toKey) method in class:Collections.UnmodifiableSortedMap
1847 { return new UnmodifiableSortedMap<>(sm.headMap(toKey)); }
1860 * {@code subMap}, {@code headMap}, or {@code tailMap} views, result in
1990 public NavigableMap<K, V> headMap(K toKey, boolean inclusive) method in class:Collections.UnmodifiableNavigableMap
1991 { return unmodifiableNavigableMap(nm.headMap(toKey, inclusive)); }
2747 * collections views of any of its <tt>subMap</tt>, <tt>headMap</tt> or
2817 public SortedMap<K,V> headMap(K toKey) { method in class:Collections.SynchronizedSortedMap
2819 return new SynchronizedSortedMap<>(sm.headMap(toKey), mutex);
2844 * collections views of any of its {@code subMap}, {@code headMap} o
2963 public SortedMap<K,V> headMap(K toKey) { method in class:Collections.SynchronizedNavigableMap
2981 public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { method in class:Collections.SynchronizedNavigableMap
4027 public SortedMap<K,V> headMap(K toKey) { method in class:Collections.CheckedSortedMap
4184 public NavigableMap<K,V> headMap(K toKey) { method in class:Collections.CheckedNavigableMap
4197 public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { method in class:Collections.CheckedNavigableMap
[all...]
H A DTreeSet.java338 return new TreeSet<>(m.headMap(toElement, inclusive));
H A DTreeMap.java927 public NavigableMap<K,V> headMap(K toKey, boolean inclusive) { method in class:TreeMap
965 public SortedMap<K,V> headMap(K toKey) { method in class:TreeMap
966 return headMap(toKey, false);
1166 return new KeySet<>(m.headMap(toElement, inclusive));
1621 public final SortedMap<K,V> headMap(K toKey) { method in class:TreeMap.NavigableSubMap
1622 return headMap(toKey, false);
1879 public NavigableMap<K,V> headMap(K toKey, boolean inclusive) { method in class:TreeMap.AscendingSubMap
1972 public NavigableMap<K,V> headMap(K toKey, boolean inclusive) { method in class:TreeMap.DescendingSubMap
2059 public SortedMap<K,V> headMap(K toKey) { throw new InternalError(); } method in class:TreeMap.SubMap
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DTreeMapTest.java289 * java.util.TreeMap#headMap(java.lang.Object)
293 // java.util.TreeMap.headMap(java.lang.Object)
294 Map head = tm.headMap("100");
309 SortedMap<Integer, Double> smap = map.headMap(null);
346 assertEquals(0, treemap.headMap(null).size());
349 SortedMap<String, String> headMap = treemap.headMap("100");
350 headMap.headMap("100");
358 sub = intMap.headMap(
[all...]
H A DTreeMapExtendTest.java599 subMap_default.headMap(endKey);
606 subMap_startExcluded_endExcluded.headMap(endKey);
613 subMap_startExcluded_endIncluded.headMap(endKey);
620 subMap_startIncluded_endExcluded.headMap(endKey);
627 subMap_startIncluded_endIncluded.headMap(endKey);
633 SortedMap headMap = null;
635 headMap = subMap_default.headMap(endKey);
636 assertEquals(0, headMap.size());
639 headMap
[all...]
H A DSortedMapTestBase.java195 checkSubMap(ref.headMap(key), map.headMap(key));
197 checkSubMap(ref.headMap(-1), map.headMap(-1));
H A DRefSortedMap.java188 public SortedMap<K, V> headMap(K key) { method in class:RefSortedMap.SubMap
278 public SortedMap<K, V> headMap(K key) { method in class:RefSortedMap
/libcore/luni/src/test/java/libcore/java/util/
H A DOldTreeMapTest.java212 // java.util.TreeMap.headMap(java.lang.Object)
213 Map head = tm.headMap("100");
218 SortedMap sort = tm.headMap("100");
220 sort.headMap("50");
227 tm.headMap(this);
234 tm.headMap(null);
249 SortedMap<Integer, Double> smap = map.headMap(null);
286 assertEquals(0, treemap.headMap(null).size());
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)
515 * allowed regardless of the direction of the constraints (headMap
528 * is allowed regardless of the direction of the constraints (headMap
541 * is allowed regardless of the direction of the constraints (headMap
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(
[all...]
H A DCollectionsTest.java824 map.headMap(key),
830 map.headMap(key, false /* inclusive */),
836 map.headMap(key, true /* inclusive */),
843 // headMap inclusive of lowerKey is same as exclusive of key
845 map.headMap(lowerKey, true /* inclusive */),
872 // headMap inclusive of higherKey is same as exclusive of key
881 int headSize = map.headMap(absentKey).size();
883 map.headMap(absentKey, true /* inclusive */),
1023 check_map_isChecked(map.headMap(presentKey, true /* inclusive */),
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListMapTest.java896 * headMap returns map with keys in requested range
900 NavigableMap sm = map.headMap(four, false);
1098 // headMap - pick direction and endpoint inclusion randomly
1100 NavigableMap<Integer,Integer> hm = map.headMap(midPoint, incl);
H A DTreeMapTest.java701 * headMap returns map with keys in requested range
705 NavigableMap sm = map.headMap(four, false);
727 * headMap returns map with keys in requested range
903 // headMap - pick direction and endpoint inclusion randomly
905 NavigableMap<Integer,Integer> hm = map.headMap(midPoint, incl);
H A DTreeSubMapTest.java516 * headMap returns map with keys in requested range
520 SortedMap sm = map.headMap(four);
542 * headMap returns map with keys in requested range
1043 * headMap returns map with keys in requested range
1047 SortedMap sm = map.headMap(m4);
1069 * headMap returns map with keys in requested range
H A DConcurrentSkipListSubMapTest.java681 * headMap returns map with keys in requested range
685 SortedMap sm = map.headMap(four);
707 * headMap returns map with keys in requested range
1355 * headMap returns map with keys in requested range
1359 SortedMap sm = map.headMap(m4);
1381 * headMap returns map with keys in requested range

Completed in 273 milliseconds