projen 0.98.31 → 0.98.33

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

@@ -1,18 +1,37 @@
 "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.");
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-var util_1 = require("../util");
-var interfaces_1 = require("../dom/interfaces");
+exports.tree_getFirstDescendantNode = tree_getFirstDescendantNode;
+exports.tree_getNextDescendantNode = tree_getNextDescendantNode;
+exports.tree_getDescendantNodes = tree_getDescendantNodes;
+exports.tree_getDescendantElements = tree_getDescendantElements;
+exports.tree_getSiblingNodes = tree_getSiblingNodes;
+exports.tree_getFirstAncestorNode = tree_getFirstAncestorNode;
+exports.tree_getNextAncestorNode = tree_getNextAncestorNode;
+exports.tree_getAncestorNodes = tree_getAncestorNodes;
+exports.tree_getCommonAncestor = tree_getCommonAncestor;
+exports.tree_getFollowingNode = tree_getFollowingNode;
+exports.tree_getPrecedingNode = tree_getPrecedingNode;
+exports.tree_isConstrained = tree_isConstrained;
+exports.tree_nodeLength = tree_nodeLength;
+exports.tree_isEmpty = tree_isEmpty;
+exports.tree_rootNode = tree_rootNode;
+exports.tree_isDescendantOf = tree_isDescendantOf;
+exports.tree_isAncestorOf = tree_isAncestorOf;
+exports.tree_isHostIncludingAncestorOf = tree_isHostIncludingAncestorOf;
+exports.tree_isSiblingOf = tree_isSiblingOf;
+exports.tree_isPreceding = tree_isPreceding;
+exports.tree_isFollowing = tree_isFollowing;
+exports.tree_isParentOf = tree_isParentOf;
+exports.tree_isChildOf = tree_isChildOf;
+exports.tree_previousSibling = tree_previousSibling;
+exports.tree_nextSibling = tree_nextSibling;
+exports.tree_firstChild = tree_firstChild;
+exports.tree_lastChild = tree_lastChild;
+exports.tree_treePosition = tree_treePosition;
+exports.tree_index = tree_index;
+exports.tree_retarget = tree_retarget;
+const util_1 = require("../util");
+const interfaces_1 = require("../dom/interfaces");
 /**
  * Gets the next descendant of the given node of the tree rooted at `root`
  * in depth-first pre-order.
@@ -21,8 +40,7 @@ var interfaces_1 = require("../dom/interfaces");
  * @param node - a node
  * @param shadow - whether to visit shadow tree nodes
  */
