@pokash/n8n-nodes-ksef 0.2.16 → 0.2.18

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pokash/n8n-nodes-ksef",
-  "version": "0.2.16",
+  "version": "0.2.18",
   "description": "n8n node for Polish National e-Invoice System (KSeF)",
   "keywords": [
     "n8n-community-node-package",
@@ -61,20 +61,19 @@
     "n8n-workflow": "*"
   },
   "dependencies": {
-    "@xmldom/xmldom": "^0.8.11",
+    "@xmldom/xmldom": "^0.8.10",
+    "@xmldom/is-dom-node": "^1.0.0",
     "node-forge": "^1.3.1",
     "xml-crypto": "^6.0.0",
-    "xmlbuilder2": "^3.1.1",
-    "xpath": "^0.0.34"
+    "xmlbuilder2": "^3.1.1"
   },
   "optionalDependencies": {
     "@types/node-forge": "^1.3.11"
   },
-  "bundledDependencies": [
-    "@xmldom/xmldom",
-    "node-forge",
-    "xml-crypto",
-    "xmlbuilder2",
-    "xpath"
-  ]
+  "overrides": {
+    "xml-crypto": {
+      "@xmldom/xmldom": "$@xmldom/xmldom",
+      "@xmldom/is-dom-node": "$@xmldom/is-dom-node"
+    }
+  }
 }

package/node_modules/@oozcitak/dom/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2019 Ozgur Ozcitak
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

package/node_modules/@oozcitak/dom/README.md

