| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| nodechildnodesempty.java | 32 * that contains all children of this node. If there
35 * Retrieve the Text node from the second child of the second
66 Node employeeNode;
68 Node secondCNode;
69 Node textNode;
|
| nodeclonegetparentnull.java | 31 * The duplicate node returned by the "cloneNode(deep)"
36 * duplicate node returned should return null when the
66 Node employeeNode;
67 Node clonedNode;
68 Node parentNode;
|
| nodeclonetruecopytext.java | 33 * duplicate node returned by the method should copy
34 * any text data contained in this node.
64 Node childNode;
65 Node clonedNode;
66 Node lastChildNode;
|
| nodegetnextsiblingnull.java | 31 * If there is not a node immediately following this node the
65 Node employeeNode;
66 Node lcNode;
67 Node nsNode;
|
| nodegetprevioussiblingnull.java | 31 * If there is not a node immediately preceding this node the
65 Node employeeNode;
66 Node fcNode;
67 Node psNode;
|
| nodehaschildnodesfalse.java | 31 * The "hasChildNodes()" method returns false if the node
34 * Retrieve the Text node inside the first child of the
66 Node child;
68 Node employeeNode;
69 Node textNode;
|
| nodelistindexgetlengthofemptylist.java | 34 * Create a list of all the children of the Text node
66 Node employeeNode;
68 Node childNode;
69 Node textNode;
|
| noderemovechild.java | 31 * The "removeChild(oldChild)" method removes the child node
37 * node returned by the "getParentNode()" method. It
68 Node childToRemove;
69 Node removedChild;
70 Node parentNode;
|
| noderemovechildnomodificationallowederrEE.java | 33 * if the node is readonly.
67 Node entRef;
68 Node entText;
69 Node removedNode;
|
| noderemovechildoldchildnonexistent.java | 33 * not a child of this node.
36 * node that is not one of its children. An attempt to
37 * remove such a node should raise the desired exception.
69 Node oldChild;
71 Node elementNode;
72 Node removedChild;
|
| hc_attrinsertbefore7.java | 63 Node testNode;
68 Node dayNode;
70 Node retval;
71 Node firstChild;
72 Node lastChild;
73 Node refChild = null;
|
| hc_nodeappendchildchildexists.java | 68 Node childNode;
69 Node newChild;
70 Node memberNode;
85 Node appendedChild;
89 childList = ((Element) /*Node */childNode).getElementsByTagName("*");
93 memberNode = (Node) childList.item(indexN10085);
100 memberNode = (Node) childList.item(indexN1009C);
|
| hc_nodeappendchilddocfragment.java | 32 * all its content is added to the child list of this node.
68 Node employeeNode;
71 Node newChild1;
72 Node newChild2;
73 Node child;
77 Node appendedChild;
100 child = (Node) childList.item(indexN100A2);
|
| hc_nodeclonenodetrue.java | 31 * The "cloneNode(deep)" method returns a copy of the node
36 * method should clone this node and the subtree under it.
37 * The NodeName of each child in the returned node is
68 Node employeeNode;
69 Node clonedNode;
71 Node clonedChild;
74 Node origChild;
85 origChild = (Node) origList.item(indexN10065);
92 clonedChild = (Node) clonedList.item(indexN1007B);
|
| hc_nodeinsertbefore.java | 32 * node "newChild" before the node "refChild".
34 * Insert a newly created Element node before the second
67 Node employeeNode;
69 Node refChild;
70 Node newChild;
71 Node child;
73 Node insertedNode;
94 child = (Node) childList.item(indexN10091);
|
| hc_nodeinsertbeforenewchildexists.java | 35 * Insert a node Element ("em") that is already
36 * present in the tree. The existing node should be
37 * removed first and the new one inserted. The node is
68 Node employeeNode;
70 Node refChild;
71 Node newChild;
72 Node child;
74 Node insertedNode;
89 childList = ((Element) /*Node */employeeNode).getElementsByTagName("*");
94 child = (Node) childList.item(indexN1008C)
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| CDATASectionImpl.java | 20 import org.w3c.dom.Node;
45 return Node.CDATA_SECTION_NODE;
49 * Splits this CDATA node into parts that do not contain a "]]>" sequence.
50 * Any newly created nodes will be inserted before this node.
57 Node parent = getParentNode();
76 * Replaces this node with a semantically equivalent text node. This node
77 * will be removed from the DOM tree and the new node inserted in its place.
79 * @return the replacement node
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ls/ |
| LSParser.java | 18 import org.w3c.dom.Node;
35 * <code>nodeValue</code> attributes of an <code>Attr</code> node initially
45 * <code>Element</code> node represents the property <b>[attributes]</b> defined in [<a href='http://www.w3.org/TR/2004/REC-xml-infoset-20040204/'>XML Information Set</a>]
178 * <dd>[<em>optional</em>] Throw a fatal <b>"doctype-not-allowed"</b> error if a doctype node is found while parsing the document. This is
345 * node. For this action to work, the context node must be an
350 * Replace all the children of the context node with the result of the
351 * parse operation. For this action to work, the context node must be an
358 * sibling of the context node. For this action to work the context
359 * node's parent must be an <code>Element</code> or
[all...] |
| /libcore/luni/src/test/java/tests/org/w3c/dom/ |
| SetNamedItemNS.java | 27 import org.w3c.dom.Node;
38 * Retrieve an attr node from the third "address" element whose local name
41 * arg being the attr node from above. Method should raise
79 Node anotherElement;
81 Node arg;
82 Node testAddress;
108 Node arg;
110 Node testAddress;
135 Node arg;
137 Node testAddress
[all...] |
| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| tree.go | 47 type Node struct {
49 left, right *Node
52 func bottomUpTree(item, depth int) *Node {
54 return &Node{item: item}
56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
59 func (n *Node) itemCheck() int {
|
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| tree.go | 47 type Node struct {
49 left, right *Node
52 func bottomUpTree(item, depth int) *Node {
54 return &Node{item: item}
56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
59 func (n *Node) itemCheck() int {
|
| /external/v8/test/cctest/compiler/ |
| test-js-context-specialization.cc | 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
55 Node* start = t.graph()->NewNode(t.common()->Start(0));
68 Node* const_context = t.jsgraph()->Constant(native);
69 Node* deep_const_context = t.jsgraph()->Constant(subcontext2);
70 Node* param_context = t.graph()->NewNode(t.common()->Parameter(0), start);
74 Node* load = t.graph()->NewNode(t.javascript()->LoadContext(0, 0, false),
82 Node* load = t.graph()->NewNode(t.javascript()->LoadContext(0, 0, false),
90 Node* load = t.graph()->NewNode(
95 Node* new_context_input = NodeProperties::GetValueInput(r.replacement(), 0)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| TreeWalker.java | 31 import org.w3c.dom.Node;
132 * @param pos Node in the tree where to start traversal
136 public void traverse(Node pos) throws org.xml.sax.SAXException
141 Node top = pos;
147 Node nextNode = pos.getFirstChild();
187 * @param pos Node in the tree where to start traversal
188 * @param top Node in the tree where to end traversal
192 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException
201 Node nextNode = pos.getFirstChild()
[all...] |
| /external/skia/src/core/ |
| SkTLList.h | 31 struct Node {
33 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node);
36 typedef SkTInternalLList<Node> NodeList;
53 Node* node = iter.init(fList, Iter::kHead_IterStart); local
54 while (node) {
55 SkTCast<T*>(node->fObj)->~T();
56 Block* block = node->fBlock;
57 node = iter.next();
60 block->fNodes[i].~Node();
72 Node* node = this->createNode(); local
81 Node* node = this->createNode(); local
91 Node* node = this->createNode(); local
101 Node* node = this->createNode(); local
118 Node* node = fList.head(); local
127 Node* node = fList.head(); local
136 Node* node = reinterpret_cast<Node*>(t); local
227 Node* node = fFreeList.head(); local
[all...] |
| /external/v8/src/compiler/ |
| instruction-selector-impl.h | 40 InstructionOperand DefineAsRegister(Node* node) {
41 return Define(node,
43 GetVReg(node)));
46 InstructionOperand DefineSameAsFirst(Node* node) {
47 return Define(node,
49 GetVReg(node)));
52 InstructionOperand DefineAsFixed(Node* node, Register reg)
[all...] |
