| /libcore/ojluni/src/main/java/java/util/ |
| D | Hashtable.java | 315 HashtableEntry<?,?> tab[] = table; in contains() local
353 HashtableEntry<?,?> tab[] = table; in containsKey() local
381 HashtableEntry<?,?> tab[] = table; in get() local
439 HashtableEntry<?,?> tab[] = table; in addEntry() local
481 HashtableEntry<?,?> tab[] = table; in put() local
508 HashtableEntry<?,?> tab[] = table; in remove() local
548 HashtableEntry<?,?> tab[] = table; in clear() local
721 HashtableEntry<?,?>[] tab = table; in contains() local
735 HashtableEntry<?,?>[] tab = table; in remove() local
867 HashtableEntry<?,?>[] tab = table; in hashCode() local
[all …]
|
| D | HashMap.java | 573 Node<K,V>[] tab; Node<K,V> first, e; int n, hash; K k; in getNode() local
632 Node<K,V>[] tab; Node<K,V> p; int n, i; in putVal() local
760 final void treeifyBin(Node<K,V>[] tab, int hash) { in treeifyBin()
820 Node<K,V>[] tab; Node<K,V> p; int n, index; in removeNode() local
864 Node<K,V>[] tab; in clear() local
882 Node<K,V>[] tab; V v; in containsValue() local
952 Node<K,V>[] tab; in keysToArray() local
975 Node<K,V>[] tab; in valuesToArray() local
1008 Node<K,V>[] tab; in forEach() local
1066 Node<K,V>[] tab; in forEach() local
[all …]
|
| D | IdentityHashMap.java | 331 Object[] tab = table; in get() local
355 Object[] tab = table; in containsKey() local
378 Object[] tab = table; in containsValue() local
396 Object[] tab = table; in containsMapping() local
428 final Object[] tab = table; in put() local
525 Object[] tab = table; in remove() local
557 Object[] tab = table; in removeMapping() local
588 Object[] tab = table; in closeDeletion() local
621 Object[] tab = table; in clear() local
686 Object[] tab = table; in hashCode() local
[all …]
|
| D | WeakHashMap.java | 403 Entry<K,V>[] tab = getTable(); in get() local
433 Entry<K,V>[] tab = getTable(); in getEntry() local
456 Entry<K,V>[] tab = getTable(); in put() local
597 Entry<K,V>[] tab = getTable(); in remove() local
694 Entry<K,V>[] tab = getTable(); in containsNullValue() local
1021 Entry<K, V>[] tab = getTable(); in forEach() local
1043 Entry<K, V>[] tab = getTable();; in replaceAll() local
1118 WeakHashMap.Entry<K,V>[] tab = m.table; in forEachRemaining() local
1151 WeakHashMap.Entry<K,V>[] tab = map.table; in tryAdvance() local
1198 WeakHashMap.Entry<K,V>[] tab = m.table; in forEachRemaining() local
[all …]
|
| /libcore/ojluni/src/main/java/java/lang/ |
| D | ThreadLocal.java | 453 Entry[] tab = table; in getEntryAfterMiss() local
482 Entry[] tab = table; in set() local
514 Entry[] tab = table; in remove() local
546 Entry[] tab = table; in replaceStaleEntry() local
617 Entry[] tab = table; in expungeStaleEntry() local
678 Entry[] tab = table; in cleanSomeSlots() local
740 Entry[] tab = table; in expungeStaleEntries() local
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | HashMap.java | 102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin()
561 java.util.HashMap.Node<K, V>[] tab, java.util.HashMap.TreeNode<K, V> root) { in moveRootToFront()
577 void treeify(java.util.HashMap.Node<K, V>[] tab) { in treeify()
586 java.util.HashMap<K, V> map, java.util.HashMap.Node<K, V>[] tab, int h, K k, V v) { in putTreeVal()
591 java.util.HashMap<K, V> map, java.util.HashMap.Node<K, V>[] tab, boolean movable) { in removeTreeNode()
597 java.util.HashMap.Node<K, V>[] tab, in split()
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| D | GroupByOpTest.java | 134 Collector<Integer, ?, Map<Object, List<Integer>>> tab = Collectors.groupingBy(md.m); in testOps() local
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 759 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
763 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
768 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
935 Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek; in get() local
1189 Node<K,V>[] tab = table; in clear() local
1475 Node<K,V>[] tab = (Node<K,V>[])new Node<?,?>[n]; in readObject() local
2238 ForwardingNode(Node<K,V>[] tab) { in ForwardingNode()
2297 Node<K,V>[] tab; int sc; in initTable() local
2347 Node<K,V>[] tab, nt; int n, sc; in addCount() local
2368 final Node<K,V>[] helpTransfer(Node<K,V>[] tab, Node<K,V> f) { in helpTransfer()
[all …]
|