Searched defs:TreeNode (Results 1 - 2 of 2) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DHashMap.java149 * relay to TreeNode methods when applicable (simply by checking
202 * (method TreeNode.root()).
276 * TreeNode subclass, and in LinkedHashMap for its Entry subclass.)
574 if (first instanceof TreeNode)
575 return ((TreeNode<K,V>)first).getTreeNode(hash, key);
636 else if (p instanceof TreeNode)
637 e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
712 else if (e instanceof TreeNode)
713 ((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
759 TreeNode<
1803 static final class TreeNode<K,V> extends LinkedHashMap.LinkedHashMapEntry<K,V> { class in class:HashMap
1809 TreeNode(int hash, K key, V val, Node<K,V> next) { method in class:HashMap.TreeNode
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java1157 TreeNode<K,V> r, p;
1514 TreeNode<K,V> hd = null, tl = null;
1516 TreeNode<K,V> t = new TreeNode<K,V>
1756 TreeNode<K,V> r, p;
1849 TreeNode<K,V> r, p;
1968 TreeNode<K,V> r, p;
2081 TreeNode<K,V> r = t.root;
2082 TreeNode<K,V> p = (r == null) ? null :
2520 TreeNode<
2718 static final class TreeNode<K,V> extends Node<K,V> { class in class:ConcurrentHashMap
2725 TreeNode(int hash, K key, V val, Node<K,V> next, method in class:ConcurrentHashMap.TreeNode
[all...]

Completed in 12 milliseconds