projen 0.98.32 → 0.98.34

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

@@ -1,46 +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 DOMImpl_1 = require("../dom/DOMImpl");
-var util_1 = require("../util");
-var DOMException_1 = require("../dom/DOMException");
-var CreateAlgorithm_1 = require("./CreateAlgorithm");
-var TreeAlgorithm_1 = require("./TreeAlgorithm");
-var CharacterDataAlgorithm_1 = require("./CharacterDataAlgorithm");
-var MutationAlgorithm_1 = require("./MutationAlgorithm");
+exports.text_contiguousTextNodes = text_contiguousTextNodes;
+exports.text_contiguousExclusiveTextNodes = text_contiguousExclusiveTextNodes;
+exports.text_descendantTextContent = text_descendantTextContent;
+exports.text_split = text_split;
+const DOMImpl_1 = require("../dom/DOMImpl");
+const util_1 = require("../util");
+const DOMException_1 = require("../dom/DOMException");
+const CreateAlgorithm_1 = require("./CreateAlgorithm");
+const TreeAlgorithm_1 = require("./TreeAlgorithm");
+const CharacterDataAlgorithm_1 = require("./CharacterDataAlgorithm");
+const MutationAlgorithm_1 = require("./MutationAlgorithm");
 /**
  * Returns node with its adjacent text and cdata node siblings.
  *
  * @param node - a node
  * @param self - whether to include node itself
  */
