Lines Matching defs:Node
347 * Node: b, n, f for predecessor, node, successor
396 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null),
416 static final class Node<K,V> {
419 volatile Node<K,V> next;
424 Node(K key, Object value, Node<K,V> next) {
437 Node(Node<K,V> next) {
453 boolean casNext(Node<K,V> cmp, Node<K,V> val) {
483 boolean appendMarker(Node<K,V> f) {
484 return casNext(f, new Node<K,V>(f));
494 void helpDelete(Node<K,V> b, Node<K,V> f) {
502 casNext(f, new Node<K,V>(f));
544 (Node.class.getDeclaredField("value"));
546 (Node.class.getDeclaredField("next"));
563 final Node<K,V> node;
570 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) {
600 Node<K,V> n = node;
636 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) {
663 private Node<K,V> findPredecessor(Object key, Comparator<? super K> cmp) {
669 Node<K,V> n = r.node;
735 private Node<K,V> findNode(Object key) {
740 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
744 Node<K,V> f = n.next;
776 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
780 Node<K,V> f = n.next;
813 Node<K,V> z; // added node
818 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
821 Node<K,V> f = n.next;
845 z = new Node<K,V>(key, value, n);
875 Node<K,V> oldbase = h.node;
892 Node<K,V> n = r.node;
955 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
959 Node<K,V> f = n.next;
1034 final Node<K,V> findFirst() {
1035 for (Node<K,V> b, n;;) {
1049 for (Node<K,V> b, n;;) {
1052 Node<K,V> f = n.next;
1095 Node<K,V> b = findPredecessorOfLast();
1096 Node<K,V> n = b.next;
1104 Node<K,V> f = n.next;
1141 final Node<K,V> findLast() {
1160 for (Node<K,V> b = q.node, n = b.next;;) {
1163 Node<K,V> f = n.next; // inconsistent read
1188 private Node<K,V> findPredecessorOfLast() {
1225 final Node<K,V> findNear(K key, int rel, Comparator<? super K> cmp) {
1229 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
1233 Node<K,V> f = n.next;
1263 Node<K,V> n = findNear(key, rel, cmp);
1357 Node<K,V> basepred = h.node;
1388 Node<K,V> z = new Node<K,V>(k, v, null);
1428 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1462 Node<K,V> basepred = h.node;
1489 Node<K,V> z = new Node<K,V>(key, val, null);
1608 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1634 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1699 Node<K,V> n; Object v;
1733 Node<K,V> n; Object v; V r;
1773 Node<K,V> n; Object v; V r;
1984 Node<K,V> n; Object v;
2009 Node<K,V> n; Object v;
2029 Node<K,V> n = findFirst();
2039 Node<K,V> n = findLast();
2133 Node<K,V> n = findNear(key, LT, comparator);
2157 Node<K,V> n = findNear(key, LT|EQ, comparator);
2179 Node<K,V> n = findNear(key, GT|EQ, comparator);
2203 Node<K,V> n = findNear(key, GT, comparator);
2215 Node<K,V> n = findFirst();
2232 Node<K,V> n = findLast();
2269 Node<K,V> lastReturned;
2271 Node<K,V> next;
2307 Node<K,V> l = lastReturned;
2328 Node<K,V> n = next;
2336 Node<K,V> n = next;
2635 boolean isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n,
2654 ConcurrentSkipListMap.Node<K,V> loNode(Comparator<? super K> cmp) {
2667 ConcurrentSkipListMap.Node<K,V> hiNode(Comparator<? super K> cmp) {
2681 ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
2693 ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
2705 ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
2717 ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
2729 Node<K,V> n = loNode(cmp);
2744 Node<K,V> n = hiNode(cmp);
2772 Node<K,V> n = m.findNear(key, rel, cmp);
2793 ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
2801 ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
2811 Node<K,V> n = m.findNear(key, rel, cmp);
2845 for (ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
2863 for (ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
2875 for (ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
3081 Node<K,V> lastReturned;
3083 Node<K,V> next;
3159 Node<K,V> l = lastReturned;
3202 Node<K,V> n = next;
3217 Node<K,V> n = next;
3233 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
3242 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
3258 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
3276 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
3308 Node<K,V> current; // current traversal node; initialize at origin
3311 Node<K,V> origin, K fence, int est) {
3322 Node<K,V> origin, K fence, int est) {
3327 Node<K,V> e; K ek;
3332 Index<K,V> s; Node<K,V> b, n; K sk;
3352 Node<K,V> e = current;
3367 Node<K,V> e = current;
3398 HeadIndex<K,V> h; Node<K,V> p;
3399 Node<K,V> b = (h = head).node;
3410 Node<K,V> origin, K fence, int est) {
3415 Node<K,V> e; K ek;
3420 Index<K,V> s; Node<K,V> b, n; K sk;
3440 Node<K,V> e = current;
3457 Node<K,V> e = current;
3485 HeadIndex<K,V> h; Node<K,V> p;
3486 Node<K,V> b = (h = head).node;
3497 Node<K,V> origin, K fence, int est) {
3502 Node<K,V> e; K ek;
3507 Index<K,V> s; Node<K,V> b, n; K sk;
3527 Node<K,V> e = current;
3545 Node<K,V> e = current;
3589 HeadIndex<K,V> h; Node<K,V> p;
3590 Node<K,V> b = (h = head).node;