| /libcore/ojluni/src/main/java/java/util/ |
| D | Hashtable.java | 298 HashtableEntry<?,?> tab[] = table; in contains() local
336 HashtableEntry<?,?> tab[] = table; in containsKey() local
364 HashtableEntry<?,?> tab[] = table; in get() local
424 HashtableEntry<?,?> tab[] = table; in addEntry() local
465 HashtableEntry<?,?> tab[] = table; in put() local
492 HashtableEntry<?,?> tab[] = table; in remove() local
532 HashtableEntry<?,?> tab[] = table; in clear() local
701 HashtableEntry<?,?>[] tab = table; in contains() local
716 HashtableEntry<?,?>[] tab = table; in remove() local
851 HashtableEntry<?,?>[] tab = table; in hashCode() local
[all …]
|
| D | IdentityHashMap.java | 326 Object[] tab = table; in get() local
350 Object[] tab = table; in containsKey() local
373 Object[] tab = table; in containsValue() local
391 Object[] tab = table; in containsMapping() local
423 final Object[] tab = table; in put() local
520 Object[] tab = table; in remove() local
552 Object[] tab = table; in removeMapping() local
583 Object[] tab = table; in closeDeletion() local
616 Object[] tab = table; in clear() local
683 Object[] tab = table; in hashCode() local
[all …]
|
| D | HashMap.java | 567 Node<K,V>[] tab; Node<K,V> first, e; int n; K k; in getNode() local
626 Node<K,V>[] tab; Node<K,V> p; int n, i; in putVal() local
754 final void treeifyBin(Node<K,V>[] tab, int hash) { in treeifyBin()
814 Node<K,V>[] tab; Node<K,V> p; int n, index; in removeNode() local
858 Node<K,V>[] tab; in clear() local
876 Node<K,V>[] tab; V v; in containsValue() local
925 Node<K,V>[] tab; in forEach() local
974 Node<K,V>[] tab; in forEach() local
1038 Node<K,V>[] tab; in forEach() local
1102 Node<K,V>[] tab; Node<K,V> first; int n, i; in computeIfAbsent() local
[all …]
|
| D | WeakHashMap.java | 398 Entry<K,V>[] tab = getTable(); in get() local
428 Entry<K,V>[] tab = getTable(); in getEntry() local
451 Entry<K,V>[] tab = getTable(); in put() local
593 Entry<K,V>[] tab = getTable(); in remove() local
691 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 | 433 Entry[] tab = table; in getEntryAfterMiss() local
462 Entry[] tab = table; in set() local
494 Entry[] tab = table; in remove() local
526 Entry[] tab = table; in replaceStaleEntry() local
597 Entry[] tab = table; in expungeStaleEntry() local
658 Entry[] tab = table; in cleanSomeSlots() local
721 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
2230 ForwardingNode(Node<K,V>[] tab) { in ForwardingNode()
2289 Node<K,V>[] tab; int sc; in initTable() local
2339 Node<K,V>[] tab, nt; int n, sc; in addCount() local
2362 final Node<K,V>[] helpTransfer(Node<K,V>[] tab, Node<K,V> f) { in helpTransfer()
[all …]
|