| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 631 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()
1607 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1618 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1640 boolean removeEntryIf(Predicate<? super Entry<K,V>> function) { in removeEntryIf()
1698 public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
[all …]
|
| D | ConcurrentMap.java | 112 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()
|
| D | ConcurrentSkipListMap.java | 403 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/ |
| D | LinkedHashMap.java | 218 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 …]
|
| D | HashMap.java | 284 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 …]
|
| D | TreeMap.java | 184 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 …]
|
| D | Map.java | 296 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()
|
| D | WeakHashMap.java | 254 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 …]
|
| D | Hashtable.java | 225 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
|
| D | IdentityHashMap.java | 264 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()
|
| D | AbstractMap.java | 279 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
633 public SimpleEntry(Entry<? extends K, ? extends V> entry) { in SimpleEntry()
763 public SimpleImmutableEntry(Entry<? extends K, ? extends V> entry) { in SimpleImmutableEntry()
|
| D | EnumMap.java | 149 public EnumMap(EnumMap<K, ? extends V> m) { in EnumMap() method in EnumMap
168 public EnumMap(Map<K, ? extends V> m) { in EnumMap()
333 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| D | GroupByOpTest.java | 155 …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/ |
| D | MapDefaultMethodTester.java | 100 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()
|
| D | CollectionsTest.java | 807 private static<K,V> void check_unmodifiableNavigableMap_defaultMethods(NavigableMap<K,V> map, in check_unmodifiableNavigableMap_defaultMethods()
922 private static<K,V> void check_unmodifiableOrderedMap_defaultMethods(Map<K,V> map, in check_unmodifiableOrderedMap_defaultMethods()
976 NavigableMap<K, V> map, List<K> keysInOrder, List<V> valuesInOrder, K absentKey) { in check_unmodifiableNavigableMap_collectionViews()
|
| D | EnumSetTest.java | 102 H, HE, LI, BE, B, C, N, O, F, NE, NA, MG, AL, SI, P, S, CL, AR, K, CA, SC, TI, V, CR, MN, enumConstant
|
| /libcore/ojluni/src/main/java/sun/security/provider/ |
| D | X509Factory.java | 216 private static synchronized <K,V> V getFromCache(Cache<K,V> cache, in getFromCache()
|
| /libcore/ojluni/src/main/java/sun/security/util/ |
| D | Cache.java | 116 public abstract void accept(CacheVisitor<K,V> visitor); in accept()
198 public void visit(Map<K,V> map); in visit()
239 public void accept(CacheVisitor<K,V> visitor) { in accept()
442 public synchronized void accept(CacheVisitor<K,V> visitor) { in accept()
|
| /libcore/ojluni/src/main/java/java/lang/reflect/ |
| D | WeakCache.java | 79 public WeakCache(BiFunction<K, P, ?> subKeyFactory, in WeakCache()
|
| /libcore/ojluni/src/main/java/java/text/ |
| D | AttributedString.java | 732 private static <K,V> boolean mapsDiffer(Map<K, V> last, Map<K, V> attrs) { in mapsDiffer()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | EnumSetTest.java | 44 … l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R… enumConstant
52 … v{}, w{}, x{}, y{}, z{}, A{}, B{}, C{}, D{}, E{}, F{}, G{}, H{}, I{}, J{}, K{}, L{}, M{}, N{}, O{… enumConstant
56 … l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R… enumConstant
|
| D | HashMapTest.java | 949 public SubMap(Map<? extends K, ? extends V> m) { in SubMap()
|
| /libcore/luni/src/test/java/libcore/java/lang/reflect/ |
| D | ReflectionTest.java | 634 interface K {} interface in ReflectionTest.HasMemberClasses
|