Searched refs:untreeify (Results 1 – 3 of 3) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/ |
| D | HashMap.java | 1955 final Node<K,V> untreeify(HashMap<K,V> map) { in untreeify() method in HashMap.TreeNode
2047 tab[index] = first.untreeify(map); // too small in removeTreeNode()
2161 tab[index] = loHead.untreeify(map); in split()
2170 tab[index + bit] = hiHead.untreeify(map); in split()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | HashMap.java | 581 java.util.HashMap.Node<K, V> untreeify(java.util.HashMap<K, V> map) { in untreeify() method in HashMap.TreeNode
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 1167 setTabAt(tab, i, untreeify(t.first)); in replaceNode()
1859 setTabAt(tab, i, untreeify(t.first)); in computeIfPresent()
1987 setTabAt(tab, i, untreeify(t.first)); in compute()
2098 setTabAt(tab, i, untreeify(t.first)); in merge()
2545 ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) : in transfer()
2547 hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) : in transfer()
2702 static <K,V> Node<K,V> untreeify(Node<K,V> b) { in untreeify() method in ConcurrentHashMap
|