Lines Matching defs:Node
283 * Node: b, n, f for predecessor, node, successor
344 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null),
364 static final class Node<K,V> {
367 volatile Node<K,V> next;
372 Node(K key, Object value, Node<K,V> next) {
385 Node(Node<K,V> next) {
401 boolean casNext(Node<K,V> cmp, Node<K,V> val) {
431 boolean appendMarker(Node<K,V> f) {
432 return casNext(f, new Node<K,V>(f));
442 void helpDelete(Node<K,V> b, Node<K,V> f) {
490 Class<?> k = Node.class;
511 final Node<K,V> node;
518 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) {
548 Node<K,V> n = node;
586 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) {
681 private Node<K,V> findPredecessor(Comparable<? super K> key) {
689 Node<K,V> n = r.node;
757 private Node<K,V> findNode(Comparable<? super K> key) {
759 Node<K,V> b = findPredecessor(key);
760 Node<K,V> n = b.next;
764 Node<K,V> f = n.next;
798 Node<K,V> n = findNode(key);
820 Node<K,V> b = findPredecessor(key);
821 Node<K,V> n = b.next;
824 Node<K,V> f = n.next;
849 Node<K,V> z = new Node<K,V>(kkey, value, n);
886 private void insertIndex(Node<K,V> z, int level) {
921 Node<K,V> oldbase = oldh.node;
955 Node<K,V> n = r.node;
1019 Node<K,V> b = findPredecessor(key);
1020 Node<K,V> n = b.next;
1024 Node<K,V> f = n.next;
1099 Node<K,V> findFirst() {
1101 Node<K,V> b = head.node;
1102 Node<K,V> n = b.next;
1117 Node<K,V> b = head.node;
1118 Node<K,V> n = b.next;
1121 Node<K,V> f = n.next;
1164 Node<K,V> findLast() {
1183 Node<K,V> b = q.node;
1184 Node<K,V> n = b.next;
1188 Node<K,V> f = n.next; // inconsistent read
1213 private Node<K,V> findPredecessorOfLast() {
1244 Node<K,V> b = findPredecessorOfLast();
1245 Node<K,V> n = b.next;
1253 Node<K,V> f = n.next;
1298 Node<K,V> findNear(K kkey, int rel) {
1301 Node<K,V> b = findPredecessor(key);
1302 Node<K,V> n = b.next;
1306 Node<K,V> f = n.next;
1336 Node<K,V> n = findNear(key, rel);
1431 Node<K,V> basepred = h.node;
1456 Node<K,V> z = new Node<K,V>(k, v, null);
1494 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1525 Node<K,V> basepred = h.node;
1546 Node<K,V> z = new Node<K,V>(key, val, null);
1649 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1675 for (Node<K,V> n = findFirst(); n != null; n = n.next) {
1883 Node<K,V> n = findNode(k);
1910 Node<K,V> n = findNode(k);
1929 Node<K,V> n = findFirst();
1939 Node<K,V> n = findLast();
2033 Node<K,V> n = findNear(key, LT);
2057 Node<K,V> n = findNear(key, LT|EQ);
2079 Node<K,V> n = findNear(key, GT|EQ);
2103 Node<K,V> n = findNear(key, GT);
2115 Node<K,V> n = findFirst();
2132 Node<K,V> n = findLast();
2169 Node<K,V> lastReturned;
2171 Node<K,V> next;
2211 Node<K,V> l = lastReturned;
2232 Node<K,V> n = next;
2240 Node<K,V> n = next;
2521 private boolean isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n) {
2539 private ConcurrentSkipListMap.Node<K,V> loNode() {
2552 private ConcurrentSkipListMap.Node<K,V> hiNode() {
2565 ConcurrentSkipListMap.Node<K,V> n = loNode();
2576 ConcurrentSkipListMap.Node<K,V> n = hiNode();
2587 ConcurrentSkipListMap.Node<K,V> n = loNode();
2598 ConcurrentSkipListMap.Node<K,V> n = hiNode();
2609 Node<K,V> n = loNode();
2623 Node<K,V> n = hiNode();
2650 Node<K,V> n = m.findNear(key, rel);
2670 ConcurrentSkipListMap.Node<K,V> n = loNode();
2678 ConcurrentSkipListMap.Node<K,V> n = hiNode();
2688 Node<K,V> n = m.findNear(key, rel);
2724 for (ConcurrentSkipListMap.Node<K,V> n = loNode();
2740 for (ConcurrentSkipListMap.Node<K,V> n = loNode();
2751 for (ConcurrentSkipListMap.Node<K,V> n = loNode();
2974 Node<K,V> lastReturned;
2976 Node<K,V> next;
3043 Node<K,V> l = lastReturned;
3062 Node<K,V> n = next;
3070 Node<K,V> n = next;