HomeSort by relevance Sort by last modified time
    Searched refs:Node (Results 426 - 450 of 2349) sorted by null

<<11121314151617181920>>

  /libcore/dom/src/test/java/org/w3c/domts/level1/core/
hc_attrappendchild2.java 60 Node testNode;
64 Node newChild;
65 Node retval;
66 Node lastChild;
hc_attrappendchild4.java 64 Node testNode;
68 Node textNode;
69 Node retval;
70 Node lastChild;
hc_attrappendchild5.java 31 * Attempt to append a node from another document to an attribute which should result
62 Node testNode;
66 Node textNode;
67 Node retval;
68 Node lastChild;
hc_attrinsertbefore5.java 64 Node testNode;
68 Node textNode;
69 Node retval;
70 Node refChild = null;
hc_attrinsertbefore6.java 31 * Attempt to append a text node from another document to an attribute which should result
62 Node testNode;
66 Node textNode;
67 Node retval;
68 Node refChild = null;
hc_attrnormalize.java 31 * Appends a text node to an attribute, normalizes the attribute
32 * and checks for a single child node.
61 Node testNode;
66 Node retval;
67 Node firstChild;
68 Node secondChild;
78 ((Element) /*Node */testNode).normalize();
hc_attrsetvalue1.java 59 Node testNode;
63 Node retval;
64 Node firstChild;
65 Node otherChild;
74 firstChild.setNodeValue("impl reused node");
hc_attrsetvalue2.java 59 Node testNode;
64 Node retval;
65 Node firstChild;
66 Node otherChild;
77 firstChild.setNodeValue("impl reused node");
hc_nodeappendchild.java 32 * node to the list of children. The last node in the list
63 Node employeeNode;
65 Node createdNode;
66 Node lchild;
68 Node appendedChild;
hc_nodeappendchildnodeancestor.java 32 * HIERARCHY_REQUEST_ERR DOMException if the node to
33 * append is one of this node's ancestors.
36 * an ancestor node(root node) to it.
68 Node newChild;
70 Node employeeNode;
72 Node oldChild;
73 Node appendedChild;
hc_nodecloneattributescopied.java 33 * duplicate node returned by the method should copy the
34 * attributes associated with this node.
64 Node addressNode;
65 Node clonedNode;
67 Node attributeNode;
86 attributeNode = (Node) attributes.item(indexN10076);
hc_nodeinsertbeforenewchilddiffdocument.java 34 * created this node.
72 Node refChild;
73 Node newChild;
75 Node elementNode;
76 Node insertedNode;
hc_nodeinsertbeforenodeancestor.java 32 * HIERARCHY_REQUEST_ERR DOMException if the node to be
36 * node that is one of its ancestors(root node). An
37 * attempt to insert such a node should raise the
68 Node newChild;
70 Node employeeNode;
72 Node refChild;
73 Node insertedNode;
hc_nodeinsertbeforenodename.java 32 * the node being inserted.
34 * Insert an Element node before the fourth
35 * child of the second employee and check the node
37 * method. The node returned should be "newChild".
67 Node employeeNode;
69 Node refChild;
70 Node newChild;
71 Node insertedNode;
hc_nodeinsertbeforerefchildnonexistent.java 33 * not a child of this node.
36 * new node before a reference node that is not a child
37 * of this node. An attempt to insert before a non child
38 * node should raise the desired exception.
70 Node refChild;
71 Node newChild;
73 Node elementNode;
74 Node insertedNode;
hc_nodereplacechildnewchilddiffdocument.java 34 * created this node.
37 * of its children with a node created from a different
72 Node oldChild;
73 Node newChild;
75 Node elementNode;
76 Node replacedChild;
hc_nodereplacechildnodeancestor.java 32 * HIERARCHY_REQUEST_ERR DOMException if the node to put
33 * in is one of this node's ancestors.
36 * one of its children with an ancestor node(root node).
68 Node newChild;
70 Node employeeNode;
72 Node oldChild;
73 Node replacedNode;
hc_nodereplacechildnodename.java 32 * the node being replaced.
35 * a newly created node Element and check the NodeName
37 * method. The returned node should have a NodeName equal
68 Node employeeNode;
70 Node oldChild;
71 Node newChild;
72 Node replacedNode;
77 childList = ((Element) /*Node */employeeNode).getElementsByTagName("em");
hc_nodereplacechildoldchildnonexistent.java 33 * not a child of this node.
36 * node that is not one of its children. An attempt to
37 * replace such a node should raise the desired exception.
68 Node oldChild;
69 Node newChild;
71 Node elementNode;
72 Node replacedNode;
nodeappendchild.java 31 * The "appendChild(newChild)" method adds the node
33 * node.
36 * node to the list of children. The last node in the list
67 Node employeeNode;
69 Node createdNode;
70 Node lchild;
72 Node appendedChild;
nodecloneattributescopied.java 32 * Element node, all the attributes of the Element are
37 * duplicate node returned by the method should copy the
38 * attributes associated with this node.
67 Node addressNode;
68 Node clonedNode;
70 Node attributeNode;
84 attributeNode = (Node) attributes.item(indexN10065);
nodeinsertbeforenewchilddiffdocument.java 34 * created this node.
72 Node refChild;
73 Node newChild;
75 Node elementNode;
76 Node insertedNode;
nodeinsertbeforenodeancestor.java 32 * HIERARCHY_REQUEST_ERR DOMException if the node to be
36 * node that is one of its ancestors(root node). An
37 * attempt to insert such a node should raise the
70 Node newChild;
72 Node employeeNode;
74 Node refChild;
75 Node insertedNode;
nodeinsertbeforenodename.java 32 * the node being inserted.
34 * Insert an Element node before the fourth
35 * child of the second employee and check the node
37 * method. The node returned should be "newChild".
67 Node employeeNode;
69 Node refChild;
70 Node newChild;
71 Node insertedNode;
nodeinsertbeforerefchildnonexistent.java 33 * not a child of this node.
36 * new node before a reference node that is not a child
37 * of this node. An attempt to insert before a non child
38 * node should raise the desired exception.
70 Node refChild;
71 Node newChild;
73 Node elementNode;
74 Node insertedNode;

Completed in 102 milliseconds

<<11121314151617181920>>