Home
last modified time | relevance | path

Searched refs:Node (Results 1 – 25 of 623) sorted by relevance

12345678910>>...25

/libcore/luni/src/main/java/org/w3c/dom/
DNode.java136 public interface Node { interface
227 public Node getParentNode(); in getParentNode()
240 public Node getFirstChild(); in getFirstChild()
246 public Node getLastChild(); in getLastChild()
252 public Node getPreviousSibling(); in getPreviousSibling()
258 public Node getNextSibling(); in getNextSibling()
309 public Node insertBefore(Node newChild, in insertBefore()
310 Node refChild) in insertBefore()
346 public Node replaceChild(Node newChild, in replaceChild()
347 Node oldChild) in replaceChild()
[all …]
DNamedNodeMap.java35 public Node getNamedItem(String name); in getNamedItem()
65 public Node setNamedItem(Node arg) in setNamedItem()
82 public Node removeNamedItem(String name) in removeNamedItem()
93 public Node item(int index); in item()
117 public Node getNamedItemNS(String namespaceURI, in getNamedItemNS()
153 public Node setNamedItemNS(Node arg) in setNamedItemNS()
179 public Node removeNamedItemNS(String namespaceURI, in removeNamedItemNS()
DDocument.java27 public interface Document extends Node {
312 public Node importNode(Node importedNode, in importNode()
698 public Node adoptNode(Node source) in adoptNode()
809 public Node renameNode(Node n, in renameNode()
/libcore/luni/src/main/java/java/util/concurrent/locks/
DAbstractQueuedSynchronizer.java359 static final class Node { class in AbstractQueuedSynchronizer
361 static final Node SHARED = new Node();
363 static final Node EXCLUSIVE = null;
424 volatile Node prev;
439 volatile Node next;
457 Node nextWaiter;
473 final Node predecessor() throws NullPointerException { in predecessor()
474 Node p = prev; in predecessor()
481 Node() { // Used to establish initial head or SHARED marker in Node() method in AbstractQueuedSynchronizer.Node
484 Node(Thread thread, Node mode) { // Used by addWaiter in Node() method in AbstractQueuedSynchronizer.Node
[all …]
DAbstractQueuedLongSynchronizer.java129 static final class Node { class in AbstractQueuedLongSynchronizer
131 static final Node SHARED = new Node();
133 static final Node EXCLUSIVE = null;
194 volatile Node prev;
209 volatile Node next;
227 Node nextWaiter;
243 final Node predecessor() throws NullPointerException { in predecessor()
244 Node p = prev; in predecessor()
251 Node() { // Used to establish initial head or SHARED marker in Node() method in AbstractQueuedLongSynchronizer.Node
254 Node(Thread thread, Node mode) { // Used by addWaiter in Node() method in AbstractQueuedLongSynchronizer.Node
[all …]
/libcore/luni/src/main/java/javax/xml/transform/dom/
DDOMResult.java23 import org.w3c.dom.Node;
71 public DOMResult(Node node) { in DOMResult()
91 public DOMResult(Node node, String systemId) { in DOMResult()
126 public DOMResult(Node node, Node nextSibling) { in DOMResult()
136 … if ((node.compareDocumentPosition(nextSibling)&Node.DOCUMENT_POSITION_CONTAINED_BY)==0) { in DOMResult()
175 public DOMResult(Node node, Node nextSibling, String systemId) { in DOMResult()
185 … if ((node.compareDocumentPosition(nextSibling)&Node.DOCUMENT_POSITION_CONTAINED_BY)==0) { in DOMResult()
216 public void setNode(Node node) { in setNode()
225 … if ((node.compareDocumentPosition(nextSibling)&Node.DOCUMENT_POSITION_CONTAINED_BY)==0) { in setNode()
247 public Node getNode() { in getNode()
[all …]
DDOMSource.java23 import org.w3c.dom.Node;
43 private Node node;
78 public DOMSource(Node n) { in DOMSource()
89 public DOMSource(Node node, String systemID) { in DOMSource()
99 public void setNode(Node node) { in setNode()
108 public Node getNode() { in getNode()
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentLinkedDeque.java234 private transient volatile Node<E> head;
248 private transient volatile Node<E> tail;
250 private static final Node<Object> PREV_TERMINATOR, NEXT_TERMINATOR;
253 Node<E> prevTerminator() { in prevTerminator()
254 return (Node<E>) PREV_TERMINATOR; in prevTerminator()
258 Node<E> nextTerminator() { in nextTerminator()
259 return (Node<E>) NEXT_TERMINATOR; in nextTerminator()
262 static final class Node<E> { class in ConcurrentLinkedDeque
263 volatile Node<E> prev;
265 volatile Node<E> next;
[all …]
DConcurrentLinkedQueue.java148 private static class Node<E> { class in ConcurrentLinkedQueue
150 volatile Node<E> next;
156 Node(E item) { in Node() method in ConcurrentLinkedQueue.Node
164 void lazySetNext(Node<E> val) { in lazySetNext()
168 boolean casNext(Node<E> cmp, Node<E> val) { in casNext()
181 Class<?> k = Node.class;
204 private transient volatile Node<E> head;
218 private transient volatile Node<E> tail;
224 head = tail = new Node<E>(null); in ConcurrentLinkedQueue()
237 Node<E> h = null, t = null; in ConcurrentLinkedQueue()
[all …]
DLinkedBlockingDeque.java78 static final class Node<E> { class in LinkedBlockingDeque
90 Node<E> prev;
98 Node<E> next;
100 Node(E x) { in Node() method in LinkedBlockingDeque.Node
110 transient Node<E> first;
117 transient Node<E> last;
171 if (!linkLast(new Node<E>(e))) in LinkedBlockingDeque()
185 private boolean linkFirst(Node<E> node) { in linkFirst()
189 Node<E> f = first; in linkFirst()
204 private boolean linkLast(Node<E> node) { in linkLast()
[all …]
DLinkedTransferQueue.java419 static final class Node { class in LinkedTransferQueue
422 volatile Node next;
426 final boolean casNext(Node cmp, Node val) { in casNext()
439 Node(Object item, boolean isData) { in Node() method in LinkedTransferQueue.Node
516 Class<?> k = Node.class;
530 transient volatile Node head;
533 private transient volatile Node tail;
539 private boolean casTail(Node cmp, Node val) { in casTail()
543 private boolean casHead(Node cmp, Node val) { in casHead()
578 Node s = null; // the node to append, if needed in xfer()
[all …]
DLinkedBlockingQueue.java90 static class Node<E> { class in LinkedBlockingQueue
99 Node<E> next;
101 Node(E x) { item = x; } in Node() method in LinkedBlockingQueue.Node
114 transient Node<E> head;
120 private transient Node<E> last;
166 private void enqueue(Node<E> node) { in enqueue()
180 Node<E> h = head; in dequeue()
181 Node<E> first = h.next; in dequeue()
231 last = head = new Node<E>(null); in LinkedBlockingQueue()
255 enqueue(new Node<E>(e)); in LinkedBlockingQueue()
[all …]
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
DInnerNodeImpl.java24 import org.w3c.dom.Node;
51 public Node appendChild(Node newChild) throws DOMException { in appendChild()
65 public Node getFirstChild() { in getFirstChild()
69 public Node getLastChild() { in getLastChild()
73 public Node getNextSibling() { in getNextSibling()
85 public Node insertBefore(Node newChild, Node refChild) throws DOMException { in insertBefore()
107 Node insertChildAt(Node newChild, int index) throws DOMException { in insertChildAt()
137 public boolean isParentOf(Node node) { in isParentOf()
157 Node next; in normalize()
158 for (Node node = getFirstChild(); node != null; node = next) { in normalize()
[all …]
DTextImpl.java20 import org.w3c.dom.Node;
46 return Node.TEXT_NODE; in getNodeType()
54 Node refNode = getNextSibling(); in splitText()
89 Node parent = getParentNode(); in replaceWholeText()
102 Node toRemove = n; // because removeChild() detaches siblings in replaceWholeText()
117 for (Node p = getPreviousSibling(); p != null; p = p.getPreviousSibling()) { in firstTextNodeInCurrentRun()
119 if (nodeType == Node.TEXT_NODE || nodeType == Node.CDATA_SECTION_NODE) { in firstTextNodeInCurrentRun()
133 Node nextSibling = getNextSibling(); in nextTextNode()
139 return nodeType == Node.TEXT_NODE || nodeType == Node.CDATA_SECTION_NODE in nextTextNode()
162 Node previous = getPreviousSibling(); in minimize()
[all …]
DDocumentImpl.java32 import org.w3c.dom.Node;
129 private NodeImpl shallowCopy(short operation, Node node) { in shallowCopy()
131 case Node.ATTRIBUTE_NODE: in shallowCopy()
143 case Node.CDATA_SECTION_NODE: in shallowCopy()
146 case Node.COMMENT_NODE: in shallowCopy()
149 case Node.DOCUMENT_FRAGMENT_NODE: in shallowCopy()
152 case Node.DOCUMENT_NODE: in shallowCopy()
153 case Node.DOCUMENT_TYPE_NODE: in shallowCopy()
157 case Node.ELEMENT_NODE: in shallowCopy()
180 case Node.ENTITY_NODE: in shallowCopy()
[all …]
DLeafNodeImpl.java19 import org.w3c.dom.Node;
45 public Node getNextSibling() { in getNextSibling()
53 public Node getParentNode() { in getParentNode()
57 public Node getPreviousSibling() { in getPreviousSibling()
65 boolean isParentOf(Node node) { in isParentOf()
DNodeImpl.java30 import org.w3c.dom.Node;
47 public abstract class NodeImpl implements Node {
74 public Node appendChild(Node newChild) throws DOMException { in appendChild()
78 public final Node cloneNode(boolean deep) { in cloneNode()
90 public Node getFirstChild() { in getFirstChild()
94 public Node getLastChild() { in getLastChild()
106 public Node getNextSibling() { in getNextSibling()
124 public Node getParentNode() { in getParentNode()
132 public Node getPreviousSibling() { in getPreviousSibling()
144 public Node insertBefore(Node newChild, Node refChild) throws DOMException { in insertBefore()
[all …]
/libcore/dom/src/test/java/org/w3c/domts/
DUserDataNotification.java14 import org.w3c.dom.Node;
25 private final Node src;
26 private final Node dst;
35 Node src, in UserDataNotification()
36 Node dst) { in UserDataNotification()
76 public final Node getSrc() { in getSrc()
85 public final Node getDst() { in getDst()
/libcore/luni/src/test/java/libcore/xml/
DNodeTest.java22 import org.w3c.dom.Node;
43 Node root = document.getDocumentElement(); in test_getNextSibling()
55 for (Node node : flattenSubtree(documentElement)) { in testGetBaseUri()
56 if (node.getNodeType() == Node.ELEMENT_NODE in testGetBaseUri()
57 || node.getNodeType() == Node.DOCUMENT_NODE) { in testGetBaseUri()
75 private List<Node> flattenSubtree(Node subtree) { in flattenSubtree()
76 List<Node> result = new ArrayList<Node>(); in flattenSubtree()
81 private void traverse(Node node, List<Node> sink) { in traverse()
/libcore/luni/src/main/java/java/util/prefs/
DNodeSet.java5 import org.w3c.dom.Node;
10 ArrayList<Node> list = new ArrayList<Node>();
12 public NodeSet(Iterator<Node> nodes) { in NodeSet()
22 public Node item(int index) { in item()
23 Node result = null; in item()
/libcore/luni/src/test/java/tests/org/w3c/dom/
DSetNamedItemNS.java27 import org.w3c.dom.Node;
79 Node anotherElement; in testSetNamedItemNS1()
81 Node arg; in testSetNamedItemNS1()
82 Node testAddress; in testSetNamedItemNS1()
108 Node arg; in testSetNamedItemNS2()
110 Node testAddress; in testSetNamedItemNS2()
135 Node arg; in testSetNamedItemNS3()
137 Node testAddress; in testSetNamedItemNS3()
139 Node retnode; in testSetNamedItemNS3()
200 Node arg; in testSetNamedItemNS5()
[all …]
/libcore/dom/src/test/java/org/w3c/domts/level1/core/
Dnodeinsertbeforedocfragment.java69 Node employeeNode; in runTest()
71 Node refChild; in runTest()
73 Node newChild1; in runTest()
74 Node newChild2; in runTest()
75 Node child; in runTest()
77 Node appendedChild; in runTest()
78 Node insertedNode; in runTest()
Dhc_nodeinsertbeforedocfragment.java69 Node employeeNode; in runTest()
71 Node refChild; in runTest()
73 Node newChild1; in runTest()
74 Node newChild2; in runTest()
75 Node child; in runTest()
77 Node appendedChild; in runTest()
78 Node insertedNode; in runTest()
Dnodeinsertbeforenomodificationallowederr.java70 Node genderNode; in runTest()
71 Node entRef; in runTest()
72 Node entElement; in runTest()
73 Node createdNode; in runTest()
74 Node insertedNode; in runTest()
75 Node refChild = null; in runTest()
/libcore/luni/src/main/java/org/w3c/dom/traversal/
DNodeIterator.java16 import org.w3c.dom.Node;
38 public Node getRoot(); in getRoot()
86 public Node nextNode() in nextNode()
98 public Node previousNode() in previousNode()

12345678910>>...25