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

/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentNavigableMap.java39 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); method in interface:ConcurrentNavigableMap
60 ConcurrentNavigableMap<K,V> headMap(K toKey); method in interface:ConcurrentNavigableMap
H A DConcurrentSkipListSet.java388 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive));
H A DConcurrentSkipListMap.java1964 public ConcurrentNavigableMap<K,V> headMap(K toKey, method in class:ConcurrentSkipListMap
1999 public ConcurrentNavigableMap<K,V> headMap(K toKey) { method in class:ConcurrentSkipListMap
2000 return headMap(toKey, false);
2333 return new KeySet<E>(m.headMap(toElement, inclusive));
2440 * constructed only using the {@code subMap}, {@code headMap}, and
2841 public SubMap<K,V> headMap(K toKey, method in class:ConcurrentSkipListMap.SubMap
2859 public SubMap<K,V> headMap(K toKey) { method in class:ConcurrentSkipListMap.SubMap
2860 return headMap(toKey, false);
/libcore/luni/src/main/java/java/util/
H A DSortedMap.java62 public SortedMap<K,V> headMap(K endKey); method in interface:SortedMap
H A DNavigableMap.java30 * ones. Methods {@code subMap}, {@code headMap},
51 * {@link #headMap(Object) headMap(K)}, and
326 NavigableMap<K,V> headMap(K toKey, boolean inclusive); method in interface:NavigableMap
371 * <p>Equivalent to {@code headMap(toKey, false)}.
377 SortedMap<K,V> headMap(K toKey); method in interface:NavigableMap
H A DTreeMap.java707 public NavigableMap<K, V> headMap(K to, boolean inclusive) { method in class:TreeMap
712 public SortedMap<K, V> headMap(K toExclusive) { method in class:TreeMap
1039 return TreeMap.this.headMap(to, inclusive).navigableKeySet();
1043 return TreeMap.this.headMap(toExclusive, false).navigableKeySet();
1414 public NavigableMap<K, V> headMap(K to, boolean inclusive) { method in class:TreeMap.BoundedMap
1419 public NavigableMap<K, V> headMap(K toExclusive) { method in class:TreeMap.BoundedMap
1623 return headMap(to, inclusive).navigableKeySet();
1627 return headMap(toExclusive).navigableKeySet();
H A DTreeSet.java382 return new TreeSet<E>(backingMap.headMap(end, endInclusive));
H A DCollections.java825 @Override public SortedMap<K, V> headMap(K endKey) { method in class:Collections.SynchronizedSortedMap
827 return new SynchronizedSortedMap<K, V>(sm.headMap(endKey),
1340 @Override public SortedMap<K, V> headMap(K before) { method in class:Collections.UnmodifiableSortedMap
1341 return new UnmodifiableSortedMap<K, V>(sm.headMap(before));
3379 @Override public SortedMap<K, V> headMap(K toKey) { method in class:Collections.CheckedSortedMap
3380 return new CheckedSortedMap<K, V>(sm.headMap(toKey), keyType, valueType);
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DTreeMapTest.java287 * java.util.TreeMap#headMap(java.lang.Object)
291 // java.util.TreeMap.headMap(java.lang.Object)
292 Map head = tm.headMap("100");
307 SortedMap<Integer, Double> smap = map.headMap(null);
344 assertEquals(0, treemap.headMap(null).size());
347 SortedMap<String, String> headMap = treemap.headMap("100");
348 headMap.headMap("100");
356 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());
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListMapTest.java875 * headMap returns map with keys in requested range
879 NavigableMap sm = map.headMap(four, false);
1077 // headMap - pick direction and endpoint inclusion randomly
1079 NavigableMap<Integer,Integer> hm = map.headMap(midPoint, incl);
H A DTreeMapTest.java680 * headMap returns map with keys in requested range
684 NavigableMap sm = map.headMap(four, false);
706 * headMap returns map with keys in requested range
882 // headMap - pick direction and endpoint inclusion randomly
884 NavigableMap<Integer,Integer> hm = map.headMap(midPoint, incl);
H A DTreeSubMapTest.java497 * headMap returns map with keys in requested range
501 SortedMap sm = map.headMap(four);
523 * headMap returns map with keys in requested range
1024 * headMap returns map with keys in requested range
1028 SortedMap sm = map.headMap(m4);
1050 * headMap returns map with keys in requested range
H A DConcurrentSkipListSubMapTest.java663 * headMap returns map with keys in requested range
667 SortedMap sm = map.headMap(four);
689 * headMap returns map with keys in requested range
1337 * headMap returns map with keys in requested range
1341 SortedMap sm = map.headMap(m4);
1363 * headMap returns map with keys in requested range
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 368 milliseconds