/home/aqcert/public_html/admin/tinymce/js/tinymce/classes/dom
Edit: /home/aqcert/public_html/admin/tinymce/js/tinymce/classes/dom/TreeWalker.js (2913B)
/**
* TreeWalker.js
*
* Released under LGPL License.
* Copyright (c) 1999-2015 Ephox Corp. All rights reserved
*
* License: http://www.tinymce.com/license
* Contributing: http://www.tinymce.com/contributing
*/
/**
* TreeWalker class enables you to walk the DOM in a linear manner.
*
* @class tinymce.dom.TreeWalker
* @example
* var walker = new tinymce.dom.TreeWalker(startNode);
*
* do {
* console.log(walker.current());
* } while (walker.next());
*/
define("tinymce/dom/TreeWalker", [], function() {
/**
* Constructs a new TreeWalker instance.
*
* @constructor
* @method TreeWalker
* @param {Node} startNode Node to start walking from.
* @param {node} rootNode Optional root node to never walk out of.
*/
return function(startNode, rootNode) {
var node = startNode;
function findSibling(node, startName, siblingName, shallow) {
var sibling, parent;
if (node) {
// Walk into nodes if it has a start
if (!shallow && node[startName]) {
return node[startName];
}
// Return the sibling if it has one
if (node != rootNode) {
sibling = node[siblingName];
if (sibling) {
return sibling;
}
// Walk up the parents to look for siblings
for (parent = node.parentNode; parent && parent != rootNode; parent = parent.parentNode) {
sibling = parent[siblingName];
if (sibling) {
return sibling;
}
}
}
}
}
function findPreviousNode(node, startName, siblingName, shallow) {
var sibling, parent, child;
if (node) {
sibling = node[siblingName];
if (rootNode && sibling === rootNode) {
return;
}
if (sibling) {
if (!shallow) {
// Walk up the parents to look for siblings
for (child = sibling[startName]; child; child = child[startName]) {
if (!child[startName]) {
return child;
}
}
}
return sibling;
}
parent = node.parentNode;
if (parent && parent !== rootNode) {
return parent;
}
}
}
/**
* Returns the current node.
*
* @method current
* @return {Node} Current node where the walker is.
*/
this.current = function() {
return node;
};
/**
* Walks to the next node in tree.
*
* @method next
* @return {Node} Current node where the walker is after moving to the next node.
*/
this.next = function(shallow) {
node = findSibling(node, 'firstChild', 'nextSibling', shallow);
return node;
};
/**
* Walks to the previous node in tree.
*
* @method prev
* @return {Node} Current node where the walker is after moving to the previous node.
*/
this.prev = function(shallow) {
node = findSibling(node, 'lastChild', 'previousSibling', shallow);
return node;
};
this.prev2 = function(shallow) {
node = findPreviousNode(node, 'lastChild', 'previousSibling', shallow);
return node;
};
};
});