Lines Matching refs:Node
77 Node<K, V> root;
196 Node<K, V> node = removeInternalByKey(key);
240 Node<K, V> created = find(key, Relation.CREATE);
251 Node<K, V> find(K key, Relation relation) {
257 root = new Node<K, V>(null, key);
275 Node<K, V> nearest = root;
298 Node<K, V> child = (comparison < 0) ? nearest.left : nearest.right;
320 Node<K, V> created = new Node<K, V>(nearest, key);
338 Node<K, V> created = new Node<K, V>(nearest, key);
350 Node<K, V> findByObject(Object key) {
363 Node<K, V> findByEntry(Entry<?, ?> entry) {
364 Node<K, V> mine = findByObject(entry.getKey());
373 void removeInternal(Node<K, V> node) {
374 Node<K, V> left = node.left;
375 Node<K, V> right = node.right;
376 Node<K, V> originalParent = node.parent;
388 Node<K, V> adjacent = (left.height > right.height) ? left.last() : right.first();
425 Node<K, V> removeInternalByKey(Object key) {
426 Node<K, V> node = findByObject(key);
433 private void replaceInParent(Node<K, V> node, Node<K, V> replacement) {
434 Node<K, V> parent = node.parent;
459 private void rebalance(Node<K, V> unbalanced, boolean insert) {
460 for (Node<K, V> node = unbalanced; node != null; node = node.parent) {
461 Node<K, V> left = node.left;
462 Node<K, V> right = node.right;
468 Node<K, V> rightLeft = right.left;
469 Node<K, V> rightRight = right.right;
486 Node<K, V> leftLeft = left.left;
487 Node<K, V> leftRight = left.right;
522 private void rotateLeft(Node<K, V> root) {
523 Node<K, V> left = root.left;
524 Node<K, V> pivot = root.right;
525 Node<K, V> pivotLeft = pivot.left;
526 Node<K, V> pivotRight = pivot.right;
550 private void rotateRight(Node<K, V> root) {
551 Node<K, V> pivot = root.left;
552 Node<K, V> right = root.right;
553 Node<K, V> pivotLeft = pivot.left;
554 Node<K, V> pivotRight = pivot.right;
595 Node<K, V> result = root.first();
619 Node<K, V> result = root.last();
733 static class Node<K, V> implements Map.Entry<K, V> {
734 Node<K, V> parent;
735 Node<K, V> left;
736 Node<K, V> right;
741 Node(Node<K, V> parent, K key) {
747 Node<K, V> copy(Node<K, V> parent) {
748 Node<K, V> result = new Node<K, V>(parent, key);
796 Node<K, V> next() {
801 Node<K, V> node = this;
802 Node<K, V> parent = node.parent;
817 public Node<K, V> prev() {
822 Node<K, V> node = this;
823 Node<K, V> parent = node.parent;
837 public Node<K, V> first() {
838 Node<K, V> node = this;
839 Node<K, V> child = node.left;
850 public Node<K, V> last() {
851 Node<K, V> node = this;
852 Node<K, V> child = node.right;
866 protected Node<K, V> next;
867 protected Node<K, V> last;
870 MapIterator(Node<K, V> next) {
878 protected Node<K, V> stepForward() {
890 protected Node<K, V> stepBackward() {
938 Node<K, V> node = findByEntry((Entry<?, ?>) o);
1191 private Node<K, V> bound(Node<K, V> node, Bound fromBound, Bound toBound) {
1204 Node<K, V> result = endpoint(true);
1224 Node<K, V> result = endpoint(false);
1242 private Node<K, V> endpoint(boolean first) {
1243 Node<K, V> node;
1480 protected BoundedIterator(Node<K, V> next) {
1484 @Override protected Node<K, V> stepForward() {
1485 Node<K, V> result = super.stepForward();
1492 @Override protected Node<K, V> stepBackward() {
1493 Node<K, V> result = super.stepBackward();