Lines Matching defs:Node
46 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction)
57 var node = this;
58 while (node) {
59 if (node === stayWithinNode) {
65 if (node.nodeType === Node.TEXT_NODE) {
66 var start = (node === this ? (offset - 1) : (node.nodeValue.length - 1));
68 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1) {
69 startNode = node;
79 node = node.traversePreviousNode(stayWithinNode);
92 node = this;
93 while (node) {
94 if (node === stayWithinNode) {
100 if (node.nodeType === Node.TEXT_NODE) {
101 var start = (node === this ? offset : 0);
102 for (var i = start; i < node.nodeValue.length; ++i) {
103 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1) {
104 endNode = node;
114 node = node.traverseNextNode(stayWithinNode);
119 endOffset = stayWithinNode.nodeType === Node.TEXT_NODE ? stayWithinNode.nodeValue.length : stayWithinNode.childNodes.length;
133 Node.prototype.traverseNextTextNode = function(stayWithin)
135 var node = this.traverseNextNode(stayWithin);
136 if (!node)
139 while (node && node.nodeType !== Node.TEXT_NODE)
140 node = node.traverseNextNode(stayWithin);
142 return node;
145 Node.prototype.rangeBoundaryForOffset = function(offset)
147 var node = this.traverseNextTextNode(this);
148 while (node && offset > node.nodeValue.length) {
149 offset -= node.nodeValue.length;
150 node = node.traverseNextTextNode(this);
152 if (!node)
154 return { container: node, offset: offset };
202 Node.prototype.enclosingNodeOrSelfWithNodeNameInArray = function(nameArray)
204 for (var node = this; node && node !== this.ownerDocument; node = node.parentNode)
206 if (node.nodeName.toLowerCase() === nameArray[i].toLowerCase())
207 return node;
211 Node.prototype.enclosingNodeOrSelfWithNodeName = function(nodeName)
216 Node.prototype.enclosingNodeOrSelfWithClass = function(className)
218 for (var node = this; node && node !== this.ownerDocument; node = node.parentNode)
219 if (node.nodeType === Node.ELEMENT_NODE && node.hasStyleClass(className))
220 return node;
224 Node.prototype.enclosingNodeWithClass = function(className)
338 var node = selection.anchorNode;
340 while (node !== this) {
341 while (node.previousSibling) {
342 node = node.previousSibling;
343 leftOffset += node.textContent.length;
345 node = node.parentNode;
351 Node.prototype.isWhitespace = isNodeWhitespace;
352 Node.prototype.displayName = nodeDisplayName;
353 Node.prototype.isAncestor = function(node)
355 return isAncestorNode(this, node);
357 Node.prototype.isDescendant = isDescendantNode;
358 Node.prototype.traverseNextNode = traverseNextNode;
359 Node.prototype.traversePreviousNode = traversePreviousNode;
464 if (!this || this.nodeType !== Node.TEXT_NODE)
477 case Node.DOCUMENT_NODE:
480 case Node.ELEMENT_NODE:
521 case Node.TEXT_NODE:
526 case Node.COMMENT_NODE:
529 case Node.DOCUMENT_TYPE_NODE:
545 function isAncestorNode(ancestor, node)
547 if (!node || !ancestor)
550 var currentNode = node.parentNode;
569 var node = this.firstChild;
570 if (node)
571 return node;
576 node = this.nextSibling;
577 if (node)
578 return node;
580 node = this;
581 while (node && !node.nextSibling && (!stayWithin || !node.parentNode || node.parentNode !== stayWithin))
582 node = node.parentNode;
583 if (!node)
586 return node.nextSibling;
595 var node = this.previousSibling;
596 while (node && node.lastChild)
597 node = node.lastChild;
598 if (node)
599 return node;
603 function getDocumentForNode(node)
605 return node.nodeType == Node.DOCUMENT_NODE ? node : node.ownerDocument;
608 function parentNode(node)
610 return node.parentNode;
