Lines Matching refs:node
74 * NON-DOM: resets node and sets specified values for the current node
92 * A short integer indicating what type of node this is. The named
99 /** Returns the node name. */
120 * Returns whether this text node contains
122 * The text node is determined to contain whitespace in element content
139 * nodes to this node, concatenated in document order.
158 //concatenate text of logically adjacent text nodes to the left of this node in the tree
165 //concatenate text of logically adjacent text nodes to the right of this node in the tree
187 * right of this node
188 * @param node
191 * @return true - if execution was stopped because the type of node
195 private boolean getWholeTextForward(Node node, StringBuffer buffer, Node parent){
196 // boolean to indicate whether node is a child of an entity reference
203 while (node != null) {
204 short type = node.getNodeType();
206 if (getWholeTextForward(node.getFirstChild(), buffer, node)){
212 ((NodeImpl)node).getTextContent(buffer);
218 node = node.getNextSibling();
221 // if the parent node is an entity reference node, must
222 // check nodes to the right of the parent entity reference node for logically adjacent
234 * the node
235 * @param node
238 * @return true - if execution was stopped because the type of node
242 private boolean getWholeTextBackward(Node node, StringBuffer buffer, Node parent){
244 // boolean to indicate whether node is a child of an entity reference
250 while (node != null) {
251 short type = node.getNodeType();
253 if (getWholeTextBackward(node.getLastChild(), buffer, node)){
259 ((TextImpl)node).insertTextContent(buffer);
265 node = node.getPreviousSibling();
268 // if the parent node is an entity reference node, must
269 // check nodes to the left of the parent entity reference node for logically adjacent
280 * Replaces the text of the current node and all logically-adjacent text
282 * removed including the current node unless it was the recipient of the
286 * The content of the replacing Text node.
287 * @return text - The Text node created with the specified content.
299 // remove current node
300 if (parent != null) { // check if node in the tree
324 //replace the text node
328 if (parent != null) { // check if node in the tree
343 //If the logically-adjacent next node can be removed
344 //remove it. A logically adjacent node can be removed if
345 //it is a Text or CDATASection node or an EntityReference with
361 //If the logically-adjacent next node can be removed
362 //remove it. A logically adjacent node can be removed if
363 //it is a Text or CDATASection node or an EntityReference with
384 * siblings of the node to be replaced. If a previous sibling is an
385 * EntityReference node, get it's last child. If the last child was a Text
386 * or CDATASection node and its previous siblings are neither a replaceable
389 * Node, then return true. If the last child was a Text or CDATASection node
394 * @param node
398 private boolean canModifyPrev(Node node) {
401 Node prev = node.getPreviousSibling();
433 //non-text node.
469 * siblings of the node to be replaced. If a previous sibling is an
470 * EntityReference node, get it's last child. If the first child was a Text
471 * or CDATASection node and its next siblings are neither a replaceable
475 * node any its next sibling was not or was an EntityReference that did not
479 * @param node
483 private boolean canModifyNext(Node node) {
486 Node next = node.getNextSibling();
517 //non-text node.
548 * Check if an EntityReference node has Text Only child nodes
550 * @param node
553 private boolean hasTextOnlyChildren(Node node) {
555 Node child = node;
597 * Break a text node into two sibling nodes. (Note that if the current node
603 * available data, the second node will be empty.
605 * @return A reference to the new node (containing data after the offset
606 * point). The original node will contain data up to that point.
612 * if node is read-only.
636 // insert new text node
648 * NON-DOM (used by DOMParser): Reset data for the node.