Lines Matching refs:node
55 * It does _not_ attempt to address the "node identity" question; no effort
57 * DTM node. Users can create a mechanism for managing this, or relinquish the
61 * DTMNodeProxy may be subclassed further to present specific DOM node types.
70 /** The DTM for this node. */
73 /** The DTM node handle. */
74 int node;
86 * @param node The DTM node handle.
88 public DTMNodeProxy(DTM dtm, int node)
91 this.node = node;
105 * NON-DOM: Return the DTM node number
107 * @return The DTM node handle.
111 return node;
115 * Test for equality based on node number.
117 * @param node A DTM node proxy reference.
119 * @return true if the given node has the same handle as this node.
121 public final boolean equals(Node node)
126 DTMNodeProxy dtmp = (DTMNodeProxy) node;
128 // return (dtmp.node == this.node);
130 return (dtmp.node == this.node) && (dtmp.dtm == this.dtm);
139 * Test for equality based on node number.
141 * @param node A DTM node proxy reference.
143 * @return true if the given node has the same handle as this node.
146 public final boolean equals(Object node)
148 // DTMNodeProxy dtmp = (DTMNodeProxy)node;
149 // return (dtmp.node == this.node);
151 return node instanceof Node && equals((Node) node);
158 hash = 29 * hash + this.node;
163 * FUTURE DOM: Test node identity, in lieu of Node==Node
167 * @return true if the given node has the same handle as this node.
177 return this.dtm == that.dtm && this.node == that.node;
188 return dtm.getNodeName(node);
207 return dtm.getNodeName(node);
218 return dtm.getLocalName(node);
222 * @return The prefix for this node.
228 return dtm.getPrefix(node);
252 return dtm.getNamespaceURI(node);
304 return dtm.getNodeValue(node);
308 * @return The string value of the node
314 return dtm.getStringValue(node).toString();
338 return (short) dtm.getNodeType(node);
353 int newnode = dtm.getParent(node);
366 int newnode = dtm.getParent(node);
383 return new DTMChildIterNodeList(dtm,node);
397 int newnode = dtm.getFirstChild(node);
411 int newnode = dtm.getLastChild(node);
425 int newnode = dtm.getPreviousSibling(node);
440 if (dtm.getNodeType(node) == Node.ATTRIBUTE_NODE)
443 int newnode = dtm.getNextSibling(node);
459 return new DTMNamedNodeMap(dtm, node);
472 return DTM.NULL != dtm.getAttributeNode(node,null,name);
487 return DTM.NULL != dtm.getAttributeNode(node,namespaceURI,localName);
499 return (Document)(dtm.getNode(dtm.getOwnerDocument(node)));
574 return (DTM.NULL != dtm.getFirstChild(node));
784 Node retNode = dtm.getNode(node);
797 traverseChildren(listVector, dtm.getNode(node), tagname,
915 Node retNode = dtm.getNode(node);
930 traverseChildren(listVector, dtm.getNode(node), namespaceURI, localName, isNamespaceURIWildCard, isLocalNameWildCard);
1029 return dtm.getNodeValue(node);
1054 return dtm.getNodeValue(node).length();
1138 return dtm.getNodeName(node);
1151 DTMNamedNodeMap map = new DTMNamedNodeMap(dtm, node);
1194 DTMNamedNodeMap map = new DTMNamedNodeMap(dtm, node);
1236 return DTM.NULL != dtm.getFirstAttribute(node);
1258 int n = dtm.getAttributeNode(node,namespaceURI,localName);
1308 int n = dtm.getAttributeNode(node,namespaceURI,localName);
1338 return dtm.getNodeName(node);
1364 return dtm.getNodeValue(node);
1391 int newnode = dtm.getParent(node);
1608 // we don't have any alternate node, either this node does the job
1627 * Retrieves the object associated to a key on a this node. The object
1628 * must first have been set to this node by calling
1632 * on this node, or <code>null</code> if there was none.
1662 // we don't have any alternate node, either this node does the job
1681 * length and for each node that exists in one map there is a node that
1686 * for <code>Attr</code> nodes as for any other type of node. Note that
1701 * @param arg The node to compare equality with.
1779 * Look up the namespace URI associated to the given prefix, starting from this node.
1949 * Look up the prefix associated to the given namespace URI, starting from this node.
2003 * Returns whether this node is the same node as the given one.
2011 * @param other The node to test against.
2023 * This attribute returns the text content of this node and its
2025 * When set, any possible children this node may have are removed and
2026 * replaced by a single <code>Text</code> node containing the string
2032 * <br>The string returned is made of the text content of this node
2044 * attribute value of every child node, excluding COMMENT_NODE and
2060 * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly.
2073 * This attribute returns the text content of this node and its
2075 * When set, any possible children this node may have are removed and
2076 * replaced by a single <code>Text</code> node containing the string
2082 * <br>The string returned is made of the text content of this node
2094 * attribute value of every child node, excluding COMMENT_NODE and
2110 * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly.
2123 * Compares a node with this node with regard to their position in the
2125 * @param other The node to compare against this node.
2126 * @return Returns how the given node is positioned relatively to this
2127 * node.
2136 * The absolute base URI of this node or <code>null</code> if undefined.
2142 * <br> When the node is an <code>Element</code>, a <code>Document</code>
2144 * the properties [base URI] defined in . When the node is a
2166 * Renaming node
2267 // remove current node
2268 if (parent !=null) { // check if node in the tree
2276 if (parent !=null) { // check if node in the tree
2301 * nodes to this node, concatenated in document order.
2327 * Returns whether this text node contains whitespace in element content,
2345 * DOM Level 3: register the given attribute node as an ID attribute
2354 * DOM Level 3: register the given attribute node as an ID attribute
2362 * DOM Level 3: register the given attribute node as an ID attribute