projen 0.98.32 → 0.98.34

package/node_modules/@oozcitak/dom/lib/algorithm/RangeAlgorithm.js

@@ -1,46 +1,27 @@
 "use strict";
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-var __spread = (this && this.__spread) || function () {
-    for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));
-    return ar;
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-var interfaces_1 = require("../dom/interfaces");
-var DOMException_1 = require("../dom/DOMException");
-var util_1 = require("../util");
-var CreateAlgorithm_1 = require("./CreateAlgorithm");
-var TreeAlgorithm_1 = require("./TreeAlgorithm");
-var BoundaryPointAlgorithm_1 = require("./BoundaryPointAlgorithm");
-var CharacterDataAlgorithm_1 = require("./CharacterDataAlgorithm");
-var NodeAlgorithm_1 = require("./NodeAlgorithm");
-var MutationAlgorithm_1 = require("./MutationAlgorithm");
-var TextAlgorithm_1 = require("./TextAlgorithm");
+exports.range_collapsed = range_collapsed;
+exports.range_root = range_root;
+exports.range_isContained = range_isContained;
+exports.range_isPartiallyContained = range_isPartiallyContained;
+exports.range_setTheStart = range_setTheStart;
+exports.range_setTheEnd = range_setTheEnd;
+exports.range_select = range_select;
+exports.range_extract = range_extract;
+exports.range_cloneTheContents = range_cloneTheContents;
+exports.range_insert = range_insert;
+exports.range_getContainedNodes = range_getContainedNodes;
+exports.range_getPartiallyContainedNodes = range_getPartiallyContainedNodes;
+const interfaces_1 = require("../dom/interfaces");
+const DOMException_1 = require("../dom/DOMException");
+const util_1 = require("../util");
+const CreateAlgorithm_1 = require("./CreateAlgorithm");
+const TreeAlgorithm_1 = require("./TreeAlgorithm");
+const BoundaryPointAlgorithm_1 = require("./BoundaryPointAlgorithm");
+const CharacterDataAlgorithm_1 = require("./CharacterDataAlgorithm");
+const NodeAlgorithm_1 = require("./NodeAlgorithm");
+const MutationAlgorithm_1 = require("./MutationAlgorithm");
+const TextAlgorithm_1 = require("./TextAlgorithm");
 /**
  * Determines if the node's start boundary point is at its end boundary
  * point.
@@ -53,7 +34,6 @@ function range_collapsed(range) {
      */
     return (range._startNode === range._endNode && range._startOffset === range._endOffset);
 }
-exports.range_collapsed = range_collapsed;
 /**
  * Gets the root node of a range.
  *
@@ -63,9 +43,8 @@ function range_root(range) {
     /**
      * The root of a live range is the root of its start node.
      */
-    return TreeAlgorithm_1.tree_rootNode(range._startNode);
+    return (0, TreeAlgorithm_1.tree_rootNode)(range._startNode);
 }
-exports.range_root = range_root;
 /**
  * Determines if a node is fully contained in a range.
  *
@@ -78,11 +57,10 @@ function range_isContained(node, range) {
      * root, and (node, 0) is after range’s start, and (node, node’s length) is
      * before range’s end.
      */
-    return (TreeAlgorithm_1.tree_rootNode(node) === range_root(range) &&
-        BoundaryPointAlgorithm_1.boundaryPoint_position([node, 0], range._start) === interfaces_1.BoundaryPosition.After &&
-        BoundaryPointAlgorithm_1.boundaryPoint_position([node, TreeAlgorithm_1.tree_nodeLength(node)], range._end) === interfaces_1.BoundaryPosition.Before);
+    return ((0, TreeAlgorithm_1.tree_rootNode)(node) === range_root(range) &&
+        (0, BoundaryPointAlgorithm_1.boundaryPoint_position)([node, 0], range._start) === interfaces_1.BoundaryPosition.After &&
+        (0, BoundaryPointAlgorithm_1.boundaryPoint_position)([node, (0, TreeAlgorithm_1.tree_nodeLength)(node)], range._end) === interfaces_1.BoundaryPosition.Before);
 }
-exports.range_isContained = range_isContained;
 /**
  * Determines if a node is partially contained in a range.
  *
@@ -95,11 +73,10 @@ function range_isPartiallyContained(node, range) {
      * ancestor of the live range’s start node but not its end node,
      * or vice versa.
      */
