Searched refs:tab (Results 1 – 7 of 7) sorted by relevance
| /libcore/ojluni/src/main/java/java/lang/ |
| D | ThreadLocal.java | 433 Entry[] tab = table; in getEntryAfterMiss() local
434 int len = tab.length; in getEntryAfterMiss()
444 e = tab[i]; in getEntryAfterMiss()
462 Entry[] tab = table; in set() local
463 int len = tab.length; in set()
466 for (Entry e = tab[i]; in set()
468 e = tab[i = nextIndex(i, len)]) { in set()
482 tab[i] = new Entry(key, value); in set()
492 Entry[] tab = table; in remove() local
493 int len = tab.length; in remove()
[all …]
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | Hashtable.java | 298 HashtableEntry<?,?> tab[] = table; in contains() local
299 for (int i = tab.length ; i-- > 0 ;) { in contains()
300 for (HashtableEntry<?,?> e = tab[i] ; e != null ; e = e.next) { in contains()
336 HashtableEntry<?,?> tab[] = table; in containsKey() local
338 int index = (hash & 0x7FFFFFFF) % tab.length; in containsKey()
339 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) { in containsKey()
364 HashtableEntry<?,?> tab[] = table; in get() local
366 int index = (hash & 0x7FFFFFFF) % tab.length; in get()
367 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) { in get()
424 HashtableEntry<?,?> tab[] = table; in addEntry() local
[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 | 3686 long[] tab = LONG_TEN_POWERS_TABLE; in longMultiplyPowerTen() local
3688 if (n < tab.length && n < bounds.length) { in longMultiplyPowerTen()
3689 long tenpower = tab[n]; in longMultiplyPowerTen()
3830 long[] tab = LONG_TEN_POWERS_TABLE; in longDigitLength() local
3832 return (r >= tab.length || x < tab[r]) ? r : r + 1; in longDigitLength()
|