Home
last modified time | relevance | path

Searched defs:K (Results 1 – 25 of 38) sorted by relevance

12

/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java46 public HashMap(java.util.Map<? extends K, ? extends V> m) { in HashMap()
66 final void putMapEntries(java.util.Map<? extends K, ? extends V> m, boolean evict) { in putMapEntries()
102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin()
106 public void putAll(java.util.Map<? extends K, ? extends V> m) { in putAll()
164 K key, java.util.function.Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
170 java.util.function.BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in computeIfPresent()
176 java.util.function.BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in compute()
187 public void forEach(java.util.function.BiConsumer<? super K, ? super V> action) { in forEach()
192 java.util.function.BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
217 java.util.HashMap.Node<K, V> newNode( in newNode()
[all …]
DLinkedHashMap.java45 public LinkedHashMap(java.util.Map<? extends K, ? extends V> m) { in LinkedHashMap()
53 private void linkNodeLast(java.util.LinkedHashMap.LinkedHashMapEntry<K, V> p) { in linkNodeLast()
58 java.util.LinkedHashMap.LinkedHashMapEntry<K, V> src, 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()
71 java.util.HashMap.Node<K, V> replacementNode( in replacementNode()
77 int hash, K key, V value, java.util.HashMap.Node<K, V> next) { in newTreeNode()
82 java.util.HashMap.Node<K, V> p, java.util.HashMap.Node<K, V> next) { in replacementTreeNode()
86 void afterNodeRemoval(java.util.HashMap.Node<K, V> e) { in afterNodeRemoval()
94 void afterNodeAccess(java.util.HashMap.Node<K, V> e) { in afterNodeAccess()
123 protected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest) { in removeEldestEntry()
[all …]
DCollections.java175 java.util.Map<? extends K, ? extends V> m) { in unmodifiableMap()
179 public static <K, V> java.util.SortedMap<K, V> unmodifiableSortedMap( in unmodifiableSortedMap()
184 public static <K, V> java.util.NavigableMap<K, V> unmodifiableNavigableMap( in unmodifiableNavigableMap()
223 public static <K, V> java.util.Map<K, V> synchronizedMap(java.util.Map<K, V> m) { in synchronizedMap()
227 public static <K, V> java.util.SortedMap<K, V> synchronizedSortedMap( in synchronizedSortedMap()
232 public static <K, V> java.util.NavigableMap<K, V> synchronizedNavigableMap( in synchronizedNavigableMap()
270 public static <K, V> java.util.Map<K, V> checkedMap( in checkedMap()
275 public static <K, V> java.util.SortedMap<K, V> checkedSortedMap( in checkedSortedMap()
280 public static <K, V> java.util.NavigableMap<K, V> checkedNavigableMap( in checkedNavigableMap()
730 java.util.Map<K, V> m, java.lang.Class<K> keyType, java.lang.Class<V> valueType) { in CheckedMap()
[all …]
/libcore/ojluni/annotations/sdk/nullability/java/util/concurrent/
DConcurrentHashMap.annotated.java58 …bcore.util.NonNull K,? extends @libcore.util.NonNull V> m) { throw new RuntimeException("Stub!"); } in ConcurrentHashMap()
76 …bcore.util.NonNull K,? extends @libcore.util.NonNull V> m) { throw new RuntimeException("Stub!"); } in putAll()
104 …re.util.NonNull K,? super @libcore.util.NonNull V> action) { throw new RuntimeException("Stub!"); } in forEach()
106 …ull K,? super @libcore.util.NonNull V,? extends @libcore.util.NonNull V> function) { throw new Run… in replaceAll()
108 …Absent(@libcore.util.NonNull K key, @libcore.util.NonNull java.util.function.Function<? super @lib… in computeIfAbsent()
110 …esent(@libcore.util.NonNull K key, @libcore.util.NonNull java.util.function.BiFunction<? super @li… in computeIfPresent()
112 …mpute(@libcore.util.NonNull K key, @libcore.util.NonNull java.util.function.BiFunction<? super @li… in compute()
130 …forEach(long parallelismThreshold, @libcore.util.NonNull java.util.function.BiConsumer<? super @li… in forEach()
132 …forEach(long parallelismThreshold, @libcore.util.NonNull java.util.function.BiFunction<? super @li… in forEach()
134 … search(long parallelismThreshold, @libcore.util.NonNull java.util.function.BiFunction<? super @li… in search()
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java631 Node(int hash, K key, V val, Node<K,V> next) { in Node() method in ConcurrentHashMap.Node
762 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
766 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
771 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
858 public ConcurrentHashMap(Map<? extends K, ? extends V> m) { in ConcurrentHashMap()
1091 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1608 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1619 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1641 boolean removeEntryIf(Predicate<? super Entry<K,V>> function) { in removeEntryIf()
1699 public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
[all …]
DConcurrentMap.java112 default void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
287 default void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
328 Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
370 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in computeIfPresent()
418 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in compute()
DConcurrentSkipListMap.java403 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { in casHead()
424 Node(K key, Object value, Node<K,V> next) { in Node() method in ConcurrentSkipListMap.Node
437 Node(Node<K,V> next) { in Node() method in ConcurrentSkipListMap.Node
453 boolean casNext(Node<K,V> cmp, Node<K,V> val) { in casNext()
483 boolean appendMarker(Node<K,V> f) { in appendMarker()
494 void helpDelete(Node<K,V> b, Node<K,V> f) { in helpDelete()
570 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { in Index() method in ConcurrentSkipListMap.Index
579 final boolean casRight(Index<K,V> cmp, Index<K,V> val) { in casRight()
599 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { in link()
612 final boolean unlink(Index<K,V> succ) { in unlink()
[all …]
/libcore/ojluni/src/main/java/java/util/
DLinkedHashMap.java218 LinkedHashMapEntry(int hash, K key, V value, Node<K,V> next) { in LinkedHashMapEntry()
246 private void linkNodeLast(LinkedHashMapEntry<K,V> p) { in linkNodeLast()
258 private void transferLinks(LinkedHashMapEntry<K,V> src, in transferLinks()
279 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
286 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
294 TreeNode<K,V> newTreeNode(int hash, K key, V value, Node<K,V> next) { in newTreeNode()
300 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
307 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
329 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
405 public LinkedHashMap(Map<? extends K, ? extends V> m) { in LinkedHashMap()
[all …]
DHashMap.java284 Node(int hash, K key, V value, Node<K,V> next) { in Node() method in HashMap.Node
487 public HashMap(Map<? extends K, ? extends V> m) { in HashMap()
499 final void putMapEntries(Map<? extends K, ? extends V> m, boolean evict) { in putMapEntries()
754 final void treeifyBin(Node<K,V>[] tab, int hash) { in treeifyBin()
783 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1037 public final void forEach(Consumer<? super Map.Entry<K,V>> action) { in forEach()
1098 Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
1151 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in computeIfPresent()
1172 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in compute()
1283 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
[all …]
DTreeMap.java184 public TreeMap(Map<? extends K, ? extends V> m) { in TreeMap()
198 public TreeMap(SortedMap<K, ? extends V> m) { in TreeMap()
313 public void putAll(Map<? extends K, ? extends V> map) { in putAll()
1002 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1015 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1197 PrivateEntryIterator(TreeMapEntry<K,V> first) { in PrivateEntryIterator()
1244 EntryIterator(TreeMapEntry<K,V> first) { in EntryIterator()
1253 ValueIterator(TreeMapEntry<K,V> first) { in ValueIterator()
1262 KeyIterator(TreeMapEntry<K,V> first) { in KeyIterator()
1271 DescendingKeyIterator(TreeMapEntry<K,V> first) { in DescendingKeyIterator()
[all …]
DMap.java296 void putAll(Map<? extends K, ? extends V> m); in putAll()
618 default void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
673 default void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
967 Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
1044 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in computeIfPresent()
1136 BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in compute()
DWeakHashMap.java254 public WeakHashMap(Map<? extends K, ? extends V> m) { in WeakHashMap()
511 private void transfer(Entry<K,V>[] src, Entry<K,V>[] dest) { in transfer()
540 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
712 int hash, Entry<K,V> next) { in Entry()
1016 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1038 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1070 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, in WeakHashMapSpliterator()
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator()
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator()
1257 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in EntrySpliterator()
[all …]
DHashtable.java225 public Hashtable(Map<? extends K, ? extends V> t) { in Hashtable()
523 public synchronized void putAll(Map<? extends K, ? extends V> t) { in putAll()
692 public boolean add(Map.Entry<K,V> o) { in add()
872 public synchronized void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
892 public synchronized void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1001 public synchronized V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
1025 …public synchronized V computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remapp… in computeIfPresent()
1054 …public synchronized V compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFuncti… in compute()
1271 protected HashtableEntry(int hash, K key, V value, HashtableEntry<K,V> next) { in HashtableEntry() method in Hashtable.HashtableEntry
DIdentityHashMap.java264 public IdentityHashMap(Map<? extends K, ? extends V> m) { in IdentityHashMap()
498 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1343 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1362 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, in IdentityHashMapSpliterator()
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator()
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator()
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in EntrySpliterator()
1546 public void forEachRemaining(Consumer<? super Map.Entry<K, V>> action) { in forEachRemaining()
1570 public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) { in tryAdvance()
/libcore/ojluni/annotations/sdk/nullability/java/util/
DHashMap.annotated.java39 …peParam K, ? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in HashMap()
51 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in putAll()
75 ….util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.Function<? super @libcore.… in computeIfAbsent()
77 …util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.BiFunction<? super @libcore… in computeIfPresent()
79 …util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.BiFunction<? super @libcore… in compute()
83 …ypeParam K,? super @libcore.util.NullFromTypeParam V> action) { throw new RuntimeException("Stub!"… in forEach()
85 …omTypeParam K,? super @libcore.util.NullFromTypeParam V,? extends @libcore.util.NullFromTypeParam … in replaceAll()
DWeakHashMap.annotated.java41 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in WeakHashMap()
53 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in putAll()
67 …ypeParam K,? super @libcore.util.NullFromTypeParam V> action) { throw new RuntimeException("Stub!"… in forEach()
69 …omTypeParam K,? super @libcore.util.NullFromTypeParam V,? extends @libcore.util.NullFromTypeParam … in replaceAll()
DMap.annotated.java48 …il.Map<? extends @libcore.util.NullFromTypeParam K,? extends @libcore.util.NullFromTypeParam V> m); in putAll()
64 …ullFromTypeParam K,? super @libcore.util.NullFromTypeParam V> action) { throw new RuntimeException… in forEach()
66 …l.NullFromTypeParam K,? super @libcore.util.NullFromTypeParam V,? extends @libcore.util.NullFromTy… in replaceAll()
76 ….util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.Function<? super @libcore.… in computeIfAbsent()
78 …util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.BiFunction<? super @libcore… in computeIfPresent()
80 …util.NullFromTypeParam K key, @libcore.util.NonNull java.util.function.BiFunction<? super @libcore… in compute()
DCollections.annotated.java84 …il.NullFromTypeParam V> unmodifiableMap(@libcore.util.NonNull java.util.Map<? extends @libcore.uti… in unmodifiableMap()
86 …ore.util.NullFromTypeParam V> unmodifiableSortedMap(@libcore.util.NonNull java.util.SortedMap<@lib… in unmodifiableSortedMap()
88 …ibcore.util.NullFromTypeParam V> unmodifiableNavigableMap(@libcore.util.NonNull java.util.Navigabl… in unmodifiableNavigableMap()
100 …il.NullFromTypeParam V> synchronizedMap(@libcore.util.NonNull java.util.Map<@libcore.util.NullFrom… in synchronizedMap()
102 …ore.util.NullFromTypeParam V> synchronizedSortedMap(@libcore.util.NonNull java.util.SortedMap<@lib… in synchronizedSortedMap()
104 …ibcore.util.NullFromTypeParam V> synchronizedNavigableMap(@libcore.util.NonNull java.util.Navigabl… in synchronizedNavigableMap()
118 …il.NullFromTypeParam V> checkedMap(@libcore.util.NonNull java.util.Map<@libcore.util.NullFromTypeP… in checkedMap()
120 …ore.util.NullFromTypeParam V> checkedSortedMap(@libcore.util.NonNull java.util.SortedMap<@libcore.… in checkedSortedMap()
122 …ibcore.util.NullFromTypeParam V> checkedNavigableMap(@libcore.util.NonNull java.util.NavigableMap<… in checkedNavigableMap()
DTreeMap.annotated.java38 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in TreeMap()
40 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in TreeMap()
56 …eParam K,? extends @libcore.util.NullFromTypeParam V> map) { throw new RuntimeException("Stub!"); } in putAll()
118 …ypeParam K,? super @libcore.util.NullFromTypeParam V> action) { throw new RuntimeException("Stub!"… in forEach()
120 …omTypeParam K,? super @libcore.util.NullFromTypeParam V,? extends @libcore.util.NullFromTypeParam … in replaceAll()
DAbstractMap.annotated.java50 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new RuntimeException("Stub!"); } in putAll()
73 …ram K, ? extends @libcore.util.NullFromTypeParam V> entry) { throw new RuntimeException("Stub!"); } in SimpleEntry()
93 …ypeParam K,? extends @libcore.util.NullFromTypeParam V> entry) { throw new RuntimeException("Stub!… in SimpleImmutableEntry()
/libcore/ojluni/annotations/mmodule/java/util/
DLinkedHashMap.annotated.java39 public LinkedHashMap(java.util.Map<? extends K, ? extends V> m) { throw new RuntimeException("Stub!… in LinkedHashMap()
54 protected boolean removeEldestEntry(java.util.Map.Entry<K,V> eldest) { throw new RuntimeException("… in removeEldestEntry()
62 public void forEach(java.util.function.BiConsumer<? super K,? super V> action) { throw new RuntimeE… in forEach()
64 public void replaceAll(java.util.function.BiFunction<? super K,? super V,? extends V> function) { t… in replaceAll()
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DGroupByOpTest.java155 …static <K, V> void assertMultiMapEquals(Map<K, ? extends Collection<V>> a, Map<K, ? extends Collec… in assertMultiMapEquals()
159 …static<K, V> boolean multiMapEquals(Map<K, ? extends Collection<V>> a, Map<K, ? extends Collection… in multiMapEquals()
/libcore/luni/src/test/java/libcore/java/util/
DMapDefaultMethodTester.java100 V expected, Map<K, V> map, K key, V defaultValue) { in checkGetOrDefault()
110 private static<K, V> V getOrDefault_hashMap(Map<K, V> map, K key, V defaultValue) { in getOrDefault_hashMap()
118 private static<K, V> V getOrDefault_optimizeForAbsent(Map<K, V> map, K key, V defaultValue) { in getOrDefault_optimizeForAbsent()
126 private static<K, V> V getOrDefault_optimizeForPresent(Map<K, V> map, K key, V defaultValue) { in getOrDefault_optimizeForPresent()
/libcore/ojluni/annotations/hiddenapi/sun/security/util/
DCache.java56 public abstract void accept(sun.security.util.Cache.CacheVisitor<K, V> visitor); in accept()
82 public void visit(java.util.Map<K, V> map); in visit()
/libcore/ojluni/annotations/hiddenapi/sun/security/provider/
DX509Factory.java51 sun.security.util.Cache<K, V> cache, byte[] encoding) { in getFromCache()

12