@dooboostore/dom-parser 1.0.2 → 1.0.3

package/dist/esm/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": "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": "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/esm/node/ParentNodeBase.js

@@ -1,6 +1,6 @@
 import { ChildNodeBase } from "./ChildNodeBase.js";
-import { HTMLCollection } from "./collection/HTMLCollection.js";
-import { NodeListOf } from "./collection/NodeListOf.js";
+import { HTMLCollectionImp } from "./collection/HTMLCollectionImp.js";
+import { NodeListOfImp } from "./collection/NodeListOfImp.js";
 import { ELEMENT_NODE } from "./Node.js";
 import { TextBase } from "./TextBase.js";
 import { CSSSelector } from "../utils/CSSSelector.js";
@@ -22,7 +22,7 @@ class ParentNodeBase extends ChildNodeBase {
         elements.push(child);
       }
     }
-    return new HTMLCollection(elements);
+    return new HTMLCollectionImp(elements);
   }
   get firstElementChild() {
     for (const child of this._childNodesInternal) {
@@ -92,7 +92,7 @@ class ParentNodeBase extends ChildNodeBase {
         uniqueResults.push(element);
       }
     }
-    return new NodeListOf(uniqueResults);
+    return new NodeListOfImp(uniqueResults);
   }
   // Private helper methods for querySelector
   _querySelectorAllRecursive(selectors, results) {

package/dist/esm/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": "AACA,SAAS,qBAAqB;AAG9B,SAAS,sBAAsB;AAC/B,SAAS,kBAAkB;AAC3B,SAAS,oBAA+B;AACxC,SAAS,gBAAgB;AACzB,SAAS,mBAAmB;AAKrB,MAAe,uBAAuB,cAAoC;AAAA;AAAA,EAG7E,IAAI,oBAA4B;AAC5B,QAAI,QAAQ;AACZ,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;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,cAAc;AAC1C,iBAAS,KAAK,KAA2B;AAAA,MAC7C;AAAA,IACJ;AACA,WAAO,IAAI,eAAe,QAAQ;AAAA,EACtC;AAAA,EAEA,IAAI,oBAAoC;AACpC,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;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,cAAc;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,SAAS,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,SAAS,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,WAAc,aAAa;AAAA,EAC1C;AAAA;AAAA,EAGQ,2BAA2B,WAAmB,SAA0B;AAC5E,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;AAC1C,cAAM,UAAU;AAGhB,YAAI,YAAY,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;",
+  "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,SAAS,qBAAqB;AAC9B,SAAS,yBAAyB;AAClC,SAAS,qBAAqB;AAC9B,SAAS,oBAA+B;AACxC,SAAS,gBAAgB;AACzB,SAAS,mBAAmB;AAKrB,MAAe,uBAAuB,cAAoC;AAAA;AAAA,EAG7E,IAAI,oBAA4B;AAC5B,QAAI,QAAQ;AACZ,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;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,cAAc;AAC1C,iBAAS,KAAK,KAA2B;AAAA,MAC7C;AAAA,IACJ;AACA,WAAO,IAAI,kBAAkB,QAAQ;AAAA,EACzC;AAAA,EAEA,IAAI,oBAAoC;AACpC,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;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,cAAc;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,SAAS,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,SAAS,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,cAAiB,aAAa;AAAA,EAC7C;AAAA;AAAA,EAGQ,2BAA2B,WAAmB,SAA0B;AAC5E,eAAW,SAAS,KAAK,qBAAqB;AAC1C,UAAI,SAAS,MAAM,aAAa,cAAc;AAC1C,cAAM,UAAU;AAGhB,YAAI,YAAY,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/esm/node/ShadowRootBase.js

@@ -0,0 +1,60 @@
+import { DocumentFragmentBase } from "./DocumentFragmentBase.js";
+class ShadowRootBase extends 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);
+    }
+  }
+}
+export {
+  ShadowRootBase
+};
+//# sourceMappingURL=ShadowRootBase.js.map

package/dist/esm/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,SAAS,4BAA4B;AAM9B,MAAM,uBAAuB,qBAA2C;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/esm/node/TextBase.js

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

package/dist/esm/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,SAAS,qBAAqB;AAC9B,SAAS,iBAAiB;AAMnB,MAAM,iBAAiB,cAA8B;AAAA,EAOxD,YAAY,MAAc,eAAqB;AAC3C,UAAM,WAAW,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,SAAS,qBAAqB;AAC9B,SAAS,iBAAiB;AAKnB,MAAM,iBAAiB,cAA8B;AAAA,EAM1D,YAAY,MAAc,eAAqB;AAC7C,UAAM,WAAW,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": []
 }

package/dist/esm/node/TreeWalker.js

