Searched defs:Node (Results 1 - 14 of 14) sorted by relevance

/libcore/ojluni/src/main/java/java/util/concurrent/
H A DExchanger.java110 * place item in a Node;
243 * uses. Note that field Node.item is not declared as volatile
248 * slot CASes, it would also be legal for the write to Node.match
310 static final class Node { class in class:Exchanger
321 static final class Participant extends ThreadLocal<Node> {
322 public Node initialValue() { return new Node(); }
334 private volatile Node[] arena;
339 private volatile Node slot;
359 Node[]
[all...]
H A DConcurrentLinkedQueue.java124 * - There is exactly one (last) Node with a null next reference,
125 * which is CASed when enqueueing. This last Node can be
131 * reference of a Node to null atomically removes it from the
134 * head to advance. A dequeued Node may remain in use
139 * from a predecessor dequeued Node. That would cause two problems:
142 * a Node was tenured while live, which generational GCs have a
147 * linking a Node that has just been dequeued to itself. Such a
160 * CASing a Node's item reference to null atomically removes the
168 * When constructing a Node (before enqueuing it) we avoid paying
173 * Both head and tail may or may not point to a Node wit
181 private static class Node<E> { class in class:ConcurrentLinkedQueue
[all...]
H A DLinkedBlockingQueue.java101 * enqueued Node by either acquiring the putLock (via fullyLock)
106 * keep all Nodes GC-reachable from a predecessor dequeued Node.
110 * a Node was tenured while live, which generational GCs have a
115 * linking a Node that has just been dequeued to itself. Such a
122 static class Node<E> { class in class:LinkedBlockingQueue
127 * - the real successor Node
128 * - this Node, meaning the successor is head.next
131 Node<E> next;
133 Node(E x) { item = x; } method in class:LinkedBlockingQueue.Node
146 transient Node<
[all...]
H A DArrayBlockingQueue.java775 * Node in a linked list of weak iterator references.
777 private class Node extends WeakReference<Itr> { class in class:ArrayBlockingQueue.Itrs
778 Node next;
780 Node(Itr iterator, Node next) { method in class:ArrayBlockingQueue.Itrs.Node
790 private Node head;
793 private Node sweeper;
814 Node o, p;
815 final Node sweeper = this.sweeper;
837 final Node nex
[all...]
H A DConcurrentLinkedDeque.java116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
263 private transient volatile Node<E> head;
277 private transient volatile Node<E> tail;
279 private static final Node<Object> PREV_TERMINATOR, NEXT_TERMINATOR;
282 Node<E> prevTerminator() {
283 return (Node<E>) PREV_TERMINATOR;
287 Node<E> nextTerminator() {
288 return (Node<E>) NEXT_TERMINATOR;
291 static final class Node< class in class:ConcurrentLinkedDeque
296 Node() { // default constructor for NEXT_TERMINATOR, PREV_TERMINATOR method in class:ConcurrentLinkedDeque.Node
303 Node(E item) { method in class:ConcurrentLinkedDeque.Node
[all...]
H A DLinkedBlockingDeque.java86 * keep all Nodes GC-reachable from a predecessor dequeued Node.
90 * a Node was tenured while live, which generational GCs have a
95 * linking a Node that has just been dequeued to itself. Such a
110 static final class Node<E> { class in class:LinkedBlockingDeque
118 * - the real predecessor Node
119 * - this Node, meaning the predecessor is tail
122 Node<E> prev;
126 * - the real successor Node
127 * - this Node, meaning the successor is head
130 Node<
132 Node(E x) { method in class:LinkedBlockingDeque.Node
[all...]
H A DLinkedTransferQueue.java226 * retaining values held in other Node fields.) However, doing so
451 static final class Node { class in class:LinkedTransferQueue
454 volatile Node next;
458 final boolean casNext(Node cmp, Node val) {
463 // assert cmp == null || cmp.getClass() != Node.class;
471 Node(Object item, boolean isData) { method in class:LinkedTransferQueue.Node
548 (Node.class.getDeclaredField("item"));
550 (Node.class.getDeclaredField("next"));
552 (Node
[all...]
H A DConcurrentSkipListMap.java347 * 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> { class in class:ConcurrentSkipListMap
419 volatile Node<K,V> next;
424 Node(K key, Object value, Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
437 Node(Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
453 boolean casNext(Node<K,V> cmp, Node<
[all...]
H A DConcurrentHashMap.java279 * key-value mapping is held in a Node. Most nodes are instances
280 * of the basic Node class with hash, key, value, and next
296 * list of Nodes (most often, the list has only zero or one Node).
302 * We use the top (sign) bit of Node hash fields for control
589 * Encodings for Node hash fields. See above for explanation.
621 * in bulk tasks. Subclasses of Node with a negative hash field
625 static class Node<K,V> implements Map.Entry<K,V> { class in class:ConcurrentHashMap
629 volatile Node<K,V> next;
631 Node(int hash, K key, V val, Node< method in class:ConcurrentHashMap.Node
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DNode.java38 * <p>A {@code Node} contains a fixed number of elements, which can be accessed
40 * {@link #asArray}, or {@link #copyInto} methods. A {@code Node} may have zero
41 * or more child {@code Node}s; if it has no children (accessed via
48 * <p>A {@code Node} typically does not store the elements directly, but instead
51 * {@code Node}s. Commonly {@code Node}s are formed into a tree whose shape
53 * contained in the leaf nodes. The use of {@code Node} within the stream
61 public interface Node<T> { interface
65 * {@code Node}.
68 * {@code Node}
[all...]
/libcore/luni/src/main/java/org/w3c/dom/
H A DNode.java16 * The <code>Node</code> interface is the primary datatype for the entire
18 * While all objects implementing the <code>Node</code> interface expose
20 * <code>Node</code> interface may have children. For example,
136 public interface Node { interface
227 public Node getParentNode();
240 public Node getFirstChild();
246 public Node getLastChild();
252 public Node getPreviousSibling();
258 public Node getNextSibling();
309 public Node insertBefor
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DLinkedList.java94 transient Node<E> first;
101 transient Node<E> last;
126 final Node<E> f = first;
127 final Node<E> newNode = new Node<>(null, e, f);
141 final Node<E> l = last;
142 final Node<E> newNode = new Node<>(l, e, null);
153 * Inserts element e before non-null Node succ.
155 void linkBefore(E e, Node<
970 private static class Node<E> { class in class:LinkedList
975 Node(Node<E> prev, E element, Node<E> next) { method in class:LinkedList.Node
[all...]
H A DHashMap.java213 * Node.next) to better preserve locality, and to slightly
278 static class Node<K,V> implements Map.Entry<K,V> { class in class:HashMap
282 Node<K,V> next;
284 Node(int hash, K key, V value, Node<K,V> next) { method in class:HashMap.Node
395 transient Node<K,V>[] table;
555 Node<K,V> e;
566 final Node<K,V> getNode(int hash, Object key) {
567 Node<K,V>[] tab; Node<
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedSynchronizer.java380 static final class Node { class in class:AbstractQueuedSynchronizer
382 static final Node SHARED = new Node();
384 static final Node EXCLUSIVE = null;
445 volatile Node prev;
460 volatile Node next;
478 Node nextWaiter;
494 final Node predecessor() throws NullPointerException {
495 Node p = prev;
503 Node() {} method in class:AbstractQueuedSynchronizer.Node
506 Node(Node nextWaiter) { method in class:AbstractQueuedSynchronizer.Node
512 Node(int waitStatus) { method in class:AbstractQueuedSynchronizer.Node
[all...]

Completed in 2997 milliseconds