@pokash/n8n-nodes-ksef 0.2.12 → 0.2.16

package/node_modules/@oozcitak/dom/lib/dom/RangeImpl.js

@@ -0,0 +1,649 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+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("./DOMImpl");
+var interfaces_1 = require("./interfaces");
+var AbstractRangeImpl_1 = require("./AbstractRangeImpl");
+var DOMException_1 = require("./DOMException");
+var algorithm_1 = require("../algorithm");
+var WebIDLAlgorithm_1 = require("../algorithm/WebIDLAlgorithm");
+var util_1 = require("../util");
+/**
+ * Represents a live range.
+ */
+var RangeImpl = /** @class */ (function (_super) {
+    __extends(RangeImpl, _super);
+    /**
+     * Initializes a new instance of `Range`.
+     */
+    function RangeImpl() {
+        var _this = _super.call(this) || this;
+        /**
+         * The Range() constructor, when invoked, must return a new live range with
+         * (current global object’s associated Document, 0) as its start and end.
+         */
+        var doc = DOMImpl_1.dom.window._associatedDocument;
+        _this._start = [doc, 0];
+        _this._end = [doc, 0];
+        DOMImpl_1.dom.rangeList.add(_this);
+        return _this;
+    }
+    Object.defineProperty(RangeImpl.prototype, "commonAncestorContainer", {
+        /** @inheritdoc */
+        get: function () {
+            /**
+             * 1. Let container be start node.
+             * 2. While container is not an inclusive ancestor of end node, let
+             * container be container’s parent.
+             * 3. Return container.
+             */
+            var container = this._start[0];
+            while (!algorithm_1.tree_isAncestorOf(this._end[0], container, true)) {
+                if (container._parent === null) {
+                    throw new Error("Parent node  is null.");
+                }
+                container = container._parent;
+            }
+            return container;
+        },
+        enumerable: true,
+        configurable: true
+    });
+    /** @inheritdoc */
+    RangeImpl.prototype.setStart = function (node, offset) {
+        /**
+         * The setStart(node, offset) method, when invoked, must set the start of
+         * context object to boundary point (node, offset).
+         */
+        algorithm_1.range_setTheStart(this, node, offset);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.setEnd = function (node, offset) {
+        /**
+         * The setEnd(node, offset) method, when invoked, must set the end of
+         * context object to boundary point (node, offset).
+         */
+        algorithm_1.range_setTheEnd(this, node, offset);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.setStartBefore = function (node) {
+        /**
+         * 1. Let parent be node’s parent.
+         * 2. If parent is null, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. Set the start of the context object to boundary point
+         * (parent, node’s index).
+         */
+        var parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        algorithm_1.range_setTheStart(this, parent, algorithm_1.tree_index(node));
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.setStartAfter = function (node) {
+        /**
+         * 1. Let parent be node’s parent.
+         * 2. If parent is null, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. Set the start of the context object to boundary point
+         * (parent, node’s index plus 1).
+         */
+        var parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        algorithm_1.range_setTheStart(this, parent, algorithm_1.tree_index(node) + 1);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.setEndBefore = function (node) {
+        /**
+         * 1. Let parent be node’s parent.
+         * 2. If parent is null, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. Set the end of the context object to boundary point
+         * (parent, node’s index).
+         */
+        var parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        algorithm_1.range_setTheEnd(this, parent, algorithm_1.tree_index(node));
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.setEndAfter = function (node) {
+        /**
+         * 1. Let parent be node’s parent.
+         * 2. If parent is null, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. Set the end of the context object to boundary point
+         * (parent, node’s index plus 1).
+         */
+        var parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        algorithm_1.range_setTheEnd(this, parent, algorithm_1.tree_index(node) + 1);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.collapse = function (toStart) {
+        /**
+         * The collapse(toStart) method, when invoked, must if toStart is true,
+         * set end to start, and set start to end otherwise.
+         */
+        if (toStart) {
+            this._end = this._start;
+        }
+        else {
+            this._start = this._end;
+        }
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.selectNode = function (node) {
+        /**
+         * The selectNode(node) method, when invoked, must select node within
+         * context object.
+         */
+        algorithm_1.range_select(node, this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.selectNodeContents = function (node) {
+        /**
+         * 1. If node is a doctype, throw an "InvalidNodeTypeError" DOMException.
+         * 2. Let length be the length of node.
+         * 3. Set start to the boundary point (node, 0).
+         * 4. Set end to the boundary point (node, length).
+         */
+        if (util_1.Guard.isDocumentTypeNode(node))
+            throw new DOMException_1.InvalidNodeTypeError();
+        var length = algorithm_1.tree_nodeLength(node);
+        this._start = [node, 0];
+        this._end = [node, length];
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.compareBoundaryPoints = function (how, sourceRange) {
+        /**
+         * 1. If how is not one of
+         * - START_TO_START,
+         * - START_TO_END,
+         * - END_TO_END, and
+         * - END_TO_START,
+         * then throw a "NotSupportedError" DOMException.
+         */
+        if (how !== interfaces_1.HowToCompare.StartToStart && how !== interfaces_1.HowToCompare.StartToEnd &&
+            how !== interfaces_1.HowToCompare.EndToEnd && how !== interfaces_1.HowToCompare.EndToStart)
+            throw new DOMException_1.NotSupportedError();
+        /**
+         * 2. If context object’s root is not the same as sourceRange’s root,
+         * then throw a "WrongDocumentError" DOMException.
+         */
+        if (algorithm_1.range_root(this) !== algorithm_1.range_root(sourceRange))
+            throw new DOMException_1.WrongDocumentError();
+        /**
+         * 3. If how is:
+         * - START_TO_START:
+         * Let this point be the context object’s start. Let other point be
+         * sourceRange’s start.
+         * - START_TO_END:
+         * Let this point be the context object’s end. Let other point be
+         * sourceRange’s start.
+         * - END_TO_END:
+         * Let this point be the context object’s end. Let other point be
+         * sourceRange’s end.
+         * - END_TO_START:
+         * Let this point be the context object’s start. Let other point be
+         * sourceRange’s end.
+         */
+        var thisPoint;
+        var otherPoint;
+        switch (how) {
+            case interfaces_1.HowToCompare.StartToStart:
+                thisPoint = this._start;
+                otherPoint = sourceRange._start;
+                break;
+            case interfaces_1.HowToCompare.StartToEnd:
+                thisPoint = this._end;
+                otherPoint = sourceRange._start;
+                break;
+            case interfaces_1.HowToCompare.EndToEnd:
+                thisPoint = this._end;
+                otherPoint = sourceRange._end;
+                break;
+            case interfaces_1.HowToCompare.EndToStart:
+                thisPoint = this._start;
+                otherPoint = sourceRange._end;
+                break;
+            /* istanbul ignore next */
+            default:
+                throw new DOMException_1.NotSupportedError();
+        }
+        /**
+         * 4. If the position of this point relative to other point is
+         * - before
+         * Return −1.
+         * - equal
+         * Return 0.
+         * - after
+         * Return 1.
+         */
+        var position = algorithm_1.boundaryPoint_position(thisPoint, otherPoint);
+        if (position === interfaces_1.BoundaryPosition.Before) {
+            return -1;
+        }
+        else if (position === interfaces_1.BoundaryPosition.After) {
+            return 1;
+        }
+        else {
+            return 0;
+        }
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.deleteContents = function () {
+        var e_1, _a, e_2, _b;
+        /**
+         * 1. If the context object is collapsed, then return.
+         * 2. Let original start node, original start offset, original end node,
+         * and original end offset be the context object’s start node,
+         * start offset, end node, and end offset, respectively.
+         */
+        if (algorithm_1.range_collapsed(this))
+            return;
+        var originalStartNode = this._startNode;
+        var originalStartOffset = this._startOffset;
+        var originalEndNode = this._endNode;
+        var originalEndOffset = this._endOffset;
+        /**
+         * 3. If original start node and original end node are the same, and they
+         * are a Text, ProcessingInstruction, or Comment node, replace data with
+         * node original start node, offset original start offset, count original
+         * end offset minus original start offset, and data the empty string,
+         * and then return.
+         */
+        if (originalStartNode === originalEndNode &&
+            util_1.Guard.isCharacterDataNode(originalStartNode)) {
+            algorithm_1.characterData_replaceData(originalStartNode, originalStartOffset, originalEndOffset - originalStartOffset, '');
+            return;
+        }
+        /**
+         * 4. Let nodes to remove be a list of all the nodes that are contained in
+         * the context object, in tree order, omitting any node whose parent is also
+         * contained in the context object.
+         */
+        var nodesToRemove = [];
+        try {
+            for (var _c = __values(algorithm_1.range_getContainedNodes(this)), _d = _c.next(); !_d.done; _d = _c.next()) {
+                var node = _d.value;
+                var parent = node._parent;
+                if (parent !== null && algorithm_1.range_isContained(parent, this)) {
+                    continue;
+                }
+                nodesToRemove.push(node);
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (_d && !_d.done && (_a = _c.return)) _a.call(_c);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        var newNode;
+        var newOffset;
+        if (algorithm_1.tree_isAncestorOf(originalEndNode, originalStartNode, true)) {
+            /**
+             * 5. 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 offset.
+             */
+            newNode = originalStartNode;
+            newOffset = originalStartOffset;
+        }
+        else {
+            /**
+             * 6. Otherwise:
+             * 6.1. Let reference node equal original start node.
+             * 6.2. While reference node’s parent is not null and is not an inclusive
+             * ancestor of original end node, set reference node to its parent.
+             * 6.3. Set new node to the parent of reference node, and new offset to
+             * one plus the index of reference node.
+             */
+            var referenceNode = originalStartNode;
+            while (referenceNode._parent !== null &&
+                !algorithm_1.tree_isAncestorOf(originalEndNode, referenceNode._parent, true)) {
+                referenceNode = referenceNode._parent;
+            }
+            /* istanbul ignore next */
+            if (referenceNode._parent === null) {
+                throw new Error("Parent node is null.");
+            }
+            newNode = referenceNode._parent;
+            newOffset = algorithm_1.tree_index(referenceNode) + 1;
+        }
+        /**
+         * 7. If original start node is a Text, ProcessingInstruction, or Comment
+         * node, replace data with node original start node, offset original start
+         * offset, count original start node’s length minus original start offset,
+         * data the empty string.
+         */
+        if (util_1.Guard.isCharacterDataNode(originalStartNode)) {
+            algorithm_1.characterData_replaceData(originalStartNode, originalStartOffset, algorithm_1.tree_nodeLength(originalStartNode) - originalStartOffset, '');
+        }
+        try {
+            /**
+             * 8. For each node in nodes to remove, in tree order, remove node from its
+             * parent.
+             */
+            for (var nodesToRemove_1 = __values(nodesToRemove), nodesToRemove_1_1 = nodesToRemove_1.next(); !nodesToRemove_1_1.done; nodesToRemove_1_1 = nodesToRemove_1.next()) {
+                var node = nodesToRemove_1_1.value;
+                /* istanbul ignore else */
+                if (node._parent) {
+                    algorithm_1.mutation_remove(node, node._parent);
+                }
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (nodesToRemove_1_1 && !nodesToRemove_1_1.done && (_b = nodesToRemove_1.return)) _b.call(nodesToRemove_1);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        /**
+         * 9. If original end node is a Text, ProcessingInstruction, or Comment
+         * node, replace data with node original end node, offset 0, count original
+         * end offset and data the empty string.
+         */
+        if (util_1.Guard.isCharacterDataNode(originalEndNode)) {
+            algorithm_1.characterData_replaceData(originalEndNode, 0, originalEndOffset, '');
+        }
+        /**
+         * 10. Set start and end to (new node, new offset).
+         */
+        this._start = [newNode, newOffset];
+        this._end = [newNode, newOffset];
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.extractContents = function () {
+        /**
+         * The extractContents() method, when invoked, must return the result of
+         * extracting the context object.
+         */
+        return algorithm_1.range_extract(this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.cloneContents = function () {
+        /**
+         * The cloneContents() method, when invoked, must return the result of
+         * cloning the contents of the context object.
+         */
+        return algorithm_1.range_cloneTheContents(this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.insertNode = function (node) {
+        /**
+         * The insertNode(node) method, when invoked, must insert node into the
+         * context object.
+         */
+        return algorithm_1.range_insert(node, this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.surroundContents = function (newParent) {
+        var e_3, _a;
+        try {
+            /**
+             * 1. If a non-Text node is partially contained in the context object, then
+             * throw an "InvalidStateError" DOMException.
+             */
+            for (var _b = __values(algorithm_1.range_getPartiallyContainedNodes(this)), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var node = _c.value;
+                if (!util_1.Guard.isTextNode(node)) {
+                    throw new DOMException_1.InvalidStateError();
+                }
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        /**
+         * 2. If newParent is a Document, DocumentType, or DocumentFragment node,
+         * then throw an "InvalidNodeTypeError" DOMException.
+         */
+        if (util_1.Guard.isDocumentNode(newParent) ||
+            util_1.Guard.isDocumentTypeNode(newParent) ||
+            util_1.Guard.isDocumentFragmentNode(newParent)) {
+            throw new DOMException_1.InvalidNodeTypeError();
+        }
+        /**
+         * 3. Let fragment be the result of extracting the context object.
+         */
+        var fragment = algorithm_1.range_extract(this);
+        /**
+         * 4. If newParent has children, then replace all with null within newParent.
+         */
+        if ((newParent)._children.size !== 0) {
+            algorithm_1.mutation_replaceAll(null, newParent);
+        }
+        /**
+         * 5. Insert newParent into the context object.
+         * 6. Append fragment to newParent.
+         */
+        algorithm_1.range_insert(newParent, this);
+        algorithm_1.mutation_append(fragment, newParent);
+        /**
+         * 7. Select newParent within the context object.
+         */
+        algorithm_1.range_select(newParent, this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.cloneRange = function () {
+        /**
+         * The cloneRange() method, when invoked, must return a new live range with
+         * the same start and end as the context object.
+         */
+        return algorithm_1.create_range(this._start, this._end);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.detach = function () {
+        /**
+         * The detach() method, when invoked, must do nothing.
+         *
+         * since JS lacks weak references, we still use detach
+         */
+        DOMImpl_1.dom.rangeList.delete(this);
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.isPointInRange = function (node, offset) {
+        /**
+         * 1. If node’s root is different from the context object’s root, return false.
+         */
+        if (algorithm_1.tree_rootNode(node) !== algorithm_1.range_root(this)) {
+            return false;
+        }
+        /**
+         * 2. If node is a doctype, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. If offset is greater than node’s length, then throw an
+         * "IndexSizeError" DOMException.
+         */
+        if (util_1.Guard.isDocumentTypeNode(node))
+            throw new DOMException_1.InvalidNodeTypeError();
+        if (offset > algorithm_1.tree_nodeLength(node))
+            throw new DOMException_1.IndexSizeError();
+        /**
+         * 4. If (node, offset) is before start or after end, return false.
+         */
+        var bp = [node, offset];
+        if (algorithm_1.boundaryPoint_position(bp, this._start) === interfaces_1.BoundaryPosition.Before ||
+            algorithm_1.boundaryPoint_position(bp, this._end) === interfaces_1.BoundaryPosition.After) {
+            return false;
+        }
+        /**
+         * 5. Return true.
+         */
+        return true;
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.comparePoint = function (node, offset) {
+        /**
+         * 1. If node’s root is different from the context object’s root, then throw
+         * a "WrongDocumentError" DOMException.
+         * 2. If node is a doctype, then throw an "InvalidNodeTypeError" DOMException.
+         * 3. If offset is greater than node’s length, then throw an
+         * "IndexSizeError" DOMException.
+         */
+        if (algorithm_1.tree_rootNode(node) !== algorithm_1.range_root(this))
+            throw new DOMException_1.WrongDocumentError();
+        if (util_1.Guard.isDocumentTypeNode(node))
+            throw new DOMException_1.InvalidNodeTypeError();
+        if (offset > algorithm_1.tree_nodeLength(node))
+            throw new DOMException_1.IndexSizeError();
+        /**
+         * 4. If (node, offset) is before start, return −1.
+         * 5. If (node, offset) is after end, return 1.
+         * 6. Return 0.
+         */
+        var bp = [node, offset];
+        if (algorithm_1.boundaryPoint_position(bp, this._start) === interfaces_1.BoundaryPosition.Before) {
+            return -1;
+        }
+        else if (algorithm_1.boundaryPoint_position(bp, this._end) === interfaces_1.BoundaryPosition.After) {
+            return 1;
+        }
+        else {
+            return 0;
+        }
+    };
+    /** @inheritdoc */
+    RangeImpl.prototype.intersectsNode = function (node) {
+        /**
+         * 1. If node’s root is different from the context object’s root, return false.
+         */
+        if (algorithm_1.tree_rootNode(node) !== algorithm_1.range_root(this)) {
+            return false;
+        }
+        /**
+         * 2. Let parent be node’s parent.
+         * 3. If parent is null, return true.
+         */
+        var parent = node._parent;
+        if (parent === null)
+            return true;
+        /**
+         * 4. Let offset be node’s index.
+         */
+        var offset = algorithm_1.tree_index(node);
+        /**
+         * 5. If (parent, offset) is before end and (parent, offset plus 1) is
+         * after start, return true.
+         */
+        if (algorithm_1.boundaryPoint_position([parent, offset], this._end) === interfaces_1.BoundaryPosition.Before &&
+            algorithm_1.boundaryPoint_position([parent, offset + 1], this._start) === interfaces_1.BoundaryPosition.After) {
+            return true;
+        }
+        /**
+         * 6. Return false.
+         */
+        return false;
+    };
+    RangeImpl.prototype.toString = function () {
+        var e_4, _a;
+        /**
+         * 1. Let s be the empty string.
+         */
+        var s = '';
+        /**
+         * 2. If the context object’s start node is the context object’s end node
+         * and it is a Text node, then return the substring of that Text node’s data
+         * beginning at the context object’s start offset and ending at the context
+         * object’s end offset.
+         */
+        if (this._startNode === this._endNode && util_1.Guard.isTextNode(this._startNode)) {
+            return this._startNode._data.substring(this._startOffset, this._endOffset);
+        }
+        /**
+         * 3. If the context object’s start node is a Text node, then append the
+         * substring of that node’s data from the context object’s start offset
+         * until the end to s.
+         */
+        if (util_1.Guard.isTextNode(this._startNode)) {
+            s += this._startNode._data.substring(this._startOffset);
+        }
+        try {
+            /**
+             * 4. Append the concatenation of the data of all Text nodes that are
+             * contained in the context object, in tree order, to s.
+             */
+            for (var _b = __values(algorithm_1.range_getContainedNodes(this)), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var child = _c.value;
+                if (util_1.Guard.isTextNode(child)) {
+                    s += child._data;
+                }
+            }
+        }
+        catch (e_4_1) { e_4 = { error: e_4_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_4) throw e_4.error; }
+        }
+        /**
+         * 5. If the context object’s end node is a Text node, then append the
+         * substring of that node’s data from its start until the context object’s
+         * end offset to s.
+         */
+        if (util_1.Guard.isTextNode(this._endNode)) {
+            s += this._endNode._data.substring(0, this._endOffset);
+        }
+        /**
+         * 6. Return s.
+         */
+        return s;
+    };
+    /**
+     * Creates a new `Range`.
+     *
+     * @param start - start point
+     * @param end - end point
+     */
+    RangeImpl._create = function (start, end) {
+        var range = new RangeImpl();
+        if (start)
+            range._start = start;
+        if (end)
+            range._end = end;
+        return range;
+    };
+    RangeImpl.START_TO_START = 0;
+    RangeImpl.START_TO_END = 1;
+    RangeImpl.END_TO_END = 2;
+    RangeImpl.END_TO_START = 3;
+    return RangeImpl;
+}(AbstractRangeImpl_1.AbstractRangeImpl));
+exports.RangeImpl = RangeImpl;
+/**
+ * Define constants on prototype.
+ */
+WebIDLAlgorithm_1.idl_defineConst(RangeImpl.prototype, "START_TO_START", 0);
+WebIDLAlgorithm_1.idl_defineConst(RangeImpl.prototype, "START_TO_END", 1);
+WebIDLAlgorithm_1.idl_defineConst(RangeImpl.prototype, "END_TO_END", 2);
+WebIDLAlgorithm_1.idl_defineConst(RangeImpl.prototype, "END_TO_START", 3);
+//# sourceMappingURL=RangeImpl.js.map

package/node_modules/@oozcitak/dom/lib/dom/RangeImpl.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeImpl.js","sourceRoot":"","sources":["../../src/dom/RangeImpl.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,qCAA+B;AAC/B,2CAGqB;AACrB,yDAAuD;AACvD,+CAGuB;AACvB,0CAOqB;AACrB,gEAA8D;AAC9D,gCAA+B;AAE/B;;GAEG;AACH;IAA+B,6BAAiB;IAe9C;;OAEG;IACH;QAAA,YACE,iBAAO,SAWR;QATC;;;WAGG;QACH,IAAM,GAAG,GAAG,aAAG,CAAC,MAAM,CAAC,mBAAmB,CAAA;QAC1C,KAAI,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACtB,KAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAEpB,aAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAI,CAAC,CAAA;;IACzB,CAAC;IAGD,sBAAI,8CAAuB;QAD3B,kBAAkB;aAClB;YACE;;;;;eAKG;YACH,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YAC9B,OAAO,CAAC,6BAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE;gBACxD,IAAI,SAAS,CAAC,OAAO,KAAK,IAAI,EAAE;oBAC9B,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;iBACzC;gBACD,SAAS,GAAG,SAAS,CAAC,OAAO,CAAA;aAC9B;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;;;OAAA;IAED,kBAAkB;IAClB,4BAAQ,GAAR,UAAS,IAAU,EAAE,MAAc;QACjC;;;WAGG;QACH,6BAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;IACvC,CAAC;IAED,kBAAkB;IAClB,0BAAM,GAAN,UAAO,IAAU,EAAE,MAAc;QAC/B;;;WAGG;QACH,2BAAe,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;IACrC,CAAC;IAED,kBAAkB;IAClB,kCAAc,GAAd,UAAe,IAAU;QACvB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,6BAAiB,CAAC,IAAI,EAAE,MAAM,EAC5B,sBAAU,CAAC,IAAI,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,iCAAa,GAAb,UAAc,IAAU;QACtB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,6BAAiB,CAAC,IAAI,EAAE,MAAM,EAC5B,sBAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IACzB,CAAC;IAED,kBAAkB;IAClB,gCAAY,GAAZ,UAAa,IAAU;QACrB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,2BAAe,CAAC,IAAI,EAAE,MAAM,EAC1B,sBAAU,CAAC,IAAI,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,+BAAW,GAAX,UAAY,IAAU;QACpB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,2BAAe,CAAC,IAAI,EAAE,MAAM,EAC1B,sBAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IACzB,CAAC;IAED,kBAAkB;IAClB,4BAAQ,GAAR,UAAS,OAA6B;QACpC;;;WAGG;QACH,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAA;SACxB;aAAM;YACL,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;SACxB;IACH,CAAC;IAED,kBAAkB;IAClB,8BAAU,GAAV,UAAW,IAAU;QACnB;;;WAGG;QACH,wBAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC1B,CAAC;IAED,kBAAkB;IAClB,sCAAkB,GAAlB,UAAmB,IAAU;QAC3B;;;;;WAKG;QACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,IAAM,MAAM,GAAG,2BAAe,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACvB,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAC5B,CAAC;IAED,kBAAkB;IAClB,yCAAqB,GAArB,UAAsB,GAAiB,EAAE,WAAkB;QACzD;;;;;;;WAOG;QACH,IAAI,GAAG,KAAK,yBAAY,CAAC,YAAY,IAAI,GAAG,KAAK,yBAAY,CAAC,UAAU;YACtE,GAAG,KAAK,yBAAY,CAAC,QAAQ,IAAI,GAAG,KAAK,yBAAY,CAAC,UAAU;YAChE,MAAM,IAAI,gCAAiB,EAAE,CAAA;QAE/B;;;WAGG;QACH,IAAI,sBAAU,CAAC,IAAI,CAAC,KAAK,sBAAU,CAAC,WAAW,CAAC;YAC9C,MAAM,IAAI,iCAAkB,EAAE,CAAA;QAEhC;;;;;;;;;;;;;;WAcG;QACH,IAAI,SAAwB,CAAA;QAC5B,IAAI,UAAyB,CAAA;QAE7B,QAAQ,GAAG,EAAE;YACX,KAAK,yBAAY,CAAC,YAAY;gBAC5B,SAAS,GAAG,IAAI,CAAC,MAAM,CAAA;gBACvB,UAAU,GAAG,WAAW,CAAC,MAAM,CAAA;gBAC/B,MAAK;YACP,KAAK,yBAAY,CAAC,UAAU;gBAC1B,SAAS,GAAG,IAAI,CAAC,IAAI,CAAA;gBACrB,UAAU,GAAG,WAAW,CAAC,MAAM,CAAA;gBAC/B,MAAK;YACP,KAAK,yBAAY,CAAC,QAAQ;gBACxB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAA;gBACrB,UAAU,GAAG,WAAW,CAAC,IAAI,CAAA;gBAC7B,MAAK;YACP,KAAK,yBAAY,CAAC,UAAU;gBAC1B,SAAS,GAAG,IAAI,CAAC,MAAM,CAAA;gBACvB,UAAU,GAAG,WAAW,CAAC,IAAI,CAAA;gBAC7B,MAAK;YACP,0BAA0B;YAC1B;gBACE,MAAM,IAAI,gCAAiB,EAAE,CAAA;SAChC;QAED;;;;;;;;WAQG;QACH,IAAM,QAAQ,GAAG,kCAAsB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAA;QAE9D,IAAI,QAAQ,KAAK,6BAAgB,CAAC,MAAM,EAAE;YACxC,OAAO,CAAC,CAAC,CAAA;SACV;aAAM,IAAI,QAAQ,KAAK,6BAAgB,CAAC,KAAK,EAAE;YAC9C,OAAO,CAAC,CAAA;SACT;aAAM;YACL,OAAO,CAAC,CAAA;SACT;IACH,CAAC;IAED,kBAAkB;IAClB,kCAAc,GAAd;;QACE;;;;;WAKG;QACH,IAAI,2BAAe,CAAC,IAAI,CAAC;YAAE,OAAM;QAEjC,IAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAA;QACzC,IAAM,mBAAmB,GAAG,IAAI,CAAC,YAAY,CAAA;QAC7C,IAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAA;QACrC,IAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAA;QAEzC;;;;;;WAMG;QACH,IAAI,iBAAiB,KAAK,eAAe;YACvC,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE;YAC9C,qCAAyB,CAAC,iBAAiB,EACzC,mBAAmB,EAAE,iBAAiB,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;YACnE,OAAM;SACP;QAED;;;;WAIG;QACH,IAAM,aAAa,GAAW,EAAE,CAAA;;YAChC,KAAmB,IAAA,KAAA,SAAA,mCAAuB,CAAC,IAAI,CAAC,CAAA,gBAAA,4BAAE;gBAA7C,IAAM,IAAI,WAAA;gBACb,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;gBAC3B,IAAI,MAAM,KAAK,IAAI,IAAI,6BAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;oBACtD,SAAQ;iBACT;gBACD,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;aACzB;;;;;;;;;QAED,IAAI,OAAa,CAAA;QACjB,IAAI,SAAiB,CAAA;QAErB,IAAI,6BAAiB,CAAC,eAAe,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE;YAC/D;;;;eAIG;YACH,OAAO,GAAG,iBAAiB,CAAA;YAC3B,SAAS,GAAG,mBAAmB,CAAA;SAChC;aAAM;YACL;;;;;;;eAOG;YACH,IAAI,aAAa,GAAG,iBAAiB,CAAA;YACrC,OAAO,aAAa,CAAC,OAAO,KAAK,IAAI;gBACnC,CAAC,6BAAiB,CAAC,eAAe,EAAE,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE;gBAClE,aAAa,GAAG,aAAa,CAAC,OAAO,CAAA;aACtC;YACD,0BAA0B;YAC1B,IAAI,aAAa,CAAC,OAAO,KAAK,IAAI,EAAE;gBAClC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;aACxC;YACD,OAAO,GAAG,aAAa,CAAC,OAAO,CAAA;YAC/B,SAAS,GAAG,sBAAU,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;SAC1C;QAED;;;;;WAKG;QACH,IAAI,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE;YAChD,qCAAyB,CAAC,iBAAiB,EACzC,mBAAmB,EACnB,2BAAe,CAAC,iBAAiB,CAAC,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;SAChE;;YAED;;;eAGG;YACH,KAAmB,IAAA,kBAAA,SAAA,aAAa,CAAA,4CAAA,uEAAE;gBAA7B,IAAM,IAAI,0BAAA;gBACb,0BAA0B;gBAC1B,IAAI,IAAI,CAAC,OAAO,EAAE;oBAChB,2BAAe,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAA;iBACpC;aACF;;;;;;;;;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,mBAAmB,CAAC,eAAe,CAAC,EAAE;YAC9C,qCAAyB,CAAC,eAAe,EACvC,CAAC,EAAE,iBAAiB,EAAE,EAAE,CAAC,CAAA;SAC5B;QAED;;WAEG;QACH,IAAI,CAAC,MAAM,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;QAClC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;IAClC,CAAC;IAED,kBAAkB;IAClB,mCAAe,GAAf;QACE;;;WAGG;QACH,OAAO,yBAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;IAED,kBAAkB;IAClB,iCAAa,GAAb;QACE;;;WAGG;QACH,OAAO,kCAAsB,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED,kBAAkB;IAClB,8BAAU,GAAV,UAAW,IAAU;QACnB;;;WAGG;QACH,OAAO,wBAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,kBAAkB;IAClB,oCAAgB,GAAhB,UAAiB,SAAe;;;YAC9B;;;eAGG;YACH,KAAmB,IAAA,KAAA,SAAA,4CAAgC,CAAC,IAAI,CAAC,CAAA,gBAAA,4BAAE;gBAAtD,IAAM,IAAI,WAAA;gBACb,IAAI,CAAC,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;oBAC3B,MAAM,IAAI,gCAAiB,EAAE,CAAA;iBAC9B;aACF;;;;;;;;;QAED;;;WAGG;QACH,IAAI,YAAK,CAAC,cAAc,CAAC,SAAS,CAAC;YACjC,YAAK,CAAC,kBAAkB,CAAC,SAAS,CAAC;YACnC,YAAK,CAAC,sBAAsB,CAAC,SAAS,CAAC,EAAE;YACzC,MAAM,IAAI,mCAAoB,EAAE,CAAA;SACjC;QAED;;WAEG;QACH,IAAM,QAAQ,GAAG,yBAAa,CAAC,IAAI,CAAC,CAAA;QAEpC;;WAEG;QACH,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE;YACpC,+BAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;SACrC;QAED;;;WAGG;QACH,wBAAY,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;QAC7B,2BAAe,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;QAEpC;;WAEG;QACH,wBAAY,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED,kBAAkB;IAClB,8BAAU,GAAV;QACE;;;WAGG;QACH,OAAO,wBAAY,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7C,CAAC;IAED,kBAAkB;IAClB,0BAAM,GAAN;QACE;;;;WAIG;QACH,aAAG,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;IAED,kBAAkB;IAClB,kCAAc,GAAd,UAAe,IAAU,EAAE,MAAc;QACvC;;WAEG;QACH,IAAI,yBAAa,CAAC,IAAI,CAAC,KAAK,sBAAU,CAAC,IAAI,CAAC,EAAE;YAC5C,OAAO,KAAK,CAAA;SACb;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAClC,IAAI,MAAM,GAAG,2BAAe,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,6BAAc,EAAE,CAAA;QAE5B;;WAEG;QACH,IAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACxC,IAAI,kCAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,MAAM;YACrE,kCAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE;YAClE,OAAO,KAAK,CAAA;SACb;QAED;;WAEG;QACH,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kBAAkB;IAClB,gCAAY,GAAZ,UAAa,IAAU,EAAE,MAAc;QACrC;;;;;;WAMG;QACH,IAAI,yBAAa,CAAC,IAAI,CAAC,KAAK,sBAAU,CAAC,IAAI,CAAC;YAC1C,MAAM,IAAI,iCAAkB,EAAE,CAAA;QAChC,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAClC,IAAI,MAAM,GAAG,2BAAe,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,6BAAc,EAAE,CAAA;QAE5B;;;;WAIG;QACH,IAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACxC,IAAI,kCAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,MAAM,EAAE;YACvE,OAAO,CAAC,CAAC,CAAA;SACV;aAAM,IAAI,kCAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE;YAC3E,OAAO,CAAC,CAAA;SACT;aAAM;YACL,OAAO,CAAC,CAAA;SACT;IACH,CAAC;IAED,kBAAkB;IAClB,kCAAc,GAAd,UAAe,IAAU;QACvB;;WAEG;QACH,IAAI,yBAAa,CAAC,IAAI,CAAC,KAAK,sBAAU,CAAC,IAAI,CAAC,EAAE;YAC5C,OAAO,KAAK,CAAA;SACb;QAED;;;WAGG;QACH,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QAC3B,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAEhC;;WAEG;QACH,IAAM,MAAM,GAAG,sBAAU,CAAC,IAAI,CAAC,CAAA;QAE/B;;;WAGG;QACH,IAAI,kCAAsB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,MAAM;YACjF,kCAAsB,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE;YACtF,OAAO,IAAI,CAAA;SACZ;QAED;;WAEG;QACH,OAAO,KAAK,CAAA;IACd,CAAC;IAED,4BAAQ,GAAR;;QACE;;WAEG;QACH,IAAI,CAAC,GAAG,EAAE,CAAA;QAEV;;;;;WAKG;QACH,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,QAAQ,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;YAC1E,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;SAC3E;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;YACrC,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;SACxD;;YAED;;;eAGG;YACH,KAAoB,IAAA,KAAA,SAAA,mCAAuB,CAAC,IAAI,CAAC,CAAA,gBAAA,4BAAE;gBAA9C,IAAM,KAAK,WAAA;gBACd,IAAI,YAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;oBAC3B,CAAC,IAAI,KAAK,CAAC,KAAK,CAAA;iBACjB;aACF;;;;;;;;;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YACnC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;SACvD;QAED;;WAEG;QACH,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;OAKG;IACI,iBAAO,GAAd,UAAe,KAAqB,EAAE,GAAmB;QACvD,IAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAA;QAC7B,IAAI,KAAK;YAAE,KAAK,CAAC,MAAM,GAAG,KAAK,CAAA;QAC/B,IAAI,GAAG;YAAE,KAAK,CAAC,IAAI,GAAG,GAAG,CAAA;QACzB,OAAO,KAAK,CAAA;IACd,CAAC;IA7mBM,wBAAc,GAAG,CAAC,CAAA;IAClB,sBAAY,GAAG,CAAC,CAAA;IAChB,oBAAU,GAAG,CAAC,CAAA;IACd,sBAAY,GAAG,CAAC,CAAA;IA2mBzB,gBAAC;CAAA,AAhnBD,CAA+B,qCAAiB,GAgnB/C;AAhnBY,8BAAS;AAknBtB;;GAEG;AACH,iCAAe,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAA;AACzD,iCAAe,CAAC,SAAS,CAAC,SAAS,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA;AACvD,iCAAe,CAAC,SAAS,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,CAAA;AACrD,iCAAe,CAAC,SAAS,CAAC,SAAS,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA"}