Searched defs:succ (Results 1 - 6 of 6) sorted by relevance

/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java183 * - all live nodes are reachable from head via succ()
197 * - the last node is always reachable from tail via succ()
256 * as sentinel for succ(), below.
269 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
426 for (Node<E> p = first(); p != null; p = succ(p)) {
454 next = succ(p);
460 next = succ(p);
709 for (Node<E> p = succ(pred), q;; p = q) {
717 if ((q = succ(p)) != null)
746 for (Node<E> p = first(); p != null; p = succ(
[all...]
H A DConcurrentLinkedDeque.java226 * - all live nodes are reachable from the first node via succ()
691 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
874 for (Node<E> p = first(); p != null; p = succ(p)) {
906 for (Node<E> p = first(); p != null; p = succ(p)) {
1003 for (Node<E> p = first(); p != null; p = succ(p)) {
1047 for (Node<E> p = first(); p != null; p = succ(p)) {
1401 Node<E> nextNode(Node<E> p) { return succ(p); }
1535 for (Node<E> p = first(); p != null; p = succ(p)) {
H A DLinkedBlockingDeque.java1028 private Node<E> succ(Node<E> n) { method in class:LinkedBlockingDeque.AbstractItr
1052 next = succ(next);
H A DLinkedTransferQueue.java729 final Node succ(Node p) { method in class:LinkedTransferQueue
1474 for (Node p = head; p != null; p = succ(p)) {
H A DConcurrentSkipListMap.java566 * @param succ the expected current successor
570 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { argument
572 newSucc.right = succ;
573 return n.value != null && casRight(succ, newSucc);
578 * succ. Fails (forcing a retraversal by caller) if this node
580 * @param succ the expected current successor
583 final boolean unlink(Index<K,V> succ) { argument
584 return node.value != null && casRight(succ, succ.right);
/libcore/ojluni/src/main/java/java/util/
H A DLinkedList.java153 * Inserts element e before non-null Node succ.
155 void linkBefore(E e, Node<E> succ) { argument
156 // assert succ != null;
157 final Node<E> pred = succ.prev;
158 final Node<E> newNode = new Node<>(pred, e, succ);
159 succ.prev = newNode;
413 Node<E> pred, succ;
415 succ = null;
418 succ = node(index);
419 pred = succ
[all...]

Completed in 7928 milliseconds