-    var startCheck = TreeAlgorithm_1.tree_isAncestorOf(range._startNode, node, true);
-    var endCheck = TreeAlgorithm_1.tree_isAncestorOf(range._endNode, node, true);
+    const startCheck = (0, TreeAlgorithm_1.tree_isAncestorOf)(range._startNode, node, true);
+    const endCheck = (0, TreeAlgorithm_1.tree_isAncestorOf)(range._endNode, node, true);
     return (startCheck && !endCheck) || (!startCheck && endCheck);
 }
-exports.range_isPartiallyContained = range_isPartiallyContained;
 /**
  * Sets the start boundary point of a range.
  *
@@ -121,17 +98,16 @@ function range_setTheStart(range, node, offset) {
     if (util_1.Guard.isDocumentTypeNode(node)) {
         throw new DOMException_1.InvalidNodeTypeError();
     }
-    if (offset > TreeAlgorithm_1.tree_nodeLength(node)) {
+    if (offset > (0, TreeAlgorithm_1.tree_nodeLength)(node)) {
         throw new DOMException_1.IndexSizeError();
     }
-    var bp = [node, offset];
-    if (range_root(range) !== TreeAlgorithm_1.tree_rootNode(node) ||
-        BoundaryPointAlgorithm_1.boundaryPoint_position(bp, range._end) === interfaces_1.BoundaryPosition.After) {
+    const bp = [node, offset];
+    if (range_root(range) !== (0, TreeAlgorithm_1.tree_rootNode)(node) ||
+        (0, BoundaryPointAlgorithm_1.boundaryPoint_position)(bp, range._end) === interfaces_1.BoundaryPosition.After) {
         range._end = bp;
     }
     range._start = bp;
 }
-exports.range_setTheStart = range_setTheStart;
 /**
  * Sets the end boundary point of a range.
  *
@@ -153,17 +129,16 @@ function range_setTheEnd(range, node, offset) {
     if (util_1.Guard.isDocumentTypeNode(node)) {
         throw new DOMException_1.InvalidNodeTypeError();
     }
-    if (offset > TreeAlgorithm_1.tree_nodeLength(node)) {
+    if (offset > (0, TreeAlgorithm_1.tree_nodeLength)(node)) {
         throw new DOMException_1.IndexSizeError();
     }
-    var bp = [node, offset];
-    if (range_root(range) !== TreeAlgorithm_1.tree_rootNode(node) ||
-        BoundaryPointAlgorithm_1.boundaryPoint_position(bp, range._start) === interfaces_1.BoundaryPosition.Before) {
+    const bp = [node, offset];
+    if (range_root(range) !== (0, TreeAlgorithm_1.tree_rootNode)(node) ||
+        (0, BoundaryPointAlgorithm_1.boundaryPoint_position)(bp, range._start) === interfaces_1.BoundaryPosition.Before) {
         range._start = bp;
     }
     range._end = bp;
 }
-exports.range_setTheEnd = range_setTheEnd;
 /**
  * Selects a node.
  *
@@ -175,7 +150,7 @@ function range_select(node, range) {
      * 1. Let parent be node’s parent.
      * 2. If parent is null, then throw an "InvalidNodeTypeError" DOMException.
      */
-    var parent = node._parent;
+    const parent = node._parent;
     if (parent === null)
         throw new DOMException_1.InvalidNodeTypeError();
     /**
@@ -183,24 +158,22 @@ function range_select(node, range) {
      * 4. Set range’s start to boundary point (parent, index).
      * 5. Set range’s end to boundary point (parent, index plus 1).
      */
-    var index = TreeAlgorithm_1.tree_index(node);
+    const index = (0, TreeAlgorithm_1.tree_index)(node);
     range._start = [parent, index];
     range._end = [parent, index + 1];
 }