@@ -0,0 +1,253 @@
+import { NodeFilter } from "./NodeFilter.js";
+class TreeWalker {
+  constructor(root, whatToShow = NodeFilter.SHOW_ALL, filter = null) {
+    this._root = root;
+    this._whatToShow = whatToShow;
+    this._filter = filter;
+    this._currentNode = root;
+  }
+  get root() {
+    return this._root;
+  }
+  get whatToShow() {
+    return this._whatToShow;
+  }
+  get filter() {
+    return this._filter;
+  }
+  get currentNode() {
+    return this._currentNode;
+  }
+  set currentNode(node) {
+    this._currentNode = node;
+  }
+  /**
+   * Move to the parent node
+   */
+  parentNode() {
+    let node = this._currentNode;
+    while (node && node !== this._root) {
+      node = node.parentNode;
+      if (node && this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {
+        this._currentNode = node;
+        return node;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the first child node
+   */
+  firstChild() {
+    let node = this._currentNode.firstChild;
+    while (node) {
+      const result = this._acceptNode(node);
+      if (result === NodeFilter.FILTER_ACCEPT) {
+        this._currentNode = node;
+        return node;
+      }
+      if (result === NodeFilter.FILTER_SKIP) {
+        const child = node.firstChild;
+        if (child) {
+          node = child;
+          continue;
+        }
+      }
+      while (node) {
+        const next = node.nextSibling;
+        if (next) {
+          node = next;
+          break;
+        }
+        const parent = node.parentNode;
+        if (!parent || parent === this._root || parent === this._currentNode) {
+          return null;
+        }
+        node = parent;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the last child node
+   */
+  lastChild() {
+    let node = this._currentNode.lastChild;
+    while (node) {
+      const result = this._acceptNode(node);
+      if (result === NodeFilter.FILTER_ACCEPT) {
+        this._currentNode = node;
+        return node;
+      }
+      if (result === NodeFilter.FILTER_SKIP) {
+        const child = node.lastChild;
+        if (child) {
+          node = child;
+          continue;
+        }
+      }
+      while (node) {
+        const prev = node.previousSibling;
+        if (prev) {
+          node = prev;
+          break;
+        }
+        const parent = node.parentNode;
+        if (!parent || parent === this._root || parent === this._currentNode) {
+          return null;
+        }
+        node = parent;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the previous sibling node
+   */
+  previousSibling() {
+    let node = this._currentNode;
+    if (node === this._root) return null;
+    while (node) {
+      let sibling = node.previousSibling;
+      while (sibling) {
+        const result = this._acceptNode(sibling);
+        if (result === NodeFilter.FILTER_ACCEPT) {
+          this._currentNode = sibling;
+          return sibling;
+        }
+        if (result === NodeFilter.FILTER_SKIP) {
+          const lastChild = sibling.lastChild;
+          if (lastChild) {
+            sibling = lastChild;
+            continue;
+          }
+        }
+        sibling = sibling.previousSibling;
+      }
+      node = node.parentNode;
+      if (!node || node === this._root || this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {
+        return null;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the next sibling node
+   */
+  nextSibling() {
+    let node = this._currentNode;
+    if (node === this._root) return null;
+    while (node) {
+      let sibling = node.nextSibling;
+      while (sibling) {
+        const result = this._acceptNode(sibling);
+        if (result === NodeFilter.FILTER_ACCEPT) {
+          this._currentNode = sibling;
+          return sibling;
+        }
+        if (result === NodeFilter.FILTER_SKIP) {
+          const firstChild = sibling.firstChild;
+          if (firstChild) {
+            sibling = firstChild;
+            continue;
+          }
+        }
+        sibling = sibling.nextSibling;
+      }
+      node = node.parentNode;
+      if (!node || node === this._root || this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {
+        return null;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the previous node in document order
+   */
+  previousNode() {
+    let node = this._currentNode;
+    while (node && node !== this._root) {
+      const sibling = node.previousSibling;
+      if (sibling) {
+        node = sibling;
+        while (true) {
+          const result = this._acceptNode(node);
+          if (result !== NodeFilter.FILTER_REJECT && node.lastChild) {
+            node = node.lastChild;
+          } else {
+            if (result === NodeFilter.FILTER_ACCEPT) {
+              this._currentNode = node;
+              return node;
+            }
+            break;
+          }
+        }
+        continue;
+      }
+      node = node.parentNode;
+      if (node) {
+        if (this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {
+          this._currentNode = node;
+          return node;
+        }
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the next node in document order
+   */
+  nextNode() {
+    let node = this._currentNode;
+    let result = NodeFilter.FILTER_ACCEPT;
+    while (true) {
+      if (result !== NodeFilter.FILTER_REJECT) {
+        const firstChild = node.firstChild;
+        if (firstChild) {
+          node = firstChild;
+          result = this._acceptNode(node);
+          if (result === NodeFilter.FILTER_ACCEPT) {
+            this._currentNode = node;
+            return node;
+          }
+          continue;
+        }
+      }
+      while (node) {
+        if (node === this._root) return null;
+        const nextSibling = node.nextSibling;
+        if (nextSibling) {
+          node = nextSibling;
+          break;
+        }
+        node = node.parentNode;
+      }
+      if (!node) return null;
+      result = this._acceptNode(node);
+      if (result === NodeFilter.FILTER_ACCEPT) {
+        this._currentNode = node;
+        return node;
+      }
+    }
+  }
+  /**
+   * Check node acceptance
+   */
+  _acceptNode(node) {
+    const nodeTypeMask = 1 << node.nodeType - 1;
+    if (!(this._whatToShow & nodeTypeMask)) {
+      return NodeFilter.FILTER_SKIP;
+    }
+    if (this._filter) {
+      if (typeof this._filter === "function") {
+        return this._filter(node);
+      }
+      return this._filter.acceptNode(node);
+    }
+    return NodeFilter.FILTER_ACCEPT;
+  }
+}
+export {
+  TreeWalker
+};
+//# sourceMappingURL=TreeWalker.js.map

package/dist/esm/node/TreeWalker.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/node/TreeWalker.ts"],
+  "sourcesContent": ["import {NodeFilter} from \"./NodeFilter\";\n\n/**\n * TreeWalker implementation for traversing DOM nodes\n */\nexport class TreeWalker {\n  private _root: Node;\n  private _whatToShow: number;\n  private _filter: NodeFilter | null;\n  private _currentNode: Node;\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 currentNode(): Node {\n    return this._currentNode;\n  }\n\n  set currentNode(node: Node) {\n    this._currentNode = node;\n  }\n\n  /**\n   * Move to the parent node\n   */\n  parentNode(): Node | null {\n    let node = this._currentNode;\n    while (node && node !== this._root) {\n      node = (node as any).parentNode;\n      if (node && this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {\n        this._currentNode = node;\n        return node;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Move to the first child node\n   */\n  firstChild(): Node | null {\n    let node = (this._currentNode as any).firstChild;\n    while (node) {\n      const result = this._acceptNode(node);\n      if (result === NodeFilter.FILTER_ACCEPT) {\n        this._currentNode = node;\n        return node;\n      }\n      if (result === NodeFilter.FILTER_SKIP) {\n        const child = (node as any).firstChild;\n        if (child) {\n          node = child;\n          continue;\n        }\n      }\n      while (node) {\n        const next = (node as any).nextSibling;\n        if (next) {\n          node = next;\n          break;\n        }\n        const parent = (node as any).parentNode;\n        if (!parent || parent === this._root || parent === this._currentNode) {\n          return null;\n        }\n        node = parent;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Move to the last child node\n   */\n  lastChild(): Node | null {\n    let node = (this._currentNode as any).lastChild;\n    while (node) {\n      const result = this._acceptNode(node);\n      if (result === NodeFilter.FILTER_ACCEPT) {\n        this._currentNode = node;\n        return node;\n      }\n      if (result === NodeFilter.FILTER_SKIP) {\n        const child = (node as any).lastChild;\n        if (child) {\n          node = child;\n          continue;\n        }\n      }\n      while (node) {\n        const prev = (node as any).previousSibling;\n        if (prev) {\n          node = prev;\n          break;\n        }\n        const parent = (node as any).parentNode;\n        if (!parent || parent === this._root || parent === this._currentNode) {\n          return null;\n        }\n        node = parent;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Move to the previous sibling node\n   */\n  previousSibling(): Node | null {\n    let node = this._currentNode;\n    if (node === this._root) return null;\n\n    while (node) {\n      let sibling = (node as any).previousSibling;\n      while (sibling) {\n        const result = this._acceptNode(sibling);\n        if (result === NodeFilter.FILTER_ACCEPT) {\n          this._currentNode = sibling;\n          return sibling;\n        }\n        if (result === NodeFilter.FILTER_SKIP) {\n          const lastChild = (sibling as any).lastChild;\n          if (lastChild) {\n            sibling = lastChild;\n            continue;\n          }\n        }\n        sibling = (sibling as any).previousSibling;\n      }\n      node = (node as any).parentNode;\n      if (!node || node === this._root || this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {\n        return null;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Move to the next sibling node\n   */\n  nextSibling(): Node | null {\n    let node = this._currentNode;\n    if (node === this._root) return null;\n\n    while (node) {\n      let sibling = (node as any).nextSibling;\n      while (sibling) {\n        const result = this._acceptNode(sibling);\n        if (result === NodeFilter.FILTER_ACCEPT) {\n          this._currentNode = sibling;\n          return sibling;\n        }\n        if (result === NodeFilter.FILTER_SKIP) {\n          const firstChild = (sibling as any).firstChild;\n          if (firstChild) {\n            sibling = firstChild;\n            continue;\n          }\n        }\n        sibling = (sibling as any).nextSibling;\n      }\n      node = (node as any).parentNode;\n      if (!node || node === this._root || this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {\n        return null;\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    while (node && node !== this._root) {\n      const sibling = (node as any).previousSibling;\n      if (sibling) {\n        node = sibling;\n        while (true) {\n          const result = this._acceptNode(node);\n          if (result !== NodeFilter.FILTER_REJECT && (node as any).lastChild) {\n            node = (node as any).lastChild;\n          } else {\n            if (result === NodeFilter.FILTER_ACCEPT) {\n              this._currentNode = node;\n              return node;\n            }\n            break;\n          }\n        }\n        continue;\n      }\n\n      node = (node as any).parentNode;\n      if (node) {\n        if (this._acceptNode(node) === NodeFilter.FILTER_ACCEPT) {\n          this._currentNode = node;\n          return node;\n        }\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Move to the next node in document order\n   */\n  nextNode(): Node | null {\n    let node = this._currentNode;\n    let result = NodeFilter.FILTER_ACCEPT;\n\n    while (true) {\n      if (result !== NodeFilter.FILTER_REJECT) {\n        const firstChild = (node as any).firstChild;\n        if (firstChild) {\n          node = firstChild;\n          result = this._acceptNode(node);\n          if (result === NodeFilter.FILTER_ACCEPT) {\n            this._currentNode = node;\n            return node;\n          }\n          continue;\n        }\n      }\n\n      while (node) {\n        if (node === this._root) return null;\n        const nextSibling = (node as any).nextSibling;\n        if (nextSibling) {\n          node = nextSibling;\n          break;\n        }\n        node = (node as any).parentNode;\n      }\n\n      if (!node) return null;\n\n      result = this._acceptNode(node);\n      if (result === NodeFilter.FILTER_ACCEPT) {\n        this._currentNode = node;\n        return node;\n      }\n    }\n  }\n\n  /**\n   * Check node acceptance\n   */\n  private _acceptNode(node: Node): number {\n    const nodeTypeMask = 1 << (node.nodeType - 1);\n    if (!(this._whatToShow & nodeTypeMask)) {\n      return NodeFilter.FILTER_SKIP;\n    }\n\n    if (this._filter) {\n      if (typeof this._filter === 'function') {\n        return (this._filter as any)(node);\n      }\n      return this._filter.acceptNode(node);\n    }\n\n    return NodeFilter.FILTER_ACCEPT;\n  }\n}\n"],
+  "mappings": "AAAA,SAAQ,kBAAiB;AAKlB,MAAM,WAAW;AAAA,EAMtB,YAAY,MAAY,aAAqB,WAAW,UAAU,SAA4B,MAAM;AAClG,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,cAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,YAAY,MAAY;AAC1B,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,aAA0B;AACxB,QAAI,OAAO,KAAK;AAChB,WAAO,QAAQ,SAAS,KAAK,OAAO;AAClC,aAAQ,KAAa;AACrB,UAAI,QAAQ,KAAK,YAAY,IAAI,MAAM,WAAW,eAAe;AAC/D,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,aAA0B;AACxB,QAAI,OAAQ,KAAK,aAAqB;AACtC,WAAO,MAAM;AACX,YAAM,SAAS,KAAK,YAAY,IAAI;AACpC,UAAI,WAAW,WAAW,eAAe;AACvC,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AACA,UAAI,WAAW,WAAW,aAAa;AACrC,cAAM,QAAS,KAAa;AAC5B,YAAI,OAAO;AACT,iBAAO;AACP;AAAA,QACF;AAAA,MACF;AACA,aAAO,MAAM;AACX,cAAM,OAAQ,KAAa;AAC3B,YAAI,MAAM;AACR,iBAAO;AACP;AAAA,QACF;AACA,cAAM,SAAU,KAAa;AAC7B,YAAI,CAAC,UAAU,WAAW,KAAK,SAAS,WAAW,KAAK,cAAc;AACpE,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,YAAyB;AACvB,QAAI,OAAQ,KAAK,aAAqB;AACtC,WAAO,MAAM;AACX,YAAM,SAAS,KAAK,YAAY,IAAI;AACpC,UAAI,WAAW,WAAW,eAAe;AACvC,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AACA,UAAI,WAAW,WAAW,aAAa;AACrC,cAAM,QAAS,KAAa;AAC5B,YAAI,OAAO;AACT,iBAAO;AACP;AAAA,QACF;AAAA,MACF;AACA,aAAO,MAAM;AACX,cAAM,OAAQ,KAAa;AAC3B,YAAI,MAAM;AACR,iBAAO;AACP;AAAA,QACF;AACA,cAAM,SAAU,KAAa;AAC7B,YAAI,CAAC,UAAU,WAAW,KAAK,SAAS,WAAW,KAAK,cAAc;AACpE,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,kBAA+B;AAC7B,QAAI,OAAO,KAAK;AAChB,QAAI,SAAS,KAAK,MAAO,QAAO;AAEhC,WAAO,MAAM;AACX,UAAI,UAAW,KAAa;AAC5B,aAAO,SAAS;AACd,cAAM,SAAS,KAAK,YAAY,OAAO;AACvC,YAAI,WAAW,WAAW,eAAe;AACvC,eAAK,eAAe;AACpB,iBAAO;AAAA,QACT;AACA,YAAI,WAAW,WAAW,aAAa;AACrC,gBAAM,YAAa,QAAgB;AACnC,cAAI,WAAW;AACb,sBAAU;AACV;AAAA,UACF;AAAA,QACF;AACA,kBAAW,QAAgB;AAAA,MAC7B;AACA,aAAQ,KAAa;AACrB,UAAI,CAAC,QAAQ,SAAS,KAAK,SAAS,KAAK,YAAY,IAAI,MAAM,WAAW,eAAe;AACvF,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,cAA2B;AACzB,QAAI,OAAO,KAAK;AAChB,QAAI,SAAS,KAAK,MAAO,QAAO;AAEhC,WAAO,MAAM;AACX,UAAI,UAAW,KAAa;AAC5B,aAAO,SAAS;AACd,cAAM,SAAS,KAAK,YAAY,OAAO;AACvC,YAAI,WAAW,WAAW,eAAe;AACvC,eAAK,eAAe;AACpB,iBAAO;AAAA,QACT;AACA,YAAI,WAAW,WAAW,aAAa;AACrC,gBAAM,aAAc,QAAgB;AACpC,cAAI,YAAY;AACd,sBAAU;AACV;AAAA,UACF;AAAA,QACF;AACA,kBAAW,QAAgB;AAAA,MAC7B;AACA,aAAQ,KAAa;AACrB,UAAI,CAAC,QAAQ,SAAS,KAAK,SAAS,KAAK,YAAY,IAAI,MAAM,WAAW,eAAe;AACvF,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,eAA4B;AAC1B,QAAI,OAAO,KAAK;AAChB,WAAO,QAAQ,SAAS,KAAK,OAAO;AAClC,YAAM,UAAW,KAAa;AAC9B,UAAI,SAAS;AACX,eAAO;AACP,eAAO,MAAM;AACX,gBAAM,SAAS,KAAK,YAAY,IAAI;AACpC,cAAI,WAAW,WAAW,iBAAkB,KAAa,WAAW;AAClE,mBAAQ,KAAa;AAAA,UACvB,OAAO;AACL,gBAAI,WAAW,WAAW,eAAe;AACvC,mBAAK,eAAe;AACpB,qBAAO;AAAA,YACT;AACA;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF;AAEA,aAAQ,KAAa;AACrB,UAAI,MAAM;AACR,YAAI,KAAK,YAAY,IAAI,MAAM,WAAW,eAAe;AACvD,eAAK,eAAe;AACpB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAwB;AACtB,QAAI,OAAO,KAAK;AAChB,QAAI,SAAS,WAAW;AAExB,WAAO,MAAM;AACX,UAAI,WAAW,WAAW,eAAe;AACvC,cAAM,aAAc,KAAa;AACjC,YAAI,YAAY;AACd,iBAAO;AACP,mBAAS,KAAK,YAAY,IAAI;AAC9B,cAAI,WAAW,WAAW,eAAe;AACvC,iBAAK,eAAe;AACpB,mBAAO;AAAA,UACT;AACA;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM;AACX,YAAI,SAAS,KAAK,MAAO,QAAO;AAChC,cAAM,cAAe,KAAa;AAClC,YAAI,aAAa;AACf,iBAAO;AACP;AAAA,QACF;AACA,eAAQ,KAAa;AAAA,MACvB;AAEA,UAAI,CAAC,KAAM,QAAO;AAElB,eAAS,KAAK,YAAY,IAAI;AAC9B,UAAI,WAAW,WAAW,eAAe;AACvC,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,YAAY,MAAoB;AACtC,UAAM,eAAe,KAAM,KAAK,WAAW;AAC3C,QAAI,EAAE,KAAK,cAAc,eAAe;AACtC,aAAO,WAAW;AAAA,IACpB;AAEA,QAAI,KAAK,SAAS;AAChB,UAAI,OAAO,KAAK,YAAY,YAAY;AACtC,eAAQ,KAAK,QAAgB,IAAI;AAAA,MACnC;AACA,aAAO,KAAK,QAAQ,WAAW,IAAI;AAAA,IACrC;AAEA,WAAO,WAAW;AAAA,EACpB;AACF;",
+  "names": []
+}

package/dist/esm/node/collection/{HTMLCollection.js → HTMLCollectionImp.js}

@@ -1,4 +1,4 @@
-class HTMLCollection {
+class HTMLCollectionImp {
   constructor(elements = []) {
     this._elements = [];
     this._elements = [...elements];
@@ -61,6 +61,7 @@ class HTMLCollection {
   /**
    * Returns an iterator for the collection.
    */
+  // @ts-ignore
   [Symbol.iterator]() {
     return this._elements[Symbol.iterator]();
   }
@@ -81,6 +82,6 @@ class HTMLCollection {
   }
 }
 export {
-  HTMLCollection
+  HTMLCollectionImp
 };
-//# sourceMappingURL=HTMLCollection.js.map
+//# sourceMappingURL=HTMLCollectionImp.js.map

package/dist/esm/node/collection/HTMLCollectionImp.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/node/collection/HTMLCollectionImp.ts"],
+  "sourcesContent": ["// import { Element } from '../elements/Element';\n\n/**\n * **`HTMLCollection`** represents a generic collection of HTML elements.\n * \n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/HTMLCollection)\n */\nexport class HTMLCollectionImp implements HTMLCollection {\n    // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uC120\uC5B8\n    [index: number]: Element;\n    \n    private _elements: Element[] = [];\n\n    constructor(elements: Element[] = []) {\n        this._elements = [...elements];\n        \n        // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uAD6C\uD604\uC744 \uC704\uD55C \uD504\uB85D\uC2DC \uC124\uC815\n        return new Proxy(this, {\n            get(target, prop) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4\uC778 \uACBD\uC6B0\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return target._elements[index] || null;\n                }\n                // \uC77C\uBC18 \uD504\uB85C\uD37C\uD2F0/\uBA54\uC11C\uB4DC\uC778 \uACBD\uC6B0\n                return (target as any)[prop];\n            },\n            \n            set(target, prop, value) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4 \uC124\uC815 \uBC29\uC9C0 (\uC77D\uAE30 \uC804\uC6A9)\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    return false;\n                }\n                (target as any)[prop] = value;\n                return true;\n            },\n            \n            has(target, prop) {\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return index >= 0 && index < target._elements.length;\n                }\n                return prop in target;\n            }\n        });\n    }\n\n    /**\n     * Returns the number of elements in the collection.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/HTMLCollection/length)\n     */\n    get length(): number {\n        return this._elements.length;\n    }\n\n    /**\n     * Returns the element at the specified index, or null if the index is out of range.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/HTMLCollection/item)\n     */\n    item(index: number): Element | null {\n        if (index < 0 || index >= this._elements.length) {\n            return null;\n        }\n        return this._elements[index];\n    }\n\n    /**\n     * Returns the element with the specified ID or name, or null if no such element exists.\n     * \n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/HTMLCollection/namedItem)\n     */\n    namedItem(name: string): Element | null {\n        for (const element of this._elements) {\n            if (element.id === name || element.getAttribute('name') === name) {\n                return element;\n            }\n        }\n        return null;\n    }\n\n    /**\n     * Returns an iterator for the collection.\n     */\n    // @ts-ignore\n    [Symbol.iterator](): IterableIterator<Element> {\n        return this._elements[Symbol.iterator]();\n    }\n\n    // \uB0B4\uBD80\uC801\uC73C\uB85C \uC694\uC18C \uCD94\uAC00/\uC81C\uAC70\uB97C \uC704\uD55C \uBA54\uC11C\uB4DC\uB4E4 (DOM \uC870\uC791 \uC2DC \uC0AC\uC6A9)\n    _addElement(element: Element): void {\n        this._elements.push(element);\n    }\n\n    _removeElement(element: Element): boolean {\n        const index = this._elements.indexOf(element);\n        if (index !== -1) {\n            this._elements.splice(index, 1);\n            return true;\n        }\n        return false;\n    }\n\n    _insertElement(index: number, element: Element): void {\n        this._elements.splice(index, 0, element);\n    }\n}\n"],
+  "mappings": "AAOO,MAAM,kBAA4C;AAAA,EAMrD,YAAY,WAAsB,CAAC,GAAG;AAFtC,SAAQ,YAAuB,CAAC;AAG5B,SAAK,YAAY,CAAC,GAAG,QAAQ;AAG7B,WAAO,IAAI,MAAM,MAAM;AAAA,MACnB,IAAI,QAAQ,MAAM;AAEd,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,gBAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,iBAAO,OAAO,UAAU,KAAK,KAAK;AAAA,QACtC;AAEA,eAAQ,OAAe,IAAI;AAAA,MAC/B;AAAA,MAEA,IAAI,QAAQ,MAAM,OAAO;AAErB,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,iBAAO;AAAA,QACX;AACA,QAAC,OAAe,IAAI,IAAI;AACxB,eAAO;AAAA,MACX;AAAA,MAEA,IAAI,QAAQ,MAAM;AACd,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,gBAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,iBAAO,SAAS,KAAK,QAAQ,OAAO,UAAU;AAAA,QAClD;AACA,eAAO,QAAQ;AAAA,MACnB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,SAAiB;AACjB,WAAO,KAAK,UAAU;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,OAA+B;AAChC,QAAI,QAAQ,KAAK,SAAS,KAAK,UAAU,QAAQ;AAC7C,aAAO;AAAA,IACX;AACA,WAAO,KAAK,UAAU,KAAK;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,MAA8B;AACpC,eAAW,WAAW,KAAK,WAAW;AAClC,UAAI,QAAQ,OAAO,QAAQ,QAAQ,aAAa,MAAM,MAAM,MAAM;AAC9D,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,OAAO,QAAQ,IAA+B;AAC3C,WAAO,KAAK,UAAU,OAAO,QAAQ,EAAE;AAAA,EAC3C;AAAA;AAAA,EAGA,YAAY,SAAwB;AAChC,SAAK,UAAU,KAAK,OAAO;AAAA,EAC/B;AAAA,EAEA,eAAe,SAA2B;AACtC,UAAM,QAAQ,KAAK,UAAU,QAAQ,OAAO;AAC5C,QAAI,UAAU,IAAI;AACd,WAAK,UAAU,OAAO,OAAO,CAAC;AAC9B,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA,EAEA,eAAe,OAAe,SAAwB;AAClD,SAAK,UAAU,OAAO,OAAO,GAAG,OAAO;AAAA,EAC3C;AACJ;",
+  "names": []
+}

package/dist/esm/node/collection/HTMLCollectionOfImp.js

@@ -0,0 +1,7 @@
+import { HTMLCollectionImp } from "./HTMLCollectionImp.js";
+class HTMLCollectionOfImp extends HTMLCollectionImp {
+}
+export {
+  HTMLCollectionOfImp
+};
+//# sourceMappingURL=HTMLCollectionOfImp.js.map

package/dist/esm/node/collection/HTMLCollectionOfImp.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/node/collection/HTMLCollectionOfImp.ts"],
+  "sourcesContent": ["// import { Element } from '../elements/Element';\nimport { HTMLCollectionImp } from './HTMLCollectionImp';\n\n/**\n * **`HTMLCollectionOf<T>`** is a generic version of HTMLCollection that provides type safety for specific element types.\n * \n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/HTMLCollection)\n */\nexport class HTMLCollectionOfImp<T extends Element> extends HTMLCollectionImp implements HTMLCollectionOfImp<T>{\n\n\n}"],
+  "mappings": "AACA,SAAS,yBAAyB;AAO3B,MAAM,4BAA+C,kBAAmD;AAG/G;",
+  "names": []
+}

package/dist/esm/node/collection/NodeList.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/node/collection/NodeList.ts"],
-  "sourcesContent": ["import { Node } from '../Node';\n\n/**\n * **`NodeList`** objects are collections of nodes, usually returned by properties such as Node.childNodes and methods such as document.querySelectorAll().\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList)\n */\nexport class NodeList<T extends Node = Node> {\n    // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uC120\uC5B8\n    [index: number]: T;\n    \n    private _nodes: T[] = [];\n\n    constructor(nodes: T[] = []) {\n        this._nodes = [...nodes];\n        \n        // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uAD6C\uD604\uC744 \uC704\uD55C \uD504\uB85D\uC2DC \uC124\uC815\n        return new Proxy(this, {\n            get(target, prop) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4\uC778 \uACBD\uC6B0\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return target._nodes[index] || null;\n                }\n                // \uC77C\uBC18 \uD504\uB85C\uD37C\uD2F0/\uBA54\uC11C\uB4DC\uC778 \uACBD\uC6B0\n                return (target as any)[prop];\n            },\n            \n            set(target, prop, value) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4 \uC124\uC815 \uBC29\uC9C0 (\uC77D\uAE30 \uC804\uC6A9)\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    return false;\n                }\n                (target as any)[prop] = value;\n                return true;\n            },\n            \n            has(target, prop) {\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return index >= 0 && index < target._nodes.length;\n                }\n                return prop in target;\n            }\n        });\n    }\n\n    /**\n     * The **`NodeList.length`** property returns the number of items in a NodeList.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/length)\n     */\n    get length(): number {\n        return this._nodes.length;\n    }\n\n    /**\n     * Returns a node from a `NodeList` by index.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/item)\n     */\n    item(index: number): T | null {\n        if (index < 0 || index >= this._nodes.length) {\n            return null;\n        }\n        return this._nodes[index];\n    }\n\n    /**\n     * Executes a provided function once for each `Node` value in the `NodeList`.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/forEach)\n     */\n    forEach(callbackfn: (value: T, key: number, parent: NodeList) => void, thisArg?: any): void {\n        this._nodes.forEach((node, index) => {\n            callbackfn.call(thisArg, node, index, this);\n        });\n    }\n\n    // \uB0B4\uBD80\uC801\uC73C\uB85C \uB178\uB4DC \uCD94\uAC00/\uC81C\uAC70\uB97C \uC704\uD55C \uBA54\uC11C\uB4DC\uB4E4 (DOM \uC870\uC791 \uC2DC \uC0AC\uC6A9)\n    _addNode(node: T): void {\n        this._nodes.push(node);\n    }\n\n    _removeNode(node: T): boolean {\n        const index = this._nodes.indexOf(node);\n        if (index !== -1) {\n            this._nodes.splice(index, 1);\n            return true;\n        }\n        return false;\n    }\n\n    _insertNode(index: number, node: T): void {\n        this._nodes.splice(index, 0, node);\n    }\n\n    // Iterator \uC9C0\uC6D0 (for...of \uC0AC\uC6A9 \uAC00\uB2A5)\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of this._nodes) {\n            yield node;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all keys contained in this object.\n     * The keys are unsigned integer (index).\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/keys)\n     */\n    *keys(): IterableIterator<number> {\n        for (let i = 0; i < this._nodes.length; i++) {\n            yield i;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all values contained in this object.\n     * The values are Node objects.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/values)\n     */\n    *values(): IterableIterator<T> {\n        for (const node of this._nodes) {\n            yield node;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all key/value pairs contained in this object.\n     * The key is an unsigned integer (index) and the value is a Node object.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/entries)\n     */\n    *entries(): IterableIterator<[number, T]> {\n        for (let i = 0; i < this._nodes.length; i++) {\n            yield [i, this._nodes[i]];\n        }\n    }\n}"],
+  "sourcesContent": ["// import { Node } from '../Node';\n\n/**\n * **`NodeList`** objects are collections of nodes, usually returned by properties such as Node.childNodes and methods such as document.querySelectorAll().\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList)\n */\nexport class NodeList<T extends Node = Node> {\n    // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uC120\uC5B8\n    [index: number]: T;\n    \n    private _nodes: T[] = [];\n\n    constructor(nodes: T[] = []) {\n        this._nodes = [...nodes];\n        \n        // \uC778\uB371\uC2A4 \uC2DC\uADF8\uB2C8\uCC98 \uAD6C\uD604\uC744 \uC704\uD55C \uD504\uB85D\uC2DC \uC124\uC815\n        return new Proxy(this, {\n            get(target, prop) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4\uC778 \uACBD\uC6B0\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return target._nodes[index] || null;\n                }\n                // \uC77C\uBC18 \uD504\uB85C\uD37C\uD2F0/\uBA54\uC11C\uB4DC\uC778 \uACBD\uC6B0\n                return (target as any)[prop];\n            },\n            \n            set(target, prop, value) {\n                // \uC22B\uC790 \uC778\uB371\uC2A4 \uC124\uC815 \uBC29\uC9C0 (\uC77D\uAE30 \uC804\uC6A9)\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    return false;\n                }\n                (target as any)[prop] = value;\n                return true;\n            },\n            \n            has(target, prop) {\n                if (typeof prop === 'string' && /^\\d+$/.test(prop)) {\n                    const index = parseInt(prop, 10);\n                    return index >= 0 && index < target._nodes.length;\n                }\n                return prop in target;\n            }\n        });\n    }\n\n    /**\n     * The **`NodeList.length`** property returns the number of items in a NodeList.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/length)\n     */\n    get length(): number {\n        return this._nodes.length;\n    }\n\n    /**\n     * Returns a node from a `NodeList` by index.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/item)\n     */\n    item(index: number): T | null {\n        if (index < 0 || index >= this._nodes.length) {\n            return null;\n        }\n        return this._nodes[index];\n    }\n\n    /**\n     * Executes a provided function once for each `Node` value in the `NodeList`.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/forEach)\n     */\n    forEach(callbackfn: (value: T, key: number, parent: NodeList) => void, thisArg?: any): void {\n        this._nodes.forEach((node, index) => {\n            callbackfn.call(thisArg, node, index, this);\n        });\n    }\n\n    // \uB0B4\uBD80\uC801\uC73C\uB85C \uB178\uB4DC \uCD94\uAC00/\uC81C\uAC70\uB97C \uC704\uD55C \uBA54\uC11C\uB4DC\uB4E4 (DOM \uC870\uC791 \uC2DC \uC0AC\uC6A9)\n    _addNode(node: T): void {\n        this._nodes.push(node);\n    }\n\n    _removeNode(node: T): boolean {\n        const index = this._nodes.indexOf(node);\n        if (index !== -1) {\n            this._nodes.splice(index, 1);\n            return true;\n        }\n        return false;\n    }\n\n    _insertNode(index: number, node: T): void {\n        this._nodes.splice(index, 0, node);\n    }\n\n    // Iterator \uC9C0\uC6D0 (for...of \uC0AC\uC6A9 \uAC00\uB2A5)\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of this._nodes) {\n            yield node;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all keys contained in this object.\n     * The keys are unsigned integer (index).\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/keys)\n     */\n    *keys(): IterableIterator<number> {\n        for (let i = 0; i < this._nodes.length; i++) {\n            yield i;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all values contained in this object.\n     * The values are Node objects.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/values)\n     */\n    *values(): IterableIterator<T> {\n        for (const node of this._nodes) {\n            yield node;\n        }\n    }\n\n    /**\n     * Returns an iterator allowing to go through all key/value pairs contained in this object.\n     * The key is an unsigned integer (index) and the value is a Node object.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/NodeList/entries)\n     */\n    *entries(): IterableIterator<[number, T]> {\n        for (let i = 0; i < this._nodes.length; i++) {\n            yield [i, this._nodes[i]];\n        }\n    }\n}"],
   "mappings": "AAOO,MAAM,SAAgC;AAAA,EAMzC,YAAY,QAAa,CAAC,GAAG;AAF7B,SAAQ,SAAc,CAAC;AAGnB,SAAK,SAAS,CAAC,GAAG,KAAK;AAGvB,WAAO,IAAI,MAAM,MAAM;AAAA,MACnB,IAAI,QAAQ,MAAM;AAEd,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,gBAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,iBAAO,OAAO,OAAO,KAAK,KAAK;AAAA,QACnC;AAEA,eAAQ,OAAe,IAAI;AAAA,MAC/B;AAAA,MAEA,IAAI,QAAQ,MAAM,OAAO;AAErB,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,iBAAO;AAAA,QACX;AACA,QAAC,OAAe,IAAI,IAAI;AACxB,eAAO;AAAA,MACX;AAAA,MAEA,IAAI,QAAQ,MAAM;AACd,YAAI,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI,GAAG;AAChD,gBAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,iBAAO,SAAS,KAAK,QAAQ,OAAO,OAAO;AAAA,QAC/C;AACA,eAAO,QAAQ;AAAA,MACnB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,SAAiB;AACjB,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,OAAyB;AAC1B,QAAI,QAAQ,KAAK,SAAS,KAAK,OAAO,QAAQ;AAC1C,aAAO;AAAA,IACX;AACA,WAAO,KAAK,OAAO,KAAK;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,YAA+D,SAAqB;AACxF,SAAK,OAAO,QAAQ,CAAC,MAAM,UAAU;AACjC,iBAAW,KAAK,SAAS,MAAM,OAAO,IAAI;AAAA,IAC9C,CAAC;AAAA,EACL;AAAA;AAAA,EAGA,SAAS,MAAe;AACpB,SAAK,OAAO,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,YAAY,MAAkB;AAC1B,UAAM,QAAQ,KAAK,OAAO,QAAQ,IAAI;AACtC,QAAI,UAAU,IAAI;AACd,WAAK,OAAO,OAAO,OAAO,CAAC;AAC3B,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA,EAEA,YAAY,OAAe,MAAe;AACtC,SAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AAAA,EACrC;AAAA;AAAA,EAGA,EAAE,OAAO,QAAQ,IAAiB;AAC9B,eAAW,QAAQ,KAAK,QAAQ;AAC5B,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,OAAiC;AAC9B,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AACzC,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,SAA8B;AAC3B,eAAW,QAAQ,KAAK,QAAQ;AAC5B,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,UAAyC;AACtC,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AACzC,YAAM,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC;AAAA,IAC5B;AAAA,EACJ;AACJ;",
   "names": []
 }

package/dist/esm/node/collection/{NodeListOf.js → NodeListOfImp.js}

@@ -1,5 +1,5 @@
 import { NodeList } from "./NodeList.js";
-class NodeListOf extends NodeList {
+class NodeListOfImp extends NodeList {
   constructor(nodes = []) {
     super(nodes);
   }
@@ -14,6 +14,6 @@ class NodeListOf extends NodeList {
   }
 }
 export {
-  NodeListOf
+  NodeListOfImp
 };
-//# sourceMappingURL=NodeListOf.js.map
+//# sourceMappingURL=NodeListOfImp.js.map