@@ -1,32 +0,0 @@
-# DOM
-A Javascript implementation of the [DOM Living Standard](https://dom.spec.whatwg.org/).
-
-[![License](http://img.shields.io/npm/l/@oozcitak/dom.svg?style=flat-square)](http://opensource.org/licenses/MIT)
-[![NPM Version](https://img.shields.io/npm/v/@oozcitak/dom?logo=npm&style=flat-square)](https://www.npmjs.com/package/@oozcitak/dom)
-
-[![Travis Build Status](https://img.shields.io/travis/oozcitak/dom?logo=travis&style=flat-square)](http://travis-ci.org/oozcitak/dom)
-[![AppVeyor Build status](https://img.shields.io/appveyor/ci/oozcitak/dom?logo=appveyor&style=flat-square)](https://ci.appveyor.com/project/oozcitak/dom)
-[![Dev Dependency Status](http://img.shields.io/david/dev/oozcitak/dom.svg?style=flat-square)](https://david-dm.org/oozcitak/dom)
-[![Code Coverage](https://img.shields.io/codecov/c/github/oozcitak/dom?logo=codecov&style=flat-square)](https://codecov.io/gh/oozcitak/dom)
-
-# Version
-Current version implements the standard as of commit [57512fa](https://dom.spec.whatwg.org/commit-snapshots/57512fac17cf2f1c4c85be4aec178c8086ee5ee4/) (Last Updated 24 September 2019).
-
-This DOM implementation is for _XML documents only_.
-
-# Installation
-```
-npm install @oozcitak/dom
-```
-
-# Usage
-Create an instance of the [`DOMImplementation`](https://dom.spec.whatwg.org/#interface-domimplementation) class to construct the DOM tree.
-
-```js
-const { DOMImplementation } = require("@oozcitak/dom");
-
-const dom = new DOMImplementation();
-const doc = dom.createDocument('ns', 'root');
-```
-
-The module also exports [`DOMParser`](https://html.spec.whatwg.org/multipage/dynamic-markup-insertion.html#domparser) and [`XMLSerializer`](https://w3c.github.io/DOM-Parsing/#the-xmlserializer-interface) classes as in the browser.

package/node_modules/@oozcitak/dom/lib/algorithm/AbortAlgorithm.d.ts

@@ -1,21 +0,0 @@
-import { AbortSignal } from "../dom/interfaces";
-/**
- * Adds an algorithm to the given abort signal.
- *
- * @param algorithm - an algorithm
- * @param signal - abort signal
- */
-export declare function abort_add(algorithm: ((...args: any[]) => any), signal: AbortSignal): void;
-/**
- * Removes an algorithm from the given abort signal.
- *
- * @param algorithm - an algorithm
- * @param signal - abort signal
- */
-export declare function abort_remove(algorithm: ((...args: any[]) => any), signal: AbortSignal): void;
-/**
- * Signals abort on the given abort signal.
- *
- * @param signal - abort signal
- */
-export declare function abort_signalAbort(signal: AbortSignal): void;

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

@@ -1,79 +0,0 @@
-"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 EventAlgorithm_1 = require("./EventAlgorithm");
-/**
- * Adds an algorithm to the given abort signal.
- *
- * @param algorithm - an algorithm
- * @param signal - abort signal
- */
-function abort_add(algorithm, signal) {
-    /**
-     * 1. If signal’s aborted flag is set, then return.
-     * 2. Append algorithm to signal’s abort algorithms.
-     */
-    if (signal._abortedFlag)
-        return;
-    signal._abortAlgorithms.add(algorithm);
-}
-exports.abort_add = abort_add;
-/**
- * Removes an algorithm from the given abort signal.
- *
- * @param algorithm - an algorithm
- * @param signal - abort signal
- */
-function abort_remove(algorithm, signal) {
-    /**
-     * To remove an algorithm algorithm from an AbortSignal signal, remove
-     * algorithm from signal’s abort algorithms.
-     */
-    signal._abortAlgorithms.delete(algorithm);
-}
-exports.abort_remove = abort_remove;
-/**
- * Signals abort on the given abort signal.
- *
- * @param signal - abort signal
- */
-function abort_signalAbort(signal) {
-    var e_1, _a;
-    /**
-     * 1. If signal’s aborted flag is set, then return.
-     * 2. Set signal’s aborted flag.
-     * 3. For each algorithm in signal’s abort algorithms: run algorithm.
-     * 4. Empty signal’s abort algorithms.
-     * 5. Fire an event named abort at signal.
-     */
-    if (signal._abortedFlag)
-        return;
-    signal._abortedFlag = true;
-    try {
-        for (var _b = __values(signal._abortAlgorithms), _c = _b.next(); !_c.done; _c = _b.next()) {
-            var algorithm = _c.value;
-            algorithm.call(signal);
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
-    }
-    signal._abortAlgorithms.clear();
-    EventAlgorithm_1.event_fireAnEvent("abort", signal);
-}
-exports.abort_signalAbort = abort_signalAbort;
-//# sourceMappingURL=AbortAlgorithm.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"AbortAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/AbortAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;AACA,mDAAoD;AAEpD;;;;;GAKG;AACH,SAAgB,SAAS,CAAC,SAAoC,EAAE,MAAmB;IACjF;;;OAGG;IACH,IAAI,MAAM,CAAC,YAAY;QAAE,OAAM;IAC/B,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;AACxC,CAAC;AAPD,8BAOC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,SAAoC,EAAE,MAAmB;IACpF;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;AAC3C,CAAC;AAND,oCAMC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,MAAmB;;IACnD;;;;;;OAMG;IACH,IAAI,MAAM,CAAC,YAAY;QAAE,OAAM;IAC/B,MAAM,CAAC,YAAY,GAAG,IAAI,CAAA;;QAC1B,KAAwB,IAAA,KAAA,SAAA,MAAM,CAAC,gBAAgB,CAAA,gBAAA,4BAAE;YAA5C,IAAM,SAAS,WAAA;YAClB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SACvB;;;;;;;;;IACD,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAA;IAC/B,kCAAiB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;AACpC,CAAC;AAfD,8CAeC"}

package/node_modules/@oozcitak/dom/lib/algorithm/AttrAlgorithm.d.ts

@@ -1,8 +0,0 @@
-import { Attr } from "../dom/interfaces";
-/**
- * Changes the value of an existing attribute.
- *
- * @param attribute - an attribute node
- * @param value - attribute value
- */
-export declare function attr_setAnExistingAttributeValue(attribute: Attr, value: string): void;

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

@@ -1,23 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var ElementAlgorithm_1 = require("./ElementAlgorithm");
-/**
- * Changes the value of an existing attribute.
- *
- * @param attribute - an attribute node
- * @param value - attribute value
- */
-function attr_setAnExistingAttributeValue(attribute, value) {
-    /**
-     * 1. If attribute’s element is null, then set attribute’s value to value.
-     * 2. Otherwise, change attribute from attribute’s element to value.
-     */
-    if (attribute._element === null) {
-        attribute._value = value;
-    }
-    else {
-        ElementAlgorithm_1.element_change(attribute, attribute._element, value);
-    }
-}
-exports.attr_setAnExistingAttributeValue = attr_setAnExistingAttributeValue;
-//# sourceMappingURL=AttrAlgorithm.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"AttrAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/AttrAlgorithm.ts"],"names":[],"mappings":";;AACA,uDAAmD;AAEnD;;;;;GAKG;AACH,SAAgB,gCAAgC,CAAC,SAAe,EAAE,KAAa;IAC7E;;;OAGG;IACH,IAAI,SAAS,CAAC,QAAQ,KAAK,IAAI,EAAE;QAC/B,SAAS,CAAC,MAAM,GAAG,KAAK,CAAA;KACzB;SAAM;QACL,iCAAc,CAAC,SAAS,EAAE,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;KACrD;AACH,CAAC;AAVD,4EAUC"}

package/node_modules/@oozcitak/dom/lib/algorithm/BoundaryPointAlgorithm.d.ts

@@ -1,8 +0,0 @@
-import { BoundaryPoint, BoundaryPosition } from "../dom/interfaces";
-/**
- * Defines the position of a boundary point relative to another.
- *
- * @param bp - a boundary point
- * @param relativeTo - a boundary point to compare to
- */
-export declare function boundaryPoint_position(bp: BoundaryPoint, relativeTo: BoundaryPoint): BoundaryPosition;

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

@@ -1,76 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var interfaces_1 = require("../dom/interfaces");
-var TreeAlgorithm_1 = require("./TreeAlgorithm");
-/**
- * Defines the position of a boundary point relative to another.
- *
- * @param bp - a boundary point
- * @param relativeTo - a boundary point to compare to
- */
-function boundaryPoint_position(bp, relativeTo) {
-    var nodeA = bp[0];
-    var offsetA = bp[1];
-    var nodeB = relativeTo[0];
-    var offsetB = relativeTo[1];
-    /**
-     * 1. Assert: nodeA and nodeB have the same root.
-     */
-    console.assert(TreeAlgorithm_1.tree_rootNode(nodeA) === TreeAlgorithm_1.tree_rootNode(nodeB), "Boundary points must share the same root node.");
-    /**
-     * 2. If nodeA is nodeB, then return equal if offsetA is offsetB, before
-     * if offsetA is less than offsetB, and after if offsetA is greater than
-     * offsetB.
-     */
-    if (nodeA === nodeB) {
-        if (offsetA === offsetB) {
-            return interfaces_1.BoundaryPosition.Equal;
-        }
-        else if (offsetA < offsetB) {
-            return interfaces_1.BoundaryPosition.Before;
-        }
-        else {
-            return interfaces_1.BoundaryPosition.After;
-        }
-    }
-    /**
-     * 3. If nodeA is following nodeB, then if the position of (nodeB, offsetB)
-     * relative to (nodeA, offsetA) is before, return after, and if it is after,
-     * return before.
-     */
-    if (TreeAlgorithm_1.tree_isFollowing(nodeB, nodeA)) {
-        var pos = boundaryPoint_position([nodeB, offsetB], [nodeA, offsetA]);
-        if (pos === interfaces_1.BoundaryPosition.Before) {
-            return interfaces_1.BoundaryPosition.After;
-        }
-        else if (pos === interfaces_1.BoundaryPosition.After) {
-            return interfaces_1.BoundaryPosition.Before;
-        }
-    }
-    /**
-     * 4. If nodeA is an ancestor of nodeB:
-     */
-    if (TreeAlgorithm_1.tree_isAncestorOf(nodeB, nodeA)) {
-        /**
-         * 4.1. Let child be nodeB.
-         * 4.2. While child is not a child of nodeA, set child to its parent.
-         * 4.3. If child’s index is less than offsetA, then return after.
-         */
-        var child = nodeB;
-        while (!TreeAlgorithm_1.tree_isChildOf(nodeA, child)) {
-            /* istanbul ignore else */
-            if (child._parent !== null) {
-                child = child._parent;
-            }
-        }
-        if (TreeAlgorithm_1.tree_index(child) < offsetA) {
-            return interfaces_1.BoundaryPosition.After;
-        }
-    }
-    /**
-     * 5. Return before.
-     */
-    return interfaces_1.BoundaryPosition.Before;
-}
-exports.boundaryPoint_position = boundaryPoint_position;
-//# sourceMappingURL=BoundaryPointAlgorithm.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"BoundaryPointAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/BoundaryPointAlgorithm.ts"],"names":[],"mappings":";;AAAA,gDAAmE;AACnE,iDAGwB;AAExB;;;;;GAKG;AACH,SAAgB,sBAAsB,CAAC,EAAiB,EAAE,UAAyB;IAEjF,IAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;IACnB,IAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;IACrB,IAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;IAE7B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,6BAAa,CAAC,KAAK,CAAC,KAAK,6BAAa,CAAC,KAAK,CAAC,EAC1D,gDAAgD,CAAC,CAAA;IAEnD;;;;OAIG;IACH,IAAI,KAAK,KAAK,KAAK,EAAE;QACnB,IAAI,OAAO,KAAK,OAAO,EAAE;YACvB,OAAO,6BAAgB,CAAC,KAAK,CAAA;SAC9B;aAAM,IAAI,OAAO,GAAG,OAAO,EAAE;YAC5B,OAAO,6BAAgB,CAAC,MAAM,CAAA;SAC/B;aAAM;YACL,OAAO,6BAAgB,CAAC,KAAK,CAAA;SAC9B;KACF;IAED;;;;OAIG;IACH,IAAI,gCAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;QAClC,IAAM,GAAG,GAAG,sBAAsB,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAA;QACtE,IAAI,GAAG,KAAK,6BAAgB,CAAC,MAAM,EAAE;YACnC,OAAO,6BAAgB,CAAC,KAAK,CAAA;SAC9B;aAAM,IAAI,GAAG,KAAK,6BAAgB,CAAC,KAAK,EAAE;YACzC,OAAO,6BAAgB,CAAC,MAAM,CAAA;SAC/B;KACF;IAED;;OAEG;IACH,IAAI,iCAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;QACnC;;;;WAIG;QACH,IAAI,KAAK,GAAG,KAAK,CAAA;QAEjB,OAAO,CAAC,8BAAc,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;YACpC,0BAA0B;YAC1B,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,EAAE;gBAC1B,KAAK,GAAG,KAAK,CAAC,OAAO,CAAA;aACtB;SACF;QAED,IAAI,0BAAU,CAAC,KAAK,CAAC,GAAG,OAAO,EAAE;YAC/B,OAAO,6BAAgB,CAAC,KAAK,CAAA;SAC9B;KACF;IAED;;OAEG;IACH,OAAO,6BAAgB,CAAC,MAAM,CAAA;AAChC,CAAC;AArED,wDAqEC"}

package/node_modules/@oozcitak/dom/lib/algorithm/CharacterDataAlgorithm.d.ts

@@ -1,19 +0,0 @@
-import { CharacterData } from "../dom/interfaces";
-/**
- * Replaces character data.
- *
- * @param node - a character data node
- * @param offset - start offset
- * @param count - count of characters to replace
- * @param data - new data
- */
-export declare function characterData_replaceData(node: CharacterData, offset: number, count: number, data: string): void;
-/**
- * Returns `count` number of characters from `node`'s data starting at
- * the given `offset`.
- *
- * @param node - a character data node
- * @param offset - start offset
- * @param count - count of characters to return
- */
-export declare function characterData_substringData(node: CharacterData, offset: number, count: number): string;

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

@@ -1,140 +0,0 @@
-"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 TreeAlgorithm_1 = require("./TreeAlgorithm");
-var MutationObserverAlgorithm_1 = require("./MutationObserverAlgorithm");
-var DOMAlgorithm_1 = require("./DOMAlgorithm");
-/**
- * Replaces character data.
- *
- * @param node - a character data node
- * @param offset - start offset
- * @param count - count of characters to replace
- * @param data - new data
- */
-function characterData_replaceData(node, offset, count, data) {
-    var e_1, _a;
-    /**
-     * 1. Let length be node’s length.
-     * 2. If offset is greater than length, then throw an "IndexSizeError"
-     * DOMException.
-     * 3. If offset plus count is greater than length, then set count to length
-     * minus offset.
-     */
-    var length = TreeAlgorithm_1.tree_nodeLength(node);
-    if (offset > length) {
-        throw new DOMException_1.IndexSizeError("Offset exceeds character data length. Offset: " + offset + ", Length: " + length + ", Node is " + node.nodeName + ".");
-    }
-    if (offset + count > length) {
-        count = length - offset;
-    }
-    /**
-     * 4. Queue a mutation record of "characterData" for node with null, null,
-     * node’s data, « », « », null, and null.
-     */
-    if (DOMImpl_1.dom.features.mutationObservers) {
-        MutationObserverAlgorithm_1.observer_queueMutationRecord("characterData", node, null, null, node._data, [], [], null, null);
-    }
-    /**
-     * 5. Insert data into node’s data after offset code units.
-     * 6. Let delete offset be offset + data’s length.
-     * 7. Starting from delete offset code units, remove count code units from
-     * node’s data.
-     */
-    var newData = node._data.substring(0, offset) + data +
-        node._data.substring(offset + count);
-    node._data = newData;
-    try {
-        /**
-         * 8. For each live range whose start node is node and start offset is
-         * greater than offset but less than or equal to offset plus count, set its
-         * start offset to offset.
-         * 9. For each live range whose end node is node and end offset is greater
-         * than offset but less than or equal to offset plus count, set its end
-         * offset to offset.
-         * 10. For each live range whose start node is node and start offset is
-         * greater than offset plus count, increase its start offset by data’s
-         * length and decrease it by count.
-         * 11. For each live range whose end node is node and end offset is greater
-         * than offset plus count, increase its end offset by data’s length and
-         * decrease it by count.
-         */
-        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[1] <= offset + count) {
-                range._start[1] = offset;
-            }
-            if (range._end[0] === node && range._end[1] > offset && range._end[1] <= offset + count) {
-                range._end[1] = offset;
-            }
-            if (range._start[0] === node && range._start[1] > offset + count) {
-                range._start[1] += data.length - count;
-            }
-            if (range._end[0] === node && range._end[1] > offset + count) {
-                range._end[1] += data.length - count;
-            }
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
-    }
-    /**
-     * 12. If node is a Text node and its parent is not null, run the child
-     * text content change steps for node’s parent.
-     */
-    if (DOMImpl_1.dom.features.steps) {
-        if (util_1.Guard.isTextNode(node) && node._parent !== null) {
-            DOMAlgorithm_1.dom_runChildTextContentChangeSteps(node._parent);
-        }
-    }
-}
-exports.characterData_replaceData = characterData_replaceData;
-/**
- * Returns `count` number of characters from `node`'s data starting at
- * the given `offset`.
- *
- * @param node - a character data node
- * @param offset - start offset
- * @param count - count of characters to return
- */
-function characterData_substringData(node, offset, count) {
-    /**
-     * 1. Let length be node’s length.
-     * 2. If offset is greater than length, then throw an "IndexSizeError"
-     * DOMException.
-     * 3. If offset plus count is greater than length, return a string whose
-     * value is the code units from the offsetth code unit to the end of node’s
-     * data, and then return.
-     * 4. Return a string whose value is the code units from the offsetth code
-     * unit to the offset+countth code unit in node’s data.
-     */
-    var length = TreeAlgorithm_1.tree_nodeLength(node);
-    if (offset > length) {
-        throw new DOMException_1.IndexSizeError("Offset exceeds character data length. Offset: " + offset + ", Length: " + length + ", Node is " + node.nodeName + ".");
-    }
-    if (offset + count > length) {
-        return node._data.substr(offset);
-    }
-    else {
-        return node._data.substr(offset, count);
-    }
-}
-exports.characterData_substringData = characterData_substringData;
-//# sourceMappingURL=CharacterDataAlgorithm.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"CharacterDataAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/CharacterDataAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAAA,0CAAoC;AAEpC,gCAA+B;AAC/B,oDAAoD;AACpD,iDAAiD;AACjD,yEAA0E;AAC1E,+CAAmE;AAEnE;;;;;;;GAOG;AACH,SAAgB,yBAAyB,CAAC,IAAmB,EAAE,MAAc,EAAE,KAAa,EAC1F,IAAY;;IAEZ;;;;;;OAMG;IACH,IAAM,MAAM,GAAG,+BAAe,CAAC,IAAI,CAAC,CAAA;IAEpC,IAAI,MAAM,GAAG,MAAM,EAAE;QACnB,MAAM,IAAI,6BAAc,CAAC,mDAAiD,MAAM,kBAAa,MAAM,kBAAa,IAAI,CAAC,QAAQ,MAAG,CAAC,CAAA;KAClI;IAED,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM,EAAE;QAC3B,KAAK,GAAG,MAAM,GAAG,MAAM,CAAA;KACxB;IAED;;;OAGG;IACH,IAAI,aAAG,CAAC,QAAQ,CAAC,iBAAiB,EAAE;QAClC,wDAA4B,CAAC,eAAe,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAC5D,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;KAClC;IAED;;;;;OAKG;IACH,IAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,IAAI;QACpD,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,KAAK,CAAC,CAAA;IACtC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAA;;QAEpB;;;;;;;;;;;;;WAaG;QACH,KAAqB,IAAA,KAAA,SAAA,aAAG,CAAC,SAAS,CAAA,gBAAA,4BAAE;YAA/B,IAAM,KAAK,WAAA;YACd,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;gBAC7F,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAA;aACzB;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;gBACvF,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAA;aACvB;YACD,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,EAAE;gBAChE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;aACvC;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,EAAE;gBAC5D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;aACrC;SACF;;;;;;;;;IAED;;;OAGG;IACH,IAAI,aAAG,CAAC,QAAQ,CAAC,KAAK,EAAE;QACtB,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE;YACnD,iDAAkC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SACjD;KACF;AACH,CAAC;AA7ED,8DA6EC;AAED;;;;;;;GAOG;AACH,SAAgB,2BAA2B,CAAC,IAAmB,EAAE,MAAc,EAAE,KAAa;IAC5F;;;;;;;;;OASG;IACH,IAAM,MAAM,GAAG,+BAAe,CAAC,IAAI,CAAC,CAAA;IAEpC,IAAI,MAAM,GAAG,MAAM,EAAE;QACnB,MAAM,IAAI,6BAAc,CAAC,mDAAiD,MAAM,kBAAa,MAAM,kBAAa,IAAI,CAAC,QAAQ,MAAG,CAAC,CAAA;KAClI;IAED,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM,EAAE;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;KACjC;SAAM;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;KACxC;AACH,CAAC;AAtBD,kEAsBC"}