Home
last modified time | relevance | path

Searched refs:TreeNode (Results 1 – 4 of 4) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DHashMap.java574 if (first instanceof TreeNode) in getNode()
575 return ((TreeNode<K,V>)first).getTreeNode(hash, key); in getNode()
636 else if (p instanceof TreeNode) in putVal()
637 e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value); in putVal()
712 else if (e instanceof TreeNode) in resize()
713 ((TreeNode<K,V>)e).split(this, newTab, j, oldCap); in resize()
759 TreeNode<K,V> hd = null, tl = null; in treeifyBin()
761 TreeNode<K,V> p = replacementTreeNode(e, null); in treeifyBin()
822 if (p instanceof TreeNode) in removeNode()
823 node = ((TreeNode<K,V>)p).getTreeNode(hash, key); in removeNode()
[all …]
DLinkedHashMap.java294 TreeNode<K,V> newTreeNode(int hash, K key, V value, Node<K,V> next) { in newTreeNode()
295 TreeNode<K,V> p = new TreeNode<K,V>(hash, key, value, next); in newTreeNode()
300 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
302 TreeNode<K,V> t = new TreeNode<K,V>(q.hash, q.key, q.value, next); in replacementTreeNode()
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java227 java.util.HashMap.TreeNode<K, V> newTreeNode( in newTreeNode()
232 java.util.HashMap.TreeNode<K, V> replacementTreeNode( in replacementTreeNode()
549 static final class TreeNode<K, V> extends java.util.LinkedHashMap.LinkedHashMapEntry<K, V> { class in HashMap
551 TreeNode(int hash, K key, V val, java.util.HashMap.Node<K, V> next) { in TreeNode() method in HashMap.TreeNode
556 java.util.HashMap.TreeNode<K, V> root() { in root()
561 java.util.HashMap.Node<K, V>[] tab, java.util.HashMap.TreeNode<K, V> root) { in moveRootToFront()
565 java.util.HashMap.TreeNode<K, V> find(int h, java.lang.Object k, java.lang.Class<?> kc) { in find()
569 java.util.HashMap.TreeNode<K, V> getTreeNode(int h, java.lang.Object k) { in getTreeNode()
585 java.util.HashMap.TreeNode<K, V> putTreeVal( in putTreeVal()
603 static <K, V> java.util.HashMap.TreeNode<K, V> rotateLeft( in rotateLeft()
[all …]
DLinkedHashMap.java76 java.util.HashMap.TreeNode<K, V> newTreeNode( in newTreeNode()
81 java.util.HashMap.TreeNode<K, V> replacementTreeNode( in replacementTreeNode()