Home
last modified time | relevance | path

Searched refs:SubMap (Results 1 – 5 of 5) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DRefSortedMap.java90 class SubMap extends java.util.AbstractMap<K, V> class in RefSortedMap
96 SubMap(boolean hasFirst, K first, boolean hasLast, K last) { in SubMap() method in RefSortedMap.SubMap
114 int offset = SubMap.this.size() > 0 ? in entrySet()
115 bsearch(SubMap.this.firstKey()) - 1 : in entrySet()
153 int lastIdx = bsearch(SubMap.this.lastKey()); in entrySet()
154 int firstIdx = bsearch(SubMap.this.firstKey()); in entrySet()
192 return new SubMap(hasStart, start, true, key);
218 return new SubMap(true, startKey, true, endKey);
225 return new SubMap(true, key, hasEnd, end);
279 return new SubMap(false, null, true, key);
[all …]
DHashMapTest.java948 class SubMap<K, V> extends HashMap<K, V> { class in HashMapTest
949 public SubMap(Map<? extends K, ? extends V> m) { in SubMap() method in HashMapTest.SubMap
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentSkipListMap.java1897 return (dm != null) ? dm : (descendingMap = new SubMap<K,V> in descendingMap()
2056 return new SubMap<K,V> in subMap()
2069 return new SubMap<K,V> in headMap()
2082 return new SubMap<K,V> in tailMap()
2386 : ((SubMap<K,V>)m).new SubMapKeyIterator(); in iterator()
2436 : ((SubMap<K,V>)m).new SubMapKeyIterator(); in spliterator()
2448 : ((SubMap<K,V>)m).new SubMapValueIterator(); in iterator()
2460 : ((SubMap<K,V>)m).new SubMapValueIterator(); in spliterator()
2469 ((SubMap<K,V>)m).new SubMapEntryIterator(); in removeIf()
2489 : ((SubMap<K,V>)m).new SubMapEntryIterator(); in iterator()
[all …]
DConcurrentSkipListSet.java506 : ((ConcurrentSkipListMap.SubMap<E,?>)m).new SubMapKeyIterator(); in spliterator()
/libcore/ojluni/src/main/java/java/util/
DTreeMap.java2045 private class SubMap extends AbstractMap<K,V> class in TreeMap