Lines Matching defs:right
80 * +-+ right +-+ +-+
285 * Index: q, r, d for index node, right, down.
514 volatile Index<K,V> right;
519 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) {
522 this.right = right;
526 * compareAndSet right field
550 newSucc.right = succ;
555 * Tries to CAS right field to skip over apparent successor
562 return !indexesDeletedNode() && casRight(succ, succ.right);
573 (k.getDeclaredField("right"));
587 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) {
588 super(node, down, right);
607 * Comparators vs Comparables, which seems like the right
687 Index<K,V> r = q.right;
695 r = q.right; // reread r
700 r = r.right;
707 r = d.right;
901 * with initialized right pointers. Which in turn requires
952 Index<K,V> r = q.right;
962 r = q.right;
967 r = r.right;
991 r = q.right;
1051 if (head.right == null)
1086 e.right == null &&
1087 d.right == null &&
1088 h.right == null &&
1090 h.right != null) // recheck
1146 Index<K,V> r = q.right;
1150 if (head.right == null)
1174 if ((r = q.right) != null) {
1219 if ((r = q.right) != null) {
1277 if (head.right == null)
1468 preds.get(i).right = idx;
1556 preds.get(i).right = idx;