-function _getNextDescendantNode(root, node, shadow) {
-    if (shadow === void 0) { shadow = false; }
+function _getNextDescendantNode(root, node, shadow = false) {
     // traverse shadow tree
     if (shadow && util_1.Guard.isElementNode(node) && util_1.Guard.isShadowRoot(node.shadowRoot)) {
         if (node.shadowRoot._firstChild)
@@ -37,7 +55,7 @@ function _getNextDescendantNode(root, node, shadow) {
     if (node._nextSibling)
         return node._nextSibling;
     // traverse parent's next sibling
-    var parent = node._parent;
+    let parent = node._parent;
     while (parent && parent !== root) {
         if (parent._nextSibling)
             return parent._nextSibling;
@@ -46,16 +64,15 @@ function _getNextDescendantNode(root, node, shadow) {
     return null;
 }
 function _emptyIterator() {
-    var _a;
-    return _a = {},
-        _a[Symbol.iterator] = function () {
+    return {
+        [Symbol.iterator]: () => {
             return {
-                next: function () {
+                next: () => {
                     return { done: true, value: null };
                 }
             };
-        },
-        _a;
+        }
+    };
 }
 /**
  * Returns the first descendant node of the tree rooted at `node` in
@@ -66,16 +83,13 @@ function _emptyIterator() {
  * @param shadow - whether to visit shadow tree nodes
  * @param filter - a function to filter nodes
  */
-function tree_getFirstDescendantNode(node, self, shadow, filter) {
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
-    var firstNode = (self ? node : _getNextDescendantNode(node, node, shadow));
+function tree_getFirstDescendantNode(node, self = false, shadow = false, filter) {
+    let firstNode = (self ? node : _getNextDescendantNode(node, node, shadow));
     while (firstNode && filter && !filter(firstNode)) {
         firstNode = _getNextDescendantNode(node, firstNode, shadow);
     }
     return firstNode;
 }
-exports.tree_getFirstDescendantNode = tree_getFirstDescendantNode;
 /**
  * Returns the next descendant node of the tree rooted at `node` in
  * depth-first pre-order.
@@ -86,16 +100,13 @@ exports.tree_getFirstDescendantNode = tree_getFirstDescendantNode;
  * @param shadow - whether to visit shadow tree nodes
  * @param filter - a function to filter nodes
  */
-function tree_getNextDescendantNode(node, currentNode, self, shadow, filter) {
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
-    var nextNode = _getNextDescendantNode(node, currentNode, shadow);
+function tree_getNextDescendantNode(node, currentNode, self = false, shadow = false, filter) {
+    let nextNode = _getNextDescendantNode(node, currentNode, shadow);
     while (nextNode && filter && !filter(nextNode)) {
         nextNode = _getNextDescendantNode(node, nextNode, shadow);
     }
     return nextNode;
 }
-exports.tree_getNextDescendantNode = tree_getNextDescendantNode;
 /**
  * Traverses through all descendant nodes of the tree rooted at
  * `node` in depth-first pre-order.
@@ -105,18 +116,15 @@ exports.tree_getNextDescendantNode = tree_getNextDescendantNode;
  * @param shadow - whether to visit shadow tree nodes
  * @param filter - a function to filter nodes
  */
-function tree_getDescendantNodes(node, self, shadow, filter) {
-    var _a;
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
+function tree_getDescendantNodes(node, self = false, shadow = false, filter) {
     if (!self && node._children.size === 0) {
         return _emptyIterator();
     }
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var currentNode = (self ? node : _getNextDescendantNode(node, node, shadow));
+    return {
+        [Symbol.iterator]: () => {
+            let currentNode = (self ? node : _getNextDescendantNode(node, node, shadow));
             return {
-                next: function () {
+                next: () => {
                     while (currentNode && filter && !filter(currentNode)) {
                         currentNode = _getNextDescendantNode(node, currentNode, shadow);
                     }
@@ -124,16 +132,15 @@ function tree_getDescendantNodes(node, self, shadow, filter) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         currentNode = _getNextDescendantNode(node, currentNode, shadow);
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.tree_getDescendantNodes = tree_getDescendantNodes;
 /**
  * Traverses through all descendant element nodes of the tree rooted at
  * `node` in depth-first preorder.
@@ -143,19 +150,16 @@ exports.tree_getDescendantNodes = tree_getDescendantNodes;
  * @param shadow - whether to visit shadow tree nodes
  * @param filter - a function to filter nodes
  */
-function tree_getDescendantElements(node, self, shadow, filter) {
-    var _a;
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
+function tree_getDescendantElements(node, self = false, shadow = false, filter) {
     if (!self && node._children.size === 0) {
         return _emptyIterator();
     }
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var it = tree_getDescendantNodes(node, self, shadow, function (e) { return util_1.Guard.isElementNode(e); })[Symbol.iterator]();
-            var currentNode = it.next().value;
+    return {
+        [Symbol.iterator]: () => {
+            const it = tree_getDescendantNodes(node, self, shadow, (e) => util_1.Guard.isElementNode(e))[Symbol.iterator]();
+            let currentNode = it.next().value;
             return {
-                next: function () {
+                next() {
                     while (currentNode && filter && !filter(currentNode)) {
                         currentNode = it.next().value;
                     }
@@ -163,16 +167,15 @@ function tree_getDescendantElements(node, self, shadow, filter) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         currentNode = it.next().value;
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.tree_getDescendantElements = tree_getDescendantElements;
 /**
  * Traverses through all sibling nodes of `node`.
  *
@@ -180,17 +183,15 @@ exports.tree_getDescendantElements = tree_getDescendantElements;
  * @param self - whether to include `node` in traversal
  * @param filter - a function to filter nodes
  */
-function tree_getSiblingNodes(node, self, filter) {
-    var _a;
-    if (self === void 0) { self = false; }
+function tree_getSiblingNodes(node, self = false, filter) {
     if (!node._parent || node._parent._children.size === 0) {
         return _emptyIterator();
     }
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var currentNode = node._parent ? node._parent._firstChild : null;
+    return {
+        [Symbol.iterator]() {
+            let currentNode = node._parent ? node._parent._firstChild : null;
             return {
-                next: function () {
+                next() {
                     while (currentNode && (filter && !filter(currentNode) || (!self && currentNode === node))) {
                         currentNode = currentNode._nextSibling;
                     }
@@ -198,16 +199,15 @@ function tree_getSiblingNodes(node, self, filter) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         currentNode = currentNode._nextSibling;
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.tree_getSiblingNodes = tree_getSiblingNodes;
 /**
  * Gets the first ancestor of `node` in reverse tree order.
  *
@@ -215,15 +215,13 @@ exports.tree_getSiblingNodes = tree_getSiblingNodes;
  * @param self - whether to include `node` in traversal
  * @param filter - a function to filter nodes
  */
-function tree_getFirstAncestorNode(node, self, filter) {
-    if (self === void 0) { self = false; }
-    var firstNode = self ? node : node._parent;
+function tree_getFirstAncestorNode(node, self = false, filter) {
+    let firstNode = self ? node : node._parent;
     while (firstNode && filter && !filter(firstNode)) {
         firstNode = firstNode._parent;
     }
     return firstNode;
 }
-exports.tree_getFirstAncestorNode = tree_getFirstAncestorNode;
 /**
  * Gets the first ancestor of `node` in reverse tree order.
  *
@@ -231,15 +229,13 @@ exports.tree_getFirstAncestorNode = tree_getFirstAncestorNode;
  * @param self - whether to include `node` in traversal
  * @param filter - a function to filter nodes
  */
-function tree_getNextAncestorNode(node, currentNode, self, filter) {
-    if (self === void 0) { self = false; }
-    var nextNode = currentNode._parent;
+function tree_getNextAncestorNode(node, currentNode, self = false, filter) {
+    let nextNode = currentNode._parent;
     while (nextNode && filter && !filter(nextNode)) {
         nextNode = nextNode._parent;
     }
     return nextNode;
 }
-exports.tree_getNextAncestorNode = tree_getNextAncestorNode;
 /**
  * Traverses through all ancestor nodes `node` in reverse tree order.
  *
@@ -247,31 +243,28 @@ exports.tree_getNextAncestorNode = tree_getNextAncestorNode;
  * @param self - whether to include `node` in traversal
  * @param filter - a function to filter nodes
  */
-function tree_getAncestorNodes(node, self, filter) {
-    var _a;
-    if (self === void 0) { self = false; }
+function tree_getAncestorNodes(node, self = false, filter) {
     if (!self && !node._parent) {
         return _emptyIterator();
     }
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var currentNode = tree_getFirstAncestorNode(node, self, filter);
+    return {
+        [Symbol.iterator]() {
+            let currentNode = tree_getFirstAncestorNode(node, self, filter);
             return {
-                next: function () {
+                next() {
                     if (currentNode === null) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         currentNode = tree_getNextAncestorNode(node, currentNode, self, filter);
                         return result;
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.tree_getAncestorNodes = tree_getAncestorNodes;
 /**
  * Returns the common ancestor of the given nodes.
  *
@@ -283,25 +276,25 @@ function tree_getCommonAncestor(nodeA, nodeB) {
         return nodeA._parent;
     }
     // lists of parent nodes
-    var parentsA = [];
-    var parentsB = [];
-    var pA = tree_getFirstAncestorNode(nodeA, true);
+    const parentsA = [];
+    const parentsB = [];
+    let pA = tree_getFirstAncestorNode(nodeA, true);
     while (pA !== null) {
         parentsA.push(pA);
         pA = tree_getNextAncestorNode(nodeA, pA, true);
     }
-    var pB = tree_getFirstAncestorNode(nodeB, true);
+    let pB = tree_getFirstAncestorNode(nodeB, true);
     while (pB !== null) {
         parentsB.push(pB);
         pB = tree_getNextAncestorNode(nodeB, pB, true);
     }
     // walk through parents backwards until they differ
-    var pos1 = parentsA.length;
-    var pos2 = parentsB.length;
-    var parent = null;
-    for (var i = Math.min(pos1, pos2); i > 0; i--) {
-        var parent1 = parentsA[--pos1];
-        var parent2 = parentsB[--pos2];
+    let pos1 = parentsA.length;
+    let pos2 = parentsB.length;
+    let parent = null;
+    for (let i = Math.min(pos1, pos2); i > 0; i--) {
+        const parent1 = parentsA[--pos1];
+        const parent2 = parentsB[--pos2];
         if (parent1 !== parent2) {
             break;
         }
@@ -309,7 +302,6 @@ function tree_getCommonAncestor(nodeA, nodeB) {
     }
     return parent;
 }
-exports.tree_getCommonAncestor = tree_getCommonAncestor;
 /**
  * Returns the node following `node` in depth-first preorder.
  *
@@ -325,7 +317,7 @@ function tree_getFollowingNode(root, node) {
     }
     else {
         while (true) {
-            var parent = node._parent;
+            const parent = node._parent;
             if (parent === null || parent === root) {
                 return null;
             }
@@ -338,7 +330,6 @@ function tree_getFollowingNode(root, node) {
         }
     }
 }
-exports.tree_getFollowingNode = tree_getFollowingNode;
 /**
  * Returns the node preceding `node` in depth-first preorder.
  *
@@ -362,7 +353,6 @@ function tree_getPrecedingNode(root, node) {
         return node._parent;
     }
 }
-exports.tree_getPrecedingNode = tree_getPrecedingNode;
 /**
  * Determines if the node tree is constrained. A node tree is
  * constrained as follows, expressed as a relationship between the
@@ -385,64 +375,43 @@ exports.tree_getPrecedingNode = tree_getPrecedingNode;
  * @param node - the root of the tree
  */
 function tree_isConstrained(node) {
-    var e_1, _a, e_2, _b, e_3, _c;
     switch (node._nodeType) {
         case interfaces_1.NodeType.Document:
-            var hasDocType = false;
-            var hasElement = false;
-            try {
-                for (var _d = __values(node._children), _e = _d.next(); !_e.done; _e = _d.next()) {
-                    var childNode = _e.value;
-                    switch (childNode._nodeType) {
-                        case interfaces_1.NodeType.ProcessingInstruction:
-                        case interfaces_1.NodeType.Comment:
-                            break;
-                        case interfaces_1.NodeType.DocumentType:
-                            if (hasDocType || hasElement)
-                                return false;
-                            hasDocType = true;
-                            break;
-                        case interfaces_1.NodeType.Element:
-                            if (hasElement)
-                                return false;
-                            hasElement = true;
-                            break;
-                        default:
+            let hasDocType = false;
+            let hasElement = false;
+            for (const childNode of node._children) {
+                switch (childNode._nodeType) {
+                    case interfaces_1.NodeType.ProcessingInstruction:
+                    case interfaces_1.NodeType.Comment:
+                        break;
+                    case interfaces_1.NodeType.DocumentType:
+                        if (hasDocType || hasElement)
                             return false;
-                    }
-                }
-            }
-            catch (e_1_1) { e_1 = { error: e_1_1 }; }
-            finally {
-                try {
-                    if (_e && !_e.done && (_a = _d.return)) _a.call(_d);
+                        hasDocType = true;
+                        break;
+                    case interfaces_1.NodeType.Element:
+                        if (hasElement)
+                            return false;
+                        hasElement = true;
+                        break;
+                    default:
+                        return false;
                 }
-                finally { if (e_1) throw e_1.error; }
             }
             break;
         case interfaces_1.NodeType.DocumentFragment:
         case interfaces_1.NodeType.Element:
-            try {
-                for (var _f = __values(node._children), _g = _f.next(); !_g.done; _g = _f.next()) {
-                    var childNode = _g.value;
-                    switch (childNode._nodeType) {
-                        case interfaces_1.NodeType.Element:
-                        case interfaces_1.NodeType.Text:
-                        case interfaces_1.NodeType.ProcessingInstruction:
-                        case interfaces_1.NodeType.CData:
-                        case interfaces_1.NodeType.Comment:
-                            break;
-                        default:
-                            return false;
-                    }
-                }
-            }
-            catch (e_2_1) { e_2 = { error: e_2_1 }; }
-            finally {
-                try {
-                    if (_g && !_g.done && (_b = _f.return)) _b.call(_f);
+            for (const childNode of node._children) {
+                switch (childNode._nodeType) {
+                    case interfaces_1.NodeType.Element:
+                    case interfaces_1.NodeType.Text:
+                    case interfaces_1.NodeType.ProcessingInstruction:
+                    case interfaces_1.NodeType.CData:
+                    case interfaces_1.NodeType.Comment:
+                        break;
+                    default:
+                        return false;
                 }
-                finally { if (e_2) throw e_2.error; }
             }
             break;
         case interfaces_1.NodeType.DocumentType:
@@ -452,24 +421,13 @@ function tree_isConstrained(node) {
         case interfaces_1.NodeType.Comment:
             return (!node.hasChildNodes());
     }
-    try {
-        for (var _h = __values(node._children), _j = _h.next(); !_j.done; _j = _h.next()) {
-            var childNode = _j.value;
-            // recursively check child nodes
-            if (!tree_isConstrained(childNode))
-                return false;
-        }
-    }
-    catch (e_3_1) { e_3 = { error: e_3_1 }; }
-    finally {
-        try {
-            if (_j && !_j.done && (_c = _h.return)) _c.call(_h);
-        }
-        finally { if (e_3) throw e_3.error; }
+    for (const childNode of node._children) {
+        // recursively check child nodes
+        if (!tree_isConstrained(childNode))
+            return false;
     }
     return true;
 }
-exports.tree_isConstrained = tree_isConstrained;
 /**
  * Returns the length of a node.
  *
@@ -497,7 +455,6 @@ function tree_nodeLength(node) {
         return node._children.size;
     }
 }
-exports.tree_nodeLength = tree_nodeLength;
 /**
  * Determines if a node is empty.
  *
@@ -509,7 +466,6 @@ function tree_isEmpty(node) {
         */
     return (tree_nodeLength(node) === 0);
 }
-exports.tree_isEmpty = tree_isEmpty;
 /**
  * Returns the root node of a tree. The root of an object is itself,
  * if its parent is `null`, or else it is the root of its parent.
@@ -520,15 +476,14 @@ exports.tree_isEmpty = tree_isEmpty;
  * @param shadow - `true` to return shadow-including root, otherwise
  * `false`
  */
-function tree_rootNode(node, shadow) {
-    if (shadow === void 0) { shadow = false; }
+function tree_rootNode(node, shadow = false) {
     /**
         * The root of an object is itself, if its parent is null, or else it is the
         * root of its parent. The root of a tree is any object participating in
         * that tree whose parent is null.
         */
     if (shadow) {
-        var root = tree_rootNode(node, false);
+        const root = tree_rootNode(node, false);
         if (util_1.Guard.isShadowRoot(root))
             return tree_rootNode(root._host, true);
         else
@@ -541,7 +496,6 @@ function tree_rootNode(node, shadow) {
             return tree_rootNode(node._parent);
     }
 }
-exports.tree_rootNode = tree_rootNode;
 /**
  * Determines whether `other` is a descendant of `node`. An object
  * A is called a descendant of an object B, if either A is a child
@@ -553,16 +507,14 @@ exports.tree_rootNode = tree_rootNode;
  * @param shadow - if `true`, traversal includes the
  * node's and its descendant's shadow trees as well.
  */
-function tree_isDescendantOf(node, other, self, shadow) {
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
+function tree_isDescendantOf(node, other, self = false, shadow = false) {
     /**
         * An object A is called a descendant of an object B, if either A is a
         * child of B or A is a child of an object C that is a descendant of B.
         *
         * An inclusive descendant is an object or one of its descendants.
     */
-    var child = tree_getFirstDescendantNode(node, self, shadow);
+    let child = tree_getFirstDescendantNode(node, self, shadow);
     while (child !== null) {
         if (child === other) {
             return true;
@@ -571,7 +523,6 @@ function tree_isDescendantOf(node, other, self, shadow) {
     }
     return false;
 }
-exports.tree_isDescendantOf = tree_isDescendantOf;
 /**
  * Determines whether `other` is an ancestor of `node`. An object A
  * is called an ancestor of an object B if and only if B is a
@@ -583,10 +534,8 @@ exports.tree_isDescendantOf = tree_isDescendantOf;
  * @param shadow - if `true`, traversal includes the
  * node's and its descendant's shadow trees as well.
  */
-function tree_isAncestorOf(node, other, self, shadow) {
-    if (self === void 0) { self = false; }
-    if (shadow === void 0) { shadow = false; }
-    var ancestor = self ? node : shadow && util_1.Guard.isShadowRoot(node) ?
+function tree_isAncestorOf(node, other, self = false, shadow = false) {
+    let ancestor = self ? node : shadow && util_1.Guard.isShadowRoot(node) ?
         node._host : node._parent;
     while (ancestor !== null) {
         if (ancestor === other)
@@ -596,7 +545,6 @@ function tree_isAncestorOf(node, other, self, shadow) {
     }
     return false;
 }
-exports.tree_isAncestorOf = tree_isAncestorOf;
 /**
  * Determines whether `other` is a host-including ancestor of `node`. An
  * object A is a host-including inclusive ancestor of an object B, if either
@@ -607,17 +555,15 @@ exports.tree_isAncestorOf = tree_isAncestorOf;
  * @param other - the node to check
  * @param self - if `true`, traversal includes `node` itself
  */
-function tree_isHostIncludingAncestorOf(node, other, self) {
-    if (self === void 0) { self = false; }
+function tree_isHostIncludingAncestorOf(node, other, self = false) {
     if (tree_isAncestorOf(node, other, self))
         return true;
-    var root = tree_rootNode(node);
+    const root = tree_rootNode(node);
     if (util_1.Guard.isDocumentFragmentNode(root) && root._host !== null &&
         tree_isHostIncludingAncestorOf(root._host, other, self))
         return true;
     return false;
 }
-exports.tree_isHostIncludingAncestorOf = tree_isHostIncludingAncestorOf;
 /**
  * Determines whether `other` is a sibling of `node`. An object A is
  * called a sibling of an object B, if and only if B and A share
@@ -627,8 +573,7 @@ exports.tree_isHostIncludingAncestorOf = tree_isHostIncludingAncestorOf;
  * @param other - the node to check
  * @param self - if `true`, traversal includes `node` itself
  */
-function tree_isSiblingOf(node, other, self) {
-    if (self === void 0) { self = false; }
+function tree_isSiblingOf(node, other, self = false) {
     /**
         * An object A is called a sibling of an object B, if and only if B and A
         * share the same non-null parent.
@@ -644,7 +589,6 @@ function tree_isSiblingOf(node, other, self) {
     }
     return false;
 }
-exports.tree_isSiblingOf = tree_isSiblingOf;
 /**
  * Determines whether `other` is preceding `node`. An object A is
  * preceding an object B if A and B are in the same tree and A comes
@@ -658,8 +602,8 @@ function tree_isPreceding(node, other) {
         * An object A is preceding an object B if A and B are in the same tree and
         * A comes before B in tree order.
         */
-    var nodePos = tree_treePosition(node);
-    var otherPos = tree_treePosition(other);
+    const nodePos = tree_treePosition(node);
+    const otherPos = tree_treePosition(other);
     if (nodePos === -1 || otherPos === -1)
         return false;
     else if (tree_rootNode(node) !== tree_rootNode(other))
@@ -667,7 +611,6 @@ function tree_isPreceding(node, other) {
     else
         return otherPos < nodePos;
 }
-exports.tree_isPreceding = tree_isPreceding;
 /**
  * Determines whether `other` is following `node`. An object A is
  * following an object B if A and B are in the same tree and A comes
@@ -681,8 +624,8 @@ function tree_isFollowing(node, other) {
         * An object A is following an object B if A and B are in the same tree and
         * A comes after B in tree order.
         */
-    var nodePos = tree_treePosition(node);
-    var otherPos = tree_treePosition(other);
+    const nodePos = tree_treePosition(node);
+    const otherPos = tree_treePosition(other);
     if (nodePos === -1 || otherPos === -1)
         return false;
     else if (tree_rootNode(node) !== tree_rootNode(other))
@@ -690,7 +633,6 @@ function tree_isFollowing(node, other) {
     else
         return otherPos > nodePos;
 }
-exports.tree_isFollowing = tree_isFollowing;
 /**
  * Determines whether `other` is the parent node of `node`.
  *
@@ -705,7 +647,6 @@ function tree_isParentOf(node, other) {
         */
     return (node._parent === other);
 }
-exports.tree_isParentOf = tree_isParentOf;
 /**
  * Determines whether `other` is a child node of `node`.
  *
@@ -720,7 +661,6 @@ function tree_isChildOf(node, other) {
         */
     return (other._parent === node);
 }
-exports.tree_isChildOf = tree_isChildOf;
 /**
  * Returns the previous sibling node of `node` or null if it has no
  * preceding sibling.
@@ -734,7 +674,6 @@ function tree_previousSibling(node) {
         */
     return node._previousSibling;
 }
-exports.tree_previousSibling = tree_previousSibling;
 /**
  * Returns the next sibling node of `node` or null if it has no
  * following sibling.
@@ -748,7 +687,6 @@ function tree_nextSibling(node) {
         */
     return node._nextSibling;
 }
-exports.tree_nextSibling = tree_nextSibling;
 /**
  * Returns the first child node of `node` or null if it has no
  * children.
@@ -762,7 +700,6 @@ function tree_firstChild(node) {
         */
     return node._firstChild;
 }
-exports.tree_firstChild = tree_firstChild;
 /**
  * Returns the last child node of `node` or null if it has no
  * children.
@@ -776,7 +713,6 @@ function tree_lastChild(node) {
         */
     return node._lastChild;
 }
-exports.tree_lastChild = tree_lastChild;
 /**
  * Returns the zero-based index of `node` when counted preorder in
  * the tree rooted at `root`. Returns `-1` if `node` is not in
@@ -785,9 +721,9 @@ exports.tree_lastChild = tree_lastChild;
  * @param node - the node to get the index of
  */
 function tree_treePosition(node) {
-    var root = tree_rootNode(node);
-    var pos = 0;
-    var childNode = tree_getFirstDescendantNode(root);
+    const root = tree_rootNode(node);
+    let pos = 0;
+    let childNode = tree_getFirstDescendantNode(root);
     while (childNode !== null) {
         pos++;
         if (childNode === node)
@@ -796,7 +732,6 @@ function tree_treePosition(node) {
     }
     return -1;
 }
-exports.tree_treePosition = tree_treePosition;
 /**
  * Determines the index of `node`. The index of an object is its number of
  * preceding siblings, or 0 if it has none.
@@ -809,14 +744,13 @@ function tree_index(node) {
         * The index of an object is its number of preceding siblings, or 0 if it
         * has none.
         */
-    var n = 0;
+    let n = 0;
     while (node._previousSibling !== null) {
         n++;
         node = node._previousSibling;
     }
     return n;
 }
-exports.tree_index = tree_index;
 /**
  * Retargets an object against another object.
  *
@@ -839,7 +773,7 @@ function tree_retarget(a, b) {
         if (!a || !util_1.Guard.isNode(a)) {
             return a;
         }
-        var rootOfA = tree_rootNode(a);
+        const rootOfA = tree_rootNode(a);
         if (!util_1.Guard.isShadowRoot(rootOfA)) {
             return a;
         }
@@ -849,5 +783,4 @@ function tree_retarget(a, b) {
         a = rootOfA.host;
     }
 }
-exports.tree_retarget = tree_retarget;
 //# sourceMappingURL=TreeAlgorithm.js.map