| /libcore/ojluni/src/main/java/java/lang/ |
| D | ThreadLocal.java | 453 Entry[] tab = table; in getEntryAfterMiss() local
454 int len = tab.length; in getEntryAfterMiss()
464 e = tab[i]; in getEntryAfterMiss()
482 Entry[] tab = table; in set() local
483 int len = tab.length; in set()
486 for (Entry e = tab[i]; in set()
488 e = tab[i = nextIndex(i, len)]) { in set()
504 tab[i] = new Entry(key, value); in set()
514 Entry[] tab = table; in remove() local
515 int len = tab.length; in remove()
[all …]
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | IdentityHashMap.java | 331 Object[] tab = table; in get() local
332 int len = tab.length; in get()
335 Object item = tab[i]; in get()
337 return (V) tab[i + 1]; in get()
355 Object[] tab = table; in containsKey() local
356 int len = tab.length; in containsKey()
359 Object item = tab[i]; in containsKey()
378 Object[] tab = table; in containsValue() local
379 for (int i = 1; i < tab.length; i += 2) in containsValue()
380 if (tab[i] == value && tab[i - 1] != null) in containsValue()
[all …]
|
| D | Hashtable.java | 315 HashtableEntry<?,?> tab[] = table; in contains() local
316 for (int i = tab.length ; i-- > 0 ;) { in contains()
317 for (HashtableEntry<?,?> e = tab[i] ; e != null ; e = e.next) { in contains()
353 HashtableEntry<?,?> tab[] = table; in containsKey() local
355 int index = (hash & 0x7FFFFFFF) % tab.length; in containsKey()
356 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) { in containsKey()
381 HashtableEntry<?,?> tab[] = table; in get() local
383 int index = (hash & 0x7FFFFFFF) % tab.length; in get()
384 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) { in get()
439 HashtableEntry<?,?> tab[] = table; in addEntry() local
[all …]
|
| D | HashMap.java | 573 Node<K,V>[] tab; Node<K,V> first, e; int n, hash; K k; in getNode() local
574 if ((tab = table) != null && (n = tab.length) > 0 && in getNode()
575 (first = tab[(n - 1) & (hash = hash(key))]) != null) { in getNode()
632 Node<K,V>[] tab; Node<K,V> p; int n, i; in putVal() local
633 if ((tab = table) == null || (n = tab.length) == 0) in putVal()
634 n = (tab = resize()).length; in putVal()
635 if ((p = tab[i = (n - 1) & hash]) == null) in putVal()
636 tab[i] = newNode(hash, key, value, null); in putVal()
643 e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value); in putVal()
649 treeifyBin(tab, hash); in putVal()
[all …]
|
| D | WeakHashMap.java | 403 Entry<K,V>[] tab = getTable(); in get() local
404 int index = indexFor(h, tab.length); in get()
405 Entry<K,V> e = tab[index]; in get()
433 Entry<K,V>[] tab = getTable(); in getEntry() local
434 int index = indexFor(h, tab.length); in getEntry()
435 Entry<K,V> e = tab[index]; in getEntry()
456 Entry<K,V>[] tab = getTable(); in put() local
457 int i = indexFor(h, tab.length); in put()
459 for (Entry<K,V> e = tab[i]; e != null; e = e.next) { in put()
469 Entry<K,V> e = tab[i]; in put()
[all …]
|
| /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() argument
760 return (Node<K,V>)U.getReferenceAcquire(tab, ((long)i << ASHIFT) + ABASE); in tabAt()
763 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt() argument
765 return U.compareAndSetReference(tab, ((long)i << ASHIFT) + ABASE, c, v); in casTabAt()
768 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt() argument
769 U.putReferenceRelease(tab, ((long)i << ASHIFT) + ABASE, v); in setTabAt()
935 Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek; in get() local
937 if ((tab = table) != null && (n = tab.length) > 0 && in get()
938 (e = tabAt(tab, (n - 1) & h)) != null) { in get()
1014 for (Node<K,V>[] tab = table;;) { in putVal()
[all …]
|
| /libcore/luni/src/test/resources/out_hb/ |
| D | staff.out | 13 This is an adjacent CDATASection with a reference to a tab &tab;
|
| /libcore/luni/src/test/resources/out_dh/ |
| D | staff.out | 13 This is an adjacent CDATASection with a reference to a tab &tab;
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | HashMap.java | 102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin() argument
561 java.util.HashMap.Node<K, V>[] tab, java.util.HashMap.TreeNode<K, V> root) { in moveRootToFront() argument
577 void treeify(java.util.HashMap.Node<K, V>[] tab) { in treeify() argument
586 java.util.HashMap<K, V> map, java.util.HashMap.Node<K, V>[] tab, int h, K k, V v) { in putTreeVal() argument
591 java.util.HashMap<K, V> map, java.util.HashMap.Node<K, V>[] tab, boolean movable) { in removeTreeNode() argument
597 java.util.HashMap.Node<K, V>[] tab, in split() argument
|
| /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
137 .terminal(s -> s, s -> s.collect(tab)) in testOps()
|
| /libcore/ojluni/src/main/java/java/math/ |
| D | BigDecimal.java | 4220 long[] tab = LONG_TEN_POWERS_TABLE;
4222 if (n < tab.length && n < bounds.length) {
4223 long tenpower = tab[n];
4388 long[] tab = LONG_TEN_POWERS_TABLE;
4390 return (r >= tab.length || x < tab[r]) ? r : r + 1;
|
| /libcore/tools/expected_upstream/ |
| D | README.md | 62 $ ojluni_modify_expectation modify java.lang.Str # <tab>
|
| /libcore/ojluni/src/main/ |
| D | NOTICE | 48 * tab size: 8 (not used)
|