/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedDeque.java | 116 * 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 D | ConcurrentLinkedQueue.java | 124 * - 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...] |
/libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 42 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node; 86 private transient volatile Node head; 92 private transient volatile Node tail; 148 private Node enq(Node node) { 150 Node oldTail = tail; 152 U.putObject(node, Node.PREV, oldTail); 166 * @param mode Node.EXCLUSIVE for exclusive, Node.SHARED for shared 169 private Node addWaite [all...] |
/libcore/dom/src/test/java/org/w3c/domts/ |
H A D | DOMLocatorImpl.java | 15 import org.w3c.dom.Node; 27 private final Node relatedNode; 73 public Node getRelatedNode() {
|
H A D | UserDataMonitor.java | 17 import org.w3c.dom.Node; 54 Node src, 55 Node dst) {
|
/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
H A D | hc_nodeclonefalsenocopytext.java | 65 Node employeeNode; 67 Node childNode; 68 Node clonedNode; 69 Node lastChildNode;
|
H A D | nodeclonefalsenocopytext.java | 66 Node employeeNode; 68 Node childNode; 69 Node clonedNode; 70 Node lastChildNode;
|
H A D | nodegetfirstchildnull.java | 65 Node employeeNode; 67 Node secondChildNode; 68 Node textNode; 69 Node noChildNode;
|
H A D | nodegetlastchildnull.java | 65 Node employeeNode; 67 Node secondChildNode; 68 Node textNode; 69 Node noChildNode;
|
H A D | nodeinsertbeforenomodificationallowederrEE.java | 67 Node entRef; 68 Node createdNode; 69 Node insertedNode; 70 Node refChild = null;
|
H A D | nodereplacechildnomodificationallowederrEE.java | 67 Node entRef; 68 Node entText; 69 Node createdNode; 70 Node replacedChild;
|
H A D | nodeinsertbeforenomodificationallowederr.java | 70 Node genderNode; 71 Node entRef; 72 Node entElement; 73 Node createdNode; 74 Node insertedNode; 75 Node refChild = null;
|
H A D | hc_nodereplacechildnewchildexists.java | 63 Node employeeNode; 65 Node oldChild = null; 67 Node newChild = null; 69 Node child; 71 Node childNode; 81 Node replacedChild; 86 childList = ((Element) /*Node */employeeNode).getElementsByTagName("*"); 92 childNode = (Node) childList.item(indexN10094);
|
H A D | hc_attrinsertbefore1.java | 61 Node testNode; 66 Node retval; 67 Node firstChild; 68 Node lastChild; 69 Node refChild = null;
|
H A D | hc_attrinsertbefore2.java | 61 Node testNode; 66 Node retval; 67 Node lastChild; 68 Node firstChild; 69 Node refChild;
|
H A D | hc_nodeinsertbeforerefchildnull.java | 69 Node employeeNode; 71 Node refChild = null; 73 Node newChild; 74 Node child; 76 Node insertedNode;
|
H A D | hc_nodereplacechild.java | 66 Node employeeNode; 68 Node oldChild; 69 Node newChild; 70 Node child; 72 Node replacedNode;
|
/libcore/luni/src/main/java/org/w3c/dom/ |
H A D | Attr.java | 19 * <p><code>Attr</code> objects inherit the <code>Node</code> interface, but 22 * <code>Node</code> attributes <code>parentNode</code>, 34 * common with other objects inheriting the <code>Node</code> interface, but 42 * has been explicitly added. Note that the <code>Node.nodeValue</code> 157 public interface Attr extends Node { 159 * Returns the name of this attribute. If <code>Node.localName</code> is
|
H A D | DocumentType.java | 26 public interface DocumentType extends Node {
|
H A D | Entity.java | 19 * <code>Node</code> contains the name of the entity. 46 public interface Entity extends Node {
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | LinkedList.java | 94 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...] |
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
H A D | CommentImpl.java | 20 import org.w3c.dom.Node; 45 return Node.COMMENT_NODE;
|
H A D | EntityReferenceImpl.java | 20 import org.w3c.dom.Node; 48 return Node.ENTITY_REFERENCE_NODE;
|
H A D | DocumentImpl.java | 32 import org.w3c.dom.Node; 128 private NodeImpl shallowCopy(short operation, Node node) { 130 case Node.ATTRIBUTE_NODE: 142 case Node.CDATA_SECTION_NODE: 145 case Node.COMMENT_NODE: 148 case Node.DOCUMENT_FRAGMENT_NODE: 151 case Node.DOCUMENT_NODE: 152 case Node.DOCUMENT_TYPE_NODE: 156 case Node.ELEMENT_NODE: 179 case Node [all...] |
/libcore/luni/src/main/java/org/w3c/dom/traversal/ |
H A D | NodeFilter.java | 15 import org.w3c.dom.Node; 144 public short acceptNode(Node n);
|