Home
last modified time | relevance | path

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

12345678910>>...26

/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()
/libcore/luni/src/main/java/java/util/concurrent/locks/
DAbstractQueuedSynchronizer.java352 static final class Node { class in AbstractQueuedSynchronizer
354 static final Node SHARED = new Node();
356 static final Node EXCLUSIVE = null;
417 volatile Node prev;
432 volatile Node next;
450 Node nextWaiter;
466 final Node predecessor() throws NullPointerException { in predecessor()
467 Node p = prev; in predecessor()
475 Node() {} in Node() method in AbstractQueuedSynchronizer.Node
478 Node(Node nextWaiter) { in Node() method in AbstractQueuedSynchronizer.Node
[all …]
DAbstractQueuedLongSynchronizer.java13 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node;
57 private transient volatile Node head;
63 private transient volatile Node tail;
119 private Node enq(Node node) { in enq()
121 Node oldTail = tail; in enq()
123 U.putObject(node, Node.PREV, oldTail); in enq()
140 private Node addWaiter(Node mode) { in addWaiter()
141 Node node = new Node(mode); in addWaiter()
144 Node oldTail = tail; in addWaiter()
146 U.putObject(node, Node.PREV, oldTail); in addWaiter()
[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.java152 private static class Node<E> { class in ConcurrentLinkedQueue
154 volatile Node<E> next;
161 static <E> Node<E> newNode(E item) { in newNode()
162 Node<E> node = new Node<E>(); in newNode()
167 static <E> boolean casItem(Node<E> node, E cmp, E val) { in casItem()
171 static <E> void lazySetNext(Node<E> node, Node<E> val) { in lazySetNext()
175 static <E> boolean casNext(Node<E> node, Node<E> cmp, Node<E> val) { in casNext()
191 transient volatile Node<E> head;
205 private transient volatile Node<E> tail;
224 Node<E> h = null, t = null; in ConcurrentLinkedQueue()
[all …]
DLinkedBlockingDeque.java81 static final class Node<E> { class in LinkedBlockingDeque
93 Node<E> prev;
101 Node<E> next;
103 Node(E x) { in Node() method in LinkedBlockingDeque.Node
113 transient Node<E> first;
120 transient Node<E> last;
174 if (!linkLast(new Node<E>(e))) in LinkedBlockingDeque()
188 private boolean linkFirst(Node<E> node) { in linkFirst()
192 Node<E> f = first; in linkFirst()
207 private boolean linkLast(Node<E> node) { in linkLast()
[all …]
DLinkedTransferQueue.java422 static final class Node { class in LinkedTransferQueue
425 volatile Node next;
429 final boolean casNext(Node cmp, Node val) { in casNext()
442 Node(Object item, boolean isData) { in Node() method in LinkedTransferQueue.Node
519 (Node.class.getDeclaredField("item"));
521 (Node.class.getDeclaredField("next"));
523 (Node.class.getDeclaredField("waiter"));
531 transient volatile Node head;
534 private transient volatile Node tail;
540 private boolean casTail(Node cmp, Node val) { in casTail()
[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 …]
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 …]
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 …]
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/ojluni/src/main/java/java/util/
DLinkedList.java94 transient Node<E> first;
101 transient Node<E> last;
126 final Node<E> f = first; in linkFirst()
127 final Node<E> newNode = new Node<>(null, e, f); in linkFirst()
141 final Node<E> l = last; in linkLast()
142 final Node<E> newNode = new Node<>(l, e, null); in linkLast()
155 void linkBefore(E e, Node<E> succ) { in linkBefore()
157 final Node<E> pred = succ.prev; in linkBefore()
158 final Node<E> newNode = new Node<>(pred, e, succ); in linkBefore()
171 private E unlinkFirst(Node<E> f) { in unlinkFirst()
[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/ojluni/src/main/java/java/util/stream/
DNodes.java67 private static final Node EMPTY_NODE = new EmptyNode.OfRef();
68 private static final Node.OfInt EMPTY_INT_NODE = new EmptyNode.OfInt();
69 private static final Node.OfLong EMPTY_LONG_NODE = new EmptyNode.OfLong();
70 private static final Node.OfDouble EMPTY_DOUBLE_NODE = new EmptyNode.OfDouble();
82 static <T> Node<T> emptyNode(StreamShape shape) { in emptyNode()
84 case REFERENCE: return (Node<T>) EMPTY_NODE; in emptyNode()
85 case INT_VALUE: return (Node<T>) EMPTY_INT_NODE; in emptyNode()
86 case LONG_VALUE: return (Node<T>) EMPTY_LONG_NODE; in emptyNode()
87 case DOUBLE_VALUE: return (Node<T>) EMPTY_DOUBLE_NODE; in emptyNode()
113 static <T> Node<T> conc(StreamShape shape, Node<T> left, Node<T> right) { in conc()
[all …]
/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/ojluni/src/test/java/util/stream/boottest/java/util/stream/
DNodeBuilderTest.java55 List<Function<Integer, Node.Builder<Integer>>> ms = Arrays.asList( in createNodeBuilders()
63 for (Function<Integer, Node.Builder<Integer>> m : ms) { in createNodeBuilders()
72 public void testIteration(List<Integer> l, Function<Integer, Node.Builder<Integer>> m) { in testIteration()
73 Node.Builder<Integer> nb = m.apply(l.size()); in testIteration()
80 Node<Integer> n = nb.build(); in testIteration()
100 List<Function<Integer, Node.Builder<Integer>>> ms = Arrays.asList( in createIntNodeBuilders()
108 for (Function<Integer, Node.Builder<Integer>> m : ms) { in createIntNodeBuilders()
117 public void testIntIteration(List<Integer> l, Function<Integer, Node.Builder.OfInt> m) { in testIntIteration()
118 Node.Builder.OfInt nb = m.apply(l.size()); in testIntIteration()
125 Node.OfInt n = nb.build(); in testIntIteration()
[all …]
DIntNodeTest.java48 List<Node<Integer>> nodes = new ArrayList<>(); in createSizes()
56 for (Node<Integer> node : nodes) { in createSizes()
90 private Node.OfInt fill(int[] array, Node.Builder.OfInt nb) { in fill()
98 private Node.OfInt degenerateTree(PrimitiveIterator.OfInt it) { in degenerateTree()
112 private Node.OfInt tree(List<Integer> l, Function<List<Integer>, Node.OfInt> m) { in tree()
124 public void testAsArray(int[] array, Node.OfInt n) { in testAsArray()
129 public void testFlattenAsArray(int[] array, Node.OfInt n) { in testFlattenAsArray()
134 public void testCopyTo(int[] array, Node.OfInt n) { in testCopyTo()
142 public void testForEach(int[] array, Node.OfInt n) { in testForEach()
152 public void testStreams(int[] array, Node.OfInt n) { in testStreams()
[all …]
DLongNodeTest.java48 List<Node<Long>> nodes = new ArrayList<>(); in createSizes()
56 for (Node<Long> node : nodes) { in createSizes()
90 private Node.OfLong fill(long[] array, Node.Builder.OfLong nb) { in fill()
98 private Node.OfLong degenerateTree(PrimitiveIterator.OfLong it) { in degenerateTree()
112 private Node.OfLong tree(List<Long> l, Function<List<Long>, Node.OfLong> m) { in tree()
124 public void testAsArray(long[] array, Node.OfLong n) { in testAsArray()
129 public void testFlattenAsArray(long[] array, Node.OfLong n) { in testFlattenAsArray()
134 public void testCopyTo(long[] array, Node.OfLong n) { in testCopyTo()
142 public void testForEach(long[] array, Node.OfLong n) { in testForEach()
152 public void testStreams(long[] array, Node.OfLong n) { in testStreams()
[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()

12345678910>>...26