Searched refs:Node (Results 126 - 150 of 648) sorted by relevance

1234567891011>>

/libcore/dom/src/test/java/org/w3c/domts/level1/core/
H A Dtextsplittextnomodificationallowederr.java37 * Text Node of the entity reference and execute the "splitText(offset)" method.
70 Node gender;
71 Node entRef;
72 Node entElement;
73 Node entElementText;
95 splitNode = ((Text) /*Node */entElementText).splitText(2);
H A Dhc_attrinsertbefore3.java61 Node testNode;
68 Node retval;
69 Node firstChild;
70 Node lastChild;
71 Node refChild = null;
H A Dhc_attrinsertbefore4.java61 Node testNode;
68 Node retval;
69 Node firstChild;
70 Node lastChild;
71 Node refChild;
H A Dhc_nodechildnodesappendchild.java71 Node employeeNode;
73 Node createdNode;
74 Node childNode;
77 Node textNode;
96 childNode = (Node) childList.item(indexN10087);
H A Dhc_noderemovechildnode.java67 Node employeeNode;
69 Node oldChild;
70 Node child;
73 Node removedChild;
89 emList = ((Element) /*Node */employeeNode).getElementsByTagName("em");
95 child = (Node) childList.item(indexN10098);
H A Dnodeinsertbefore.java65 Node employeeNode;
67 Node refChild;
68 Node newChild;
69 Node child;
72 Node insertedNode;
119 child = (Node) childList.item(indexN100DC);
H A Dnodeinsertbeforenewchildexists.java68 Node employeeNode;
70 Node refChild;
71 Node newChild;
72 Node child;
75 Node insertedNode;
121 child = (Node) childList.item(indexN100DD);
H A Dnodereplacechildnewchildexists.java64 Node employeeNode;
66 Node oldChild = null;
68 Node newChild = null;
71 Node childNode;
98 Node replacedChild;
118 childNode = (Node) childList.item(indexN100DE);
/libcore/dom/src/test/java/org/w3c/domts/level2/core/
H A Dprefix08.java78 Node genderNode;
79 Node entRef;
80 Node entElement;
81 Node createdNode;
H A DsetNamedItemNS01.java79 Node anotherElement;
81 Node arg;
82 Node testAddress;
84 Node setNode;
H A DsetNamedItemNS03.java72 Node arg;
74 Node testAddress;
76 Node retnode;
78 Node setNode;
H A DsetNamedItemNS04.java81 Node testAddress;
83 Node child;
85 Node child2;
87 Node arg;
88 Node setNode;
/libcore/luni/src/test/java/tests/org/w3c/dom/
H A DLocalName.java3 import org.w3c.dom.Node;
12 * The "getLocalName()" method for a Node returns the local part of the
71 Node createdNode;
81 Node testEmployee;
82 Node textNode;
94 Node testEmployee;
H A DDocumentImportNode.java5 import org.w3c.dom.Node;
70 // Node importedAttr;
92 Node importedAttr;
97 Node attrsParent;
121 // Node importedAttr;
149 // Node importedAttr;
173 Node importedAttr;
250 Node addressNode;
252 Node importedDocFrag;
267 Node addressNod
[all...]
H A DIsSupported.java7 import org.w3c.dom.Node;
26 * href="http://www.w3.org/TR/DOM-Level-2-Core/core#Level-2-Core-Node-supports">http://www.w3.org/TR/DOM-Level-2-Core/core#Level-2-Core-Node-supports</a>
59 Node rootNode;
68 Node rootNode;
77 Node rootNode;
86 Node rootNode;
95 Node rootNode;
104 Node rootNode;
113 Node rootNod
[all...]
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/
H A DNodeBuilderTest.java48 @DataProvider(name = "Node.Builder")
55 List<Function<Integer, Node.Builder<Integer>>> ms = Arrays.asList(
63 for (Function<Integer, Node.Builder<Integer>> m : ms) {
71 @Test(dataProvider = "Node.Builder", groups = { "serialization-hostile" })
72 public void testIteration(List<Integer> l, Function<Integer, Node.Builder<Integer>> m) {
73 Node.Builder<Integer> nb = m.apply(l.size());
80 Node<Integer> n = nb.build();
91 // Node.Builder.OfInt
93 @DataProvider(name = "Node.Builder<Integer>")
100 List<Function<Integer, Node
[all...]
H A DDoubleNodeTest.java48 List<Node<Double>> nodes = new ArrayList<>();
56 for (Node<Double> node : nodes) {
90 private Node.OfDouble fill(double[] array, Node.Builder.OfDouble nb) {
98 private Node.OfDouble degenerateTree(PrimitiveIterator.OfDouble it) {
112 private Node.OfDouble tree(List<Double> l, Function<List<Double>, Node.OfDouble> m) {
124 public void testAsArray(double[] array, Node.OfDouble n) {
129 public void testFlattenAsArray(double[] array, Node.OfDouble n) {
134 public void testCopyTo(double[] array, Node
[all...]
H A DIntNodeTest.java48 List<Node<Integer>> nodes = new ArrayList<>();
56 for (Node<Integer> node : nodes) {
90 private Node.OfInt fill(int[] array, Node.Builder.OfInt nb) {
98 private Node.OfInt degenerateTree(PrimitiveIterator.OfInt it) {
112 private Node.OfInt tree(List<Integer> l, Function<List<Integer>, Node.OfInt> m) {
124 public void testAsArray(int[] array, Node.OfInt n) {
129 public void testFlattenAsArray(int[] array, Node.OfInt n) {
134 public void testCopyTo(int[] array, Node
[all...]
H A DLongNodeTest.java48 List<Node<Long>> nodes = new ArrayList<>();
56 for (Node<Long> node : nodes) {
90 private Node.OfLong fill(long[] array, Node.Builder.OfLong nb) {
98 private Node.OfLong degenerateTree(PrimitiveIterator.OfLong it) {
112 private Node.OfLong tree(List<Long> l, Function<List<Long>, Node.OfLong> m) {
124 public void testAsArray(long[] array, Node.OfLong n) {
129 public void testFlattenAsArray(long[] array, Node.OfLong n) {
134 public void testCopyTo(long[] array, Node
[all...]
H A DNodeTest.java48 List<Node<Integer>> nodes = new ArrayList<>();
66 Node<Integer> fill(Integer[] array, Node.Builder<Integer> nb) {
75 Node<Integer> degenerateTree(Iterator<Integer> it) {
89 Node<Integer> tree(List<Integer> l, Function<List<Integer>, Node<Integer>> m) {
101 public void testAsArray(Integer[] array, Node<Integer> n) {
106 public void testFlattenAsArray(Integer[] array, Node<Integer> n) {
112 public void testCopyTo(Integer[] array, Node<Integer> n) {
120 public void testForEach(Integer[] array, Node<Intege
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
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 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 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...]
/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/apache/harmony/xml/dom/
H A DNodeImpl.java30 import org.w3c.dom.Node;
42 * <p>This class represents a Node that has neither a parent nor children.
47 public abstract class NodeImpl implements Node {
74 public Node appendChild(Node newChild) throws DOMException {
78 public final Node cloneNode(boolean deep) {
90 public Node getFirstChild() {
94 public Node getLastChild() {
106 public Node getNextSibling() {
124 public Node getParentNod
[all...]

Completed in 1829 milliseconds

1234567891011>>