@dooboostore/dom-parser 1.0.1 → 1.0.3

package/dist/cjs/node/NodeIterator.js

@@ -17,30 +17,9 @@ var __copyProps = (to, from, except, desc) => {
 var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
 var NodeIterator_exports = {};
 __export(NodeIterator_exports, {
-  NodeFilter: () => NodeFilter,
   NodeIterator: () => NodeIterator
 });
 module.exports = __toCommonJS(NodeIterator_exports);
-const NodeFilter = {
-  // Constants for acceptNode return values
-  FILTER_ACCEPT: 1,
-  FILTER_REJECT: 2,
-  FILTER_SKIP: 3,
-  // Constants for whatToShow
-  SHOW_ALL: 4294967295,
-  SHOW_ELEMENT: 1,
-  SHOW_ATTRIBUTE: 2,
-  SHOW_TEXT: 4,
-  SHOW_CDATA_SECTION: 8,
-  SHOW_ENTITY_REFERENCE: 16,
-  SHOW_ENTITY: 32,
-  SHOW_PROCESSING_INSTRUCTION: 64,
-  SHOW_COMMENT: 128,
-  SHOW_DOCUMENT: 256,
-  SHOW_DOCUMENT_TYPE: 512,
-  SHOW_DOCUMENT_FRAGMENT: 1024,
-  SHOW_NOTATION: 2048
-};
 class NodeIterator {
   constructor(root, whatToShow = NodeFilter.SHOW_ALL, filter = null) {
     this._beforeReferenceNode = true;
@@ -137,14 +116,8 @@ class NodeIterator {
     }
     return null;
   }
-  /**
-   * Detach the iterator (no-op in this implementation)
-   */
   detach() {
   }
-  /**
-   * Check if a node should be accepted based on whatToShow and filter
-   */
   _acceptNode(node) {
     if (!node) {
       return false;
@@ -154,7 +127,7 @@ class NodeIterator {
       return false;
     }
     if (this._filter) {
-      const result = this._filter.acceptNode(node);
+      const result = "acceptNode" in this._filter ? this._filter.acceptNode(node) : this._filter(node);
       return result === NodeFilter.FILTER_ACCEPT;
     }
     return true;

package/dist/cjs/node/NodeIterator.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/NodeIterator.ts"],
-  "sourcesContent": ["import { Node } from './Node';\nimport { NodeBase } from './NodeBase';\n\n/**\n * NodeFilter interface for filtering nodes in NodeIterator\n */\nexport interface NodeFilter {\n    acceptNode(node: Node): number;\n}\n\n/**\n * NodeFilter constants\n */\nexport const NodeFilter = {\n    // Constants for acceptNode return values\n    FILTER_ACCEPT: 1,\n    FILTER_REJECT: 2,\n    FILTER_SKIP: 3,\n    \n    // Constants for whatToShow\n    SHOW_ALL: 0xFFFFFFFF,\n    SHOW_ELEMENT: 0x1,\n    SHOW_ATTRIBUTE: 0x2,\n    SHOW_TEXT: 0x4,\n    SHOW_CDATA_SECTION: 0x8,\n    SHOW_ENTITY_REFERENCE: 0x10,\n    SHOW_ENTITY: 0x20,\n    SHOW_PROCESSING_INSTRUCTION: 0x40,\n    SHOW_COMMENT: 0x80,\n    SHOW_DOCUMENT: 0x100,\n    SHOW_DOCUMENT_TYPE: 0x200,\n    SHOW_DOCUMENT_FRAGMENT: 0x400,\n    SHOW_NOTATION: 0x800\n};\n\n/**\n * NodeIterator implementation for traversing DOM nodes\n */\nexport class NodeIterator {\n    private _root: Node;\n    private _whatToShow: number;\n    private _filter: NodeFilter | null;\n    private _currentNode: Node;\n    private _beforeReferenceNode: boolean = true;\n\n    constructor(root: Node, whatToShow: number = NodeFilter.SHOW_ALL, filter: NodeFilter | null = null) {\n        this._root = root;\n        this._whatToShow = whatToShow;\n        this._filter = filter;\n        this._currentNode = root;\n    }\n\n    get root(): Node {\n        return this._root;\n    }\n\n    get whatToShow(): number {\n        return this._whatToShow;\n    }\n\n    get filter(): NodeFilter | null {\n        return this._filter;\n    }\n\n    get referenceNode(): Node {\n        return this._currentNode;\n    }\n\n    get pointerBeforeReferenceNode(): boolean {\n        return this._beforeReferenceNode;\n    }\n\n    /**\n     * Move to the next node in document order\n     */\n    nextNode(): Node | null {\n        let node = this._currentNode;\n        \n        // If we're before the reference node, start from the reference node\n        if (this._beforeReferenceNode) {\n            this._beforeReferenceNode = false;\n            if (this._acceptNode(node)) {\n                return node;\n            }\n        }\n\n        // Traverse in document order\n        while (node) {\n            // First, try to go to first child\n            const firstChild = (node as any).firstChild;\n            if (firstChild) {\n                node = firstChild;\n                if (this._acceptNode(node)) {\n                    this._currentNode = node;\n                    return node;\n                }\n                continue;\n            }\n\n            // If no children, try next sibling\n            while (node && !(node as any).nextSibling) {\n                node = (node as any).parentNode;\n                // Don't go beyond root\n                if (!node || node === (this._root as any).parentNode) {\n                    return null;\n                }\n            }\n\n            if (!node) {\n                return null;\n            }\n\n            node = (node as any).nextSibling;\n            if (this._acceptNode(node)) {\n                this._currentNode = node;\n                return node;\n            }\n        }\n\n        return null;\n    }\n\n    /**\n     * Move to the previous node in document order\n     */\n    previousNode(): Node | null {\n        let node = this._currentNode;\n\n        // If we're after the reference node, start from the reference node\n        if (!this._beforeReferenceNode) {\n            this._beforeReferenceNode = true;\n            if (this._acceptNode(node)) {\n                return node;\n            }\n        }\n\n        // Traverse in reverse document order\n        while (node && node !== this._root) {\n            // Try previous sibling\n            const prevSibling = (node as any).previousSibling;\n            if (prevSibling) {\n                node = prevSibling;\n                \n                // Go to the deepest last child\n                while ((node as any).lastChild) {\n                    node = (node as any).lastChild;\n                }\n                \n                if (this._acceptNode(node)) {\n                    this._currentNode = node;\n                    return node;\n                }\n                continue;\n            }\n\n            // Go to parent\n            node = (node as any).parentNode;\n            if (!node || node === (this._root as any).parentNode) {\n                return null;\n            }\n\n            if (this._acceptNode(node)) {\n                this._currentNode = node;\n                return node;\n            }\n        }\n\n        return null;\n    }\n\n    /**\n     * Detach the iterator (no-op in this implementation)\n     */\n    detach(): void {\n        // Modern browsers don't require this, but we implement for compatibility\n    }\n\n    /**\n     * Check if a node should be accepted based on whatToShow and filter\n     */\n    private _acceptNode(node: Node | null): boolean {\n        if (!node) {\n            return false;\n        }\n\n        // Check whatToShow filter\n        const nodeTypeMask = 1 << (node.nodeType - 1);\n        if (!(this._whatToShow & nodeTypeMask)) {\n            return false;\n        }\n\n        // Check custom filter\n        if (this._filter) {\n            const result = this._filter.acceptNode(node);\n            return result === NodeFilter.FILTER_ACCEPT;\n        }\n\n        return true;\n    }\n}"],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaO,MAAM,aAAa;AAAA;AAAA,EAEtB,eAAe;AAAA,EACf,eAAe;AAAA,EACf,aAAa;AAAA;AAAA,EAGb,UAAU;AAAA,EACV,cAAc;AAAA,EACd,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,oBAAoB;AAAA,EACpB,uBAAuB;AAAA,EACvB,aAAa;AAAA,EACb,6BAA6B;AAAA,EAC7B,cAAc;AAAA,EACd,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,wBAAwB;AAAA,EACxB,eAAe;AACnB;AAKO,MAAM,aAAa;AAAA,EAOtB,YAAY,MAAY,aAAqB,WAAW,UAAU,SAA4B,MAAM;AAFpG,SAAQ,uBAAgC;AAGpC,SAAK,QAAQ;AACb,SAAK,cAAc;AACnB,SAAK,UAAU;AACf,SAAK,eAAe;AAAA,EACxB;AAAA,EAEA,IAAI,OAAa;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,aAAqB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,SAA4B;AAC5B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,gBAAsB;AACtB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,6BAAsC;AACtC,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,WAAwB;AACpB,QAAI,OAAO,KAAK;AAGhB,QAAI,KAAK,sBAAsB;AAC3B,WAAK,uBAAuB;AAC5B,UAAI,KAAK,YAAY,IAAI,GAAG;AACxB,eAAO;AAAA,MACX;AAAA,IACJ;AAGA,WAAO,MAAM;AAET,YAAM,aAAc,KAAa;AACjC,UAAI,YAAY;AACZ,eAAO;AACP,YAAI,KAAK,YAAY,IAAI,GAAG;AACxB,eAAK,eAAe;AACpB,iBAAO;AAAA,QACX;AACA;AAAA,MACJ;AAGA,aAAO,QAAQ,CAAE,KAAa,aAAa;AACvC,eAAQ,KAAa;AAErB,YAAI,CAAC,QAAQ,SAAU,KAAK,MAAc,YAAY;AAClD,iBAAO;AAAA,QACX;AAAA,MACJ;AAEA,UAAI,CAAC,MAAM;AACP,eAAO;AAAA,MACX;AAEA,aAAQ,KAAa;AACrB,UAAI,KAAK,YAAY,IAAI,GAAG;AACxB,aAAK,eAAe;AACpB,eAAO;AAAA,MACX;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,eAA4B;AACxB,QAAI,OAAO,KAAK;AAGhB,QAAI,CAAC,KAAK,sBAAsB;AAC5B,WAAK,uBAAuB;AAC5B,UAAI,KAAK,YAAY,IAAI,GAAG;AACxB,eAAO;AAAA,MACX;AAAA,IACJ;AAGA,WAAO,QAAQ,SAAS,KAAK,OAAO;AAEhC,YAAM,cAAe,KAAa;AAClC,UAAI,aAAa;AACb,eAAO;AAGP,eAAQ,KAAa,WAAW;AAC5B,iBAAQ,KAAa;AAAA,QACzB;AAEA,YAAI,KAAK,YAAY,IAAI,GAAG;AACxB,eAAK,eAAe;AACpB,iBAAO;AAAA,QACX;AACA;AAAA,MACJ;AAGA,aAAQ,KAAa;AACrB,UAAI,CAAC,QAAQ,SAAU,KAAK,MAAc,YAAY;AAClD,eAAO;AAAA,MACX;AAEA,UAAI,KAAK,YAAY,IAAI,GAAG;AACxB,aAAK,eAAe;AACpB,eAAO;AAAA,MACX;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,SAAe;AAAA,EAEf;AAAA;AAAA;AAAA;AAAA,EAKQ,YAAY,MAA4B;AAC5C,QAAI,CAAC,MAAM;AACP,aAAO;AAAA,IACX;AAGA,UAAM,eAAe,KAAM,KAAK,WAAW;AAC3C,QAAI,EAAE,KAAK,cAAc,eAAe;AACpC,aAAO;AAAA,IACX;AAGA,QAAI,KAAK,SAAS;AACd,YAAM,SAAS,KAAK,QAAQ,WAAW,IAAI;AAC3C,aAAO,WAAW,WAAW;AAAA,IACjC;AAEA,WAAO;AAAA,EACX;AACJ;",
+  "sourcesContent": ["\n/**\n * NodeIterator implementation for traversing DOM nodes\n */\nexport class NodeIterator {\n  private _root: Node;\n  private _whatToShow: number;\n  private _filter: NodeFilter | null;\n  private _currentNode: Node;\n  private _beforeReferenceNode: boolean = true;\n\n  constructor(root: Node, whatToShow: number = NodeFilter.SHOW_ALL, filter: NodeFilter | null = null) {\n    this._root = root;\n    this._whatToShow = whatToShow;\n    this._filter = filter;\n    this._currentNode = root;\n  }\n\n  get root(): Node {\n    return this._root;\n  }\n\n  get whatToShow(): number {\n    return this._whatToShow;\n  }\n\n  get filter(): NodeFilter | null {\n    return this._filter;\n  }\n\n  get referenceNode(): Node {\n    return this._currentNode;\n  }\n\n  get pointerBeforeReferenceNode(): boolean {\n    return this._beforeReferenceNode;\n  }\n\n  /**\n   * Move to the next node in document order\n   */\n  nextNode(): Node | null {\n    let node = this._currentNode;\n\n    if (this._beforeReferenceNode) {\n      this._beforeReferenceNode = false;\n      if (this._acceptNode(node)) {\n        return node;\n      }\n    }\n\n    while (node) {\n      const firstChild = (node as any).firstChild;\n      if (firstChild) {\n        node = firstChild;\n        if (this._acceptNode(node)) {\n          this._currentNode = node;\n          return node;\n        }\n        continue;\n      }\n\n      while (node && !(node as any).nextSibling) {\n        node = (node as any).parentNode;\n        if (!node || node === (this._root as any).parentNode) {\n          return null;\n        }\n      }\n\n      if (!node) {\n        return null;\n      }\n\n      node = (node as any).nextSibling;\n      if (this._acceptNode(node)) {\n        this._currentNode = node;\n        return node;\n      }\n    }\n\n    return null;\n  }\n\n  /**\n   * Move to the previous node in document order\n   */\n  previousNode(): Node | null {\n    let node = this._currentNode;\n\n    if (!this._beforeReferenceNode) {\n      this._beforeReferenceNode = true;\n      if (this._acceptNode(node)) {\n        return node;\n      }\n    }\n\n    while (node && node !== this._root) {\n      const prevSibling = (node as any).previousSibling;\n      if (prevSibling) {\n        node = prevSibling;\n        while ((node as any).lastChild) {\n          node = (node as any).lastChild;\n        }\n\n        if (this._acceptNode(node)) {\n          this._currentNode = node;\n          return node;\n        }\n        continue;\n      }\n\n      node = (node as any).parentNode;\n      if (!node || node === (this._root as any).parentNode) {\n        return null;\n      }\n\n      if (this._acceptNode(node)) {\n        this._currentNode = node;\n        return node;\n      }\n    }\n\n    return null;\n  }\n\n  detach(): void {}\n\n  private _acceptNode(node: Node | null): boolean {\n    if (!node) {\n      return false;\n    }\n\n    const nodeTypeMask = 1 << (node.nodeType - 1);\n    if (!(this._whatToShow & nodeTypeMask)) {\n      return false;\n    }\n\n    if (this._filter) {\n      const result = ('acceptNode' in this._filter) ? this._filter.acceptNode(node) : this._filter(node);\n      return result === NodeFilter.FILTER_ACCEPT;\n    }\n\n    return true;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAIO,MAAM,aAAa;AAAA,EAOxB,YAAY,MAAY,aAAqB,WAAW,UAAU,SAA4B,MAAM;AAFpG,SAAQ,uBAAgC;AAGtC,SAAK,QAAQ;AACb,SAAK,cAAc;AACnB,SAAK,UAAU;AACf,SAAK,eAAe;AAAA,EACtB;AAAA,EAEA,IAAI,OAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,aAAqB;AACvB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAA4B;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,gBAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,6BAAsC;AACxC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,WAAwB;AACtB,QAAI,OAAO,KAAK;AAEhB,QAAI,KAAK,sBAAsB;AAC7B,WAAK,uBAAuB;AAC5B,UAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,MAAM;AACX,YAAM,aAAc,KAAa;AACjC,UAAI,YAAY;AACd,eAAO;AACP,YAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,eAAK,eAAe;AACpB,iBAAO;AAAA,QACT;AACA;AAAA,MACF;AAEA,aAAO,QAAQ,CAAE,KAAa,aAAa;AACzC,eAAQ,KAAa;AACrB,YAAI,CAAC,QAAQ,SAAU,KAAK,MAAc,YAAY;AACpD,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AAEA,aAAQ,KAAa;AACrB,UAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,eAA4B;AAC1B,QAAI,OAAO,KAAK;AAEhB,QAAI,CAAC,KAAK,sBAAsB;AAC9B,WAAK,uBAAuB;AAC5B,UAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,QAAQ,SAAS,KAAK,OAAO;AAClC,YAAM,cAAe,KAAa;AAClC,UAAI,aAAa;AACf,eAAO;AACP,eAAQ,KAAa,WAAW;AAC9B,iBAAQ,KAAa;AAAA,QACvB;AAEA,YAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,eAAK,eAAe;AACpB,iBAAO;AAAA,QACT;AACA;AAAA,MACF;AAEA,aAAQ,KAAa;AACrB,UAAI,CAAC,QAAQ,SAAU,KAAK,MAAc,YAAY;AACpD,eAAO;AAAA,MACT;AAEA,UAAI,KAAK,YAAY,IAAI,GAAG;AAC1B,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SAAe;AAAA,EAAC;AAAA,EAER,YAAY,MAA4B;AAC9C,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AAEA,UAAM,eAAe,KAAM,KAAK,WAAW;AAC3C,QAAI,EAAE,KAAK,cAAc,eAAe;AACtC,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,SAAS;AAChB,YAAM,SAAU,gBAAgB,KAAK,UAAW,KAAK,QAAQ,WAAW,IAAI,IAAI,KAAK,QAAQ,IAAI;AACjG,aAAO,WAAW,WAAW;AAAA,IAC/B;AAEA,WAAO;AAAA,EACT;AACF;",
   "names": []
 }

package/dist/cjs/node/ParentNode.js

@@ -1,16 +1 @@
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var ParentNode_exports = {};
-module.exports = __toCommonJS(ParentNode_exports);
 //# sourceMappingURL=ParentNode.js.map

package/dist/cjs/node/ParentNode.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/node/ParentNode.ts"],
-  "sourcesContent": ["import { Node } from './Node';\nimport { NodeListOf } from './collection/NodeListOf';\nimport { HTMLCollection } from './collection/HTMLCollection';\nimport { Element } from './elements/Element';\nimport {HTMLElementDeprecatedTagNameMap, HTMLElementTagNameMap, MathMLElementTagNameMap, SVGElementTagNameMap} from \"./elements\";\n\n/**\n * The **`ParentNode`** interface contains methods and properties that are common to all types of Node objects that can have children.\n * \n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/ParentNode)\n */\nexport interface ParentNode extends Node {\n    /**\n     * Returns the number of child elements of this ParentNode.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/childElementCount)\n     */\n    readonly childElementCount: number;\n\n    /**\n     * Returns the child elements.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/children)\n     */\n    readonly children: HTMLCollection;\n\n    /**\n     * Returns the first child that is an element, and null otherwise.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/firstElementChild)\n     */\n    readonly firstElementChild: Element | null;\n\n    /**\n     * Returns the last child that is an element, and null otherwise.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/lastElementChild)\n     */\n    readonly lastElementChild: Element | null;\n\n    /**\n     * Inserts nodes after the last child of node, while replacing strings in nodes with equivalent Text nodes.\n     *\n     * Throws a \"HierarchyRequestError\" DOMException if the constraints of the node tree are violated.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/append)\n     */\n    append(...nodes: (Node | string)[]): void;\n\n    /**\n     * Inserts nodes before the first child of node, while replacing strings in nodes with equivalent Text nodes.\n     *\n     * Throws a \"HierarchyRequestError\" DOMException if the constraints of the node tree are violated.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/prepend)\n     */\n    prepend(...nodes: (Node | string)[]): void;\n\n    /**\n     * Returns the first element that is a descendant of node that matches selectors.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/querySelector)\n     */\n    querySelector<K extends keyof HTMLElementTagNameMap>(selectors: K): HTMLElementTagNameMap[K] | null;\n    querySelector<K extends keyof SVGElementTagNameMap>(selectors: K): SVGElementTagNameMap[K] | null;\n    querySelector<K extends keyof MathMLElementTagNameMap>(selectors: K): MathMLElementTagNameMap[K] | null;\n    /** @deprecated */\n    querySelector<K extends keyof HTMLElementDeprecatedTagNameMap>(selectors: K): HTMLElementDeprecatedTagNameMap[K] | null;\n    querySelector<E extends Element = Element>(selectors: string): E | null;\n    querySelector(selectors: string): Element | null;\n\n    /**\n     * Returns all element descendants of node that match selectors.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/querySelectorAll)\n     */\n    querySelectorAll<K extends keyof HTMLElementTagNameMap>(selectors: K): NodeListOf<HTMLElementTagNameMap[K]>;\n    querySelectorAll<K extends keyof SVGElementTagNameMap>(selectors: K): NodeListOf<SVGElementTagNameMap[K]>;\n    querySelectorAll<K extends keyof MathMLElementTagNameMap>(selectors: K): NodeListOf<MathMLElementTagNameMap[K]>;\n    /** @deprecated */\n    querySelectorAll<K extends keyof HTMLElementDeprecatedTagNameMap>(selectors: K): NodeListOf<HTMLElementDeprecatedTagNameMap[K]>;\n    querySelectorAll<E extends Element = Element>(selectors: string): NodeListOf<E>;\n    querySelectorAll(selectors: string): NodeListOf<Element>;\n\n    /**\n     * Replace all children of node with nodes, while replacing strings in nodes with equivalent Text nodes.\n     *\n     * Throws a \"HierarchyRequestError\" DOMException if the constraints of the node tree are violated.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Document/replaceChildren)\n     */\n    replaceChildren(...nodes: (Node | string)[]): void;\n}"],
-  "mappings": ";;;;;;;;;;;;;AAAA;AAAA;",
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
   "names": []
 }

package/dist/cjs/node/ParentNodeBase.js

@@ -21,9 +21,9 @@ __export(ParentNodeBase_exports, {
 });
 module.exports = __toCommonJS(ParentNodeBase_exports);
 var import_ChildNodeBase = require("./ChildNodeBase");
-var import_HTMLCollection = require("./collection/HTMLCollection");
-var import_NodeListOf = require("./collection/NodeListOf");
-var import_Node2 = require("./Node");
+var import_HTMLCollectionImp = require("./collection/HTMLCollectionImp");
+var import_NodeListOfImp = require("./collection/NodeListOfImp");
+var import_Node = require("./Node");
 var import_TextBase = require("./TextBase");
 var import_CSSSelector = require("../utils/CSSSelector");
 class ParentNodeBase extends import_ChildNodeBase.ChildNodeBase {
@@ -31,7 +31,7 @@ class ParentNodeBase extends import_ChildNodeBase.ChildNodeBase {
   get childElementCount() {
     let count = 0;
     for (const child of this._childNodesInternal) {
-      if (child && child.nodeType === import_Node2.ELEMENT_NODE) {
+      if (child && child.nodeType === import_Node.ELEMENT_NODE) {
         count++;
       }
     }
@@ -40,15 +40,15 @@ class ParentNodeBase extends import_ChildNodeBase.ChildNodeBase {
   get children() {
     const elements = [];
     for (const child of this._childNodesInternal) {
-      if (child && child.nodeType === import_Node2.ELEMENT_NODE) {
+      if (child && child.nodeType === import_Node.ELEMENT_NODE) {
         elements.push(child);
       }
     }
-    return new import_HTMLCollection.HTMLCollection(elements);
+    return new import_HTMLCollectionImp.HTMLCollectionImp(elements);
   }
   get firstElementChild() {
     for (const child of this._childNodesInternal) {
-      if (child && child.nodeType === import_Node2.ELEMENT_NODE) {
+      if (child && child.nodeType === import_Node.ELEMENT_NODE) {
         return child;
       }
     }
@@ -57,7 +57,7 @@ class ParentNodeBase extends import_ChildNodeBase.ChildNodeBase {
   get lastElementChild() {
     for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {
       const child = this._childNodesInternal[i];
-      if (child && child.nodeType === import_Node2.ELEMENT_NODE) {
+      if (child && child.nodeType === import_Node.ELEMENT_NODE) {
         return child;
       }
     }
@@ -114,12 +114,12 @@ class ParentNodeBase extends import_ChildNodeBase.ChildNodeBase {
         uniqueResults.push(element);
       }
     }
-    return new import_NodeListOf.NodeListOf(uniqueResults);
+    return new import_NodeListOfImp.NodeListOfImp(uniqueResults);
   }
   // Private helper methods for querySelector
   _querySelectorAllRecursive(selectors, results) {
     for (const child of this._childNodesInternal) {
-      if (child && child.nodeType === import_Node2.ELEMENT_NODE) {
+      if (child && child.nodeType === import_Node.ELEMENT_NODE) {
         const element = child;
         if (import_CSSSelector.CSSSelector.matches(element, selectors)) {
           results.push(element);

package/dist/cjs/node/ParentNodeBase.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/ParentNodeBase.ts"],
-  "sourcesContent": ["import { Node } from './Node';\nimport { ChildNodeBase } from './ChildNodeBase';\nimport { ParentNode } from './ParentNode';\nimport { Element } from './elements/Element';\nimport { HTMLCollection } from './collection/HTMLCollection';\nimport { NodeListOf } from './collection/NodeListOf';\nimport { ELEMENT_NODE, TEXT_NODE } from './Node';\nimport { TextBase } from './TextBase';\nimport { CSSSelector } from '../utils/CSSSelector';\n\n/**\n * Base implementation of the ParentNode interface\n */\nexport abstract class ParentNodeBase extends ChildNodeBase implements ParentNode {\n\n    // ParentNode interface implementation\n    get childElementCount(): number {\n        let count = 0;\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                count++;\n            }\n        }\n        return count;\n    }\n\n    get children(): HTMLCollection {\n        const elements: Element[] = [];\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                elements.push(child as unknown as Element);\n            }\n        }\n        return new HTMLCollection(elements);\n    }\n\n    get firstElementChild(): Element | null {\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                return child as unknown as Element;\n            }\n        }\n        return null;\n    }\n\n    get lastElementChild(): Element | null {\n        for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {\n            const child = this._childNodesInternal[i];\n            if (child && child.nodeType === ELEMENT_NODE) {\n                return child as unknown as Element;\n            }\n        }\n        return null;\n    }\n\n    append(...nodes: (Node | string)[]): void {\n        for (const node of nodes) {\n            if (typeof node === 'string') {\n                const textNode = new TextBase(node, this._ownerDocument);\n                this.appendChild(textNode);\n            } else {\n                this.appendChild(node);\n            }\n        }\n    }\n\n    prepend(...nodes: (Node | string)[]): void {\n        const firstChild = this.firstChild;\n        for (const node of nodes) {\n            if (typeof node === 'string') {\n                const textNode = new TextBase(node, this._ownerDocument);\n                this.insertBefore(textNode, firstChild);\n            } else {\n                this.insertBefore(node, firstChild);\n            }\n        }\n    }\n\n    replaceChildren(...nodes: (Node | string)[]): void {\n        // Remove all existing children\n        while (this._childNodesInternal.length > 0) {\n            const child = this._childNodesInternal[0];\n            if (child) {\n                this.removeChild(child);\n            }\n        }\n\n        // Add new nodes\n        this.append(...nodes);\n    }\n\n    // Query selector implementation\n    querySelector<E extends Element>(selectors: string): E | null {\n        const elements = this.querySelectorAll(selectors);\n        return elements.length > 0 ? elements.item(0) as E: null;\n    }\n\n    querySelectorAll<E extends Element = Element>(selectors: string): NodeListOf<E> {\n        const results: E[] = [];\n        \n        // Split selectors by comma and process each one\n        const selectorList = selectors.split(',').map(s => s.trim());\n        \n        for (const selector of selectorList) {\n            if (selector) {\n                this._querySelectorAllRecursive(selector, results);\n            }\n        }\n        \n        // Remove duplicates while preserving order\n        const uniqueResults: E[] = [];\n        const seen = new Set();\n        for (const element of results) {\n            if (!seen.has(element)) {\n                seen.add(element);\n                uniqueResults.push(element);\n            }\n        }\n        \n        return new NodeListOf<E>(uniqueResults);\n    }\n\n    // Private helper methods for querySelector\n    private _querySelectorAllRecursive(selectors: string, results: Element[]): void {\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                const element = child as unknown as Element;\n\n                // Check if this element matches the selector\n                if (CSSSelector.matches(element, selectors)) {\n                    results.push(element);\n                }\n\n                // Recursively search in child elements\n                if (child instanceof ParentNodeBase) {\n                    child._querySelectorAllRecursive(selectors, results);\n                }\n            }\n        }\n    }\n\n\n}\n\n// TextNode is now in a separate file"],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,2BAA8B;AAG9B,4BAA+B;AAC/B,wBAA2B;AAC3B,IAAAA,eAAwC;AACxC,sBAAyB;AACzB,yBAA4B;AAKrB,MAAe,uBAAuB,mCAAoC;AAAA;AAAA,EAG7E,IAAI,oBAA4B;AAC5B,QAAI,QAAQ;AACZ,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,2BAAc;AAC1C;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,IAAI,WAA2B;AAC3B,UAAM,WAAsB,CAAC;AAC7B,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,2BAAc;AAC1C,iBAAS,KAAK,KAA2B;AAAA,MAC7C;AAAA,IACJ;AACA,WAAO,IAAI,qCAAe,QAAQ;AAAA,EACtC;AAAA,EAEA,IAAI,oBAAoC;AACpC,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,2BAAc;AAC1C,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,IAAI,mBAAmC;AACnC,aAAS,IAAI,KAAK,oBAAoB,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3D,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,SAAS,MAAM,aAAa,2BAAc;AAC1C,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,UAAU,OAAgC;AACtC,eAAW,QAAQ,OAAO;AACtB,UAAI,OAAO,SAAS,UAAU;AAC1B,cAAM,WAAW,IAAI,yBAAS,MAAM,KAAK,cAAc;AACvD,aAAK,YAAY,QAAQ;AAAA,MAC7B,OAAO;AACH,aAAK,YAAY,IAAI;AAAA,MACzB;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,WAAW,OAAgC;AACvC,UAAM,aAAa,KAAK;AACxB,eAAW,QAAQ,OAAO;AACtB,UAAI,OAAO,SAAS,UAAU;AAC1B,cAAM,WAAW,IAAI,yBAAS,MAAM,KAAK,cAAc;AACvD,aAAK,aAAa,UAAU,UAAU;AAAA,MAC1C,OAAO;AACH,aAAK,aAAa,MAAM,UAAU;AAAA,MACtC;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,mBAAmB,OAAgC;AAE/C,WAAO,KAAK,oBAAoB,SAAS,GAAG;AACxC,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,OAAO;AACP,aAAK,YAAY,KAAK;AAAA,MAC1B;AAAA,IACJ;AAGA,SAAK,OAAO,GAAG,KAAK;AAAA,EACxB;AAAA;AAAA,EAGA,cAAiC,WAA6B;AAC1D,UAAM,WAAW,KAAK,iBAAiB,SAAS;AAChD,WAAO,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,IAAQ;AAAA,EACxD;AAAA,EAEA,iBAA8C,WAAkC;AAC5E,UAAM,UAAe,CAAC;AAGtB,UAAM,eAAe,UAAU,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAE3D,eAAW,YAAY,cAAc;AACjC,UAAI,UAAU;AACV,aAAK,2BAA2B,UAAU,OAAO;AAAA,MACrD;AAAA,IACJ;AAGA,UAAM,gBAAqB,CAAC;AAC5B,UAAM,OAAO,oBAAI,IAAI;AACrB,eAAW,WAAW,SAAS;AAC3B,UAAI,CAAC,KAAK,IAAI,OAAO,GAAG;AACpB,aAAK,IAAI,OAAO;AAChB,sBAAc,KAAK,OAAO;AAAA,MAC9B;AAAA,IACJ;AAEA,WAAO,IAAI,6BAAc,aAAa;AAAA,EAC1C;AAAA;AAAA,EAGQ,2BAA2B,WAAmB,SAA0B;AAC5E,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,2BAAc;AAC1C,cAAM,UAAU;AAGhB,YAAI,+BAAY,QAAQ,SAAS,SAAS,GAAG;AACzC,kBAAQ,KAAK,OAAO;AAAA,QACxB;AAGA,YAAI,iBAAiB,gBAAgB;AACjC,gBAAM,2BAA2B,WAAW,OAAO;AAAA,QACvD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAGJ;",
-  "names": ["import_Node"]
+  "sourcesContent": ["import { ChildNodeBase } from './ChildNodeBase';\nimport { HTMLCollectionImp } from './collection/HTMLCollectionImp';\nimport { NodeListOfImp } from './collection/NodeListOfImp';\nimport { ELEMENT_NODE, TEXT_NODE } from './Node';\nimport { TextBase } from './TextBase';\nimport { CSSSelector } from '../utils/CSSSelector';\n\n/**\n * Base implementation of the ParentNode interface\n */\nexport abstract class ParentNodeBase extends ChildNodeBase implements ParentNode {\n\n    // ParentNode interface implementation\n    get childElementCount(): number {\n        let count = 0;\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                count++;\n            }\n        }\n        return count;\n    }\n\n    get children(): HTMLCollection {\n        const elements: Element[] = [];\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                elements.push(child as unknown as Element);\n            }\n        }\n        return new HTMLCollectionImp(elements) as unknown as HTMLCollection;\n    }\n\n    get firstElementChild(): Element | null {\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                return child as unknown as Element;\n            }\n        }\n        return null;\n    }\n\n    get lastElementChild(): Element | null {\n        for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {\n            const child = this._childNodesInternal[i];\n            if (child && child.nodeType === ELEMENT_NODE) {\n                return child as unknown as Element;\n            }\n        }\n        return null;\n    }\n\n    append(...nodes: (Node | string)[]): void {\n        for (const node of nodes) {\n            if (typeof node === 'string') {\n                const textNode = new TextBase(node, this._ownerDocument);\n                this.appendChild(textNode as unknown as Node);\n            } else {\n                this.appendChild(node);\n            }\n        }\n    }\n\n    prepend(...nodes: (Node | string)[]): void {\n        const firstChild = this.firstChild;\n        for (const node of nodes) {\n            if (typeof node === 'string') {\n                const textNode = new TextBase(node, this._ownerDocument);\n                this.insertBefore(textNode as unknown as Node, firstChild);\n            } else {\n                this.insertBefore(node, firstChild);\n            }\n        }\n    }\n\n    replaceChildren(...nodes: (Node | string)[]): void {\n        // Remove all existing children\n        while (this._childNodesInternal.length > 0) {\n            const child = this._childNodesInternal[0];\n            if (child) {\n                this.removeChild(child as unknown as Node);\n            }\n        }\n\n        // Add new nodes\n        this.append(...nodes);\n    }\n\n    // Query selector implementation\n    querySelector<E extends Element>(selectors: string): E | null {\n        const elements = this.querySelectorAll(selectors);\n        return elements.length > 0 ? elements.item(0) as E: null;\n    }\n\n    querySelectorAll<E extends Element = Element>(selectors: string): NodeListOf<E> {\n        const results: E[] = [];\n        \n        // Split selectors by comma and process each one\n        const selectorList = selectors.split(',').map(s => s.trim());\n        \n        for (const selector of selectorList) {\n            if (selector) {\n                this._querySelectorAllRecursive(selector, results);\n            }\n        }\n        \n        // Remove duplicates while preserving order\n        const uniqueResults: E[] = [];\n        const seen = new Set();\n        for (const element of results) {\n            if (!seen.has(element)) {\n                seen.add(element);\n                uniqueResults.push(element);\n            }\n        }\n        \n        return new NodeListOfImp<E>(uniqueResults) as unknown as NodeListOf<E>;\n    }\n\n    // Private helper methods for querySelector\n    private _querySelectorAllRecursive(selectors: string, results: Element[]): void {\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) {\n                const element = child as unknown as Element;\n\n                // Check if this element matches the selector\n                if (CSSSelector.matches(element, selectors)) {\n                    results.push(element);\n                }\n\n                // Recursively search in child elements\n                if (child instanceof ParentNodeBase) {\n                    child._querySelectorAllRecursive(selectors, results);\n                }\n            }\n        }\n    }\n\n\n}\n\n// TextNode is now in a separate file"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAA8B;AAC9B,+BAAkC;AAClC,2BAA8B;AAC9B,kBAAwC;AACxC,sBAAyB;AACzB,yBAA4B;AAKrB,MAAe,uBAAuB,mCAAoC;AAAA;AAAA,EAG7E,IAAI,oBAA4B;AAC5B,QAAI,QAAQ;AACZ,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,0BAAc;AAC1C;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,IAAI,WAA2B;AAC3B,UAAM,WAAsB,CAAC;AAC7B,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,0BAAc;AAC1C,iBAAS,KAAK,KAA2B;AAAA,MAC7C;AAAA,IACJ;AACA,WAAO,IAAI,2CAAkB,QAAQ;AAAA,EACzC;AAAA,EAEA,IAAI,oBAAoC;AACpC,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,0BAAc;AAC1C,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,IAAI,mBAAmC;AACnC,aAAS,IAAI,KAAK,oBAAoB,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3D,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,SAAS,MAAM,aAAa,0BAAc;AAC1C,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,UAAU,OAAgC;AACtC,eAAW,QAAQ,OAAO;AACtB,UAAI,OAAO,SAAS,UAAU;AAC1B,cAAM,WAAW,IAAI,yBAAS,MAAM,KAAK,cAAc;AACvD,aAAK,YAAY,QAA2B;AAAA,MAChD,OAAO;AACH,aAAK,YAAY,IAAI;AAAA,MACzB;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,WAAW,OAAgC;AACvC,UAAM,aAAa,KAAK;AACxB,eAAW,QAAQ,OAAO;AACtB,UAAI,OAAO,SAAS,UAAU;AAC1B,cAAM,WAAW,IAAI,yBAAS,MAAM,KAAK,cAAc;AACvD,aAAK,aAAa,UAA6B,UAAU;AAAA,MAC7D,OAAO;AACH,aAAK,aAAa,MAAM,UAAU;AAAA,MACtC;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,mBAAmB,OAAgC;AAE/C,WAAO,KAAK,oBAAoB,SAAS,GAAG;AACxC,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,OAAO;AACP,aAAK,YAAY,KAAwB;AAAA,MAC7C;AAAA,IACJ;AAGA,SAAK,OAAO,GAAG,KAAK;AAAA,EACxB;AAAA;AAAA,EAGA,cAAiC,WAA6B;AAC1D,UAAM,WAAW,KAAK,iBAAiB,SAAS;AAChD,WAAO,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,IAAQ;AAAA,EACxD;AAAA,EAEA,iBAA8C,WAAkC;AAC5E,UAAM,UAAe,CAAC;AAGtB,UAAM,eAAe,UAAU,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAE3D,eAAW,YAAY,cAAc;AACjC,UAAI,UAAU;AACV,aAAK,2BAA2B,UAAU,OAAO;AAAA,MACrD;AAAA,IACJ;AAGA,UAAM,gBAAqB,CAAC;AAC5B,UAAM,OAAO,oBAAI,IAAI;AACrB,eAAW,WAAW,SAAS;AAC3B,UAAI,CAAC,KAAK,IAAI,OAAO,GAAG;AACpB,aAAK,IAAI,OAAO;AAChB,sBAAc,KAAK,OAAO;AAAA,MAC9B;AAAA,IACJ;AAEA,WAAO,IAAI,mCAAiB,aAAa;AAAA,EAC7C;AAAA;AAAA,EAGQ,2BAA2B,WAAmB,SAA0B;AAC5E,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,0BAAc;AAC1C,cAAM,UAAU;AAGhB,YAAI,+BAAY,QAAQ,SAAS,SAAS,GAAG;AACzC,kBAAQ,KAAK,OAAO;AAAA,QACxB;AAGA,YAAI,iBAAiB,gBAAgB;AACjC,gBAAM,2BAA2B,WAAW,OAAO;AAAA,QACvD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAGJ;",
+  "names": []
 }

package/dist/cjs/node/ShadowRootBase.js

@@ -0,0 +1,79 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var ShadowRootBase_exports = {};
+__export(ShadowRootBase_exports, {
+  ShadowRootBase: () => ShadowRootBase
+});
+module.exports = __toCommonJS(ShadowRootBase_exports);
+var import_DocumentFragmentBase = require("./DocumentFragmentBase");
+class ShadowRootBase extends import_DocumentFragmentBase.DocumentFragmentBase {
+  constructor(host, init, ownerDocument) {
+    super(ownerDocument);
+    this._host = host;
+    this.mode = init.mode;
+    this.delegatesFocus = init.delegatesFocus || false;
+    this.slotAssignment = init.slotAssignment || "manual";
+    this.nodeName = "#shadow-root";
+  }
+  getHTML(options) {
+    throw new Error("Method not implemented.");
+  }
+  setHTMLUnsafe(html) {
+    throw new Error("Method not implemented.");
+  }
+  elementFromPoint(x, y) {
+    throw new Error("Method not implemented.");
+  }
+  elementsFromPoint(x, y) {
+    throw new Error("Method not implemented.");
+  }
+  getAnimations() {
+    throw new Error("Method not implemented.");
+  }
+  get host() {
+    return this._host;
+  }
+  /**
+   * innerHTML for ShadowRoot
+   */
+  get innerHTML() {
+    let html = "";
+    for (const child of this._childNodesInternal) {
+      if (child.nodeType === 3) {
+        html += child._nodeValue || "";
+      } else if (child.nodeType === 1) {
+        html += this._host.generateChildElementHTML(child);
+      } else if (child.nodeType === 8) {
+        html += `<!--${child.textContent || ""}-->`;
+      }
+    }
+    return html;
+  }
+  set innerHTML(value) {
+    while (this._childNodesInternal.length > 0) {
+      const child = this._childNodesInternal[0];
+      if (child) {
+        this.removeChild(child);
+      }
+    }
+    if (value.trim()) {
+      this._host.parseAndAppendHTML(value, this);
+    }
+  }
+}
+//# sourceMappingURL=ShadowRootBase.js.map

package/dist/cjs/node/ShadowRootBase.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/node/ShadowRootBase.ts"],
+  "sourcesContent": ["import { DocumentFragmentBase } from './DocumentFragmentBase';\n\n/**\n * The **`ShadowRoot`** interface represents the root node of a shadow DOM subtree.\n */\n// @ts-ignore\nexport class ShadowRootBase extends DocumentFragmentBase implements ShadowRoot {\n  public readonly delegatesFocus: boolean;\n  public readonly mode: ShadowRootMode;\n  public readonly slotAssignment: SlotAssignmentMode;\n  private _host: Element;\n\n  constructor(host: Element, init: { mode: ShadowRootMode; delegatesFocus?: boolean; slotAssignment?: SlotAssignmentMode }, ownerDocument?: Document) {\n    super(ownerDocument);\n    this._host = host;\n    this.mode = init.mode;\n    this.delegatesFocus = init.delegatesFocus || false;\n    this.slotAssignment = init.slotAssignment || 'manual';\n\n    // Set nodeName to '#shadow-root'\n    (this as any).nodeName = '#shadow-root';\n  }\n\n  clonable: boolean;\n    onslotchange: (this: ShadowRoot, ev: Event) => any;\n    serializable: boolean;\n    getHTML(options?: GetHTMLOptions): string {\n        throw new Error(\"Method not implemented.\");\n    }\n    setHTMLUnsafe(html: string): void {\n        throw new Error(\"Method not implemented.\");\n    }\n    activeElement: Element;\n    adoptedStyleSheets: CSSStyleSheet[];\n    fullscreenElement: Element;\n    pictureInPictureElement: Element;\n    pointerLockElement: Element;\n    styleSheets: StyleSheetList;\n    elementFromPoint(x: number, y: number): Element | null {\n        throw new Error(\"Method not implemented.\");\n    }\n    elementsFromPoint(x: number, y: number): Element[] {\n        throw new Error(\"Method not implemented.\");\n    }\n    getAnimations(): Animation[] {\n        throw new Error(\"Method not implemented.\");\n    }\n\n  get host(): Element {\n    return this._host;\n  }\n\n  /**\n   * innerHTML for ShadowRoot\n   */\n  get innerHTML(): string {\n    let html = '';\n    for (const child of this._childNodesInternal) {\n      if ((child as any).nodeType === 3) {\n        // TEXT_NODE\n        html += (child as any)._nodeValue || '';\n      } else if ((child as any).nodeType === 1) {\n        // ELEMENT_NODE\n        html += (this._host as any).generateChildElementHTML(child as any);\n      } else if ((child as any).nodeType === 8) {\n        // COMMENT_NODE\n        html += `<!--${(child as any).textContent || ''}-->`;\n      }\n    }\n    return html;\n  }\n\n  set innerHTML(value: string) {\n    // Clear existing children\n    while (this._childNodesInternal.length > 0) {\n      const child = this._childNodesInternal[0];\n      if (child) {\n        this.removeChild(child as unknown as Node);\n      }\n    }\n\n    // Parse HTML and create child nodes\n    if (value.trim()) {\n      (this._host as any).parseAndAppendHTML(value, this);\n    }\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kCAAqC;AAM9B,MAAM,uBAAuB,iDAA2C;AAAA,EAM7E,YAAY,MAAe,MAA+F,eAA0B;AAClJ,UAAM,aAAa;AACnB,SAAK,QAAQ;AACb,SAAK,OAAO,KAAK;AACjB,SAAK,iBAAiB,KAAK,kBAAkB;AAC7C,SAAK,iBAAiB,KAAK,kBAAkB;AAG7C,IAAC,KAAa,WAAW;AAAA,EAC3B;AAAA,EAKE,QAAQ,SAAkC;AACtC,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAAA,EACA,cAAc,MAAoB;AAC9B,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAAA,EAOA,iBAAiB,GAAW,GAA2B;AACnD,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAAA,EACA,kBAAkB,GAAW,GAAsB;AAC/C,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAAA,EACA,gBAA6B;AACzB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAAA,EAEF,IAAI,OAAgB;AAClB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,YAAoB;AACtB,QAAI,OAAO;AACX,eAAW,SAAS,KAAK,qBAAqB;AAC5C,UAAK,MAAc,aAAa,GAAG;AAEjC,gBAAS,MAAc,cAAc;AAAA,MACvC,WAAY,MAAc,aAAa,GAAG;AAExC,gBAAS,KAAK,MAAc,yBAAyB,KAAY;AAAA,MACnE,WAAY,MAAc,aAAa,GAAG;AAExC,gBAAQ,OAAQ,MAAc,eAAe,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,UAAU,OAAe;AAE3B,WAAO,KAAK,oBAAoB,SAAS,GAAG;AAC1C,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,OAAO;AACT,aAAK,YAAY,KAAwB;AAAA,MAC3C;AAAA,IACF;AAGA,QAAI,MAAM,KAAK,GAAG;AAChB,MAAC,KAAK,MAAc,mBAAmB,OAAO,IAAI;AAAA,IACpD;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/cjs/node/Text.js

@@ -1,16 +1 @@
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var Text_exports = {};
-module.exports = __toCommonJS(Text_exports);
 //# sourceMappingURL=Text.js.map

package/dist/cjs/node/Text.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/node/Text.ts"],
-  "sourcesContent": ["import { CharacterData } from './CharacterData';\nimport { ChildNode } from './ChildNode';\nimport {TEXT_NODE} from \"./Node\";\n\n/**\n * The **`Text`** interface represents a text node in the DOM.\n * \n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Text)\n */\nexport interface Text extends CharacterData, ChildNode {\n    readonly nodeType: typeof TEXT_NODE; // TEXT_NODE\n    readonly nodeName: '#text';\n    \n    /**\n     * The **`Text.splitText()`** method breaks the Text node into two nodes at the specified offset, keeping both nodes in the tree as siblings.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Text/splitText)\n     */\n    splitText(offset: number): Text;\n    \n    /**\n     * The **`Text.wholeText`** read-only property returns the full text of all Text nodes logically adjacent to the node.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Text/wholeText)\n     */\n    readonly wholeText: string;\n}\n\n// Note: TextBase is the implementation class for this interface\n\n"],
-  "mappings": ";;;;;;;;;;;;;AAAA;AAAA;",
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
   "names": []
 }

package/dist/cjs/node/TextBase.js

@@ -25,9 +25,6 @@ var import_Node = require("./Node");
 class TextBase extends import_ChildNodeBase.ChildNodeBase {
   constructor(data, ownerDocument) {
     super(import_Node.TEXT_NODE, "#text", ownerDocument);
-    // Override nodeType to match Text interface
-    this.nodeType = import_Node.TEXT_NODE;
-    this.nodeName = "#text";
     this._data = data;
     this._nodeValue = data;
   }

package/dist/cjs/node/TextBase.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/TextBase.ts"],
-  "sourcesContent": ["import { ChildNodeBase } from './ChildNodeBase';\nimport { TEXT_NODE } from './Node';\nimport { Text } from './Text';\n\n/**\n * The **`TextBase`** class represents a text node implementation in the DOM.\n */\nexport class TextBase extends ChildNodeBase implements Text {\n    private _data: string;\n    \n    // Override nodeType to match Text interface\n    readonly nodeType: 3 = TEXT_NODE as 3;\n    readonly nodeName: '#text' = '#text';\n\n    constructor(data: string, ownerDocument?: any) {\n        super(TEXT_NODE, '#text', ownerDocument);\n        this._data = data;\n        this._nodeValue = data;\n    }\n\n    get data(): string {\n        return this._data;\n    }\n\n    set data(value: string) {\n        this._data = value;\n        this._nodeValue = value;\n    }\n\n    get length(): number {\n        return this._data.length;\n    }\n\n    get textContent(): string | null {\n        // Decode HTML entities to return original text\n        return this._data ? this.decodeHTMLEntities(this._data) : this._data;\n    }\n\n    set textContent(value: string | null) {\n        this._data = value || '';\n        this._nodeValue = this._data;\n    }\n\n    get wholeText(): string {\n        // For now, just return the current text\n        // In a full implementation, this would collect adjacent text nodes\n        return this._data;\n    }\n\n    // CharacterData methods\n    appendData(data: string): void {\n        this._data += data;\n        this._nodeValue = this._data;\n    }\n\n    deleteData(offset: number, count: number): void {\n        if (offset < 0 || offset > this._data.length) {\n            throw new Error('Index out of bounds');\n        }\n        const endOffset = Math.min(offset + count, this._data.length);\n        this._data = this._data.slice(0, offset) + this._data.slice(endOffset);\n        this._nodeValue = this._data;\n    }\n\n    insertData(offset: number, data: string): void {\n        if (offset < 0 || offset > this._data.length) {\n            throw new Error('Index out of bounds');\n        }\n        this._data = this._data.slice(0, offset) + data + this._data.slice(offset);\n        this._nodeValue = this._data;\n    }\n\n    replaceData(offset: number, count: number, data: string): void {\n        this.deleteData(offset, count);\n        this.insertData(offset, data);\n    }\n\n    substringData(offset: number, count: number): string {\n        if (offset < 0 || offset > this._data.length) {\n            throw new Error('Index out of bounds');\n        }\n        const endOffset = Math.min(offset + count, this._data.length);\n        return this._data.slice(offset, endOffset);\n    }\n\n    splitText(offset: number): Text {\n        if (offset < 0 || offset > this._data.length) {\n            throw new Error('Index out of bounds');\n        }\n\n        const newData = this._data.slice(offset);\n        this._data = this._data.slice(0, offset);\n        this._nodeValue = this._data;\n\n        const newTextNode = new TextBase(newData, this._ownerDocument);\n\n        // Insert the new text node after this one\n        if (this._parentNodeInternal) {\n            const nextSibling = this.nextSibling;\n            this._parentNodeInternal.insertBefore(newTextNode, nextSibling);\n        }\n\n        return newTextNode as Text;\n    }\n\n    cloneNode(deep?: boolean): Text {\n        return new TextBase(this._data, this._ownerDocument) as Text;\n    }\n\n    toString(): string {\n        return this._data;\n    }\n}"],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAA8B;AAC9B,kBAA0B;AAMnB,MAAM,iBAAiB,mCAA8B;AAAA,EAOxD,YAAY,MAAc,eAAqB;AAC3C,UAAM,uBAAW,SAAS,aAAa;AAJ3C;AAAA,SAAS,WAAc;AACvB,SAAS,WAAoB;AAIzB,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,IAAI,OAAe;AACf,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,KAAK,OAAe;AACpB,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,IAAI,SAAiB;AACjB,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,IAAI,cAA6B;AAE7B,WAAO,KAAK,QAAQ,KAAK,mBAAmB,KAAK,KAAK,IAAI,KAAK;AAAA,EACnE;AAAA,EAEA,IAAI,YAAY,OAAsB;AAClC,SAAK,QAAQ,SAAS;AACtB,SAAK,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,IAAI,YAAoB;AAGpB,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA,EAGA,WAAW,MAAoB;AAC3B,SAAK,SAAS;AACd,SAAK,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,WAAW,QAAgB,OAAqB;AAC5C,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC1C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AACA,UAAM,YAAY,KAAK,IAAI,SAAS,OAAO,KAAK,MAAM,MAAM;AAC5D,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS;AACrE,SAAK,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,WAAW,QAAgB,MAAoB;AAC3C,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC1C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AACA,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,IAAI,OAAO,KAAK,MAAM,MAAM,MAAM;AACzE,SAAK,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,YAAY,QAAgB,OAAe,MAAoB;AAC3D,SAAK,WAAW,QAAQ,KAAK;AAC7B,SAAK,WAAW,QAAQ,IAAI;AAAA,EAChC;AAAA,EAEA,cAAc,QAAgB,OAAuB;AACjD,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC1C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AACA,UAAM,YAAY,KAAK,IAAI,SAAS,OAAO,KAAK,MAAM,MAAM;AAC5D,WAAO,KAAK,MAAM,MAAM,QAAQ,SAAS;AAAA,EAC7C;AAAA,EAEA,UAAU,QAAsB;AAC5B,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC1C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AAEA,UAAM,UAAU,KAAK,MAAM,MAAM,MAAM;AACvC,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM;AACvC,SAAK,aAAa,KAAK;AAEvB,UAAM,cAAc,IAAI,SAAS,SAAS,KAAK,cAAc;AAG7D,QAAI,KAAK,qBAAqB;AAC1B,YAAM,cAAc,KAAK;AACzB,WAAK,oBAAoB,aAAa,aAAa,WAAW;AAAA,IAClE;AAEA,WAAO;AAAA,EACX;AAAA,EAEA,UAAU,MAAsB;AAC5B,WAAO,IAAI,SAAS,KAAK,OAAO,KAAK,cAAc;AAAA,EACvD;AAAA,EAEA,WAAmB;AACf,WAAO,KAAK;AAAA,EAChB;AACJ;",
+  "sourcesContent": ["import { ChildNodeBase } from './ChildNodeBase';\nimport { TEXT_NODE } from './Node';\n\n/**\n * The **`TextBase`** class represents a text node implementation in the DOM.\n */\nexport class TextBase extends ChildNodeBase implements Text {\n  private _data: string;\n\n  declare nodeType: 3;\n  declare nodeName: '#text';\n\n  constructor(data: string, ownerDocument?: any) {\n    super(TEXT_NODE, '#text', ownerDocument);\n    this._data = data;\n    this._nodeValue = data;\n  }\n\n  get data(): string {\n    return this._data;\n  }\n\n  set data(value: string) {\n    this._data = value;\n    this._nodeValue = value;\n  }\n\n  get length(): number {\n    return this._data.length;\n  }\n\n  get textContent(): string | null {\n    // Decode HTML entities to return original text\n    return this._data ? this.decodeHTMLEntities(this._data) : this._data;\n  }\n\n  set textContent(value: string | null) {\n    this._data = value || '';\n    this._nodeValue = this._data;\n  }\n\n  get wholeText(): string {\n    // For now, just return the current text\n    // In a full implementation, this would collect adjacent text nodes\n    return this._data;\n  }\n\n  // CharacterData methods\n  appendData(data: string): void {\n    this._data += data;\n    this._nodeValue = this._data;\n  }\n\n  deleteData(offset: number, count: number): void {\n    if (offset < 0 || offset > this._data.length) {\n      throw new Error('Index out of bounds');\n    }\n    const endOffset = Math.min(offset + count, this._data.length);\n    this._data = this._data.slice(0, offset) + this._data.slice(endOffset);\n    this._nodeValue = this._data;\n  }\n\n  insertData(offset: number, data: string): void {\n    if (offset < 0 || offset > this._data.length) {\n      throw new Error('Index out of bounds');\n    }\n    this._data = this._data.slice(0, offset) + data + this._data.slice(offset);\n    this._nodeValue = this._data;\n  }\n\n  replaceData(offset: number, count: number, data: string): void {\n    this.deleteData(offset, count);\n    this.insertData(offset, data);\n  }\n\n  substringData(offset: number, count: number): string {\n    if (offset < 0 || offset > this._data.length) {\n      throw new Error('Index out of bounds');\n    }\n    const endOffset = Math.min(offset + count, this._data.length);\n    return this._data.slice(offset, endOffset);\n  }\n\n  splitText(offset: number): Text {\n    if (offset < 0 || offset > this._data.length) {\n      throw new Error('Index out of bounds');\n    }\n\n    const newData = this._data.slice(offset);\n    this._data = this._data.slice(0, offset);\n    this._nodeValue = this._data;\n\n    const newTextNode = new TextBase(newData, this._ownerDocument);\n\n    // Insert the new text node after this one\n    if (this._parentNodeInternal) {\n      const nextSibling = this.nextSibling;\n      this._parentNodeInternal.insertBefore(newTextNode, nextSibling);\n    }\n\n    return newTextNode as Text;\n  }\n\n  cloneNode(deep?: boolean): Text {\n    return new TextBase(this._data, this._ownerDocument) as Text;\n  }\n\n  toString(): string {\n    return this._data;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAA8B;AAC9B,kBAA0B;AAKnB,MAAM,iBAAiB,mCAA8B;AAAA,EAM1D,YAAY,MAAc,eAAqB;AAC7C,UAAM,uBAAW,SAAS,aAAa;AACvC,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,KAAK,OAAe;AACtB,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,IAAI,SAAiB;AACnB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,IAAI,cAA6B;AAE/B,WAAO,KAAK,QAAQ,KAAK,mBAAmB,KAAK,KAAK,IAAI,KAAK;AAAA,EACjE;AAAA,EAEA,IAAI,YAAY,OAAsB;AACpC,SAAK,QAAQ,SAAS;AACtB,SAAK,aAAa,KAAK;AAAA,EACzB;AAAA,EAEA,IAAI,YAAoB;AAGtB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,WAAW,MAAoB;AAC7B,SAAK,SAAS;AACd,SAAK,aAAa,KAAK;AAAA,EACzB;AAAA,EAEA,WAAW,QAAgB,OAAqB;AAC9C,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC5C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AACA,UAAM,YAAY,KAAK,IAAI,SAAS,OAAO,KAAK,MAAM,MAAM;AAC5D,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS;AACrE,SAAK,aAAa,KAAK;AAAA,EACzB;AAAA,EAEA,WAAW,QAAgB,MAAoB;AAC7C,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC5C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AACA,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,IAAI,OAAO,KAAK,MAAM,MAAM,MAAM;AACzE,SAAK,aAAa,KAAK;AAAA,EACzB;AAAA,EAEA,YAAY,QAAgB,OAAe,MAAoB;AAC7D,SAAK,WAAW,QAAQ,KAAK;AAC7B,SAAK,WAAW,QAAQ,IAAI;AAAA,EAC9B;AAAA,EAEA,cAAc,QAAgB,OAAuB;AACnD,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC5C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AACA,UAAM,YAAY,KAAK,IAAI,SAAS,OAAO,KAAK,MAAM,MAAM;AAC5D,WAAO,KAAK,MAAM,MAAM,QAAQ,SAAS;AAAA,EAC3C;AAAA,EAEA,UAAU,QAAsB;AAC9B,QAAI,SAAS,KAAK,SAAS,KAAK,MAAM,QAAQ;AAC5C,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AAEA,UAAM,UAAU,KAAK,MAAM,MAAM,MAAM;AACvC,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM;AACvC,SAAK,aAAa,KAAK;AAEvB,UAAM,cAAc,IAAI,SAAS,SAAS,KAAK,cAAc;AAG7D,QAAI,KAAK,qBAAqB;AAC5B,YAAM,cAAc,KAAK;AACzB,WAAK,oBAAoB,aAAa,aAAa,WAAW;AAAA,IAChE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,MAAsB;AAC9B,WAAO,IAAI,SAAS,KAAK,OAAO,KAAK,cAAc;AAAA,EACrD;AAAA,EAEA,WAAmB;AACjB,WAAO,KAAK;AAAA,EACd;AACF;",
   "names": []
 }