projen 0.99.2 → 0.99.3

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

@@ -0,0 +1,582 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RangeImpl = void 0;
+const DOMImpl_1 = require("./DOMImpl");
+const interfaces_1 = require("./interfaces");
+const AbstractRangeImpl_1 = require("./AbstractRangeImpl");
+const DOMException_1 = require("./DOMException");
+const algorithm_1 = require("../algorithm");
+const WebIDLAlgorithm_1 = require("../algorithm/WebIDLAlgorithm");
+const util_1 = require("../util");
+/**
+ * Represents a live range.
+ */
+class RangeImpl extends AbstractRangeImpl_1.AbstractRangeImpl {
+    static START_TO_START = 0;
+    static START_TO_END = 1;
+    static END_TO_END = 2;
+    static END_TO_START = 3;
+    START_TO_START = 0;
+    START_TO_END = 1;
+    END_TO_END = 2;
+    END_TO_START = 3;
+    _start;
+    _end;
+    /**
+     * Initializes a new instance of `Range`.
+     */
+    constructor() {
+        super();
+        /**
+         * The Range() constructor, when invoked, must return a new live range with
+         * (current global object’s associated Document, 0) as its start and end.
+         */
+        const doc = DOMImpl_1.dom.window._associatedDocument;
+        this._start = [doc, 0];
+        this._end = [doc, 0];
+        DOMImpl_1.dom.rangeList.add(this);
+    }
+    /** @inheritdoc */
+    get commonAncestorContainer() {
+        /**
+         * 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.
+         */
+        let container = this._start[0];
+        while (!(0, 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;
+    }
+    /** @inheritdoc */
+    setStart(node, offset) {
+        /**
+         * The setStart(node, offset) method, when invoked, must set the start of
+         * context object to boundary point (node, offset).
+         */
+        (0, algorithm_1.range_setTheStart)(this, node, offset);
+    }
+    /** @inheritdoc */
+    setEnd(node, offset) {
+        /**
+         * The setEnd(node, offset) method, when invoked, must set the end of
+         * context object to boundary point (node, offset).
+         */
+        (0, algorithm_1.range_setTheEnd)(this, node, offset);
+    }
+    /** @inheritdoc */
+    setStartBefore(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).
+         */
+        let parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        (0, algorithm_1.range_setTheStart)(this, parent, (0, algorithm_1.tree_index)(node));
+    }
+    /** @inheritdoc */
+    setStartAfter(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).
+         */
+        let parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        (0, algorithm_1.range_setTheStart)(this, parent, (0, algorithm_1.tree_index)(node) + 1);
+    }
+    /** @inheritdoc */
+    setEndBefore(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).
+         */
+        let parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        (0, algorithm_1.range_setTheEnd)(this, parent, (0, algorithm_1.tree_index)(node));
+    }
+    /** @inheritdoc */
+    setEndAfter(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).
+         */
+        let parent = node._parent;
+        if (parent === null)
+            throw new DOMException_1.InvalidNodeTypeError();
+        (0, algorithm_1.range_setTheEnd)(this, parent, (0, algorithm_1.tree_index)(node) + 1);
+    }
+    /** @inheritdoc */
+    collapse(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 */
+    selectNode(node) {
+        /**
+         * The selectNode(node) method, when invoked, must select node within
+         * context object.
+         */
+        (0, algorithm_1.range_select)(node, this);
+    }
+    /** @inheritdoc */
+    selectNodeContents(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();
+        const length = (0, algorithm_1.tree_nodeLength)(node);
+        this._start = [node, 0];
+        this._end = [node, length];
+    }
+    /** @inheritdoc */
+    compareBoundaryPoints(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 ((0, algorithm_1.range_root)(this) !== (0, 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.
+         */
+        let thisPoint;
+        let 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.
+         */
+        const position = (0, 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 */
+    deleteContents() {
+        /**
+         * 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 ((0, algorithm_1.range_collapsed)(this))
+            return;
+        const originalStartNode = this._startNode;
+        const originalStartOffset = this._startOffset;
+        const originalEndNode = this._endNode;
+        const 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)) {
+            (0, 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.
+         */
+        const nodesToRemove = [];
+        for (const node of (0, algorithm_1.range_getContainedNodes)(this)) {
+            const parent = node._parent;
+            if (parent !== null && (0, algorithm_1.range_isContained)(parent, this)) {
+                continue;
+            }
+            nodesToRemove.push(node);
+        }
+        let newNode;
+        let newOffset;
+        if ((0, 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.
+             */
+            let referenceNode = originalStartNode;
+            while (referenceNode._parent !== null &&
+                !(0, 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 = (0, 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)) {
+            (0, algorithm_1.characterData_replaceData)(originalStartNode, originalStartOffset, (0, algorithm_1.tree_nodeLength)(originalStartNode) - originalStartOffset, '');
+        }
+        /**
+         * 8. For each node in nodes to remove, in tree order, remove node from its
+         * parent.
+         */
+        for (const node of nodesToRemove) {
+            /* istanbul ignore else */
+            if (node._parent) {
+                (0, algorithm_1.mutation_remove)(node, node._parent);
+            }
+        }
+        /**
+         * 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)) {
+            (0, 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 */
+    extractContents() {
+        /**
+         * The extractContents() method, when invoked, must return the result of
+         * extracting the context object.
+         */
+        return (0, algorithm_1.range_extract)(this);
+    }
+    /** @inheritdoc */
+    cloneContents() {
+        /**
+         * The cloneContents() method, when invoked, must return the result of
+         * cloning the contents of the context object.
+         */
+        return (0, algorithm_1.range_cloneTheContents)(this);
+    }
+    /** @inheritdoc */
+    insertNode(node) {
+        /**
+         * The insertNode(node) method, when invoked, must insert node into the
+         * context object.
+         */
+        return (0, algorithm_1.range_insert)(node, this);
+    }
+    /** @inheritdoc */
+    surroundContents(newParent) {
+        /**
+         * 1. If a non-Text node is partially contained in the context object, then
+         * throw an "InvalidStateError" DOMException.
+         */
+        for (const node of (0, algorithm_1.range_getPartiallyContainedNodes)(this)) {
+            if (!util_1.Guard.isTextNode(node)) {
+                throw new DOMException_1.InvalidStateError();
+            }
+        }
+        /**
+         * 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.
+         */
+        const fragment = (0, algorithm_1.range_extract)(this);
+        /**
+         * 4. If newParent has children, then replace all with null within newParent.
+         */
+        if ((newParent)._children.size !== 0) {
+            (0, algorithm_1.mutation_replaceAll)(null, newParent);
+        }
+        /**
+         * 5. Insert newParent into the context object.
+         * 6. Append fragment to newParent.
+         */
+        (0, algorithm_1.range_insert)(newParent, this);
+        (0, algorithm_1.mutation_append)(fragment, newParent);
+        /**
+         * 7. Select newParent within the context object.
+         */
+        (0, algorithm_1.range_select)(newParent, this);
+    }
+    /** @inheritdoc */
+    cloneRange() {
+        /**
+         * The cloneRange() method, when invoked, must return a new live range with
+         * the same start and end as the context object.
+         */
+        return (0, algorithm_1.create_range)(this._start, this._end);
+    }
+    /** @inheritdoc */
+    detach() {
+        /**
+         * The detach() method, when invoked, must do nothing.
+         *
+         * since JS lacks weak references, we still use detach
+         */
+        DOMImpl_1.dom.rangeList.delete(this);
+    }
+    /** @inheritdoc */
+    isPointInRange(node, offset) {
+        /**
+         * 1. If node’s root is different from the context object’s root, return false.
+         */
+        if ((0, algorithm_1.tree_rootNode)(node) !== (0, 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 > (0, algorithm_1.tree_nodeLength)(node))
+            throw new DOMException_1.IndexSizeError();
+        /**
+         * 4. If (node, offset) is before start or after end, return false.
+         */
+        const bp = [node, offset];
+        if ((0, algorithm_1.boundaryPoint_position)(bp, this._start) === interfaces_1.BoundaryPosition.Before ||
+            (0, algorithm_1.boundaryPoint_position)(bp, this._end) === interfaces_1.BoundaryPosition.After) {
+            return false;
+        }
+        /**
+         * 5. Return true.
+         */
+        return true;
+    }
+    /** @inheritdoc */
+    comparePoint(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 ((0, algorithm_1.tree_rootNode)(node) !== (0, algorithm_1.range_root)(this))
+            throw new DOMException_1.WrongDocumentError();
+        if (util_1.Guard.isDocumentTypeNode(node))
+            throw new DOMException_1.InvalidNodeTypeError();
+        if (offset > (0, 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.
+         */
+        const bp = [node, offset];
+        if ((0, algorithm_1.boundaryPoint_position)(bp, this._start) === interfaces_1.BoundaryPosition.Before) {
+            return -1;
+        }
+        else if ((0, algorithm_1.boundaryPoint_position)(bp, this._end) === interfaces_1.BoundaryPosition.After) {
+            return 1;
+        }
+        else {
+            return 0;
+        }
+    }
+    /** @inheritdoc */
+    intersectsNode(node) {
+        /**
+         * 1. If node’s root is different from the context object’s root, return false.
+         */
+        if ((0, algorithm_1.tree_rootNode)(node) !== (0, algorithm_1.range_root)(this)) {
+            return false;
+        }
+        /**
+         * 2. Let parent be node’s parent.
+         * 3. If parent is null, return true.
+         */
+        const parent = node._parent;
+        if (parent === null)
+            return true;
+        /**
+         * 4. Let offset be node’s index.
+         */
+        const offset = (0, algorithm_1.tree_index)(node);
+        /**
+         * 5. If (parent, offset) is before end and (parent, offset plus 1) is
+         * after start, return true.
+         */
+        if ((0, algorithm_1.boundaryPoint_position)([parent, offset], this._end) === interfaces_1.BoundaryPosition.Before &&
+            (0, algorithm_1.boundaryPoint_position)([parent, offset + 1], this._start) === interfaces_1.BoundaryPosition.After) {
+            return true;
+        }
+        /**
+         * 6. Return false.
+         */
+        return false;
+    }
+    toString() {
+        /**
+         * 1. Let s be the empty string.
+         */
+        let 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);
+        }
+        /**
+         * 4. Append the concatenation of the data of all Text nodes that are
+         * contained in the context object, in tree order, to s.
+         */
+        for (const child of (0, algorithm_1.range_getContainedNodes)(this)) {
+            if (util_1.Guard.isTextNode(child)) {
+                s += child._data;
+            }
+        }
+        /**
+         * 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
+     */
+    static _create(start, end) {
+        const range = new RangeImpl();
+        if (start)
+            range._start = start;
+        if (end)
+            range._end = end;
+        return range;
+    }
+}
+exports.RangeImpl = RangeImpl;
+/**
+ * Define constants on prototype.
+ */
+(0, WebIDLAlgorithm_1.idl_defineConst)(RangeImpl.prototype, "START_TO_START", 0);
+(0, WebIDLAlgorithm_1.idl_defineConst)(RangeImpl.prototype, "START_TO_END", 1);
+(0, WebIDLAlgorithm_1.idl_defineConst)(RangeImpl.prototype, "END_TO_END", 2);
+(0, 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,uCAA+B;AAC/B,6CAGqB;AACrB,2DAAuD;AACvD,iDAGuB;AACvB,4CAOqB;AACrB,kEAA8D;AAC9D,kCAA+B;AAE/B;;GAEG;AACH,MAAa,SAAU,SAAQ,qCAAiB;IAE9C,MAAM,CAAC,cAAc,GAAG,CAAC,CAAA;IACzB,MAAM,CAAC,YAAY,GAAG,CAAC,CAAA;IACvB,MAAM,CAAC,UAAU,GAAG,CAAC,CAAA;IACrB,MAAM,CAAC,YAAY,GAAG,CAAC,CAAA;IAEvB,cAAc,GAAG,CAAC,CAAA;IAClB,YAAY,GAAG,CAAC,CAAA;IAChB,UAAU,GAAG,CAAC,CAAA;IACd,YAAY,GAAG,CAAC,CAAA;IAEhB,MAAM,CAAe;IACrB,IAAI,CAAe;IAEnB;;OAEG;IACH;QACE,KAAK,EAAE,CAAA;QAEP;;;WAGG;QACH,MAAM,GAAG,GAAG,aAAG,CAAC,MAAM,CAAC,mBAAmB,CAAA;QAC1C,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACtB,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAEpB,aAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACzB,CAAC;IAED,kBAAkB;IAClB,IAAI,uBAAuB;QACzB;;;;;WAKG;QACH,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,CAAC,IAAA,6BAAiB,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,SAAS,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;YAC1C,CAAC;YACD,SAAS,GAAG,SAAS,CAAC,OAAO,CAAA;QAC/B,CAAC;QAED,OAAO,SAAS,CAAA;IAClB,CAAC;IAED,kBAAkB;IAClB,QAAQ,CAAC,IAAU,EAAE,MAAc;QACjC;;;WAGG;QACH,IAAA,6BAAiB,EAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;IACvC,CAAC;IAED,kBAAkB;IAClB,MAAM,CAAC,IAAU,EAAE,MAAc;QAC/B;;;WAGG;QACH,IAAA,2BAAe,EAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;IACrC,CAAC;IAED,kBAAkB;IAClB,cAAc,CAAC,IAAU;QACvB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,IAAA,6BAAiB,EAAC,IAAI,EAAE,MAAM,EAC5B,IAAA,sBAAU,EAAC,IAAI,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,aAAa,CAAC,IAAU;QACtB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,IAAA,6BAAiB,EAAC,IAAI,EAAE,MAAM,EAC5B,IAAA,sBAAU,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IACzB,CAAC;IAED,kBAAkB;IAClB,YAAY,CAAC,IAAU;QACrB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,IAAA,2BAAe,EAAC,IAAI,EAAE,MAAM,EAC1B,IAAA,sBAAU,EAAC,IAAI,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,WAAW,CAAC,IAAU;QACpB;;;;;WAKG;QACH,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QACzB,IAAI,MAAM,KAAK,IAAI;YACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,IAAA,2BAAe,EAAC,IAAI,EAAE,MAAM,EAC1B,IAAA,sBAAU,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IACzB,CAAC;IAED,kBAAkB;IAClB,QAAQ,CAAC,OAA6B;QACpC;;;WAGG;QACH,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACzB,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,UAAU,CAAC,IAAU;QACnB;;;WAGG;QACH,IAAA,wBAAY,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC1B,CAAC;IAED,kBAAkB;IAClB,kBAAkB,CAAC,IAAU;QAC3B;;;;;WAKG;QACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAElC,MAAM,MAAM,GAAG,IAAA,2BAAe,EAAC,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,qBAAqB,CAAC,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,IAAA,sBAAU,EAAC,IAAI,CAAC,KAAK,IAAA,sBAAU,EAAC,WAAW,CAAC;YAC9C,MAAM,IAAI,iCAAkB,EAAE,CAAA;QAEhC;;;;;;;;;;;;;;WAcG;QACH,IAAI,SAAwB,CAAA;QAC5B,IAAI,UAAyB,CAAA;QAE7B,QAAQ,GAAG,EAAE,CAAC;YACZ,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;QACjC,CAAC;QAED;;;;;;;;WAQG;QACH,MAAM,QAAQ,GAAG,IAAA,kCAAsB,EAAC,SAAS,EAAE,UAAU,CAAC,CAAA;QAE9D,IAAI,QAAQ,KAAK,6BAAgB,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,CAAC,CAAC,CAAA;QACX,CAAC;aAAM,IAAI,QAAQ,KAAK,6BAAgB,CAAC,KAAK,EAAE,CAAC;YAC/C,OAAO,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,cAAc;QACZ;;;;;WAKG;QACH,IAAI,IAAA,2BAAe,EAAC,IAAI,CAAC;YAAE,OAAM;QAEjC,MAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAA;QACzC,MAAM,mBAAmB,GAAG,IAAI,CAAC,YAAY,CAAA;QAC7C,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAA;QACrC,MAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAA;QAEzC;;;;;;WAMG;QACH,IAAI,iBAAiB,KAAK,eAAe;YACvC,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE,CAAC;YAC/C,IAAA,qCAAyB,EAAC,iBAAiB,EACzC,mBAAmB,EAAE,iBAAiB,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;YACnE,OAAM;QACR,CAAC;QAED;;;;WAIG;QACH,MAAM,aAAa,GAAW,EAAE,CAAA;QAChC,KAAK,MAAM,IAAI,IAAI,IAAA,mCAAuB,EAAC,IAAI,CAAC,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;YAC3B,IAAI,MAAM,KAAK,IAAI,IAAI,IAAA,6BAAiB,EAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvD,SAAQ;YACV,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC1B,CAAC;QAED,IAAI,OAAa,CAAA;QACjB,IAAI,SAAiB,CAAA;QAErB,IAAI,IAAA,6BAAiB,EAAC,eAAe,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,CAAC;YAChE;;;;eAIG;YACH,OAAO,GAAG,iBAAiB,CAAA;YAC3B,SAAS,GAAG,mBAAmB,CAAA;QACjC,CAAC;aAAM,CAAC;YACN;;;;;;;eAOG;YACH,IAAI,aAAa,GAAG,iBAAiB,CAAA;YACrC,OAAO,aAAa,CAAC,OAAO,KAAK,IAAI;gBACnC,CAAC,IAAA,6BAAiB,EAAC,eAAe,EAAE,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;gBACnE,aAAa,GAAG,aAAa,CAAC,OAAO,CAAA;YACvC,CAAC;YACD,0BAA0B;YAC1B,IAAI,aAAa,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;gBACnC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;YACzC,CAAC;YACD,OAAO,GAAG,aAAa,CAAC,OAAO,CAAA;YAC/B,SAAS,GAAG,IAAA,sBAAU,EAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QAC3C,CAAC;QAED;;;;;WAKG;QACH,IAAI,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE,CAAC;YACjD,IAAA,qCAAyB,EAAC,iBAAiB,EACzC,mBAAmB,EACnB,IAAA,2BAAe,EAAC,iBAAiB,CAAC,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;QACjE,CAAC;QAED;;;WAGG;QACH,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,0BAA0B;YAC1B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,IAAA,2BAAe,EAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAA;YACrC,CAAC;QACH,CAAC;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,mBAAmB,CAAC,eAAe,CAAC,EAAE,CAAC;YAC/C,IAAA,qCAAyB,EAAC,eAAe,EACvC,CAAC,EAAE,iBAAiB,EAAE,EAAE,CAAC,CAAA;QAC7B,CAAC;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,eAAe;QACb;;;WAGG;QACH,OAAO,IAAA,yBAAa,EAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;IAED,kBAAkB;IAClB,aAAa;QACX;;;WAGG;QACH,OAAO,IAAA,kCAAsB,EAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED,kBAAkB;IAClB,UAAU,CAAC,IAAU;QACnB;;;WAGG;QACH,OAAO,IAAA,wBAAY,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,kBAAkB;IAClB,gBAAgB,CAAC,SAAe;QAC9B;;;WAGG;QACH,KAAK,MAAM,IAAI,IAAI,IAAA,4CAAgC,EAAC,IAAI,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,gCAAiB,EAAE,CAAA;YAC/B,CAAC;QACH,CAAC;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,CAAC;YAC1C,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAClC,CAAC;QAED;;WAEG;QACH,MAAM,QAAQ,GAAG,IAAA,yBAAa,EAAC,IAAI,CAAC,CAAA;QAEpC;;WAEG;QACH,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrC,IAAA,+BAAmB,EAAC,IAAI,EAAE,SAAS,CAAC,CAAA;QACtC,CAAC;QAED;;;WAGG;QACH,IAAA,wBAAY,EAAC,SAAS,EAAE,IAAI,CAAC,CAAA;QAC7B,IAAA,2BAAe,EAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;QAEpC;;WAEG;QACH,IAAA,wBAAY,EAAC,SAAS,EAAE,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED,kBAAkB;IAClB,UAAU;QACR;;;WAGG;QACH,OAAO,IAAA,wBAAY,EAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7C,CAAC;IAED,kBAAkB;IAClB,MAAM;QACJ;;;;WAIG;QACH,aAAG,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;IAED,kBAAkB;IAClB,cAAc,CAAC,IAAU,EAAE,MAAc;QACvC;;WAEG;QACH,IAAI,IAAA,yBAAa,EAAC,IAAI,CAAC,KAAK,IAAA,sBAAU,EAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,KAAK,CAAA;QACd,CAAC;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAChC,MAAM,IAAI,mCAAoB,EAAE,CAAA;QAClC,IAAI,MAAM,GAAG,IAAA,2BAAe,EAAC,IAAI,CAAC;YAChC,MAAM,IAAI,6BAAc,EAAE,CAAA;QAE5B;;WAEG;QACH,MAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACxC,IAAI,IAAA,kCAAsB,EAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,MAAM;YACrE,IAAA,kCAAsB,EAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE,CAAC;YACnE,OAAO,KAAK,CAAA;QACd,CAAC;QAED;;WAEG;QACH,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kBAAkB;IAClB,YAAY,CAAC,IAAU,EAAE,MAAc;QACrC;;;;;;WAMG;QACH,IAAI,IAAA,yBAAa,EAAC,IAAI,CAAC,KAAK,IAAA,sBAAU,EAAC,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,IAAA,2BAAe,EAAC,IAAI,CAAC;YAChC,MAAM,IAAI,6BAAc,EAAE,CAAA;QAE5B;;;;WAIG;QACH,MAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACxC,IAAI,IAAA,kCAAsB,EAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,MAAM,EAAE,CAAC;YACxE,OAAO,CAAC,CAAC,CAAA;QACX,CAAC;aAAM,IAAI,IAAA,kCAAsB,EAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE,CAAC;YAC5E,OAAO,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,cAAc,CAAC,IAAU;QACvB;;WAEG;QACH,IAAI,IAAA,yBAAa,EAAC,IAAI,CAAC,KAAK,IAAA,sBAAU,EAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,KAAK,CAAA;QACd,CAAC;QAED;;;WAGG;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QAC3B,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAEhC;;WAEG;QACH,MAAM,MAAM,GAAG,IAAA,sBAAU,EAAC,IAAI,CAAC,CAAA;QAE/B;;;WAGG;QACH,IAAI,IAAA,kCAAsB,EAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,MAAM;YACjF,IAAA,kCAAsB,EAAC,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE,CAAC;YACvF,OAAO,IAAI,CAAA;QACb,CAAC;QAED;;WAEG;QACH,OAAO,KAAK,CAAA;IACd,CAAC;IAED,QAAQ;QACN;;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,CAAC;YAC3E,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QAC5E,CAAC;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACtC,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACzD,CAAC;QAED;;;WAGG;QACH,KAAK,MAAM,KAAK,IAAI,IAAA,mCAAuB,EAAC,IAAI,CAAC,EAAE,CAAC;YAClD,IAAI,YAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,CAAC,IAAI,KAAK,CAAC,KAAK,CAAA;YAClB,CAAC;QACH,CAAC;QAED;;;;WAIG;QACH,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QACxD,CAAC;QAED;;WAEG;QACH,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,OAAO,CAAC,KAAqB,EAAE,GAAmB;QACvD,MAAM,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;;AA/mBH,8BAgnBC;AAED;;GAEG;AACH,IAAA,iCAAe,EAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAA;AACzD,IAAA,iCAAe,EAAC,SAAS,CAAC,SAAS,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA;AACvD,IAAA,iCAAe,EAAC,SAAS,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,CAAA;AACrD,IAAA,iCAAe,EAAC,SAAS,CAAC,SAAS,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA"}

package/node_modules/@oozcitak/dom/lib/dom/ShadowRootImpl.d.ts

@@ -0,0 +1,33 @@
+import { Element, ShadowRootMode, Event, EventTarget, ShadowRoot, Document } from "./interfaces";
+import { DocumentFragmentImpl } from "./DocumentFragmentImpl";
+/**
+ * Represents a shadow root.
+ */
+export declare class ShadowRootImpl extends DocumentFragmentImpl implements ShadowRoot {
+    _host: Element;
+    _mode: ShadowRootMode;
+    /**
+     * Initializes a new instance of `ShadowRoot`.
+     *
+     * @param host - shadow root's host element
+     * @param mode - shadow root's mode
+     */
+    private constructor();
+    /** @inheritdoc */
+    get mode(): ShadowRootMode;
+    /** @inheritdoc */
+    get host(): Element;
+    /**
+     * Gets the parent event target for the given event.
+     *
+     * @param event - an event
+     */
+    _getTheParent(event: Event): EventTarget | null;
+    /**
+     * Creates a new `ShadowRoot`.
+     *
+     * @param document - owner document
+     * @param host - shadow root's host element
+     */
+    static _create(document: Document, host: Element): ShadowRootImpl;
+}