+ // Loop all siblings\r
+ for (node = node[name]; node; node = node[name]) {\r
+ if (f(node))\r
+ return node;\r
+ }\r
+ }\r
+\r
+ return null;\r
+ },\r
+\r
+ _isRes : function(c) {\r
+ // Is live resizble element\r
+ return /^(top|left|bottom|right|width|height)/i.test(c) || /;\s*(top|left|bottom|right|width|height)/i.test(c);\r
+ }\r
+\r
+ /*\r
+ walk : function(n, f, s) {\r
+ var d = this.doc, w;\r
+\r
+ if (d.createTreeWalker) {\r
+ w = d.createTreeWalker(n, NodeFilter.SHOW_TEXT, null, false);\r
+\r
+ while ((n = w.nextNode()) != null)\r
+ f.call(s || this, n);\r
+ } else\r
+ tinymce.walk(n, f, 'childNodes', s);\r
+ }\r
+ */\r
+\r
+ /*\r
+ toRGB : function(s) {\r
+ var c = /^\s*?#([0-9A-F]{2})([0-9A-F]{1,2})([0-9A-F]{2})?\s*?$/.exec(s);\r
+\r
+ if (c) {\r
+ // #FFF -> #FFFFFF\r
+ if (!is(c[3]))\r
+ c[3] = c[2] = c[1];\r
+\r
+ return "rgb(" + parseInt(c[1], 16) + "," + parseInt(c[2], 16) + "," + parseInt(c[3], 16) + ")";\r
+ }\r
+\r
+ return s;\r
+ }\r
+ */\r
+ });\r
+\r
+ tinymce.DOM = new tinymce.dom.DOMUtils(document, {process_html : 0});\r
+})(tinymce);\r
+\r
+(function(ns) {\r
+ // Range constructor\r
+ function Range(dom) {\r
+ var t = this,\r
+ doc = dom.doc,\r
+ EXTRACT = 0,\r
+ CLONE = 1,\r
+ DELETE = 2,\r
+ TRUE = true,\r
+ FALSE = false,\r
+ START_OFFSET = 'startOffset',\r
+ START_CONTAINER = 'startContainer',\r
+ END_CONTAINER = 'endContainer',\r
+ END_OFFSET = 'endOffset',\r
+ extend = tinymce.extend,\r
+ nodeIndex = dom.nodeIndex;\r
+\r
+ extend(t, {\r
+ // Inital states\r
+ startContainer : doc,\r
+ startOffset : 0,\r
+ endContainer : doc,\r
+ endOffset : 0,\r
+ collapsed : TRUE,\r
+ commonAncestorContainer : doc,\r
+\r
+ // Range constants\r
+ START_TO_START : 0,\r
+ START_TO_END : 1,\r
+ END_TO_END : 2,\r
+ END_TO_START : 3,\r
+\r
+ // Public methods\r
+ setStart : setStart,\r
+ setEnd : setEnd,\r
+ setStartBefore : setStartBefore,\r
+ setStartAfter : setStartAfter,\r
+ setEndBefore : setEndBefore,\r
+ setEndAfter : setEndAfter,\r
+ collapse : collapse,\r
+ selectNode : selectNode,\r
+ selectNodeContents : selectNodeContents,\r
+ compareBoundaryPoints : compareBoundaryPoints,\r
+ deleteContents : deleteContents,\r
+ extractContents : extractContents,\r
+ cloneContents : cloneContents,\r
+ insertNode : insertNode,\r
+ surroundContents : surroundContents,\r
+ cloneRange : cloneRange\r
+ });\r
+\r
+ function setStart(n, o) {\r
+ _setEndPoint(TRUE, n, o);\r
+ };\r
+\r
+ function setEnd(n, o) {\r
+ _setEndPoint(FALSE, n, o);\r
+ };\r
+\r
+ function setStartBefore(n) {\r
+ setStart(n.parentNode, nodeIndex(n));\r
+ };\r
+\r
+ function setStartAfter(n) {\r
+ setStart(n.parentNode, nodeIndex(n) + 1);\r
+ };\r
+\r
+ function setEndBefore(n) {\r
+ setEnd(n.parentNode, nodeIndex(n));\r
+ };\r
+\r
+ function setEndAfter(n) {\r
+ setEnd(n.parentNode, nodeIndex(n) + 1);\r
+ };\r
+\r
+ function collapse(ts) {\r
+ if (ts) {\r
+ t[END_CONTAINER] = t[START_CONTAINER];\r
+ t[END_OFFSET] = t[START_OFFSET];\r
+ } else {\r
+ t[START_CONTAINER] = t[END_CONTAINER];\r
+ t[START_OFFSET] = t[END_OFFSET];\r
+ }\r
+\r
+ t.collapsed = TRUE;\r
+ };\r
+\r
+ function selectNode(n) {\r
+ setStartBefore(n);\r
+ setEndAfter(n);\r
+ };\r
+\r
+ function selectNodeContents(n) {\r
+ setStart(n, 0);\r
+ setEnd(n, n.nodeType === 1 ? n.childNodes.length : n.nodeValue.length);\r
+ };\r
+\r
+ function compareBoundaryPoints(h, r) {\r
+ var sc = t[START_CONTAINER], so = t[START_OFFSET], ec = t[END_CONTAINER], eo = t[END_OFFSET],\r
+ rsc = r.startContainer, rso = r.startOffset, rec = r.endContainer, reo = r.endOffset;\r
+\r
+ // Check START_TO_START\r
+ if (h === 0)\r
+ return _compareBoundaryPoints(sc, so, rsc, rso);\r
+ \r
+ // Check START_TO_END\r
+ if (h === 1)\r
+ return _compareBoundaryPoints(ec, eo, rsc, rso);\r
+ \r
+ // Check END_TO_END\r
+ if (h === 2)\r
+ return _compareBoundaryPoints(ec, eo, rec, reo);\r
+ \r
+ // Check END_TO_START\r
+ if (h === 3) \r
+ return _compareBoundaryPoints(sc, so, rec, reo);\r
+ };\r
+\r
+ function deleteContents() {\r
+ _traverse(DELETE);\r
+ };\r
+\r
+ function extractContents() {\r
+ return _traverse(EXTRACT);\r
+ };\r
+\r
+ function cloneContents() {\r
+ return _traverse(CLONE);\r
+ };\r
+\r
+ function insertNode(n) {\r
+ var startContainer = this[START_CONTAINER],\r
+ startOffset = this[START_OFFSET], nn, o;\r
+\r
+ // Node is TEXT_NODE or CDATA\r
+ if ((startContainer.nodeType === 3 || startContainer.nodeType === 4) && startContainer.nodeValue) {\r
+ if (!startOffset) {\r
+ // At the start of text\r
+ startContainer.parentNode.insertBefore(n, startContainer);\r
+ } else if (startOffset >= startContainer.nodeValue.length) {\r
+ // At the end of text\r
+ dom.insertAfter(n, startContainer);\r
+ } else {\r
+ // Middle, need to split\r
+ nn = startContainer.splitText(startOffset);\r
+ startContainer.parentNode.insertBefore(n, nn);\r
+ }\r
+ } else {\r
+ // Insert element node\r
+ if (startContainer.childNodes.length > 0)\r
+ o = startContainer.childNodes[startOffset];\r
+\r
+ if (o)\r
+ startContainer.insertBefore(n, o);\r
+ else\r
+ startContainer.appendChild(n);\r
+ }\r
+ };\r
+\r
+ function surroundContents(n) {\r
+ var f = t.extractContents();\r
+\r
+ t.insertNode(n);\r
+ n.appendChild(f);\r
+ t.selectNode(n);\r
+ };\r
+\r
+ function cloneRange() {\r
+ return extend(new Range(dom), {\r
+ startContainer : t[START_CONTAINER],\r
+ startOffset : t[START_OFFSET],\r
+ endContainer : t[END_CONTAINER],\r
+ endOffset : t[END_OFFSET],\r
+ collapsed : t.collapsed,\r
+ commonAncestorContainer : t.commonAncestorContainer\r
+ });\r
+ };\r
+\r
+ // Private methods\r
+\r
+ function _getSelectedNode(container, offset) {\r
+ var child;\r
+\r
+ if (container.nodeType == 3 /* TEXT_NODE */)\r
+ return container;\r
+\r
+ if (offset < 0)\r
+ return container;\r
+\r
+ child = container.firstChild;\r
+ while (child && offset > 0) {\r
+ --offset;\r
+ child = child.nextSibling;\r
+ }\r
+\r
+ if (child)\r
+ return child;\r
+\r
+ return container;\r
+ };\r
+\r
+ function _isCollapsed() {\r
+ return (t[START_CONTAINER] == t[END_CONTAINER] && t[START_OFFSET] == t[END_OFFSET]);\r
+ };\r
+\r
+ function _compareBoundaryPoints(containerA, offsetA, containerB, offsetB) {\r
+ var c, offsetC, n, cmnRoot, childA, childB;\r
+ \r
+ // In the first case the boundary-points have the same container. A is before B\r
+ // if its offset is less than the offset of B, A is equal to B if its offset is\r
+ // equal to the offset of B, and A is after B if its offset is greater than the\r
+ // offset of B.\r
+ if (containerA == containerB) {\r
+ if (offsetA == offsetB)\r
+ return 0; // equal\r
+\r
+ if (offsetA < offsetB)\r
+ return -1; // before\r
+\r
+ return 1; // after\r
+ }\r
+\r
+ // In the second case a child node C of the container of A is an ancestor\r
+ // container of B. In this case, A is before B if the offset of A is less than or\r
+ // equal to the index of the child node C and A is after B otherwise.\r
+ c = containerB;\r
+ while (c && c.parentNode != containerA)\r
+ c = c.parentNode;\r
+\r
+ if (c) {\r
+ offsetC = 0;\r
+ n = containerA.firstChild;\r
+\r
+ while (n != c && offsetC < offsetA) {\r
+ offsetC++;\r
+ n = n.nextSibling;\r
+ }\r
+\r
+ if (offsetA <= offsetC)\r
+ return -1; // before\r
+\r
+ return 1; // after\r
+ }\r
+\r
+ // In the third case a child node C of the container of B is an ancestor container\r
+ // of A. In this case, A is before B if the index of the child node C is less than\r
+ // the offset of B and A is after B otherwise.\r
+ c = containerA;\r
+ while (c && c.parentNode != containerB) {\r
+ c = c.parentNode;\r
+ }\r
+\r
+ if (c) {\r
+ offsetC = 0;\r
+ n = containerB.firstChild;\r
+\r
+ while (n != c && offsetC < offsetB) {\r
+ offsetC++;\r
+ n = n.nextSibling;\r
+ }\r
+\r
+ if (offsetC < offsetB)\r
+ return -1; // before\r
+\r
+ return 1; // after\r
+ }\r
+\r
+ // In the fourth case, none of three other cases hold: the containers of A and B\r
+ // are siblings or descendants of sibling nodes. In this case, A is before B if\r
+ // the container of A is before the container of B in a pre-order traversal of the\r
+ // Ranges' context tree and A is after B otherwise.\r
+ cmnRoot = dom.findCommonAncestor(containerA, containerB);\r
+ childA = containerA;\r
+\r
+ while (childA && childA.parentNode != cmnRoot)\r
+ childA = childA.parentNode;\r
+\r
+ if (!childA)\r
+ childA = cmnRoot;\r
+\r
+ childB = containerB;\r
+ while (childB && childB.parentNode != cmnRoot)\r
+ childB = childB.parentNode;\r
+\r
+ if (!childB)\r
+ childB = cmnRoot;\r
+\r
+ if (childA == childB)\r
+ return 0; // equal\r
+\r
+ n = cmnRoot.firstChild;\r
+ while (n) {\r
+ if (n == childA)\r
+ return -1; // before\r
+\r
+ if (n == childB)\r
+ return 1; // after\r
+\r
+ n = n.nextSibling;\r
+ }\r
+ };\r
+\r
+ function _setEndPoint(st, n, o) {\r
+ var ec, sc;\r
+\r
+ if (st) {\r
+ t[START_CONTAINER] = n;\r
+ t[START_OFFSET] = o;\r
+ } else {\r
+ t[END_CONTAINER] = n;\r
+ t[END_OFFSET] = o;\r
+ }\r
+\r
+ // If one boundary-point of a Range is set to have a root container\r
+ // other than the current one for the Range, the Range is collapsed to\r
+ // the new position. This enforces the restriction that both boundary-\r
+ // points of a Range must have the same root container.\r
+ ec = t[END_CONTAINER];\r
+ while (ec.parentNode)\r
+ ec = ec.parentNode;\r
+\r
+ sc = t[START_CONTAINER];\r
+ while (sc.parentNode)\r
+ sc = sc.parentNode;\r
+\r
+ if (sc == ec) {\r
+ // The start position of a Range is guaranteed to never be after the\r
+ // end position. To enforce this restriction, if the start is set to\r
+ // be at a position after the end, the Range is collapsed to that\r
+ // position.\r
+ if (_compareBoundaryPoints(t[START_CONTAINER], t[START_OFFSET], t[END_CONTAINER], t[END_OFFSET]) > 0)\r
+ t.collapse(st);\r
+ } else\r
+ t.collapse(st);\r
+\r
+ t.collapsed = _isCollapsed();\r
+ t.commonAncestorContainer = dom.findCommonAncestor(t[START_CONTAINER], t[END_CONTAINER]);\r
+ };\r
+\r
+ function _traverse(how) {\r
+ var c, endContainerDepth = 0, startContainerDepth = 0, p, depthDiff, startNode, endNode, sp, ep;\r
+\r
+ if (t[START_CONTAINER] == t[END_CONTAINER])\r
+ return _traverseSameContainer(how);\r
+\r
+ for (c = t[END_CONTAINER], p = c.parentNode; p; c = p, p = p.parentNode) {\r
+ if (p == t[START_CONTAINER])\r
+ return _traverseCommonStartContainer(c, how);\r
+\r
+ ++endContainerDepth;\r
+ }\r
+\r
+ for (c = t[START_CONTAINER], p = c.parentNode; p; c = p, p = p.parentNode) {\r
+ if (p == t[END_CONTAINER])\r
+ return _traverseCommonEndContainer(c, how);\r
+\r
+ ++startContainerDepth;\r
+ }\r
+\r
+ depthDiff = startContainerDepth - endContainerDepth;\r
+\r
+ startNode = t[START_CONTAINER];\r
+ while (depthDiff > 0) {\r
+ startNode = startNode.parentNode;\r
+ depthDiff--;\r
+ }\r
+\r
+ endNode = t[END_CONTAINER];\r
+ while (depthDiff < 0) {\r
+ endNode = endNode.parentNode;\r
+ depthDiff++;\r
+ }\r
+\r
+ // ascend the ancestor hierarchy until we have a common parent.\r
+ for (sp = startNode.parentNode, ep = endNode.parentNode; sp != ep; sp = sp.parentNode, ep = ep.parentNode) {\r
+ startNode = sp;\r
+ endNode = ep;\r
+ }\r
+\r
+ return _traverseCommonAncestors(startNode, endNode, how);\r
+ };\r
+\r
+ function _traverseSameContainer(how) {\r
+ var frag, s, sub, n, cnt, sibling, xferNode;\r
+\r
+ if (how != DELETE)\r
+ frag = doc.createDocumentFragment();\r
+\r
+ // If selection is empty, just return the fragment\r
+ if (t[START_OFFSET] == t[END_OFFSET])\r
+ return frag;\r
+\r
+ // Text node needs special case handling\r
+ if (t[START_CONTAINER].nodeType == 3 /* TEXT_NODE */) {\r
+ // get the substring\r
+ s = t[START_CONTAINER].nodeValue;\r
+ sub = s.substring(t[START_OFFSET], t[END_OFFSET]);\r
+\r
+ // set the original text node to its new value\r
+ if (how != CLONE) {\r
+ t[START_CONTAINER].deleteData(t[START_OFFSET], t[END_OFFSET] - t[START_OFFSET]);\r
+\r
+ // Nothing is partially selected, so collapse to start point\r
+ t.collapse(TRUE);\r
+ }\r
+\r
+ if (how == DELETE)\r
+ return;\r
+\r
+ frag.appendChild(doc.createTextNode(sub));\r
+ return frag;\r
+ }\r
+\r
+ // Copy nodes between the start/end offsets.\r
+ n = _getSelectedNode(t[START_CONTAINER], t[START_OFFSET]);\r
+ cnt = t[END_OFFSET] - t[START_OFFSET];\r
+\r
+ while (cnt > 0) {\r
+ sibling = n.nextSibling;\r
+ xferNode = _traverseFullySelected(n, how);\r
+\r
+ if (frag)\r
+ frag.appendChild( xferNode );\r
+\r
+ --cnt;\r
+ n = sibling;\r
+ }\r
+\r
+ // Nothing is partially selected, so collapse to start point\r
+ if (how != CLONE)\r
+ t.collapse(TRUE);\r
+\r
+ return frag;\r
+ };\r
+\r
+ function _traverseCommonStartContainer(endAncestor, how) {\r
+ var frag, n, endIdx, cnt, sibling, xferNode;\r
+\r
+ if (how != DELETE)\r
+ frag = doc.createDocumentFragment();\r
+\r
+ n = _traverseRightBoundary(endAncestor, how);\r
+\r
+ if (frag)\r
+ frag.appendChild(n);\r
+\r
+ endIdx = nodeIndex(endAncestor);\r
+ cnt = endIdx - t[START_OFFSET];\r
+\r
+ if (cnt <= 0) {\r
+ // Collapse to just before the endAncestor, which\r
+ // is partially selected.\r
+ if (how != CLONE) {\r
+ t.setEndBefore(endAncestor);\r
+ t.collapse(FALSE);\r
+ }\r
+\r
+ return frag;\r
+ }\r
+\r
+ n = endAncestor.previousSibling;\r
+ while (cnt > 0) {\r
+ sibling = n.previousSibling;\r
+ xferNode = _traverseFullySelected(n, how);\r
+\r
+ if (frag)\r
+ frag.insertBefore(xferNode, frag.firstChild);\r
+\r
+ --cnt;\r
+ n = sibling;\r
+ }\r
+\r
+ // Collapse to just before the endAncestor, which\r
+ // is partially selected.\r
+ if (how != CLONE) {\r
+ t.setEndBefore(endAncestor);\r
+ t.collapse(FALSE);\r
+ }\r
+\r
+ return frag;\r
+ };\r
+\r
+ function _traverseCommonEndContainer(startAncestor, how) {\r
+ var frag, startIdx, n, cnt, sibling, xferNode;\r
+\r
+ if (how != DELETE)\r
+ frag = doc.createDocumentFragment();\r
+\r
+ n = _traverseLeftBoundary(startAncestor, how);\r
+ if (frag)\r
+ frag.appendChild(n);\r
+\r
+ startIdx = nodeIndex(startAncestor);\r
+ ++startIdx; // Because we already traversed it\r
+\r
+ cnt = t[END_OFFSET] - startIdx;\r
+ n = startAncestor.nextSibling;\r
+ while (cnt > 0) {\r
+ sibling = n.nextSibling;\r
+ xferNode = _traverseFullySelected(n, how);\r
+\r
+ if (frag)\r
+ frag.appendChild(xferNode);\r
+\r
+ --cnt;\r
+ n = sibling;\r
+ }\r
+\r
+ if (how != CLONE) {\r
+ t.setStartAfter(startAncestor);\r
+ t.collapse(TRUE);\r
+ }\r
+\r
+ return frag;\r
+ };\r
+\r
+ function _traverseCommonAncestors(startAncestor, endAncestor, how) {\r
+ var n, frag, commonParent, startOffset, endOffset, cnt, sibling, nextSibling;\r
+\r
+ if (how != DELETE)\r
+ frag = doc.createDocumentFragment();\r
+\r
+ n = _traverseLeftBoundary(startAncestor, how);\r
+ if (frag)\r
+ frag.appendChild(n);\r
+\r
+ commonParent = startAncestor.parentNode;\r
+ startOffset = nodeIndex(startAncestor);\r
+ endOffset = nodeIndex(endAncestor);\r
+ ++startOffset;\r
+\r
+ cnt = endOffset - startOffset;\r
+ sibling = startAncestor.nextSibling;\r
+\r
+ while (cnt > 0) {\r
+ nextSibling = sibling.nextSibling;\r
+ n = _traverseFullySelected(sibling, how);\r
+\r
+ if (frag)\r
+ frag.appendChild(n);\r
+\r
+ sibling = nextSibling;\r
+ --cnt;\r
+ }\r
+\r
+ n = _traverseRightBoundary(endAncestor, how);\r
+\r
+ if (frag)\r
+ frag.appendChild(n);\r
+\r
+ if (how != CLONE) {\r
+ t.setStartAfter(startAncestor);\r
+ t.collapse(TRUE);\r
+ }\r
+\r
+ return frag;\r
+ };\r
+\r
+ function _traverseRightBoundary(root, how) {\r
+ var next = _getSelectedNode(t[END_CONTAINER], t[END_OFFSET] - 1), parent, clonedParent, prevSibling, clonedChild, clonedGrandParent, isFullySelected = next != t[END_CONTAINER];\r
+\r
+ if (next == root)\r
+ return _traverseNode(next, isFullySelected, FALSE, how);\r
+\r
+ parent = next.parentNode;\r
+ clonedParent = _traverseNode(parent, FALSE, FALSE, how);\r
+\r
+ while (parent) {\r
+ while (next) {\r
+ prevSibling = next.previousSibling;\r
+ clonedChild = _traverseNode(next, isFullySelected, FALSE, how);\r
+\r
+ if (how != DELETE)\r
+ clonedParent.insertBefore(clonedChild, clonedParent.firstChild);\r
+\r
+ isFullySelected = TRUE;\r
+ next = prevSibling;\r
+ }\r