Lines Matching defs:Node
213 * Node.next) to better preserve locality, and to slightly
278 static class Node<K,V> implements Map.Entry<K,V> {
282 Node<K,V> next;
284 Node(int hash, K key, V value, Node<K,V> next) {
395 transient Node<K,V>[] table;
555 Node<K,V> e;
566 final Node<K,V> getNode(int hash, Object key) {
567 Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
626 Node<K,V>[] tab; Node<K,V> p; int n, i;
632 Node<K,V> e; K k;
676 final Node<K,V>[] resize() {
677 Node<K,V>[] oldTab = table;
703 Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
707 Node<K,V> e;
715 Node<K,V> loHead = null, loTail = null;
716 Node<K,V> hiHead = null, hiTail = null;
717 Node<K,V> next;
754 final void treeifyBin(Node<K,V>[] tab, int hash) {
755 int n, index; Node<K,V> e;
797 Node<K,V> e;
812 final Node<K,V> removeNode(int hash, Object key, Object value,
814 Node<K,V>[] tab; Node<K,V> p; int n, index;
817 Node<K,V> node = null, e; K k; V v;
858 Node<K,V>[] tab;
876 Node<K,V>[] tab; V v;
879 for (Node<K,V> e = tab[i]; e != null; e = e.next) {
925 Node<K,V>[] tab;
932 for (Node<K,V> e = tab[i]; e != null; e = e.next)
974 Node<K,V>[] tab;
981 for (Node<K,V> e = tab[i]; e != null; e = e.next)
1022 Node<K,V> candidate = getNode(hash(key), key);
1038 Node<K,V>[] tab;
1045 for (Node<K,V> e = tab[i]; e != null; e = e.next)
1058 Node<K,V> e;
1074 Node<K,V> e; V v;
1086 Node<K,V> e;
1102 Node<K,V>[] tab; Node<K,V> first; int n, i;
1105 Node<K,V> old = null;
1113 Node<K,V> e = first; K k;
1154 Node<K,V> e; V oldValue;
1176 Node<K,V>[] tab; Node<K,V> first; int n, i;
1179 Node<K,V> old = null;
1187 Node<K,V> e = first; K k;
1231 Node<K,V>[] tab; Node<K,V> first; int n, i;
1234 Node<K,V> old = null;
1242 Node<K,V> e = first; K k;
1284 Node<K,V>[] tab;
1291 for (Node<K,V> e = tab[i]; e != null; e = e.next)
1301 Node<K,V>[] tab;
1307 for (Node<K,V> e = tab[i]; e != null; e = e.next) {
1400 Node<K,V>[] tab = (Node<K,V>[])new Node[cap];
1418 Node<K,V> next; // next entry to return
1419 Node<K,V> current; // current entry
1425 Node<K,V>[] t = table;
1437 final Node<K,V> nextNode() {
1438 Node<K,V>[] t;
1439 Node<K,V> e = next;
1451 Node<K,V> p = current;
1483 Node<K,V> current; // current node
1505 Node<K,V>[] tab = m.table;
1537 Node<K,V>[] tab = m.table;
1546 Node<K,V> p = current;
1565 Node<K,V>[] tab = map.table;
1609 Node<K,V>[] tab = m.table;
1618 Node<K,V> p = current;
1637 Node<K,V>[] tab = map.table;
1680 Node<K,V>[] tab = m.table;
1689 Node<K,V> p = current;
1708 Node<K,V>[] tab = map.table;
1714 Node<K,V> e = current;
1745 Node<K,V> newNode(int hash, K key, V value, Node<K,V> next) {
1746 return new Node<>(hash, key, value, next);
1750 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) {
1751 return new Node<>(p.hash, p.key, p.value, next);
1755 TreeNode<K,V> newTreeNode(int hash, K key, V value, Node<K,V> next) {
1760 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) {
1778 void afterNodeAccess(Node<K,V> p) { }
1780 void afterNodeRemoval(Node<K,V> p) { }
1784 Node<K,V>[] tab;
1787 for (Node<K,V> e = tab[i]; e != null; e = e.next) {
1800 * extends Node) so can be used as extension of either regular or
1809 TreeNode(int hash, K key, V val, Node<K,V> next) {
1827 static <K,V> void moveRootToFront(Node<K,V>[] tab, TreeNode<K,V> root) {
1833 Node<K,V> rn;
1909 final void treeify(Node<K,V>[] tab) {
1955 final Node<K,V> untreeify(HashMap<K,V> map) {
1956 Node<K,V> hd = null, tl = null;
1957 for (Node<K,V> q = this; q != null; q = q.next) {
1958 Node<K,V> p = map.replacementNode(q, null);
1971 final TreeNode<K,V> putTreeVal(HashMap<K,V> map, Node<K,V>[] tab,
2001 Node<K,V> xpn = xp.next;
2027 final void removeTreeNode(HashMap<K,V> map, Node<K,V>[] tab,
2132 final void split(HashMap<K,V> map, Node<K,V>[] tab, int index, int bit) {