-function text_contiguousTextNodes(node, self) {
-    var _a;
-    if (self === void 0) { self = false; }
+function text_contiguousTextNodes(node, self = false) {
     /**
      * The contiguous Text nodes of a node node are node, node’s previous
      * sibling Text node, if any, and its contiguous Text nodes, and node’s next
      * sibling Text node, if any, and its contiguous Text nodes, avoiding any
      * duplicates.
      */
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var currentNode = node;
+    return {
+        [Symbol.iterator]() {
+            let currentNode = node;
             while (currentNode && util_1.Guard.isTextNode(currentNode._previousSibling)) {
                 currentNode = currentNode._previousSibling;
             }
             return {
-                next: function () {
+                next() {
                     if (currentNode && (!self && currentNode === node)) {
                         if (util_1.Guard.isTextNode(currentNode._nextSibling)) {
                             currentNode = currentNode._nextSibling;
@@ -53,7 +44,7 @@ function text_contiguousTextNodes(node, self) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         if (util_1.Guard.isTextNode(currentNode._nextSibling)) {
                             currentNode = currentNode._nextSibling;
                         }
@@ -64,33 +55,30 @@ function text_contiguousTextNodes(node, self) {
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.text_contiguousTextNodes = text_contiguousTextNodes;
 /**
  * Returns node with its adjacent text node siblings.
  *
  * @param node - a node
  * @param self - whether to include node itself
  */
-function text_contiguousExclusiveTextNodes(node, self) {
-    var _a;
-    if (self === void 0) { self = false; }
+function text_contiguousExclusiveTextNodes(node, self = false) {
     /**
      * The contiguous exclusive Text nodes of a node node are node, node’s
      * previous sibling exclusive Text node, if any, and its contiguous
      * exclusive Text nodes, and node’s next sibling exclusive Text node,
      * if any, and its contiguous exclusive Text nodes, avoiding any duplicates.
      */
-    return _a = {},
-        _a[Symbol.iterator] = function () {
-            var currentNode = node;
+    return {
+        [Symbol.iterator]() {
+            let currentNode = node;
             while (currentNode && util_1.Guard.isExclusiveTextNode(currentNode._previousSibling)) {
                 currentNode = currentNode._previousSibling;
             }
             return {
-                next: function () {
+                next() {
                     if (currentNode && (!self && currentNode === node)) {
                         if (util_1.Guard.isExclusiveTextNode(currentNode._nextSibling)) {
                             currentNode = currentNode._nextSibling;
@@ -103,7 +91,7 @@ function text_contiguousExclusiveTextNodes(node, self) {
                         return { done: true, value: null };
                     }
                     else {
-                        var result = { done: false, value: currentNode };
+                        const result = { done: false, value: currentNode };
                         if (util_1.Guard.isExclusiveTextNode(currentNode._nextSibling)) {
                             currentNode = currentNode._nextSibling;
                         }
@@ -114,10 +102,9 @@ function text_contiguousExclusiveTextNodes(node, self) {
                     }
                 }
             };
-        },
-        _a;
+        }
+    };
 }
-exports.text_contiguousExclusiveTextNodes = text_contiguousExclusiveTextNodes;
 /**
  * Returns the concatenation of the data of all the Text node descendants of
  * node, in tree order.
@@ -129,15 +116,14 @@ function text_descendantTextContent(node) {
      * The descendant text content of a node node is the concatenation of the
      * data of all the Text node descendants of node, in tree order.
      */
-    var contents = '';
-    var text = TreeAlgorithm_1.tree_getFirstDescendantNode(node, false, false, function (e) { return util_1.Guard.isTextNode(e); });
+    let contents = '';
+    let text = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(node, false, false, (e) => util_1.Guard.isTextNode(e));
     while (text !== null) {
         contents += text._data;
-        text = TreeAlgorithm_1.tree_getNextDescendantNode(node, text, false, false, function (e) { return util_1.Guard.isTextNode(e); });
+        text = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(node, text, false, false, (e) => util_1.Guard.isTextNode(e));
     }
     return contents;
 }
-exports.text_descendantTextContent = text_descendantTextContent;
 /**
  * Splits data at the given offset and returns the remainder as a text
  * node.
@@ -146,13 +132,12 @@ exports.text_descendantTextContent = text_descendantTextContent;
  * @param offset - the offset at which to split the nodes.
  */
 function text_split(node, offset) {
-    var e_1, _a;
     /**
      * 1. Let length be node’s length.
      * 2. If offset is greater than length, then throw an "IndexSizeError"
      * DOMException.
      */
-    var length = node._data.length;
+    const length = node._data.length;
     if (offset > length) {
         throw new DOMException_1.IndexSizeError();
     }
@@ -165,53 +150,43 @@ function text_split(node, offset) {
      * 6. Let parent be node’s parent.
      * 7. If parent is not null, then:
      */
-    var count = length - offset;
-    var newData = CharacterDataAlgorithm_1.characterData_substringData(node, offset, count);
-    var newNode = CreateAlgorithm_1.create_text(node._nodeDocument, newData);
-    var parent = node._parent;
+    const count = length - offset;
+    const newData = (0, CharacterDataAlgorithm_1.characterData_substringData)(node, offset, count);
+    const newNode = (0, CreateAlgorithm_1.create_text)(node._nodeDocument, newData);
+    const parent = node._parent;
     if (parent !== null) {
         /**
          * 7.1. Insert new node into parent before node’s next sibling.
          */
-        MutationAlgorithm_1.mutation_insert(newNode, parent, node._nextSibling);
-        try {
-            /**
-             * 7.2. For each live range whose start node is node and start offset is
-             * greater than offset, set its start node to new node and decrease its
-             * start offset by offset.
-             * 7.3. For each live range whose end node is node and end offset is greater
-             * than offset, set its end node to new node and decrease its end offset
-             * by offset.
-             * 7.4. For each live range whose start node is parent and start offset is
-             * equal to the index of node plus 1, increase its start offset by 1.
-             * 7.5. For each live range whose end node is parent and end offset is equal
-             * to the index of node plus 1, increase its end offset by 1.
-             */
-            for (var _b = __values(DOMImpl_1.dom.rangeList), _c = _b.next(); !_c.done; _c = _b.next()) {
-                var range = _c.value;
-                if (range._start[0] === node && range._start[1] > offset) {
-                    range._start[0] = newNode;
-                    range._start[1] -= offset;
-                }
-                if (range._end[0] === node && range._end[1] > offset) {
-                    range._end[0] = newNode;
-                    range._end[1] -= offset;
-                }
-                var index = TreeAlgorithm_1.tree_index(node);
-                if (range._start[0] === parent && range._start[1] === index + 1) {
-                    range._start[1]++;
-                }
-                if (range._end[0] === parent && range._end[1] === index + 1) {
-                    range._end[1]++;
-                }
+        (0, MutationAlgorithm_1.mutation_insert)(newNode, parent, node._nextSibling);
+        /**
+         * 7.2. For each live range whose start node is node and start offset is
+         * greater than offset, set its start node to new node and decrease its
+         * start offset by offset.
+         * 7.3. For each live range whose end node is node and end offset is greater
+         * than offset, set its end node to new node and decrease its end offset
+         * by offset.
+         * 7.4. For each live range whose start node is parent and start offset is
+         * equal to the index of node plus 1, increase its start offset by 1.
+         * 7.5. For each live range whose end node is parent and end offset is equal
+         * to the index of node plus 1, increase its end offset by 1.
+         */
+        for (const range of DOMImpl_1.dom.rangeList) {
+            if (range._start[0] === node && range._start[1] > offset) {
+                range._start[0] = newNode;
+                range._start[1] -= offset;
             }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            if (range._end[0] === node && range._end[1] > offset) {
+                range._end[0] = newNode;
+                range._end[1] -= offset;
+            }
+            const index = (0, TreeAlgorithm_1.tree_index)(node);
+            if (range._start[0] === parent && range._start[1] === index + 1) {
+                range._start[1]++;
+            }
+            if (range._end[0] === parent && range._end[1] === index + 1) {
+                range._end[1]++;
             }
-            finally { if (e_1) throw e_1.error; }
         }
     }
     /**
@@ -219,8 +194,7 @@ function text_split(node, offset) {
      * the empty string.
      * 9. Return new node.
      */
-    CharacterDataAlgorithm_1.characterData_replaceData(node, offset, count, '');
+    (0, CharacterDataAlgorithm_1.characterData_replaceData)(node, offset, count, '');
     return newNode;
 }
-exports.text_split = text_split;
 //# sourceMappingURL=TextAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/TextAlgorithm.js.map

@@ -1 +1 @@
-{"version":3,"file":"TextAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/TextAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAAA,0CAAoC;AAEpC,gCAA+B;AAC/B,oDAAoD;AACpD,qDAA+C;AAC/C,iDAEwB;AACxB,mEAEiC;AACjC,yDAAqD;AAErD;;;;;GAKG;AACH,SAAgB,wBAAwB,CAAC,IAAU,EAAE,IAAqB;;IAArB,qBAAA,EAAA,YAAqB;IACxE;;;;;OAKG;IACH;QACE,GAAC,MAAM,CAAC,QAAQ,IAAhB;YAEE,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE;gBACpE,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;aAC3C;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE;wBAClD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE;4BAC9C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;yBACvC;6BAAM;4BACL,WAAW,GAAG,IAAI,CAAA;yBACnB;qBACF;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE;wBACxB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;qBACnC;yBAAM;wBACL,IAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE;4BAC9C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;yBACvC;6BAAM;4BACL,WAAW,GAAG,IAAI,CAAA;yBACnB;wBAED,OAAO,MAAM,CAAA;qBACd;gBACH,CAAC;aACF,CAAA;QACH,CAAC;WACF;AACH,CAAC;AAzCD,4DAyCC;AAED;;;;;GAKG;AACH,SAAgB,iCAAiC,CAAC,IAAU,EAAE,IAAqB;;IAArB,qBAAA,EAAA,YAAqB;IACjF;;;;;OAKG;IACH;QACE,GAAC,MAAM,CAAC,QAAQ,IAAhB;YAEE,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE;gBAC7E,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;aAC3C;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE;wBAClD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE;4BACvD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;yBACvC;6BAAM;4BACL,WAAW,GAAG,IAAI,CAAA;yBACnB;qBACF;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE;wBACxB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;qBACnC;yBAAM;wBACL,IAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE;4BACvD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;yBACvC;6BAAM;4BACL,WAAW,GAAG,IAAI,CAAA;yBACnB;wBAED,OAAO,MAAM,CAAA;qBACd;gBACH,CAAC;aACF,CAAA;QACH,CAAC;WACF;AACH,CAAC;AAzCD,8EAyCC;AAED;;;;;GAKG;AACH,SAAgB,0BAA0B,CAAC,IAAU;IACnD;;;OAGG;IACH,IAAI,QAAQ,GAAG,EAAE,CAAA;IACjB,IAAI,IAAI,GAAG,2CAA2B,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAC,CAAC,IAAK,OAAA,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAnB,CAAmB,CAAC,CAAA;IACtF,OAAO,IAAI,KAAK,IAAI,EAAE;QACpB,QAAQ,IAAK,IAAa,CAAC,KAAK,CAAA;QAChC,IAAI,GAAG,0CAA0B,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAC,CAAC,IAAK,OAAA,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAnB,CAAmB,CAAC,CAAA;KACxF;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAZD,gEAYC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,IAAU,EAAE,MAAc;;IACnD;;;;OAIG;IACH,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAChC,IAAI,MAAM,GAAG,MAAM,EAAE;QACnB,MAAM,IAAI,6BAAc,EAAE,CAAA;KAC3B;IAED;;;;;;;;OAQG;IACH,IAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAA;IAC7B,IAAM,OAAO,GAAG,oDAA2B,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;IAChE,IAAM,OAAO,GAAG,6BAAW,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAA;IACxD,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB;;WAEG;QACH,mCAAe,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;;YAEnD;;;;;;;;;;;eAWG;YACH,KAAoB,IAAA,KAAA,SAAA,aAAG,CAAC,SAAS,CAAA,gBAAA,4BAAE;gBAA9B,IAAM,KAAK,WAAA;gBACd,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE;oBACxD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;oBACzB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;iBAC1B;gBACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE;oBACpD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;oBACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;iBACxB;gBACD,IAAM,KAAK,GAAG,0BAAU,CAAC,IAAI,CAAC,CAAA;gBAC9B,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE;oBAC/D,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAA;iBAClB;gBACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE;oBAC3D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;iBAChB;aACF;;;;;;;;;KACF;IAED;;;;OAIG;IACH,kDAAyB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;IAClD,OAAO,OAAO,CAAA;AAChB,CAAC;AApED,gCAoEC"}
+{"version":3,"file":"TextAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/TextAlgorithm.ts"],"names":[],"mappings":";;AAmBA,4DAyCC;AAQD,8EAyCC;AAQD,gEAYC;AASD,gCAoEC;AA9MD,4CAAoC;AAEpC,kCAA+B;AAC/B,sDAAoD;AACpD,uDAA+C;AAC/C,mDAEwB;AACxB,qEAEiC;AACjC,2DAAqD;AAErD;;;;;GAKG;AACH,SAAgB,wBAAwB,CAAC,IAAU,EAAE,OAAgB,KAAK;IACxE;;;;;OAKG;IACH,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC;YAEf,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBACrE,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;YAC5C,CAAC;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,CAAC;wBACnD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BAC/C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;oBACH,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BAC/C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;wBAED,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iCAAiC,CAAC,IAAU,EAAE,OAAgB,KAAK;IACjF;;;;;OAKG;IACH,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC;YAEf,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBAC9E,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;YAC5C,CAAC;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,CAAC;wBACnD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BACxD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;oBACH,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BACxD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;wBAED,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,0BAA0B,CAAC,IAAU;IACnD;;;OAGG;IACH,IAAI,QAAQ,GAAG,EAAE,CAAA;IACjB,IAAI,IAAI,GAAG,IAAA,2CAA2B,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACtF,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;QACrB,QAAQ,IAAK,IAAa,CAAC,KAAK,CAAA;QAChC,IAAI,GAAG,IAAA,0CAA0B,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACzF,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,IAAU,EAAE,MAAc;IACnD;;;;OAIG;IACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAChC,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;QACpB,MAAM,IAAI,6BAAc,EAAE,CAAA;IAC5B,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAA;IAC7B,MAAM,OAAO,GAAG,IAAA,oDAA2B,EAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;IAChE,MAAM,OAAO,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAA;IACxD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB;;WAEG;QACH,IAAA,mCAAe,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;QAEnD;;;;;;;;;;;WAWG;QACH,KAAK,MAAM,KAAK,IAAI,aAAG,CAAC,SAAS,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBACzD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;gBACzB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;YAC3B,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;gBACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;YACzB,CAAC;YACD,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAChE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAA;YACnB,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC5D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,IAAA,kDAAyB,EAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;IAClD,OAAO,OAAO,CAAA;AAChB,CAAC"}

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

@@ -1,7 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-var interfaces_1 = require("../dom/interfaces");
-var DOMException_1 = require("../dom/DOMException");
+exports.traversal_filter = traversal_filter;
+const interfaces_1 = require("../dom/interfaces");
+const DOMException_1 = require("../dom/DOMException");
 /**
  * Applies the filter to the given node and returns the result.
  *
@@ -19,12 +20,12 @@ function traversal_filter(traverser, node) {
     /**
      * 2. Let n be node’s nodeType attribute value − 1.
      */
-    var n = node._nodeType - 1;
+    const n = node._nodeType - 1;
     /**
      * 3. If the nth bit (where 0 is the least significant bit) of traverser’s
      * whatToShow is not set, then return FILTER_SKIP.
      */
-    var mask = 1 << n;
+    const mask = 1 << n;
     if ((traverser.whatToShow & mask) === 0) {
         return interfaces_1.FilterResult.Skip;
     }
@@ -43,7 +44,7 @@ function traversal_filter(traverser, node) {
      * traverser’s filter, "acceptNode", and « node ». If this throws an
      * exception, then unset traverser’s active flag and rethrow the exception.
      */
-    var result = interfaces_1.FilterResult.Reject;
+    let result = interfaces_1.FilterResult.Reject;
     try {
         result = traverser.filter.acceptNode(node);
     }
@@ -58,5 +59,4 @@ function traversal_filter(traverser, node) {
     traverser._activeFlag = false;
     return result;
 }
-exports.traversal_filter = traversal_filter;
 //# sourceMappingURL=TraversalAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/TraversalAlgorithm.js.map

@@ -1 +1 @@
-{"version":3,"file":"TraversalAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/TraversalAlgorithm.ts"],"names":[],"mappings":";;AAAA,gDAAgF;AAChF,oDAAuD;AAEvD;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,SAAoC,EACnE,IAAU;IACV;;;OAGG;IACH,IAAI,SAAS,CAAC,WAAW,EAAE;QACzB,MAAM,IAAI,gCAAiB,EAAE,CAAA;KAC9B;IAED;;OAEG;IACH,IAAM,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;IAE5B;;;OAGG;IACH,IAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;IACnB,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;QACvC,OAAO,yBAAY,CAAC,IAAI,CAAA;KACzB;IAED;;OAEG;IACH,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;QACrB,OAAO,yBAAY,CAAC,MAAM,CAAA;KAC3B;IAED;;OAEG;IACH,SAAS,CAAC,WAAW,GAAG,IAAI,CAAA;IAE5B;;;;OAIG;IACH,IAAI,MAAM,GAAG,yBAAY,CAAC,MAAM,CAAA;IAChC,IAAI;QACF,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;KAC3C;IAAC,OAAO,GAAG,EAAE;QACZ,SAAS,CAAC,WAAW,GAAG,KAAK,CAAA;QAC7B,MAAM,GAAG,CAAA;KACV;IAED;;;OAGG;IACH,SAAS,CAAC,WAAW,GAAG,KAAK,CAAA;IAC7B,OAAO,MAAM,CAAA;AACf,CAAC;AAvDD,4CAuDC"}
+{"version":3,"file":"TraversalAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/TraversalAlgorithm.ts"],"names":[],"mappings":";;AASA,4CAuDC;AAhED,kDAAgF;AAChF,sDAAuD;AAEvD;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,SAAoC,EACnE,IAAU;IACV;;;OAGG;IACH,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;QAC1B,MAAM,IAAI,gCAAiB,EAAE,CAAA;IAC/B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;IAE5B;;;OAGG;IACH,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;IACnB,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACxC,OAAO,yBAAY,CAAC,IAAI,CAAA;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,OAAO,yBAAY,CAAC,MAAM,CAAA;IAC5B,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,WAAW,GAAG,IAAI,CAAA;IAE5B;;;;OAIG;IACH,IAAI,MAAM,GAAG,yBAAY,CAAC,MAAM,CAAA;IAChC,IAAI,CAAC;QACH,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;IAC5C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,SAAS,CAAC,WAAW,GAAG,KAAK,CAAA;QAC7B,MAAM,GAAG,CAAA;IACX,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,WAAW,GAAG,KAAK,CAAA;IAC7B,OAAO,MAAM,CAAA;AACf,CAAC"}