Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 80) sorted by relevance

1234

/libcore/ojluni/src/main/java/java/util/
DNavigableMap.java97 public interface NavigableMap<K,V> extends SortedMap<K,V> {
111 Map.Entry<K,V> lowerEntry(K key); in lowerEntry()
125 K lowerKey(K key); in lowerKey()
140 Map.Entry<K,V> floorEntry(K key); in floorEntry()
154 K floorKey(K key); in floorKey()
169 Map.Entry<K,V> ceilingEntry(K key); in ceilingEntry()
183 K ceilingKey(K key); in ceilingKey()
198 Map.Entry<K,V> higherEntry(K key); in higherEntry()
212 K higherKey(K key); in higherKey()
221 Map.Entry<K,V> firstEntry(); in firstEntry()
[all …]
DMap.java161 public interface Map<K, V> {
273 V put(K key, V value); in put()
329 void putAll(Map<? extends K, ? extends V> m); in putAll() argument
358 Set<K> keySet(); in keySet()
393 Set<Map.Entry<K, V>> entrySet(); in entrySet()
418 interface Entry<K, V> {
427 K getKey(); in getKey()
513 … public static <K extends Comparable<? super K>, V> Comparator<Map.Entry<K, V>> comparingByKey() { in comparingByKey()
514 return (Comparator<Map.Entry<K, V>> & Serializable) in comparingByKey()
530 …public static <K, V extends Comparable<? super V>> Comparator<Map.Entry<K, V>> comparingByValue() { in comparingByValue()
[all …]
DTreeMap.java112 public class TreeMap<K,V>
113 extends AbstractMap<K,V>
114 implements NavigableMap<K,V>, Cloneable, java.io.Serializable
122 private final Comparator<? super K> comparator;
124 private transient TreeMapEntry<K,V> root;
166 public TreeMap(Comparator<? super K> comparator) { in TreeMap()
184 public TreeMap(Map<? extends K, ? extends V> m) { in TreeMap() argument
198 public TreeMap(SortedMap<K, ? extends V> m) { in TreeMap() argument
249 for (TreeMapEntry<K,V> e = getFirstEntry(); e != null; e = successor(e)) in containsValue()
278 TreeMapEntry<K,V> p = getEntry(key); in get()
[all …]
DLinkedHashMap.java181 public class LinkedHashMap<K,V>
182 extends HashMap<K,V>
183 implements Map<K,V>
216 static class LinkedHashMapEntry<K,V> extends HashMap.Node<K,V> {
217 LinkedHashMapEntry<K,V> before, after;
218 LinkedHashMapEntry(int hash, K key, V value, Node<K,V> next) { in LinkedHashMapEntry() argument
228 transient LinkedHashMapEntry<K,V> head;
233 transient LinkedHashMapEntry<K,V> tail;
246 private void linkNodeLast(LinkedHashMapEntry<K,V> p) { in linkNodeLast() argument
247 LinkedHashMapEntry<K,V> last = tail; in linkNodeLast()
[all …]
DSortedMap.java113 public interface SortedMap<K,V> extends Map<K,V> {
123 Comparator<? super K> comparator(); in comparator()
154 SortedMap<K,V> subMap(K fromKey, K toKey); in subMap()
181 SortedMap<K,V> headMap(K toKey); in headMap()
208 SortedMap<K,V> tailMap(K fromKey); in tailMap()
216 K firstKey(); in firstKey()
224 K lastKey(); in lastKey()
243 Set<K> keySet(); in keySet()
283 Set<Map.Entry<K, V>> entrySet(); in entrySet()
DHashMap.java137 public class HashMap<K,V> extends AbstractMap<K,V>
138 implements Map<K,V>, Cloneable, Serializable {
279 static class Node<K,V> implements Map.Entry<K,V> {
281 final K key;
283 Node<K,V> next;
285 Node(int hash, K key, V value, Node<K,V> next) { in Node() argument
292 public final K getKey() { return key; } in getKey()
388 transient Node<K,V>[] table;
394 transient Set<Map.Entry<K,V>> entrySet;
480 public HashMap(Map<? extends K, ? extends V> m) { in HashMap() argument
[all …]
DWeakHashMap.java135 public class WeakHashMap<K,V>
136 extends AbstractMap<K,V>
137 implements Map<K,V> {
159 Entry<K,V>[] table;
193 private Entry<K,V>[] newTable(int n) { in newTable()
194 return (Entry<K,V>[]) new Entry<?,?>[n]; in newTable()
253 public WeakHashMap(Map<? extends K, ? extends V> m) { in WeakHashMap() argument
285 private boolean matchesKey(Entry<K,V> e, Object key) { in matchesKey() argument
326 Entry<K,V> e = (Entry<K,V>) x; in expungeStaleEntries()
329 Entry<K,V> prev = table[i]; in expungeStaleEntries()
[all …]
DAbstractMap.java68 public abstract class AbstractMap<K,V> implements Map<K,V> {
112 Iterator<Entry<K,V>> i = entrySet().iterator(); in containsValue()
115 Entry<K,V> e = i.next(); in containsValue()
121 Entry<K,V> e = i.next(); in containsValue()
144 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); in containsKey()
147 Entry<K,V> e = i.next(); in containsKey()
153 Entry<K,V> e = i.next(); in containsKey()
176 Iterator<Entry<K,V>> i = entrySet().iterator(); in get()
179 Entry<K,V> e = i.next(); in get()
185 Entry<K,V> e = i.next(); in get()
[all …]
DCollections.java1521 public static <K,V> Map<K,V> unmodifiableMap(Map<? extends K, ? extends V> m) {
1524 return (Map<K,V>) m;
1532 private static class UnmodifiableMap<K,V> implements Map<K,V>, Serializable {
1537 private final Map<? extends K, ? extends V> m;
1539 UnmodifiableMap(Map<? extends K, ? extends V> m) {
1551 public V put(K key, V value) {
1557 public void putAll(Map<? extends K, ? extends V> m) {
1564 private transient Set<K> keySet;
1565 private transient Set<Map.Entry<K,V>> entrySet;
1568 public Set<K> keySet() {
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentSkipListMap.java112 public class ConcurrentSkipListMap<K,V> extends AbstractMap<K,V>
113 implements ConcurrentNavigableMap<K,V>, Cloneable, Serializable {
338 final Comparator<? super K> comparator;
341 private transient Index<K,V> head;
345 private transient KeySet<K,V> keySet;
347 private transient Values<K,V> values;
349 private transient EntrySet<K,V> entrySet;
351 private transient SubMap<K,V> descendingMap;
360 static final class Node<K,V> {
361 final K key; // currently, never detached
[all …]
DConcurrentNavigableMap.java54 public interface ConcurrentNavigableMap<K,V>
55 extends ConcurrentMap<K,V>, NavigableMap<K,V>
62 ConcurrentNavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, in subMap()
63 K toKey, boolean toInclusive); in subMap()
70 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); in headMap()
77 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); in tailMap()
84 ConcurrentNavigableMap<K,V> subMap(K fromKey, K toKey); in subMap()
91 ConcurrentNavigableMap<K,V> headMap(K toKey); in headMap()
98 ConcurrentNavigableMap<K,V> tailMap(K fromKey); in tailMap()
112 ConcurrentNavigableMap<K,V> descendingMap(); in descendingMap()
[all …]
DConcurrentHashMap.java264 public class ConcurrentHashMap<K,V> extends AbstractMap<K,V>
265 implements ConcurrentMap<K,V>, Serializable {
625 static class Node<K,V> implements Map.Entry<K,V> {
627 final K key;
629 volatile Node<K,V> next;
631 Node(int hash, K key, V val) { in Node()
637 Node(int hash, K key, V val, Node<K,V> next) { in Node() argument
642 public final K getKey() { return key; } in getKey()
664 Node<K,V> find(int h, Object k) { in find()
665 Node<K,V> e = this; in find()
[all …]
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java31 public class HashMap<K, V> extends java.util.AbstractMap<K, V>
32 implements java.util.Map<K, V>, java.lang.Cloneable, java.io.Serializable {
46 public HashMap(java.util.Map<? extends K, ? extends V> m) { in HashMap() argument
66 final void putMapEntries(java.util.Map<? extends K, ? extends V> m, boolean evict) { in putMapEntries() argument
82 final java.util.HashMap.Node<K, V> getNode(int hash, java.lang.Object key) { in getNode()
90 public V put(K key, V value) { in put()
94 final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) { in putVal()
98 final java.util.HashMap.Node<K, V>[] resize() { in resize()
102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin() argument
106 public void putAll(java.util.Map<? extends K, ? extends V> m) { in putAll() argument
[all …]
DLinkedHashMap.java31 public class LinkedHashMap<K, V> extends java.util.HashMap<K, V> implements java.util.Map<K, V> {
45 public LinkedHashMap(java.util.Map<? extends K, ? extends V> m) { in LinkedHashMap() argument
53 private void linkNodeLast(java.util.LinkedHashMap.LinkedHashMapEntry<K, V> p) { in linkNodeLast() argument
58 java.util.LinkedHashMap.LinkedHashMapEntry<K, V> src, in transferLinks() argument
59 java.util.LinkedHashMap.LinkedHashMapEntry<K, V> dst) { in transferLinks()
67 java.util.HashMap.Node<K, V> newNode(int hash, K key, V value, java.util.HashMap.Node<K, V> e) { in newNode() argument
71 java.util.HashMap.Node<K, V> replacementNode( in replacementNode() argument
72 java.util.HashMap.Node<K, V> p, java.util.HashMap.Node<K, V> next) { in replacementNode()
76 java.util.HashMap.TreeNode<K, V> newTreeNode( in newTreeNode()
77 int hash, K key, V value, java.util.HashMap.Node<K, V> next) { in newTreeNode() argument
[all …]
DCollections.java174 public static <K, V> java.util.Map<K, V> unmodifiableMap( in unmodifiableMap()
175 java.util.Map<? extends K, ? extends V> m) { in unmodifiableMap() argument
179 public static <K, V> java.util.SortedMap<K, V> unmodifiableSortedMap( in unmodifiableSortedMap() argument
180 java.util.SortedMap<K, ? extends V> m) { in unmodifiableSortedMap()
184 public static <K, V> java.util.NavigableMap<K, V> unmodifiableNavigableMap( in unmodifiableNavigableMap() argument
185 java.util.NavigableMap<K, ? extends V> m) { in unmodifiableNavigableMap()
223 public static <K, V> java.util.Map<K, V> synchronizedMap(java.util.Map<K, V> m) { in synchronizedMap() argument
227 public static <K, V> java.util.SortedMap<K, V> synchronizedSortedMap( in synchronizedSortedMap() argument
228 java.util.SortedMap<K, V> m) { in synchronizedSortedMap()
232 public static <K, V> java.util.NavigableMap<K, V> synchronizedNavigableMap( in synchronizedNavigableMap() argument
[all …]
DEnumMap.java32 public class EnumMap<K extends java.lang.Enum<K>, V> extends java.util.AbstractMap<K, V>
35 public EnumMap(java.lang.Class<K> keyType) { in EnumMap()
39 public EnumMap(java.util.EnumMap<K, ? extends V> m) { in EnumMap() argument
43 public EnumMap(java.util.Map<K, ? extends V> m) { in EnumMap() argument
75 public V put(K key, V value) { in put()
91 public void putAll(java.util.Map<? extends K, ? extends V> m) { in putAll() argument
99 public java.util.Set<K> keySet() { in keySet()
107 public java.util.Set<java.util.Map.Entry<K, V>> entrySet() { in entrySet()
127 public java.util.EnumMap<K, V> clone() { in clone()
131 private void typeCheck(K key) { in typeCheck()
[all …]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DRefSortedMap.java36 public class RefSortedMap<K, V> extends java.util.AbstractMap<K, V>
37 implements SortedMap<K, V>, Cloneable, Serializable {
41 private static final class MapEntry<K, V> implements Map.Entry<K, V> {
43 final K key;
46 MapEntry(K key, V value) { in MapEntry()
51 public K getKey() { in getKey()
85 transient ArrayList<MapEntry<K, V>> entries = new ArrayList<MapEntry<K, V>>();
88 private final Comparator<? super K> comparator;
90 class SubMap extends java.util.AbstractMap<K, V>
91 implements SortedMap<K, V>, Cloneable {
[all …]
/libcore/ojluni/annotations/sdk/nullability/java/util/
DMap.annotated.java32 public interface Map<K, V> {
44 @libcore.util.Nullable public V put(@libcore.util.NullFromTypeParam K key, @libcore.util.NullFromTy… in put()
48 public void putAll(@libcore.util.NonNull java.util.Map<? extends @libcore.util.NullFromTypeParam K,… in putAll() argument
52 @libcore.util.NonNull public java.util.Set<@libcore.util.NullFromTypeParam K> keySet(); in keySet()
56 …t<java.util.Map.@libcore.util.NonNull Entry<@libcore.util.NullFromTypeParam K, @libcore.util.NullF… in entrySet()
64 …nNull java.util.function.BiConsumer<? super @libcore.util.NullFromTypeParam K,? super @libcore.uti… in forEach() argument
66 …nNull java.util.function.BiFunction<? super @libcore.util.NullFromTypeParam K,? super @libcore.uti… in replaceAll() argument
68 @libcore.util.Nullable public default V putIfAbsent(@libcore.util.NullFromTypeParam K key, @libcore… in putIfAbsent()
72 public default boolean replace(@libcore.util.NullFromTypeParam K key, @libcore.util.Nullable V oldV… in replace()
74 @libcore.util.Nullable public default V replace(@libcore.util.NullFromTypeParam K key, @libcore.uti… in replace()
[all …]
DNavigableMap.annotated.java41 public interface NavigableMap<K, V> extends java.util.SortedMap<K,V> {
43 …ry<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> lowerEntry(@libcore.util.… in lowerEntry()
45 @libcore.util.Nullable public K lowerKey(@libcore.util.NullFromTypeParam K key); in lowerKey()
47 …ry<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> floorEntry(@libcore.util.… in floorEntry()
49 @libcore.util.Nullable public K floorKey(@libcore.util.NullFromTypeParam K key); in floorKey()
51 …y<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> ceilingEntry(@libcore.util… in ceilingEntry()
53 @libcore.util.Nullable public K ceilingKey(@libcore.util.NullFromTypeParam K key); in ceilingKey()
55 …ry<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> higherEntry(@libcore.util… in higherEntry()
57 @libcore.util.Nullable public K higherKey(@libcore.util.NullFromTypeParam K key); in higherKey()
59 @libcore.util.Nullable public java.util.Map.Entry<@libcore.util.NullFromTypeParam K, @libcore.util.… in firstEntry()
[all …]
DTreeMap.annotated.java32 public class TreeMap<K, V> extends java.util.AbstractMap<K,V> implements java.util.NavigableMap<K,V…
36 ….util.Nullable java.util.Comparator<? super @libcore.util.NullFromTypeParam K> comparator) { throw… in TreeMap()
38 public TreeMap(@libcore.util.NonNull java.util.Map<? extends @libcore.util.NullFromTypeParam K,? ex… in TreeMap() argument
40 public TreeMap(@libcore.util.NonNull java.util.SortedMap<@libcore.util.NullFromTypeParam K,? extend… in TreeMap() argument
50 @libcore.util.Nullable public java.util.Comparator<? super @libcore.util.NullFromTypeParam K> compa… in comparator()
52 @libcore.util.NullFromTypeParam public K firstKey() { throw new RuntimeException("Stub!"); } in firstKey()
54 @libcore.util.NullFromTypeParam public K lastKey() { throw new RuntimeException("Stub!"); } in lastKey()
56 public void putAll(@libcore.util.NonNull java.util.Map<? extends @libcore.util.NullFromTypeParam K,… in putAll() argument
58 @libcore.util.Nullable public V put(@libcore.util.NullFromTypeParam K key, @libcore.util.NullFromTy… in put()
66 @libcore.util.Nullable public java.util.Map.Entry<@libcore.util.NullFromTypeParam K, @libcore.util.… in firstEntry()
[all …]
DSortedMap.annotated.java31 public interface SortedMap<K, V> extends java.util.Map<K,V> {
33 @libcore.util.Nullable public java.util.Comparator<? super @libcore.util.NullFromTypeParam K> compa… in comparator()
35 …llFromTypeParam K, @libcore.util.NullFromTypeParam V> subMap(@libcore.util.NullFromTypeParam K fro… in subMap()
37 …dMap<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> headMap(@libcore.util.N… in headMap()
39 …dMap<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V> tailMap(@libcore.util.N… in tailMap()
41 @libcore.util.NullFromTypeParam public K firstKey(); in firstKey()
43 @libcore.util.NullFromTypeParam public K lastKey(); in lastKey()
45 @libcore.util.NonNull public java.util.Set<@libcore.util.NullFromTypeParam K> keySet(); in keySet()
49 …t<java.util.Map.@libcore.util.NonNull Entry<@libcore.util.NullFromTypeParam K, @libcore.util.NullF… in entrySet()
/libcore/ojluni/src/main/java/sun/security/util/
DCache.java72 public abstract class Cache<K,V> {
91 public abstract void put(K key, V value); in put()
121 public abstract void accept(CacheVisitor<K,V> visitor); in accept() argument
127 public static <K,V> Cache<K,V> newSoftMemoryCache(int size) { in newSoftMemoryCache()
136 public static <K,V> Cache<K,V> newSoftMemoryCache(int size, int timeout) { in newSoftMemoryCache()
144 public static <K,V> Cache<K,V> newHardMemoryCache(int size) { in newHardMemoryCache()
152 public static <K,V> Cache<K,V> newNullCache() { in newNullCache()
153 return (Cache<K,V>) NullCache.INSTANCE; in newNullCache()
161 public static <K,V> Cache<K,V> newHardMemoryCache(int size, int timeout) { in newHardMemoryCache()
198 public interface CacheVisitor<K,V> {
[all …]
/libcore/ojluni/annotations/hiddenapi/sun/security/util/
DMemoryCache.java22 class MemoryCache<K, V> extends sun.security.util.Cache<K, V> {
48 public synchronized void put(K key, V value) { in put()
68 public synchronized void accept(sun.security.util.Cache.CacheVisitor<K, V> visitor) { in accept() argument
72 private java.util.Map<K, V> getCachedEntries() { in getCachedEntries()
76 protected sun.security.util.MemoryCache.CacheEntry<K, V> newEntry( in newEntry()
77 K key, V value, long expirationTime, java.lang.ref.ReferenceQueue<V> queue) { in newEntry()
85 private final java.util.Map<K, sun.security.util.MemoryCache.CacheEntry<K, V>> cacheMap;
102 private static interface CacheEntry<K, V> {
108 public K getKey(); in getKey()
114 private static class HardCacheEntry<K, V>
[all …]
DCache.java32 public abstract class Cache<K, V> {
45 public abstract void put(K key, V value); in put()
56 public abstract void accept(sun.security.util.Cache.CacheVisitor<K, V> visitor); in accept() argument
58 public static <K, V> sun.security.util.Cache<K, V> newSoftMemoryCache(int size) { in newSoftMemoryCache()
62 public static <K, V> sun.security.util.Cache<K, V> newSoftMemoryCache(int size, int timeout) { in newSoftMemoryCache()
67 public static <K, V> sun.security.util.Cache<K, V> newHardMemoryCache(int size) { in newHardMemoryCache()
71 public static <K, V> sun.security.util.Cache<K, V> newNullCache() { in newNullCache()
75 public static <K, V> sun.security.util.Cache<K, V> newHardMemoryCache(int size, int timeout) { in newHardMemoryCache()
80 public static interface CacheVisitor<K, V> {
82 public void visit(java.util.Map<K, V> map); in visit() argument
/libcore/ojluni/src/main/java/sun/util/locale/
DLocaleObjectCache.java39 public abstract class LocaleObjectCache<K, V> {
40 private final ConcurrentMap<K, CacheEntry<K, V>> map;
51 public V get(K key) { in get()
55 CacheEntry<K, V> entry = map.get(key); in get()
67 CacheEntry<K, V> newEntry = new CacheEntry<>(key, newVal, queue); in get()
82 protected V put(K key, V value) { in put()
83 CacheEntry<K, V> entry = new CacheEntry<>(key, value, queue); in put()
84 CacheEntry<K, V> oldEntry = map.put(key, entry); in put()
91 CacheEntry<K, V> entry; in cleanStaleEntries()
92 while ((entry = (CacheEntry<K, V>)queue.poll()) != null) { in cleanStaleEntries()
[all …]

1234