Lines Matching refs:node
1546 TreeMap.Entry node = m.getEntry(key);
1547 return node != null &&
1548 valEquals(node.getValue(), entry.getValue());
1558 TreeMap.Entry<K,V> node = m.getEntry(key);
1559 if (node!=null && valEquals(node.getValue(),
1561 m.deleteEntry(node);
2135 * Delete node p, and then rebalance the tree.
2150 // Start fixup at replacement node, if it exists.
2169 } else if (p.parent == null) { // return if we are the only node.
2433 * node. (The answer is ~lg(N), but in any case must be computed by same