-exports.range_select = range_select;
 /**
  * EXtracts the contents of range as a document fragment.
  *
  * @param range - a range
  */
 function range_extract(range) {
-    var e_1, _a, e_2, _b, e_3, _c;
     /**
      * 1. Let fragment be a new DocumentFragment node whose node document is
      * range’s start node’s node document.
      * 2. If range is collapsed, then return fragment.
      */
-    var fragment = CreateAlgorithm_1.create_documentFragment(range._startNode._nodeDocument);
+    const fragment = (0, CreateAlgorithm_1.create_documentFragment)(range._startNode._nodeDocument);
     if (range_collapsed(range))
         return fragment;
     /**
@@ -208,10 +181,10 @@ function range_extract(range) {
      * and original end offset be range’s start node, start offset, end node,
      * and end offset, respectively.
      */
-    var originalStartNode = range._startNode;
-    var originalStartOffset = range._startOffset;
-    var originalEndNode = range._endNode;
-    var originalEndOffset = range._endOffset;
+    const originalStartNode = range._startNode;
+    const originalStartOffset = range._startOffset;
+    const originalEndNode = range._endNode;
+    const originalEndOffset = range._endOffset;
     /**
      * 4. If original start node is original end node, and they are a Text,
      * ProcessingInstruction, or Comment node:
@@ -227,10 +200,10 @@ function range_extract(range) {
      */
     if (originalStartNode === originalEndNode &&
         util_1.Guard.isCharacterDataNode(originalStartNode)) {
-        var clone = NodeAlgorithm_1.node_clone(originalStartNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        CharacterDataAlgorithm_1.characterData_replaceData(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset, '');
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalStartNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        (0, CharacterDataAlgorithm_1.characterData_replaceData)(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset, '');
         return fragment;
     }
     /**
@@ -238,8 +211,8 @@ function range_extract(range) {
      * 6. While common ancestor is not an inclusive ancestor of original end
      * node, set common ancestor to its own parent.
      */
-    var commonAncestor = originalStartNode;
-    while (!TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, commonAncestor, true)) {
+    let commonAncestor = originalStartNode;
+    while (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, commonAncestor, true)) {
         if (commonAncestor._parent === null) {
             throw new Error("Parent node  is null.");
         }
@@ -251,23 +224,13 @@ function range_extract(range) {
      * node, set first partially contained child to the first child of common
      * ancestor that is partially contained in range.
      */
-    var firstPartiallyContainedChild = null;
-    if (!TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, originalStartNode, true)) {
-        try {
-            for (var _d = __values(commonAncestor._children), _e = _d.next(); !_e.done; _e = _d.next()) {
-                var node = _e.value;
-                if (range_isPartiallyContained(node, range)) {
-                    firstPartiallyContainedChild = node;
-                    break;
-                }
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_e && !_e.done && (_a = _d.return)) _a.call(_d);
+    let firstPartiallyContainedChild = null;
+    if (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, originalStartNode, true)) {
+        for (const node of commonAncestor._children) {
+            if (range_isPartiallyContained(node, range)) {
+                firstPartiallyContainedChild = node;
+                break;
             }
-            finally { if (e_1) throw e_1.error; }
         }
     }
     /**
@@ -276,11 +239,11 @@ function range_extract(range) {
      * node, set last partially contained child to the last child of common
      * ancestor that is partially contained in range.
      */
-    var lastPartiallyContainedChild = null;
-    if (!TreeAlgorithm_1.tree_isAncestorOf(originalStartNode, originalEndNode, true)) {
-        var children = __spread(commonAncestor._children);
-        for (var i = children.length - 1; i > 0; i--) {
-            var node = children[i];
+    let lastPartiallyContainedChild = null;
+    if (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalStartNode, originalEndNode, true)) {
+        const children = [...commonAncestor._children];
+        for (let i = children.length - 1; i > 0; i--) {
+            const node = children[i];
             if (range_isPartiallyContained(node, range)) {
                 lastPartiallyContainedChild = node;
                 break;
@@ -293,28 +256,18 @@ function range_extract(range) {
      * 12. If any member of contained children is a doctype, then throw a
      * "HierarchyRequestError" DOMException.
      */
-    var containedChildren = [];
-    try {
-        for (var _f = __values(commonAncestor._children), _g = _f.next(); !_g.done; _g = _f.next()) {
-            var child = _g.value;
-            if (range_isContained(child, range)) {
-                if (util_1.Guard.isDocumentTypeNode(child)) {
-                    throw new DOMException_1.HierarchyRequestError();
-                }
-                containedChildren.push(child);
+    const containedChildren = [];
+    for (const child of commonAncestor._children) {
+        if (range_isContained(child, range)) {
+            if (util_1.Guard.isDocumentTypeNode(child)) {
+                throw new DOMException_1.HierarchyRequestError();
             }
+            containedChildren.push(child);
         }
     }
-    catch (e_2_1) { e_2 = { error: e_2_1 }; }
-    finally {
-        try {
-            if (_g && !_g.done && (_b = _f.return)) _b.call(_f);
-        }
-        finally { if (e_2) throw e_2.error; }
-    }
-    var newNode;
-    var newOffset;
-    if (TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, originalStartNode, true)) {
+    let newNode;
+    let newOffset;
+    if ((0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, originalStartNode, true)) {
         /**
          * 13. If original start node is an inclusive ancestor of original end node,
          * set new node to original start node and new offset to original start
@@ -332,9 +285,9 @@ function range_extract(range) {
          * 14.3. Set new node to the parent of reference node, and new offset to
          * one plus reference node’s index.
          */
-        var referenceNode = originalStartNode;
+        let referenceNode = originalStartNode;
         while (referenceNode._parent !== null &&
-            !TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, referenceNode._parent)) {
+            !(0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, referenceNode._parent)) {
             referenceNode = referenceNode._parent;
         }
         /* istanbul ignore next */
@@ -347,7 +300,7 @@ function range_extract(range) {
             throw new Error("Parent node is null.");
         }
         newNode = referenceNode._parent;
-        newOffset = 1 + TreeAlgorithm_1.tree_index(referenceNode);
+        newOffset = 1 + (0, TreeAlgorithm_1.tree_index)(referenceNode);
     }
     if (util_1.Guard.isCharacterDataNode(firstPartiallyContainedChild)) {
         /**
@@ -362,10 +315,10 @@ function range_extract(range) {
          * start offset, count original start node’s length minus original start
          * offset, and data the empty string.
          */
-        var clone = NodeAlgorithm_1.node_clone(originalStartNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalStartNode, originalStartOffset, TreeAlgorithm_1.tree_nodeLength(originalStartNode) - originalStartOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        CharacterDataAlgorithm_1.characterData_replaceData(originalStartNode, originalStartOffset, TreeAlgorithm_1.tree_nodeLength(originalStartNode) - originalStartOffset, '');
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalStartNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalStartNode, originalStartOffset, (0, TreeAlgorithm_1.tree_nodeLength)(originalStartNode) - originalStartOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        (0, CharacterDataAlgorithm_1.characterData_replaceData)(originalStartNode, originalStartOffset, (0, TreeAlgorithm_1.tree_nodeLength)(originalStartNode) - originalStartOffset, '');
     }
     else if (firstPartiallyContainedChild !== null) {
         /**
@@ -378,28 +331,18 @@ function range_extract(range) {
          * 16.4. Let subfragment be the result of extracting subrange.
          * 16.5. Append subfragment to clone.
          */
-        var clone = NodeAlgorithm_1.node_clone(firstPartiallyContainedChild);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        var subrange = CreateAlgorithm_1.create_range([originalStartNode, originalStartOffset], [firstPartiallyContainedChild, TreeAlgorithm_1.tree_nodeLength(firstPartiallyContainedChild)]);
-        var subfragment = range_extract(subrange);
-        MutationAlgorithm_1.mutation_append(subfragment, clone);
+        const clone = (0, NodeAlgorithm_1.node_clone)(firstPartiallyContainedChild);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        const subrange = (0, CreateAlgorithm_1.create_range)([originalStartNode, originalStartOffset], [firstPartiallyContainedChild, (0, TreeAlgorithm_1.tree_nodeLength)(firstPartiallyContainedChild)]);
+        const subfragment = range_extract(subrange);
+        (0, MutationAlgorithm_1.mutation_append)(subfragment, clone);
     }
-    try {
-        /**
-         * 17. For each contained child in contained children, append contained
-         * child to fragment.
-         */
-        for (var containedChildren_1 = __values(containedChildren), containedChildren_1_1 = containedChildren_1.next(); !containedChildren_1_1.done; containedChildren_1_1 = containedChildren_1.next()) {
-            var child = containedChildren_1_1.value;
-            MutationAlgorithm_1.mutation_append(child, fragment);
-        }
-    }
-    catch (e_3_1) { e_3 = { error: e_3_1 }; }
-    finally {
-        try {
-            if (containedChildren_1_1 && !containedChildren_1_1.done && (_c = containedChildren_1.return)) _c.call(containedChildren_1);
-        }
-        finally { if (e_3) throw e_3.error; }
+    /**
+     * 17. For each contained child in contained children, append contained
+     * child to fragment.
+     */
+    for (const child of containedChildren) {
+        (0, MutationAlgorithm_1.mutation_append)(child, fragment);
     }
     if (util_1.Guard.isCharacterDataNode(lastPartiallyContainedChild)) {
         /**
@@ -412,10 +355,10 @@ function range_extract(range) {
          * 18.4. Replace data with node original end node, offset 0, count
          * original end offset, and data the empty string.
          */
-        var clone = NodeAlgorithm_1.node_clone(originalEndNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalEndNode, 0, originalEndOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        CharacterDataAlgorithm_1.characterData_replaceData(originalEndNode, 0, originalEndOffset, '');
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalEndNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalEndNode, 0, originalEndOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        (0, CharacterDataAlgorithm_1.characterData_replaceData)(originalEndNode, 0, originalEndOffset, '');
     }
     else if (lastPartiallyContainedChild !== null) {
         /**
@@ -428,11 +371,11 @@ function range_extract(range) {
          * 19.4. Let subfragment be the result of extracting subrange.
          * 19.5. Append subfragment to clone.
          */
-        var clone = NodeAlgorithm_1.node_clone(lastPartiallyContainedChild);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        var subrange = CreateAlgorithm_1.create_range([lastPartiallyContainedChild, 0], [originalEndNode, originalEndOffset]);
-        var subfragment = range_extract(subrange);
-        MutationAlgorithm_1.mutation_append(subfragment, clone);
+        const clone = (0, NodeAlgorithm_1.node_clone)(lastPartiallyContainedChild);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        const subrange = (0, CreateAlgorithm_1.create_range)([lastPartiallyContainedChild, 0], [originalEndNode, originalEndOffset]);
+        const subfragment = range_extract(subrange);
+        (0, MutationAlgorithm_1.mutation_append)(subfragment, clone);
     }
     /**
      * 20. Set range’s start and end to (new node, new offset).
@@ -444,20 +387,18 @@ function range_extract(range) {
      */
     return fragment;
 }
-exports.range_extract = range_extract;
 /**
  * Clones the contents of range as a document fragment.
  *
  * @param range - a range
  */
 function range_cloneTheContents(range) {
-    var e_4, _a, e_5, _b, e_6, _c;
     /**
      * 1. Let fragment be a new DocumentFragment node whose node document
      * is range’s start node’s node document.
      * 2. If range is collapsed, then return fragment.
      */
-    var fragment = CreateAlgorithm_1.create_documentFragment(range._startNode._nodeDocument);
+    const fragment = (0, CreateAlgorithm_1.create_documentFragment)(range._startNode._nodeDocument);
     if (range_collapsed(range))
         return fragment;
     /**
@@ -473,23 +414,23 @@ function range_cloneTheContents(range) {
      * 4.3. Append clone to fragment.
      * 4.5. Return fragment.
      */
-    var originalStartNode = range._startNode;
-    var originalStartOffset = range._startOffset;
-    var originalEndNode = range._endNode;
-    var originalEndOffset = range._endOffset;
+    const originalStartNode = range._startNode;
+    const originalStartOffset = range._startOffset;
+    const originalEndNode = range._endNode;
+    const originalEndOffset = range._endOffset;
     if (originalStartNode === originalEndNode &&
         util_1.Guard.isCharacterDataNode(originalStartNode)) {
-        var clone = NodeAlgorithm_1.node_clone(originalStartNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalStartNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
     }
     /**
      * 5. Let common ancestor be original start node.
      * 6. While common ancestor is not an inclusive ancestor of original end
      * node, set common ancestor to its own parent.
      */
-    var commonAncestor = originalStartNode;
-    while (!TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, commonAncestor, true)) {
+    let commonAncestor = originalStartNode;
+    while (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, commonAncestor, true)) {
         if (commonAncestor._parent === null) {
             throw new Error("Parent node  is null.");
         }
@@ -501,23 +442,13 @@ function range_cloneTheContents(range) {
      * node, set first partially contained child to the first child of common
      * ancestor that is partially contained in range.
      */
-    var firstPartiallyContainedChild = null;
-    if (!TreeAlgorithm_1.tree_isAncestorOf(originalEndNode, originalStartNode, true)) {
-        try {
-            for (var _d = __values(commonAncestor._children), _e = _d.next(); !_e.done; _e = _d.next()) {
-                var node = _e.value;
-                if (range_isPartiallyContained(node, range)) {
-                    firstPartiallyContainedChild = node;
-                    break;
-                }
-            }
-        }
-        catch (e_4_1) { e_4 = { error: e_4_1 }; }
-        finally {
-            try {
-                if (_e && !_e.done && (_a = _d.return)) _a.call(_d);
+    let firstPartiallyContainedChild = null;
+    if (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalEndNode, originalStartNode, true)) {
+        for (const node of commonAncestor._children) {
+            if (range_isPartiallyContained(node, range)) {
+                firstPartiallyContainedChild = node;
+                break;
             }
-            finally { if (e_4) throw e_4.error; }
         }
     }
     /**
@@ -526,11 +457,11 @@ function range_cloneTheContents(range) {
      * node, set last partially contained child to the last child of common
      * ancestor that is partially contained in range.
      */
-    var lastPartiallyContainedChild = null;
-    if (!TreeAlgorithm_1.tree_isAncestorOf(originalStartNode, originalEndNode, true)) {
-        var children = __spread(commonAncestor._children);
-        for (var i = children.length - 1; i > 0; i--) {
-            var node = children[i];
+    let lastPartiallyContainedChild = null;
+    if (!(0, TreeAlgorithm_1.tree_isAncestorOf)(originalStartNode, originalEndNode, true)) {
+        const children = [...commonAncestor._children];
+        for (let i = children.length - 1; i > 0; i--) {
+            const node = children[i];
             if (range_isPartiallyContained(node, range)) {
                 lastPartiallyContainedChild = node;
                 break;
@@ -543,25 +474,15 @@ function range_cloneTheContents(range) {
      * 12. If any member of contained children is a doctype, then throw a
      * "HierarchyRequestError" DOMException.
      */
-    var containedChildren = [];
-    try {
-        for (var _f = __values(commonAncestor._children), _g = _f.next(); !_g.done; _g = _f.next()) {
-            var child = _g.value;
-            if (range_isContained(child, range)) {
-                if (util_1.Guard.isDocumentTypeNode(child)) {
-                    throw new DOMException_1.HierarchyRequestError();
-                }
-                containedChildren.push(child);
+    const containedChildren = [];
+    for (const child of commonAncestor._children) {
+        if (range_isContained(child, range)) {
+            if (util_1.Guard.isDocumentTypeNode(child)) {
+                throw new DOMException_1.HierarchyRequestError();
             }
+            containedChildren.push(child);
         }
     }
-    catch (e_5_1) { e_5 = { error: e_5_1 }; }
-    finally {
-        try {
-            if (_g && !_g.done && (_b = _f.return)) _b.call(_f);
-        }
-        finally { if (e_5) throw e_5.error; }
-    }
     if (util_1.Guard.isCharacterDataNode(firstPartiallyContainedChild)) {
         /**
          * 13. If first partially contained child is a Text, ProcessingInstruction,
@@ -572,9 +493,9 @@ function range_cloneTheContents(range) {
          * original start node’s length minus original start offset.
          * 13.3. Append clone to fragment.
          */
-        var clone = NodeAlgorithm_1.node_clone(originalStartNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalStartNode, originalStartOffset, TreeAlgorithm_1.tree_nodeLength(originalStartNode) - originalStartOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalStartNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalStartNode, originalStartOffset, (0, TreeAlgorithm_1.tree_nodeLength)(originalStartNode) - originalStartOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
     }
     else if (firstPartiallyContainedChild !== null) {
         /**
@@ -588,32 +509,22 @@ function range_cloneTheContents(range) {
          * subrange.
          * 14.5. Append subfragment to clone.
          */
-        var clone = NodeAlgorithm_1.node_clone(firstPartiallyContainedChild);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
-        var subrange = CreateAlgorithm_1.create_range([originalStartNode, originalStartOffset], [firstPartiallyContainedChild, TreeAlgorithm_1.tree_nodeLength(firstPartiallyContainedChild)]);
-        var subfragment = range_cloneTheContents(subrange);
-        MutationAlgorithm_1.mutation_append(subfragment, clone);
-    }
-    try {
-        /**
-         * 15. For each contained child in contained children, append contained
-         * child to fragment.
-         * 15.1. Let clone be a clone of contained child with the clone children
-         * flag set.
-         * 15.2. Append clone to fragment.
-         */
-        for (var containedChildren_2 = __values(containedChildren), containedChildren_2_1 = containedChildren_2.next(); !containedChildren_2_1.done; containedChildren_2_1 = containedChildren_2.next()) {
-            var child = containedChildren_2_1.value;
-            var clone = NodeAlgorithm_1.node_clone(child);
-            MutationAlgorithm_1.mutation_append(clone, fragment);
-        }
+        const clone = (0, NodeAlgorithm_1.node_clone)(firstPartiallyContainedChild);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
+        const subrange = (0, CreateAlgorithm_1.create_range)([originalStartNode, originalStartOffset], [firstPartiallyContainedChild, (0, TreeAlgorithm_1.tree_nodeLength)(firstPartiallyContainedChild)]);
+        const subfragment = range_cloneTheContents(subrange);
+        (0, MutationAlgorithm_1.mutation_append)(subfragment, clone);
     }
-    catch (e_6_1) { e_6 = { error: e_6_1 }; }
-    finally {
-        try {
-            if (containedChildren_2_1 && !containedChildren_2_1.done && (_c = containedChildren_2.return)) _c.call(containedChildren_2);
-        }
-        finally { if (e_6) throw e_6.error; }
+    /**
+     * 15. For each contained child in contained children, append contained
+     * child to fragment.
+     * 15.1. Let clone be a clone of contained child with the clone children
+     * flag set.
+     * 15.2. Append clone to fragment.
+     */
+    for (const child of containedChildren) {
+        const clone = (0, NodeAlgorithm_1.node_clone)(child);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
     }
     if (util_1.Guard.isCharacterDataNode(lastPartiallyContainedChild)) {
         /**
@@ -624,9 +535,9 @@ function range_cloneTheContents(range) {
          * node original end node, offset 0, and count original end offset.
          * 16.3. Append clone to fragment.
          */
-        var clone = NodeAlgorithm_1.node_clone(originalEndNode);
-        clone._data = CharacterDataAlgorithm_1.characterData_substringData(originalEndNode, 0, originalEndOffset);
-        MutationAlgorithm_1.mutation_append(clone, fragment);
+        const clone = (0, NodeAlgorithm_1.node_clone)(originalEndNode);
+        clone._data = (0, CharacterDataAlgorithm_1.characterData_substringData)(originalEndNode, 0, originalEndOffset);
+        (0, MutationAlgorithm_1.mutation_append)(clone, fragment);
     }
     else if (lastPartiallyContainedChild !== null) {
         /**
@@ -639,18 +550,17 @@ function range_cloneTheContents(range) {
          * 17.4. Let subfragment be the result of cloning the contents of subrange.
          * 17.5. Append subfragment to clone.
          */
-        var clone = NodeAlgorithm_1.node_clone(lastPartiallyContainedChild);
+        const clone = (0, NodeAlgorithm_1.node_clone)(lastPartiallyContainedChild);
         fragment.append(clone);
-        var subrange = CreateAlgorithm_1.create_range([lastPartiallyContainedChild, 0], [originalEndNode, originalEndOffset]);
-        var subfragment = range_extract(subrange);
-        MutationAlgorithm_1.mutation_append(subfragment, clone);
+        const subrange = (0, CreateAlgorithm_1.create_range)([lastPartiallyContainedChild, 0], [originalEndNode, originalEndOffset]);
+        const subfragment = range_extract(subrange);
+        (0, MutationAlgorithm_1.mutation_append)(subfragment, clone);
     }
     /**
      * 18. Return fragment.
      */
     return fragment;
 }
-exports.range_cloneTheContents = range_cloneTheContents;
 /**
  * Inserts a node into a range at the start boundary point.
  *
@@ -658,7 +568,6 @@ exports.range_cloneTheContents = range_cloneTheContents;
  * @param range - a range
  */
 function range_insert(node, range) {
-    var e_7, _a;
     /**
      * 1. If range’s start node is a ProcessingInstruction or Comment node, is a
      * Text node whose parent is null, or is node, then throw a
@@ -677,35 +586,25 @@ function range_insert(node, range) {
      * 4. Otherwise, set referenceNode to the child of start node whose index is
      * start offset, and null if there is no such child.
      */
-    var referenceNode = null;
+    let referenceNode = null;
     if (util_1.Guard.isTextNode(range._startNode)) {
         referenceNode = range._startNode;
     }
     else {
-        var index = 0;
-        try {
-            for (var _b = __values(range._startNode._children), _c = _b.next(); !_c.done; _c = _b.next()) {
-                var child = _c.value;
-                if (index === range._startOffset) {
-                    referenceNode = child;
-                    break;
-                }
-                index++;
-            }
-        }
-        catch (e_7_1) { e_7 = { error: e_7_1 }; }
-        finally {
-            try {
-                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+        let index = 0;
+        for (const child of range._startNode._children) {
+            if (index === range._startOffset) {
+                referenceNode = child;
+                break;
             }
-            finally { if (e_7) throw e_7.error; }
+            index++;
         }
     }
     /**
      * 5. Let parent be range’s start node if referenceNode is null, and
      * referenceNode’s parent otherwise.
      */
-    var parent;
+    let parent;
     if (referenceNode === null) {
         parent = range._startNode;
     }
@@ -718,13 +617,13 @@ function range_insert(node, range) {
     /**
      * 6. Ensure pre-insertion validity of node into parent before referenceNode.
      */
-    MutationAlgorithm_1.mutation_ensurePreInsertionValidity(node, parent, referenceNode);
+    (0, MutationAlgorithm_1.mutation_ensurePreInsertionValidity)(node, parent, referenceNode);
     /**
      * 7. If range’s start node is a Text node, set referenceNode to the result
      * of splitting it with offset range’s start offset.
      */
     if (util_1.Guard.isTextNode(range._startNode)) {
-        referenceNode = TextAlgorithm_1.text_split(range._startNode, range._startOffset);
+        referenceNode = (0, TextAlgorithm_1.text_split)(range._startNode, range._startOffset);
     }
     /**
      * 8. If node is referenceNode, set referenceNode to its next sibling.
@@ -736,20 +635,20 @@ function range_insert(node, range) {
      * 9. If node’s parent is not null, remove node from its parent.
      */
     if (node._parent !== null) {
-        MutationAlgorithm_1.mutation_remove(node, node._parent);
+        (0, MutationAlgorithm_1.mutation_remove)(node, node._parent);
     }
     /**
      * 10. Let newOffset be parent’s length if referenceNode is null, and
      * referenceNode’s index otherwise.
      */
-    var newOffset = (referenceNode === null ?
-        TreeAlgorithm_1.tree_nodeLength(parent) : TreeAlgorithm_1.tree_index(referenceNode));
+    let newOffset = (referenceNode === null ?
+        (0, TreeAlgorithm_1.tree_nodeLength)(parent) : (0, TreeAlgorithm_1.tree_index)(referenceNode));
     /**
      * 11. Increase newOffset by node’s length if node is a DocumentFragment
      * node, and one otherwise.
      */
     if (util_1.Guard.isDocumentFragmentNode(node)) {
-        newOffset += TreeAlgorithm_1.tree_nodeLength(node);
+        newOffset += (0, TreeAlgorithm_1.tree_nodeLength)(node);
     }
     else {
         newOffset++;
@@ -757,7 +656,7 @@ function range_insert(node, range) {
     /**
      * 12. Pre-insert node into parent before referenceNode.
      */
-    MutationAlgorithm_1.mutation_preInsert(node, parent, referenceNode);
+    (0, MutationAlgorithm_1.mutation_preInsert)(node, parent, referenceNode);
     /**
      * 13. If range is collapsed, then set range’s end to (parent, newOffset).
      */
@@ -765,65 +664,60 @@ function range_insert(node, range) {
         range._end = [parent, newOffset];
     }
 }
-exports.range_insert = range_insert;
 /**
  * Traverses through all contained nodes of a range.
  *
  * @param range - a range
  */
 function range_getContainedNodes(range) {
-    var _a;
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var container = range.commonAncestorContainer;
-            var currentNode = TreeAlgorithm_1.tree_getFirstDescendantNode(container);
+    return {
+        [Symbol.iterator]: () => {
+            const container = range.commonAncestorContainer;
+            let currentNode = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(container);
             return {
-                next: function () {
+                next: () => {
                     while (currentNode && !range_isContained(currentNode, range)) {
-                        currentNode = TreeAlgorithm_1.tree_getNextDescendantNode(container, currentNode);
+                        currentNode = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(container, currentNode);
                     }
                     if (currentNode === null) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
-                        currentNode = TreeAlgorithm_1.tree_getNextDescendantNode(container, currentNode);
+                        const result = { done: false, value: currentNode };
+                        currentNode = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(container, currentNode);
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.range_getContainedNodes = range_getContainedNodes;
 /**
  * Traverses through all partially contained nodes of a range.
  *
  * @param range - a range
  */
 function range_getPartiallyContainedNodes(range) {
-    var _a;
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var container = range.commonAncestorContainer;
-            var currentNode = TreeAlgorithm_1.tree_getFirstDescendantNode(container);
+    return {
+        [Symbol.iterator]: () => {
+            const container = range.commonAncestorContainer;
+            let currentNode = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(container);
             return {
-                next: function () {
+                next: () => {
                     while (currentNode && !range_isPartiallyContained(currentNode, range)) {
-                        currentNode = TreeAlgorithm_1.tree_getNextDescendantNode(container, currentNode);
+                        currentNode = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(container, currentNode);
                     }
                     if (currentNode === null) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
-                        currentNode = TreeAlgorithm_1.tree_getNextDescendantNode(container, currentNode);
+                        const result = { done: false, value: currentNode };
+                        currentNode = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(container, currentNode);
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.range_getPartiallyContainedNodes = range_getPartiallyContainedNodes;
 //# sourceMappingURL=RangeAlgorithm.js.map