@dooboostore/dom-parser 1.0.2 → 1.0.4

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/DocumentFragmentBase.ts"],
-  "sourcesContent": ["import { ParentNodeBase } from './ParentNodeBase';\nimport { DocumentFragment } from './DocumentFragment';\nimport { Document } from './Document';\nimport {DOCUMENT_FRAGMENT_NODE, ELEMENT_NODE, Node} from './Node';\nimport { NodeBase } from './NodeBase';\nimport { Element } from './elements/Element';\nimport { HTMLElement } from './elements/HTMLElement';\nimport { HTMLElementTagNameMap, SVGElementTagNameMap, MathMLElementTagNameMap } from './elements';\nimport { NodeListOf } from './collection/NodeListOf';\n\n/**\n * The **`DocumentFragmentBase`** class is the concrete implementation of the DocumentFragment interface.\n * \n * DocumentFragment is a minimal document object that has no parent. It is used as a lightweight version of Document\n * that stores a segment of a document structure comprised of nodes just like a standard document.\n */\nexport class DocumentFragmentBase extends ParentNodeBase implements DocumentFragment {\n    constructor(ownerDocument?: Document) {\n        super(DOCUMENT_FRAGMENT_NODE, '#document-fragment', ownerDocument); // DOCUMENT_FRAGMENT_NODE = 11\n    }\n\n    /**\n     * Returns the number of child elements of this DocumentFragment.\n     */\n    get childElementCount(): number {\n        let count = 0;\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) { // ELEMENT_NODE\n                count++;\n            }\n        }\n        return count;\n    }\n\n    /**\n     * Returns the first Element node within the DocumentFragment that matches the specified selectors.\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    querySelector<E extends Element = Element>(selectors: string): E | null;\n    querySelector(selectors: string): Element | null;\n    querySelector(selectors: string): Element | null {\n        const elements = this.querySelectorAll(selectors);\n        return elements.length > 0 ? elements.item(0) : null;\n    }\n\n    /**\n     * Returns all Element nodes within the DocumentFragment that match the specified selectors.\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    querySelectorAll<E extends Element = Element>(selectors: string): NodeListOf<E>;\n    querySelectorAll(selectors: string): NodeListOf<Element>;\n    querySelectorAll(selectors: string): NodeListOf<Element> {\n        // Use the inherited querySelectorAll from ParentNodeBase\n        return super.querySelectorAll(selectors);\n    }\n\n    /**\n     * Returns the Element within the DocumentFragment that has the specified ID.\n     */\n    getElementById(elementId: string): HTMLElement | null {\n        const element = this.querySelector(`#${elementId}`);\n        return element as HTMLElement | null;\n    }\n\n    /**\n     * Override cloneNode to return DocumentFragment\n     */\n    cloneNode(deep?: boolean): DocumentFragmentBase {\n        const clone = new DocumentFragmentBase(this._ownerDocument as Document);\n        \n        if (deep) {\n            for (const child of this._childNodesInternal) {\n                if (child && 'cloneNode' in child) {\n                    clone.appendChild((child as any).cloneNode(true));\n                }\n            }\n        }\n        \n        return clone;\n    }\n\n    /**\n     * Override appendChild to handle DocumentFragment behavior\n     * When a DocumentFragment is appended to another node, its children are moved, not the fragment itself\n     */\n    appendChild<T extends Node>(node: T): T {\n        // If the node being appended is a DocumentFragment, move its children instead\n        if (node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const fragment = node as any;\n            \n            // Move all children from fragment to this node\n            while (fragment._childNodesInternal && fragment._childNodesInternal.length > 0) {\n                const child = fragment._childNodesInternal[0];\n                if (child) {\n                    fragment.removeChild(child);\n                    super.appendChild(child);\n                }\n            }\n            \n            return node;\n        }\n        \n        return super.appendChild(node);\n    }\n}"],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAA+B;AAG/B,kBAAyD;AAalD,MAAM,6BAA6B,qCAA2C;AAAA,EACjF,YAAY,eAA0B;AAClC,UAAM,oCAAwB,sBAAsB,aAAa;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKA,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,EAUA,cAAc,WAAmC;AAC7C,UAAM,WAAW,KAAK,iBAAiB,SAAS;AAChD,WAAO,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,IAAI;AAAA,EACpD;AAAA,EAUA,iBAAiB,WAAwC;AAErD,WAAO,MAAM,iBAAiB,SAAS;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe,WAAuC;AAClD,UAAM,UAAU,KAAK,cAAc,IAAI,SAAS,EAAE;AAClD,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAsC;AAC5C,UAAM,QAAQ,IAAI,qBAAqB,KAAK,cAA0B;AAEtE,QAAI,MAAM;AACN,iBAAW,SAAS,KAAK,qBAAqB;AAC1C,YAAI,SAAS,eAAe,OAAO;AAC/B,gBAAM,YAAa,MAAc,UAAU,IAAI,CAAC;AAAA,QACpD;AAAA,MACJ;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAA4B,MAAY;AAEpC,QAAI,KAAK,aAAa,oCAAwB;AAC1C,YAAM,WAAW;AAGjB,aAAO,SAAS,uBAAuB,SAAS,oBAAoB,SAAS,GAAG;AAC5E,cAAM,QAAQ,SAAS,oBAAoB,CAAC;AAC5C,YAAI,OAAO;AACP,mBAAS,YAAY,KAAK;AAC1B,gBAAM,YAAY,KAAK;AAAA,QAC3B;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAEA,WAAO,MAAM,YAAY,IAAI;AAAA,EACjC;AACJ;",
+  "sourcesContent": ["import { ParentNodeBase } from './ParentNodeBase';\nimport {DOCUMENT_FRAGMENT_NODE, ELEMENT_NODE} from './Node';\nimport { NodeBase } from './NodeBase';\nimport { NodeListOfImp } from './collection/NodeListOfImp';\n\n/**\n * The **`DocumentFragmentBase`** class is the concrete implementation of the DocumentFragment interface.\n * \n * DocumentFragment is a minimal document object that has no parent. It is used as a lightweight version of Document\n * that stores a segment of a document structure comprised of nodes just like a standard document.\n */\nexport class DocumentFragmentBase extends ParentNodeBase implements DocumentFragment {\n    constructor(ownerDocument?: Document) {\n        super(DOCUMENT_FRAGMENT_NODE, '#document-fragment', ownerDocument); // DOCUMENT_FRAGMENT_NODE = 11\n    }\n\n    /**\n     * Returns the number of child elements of this DocumentFragment.\n     */\n    get childElementCount(): number {\n        let count = 0;\n        for (const child of this._childNodesInternal) {\n            if (child && child.nodeType === ELEMENT_NODE) { // ELEMENT_NODE\n                count++;\n            }\n        }\n        return count;\n    }\n\n    /**\n     * Returns the first Element node within the DocumentFragment that matches the specified selectors.\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    querySelector<E extends Element = Element>(selectors: string): E | null;\n    querySelector(selectors: string): Element | null;\n    querySelector(selectors: string): Element | null {\n        const elements = this.querySelectorAll(selectors);\n        return elements.length > 0 ? elements.item(0) : null;\n    }\n\n    /**\n     * Returns all Element nodes within the DocumentFragment that match the specified selectors.\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    querySelectorAll<E extends Element = Element>(selectors: string): NodeListOf<E>;\n    querySelectorAll(selectors: string): NodeListOf<Element>;\n    querySelectorAll(selectors: string): NodeListOf<Element> {\n        // Use the inherited querySelectorAll from ParentNodeBase\n        return super.querySelectorAll(selectors);\n    }\n\n    /**\n     * Returns the Element within the DocumentFragment that has the specified ID.\n     */\n    getElementById(elementId: string): HTMLElement | null {\n        const element = this.querySelector(`#${elementId}`);\n        return element as HTMLElement | null;\n    }\n\n    /**\n     * Override cloneNode to return DocumentFragment\n     */\n    cloneNode(deep?: boolean): DocumentFragment {\n        const clone = new DocumentFragmentBase(this._ownerDocument as Document) as unknown as DocumentFragment;\n        \n        if (deep) {\n            for (const child of this._childNodesInternal) {\n                if (child && 'cloneNode' in child) {\n                    clone.appendChild((child as any).cloneNode(true));\n                }\n            }\n        }\n        \n        return clone;\n    }\n\n    /**\n     * Override appendChild to handle DocumentFragment behavior\n     * When a DocumentFragment is appended to another node, its children are moved, not the fragment itself\n     */\n    appendChild<T extends Node>(node: T): T {\n        // If the node being appended is a DocumentFragment, move its children instead\n        if (node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const fragment = node as any;\n            \n            // Move all children from fragment to this node\n            while (fragment._childNodesInternal && fragment._childNodesInternal.length > 0) {\n                const child = fragment._childNodesInternal[0];\n                if (child) {\n                    fragment.removeChild(child);\n                    super.appendChild(child);\n                }\n            }\n            \n            return node;\n        }\n        \n        return super.appendChild(node);\n    }\n}"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAA+B;AAC/B,kBAAmD;AAU5C,MAAM,6BAA6B,qCAA2C;AAAA,EACjF,YAAY,eAA0B;AAClC,UAAM,oCAAwB,sBAAsB,aAAa;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKA,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,EAUA,cAAc,WAAmC;AAC7C,UAAM,WAAW,KAAK,iBAAiB,SAAS;AAChD,WAAO,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,IAAI;AAAA,EACpD;AAAA,EAUA,iBAAiB,WAAwC;AAErD,WAAO,MAAM,iBAAiB,SAAS;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe,WAAuC;AAClD,UAAM,UAAU,KAAK,cAAc,IAAI,SAAS,EAAE;AAClD,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAkC;AACxC,UAAM,QAAQ,IAAI,qBAAqB,KAAK,cAA0B;AAEtE,QAAI,MAAM;AACN,iBAAW,SAAS,KAAK,qBAAqB;AAC1C,YAAI,SAAS,eAAe,OAAO;AAC/B,gBAAM,YAAa,MAAc,UAAU,IAAI,CAAC;AAAA,QACpD;AAAA,MACJ;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAA4B,MAAY;AAEpC,QAAI,KAAK,aAAa,oCAAwB;AAC1C,YAAM,WAAW;AAGjB,aAAO,SAAS,uBAAuB,SAAS,oBAAoB,SAAS,GAAG;AAC5E,cAAM,QAAQ,SAAS,oBAAoB,CAAC;AAC5C,YAAI,OAAO;AACP,mBAAS,YAAY,KAAK;AAC1B,gBAAM,YAAY,KAAK;AAAA,QAC3B;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAEA,WAAO,MAAM,YAAY,IAAI;AAAA,EACjC;AACJ;",
   "names": []
 }

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/Node.ts"],
-  "sourcesContent": ["import { type NodeListOf } from './collection/NodeListOf';\nimport { NodeList } from './collection/NodeList';\nimport { type ChildNode } from './ChildNode';\nimport { type ParentNode } from './ParentNode';\nimport { type Document } from './Document';\nimport { type HTMLElement } from './elements/HTMLElement';\nimport { type GetRootNodeOptions } from './GetRootNodeOptions';\n// Node \uC0C1\uC218\uB4E4\uC744 \uBCC4\uB3C4\uB85C export\nexport const ELEMENT_NODE = 1 as const;\nexport const ATTRIBUTE_NODE = 2 as const;\nexport const TEXT_NODE = 3 as const;\nexport const CDATA_SECTION_NODE = 4 as const;\nexport const ENTITY_REFERENCE_NODE = 5 as const;\nexport const ENTITY_NODE = 6 as const;\nexport const PROCESSING_INSTRUCTION_NODE = 7 as const;\nexport const COMMENT_NODE = 8 as const;\nexport const DOCUMENT_NODE = 9 as const;\nexport const DOCUMENT_TYPE_NODE = 10 as const;\nexport const DOCUMENT_FRAGMENT_NODE = 11 as const;\nexport const NOTATION_NODE = 12 as const;\nexport const DOCUMENT_POSITION_DISCONNECTED = 0x01 as const;\nexport const DOCUMENT_POSITION_PRECEDING = 0x02 as const;\nexport const DOCUMENT_POSITION_FOLLOWING = 0x04 as const;\nexport const DOCUMENT_POSITION_CONTAINS = 0x08 as const;\nexport const DOCUMENT_POSITION_CONTAINED_BY = 0x10 as const;\nexport const DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = 0x20 as const;\n\n// Forward declarations for circular dependencies\n// interface ChildNode extends Node {}\n// interface ParentNode extends Node {}\n// interface Document extends Node {}\n// interface HTMLElement {}\n// interface GetRootNodeOptions {\n//     composed?: boolean;\n// }\n\nexport interface Node {\n    /** node is an element. */\n    readonly ELEMENT_NODE: 1;\n    readonly ATTRIBUTE_NODE: 2;\n    /** node is a Text node. */\n    readonly TEXT_NODE: 3;\n    /** node is a CDATASection node. */\n    readonly CDATA_SECTION_NODE: 4;\n    readonly ENTITY_REFERENCE_NODE: 5;\n    readonly ENTITY_NODE: 6;\n    /** node is a ProcessingInstruction node. */\n    readonly PROCESSING_INSTRUCTION_NODE: 7;\n    /** node is a Comment node. */\n    readonly COMMENT_NODE: 8;\n    /** node is a document. */\n    readonly DOCUMENT_NODE: 9;\n    /** node is a doctype. */\n    readonly DOCUMENT_TYPE_NODE: 10;\n    /** node is a DocumentFragment node. */\n    readonly DOCUMENT_FRAGMENT_NODE: 11;\n    readonly NOTATION_NODE: 12;\n    /** Set when node and other are not in the same tree. */\n    readonly DOCUMENT_POSITION_DISCONNECTED: 0x01;\n    /** Set when other is preceding node. */\n    readonly DOCUMENT_POSITION_PRECEDING: 0x02;\n    /** Set when other is following node. */\n    readonly DOCUMENT_POSITION_FOLLOWING: 0x04;\n    /** Set when other is an ancestor of node. */\n    readonly DOCUMENT_POSITION_CONTAINS: 0x08;\n    /** Set when other is a descendant of node. */\n    readonly DOCUMENT_POSITION_CONTAINED_BY: 0x10;\n    readonly DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC: 0x20;\n\n\n    /**\n     * The read-only **`baseURI`** property of the Node interface returns the absolute base URL of the document containing the node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/baseURI)\n     */\n    readonly baseURI: string;\n    /**\n     * The read-only **`childNodes`** property of the Node interface returns a live the first child node is assigned index `0`.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/childNodes)\n     */\n    readonly childNodes: NodeListOf<ChildNode>;\n    /**\n     * The read-only **`firstChild`** property of the Node interface returns the node's first child in the tree, or `null` if the node has no children.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/firstChild)\n     */\n    readonly firstChild: ChildNode | null;\n    /**\n     * The read-only **`isConnected`** property of the Node interface returns a boolean indicating whether the node is connected (directly or indirectly) to a Document object.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isConnected)\n     */\n    readonly isConnected: boolean;\n    /**\n     * The read-only **`lastChild`** property of the Node interface returns the last child of the node, or `null` if there are no child nodes.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lastChild)\n     */\n    readonly lastChild: ChildNode | null;\n    /**\n     * The read-only **`nextSibling`** property of the Node interface returns the node immediately following the specified one in their parent's Node.childNodes, or returns `null` if the specified node is the last child in the parent element.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nextSibling)\n     */\n    readonly nextSibling: ChildNode | null;\n    /**\n     * The read-only **`nodeName`** property of Node returns the name of the current node as a string.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeName)\n     */\n    readonly nodeName: string;\n    /**\n     * The read-only **`nodeType`** property of a Node interface is an integer that identifies what the node is.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeType)\n     */\n    readonly nodeType: number;\n    /**\n     * The **`nodeValue`** property of the Node interface returns or sets the value of the current node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeValue)\n     */\n    nodeValue: string | null;\n    /**\n     * The read-only **`ownerDocument`** property of the Node interface returns the top-level document object of the node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/ownerDocument)\n     */\n    readonly ownerDocument: Document | null;\n    /**\n     * The read-only **`parentElement`** property of Node interface returns the DOM node's parent Element, or `null` if the node either has no parent, or its parent isn't a DOM Element.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/parentElement)\n     */\n    readonly parentElement: HTMLElement | null;\n    /**\n     * The read-only **`parentNode`** property of the Node interface returns the parent of the specified node in the DOM tree.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/parentNode)\n     */\n    readonly parentNode: ParentNode | null;\n    /**\n     * The read-only **`previousSibling`** property of the Node interface returns the node immediately preceding the specified one in its parent's or `null` if the specified node is the first in that list.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/previousSibling)\n     */\n    readonly previousSibling: ChildNode | null;\n    /**\n     * The **`textContent`** property of the Node interface represents the text content of the node and its descendants.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/textContent)\n     */\n    textContent: string | null;\n    /**\n     * The **`appendChild()`** method of the Node interface adds a node to the end of the list of children of a specified parent node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/appendChild)\n     */\n    appendChild<T extends Node>(node: T): T;\n    /**\n     * The **`cloneNode()`** method of the Node interface returns a duplicate of the node on which this method was called.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/cloneNode)\n     */\n    cloneNode(subtree?: boolean): Node;\n    /**\n     * The **`compareDocumentPosition()`** method of the Node interface reports the position of its argument node relative to the node on which it is called.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/compareDocumentPosition)\n     */\n    compareDocumentPosition(other: Node): number;\n    /**\n     * The **`contains()`** method of the Node interface returns a boolean value indicating whether a node is a descendant of a given node, that is the node itself, one of its direct children (Node.childNodes), one of the children's direct children, and so on.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/contains)\n     */\n    contains(other: Node | null): boolean;\n    /**\n     * The **`getRootNode()`** method of the Node interface returns the context object's root, which optionally includes the shadow root if it is available.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/getRootNode)\n     */\n    getRootNode(options?: GetRootNodeOptions): Node;\n    /**\n     * The **`hasChildNodes()`** method of the Node interface returns a boolean value indicating whether the given Node has child nodes or not.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/hasChildNodes)\n     */\n    hasChildNodes(): boolean;\n    /**\n     * The **`insertBefore()`** method of the Node interface inserts a node before a _reference node_ as a child of a specified _parent node_.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/insertBefore)\n     */\n    insertBefore<T extends Node>(node: T, child: Node | null): T;\n    /**\n     * The **`isDefaultNamespace()`** method of the Node interface accepts a namespace URI as an argument.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isDefaultNamespace)\n     */\n    isDefaultNamespace(namespace: string | null): boolean;\n    /**\n     * The **`isEqualNode()`** method of the Node interface tests whether two nodes are equal.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isEqualNode)\n     */\n    isEqualNode(otherNode: Node | null): boolean;\n    /**\n     * The **`isSameNode()`** method of the Node interface is a legacy alias the for the `===` strict equality operator.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isSameNode)\n     */\n    isSameNode(otherNode: Node | null): boolean;\n    /**\n     * The **`lookupNamespaceURI()`** method of the Node interface takes a prefix as parameter and returns the namespace URI associated with it on the given node if found (and `null` if not).\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lookupNamespaceURI)\n     */\n    lookupNamespaceURI(prefix: string | null): string | null;\n    /**\n     * The **`lookupPrefix()`** method of the Node interface returns a string containing the prefix for a given namespace URI, if present, and `null` if not.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lookupPrefix)\n     */\n    lookupPrefix(namespace: string | null): string | null;\n    /**\n     * The **`normalize()`** method of the Node interface puts the specified node and all of its sub-tree into a _normalized_ form.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/normalize)\n     */\n    normalize(): void;\n    /**\n     * The **`removeChild()`** method of the Node interface removes a child node from the DOM and returns the removed node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/removeChild)\n     */\n    removeChild<T extends Node>(child: T): T;\n    /**\n     * The **`replaceChild()`** method of the Node interface replaces a child node within the given (parent) node.\n     *\n     * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/replaceChild)\n     */\n    replaceChild<T extends Node>(node: Node, child: T): T;\n}"],
+  "sourcesContent": ["// import { type NodeListOf } from './collection/NodeListOf';\n// import { NodeList } from './collection/NodeList';\n// import { type ChildNode } from './ChildNode';\n// import { type ParentNode } from './ParentNode';\n// import { type Document } from './Document';\n// import { type HTMLElement } from './elements/HTMLElement';\n// import { type GetRootNodeOptions } from './GetRootNodeOptions';\n// Node \uC0C1\uC218\uB4E4\uC744 \uBCC4\uB3C4\uB85C export\nexport const ELEMENT_NODE = 1 as const;\nexport const ATTRIBUTE_NODE = 2 as const;\nexport const TEXT_NODE = 3 as const;\nexport const CDATA_SECTION_NODE = 4 as const;\nexport const ENTITY_REFERENCE_NODE = 5 as const;\nexport const ENTITY_NODE = 6 as const;\nexport const PROCESSING_INSTRUCTION_NODE = 7 as const;\nexport const COMMENT_NODE = 8 as const;\nexport const DOCUMENT_NODE = 9 as const;\nexport const DOCUMENT_TYPE_NODE = 10 as const;\nexport const DOCUMENT_FRAGMENT_NODE = 11 as const;\nexport const NOTATION_NODE = 12 as const;\nexport const DOCUMENT_POSITION_DISCONNECTED = 0x01 as const;\nexport const DOCUMENT_POSITION_PRECEDING = 0x02 as const;\nexport const DOCUMENT_POSITION_FOLLOWING = 0x04 as const;\nexport const DOCUMENT_POSITION_CONTAINS = 0x08 as const;\nexport const DOCUMENT_POSITION_CONTAINED_BY = 0x10 as const;\nexport const DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = 0x20 as const;\n\n// export interface Event {\n//   readonly type: string;\n//   readonly target: any;\n//   readonly currentTarget: any;\n//   readonly bubbles: boolean;\n//   readonly cancelable: boolean;\n//   readonly defaultPrevented: boolean;\n//   preventDefault(): void;\n//   stopPropagation(): void;\n//   stopImmediatePropagation(): void;\n// }\n//\n// export interface Node {\n//   /** node is an element. */\n//   readonly ELEMENT_NODE: 1;\n//   readonly ATTRIBUTE_NODE: 2;\n//   /** node is a Text node. */\n//   readonly TEXT_NODE: 3;\n//   /** node is a CDATASection node. */\n//   readonly CDATA_SECTION_NODE: 4;\n//   readonly ENTITY_REFERENCE_NODE: 5;\n//   readonly ENTITY_NODE: 6;\n//   /** node is a ProcessingInstruction node. */\n//   readonly PROCESSING_INSTRUCTION_NODE: 7;\n//   /** node is a Comment node. */\n//   readonly COMMENT_NODE: 8;\n//   /** node is a document. */\n//   readonly DOCUMENT_NODE: 9;\n//   /** node is a doctype. */\n//   readonly DOCUMENT_TYPE_NODE: 10;\n//   /** node is a DocumentFragment node. */\n//   readonly DOCUMENT_FRAGMENT_NODE: 11;\n//   readonly NOTATION_NODE: 12;\n//   /** Set when node and other are not in the same tree. */\n//   readonly DOCUMENT_POSITION_DISCONNECTED: 0x01;\n//   /** Set when other is preceding node. */\n//   readonly DOCUMENT_POSITION_PRECEDING: 0x02;\n//   /** Set when other is following node. */\n//   readonly DOCUMENT_POSITION_FOLLOWING: 0x04;\n//   /** Set when other is an ancestor of node. */\n//   readonly DOCUMENT_POSITION_CONTAINS: 0x08;\n//   /** Set when other is a descendant of node. */\n//   readonly DOCUMENT_POSITION_CONTAINED_BY: 0x10;\n//   readonly DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC: 0x20;\n//\n//   /**\n//    * The read-only **`baseURI`** property of the Node interface returns the absolute base URL of the document containing the node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/baseURI)\n//    */\n//   readonly baseURI: string;\n//   /**\n//    * The read-only **`childNodes`** property of the Node interface returns a live the first child node is assigned index `0`.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/childNodes)\n//    */\n//   readonly childNodes: NodeListOf<ChildNode>;\n//   /**\n//    * The read-only **`firstChild`** property of the Node interface returns the node's first child in the tree, or `null` if the node has no children.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/firstChild)\n//    */\n//   readonly firstChild: ChildNode | null;\n//   /**\n//    * The read-only **`isConnected`** property of the Node interface returns a boolean indicating whether the node is connected (directly or indirectly) to a Document object.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isConnected)\n//    */\n//   readonly isConnected: boolean;\n//   /**\n//    * The read-only **`lastChild`** property of the Node interface returns the last child of the node, or `null` if there are no child nodes.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lastChild)\n//    */\n//   readonly lastChild: ChildNode | null;\n//   /**\n//    * The read-only **`nextSibling`** property of the Node interface returns the node immediately following the specified one in their parent's Node.childNodes, or returns `null` if the specified node is the last child in the parent element.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nextSibling)\n//    */\n//   readonly nextSibling: ChildNode | null;\n//   /**\n//    * The read-only **`nodeName`** property of Node returns the name of the current node as a string.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeName)\n//    */\n//   readonly nodeName: string;\n//   /**\n//    * The read-only **`nodeType`** property of a Node interface is an integer that identifies what the node is.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeType)\n//    */\n//   readonly nodeType: number;\n//   /**\n//    * The **`nodeValue`** property of the Node interface returns or sets the value of the current node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/nodeValue)\n//    */\n//   nodeValue: string | null;\n//   /**\n//    * The read-only **`ownerDocument`** property of the Node interface returns the top-level document object of the node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/ownerDocument)\n//    */\n//   readonly ownerDocument: Document | null;\n//   /**\n//    * The read-only **`parentElement`** property of Node interface returns the DOM node's parent Element, or `null` if the node either has no parent, or its parent isn't a DOM Element.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/parentElement)\n//    */\n//   readonly parentElement: HTMLElement | null;\n//   /**\n//    * The read-only **`parentNode`** property of the Node interface returns the parent of the specified node in the DOM tree.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/parentNode)\n//    */\n//   readonly parentNode: ParentNode | null;\n//   /**\n//    * The read-only **`previousSibling`** property of the Node interface returns the node immediately preceding the specified one in its parent's or `null` if the specified node is the first in that list.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/previousSibling)\n//    */\n//   readonly previousSibling: ChildNode | null;\n//   /**\n//    * The **`textContent`** property of the Node interface represents the text content of the node and its descendants.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/textContent)\n//    */\n//   textContent: string | null;\n//   /**\n//    * The **`appendChild()`** method of the Node interface adds a node to the end of the list of children of a specified parent node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/appendChild)\n//    */\n//   appendChild<T extends Node>(node: T): T;\n//   /**\n//    * The **`cloneNode()`** method of the Node interface returns a duplicate of the node on which this method was called.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/cloneNode)\n//    */\n//   cloneNode(subtree?: boolean): Node;\n//   /**\n//    * The **`compareDocumentPosition()`** method of the Node interface reports the position of its argument node relative to the node on which it is called.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/compareDocumentPosition)\n//    */\n//   compareDocumentPosition(other: Node): number;\n//   /**\n//    * The **`contains()`** method of the Node interface returns a boolean value indicating whether a node is a descendant of a given node, that is the node itself, one of its direct children (Node.childNodes), one of the children's direct children, and so on.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/contains)\n//    */\n//   contains(other: Node | null): boolean;\n//   /**\n//    * The **`getRootNode()`** method of the Node interface returns the context object's root, which optionally includes the shadow root if it is available.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/getRootNode)\n//    */\n//   getRootNode(options?: GetRootNodeOptions): Node;\n//   /**\n//    * The **`hasChildNodes()`** method of the Node interface returns a boolean value indicating whether the given Node has child nodes or not.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/hasChildNodes)\n//    */\n//   hasChildNodes(): boolean;\n//   /**\n//    * The **`insertBefore()`** method of the Node interface inserts a node before a _reference node_ as a child of a specified _parent node_.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/insertBefore)\n//    */\n//   insertBefore<T extends Node>(node: T, child: Node | null): T;\n//   /**\n//    * The **`isDefaultNamespace()`** method of the Node interface accepts a namespace URI as an argument.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isDefaultNamespace)\n//    */\n//   isDefaultNamespace(namespace: string | null): boolean;\n//   /**\n//    * The **`isEqualNode()`** method of the Node interface tests whether two nodes are equal.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isEqualNode)\n//    */\n//   isEqualNode(otherNode: Node | null): boolean;\n//   /**\n//    * The **`isSameNode()`** method of the Node interface is a legacy alias the for the `===` strict equality operator.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/isSameNode)\n//    */\n//   isSameNode(otherNode: Node | null): boolean;\n//   /**\n//    * The **`lookupNamespaceURI()`** method of the Node interface takes a prefix as parameter and returns the namespace URI associated with it on the given node if found (and `null` if not).\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lookupNamespaceURI)\n//    */\n//   lookupNamespaceURI(prefix: string | null): string | null;\n//   /**\n//    * The **`lookupPrefix()`** method of the Node interface returns a string containing the prefix for a given namespace URI, if present, and `null` if not.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/lookupPrefix)\n//    */\n//   lookupPrefix(namespace: string | null): string | null;\n//   /**\n//    * The **`normalize()`** method of the Node interface puts the specified node and all of its sub-tree into a _normalized_ form.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/normalize)\n//    */\n//   normalize(): void;\n//   /**\n//    * The **`removeChild()`** method of the Node interface removes a child node from the DOM and returns the removed node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/removeChild)\n//    */\n//   removeChild<T extends Node>(child: T): T;\n//   /**\n//    * The **`replaceChild()`** method of the Node interface replaces a child node within the given (parent) node.\n//    *\n//    * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Node/replaceChild)\n//    */\n//   replaceChild<T extends Node>(node: Node, child: T): T;\n//\n//   // Add event methods manually to Node interface to avoid conflict with EventTarget\n//   addEventListener(type: string, listener: any, options?: any): void;\n//   removeEventListener(type: string, listener: any, options?: any): void;\n//   dispatchEvent(event: any): boolean;\n// }\n"],
   "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQO,MAAM,eAAe;AACrB,MAAM,iBAAiB;AACvB,MAAM,YAAY;AAClB,MAAM,qBAAqB;AAC3B,MAAM,wBAAwB;AAC9B,MAAM,cAAc;AACpB,MAAM,8BAA8B;AACpC,MAAM,eAAe;AACrB,MAAM,gBAAgB;AACtB,MAAM,qBAAqB;AAC3B,MAAM,yBAAyB;AAC/B,MAAM,gBAAgB;AACtB,MAAM,iCAAiC;AACvC,MAAM,8BAA8B;AACpC,MAAM,8BAA8B;AACpC,MAAM,6BAA6B;AACnC,MAAM,iCAAiC;AACvC,MAAM,4CAA4C;",
   "names": []
 }

package/dist/cjs/node/NodeBase.js

@@ -21,7 +21,7 @@ __export(NodeBase_exports, {
 });
 module.exports = __toCommonJS(NodeBase_exports);
 var import_Node = require("./Node");
-var import_NodeListOf = require("./collection/NodeListOf");
+var import_NodeListOfImp = require("./collection/NodeListOfImp");
 class NodeBase {
   constructor(nodeType, nodeName, ownerDocument) {
     this.nodeType = nodeType;
@@ -34,15 +34,46 @@ class NodeBase {
     // Made public for ChildNodeBase access
     this._nodeValue = null;
     this._textContent = null;
+    this._eventListeners = [];
     this._ownerDocument = ownerDocument || null;
   }
+  addEventListener(type, listener, options) {
+    this._eventListeners.push({
+      type,
+      listener: typeof listener === "function" ? listener : listener?.handleEvent,
+      options
+    });
+  }
+  removeEventListener(type, listener, _options) {
+    const targetListener = typeof listener === "function" ? listener : listener?.handleEvent;
+    this._eventListeners = this._eventListeners.filter((l) => !(l.type === type && l.listener === targetListener));
+  }
+  dispatchEvent(event) {
+    const type = typeof event === "string" ? event : event.type;
+    const listeners = this._eventListeners.filter((l) => l.type === type);
+    for (const l of listeners) {
+      try {
+        if (typeof l.listener === "function") {
+          l.listener.call(this, event);
+        } else if (l.listener && typeof l.listener.handleEvent === "function") {
+          l.listener.handleEvent(event);
+        }
+        if (l.options?.once) {
+          this.removeEventListener(type, l.listener, l.options);
+        }
+      } catch (e) {
+        console.error(`Error in event listener for ${type}:`, e);
+      }
+    }
+    return true;
+  }
   // Node interface implementation
   get baseURI() {
     return this._ownerDocument?.URL || "";
   }
   // External interface - returns proper Node interface types
   get childNodes() {
-    return new import_NodeListOf.NodeListOf(this._childNodesInternal);
+    return new import_NodeListOfImp.NodeListOfImp(this._childNodesInternal);
   }
   get firstChild() {
     return this._childNodesInternal.length > 0 ? this._childNodesInternal[0] : null;
@@ -194,6 +225,10 @@ class NodeBase {
     this._childNodesInternal.push(nodeBase);
     nodeBase._parentNodeInternal = this;
     nodeBase._ownerDocument = this._ownerDocument;
+    if (this.isConnected && nodeBase.connectedCallback) {
+      console.log(`[NodeBase] Calling connectedCallback for <${nodeBase.nodeName}>`);
+      nodeBase.connectedCallback();
+    }
     return node;
   }
   removeChild(child) {
@@ -202,8 +237,12 @@ class NodeBase {
     if (index === -1) {
       throw new Error("Node not found");
     }
+    const wasConnected = childBase.isConnected;
     this._childNodesInternal.splice(index, 1);
     childBase._parentNodeInternal = null;
+    if (wasConnected && childBase.disconnectedCallback) {
+      childBase.disconnectedCallback();
+    }
     return child;
   }
   insertBefore(node, child) {
@@ -235,6 +274,9 @@ class NodeBase {
     this._childNodesInternal.splice(index, 0, nodeBase);
     nodeBase._parentNodeInternal = this;
     nodeBase._ownerDocument = this._ownerDocument;
+    if (this.isConnected && nodeBase.connectedCallback) {
+      nodeBase.connectedCallback();
+    }
     return node;
   }
   replaceChild(node, child) {

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/node/NodeBase.ts"],
-  "sourcesContent": ["import { Node,\n    ELEMENT_NODE ,\n    ATTRIBUTE_NODE ,\n    TEXT_NODE ,\n    CDATA_SECTION_NODE ,\n    ENTITY_REFERENCE_NODE ,\n    ENTITY_NODE ,\n    PROCESSING_INSTRUCTION_NODE ,\n    COMMENT_NODE ,\n    DOCUMENT_NODE ,\n    DOCUMENT_TYPE_NODE ,\n    DOCUMENT_FRAGMENT_NODE ,\n    NOTATION_NODE ,\n    DOCUMENT_POSITION_DISCONNECTED ,\n    DOCUMENT_POSITION_PRECEDING ,\n    DOCUMENT_POSITION_FOLLOWING ,\n    DOCUMENT_POSITION_CONTAINS ,\n    DOCUMENT_POSITION_CONTAINED_BY ,\n    DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC\n} from './Node';\nimport { ChildNode } from './ChildNode';\nimport { ParentNode } from './ParentNode';\nimport { NodeListOf } from './collection/NodeListOf';\nimport { GetRootNodeOptions } from './GetRootNodeOptions';\nimport { HTMLElement } from './elements/HTMLElement';\nimport { Document } from './Document';\nimport { Text } from './Text';\n\n/**\n * Base implementation of the Node interface\n */\nexport abstract class NodeBase implements Node {\n    // Node constants as instance properties\n    static readonly ELEMENT_NODE = ELEMENT_NODE;\n    static readonly ATTRIBUTE_NODE = ATTRIBUTE_NODE;\n    static readonly TEXT_NODE = TEXT_NODE;\n    static readonly CDATA_SECTION_NODE = CDATA_SECTION_NODE;\n    static readonly ENTITY_REFERENCE_NODE = ENTITY_REFERENCE_NODE;\n    static readonly ENTITY_NODE = ENTITY_NODE;\n    static readonly PROCESSING_INSTRUCTION_NODE = PROCESSING_INSTRUCTION_NODE;\n    static readonly COMMENT_NODE = COMMENT_NODE;\n    static readonly DOCUMENT_NODE = DOCUMENT_NODE;\n    static readonly DOCUMENT_TYPE_NODE = DOCUMENT_TYPE_NODE;\n    static readonly DOCUMENT_FRAGMENT_NODE = DOCUMENT_FRAGMENT_NODE;\n    static readonly NOTATION_NODE = NOTATION_NODE;\n    static readonly DOCUMENT_POSITION_DISCONNECTED = DOCUMENT_POSITION_DISCONNECTED;\n    static readonly DOCUMENT_POSITION_PRECEDING = DOCUMENT_POSITION_PRECEDING;\n    static readonly DOCUMENT_POSITION_FOLLOWING = DOCUMENT_POSITION_FOLLOWING;\n    static readonly DOCUMENT_POSITION_CONTAINS = DOCUMENT_POSITION_CONTAINS;\n    static readonly DOCUMENT_POSITION_CONTAINED_BY = DOCUMENT_POSITION_CONTAINED_BY;\n    static readonly DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;\n\n    ELEMENT_NODE: typeof ELEMENT_NODE;\n    ATTRIBUTE_NODE: typeof ATTRIBUTE_NODE;\n    TEXT_NODE: typeof TEXT_NODE;\n    CDATA_SECTION_NODE: typeof CDATA_SECTION_NODE;\n    ENTITY_REFERENCE_NODE: typeof ENTITY_REFERENCE_NODE;\n    ENTITY_NODE: typeof ENTITY_NODE;\n    PROCESSING_INSTRUCTION_NODE: typeof PROCESSING_INSTRUCTION_NODE;\n    COMMENT_NODE: typeof COMMENT_NODE;\n    DOCUMENT_NODE: typeof DOCUMENT_NODE;\n    DOCUMENT_TYPE_NODE: typeof DOCUMENT_TYPE_NODE;\n    DOCUMENT_FRAGMENT_NODE: typeof DOCUMENT_FRAGMENT_NODE;\n    NOTATION_NODE: typeof NOTATION_NODE;\n    DOCUMENT_POSITION_DISCONNECTED: typeof DOCUMENT_POSITION_DISCONNECTED;\n    DOCUMENT_POSITION_PRECEDING: typeof DOCUMENT_POSITION_PRECEDING;\n    DOCUMENT_POSITION_FOLLOWING: typeof DOCUMENT_POSITION_FOLLOWING;\n    DOCUMENT_POSITION_CONTAINS: typeof DOCUMENT_POSITION_CONTAINS;\n    DOCUMENT_POSITION_CONTAINED_BY: typeof DOCUMENT_POSITION_CONTAINED_BY;\n    DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC: typeof DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;\n    // Internal properties (for Base class implementations)\n    protected _childNodesInternal: NodeBase[] = [];\n    public _parentNodeInternal: NodeBase | null = null;  // Internal parent reference\n    public _ownerDocument: Document | null = null;  // Made public for ChildNodeBase access\n    protected _nodeValue: string | null = null;\n    protected _textContent: string | null = null;\n\n    constructor(\n        public readonly nodeType: number,\n        public readonly nodeName: string,\n        ownerDocument?: Document | null\n    ) {\n        this._ownerDocument = ownerDocument || null;\n    }\n\n\n\n    // Node interface implementation\n    get baseURI(): string {\n        return this._ownerDocument?.URL || '';\n    }\n\n    // External interface - returns proper Node interface types\n    get childNodes(): NodeListOf<ChildNode> {\n        return new NodeListOf<ChildNode>(this._childNodesInternal as unknown as ChildNode[]);\n    }\n\n    get firstChild(): ChildNode | null {\n        return this._childNodesInternal.length > 0 ? this._childNodesInternal[0] as unknown as ChildNode : null;\n    }\n\n    get lastChild(): ChildNode | null {\n        const length = this._childNodesInternal.length;\n        return length > 0 ? this._childNodesInternal[length - 1] as unknown as ChildNode : null;\n    }\n\n    get nextSibling(): ChildNode | null {\n        if (!this._parentNodeInternal) return null;\n        const siblings = this._parentNodeInternal._childNodesInternal;\n        const index = this._findIndexInParent();\n        return index !== -1 && index < siblings.length - 1 ? siblings[index + 1] as unknown as ChildNode : null;\n    }\n\n    get previousSibling(): ChildNode | null {\n        if (!this._parentNodeInternal) return null;\n        const siblings = this._parentNodeInternal._childNodesInternal;\n        const index = this._findIndexInParent();\n        return index > 0 ? siblings[index - 1] as unknown as ChildNode : null;\n    }\n\n    get parentNode(): ParentNode | null {\n        return this._parentNodeInternal as unknown as ParentNode | null;\n    }\n\n    get parentElement(): HTMLElement | null {\n        return this._parentNodeInternal && this._parentNodeInternal.nodeType === ELEMENT_NODE\n            ? this._parentNodeInternal as unknown as HTMLElement\n            : null;\n    }\n\n    get ownerDocument(): Document | null {\n        return this._ownerDocument;\n    }\n\n    get isConnected(): boolean {\n        let node: Node | null = this;\n        while (node) {\n            if (node.nodeType === DOCUMENT_NODE) return true;\n            node = node.parentNode;\n        }\n        return false;\n    }\n\n    get nodeValue(): string | null {\n        return this._nodeValue;\n    }\n\n    set nodeValue(value: string | null) {\n        this._nodeValue = value;\n    }\n\n    get textContent(): string | null {\n        if (this.nodeType === TEXT_NODE || this.nodeType === COMMENT_NODE) {\n            // For text nodes, decode HTML entities to return original text\n            return this._nodeValue ? this.decodeHTMLEntities(this._nodeValue) : this._nodeValue;\n        }\n\n        // For elements, return the stored original text content if available\n        if (this._textContent !== undefined && this._textContent !== null) {\n            return this._textContent;\n        }\n\n        // Fallback: collect from children (for HTML parsed content)\n        let text = '';\n        for (const child of this._childNodesInternal) {\n            const childText = child.textContent;\n            if (childText !== null && childText !== undefined) {\n                text += childText;\n            }\n        }\n        return text.length > 0 ? text : null;\n    }\n\n    set textContent(value: string | null) {\n        // Convert to string (including null and undefined)\n        const stringValue = String(value);\n        // Store original text content\n        this._textContent = stringValue;\n        // Clear all children and add a single text node\n        this._childNodesInternal = [];\n        if (stringValue) {\n            // Create text node implementation with escaped value for innerHTML\n            const escapedValue = this.escapeHTMLEntities(stringValue);\n            const { TextBase } = require('./TextBase');\n            const textNode = new TextBase(escapedValue, this._ownerDocument);\n            this._childNodesInternal.push(textNode);\n            textNode._parentNodeInternal = this;\n        }\n    }\n\n    /**\n     * Escape HTML entities in a string to prevent XSS\n     */\n    protected escapeHTMLEntities(str: string): string {\n        const entityMap: { [key: string]: string } = {\n            '&': '&amp;',\n            '<': '&lt;',\n            '>': '&gt;',\n            '\"': '&quot;',\n            \"'\": '&#39;'\n        };\n\n        return str.replace(/[&<>\"']/g, (char) => {\n            return entityMap[char] || char;\n        });\n    }\n\n    /**\n     * Decode HTML entities in a string\n     */\n    protected decodeHTMLEntities(str: string): string {\n        const entityMap: { [key: string]: string } = {\n            '&amp;': '&',\n            '&lt;': '<',\n            '&gt;': '>',\n            '&quot;': '\"',\n            '&#39;': \"'\",\n            '&#34;': '\"',\n            '&apos;': \"'\",\n            '&copy;': '\u00A9',\n            '&reg;': '\u00AE',\n            '&trade;': '\u2122',\n            '&nbsp;': ' ',\n            '&hellip;': '\u2026',\n            '&mdash;': '\u2014',\n            '&ndash;': '\u2013',\n            '&lsquo;': '\\u2018',\n            '&rsquo;': '\\u2019',\n            '&ldquo;': '\"',\n            '&rdquo;': '\"'\n        };\n\n        return str.replace(/&[a-zA-Z0-9#]+;/g, (entity) => {\n            // Handle named entities\n            if (entityMap[entity]) {\n                return entityMap[entity];\n            }\n            \n            // Handle numeric entities like &#39; &#34;\n            if (entity.startsWith('&#') && entity.endsWith(';')) {\n                const numStr = entity.slice(2, -1);\n                const num = parseInt(numStr, 10);\n                if (!isNaN(num)) {\n                    return String.fromCharCode(num);\n                }\n            }\n            \n            // Handle hex entities like &#x27;\n            if (entity.startsWith('&#x') && entity.endsWith(';')) {\n                const hexStr = entity.slice(3, -1);\n                const num = parseInt(hexStr, 16);\n                if (!isNaN(num)) {\n                    return String.fromCharCode(num);\n                }\n            }\n            \n            // Return original if not recognized\n            return entity;\n        });\n    }\n\n    // Node methods - external interface uses Node types, internal uses NodeBase\n    appendChild<T extends Node>(node: T): T {\n        const nodeBase = node as any as NodeBase; // Internal cast\n\n        // Special handling for DocumentFragment\n        if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            // When appending a DocumentFragment, move its children instead\n            const fragment = nodeBase;\n            \n            // Move all children from fragment to this node\n            while (fragment._childNodesInternal.length > 0) {\n                const child = fragment._childNodesInternal[0];\n                if (child) {\n                    fragment.removeChild(child);\n                    this.appendChild(child);\n                }\n            }\n            \n            return node;\n        }\n\n        if (nodeBase._parentNodeInternal) {\n            nodeBase._parentNodeInternal.removeChild(nodeBase);\n        }\n\n        this._childNodesInternal.push(nodeBase);\n        nodeBase._parentNodeInternal = this;\n        nodeBase._ownerDocument = this._ownerDocument;\n\n        return node;\n    }\n\n    removeChild<T extends Node>(child: T): T {\n        const childBase = child as any as NodeBase; // Internal cast\n        const index = this._findChildIndex(childBase);\n        if (index === -1) {\n            throw new Error('Node not found');\n        }\n\n        this._childNodesInternal.splice(index, 1);\n        childBase._parentNodeInternal = null;\n\n        return child;\n    }\n\n    insertBefore<T extends Node>(node: T, child: Node | null): T {\n        if (child === null) {\n            return this.appendChild(node);\n        }\n\n        const nodeBase = node as any as NodeBase; // Internal cast\n        const childBase = child as any as NodeBase; // Internal cast\n        const index = this._findChildIndex(childBase);\n        if (index === -1) {\n            throw new Error('Reference node not found');\n        }\n\n        // Handle DocumentFragment - move all its children\n        if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const fragment = nodeBase as any;\n            const children = [...fragment._childNodesInternal]; // Copy array to avoid modification during iteration\n            \n            let insertIndex = index;\n            for (const fragmentChild of children) {\n                // Remove from fragment\n                fragment.removeChild(fragmentChild);\n                // Insert at the current insert position\n                this._childNodesInternal.splice(insertIndex, 0, fragmentChild);\n                fragmentChild._parentNodeInternal = this;\n                fragmentChild._ownerDocument = this._ownerDocument;\n                // Increment insert index for next child to maintain order\n                insertIndex++;\n            }\n            \n            return node;\n        }\n\n        if (nodeBase._parentNodeInternal) {\n            nodeBase._parentNodeInternal.removeChild(nodeBase);\n        }\n\n        this._childNodesInternal.splice(index, 0, nodeBase);\n        nodeBase._parentNodeInternal = this;\n        nodeBase._ownerDocument = this._ownerDocument;\n\n        return node;\n    }\n\n    replaceChild<T extends Node>(node: Node, child: T): T {\n        this.insertBefore(node, child);\n        this.removeChild(child);\n        return child;\n    }\n\n    cloneNode(deep?: boolean): Node {\n        // Basic clone implementation - would need to be overridden by specific node types\n        throw new Error('cloneNode must be implemented by subclasses');\n    }\n\n    hasChildNodes(): boolean {\n        return this._childNodesInternal.length > 0;\n    }\n\n    contains(other: Node | null): boolean {\n        if (!other || other === this) return other === this;\n\n        let node: Node | null = other;\n        while (node) {\n            if (node.parentNode === this as unknown as ParentNode) return true;\n            node = node.parentNode;\n        }\n        return false;\n    }\n\n    compareDocumentPosition(other: Node): number {\n        if (this === other) return 0;\n        \n        const otherBase = other as any as NodeBase;\n        \n        // Check if nodes are disconnected (not in same tree)\n        const thisRoot = this.getRootNode();\n        const otherRoot = otherBase.getRootNode();\n        if (thisRoot !== otherRoot) {\n            return DOCUMENT_POSITION_DISCONNECTED;\n        }\n        \n        // Check containment relationships\n        if (this.contains(other)) return DOCUMENT_POSITION_CONTAINED_BY;\n        if (other.contains(this)) return DOCUMENT_POSITION_CONTAINS;\n        \n        // Find document order by traversing up to common ancestor\n        const thisAncestors = this._getAncestors();\n        const otherAncestors = otherBase._getAncestors();\n        \n        // Find common ancestor\n        let commonAncestor: NodeBase | null = null;\n        for (let i = 0; i < thisAncestors.length; i++) {\n            if (otherAncestors.includes(thisAncestors[i])) {\n                commonAncestor = thisAncestors[i];\n                break;\n            }\n        }\n        \n        if (!commonAncestor) {\n            return DOCUMENT_POSITION_DISCONNECTED;\n        }\n        \n        // Compare positions within common ancestor\n        const thisChild = this._getChildInAncestor(commonAncestor);\n        const otherChild = otherBase._getChildInAncestor(commonAncestor);\n        \n        if (thisChild && otherChild && commonAncestor._childNodesInternal) {\n            const thisIndex = commonAncestor._childNodesInternal.indexOf(thisChild);\n            const otherIndex = commonAncestor._childNodesInternal.indexOf(otherChild);\n            \n            if (thisIndex < otherIndex) {\n                return DOCUMENT_POSITION_FOLLOWING;\n            } else if (thisIndex > otherIndex) {\n                return DOCUMENT_POSITION_PRECEDING;\n            }\n        }\n        \n        return DOCUMENT_POSITION_DISCONNECTED;\n    }\n\n    getRootNode(options?: GetRootNodeOptions): Node {\n        let root: Node = this;\n        while (root.parentNode) {\n            root = root.parentNode;\n        }\n        return root;\n    }\n\n    isEqualNode(otherNode: Node | null): boolean {\n        if (!otherNode) return false;\n        if (this === otherNode) return true;\n        if (this.nodeType !== otherNode.nodeType) return false;\n        if (this.nodeName !== otherNode.nodeName) return false;\n        return true; // Simplified comparison\n    }\n\n    isSameNode(otherNode: Node | null): boolean {\n        return this === otherNode;\n    }\n\n    isDefaultNamespace(namespace: string | null): boolean {\n        // Simplified implementation\n        return namespace === null || namespace === 'http://www.w3.org/1999/xhtml';\n    }\n\n    lookupNamespaceURI(prefix: string | null): string | null {\n        // Simplified implementation\n        if (prefix === null || prefix === '') {\n            return 'http://www.w3.org/1999/xhtml';\n        }\n        return null;\n    }\n\n    lookupPrefix(namespace: string | null): string | null {\n        // Simplified implementation\n        return null;\n    }\n\n    normalize(): void {\n        // Merge adjacent text nodes\n        for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {\n            const child = this._childNodesInternal[i];\n            if (child && child.nodeType === TEXT_NODE) {\n                const nextSibling = child.nextSibling;\n                if (nextSibling && nextSibling.nodeType === TEXT_NODE) {\n                    child.nodeValue = (child.nodeValue || '') + (nextSibling.nodeValue || '');\n                    this.removeChild(nextSibling);\n                }\n            }\n        }\n    }\n\n    // Helper methods\n    private _findIndexInParent(): number {\n        if (!this._parentNodeInternal) return -1;\n        return this._parentNodeInternal._childNodesInternal.indexOf(this);\n    }\n\n    private _findChildIndex(child: NodeBase): number {\n        return this._childNodesInternal.indexOf(child);\n    }\n\n    private _getAncestors(): NodeBase[] {\n        const ancestors: NodeBase[] = [];\n        let current: NodeBase | null = this._parentNodeInternal;\n        while (current) {\n            ancestors.push(current);\n            current = current._parentNodeInternal;\n        }\n        return ancestors;\n    }\n\n    private _getChildInAncestor(ancestor: NodeBase): NodeBase | null {\n        let current: NodeBase = this;\n        while (current._parentNodeInternal && current._parentNodeInternal !== ancestor) {\n            current = current._parentNodeInternal;\n        }\n        return current._parentNodeInternal === ancestor ? current : null;\n    }\n}"],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAmBO;AAGP,wBAA2B;AASpB,MAAe,SAAyB;AAAA,EA8C3C,YACoB,UACA,UAChB,eACF;AAHkB;AACA;AARpB;AAAA,SAAU,sBAAkC,CAAC;AAC7C,SAAO,sBAAuC;AAC9C;AAAA,SAAO,iBAAkC;AACzC;AAAA,SAAU,aAA4B;AACtC,SAAU,eAA8B;AAOpC,SAAK,iBAAiB,iBAAiB;AAAA,EAC3C;AAAA;AAAA,EAKA,IAAI,UAAkB;AAClB,WAAO,KAAK,gBAAgB,OAAO;AAAA,EACvC;AAAA;AAAA,EAGA,IAAI,aAAoC;AACpC,WAAO,IAAI,6BAAsB,KAAK,mBAA6C;AAAA,EACvF;AAAA,EAEA,IAAI,aAA+B;AAC/B,WAAO,KAAK,oBAAoB,SAAS,IAAI,KAAK,oBAAoB,CAAC,IAA4B;AAAA,EACvG;AAAA,EAEA,IAAI,YAA8B;AAC9B,UAAM,SAAS,KAAK,oBAAoB;AACxC,WAAO,SAAS,IAAI,KAAK,oBAAoB,SAAS,CAAC,IAA4B;AAAA,EACvF;AAAA,EAEA,IAAI,cAAgC;AAChC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,UAAM,WAAW,KAAK,oBAAoB;AAC1C,UAAM,QAAQ,KAAK,mBAAmB;AACtC,WAAO,UAAU,MAAM,QAAQ,SAAS,SAAS,IAAI,SAAS,QAAQ,CAAC,IAA4B;AAAA,EACvG;AAAA,EAEA,IAAI,kBAAoC;AACpC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,UAAM,WAAW,KAAK,oBAAoB;AAC1C,UAAM,QAAQ,KAAK,mBAAmB;AACtC,WAAO,QAAQ,IAAI,SAAS,QAAQ,CAAC,IAA4B;AAAA,EACrE;AAAA,EAEA,IAAI,aAAgC;AAChC,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,gBAAoC;AACpC,WAAO,KAAK,uBAAuB,KAAK,oBAAoB,aAAa,2BACnE,KAAK,sBACL;AAAA,EACV;AAAA,EAEA,IAAI,gBAAiC;AACjC,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,cAAuB;AACvB,QAAI,OAAoB;AACxB,WAAO,MAAM;AACT,UAAI,KAAK,aAAa,0BAAe,QAAO;AAC5C,aAAO,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AAAA,EAEA,IAAI,YAA2B;AAC3B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,UAAU,OAAsB;AAChC,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,IAAI,cAA6B;AAC7B,QAAI,KAAK,aAAa,yBAAa,KAAK,aAAa,0BAAc;AAE/D,aAAO,KAAK,aAAa,KAAK,mBAAmB,KAAK,UAAU,IAAI,KAAK;AAAA,IAC7E;AAGA,QAAI,KAAK,iBAAiB,UAAa,KAAK,iBAAiB,MAAM;AAC/D,aAAO,KAAK;AAAA,IAChB;AAGA,QAAI,OAAO;AACX,eAAW,SAAS,KAAK,qBAAqB;AAC1C,YAAM,YAAY,MAAM;AACxB,UAAI,cAAc,QAAQ,cAAc,QAAW;AAC/C,gBAAQ;AAAA,MACZ;AAAA,IACJ;AACA,WAAO,KAAK,SAAS,IAAI,OAAO;AAAA,EACpC;AAAA,EAEA,IAAI,YAAY,OAAsB;AAElC,UAAM,cAAc,OAAO,KAAK;AAEhC,SAAK,eAAe;AAEpB,SAAK,sBAAsB,CAAC;AAC5B,QAAI,aAAa;AAEb,YAAM,eAAe,KAAK,mBAAmB,WAAW;AACxD,YAAM,EAAE,SAAS,IAAI,QAAQ,YAAY;AACzC,YAAM,WAAW,IAAI,SAAS,cAAc,KAAK,cAAc;AAC/D,WAAK,oBAAoB,KAAK,QAAQ;AACtC,eAAS,sBAAsB;AAAA,IACnC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKU,mBAAmB,KAAqB;AAC9C,UAAM,YAAuC;AAAA,MACzC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACT;AAEA,WAAO,IAAI,QAAQ,YAAY,CAAC,SAAS;AACrC,aAAO,UAAU,IAAI,KAAK;AAAA,IAC9B,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAKU,mBAAmB,KAAqB;AAC9C,UAAM,YAAuC;AAAA,MACzC,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,SAAS;AAAA,MACT,SAAS;AAAA,MACT,UAAU;AAAA,MACV,UAAU;AAAA,MACV,SAAS;AAAA,MACT,WAAW;AAAA,MACX,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACf;AAEA,WAAO,IAAI,QAAQ,oBAAoB,CAAC,WAAW;AAE/C,UAAI,UAAU,MAAM,GAAG;AACnB,eAAO,UAAU,MAAM;AAAA,MAC3B;AAGA,UAAI,OAAO,WAAW,IAAI,KAAK,OAAO,SAAS,GAAG,GAAG;AACjD,cAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AACjC,cAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,YAAI,CAAC,MAAM,GAAG,GAAG;AACb,iBAAO,OAAO,aAAa,GAAG;AAAA,QAClC;AAAA,MACJ;AAGA,UAAI,OAAO,WAAW,KAAK,KAAK,OAAO,SAAS,GAAG,GAAG;AAClD,cAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AACjC,cAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,YAAI,CAAC,MAAM,GAAG,GAAG;AACb,iBAAO,OAAO,aAAa,GAAG;AAAA,QAClC;AAAA,MACJ;AAGA,aAAO;AAAA,IACX,CAAC;AAAA,EACL;AAAA;AAAA,EAGA,YAA4B,MAAY;AACpC,UAAM,WAAW;AAGjB,QAAI,SAAS,aAAa,oCAAwB;AAE9C,YAAM,WAAW;AAGjB,aAAO,SAAS,oBAAoB,SAAS,GAAG;AAC5C,cAAM,QAAQ,SAAS,oBAAoB,CAAC;AAC5C,YAAI,OAAO;AACP,mBAAS,YAAY,KAAK;AAC1B,eAAK,YAAY,KAAK;AAAA,QAC1B;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAEA,QAAI,SAAS,qBAAqB;AAC9B,eAAS,oBAAoB,YAAY,QAAQ;AAAA,IACrD;AAEA,SAAK,oBAAoB,KAAK,QAAQ;AACtC,aAAS,sBAAsB;AAC/B,aAAS,iBAAiB,KAAK;AAE/B,WAAO;AAAA,EACX;AAAA,EAEA,YAA4B,OAAa;AACrC,UAAM,YAAY;AAClB,UAAM,QAAQ,KAAK,gBAAgB,SAAS;AAC5C,QAAI,UAAU,IAAI;AACd,YAAM,IAAI,MAAM,gBAAgB;AAAA,IACpC;AAEA,SAAK,oBAAoB,OAAO,OAAO,CAAC;AACxC,cAAU,sBAAsB;AAEhC,WAAO;AAAA,EACX;AAAA,EAEA,aAA6B,MAAS,OAAuB;AACzD,QAAI,UAAU,MAAM;AAChB,aAAO,KAAK,YAAY,IAAI;AAAA,IAChC;AAEA,UAAM,WAAW;AACjB,UAAM,YAAY;AAClB,UAAM,QAAQ,KAAK,gBAAgB,SAAS;AAC5C,QAAI,UAAU,IAAI;AACd,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC9C;AAGA,QAAI,SAAS,aAAa,oCAAwB;AAC9C,YAAM,WAAW;AACjB,YAAM,WAAW,CAAC,GAAG,SAAS,mBAAmB;AAEjD,UAAI,cAAc;AAClB,iBAAW,iBAAiB,UAAU;AAElC,iBAAS,YAAY,aAAa;AAElC,aAAK,oBAAoB,OAAO,aAAa,GAAG,aAAa;AAC7D,sBAAc,sBAAsB;AACpC,sBAAc,iBAAiB,KAAK;AAEpC;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAEA,QAAI,SAAS,qBAAqB;AAC9B,eAAS,oBAAoB,YAAY,QAAQ;AAAA,IACrD;AAEA,SAAK,oBAAoB,OAAO,OAAO,GAAG,QAAQ;AAClD,aAAS,sBAAsB;AAC/B,aAAS,iBAAiB,KAAK;AAE/B,WAAO;AAAA,EACX;AAAA,EAEA,aAA6B,MAAY,OAAa;AAClD,SAAK,aAAa,MAAM,KAAK;AAC7B,SAAK,YAAY,KAAK;AACtB,WAAO;AAAA,EACX;AAAA,EAEA,UAAU,MAAsB;AAE5B,UAAM,IAAI,MAAM,6CAA6C;AAAA,EACjE;AAAA,EAEA,gBAAyB;AACrB,WAAO,KAAK,oBAAoB,SAAS;AAAA,EAC7C;AAAA,EAEA,SAAS,OAA6B;AAClC,QAAI,CAAC,SAAS,UAAU,KAAM,QAAO,UAAU;AAE/C,QAAI,OAAoB;AACxB,WAAO,MAAM;AACT,UAAI,KAAK,eAAe,KAA+B,QAAO;AAC9D,aAAO,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AAAA,EAEA,wBAAwB,OAAqB;AACzC,QAAI,SAAS,MAAO,QAAO;AAE3B,UAAM,YAAY;AAGlB,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,YAAY,UAAU,YAAY;AACxC,QAAI,aAAa,WAAW;AACxB,aAAO;AAAA,IACX;AAGA,QAAI,KAAK,SAAS,KAAK,EAAG,QAAO;AACjC,QAAI,MAAM,SAAS,IAAI,EAAG,QAAO;AAGjC,UAAM,gBAAgB,KAAK,cAAc;AACzC,UAAM,iBAAiB,UAAU,cAAc;AAG/C,QAAI,iBAAkC;AACtC,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC3C,UAAI,eAAe,SAAS,cAAc,CAAC,CAAC,GAAG;AAC3C,yBAAiB,cAAc,CAAC;AAChC;AAAA,MACJ;AAAA,IACJ;AAEA,QAAI,CAAC,gBAAgB;AACjB,aAAO;AAAA,IACX;AAGA,UAAM,YAAY,KAAK,oBAAoB,cAAc;AACzD,UAAM,aAAa,UAAU,oBAAoB,cAAc;AAE/D,QAAI,aAAa,cAAc,eAAe,qBAAqB;AAC/D,YAAM,YAAY,eAAe,oBAAoB,QAAQ,SAAS;AACtE,YAAM,aAAa,eAAe,oBAAoB,QAAQ,UAAU;AAExE,UAAI,YAAY,YAAY;AACxB,eAAO;AAAA,MACX,WAAW,YAAY,YAAY;AAC/B,eAAO;AAAA,MACX;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA,EAEA,YAAY,SAAoC;AAC5C,QAAI,OAAa;AACjB,WAAO,KAAK,YAAY;AACpB,aAAO,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AAAA,EAEA,YAAY,WAAiC;AACzC,QAAI,CAAC,UAAW,QAAO;AACvB,QAAI,SAAS,UAAW,QAAO;AAC/B,QAAI,KAAK,aAAa,UAAU,SAAU,QAAO;AACjD,QAAI,KAAK,aAAa,UAAU,SAAU,QAAO;AACjD,WAAO;AAAA,EACX;AAAA,EAEA,WAAW,WAAiC;AACxC,WAAO,SAAS;AAAA,EACpB;AAAA,EAEA,mBAAmB,WAAmC;AAElD,WAAO,cAAc,QAAQ,cAAc;AAAA,EAC/C;AAAA,EAEA,mBAAmB,QAAsC;AAErD,QAAI,WAAW,QAAQ,WAAW,IAAI;AAClC,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA,EAEA,aAAa,WAAyC;AAElD,WAAO;AAAA,EACX;AAAA,EAEA,YAAkB;AAEd,aAAS,IAAI,KAAK,oBAAoB,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3D,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,SAAS,MAAM,aAAa,uBAAW;AACvC,cAAM,cAAc,MAAM;AAC1B,YAAI,eAAe,YAAY,aAAa,uBAAW;AACnD,gBAAM,aAAa,MAAM,aAAa,OAAO,YAAY,aAAa;AACtE,eAAK,YAAY,WAAW;AAAA,QAChC;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA,EAGQ,qBAA6B;AACjC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,WAAO,KAAK,oBAAoB,oBAAoB,QAAQ,IAAI;AAAA,EACpE;AAAA,EAEQ,gBAAgB,OAAyB;AAC7C,WAAO,KAAK,oBAAoB,QAAQ,KAAK;AAAA,EACjD;AAAA,EAEQ,gBAA4B;AAChC,UAAM,YAAwB,CAAC;AAC/B,QAAI,UAA2B,KAAK;AACpC,WAAO,SAAS;AACZ,gBAAU,KAAK,OAAO;AACtB,gBAAU,QAAQ;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EAEQ,oBAAoB,UAAqC;AAC7D,QAAI,UAAoB;AACxB,WAAO,QAAQ,uBAAuB,QAAQ,wBAAwB,UAAU;AAC5E,gBAAU,QAAQ;AAAA,IACtB;AACA,WAAO,QAAQ,wBAAwB,WAAW,UAAU;AAAA,EAChE;AACJ;AAAA;AA1dsB,SAEF,eAAe;AAFb,SAGF,iBAAiB;AAHf,SAIF,YAAY;AAJV,SAKF,qBAAqB;AALnB,SAMF,wBAAwB;AANtB,SAOF,cAAc;AAPZ,SAQF,8BAA8B;AAR5B,SASF,eAAe;AATb,SAUF,gBAAgB;AAVd,SAWF,qBAAqB;AAXnB,SAYF,yBAAyB;AAZvB,SAaF,gBAAgB;AAbd,SAcF,iCAAiC;AAd/B,SAeF,8BAA8B;AAf5B,SAgBF,8BAA8B;AAhB5B,SAiBF,6BAA6B;AAjB3B,SAkBF,iCAAiC;AAlB/B,SAmBF,4CAA4C;",
+  "sourcesContent": ["import {  ELEMENT_NODE, ATTRIBUTE_NODE, TEXT_NODE, CDATA_SECTION_NODE, ENTITY_REFERENCE_NODE, ENTITY_NODE, PROCESSING_INSTRUCTION_NODE, COMMENT_NODE, DOCUMENT_NODE, DOCUMENT_TYPE_NODE, DOCUMENT_FRAGMENT_NODE, NOTATION_NODE, DOCUMENT_POSITION_DISCONNECTED, DOCUMENT_POSITION_PRECEDING, DOCUMENT_POSITION_FOLLOWING, DOCUMENT_POSITION_CONTAINS, DOCUMENT_POSITION_CONTAINED_BY, DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC } from './Node';\nimport { NodeListOfImp } from './collection/NodeListOfImp';\nimport { GetRootNodeOptions } from './GetRootNodeOptions';\n\n/**\n * Base implementation of the Node interface\n */\nexport abstract class NodeBase implements Node {\n  // Node constants as instance properties\n  static readonly ELEMENT_NODE = ELEMENT_NODE;\n  static readonly ATTRIBUTE_NODE = ATTRIBUTE_NODE;\n  static readonly TEXT_NODE = TEXT_NODE;\n  static readonly CDATA_SECTION_NODE = CDATA_SECTION_NODE;\n  static readonly ENTITY_REFERENCE_NODE = ENTITY_REFERENCE_NODE;\n  static readonly ENTITY_NODE = ENTITY_NODE;\n  static readonly PROCESSING_INSTRUCTION_NODE = PROCESSING_INSTRUCTION_NODE;\n  static readonly COMMENT_NODE = COMMENT_NODE;\n  static readonly DOCUMENT_NODE = DOCUMENT_NODE;\n  static readonly DOCUMENT_TYPE_NODE = DOCUMENT_TYPE_NODE;\n  static readonly DOCUMENT_FRAGMENT_NODE = DOCUMENT_FRAGMENT_NODE;\n  static readonly NOTATION_NODE = NOTATION_NODE;\n  static readonly DOCUMENT_POSITION_DISCONNECTED = DOCUMENT_POSITION_DISCONNECTED;\n  static readonly DOCUMENT_POSITION_PRECEDING = DOCUMENT_POSITION_PRECEDING;\n  static readonly DOCUMENT_POSITION_FOLLOWING = DOCUMENT_POSITION_FOLLOWING;\n  static readonly DOCUMENT_POSITION_CONTAINS = DOCUMENT_POSITION_CONTAINS;\n  static readonly DOCUMENT_POSITION_CONTAINED_BY = DOCUMENT_POSITION_CONTAINED_BY;\n  static readonly DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;\n\n  ELEMENT_NODE: typeof ELEMENT_NODE;\n  ATTRIBUTE_NODE: typeof ATTRIBUTE_NODE;\n  TEXT_NODE: typeof TEXT_NODE;\n  CDATA_SECTION_NODE: typeof CDATA_SECTION_NODE;\n  ENTITY_REFERENCE_NODE: typeof ENTITY_REFERENCE_NODE;\n  ENTITY_NODE: typeof ENTITY_NODE;\n  PROCESSING_INSTRUCTION_NODE: typeof PROCESSING_INSTRUCTION_NODE;\n  COMMENT_NODE: typeof COMMENT_NODE;\n  DOCUMENT_NODE: typeof DOCUMENT_NODE;\n  DOCUMENT_TYPE_NODE: typeof DOCUMENT_TYPE_NODE;\n  DOCUMENT_FRAGMENT_NODE: typeof DOCUMENT_FRAGMENT_NODE;\n  NOTATION_NODE: typeof NOTATION_NODE;\n  DOCUMENT_POSITION_DISCONNECTED: typeof DOCUMENT_POSITION_DISCONNECTED;\n  DOCUMENT_POSITION_PRECEDING: typeof DOCUMENT_POSITION_PRECEDING;\n  DOCUMENT_POSITION_FOLLOWING: typeof DOCUMENT_POSITION_FOLLOWING;\n  DOCUMENT_POSITION_CONTAINS: typeof DOCUMENT_POSITION_CONTAINS;\n  DOCUMENT_POSITION_CONTAINED_BY: typeof DOCUMENT_POSITION_CONTAINED_BY;\n  DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC: typeof DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;\n  // Internal properties (for Base class implementations)\n  protected _childNodesInternal: NodeBase[] = [];\n  public _parentNodeInternal: NodeBase | null = null; // Internal parent reference\n  public _ownerDocument: Document | null = null; // Made public for ChildNodeBase access\n  protected _nodeValue: string | null = null;\n  protected _textContent: string | null = null;\n  protected _eventListeners: Array<{ type: string; listener: any; options?: any }> = [];\n\n  constructor(\n    public nodeType: number,\n    public nodeName: string,\n    ownerDocument?: Document | null\n  ) {\n    this._ownerDocument = ownerDocument || null;\n  }\n\n  addEventListener(type: string, listener: any, options?: any): void {\n    this._eventListeners.push({\n      type,\n      listener: typeof listener === 'function' ? listener : listener?.handleEvent,\n      options\n    });\n  }\n\n  removeEventListener(type: string, listener: any, _options?: any): void {\n    const targetListener = typeof listener === 'function' ? listener : listener?.handleEvent;\n    this._eventListeners = this._eventListeners.filter(l => !(l.type === type && l.listener === targetListener));\n  }\n\n  dispatchEvent(event: any): boolean {\n    // Simple implementation: only trigger listeners on this node (no bubbling for now)\n    const type = typeof event === 'string' ? event : event.type;\n    const listeners = this._eventListeners.filter(l => l.type === type);\n    for (const l of listeners) {\n      try {\n        if (typeof l.listener === 'function') {\n          l.listener.call(this, event);\n        } else if (l.listener && typeof l.listener.handleEvent === 'function') {\n          l.listener.handleEvent(event);\n        }\n\n        if (l.options?.once) {\n          this.removeEventListener(type, l.listener, l.options);\n        }\n      } catch (e) {\n        console.error(`Error in event listener for ${type}:`, e);\n      }\n    }\n    return true;\n  }\n\n  // Node interface implementation\n  get baseURI(): string {\n    return this._ownerDocument?.URL || '';\n  }\n\n  // External interface - returns proper Node interface types\n  get childNodes(): NodeListOf<ChildNode> {\n    return new NodeListOfImp<ChildNode>(this._childNodesInternal as unknown as ChildNode[]) as unknown as NodeListOf<ChildNode>;\n  }\n\n  get firstChild(): ChildNode | null {\n    return this._childNodesInternal.length > 0 ? (this._childNodesInternal[0] as unknown as ChildNode) : null;\n  }\n\n  get lastChild(): ChildNode | null {\n    const length = this._childNodesInternal.length;\n    return length > 0 ? (this._childNodesInternal[length - 1] as unknown as ChildNode) : null;\n  }\n\n  get nextSibling(): ChildNode | null {\n    if (!this._parentNodeInternal) return null;\n    const siblings = this._parentNodeInternal._childNodesInternal;\n    const index = this._findIndexInParent();\n    return index !== -1 && index < siblings.length - 1 ? (siblings[index + 1] as unknown as ChildNode) : null;\n  }\n\n  get previousSibling(): ChildNode | null {\n    if (!this._parentNodeInternal) return null;\n    const siblings = this._parentNodeInternal._childNodesInternal;\n    const index = this._findIndexInParent();\n    return index > 0 ? (siblings[index - 1] as unknown as ChildNode) : null;\n  }\n\n  get parentNode(): ParentNode | null {\n    return this._parentNodeInternal as unknown as ParentNode | null;\n  }\n\n  get parentElement(): HTMLElement | null {\n    return this._parentNodeInternal && this._parentNodeInternal.nodeType === ELEMENT_NODE ? (this._parentNodeInternal as unknown as HTMLElement) : null;\n  }\n\n  get ownerDocument(): Document | null {\n    return this._ownerDocument;\n  }\n\n  get isConnected(): boolean {\n    let node: Node | null = this;\n    while (node) {\n      if (node.nodeType === DOCUMENT_NODE) return true;\n      node = node.parentNode;\n    }\n    return false;\n  }\n\n  get nodeValue(): string | null {\n    return this._nodeValue;\n  }\n\n  set nodeValue(value: string | null) {\n    this._nodeValue = value;\n  }\n\n  get textContent(): string | null {\n    if (this.nodeType === TEXT_NODE || this.nodeType === COMMENT_NODE) {\n      // For text nodes, decode HTML entities to return original text\n      return this._nodeValue ? this.decodeHTMLEntities(this._nodeValue) : this._nodeValue;\n    }\n\n    // For elements, return the stored original text content if available\n    if (this._textContent !== undefined && this._textContent !== null) {\n      return this._textContent;\n    }\n\n    // Fallback: collect from children (for HTML parsed content)\n    let text = '';\n    for (const child of this._childNodesInternal) {\n      const childText = child.textContent;\n      if (childText !== null && childText !== undefined) {\n        text += childText;\n      }\n    }\n    return text.length > 0 ? text : null;\n  }\n\n  set textContent(value: string | null) {\n    // Convert to string (including null and undefined)\n    const stringValue = String(value);\n    // Store original text content\n    this._textContent = stringValue;\n    // Clear all children and add a single text node\n    this._childNodesInternal = [];\n    if (stringValue) {\n      // Create text node implementation with escaped value for innerHTML\n      const escapedValue = this.escapeHTMLEntities(stringValue);\n      const { TextBase } = require('./TextBase');\n      const textNode = new TextBase(escapedValue, this._ownerDocument);\n      this._childNodesInternal.push(textNode);\n      textNode._parentNodeInternal = this;\n    }\n  }\n\n  /**\n   * Escape HTML entities in a string to prevent XSS\n   */\n  protected escapeHTMLEntities(str: string): string {\n    const entityMap: { [key: string]: string } = {\n      '&': '&amp;',\n      '<': '&lt;',\n      '>': '&gt;',\n      '\"': '&quot;',\n      \"'\": '&#39;'\n    };\n\n    return str.replace(/[&<>\"']/g, char => {\n      return entityMap[char] || char;\n    });\n  }\n\n  /**\n   * Decode HTML entities in a string\n   */\n  protected decodeHTMLEntities(str: string): string {\n    const entityMap: { [key: string]: string } = {\n      '&amp;': '&',\n      '&lt;': '<',\n      '&gt;': '>',\n      '&quot;': '\"',\n      '&#39;': \"'\",\n      '&#34;': '\"',\n      '&apos;': \"'\",\n      '&copy;': '\u00A9',\n      '&reg;': '\u00AE',\n      '&trade;': '\u2122',\n      '&nbsp;': ' ',\n      '&hellip;': '\u2026',\n      '&mdash;': '\u2014',\n      '&ndash;': '\u2013',\n      '&lsquo;': '\\u2018',\n      '&rsquo;': '\\u2019',\n      '&ldquo;': '\"',\n      '&rdquo;': '\"'\n    };\n\n    return str.replace(/&[a-zA-Z0-9#]+;/g, entity => {\n      // Handle named entities\n      if (entityMap[entity]) {\n        return entityMap[entity];\n      }\n\n      // Handle numeric entities like &#39; &#34;\n      if (entity.startsWith('&#') && entity.endsWith(';')) {\n        const numStr = entity.slice(2, -1);\n        const num = parseInt(numStr, 10);\n        if (!isNaN(num)) {\n          return String.fromCharCode(num);\n        }\n      }\n\n      // Handle hex entities like &#x27;\n      if (entity.startsWith('&#x') && entity.endsWith(';')) {\n        const hexStr = entity.slice(3, -1);\n        const num = parseInt(hexStr, 16);\n        if (!isNaN(num)) {\n          return String.fromCharCode(num);\n        }\n      }\n\n      // Return original if not recognized\n      return entity;\n    });\n  }\n\n  // Node methods - external interface uses Node types, internal uses NodeBase\n  appendChild<T extends Node>(node: T): T {\n    const nodeBase = node as any as NodeBase; // Internal cast\n\n    // Special handling for DocumentFragment\n    if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {\n      // When appending a DocumentFragment, move its children instead\n      const fragment = nodeBase;\n\n      // Move all children from fragment to this node\n      while (fragment._childNodesInternal.length > 0) {\n        const child = fragment._childNodesInternal[0];\n        if (child) {\n          fragment.removeChild(child);\n          this.appendChild(child);\n        }\n      }\n\n      return node;\n    }\n\n    if (nodeBase._parentNodeInternal) {\n      nodeBase._parentNodeInternal.removeChild(nodeBase);\n    }\n\n    this._childNodesInternal.push(nodeBase);\n    nodeBase._parentNodeInternal = this;\n    nodeBase._ownerDocument = this._ownerDocument;\n\n    // Trigger connectedCallback if it's a custom element and connected to document\n    if (this.isConnected && (nodeBase as any).connectedCallback) {\n      console.log(`[NodeBase] Calling connectedCallback for <${nodeBase.nodeName}>`);\n      (nodeBase as any).connectedCallback();\n    }\n\n    return node;\n  }\n\n  removeChild<T extends Node>(child: T): T {\n    const childBase = child as any as NodeBase; // Internal cast\n    const index = this._findChildIndex(childBase);\n    if (index === -1) {\n      throw new Error('Node not found');\n    }\n\n    const wasConnected = childBase.isConnected;\n\n    this._childNodesInternal.splice(index, 1);\n    childBase._parentNodeInternal = null;\n\n    // Trigger disconnectedCallback if it was connected\n    if (wasConnected && (childBase as any).disconnectedCallback) {\n      (childBase as any).disconnectedCallback();\n    }\n\n    return child;\n  }\n\n  insertBefore<T extends Node>(node: T, child: Node | null): T {\n    if (child === null) {\n      return this.appendChild(node);\n    }\n\n    const nodeBase = node as any as NodeBase; // Internal cast\n    const childBase = child as any as NodeBase; // Internal cast\n    const index = this._findChildIndex(childBase);\n    if (index === -1) {\n      throw new Error('Reference node not found');\n    }\n\n    // Handle DocumentFragment - move all its children\n    if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {\n      const fragment = nodeBase as any;\n      const children = [...fragment._childNodesInternal]; // Copy array to avoid modification during iteration\n\n      let insertIndex = index;\n      for (const fragmentChild of children) {\n        // Remove from fragment\n        fragment.removeChild(fragmentChild);\n        // Insert at the current insert position\n        this._childNodesInternal.splice(insertIndex, 0, fragmentChild);\n        fragmentChild._parentNodeInternal = this;\n        fragmentChild._ownerDocument = this._ownerDocument;\n        // Increment insert index for next child to maintain order\n        insertIndex++;\n      }\n\n      return node;\n    }\n\n    if (nodeBase._parentNodeInternal) {\n      nodeBase._parentNodeInternal.removeChild(nodeBase);\n    }\n\n    this._childNodesInternal.splice(index, 0, nodeBase);\n    nodeBase._parentNodeInternal = this;\n    nodeBase._ownerDocument = this._ownerDocument;\n\n    // Trigger connectedCallback if it's a custom element and connected to document\n    if (this.isConnected && (nodeBase as any).connectedCallback) {\n      (nodeBase as any).connectedCallback();\n    }\n\n    return node;\n  }\n\n  replaceChild<T extends Node>(node: Node, child: T): T {\n    this.insertBefore(node, child);\n    this.removeChild(child);\n    return child;\n  }\n\n  cloneNode(deep?: boolean): Node {\n    // Basic clone implementation - would need to be overridden by specific node types\n    throw new Error('cloneNode must be implemented by subclasses');\n  }\n\n  hasChildNodes(): boolean {\n    return this._childNodesInternal.length > 0;\n  }\n\n  contains(other: Node | null): boolean {\n    if (!other || other === this) return other === this;\n\n    let node: Node | null = other;\n    while (node) {\n      if (node.parentNode === (this as unknown as ParentNode)) return true;\n      node = node.parentNode;\n    }\n    return false;\n  }\n\n  compareDocumentPosition(other: Node): number {\n    if (this === other) return 0;\n\n    const otherBase = other as any as NodeBase;\n\n    // Check if nodes are disconnected (not in same tree)\n    const thisRoot = this.getRootNode();\n    const otherRoot = otherBase.getRootNode();\n    if (thisRoot !== otherRoot) {\n      return DOCUMENT_POSITION_DISCONNECTED;\n    }\n\n    // Check containment relationships\n    if (this.contains(other)) return DOCUMENT_POSITION_CONTAINED_BY;\n    if (other.contains(this)) return DOCUMENT_POSITION_CONTAINS;\n\n    // Find document order by traversing up to common ancestor\n    const thisAncestors = this._getAncestors();\n    const otherAncestors = otherBase._getAncestors();\n\n    // Find common ancestor\n    let commonAncestor: NodeBase | null = null;\n    for (let i = 0; i < thisAncestors.length; i++) {\n      if (otherAncestors.includes(thisAncestors[i])) {\n        commonAncestor = thisAncestors[i];\n        break;\n      }\n    }\n\n    if (!commonAncestor) {\n      return DOCUMENT_POSITION_DISCONNECTED;\n    }\n\n    // Compare positions within common ancestor\n    const thisChild = this._getChildInAncestor(commonAncestor);\n    const otherChild = otherBase._getChildInAncestor(commonAncestor);\n\n    if (thisChild && otherChild && commonAncestor._childNodesInternal) {\n      const thisIndex = commonAncestor._childNodesInternal.indexOf(thisChild);\n      const otherIndex = commonAncestor._childNodesInternal.indexOf(otherChild);\n\n      if (thisIndex < otherIndex) {\n        return DOCUMENT_POSITION_FOLLOWING;\n      } else if (thisIndex > otherIndex) {\n        return DOCUMENT_POSITION_PRECEDING;\n      }\n    }\n\n    return DOCUMENT_POSITION_DISCONNECTED;\n  }\n\n  getRootNode(options?: GetRootNodeOptions): Node {\n    let root: Node = this;\n    while (root.parentNode) {\n      root = root.parentNode;\n    }\n    return root;\n  }\n\n  isEqualNode(otherNode: Node | null): boolean {\n    if (!otherNode) return false;\n    if (this === otherNode) return true;\n    if (this.nodeType !== otherNode.nodeType) return false;\n    if (this.nodeName !== otherNode.nodeName) return false;\n    return true; // Simplified comparison\n  }\n\n  isSameNode(otherNode: Node | null): boolean {\n    return this === otherNode;\n  }\n\n  isDefaultNamespace(namespace: string | null): boolean {\n    // Simplified implementation\n    return namespace === null || namespace === 'http://www.w3.org/1999/xhtml';\n  }\n\n  lookupNamespaceURI(prefix: string | null): string | null {\n    // Simplified implementation\n    if (prefix === null || prefix === '') {\n      return 'http://www.w3.org/1999/xhtml';\n    }\n    return null;\n  }\n\n  lookupPrefix(namespace: string | null): string | null {\n    // Simplified implementation\n    return null;\n  }\n\n  normalize(): void {\n    // Merge adjacent text nodes\n    for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {\n      const child = this._childNodesInternal[i];\n      if (child && child.nodeType === TEXT_NODE) {\n        const nextSibling = child.nextSibling;\n        if (nextSibling && nextSibling.nodeType === TEXT_NODE) {\n          child.nodeValue = (child.nodeValue || '') + (nextSibling.nodeValue || '');\n          this.removeChild(nextSibling);\n        }\n      }\n    }\n  }\n\n  // Helper methods\n  private _findIndexInParent(): number {\n    if (!this._parentNodeInternal) return -1;\n    return this._parentNodeInternal._childNodesInternal.indexOf(this);\n  }\n\n  private _findChildIndex(child: NodeBase): number {\n    return this._childNodesInternal.indexOf(child);\n  }\n\n  private _getAncestors(): NodeBase[] {\n    const ancestors: NodeBase[] = [];\n    let current: NodeBase | null = this._parentNodeInternal;\n    while (current) {\n      ancestors.push(current);\n      current = current._parentNodeInternal;\n    }\n    return ancestors;\n  }\n\n  private _getChildInAncestor(ancestor: NodeBase): NodeBase | null {\n    let current: NodeBase = this;\n    while (current._parentNodeInternal && current._parentNodeInternal !== ancestor) {\n      current = current._parentNodeInternal;\n    }\n    return current._parentNodeInternal === ancestor ? current : null;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAAua;AACva,2BAA8B;AAMvB,MAAe,SAAyB;AAAA,EA+C7C,YACS,UACA,UACP,eACA;AAHO;AACA;AATT;AAAA,SAAU,sBAAkC,CAAC;AAC7C,SAAO,sBAAuC;AAC9C;AAAA,SAAO,iBAAkC;AACzC;AAAA,SAAU,aAA4B;AACtC,SAAU,eAA8B;AACxC,SAAU,kBAAyE,CAAC;AAOlF,SAAK,iBAAiB,iBAAiB;AAAA,EACzC;AAAA,EAEA,iBAAiB,MAAc,UAAe,SAAqB;AACjE,SAAK,gBAAgB,KAAK;AAAA,MACxB;AAAA,MACA,UAAU,OAAO,aAAa,aAAa,WAAW,UAAU;AAAA,MAChE;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,oBAAoB,MAAc,UAAe,UAAsB;AACrE,UAAM,iBAAiB,OAAO,aAAa,aAAa,WAAW,UAAU;AAC7E,SAAK,kBAAkB,KAAK,gBAAgB,OAAO,OAAK,EAAE,EAAE,SAAS,QAAQ,EAAE,aAAa,eAAe;AAAA,EAC7G;AAAA,EAEA,cAAc,OAAqB;AAEjC,UAAM,OAAO,OAAO,UAAU,WAAW,QAAQ,MAAM;AACvD,UAAM,YAAY,KAAK,gBAAgB,OAAO,OAAK,EAAE,SAAS,IAAI;AAClE,eAAW,KAAK,WAAW;AACzB,UAAI;AACF,YAAI,OAAO,EAAE,aAAa,YAAY;AACpC,YAAE,SAAS,KAAK,MAAM,KAAK;AAAA,QAC7B,WAAW,EAAE,YAAY,OAAO,EAAE,SAAS,gBAAgB,YAAY;AACrE,YAAE,SAAS,YAAY,KAAK;AAAA,QAC9B;AAEA,YAAI,EAAE,SAAS,MAAM;AACnB,eAAK,oBAAoB,MAAM,EAAE,UAAU,EAAE,OAAO;AAAA,QACtD;AAAA,MACF,SAAS,GAAG;AACV,gBAAQ,MAAM,+BAA+B,IAAI,KAAK,CAAC;AAAA,MACzD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,UAAkB;AACpB,WAAO,KAAK,gBAAgB,OAAO;AAAA,EACrC;AAAA;AAAA,EAGA,IAAI,aAAoC;AACtC,WAAO,IAAI,mCAAyB,KAAK,mBAA6C;AAAA,EACxF;AAAA,EAEA,IAAI,aAA+B;AACjC,WAAO,KAAK,oBAAoB,SAAS,IAAK,KAAK,oBAAoB,CAAC,IAA6B;AAAA,EACvG;AAAA,EAEA,IAAI,YAA8B;AAChC,UAAM,SAAS,KAAK,oBAAoB;AACxC,WAAO,SAAS,IAAK,KAAK,oBAAoB,SAAS,CAAC,IAA6B;AAAA,EACvF;AAAA,EAEA,IAAI,cAAgC;AAClC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,UAAM,WAAW,KAAK,oBAAoB;AAC1C,UAAM,QAAQ,KAAK,mBAAmB;AACtC,WAAO,UAAU,MAAM,QAAQ,SAAS,SAAS,IAAK,SAAS,QAAQ,CAAC,IAA6B;AAAA,EACvG;AAAA,EAEA,IAAI,kBAAoC;AACtC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,UAAM,WAAW,KAAK,oBAAoB;AAC1C,UAAM,QAAQ,KAAK,mBAAmB;AACtC,WAAO,QAAQ,IAAK,SAAS,QAAQ,CAAC,IAA6B;AAAA,EACrE;AAAA,EAEA,IAAI,aAAgC;AAClC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,gBAAoC;AACtC,WAAO,KAAK,uBAAuB,KAAK,oBAAoB,aAAa,2BAAgB,KAAK,sBAAiD;AAAA,EACjJ;AAAA,EAEA,IAAI,gBAAiC;AACnC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,cAAuB;AACzB,QAAI,OAAoB;AACxB,WAAO,MAAM;AACX,UAAI,KAAK,aAAa,0BAAe,QAAO;AAC5C,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,YAA2B;AAC7B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,UAAU,OAAsB;AAClC,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,IAAI,cAA6B;AAC/B,QAAI,KAAK,aAAa,yBAAa,KAAK,aAAa,0BAAc;AAEjE,aAAO,KAAK,aAAa,KAAK,mBAAmB,KAAK,UAAU,IAAI,KAAK;AAAA,IAC3E;AAGA,QAAI,KAAK,iBAAiB,UAAa,KAAK,iBAAiB,MAAM;AACjE,aAAO,KAAK;AAAA,IACd;AAGA,QAAI,OAAO;AACX,eAAW,SAAS,KAAK,qBAAqB;AAC5C,YAAM,YAAY,MAAM;AACxB,UAAI,cAAc,QAAQ,cAAc,QAAW;AACjD,gBAAQ;AAAA,MACV;AAAA,IACF;AACA,WAAO,KAAK,SAAS,IAAI,OAAO;AAAA,EAClC;AAAA,EAEA,IAAI,YAAY,OAAsB;AAEpC,UAAM,cAAc,OAAO,KAAK;AAEhC,SAAK,eAAe;AAEpB,SAAK,sBAAsB,CAAC;AAC5B,QAAI,aAAa;AAEf,YAAM,eAAe,KAAK,mBAAmB,WAAW;AACxD,YAAM,EAAE,SAAS,IAAI,QAAQ,YAAY;AACzC,YAAM,WAAW,IAAI,SAAS,cAAc,KAAK,cAAc;AAC/D,WAAK,oBAAoB,KAAK,QAAQ;AACtC,eAAS,sBAAsB;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKU,mBAAmB,KAAqB;AAChD,UAAM,YAAuC;AAAA,MAC3C,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAEA,WAAO,IAAI,QAAQ,YAAY,UAAQ;AACrC,aAAO,UAAU,IAAI,KAAK;AAAA,IAC5B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKU,mBAAmB,KAAqB;AAChD,UAAM,YAAuC;AAAA,MAC3C,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,SAAS;AAAA,MACT,SAAS;AAAA,MACT,UAAU;AAAA,MACV,UAAU;AAAA,MACV,SAAS;AAAA,MACT,WAAW;AAAA,MACX,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,WAAO,IAAI,QAAQ,oBAAoB,YAAU;AAE/C,UAAI,UAAU,MAAM,GAAG;AACrB,eAAO,UAAU,MAAM;AAAA,MACzB;AAGA,UAAI,OAAO,WAAW,IAAI,KAAK,OAAO,SAAS,GAAG,GAAG;AACnD,cAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AACjC,cAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,YAAI,CAAC,MAAM,GAAG,GAAG;AACf,iBAAO,OAAO,aAAa,GAAG;AAAA,QAChC;AAAA,MACF;AAGA,UAAI,OAAO,WAAW,KAAK,KAAK,OAAO,SAAS,GAAG,GAAG;AACpD,cAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AACjC,cAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,YAAI,CAAC,MAAM,GAAG,GAAG;AACf,iBAAO,OAAO,aAAa,GAAG;AAAA,QAChC;AAAA,MACF;AAGA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,YAA4B,MAAY;AACtC,UAAM,WAAW;AAGjB,QAAI,SAAS,aAAa,oCAAwB;AAEhD,YAAM,WAAW;AAGjB,aAAO,SAAS,oBAAoB,SAAS,GAAG;AAC9C,cAAM,QAAQ,SAAS,oBAAoB,CAAC;AAC5C,YAAI,OAAO;AACT,mBAAS,YAAY,KAAK;AAC1B,eAAK,YAAY,KAAK;AAAA,QACxB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,qBAAqB;AAChC,eAAS,oBAAoB,YAAY,QAAQ;AAAA,IACnD;AAEA,SAAK,oBAAoB,KAAK,QAAQ;AACtC,aAAS,sBAAsB;AAC/B,aAAS,iBAAiB,KAAK;AAG/B,QAAI,KAAK,eAAgB,SAAiB,mBAAmB;AAC3D,cAAQ,IAAI,6CAA6C,SAAS,QAAQ,GAAG;AAC7E,MAAC,SAAiB,kBAAkB;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAA4B,OAAa;AACvC,UAAM,YAAY;AAClB,UAAM,QAAQ,KAAK,gBAAgB,SAAS;AAC5C,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI,MAAM,gBAAgB;AAAA,IAClC;AAEA,UAAM,eAAe,UAAU;AAE/B,SAAK,oBAAoB,OAAO,OAAO,CAAC;AACxC,cAAU,sBAAsB;AAGhC,QAAI,gBAAiB,UAAkB,sBAAsB;AAC3D,MAAC,UAAkB,qBAAqB;AAAA,IAC1C;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,aAA6B,MAAS,OAAuB;AAC3D,QAAI,UAAU,MAAM;AAClB,aAAO,KAAK,YAAY,IAAI;AAAA,IAC9B;AAEA,UAAM,WAAW;AACjB,UAAM,YAAY;AAClB,UAAM,QAAQ,KAAK,gBAAgB,SAAS;AAC5C,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AAGA,QAAI,SAAS,aAAa,oCAAwB;AAChD,YAAM,WAAW;AACjB,YAAM,WAAW,CAAC,GAAG,SAAS,mBAAmB;AAEjD,UAAI,cAAc;AAClB,iBAAW,iBAAiB,UAAU;AAEpC,iBAAS,YAAY,aAAa;AAElC,aAAK,oBAAoB,OAAO,aAAa,GAAG,aAAa;AAC7D,sBAAc,sBAAsB;AACpC,sBAAc,iBAAiB,KAAK;AAEpC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,qBAAqB;AAChC,eAAS,oBAAoB,YAAY,QAAQ;AAAA,IACnD;AAEA,SAAK,oBAAoB,OAAO,OAAO,GAAG,QAAQ;AAClD,aAAS,sBAAsB;AAC/B,aAAS,iBAAiB,KAAK;AAG/B,QAAI,KAAK,eAAgB,SAAiB,mBAAmB;AAC3D,MAAC,SAAiB,kBAAkB;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,aAA6B,MAAY,OAAa;AACpD,SAAK,aAAa,MAAM,KAAK;AAC7B,SAAK,YAAY,KAAK;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,MAAsB;AAE9B,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAAA,EAEA,gBAAyB;AACvB,WAAO,KAAK,oBAAoB,SAAS;AAAA,EAC3C;AAAA,EAEA,SAAS,OAA6B;AACpC,QAAI,CAAC,SAAS,UAAU,KAAM,QAAO,UAAU;AAE/C,QAAI,OAAoB;AACxB,WAAO,MAAM;AACX,UAAI,KAAK,eAAgB,KAAgC,QAAO;AAChE,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,wBAAwB,OAAqB;AAC3C,QAAI,SAAS,MAAO,QAAO;AAE3B,UAAM,YAAY;AAGlB,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,YAAY,UAAU,YAAY;AACxC,QAAI,aAAa,WAAW;AAC1B,aAAO;AAAA,IACT;AAGA,QAAI,KAAK,SAAS,KAAK,EAAG,QAAO;AACjC,QAAI,MAAM,SAAS,IAAI,EAAG,QAAO;AAGjC,UAAM,gBAAgB,KAAK,cAAc;AACzC,UAAM,iBAAiB,UAAU,cAAc;AAG/C,QAAI,iBAAkC;AACtC,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,eAAe,SAAS,cAAc,CAAC,CAAC,GAAG;AAC7C,yBAAiB,cAAc,CAAC;AAChC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,gBAAgB;AACnB,aAAO;AAAA,IACT;AAGA,UAAM,YAAY,KAAK,oBAAoB,cAAc;AACzD,UAAM,aAAa,UAAU,oBAAoB,cAAc;AAE/D,QAAI,aAAa,cAAc,eAAe,qBAAqB;AACjE,YAAM,YAAY,eAAe,oBAAoB,QAAQ,SAAS;AACtE,YAAM,aAAa,eAAe,oBAAoB,QAAQ,UAAU;AAExE,UAAI,YAAY,YAAY;AAC1B,eAAO;AAAA,MACT,WAAW,YAAY,YAAY;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,SAAoC;AAC9C,QAAI,OAAa;AACjB,WAAO,KAAK,YAAY;AACtB,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,WAAiC;AAC3C,QAAI,CAAC,UAAW,QAAO;AACvB,QAAI,SAAS,UAAW,QAAO;AAC/B,QAAI,KAAK,aAAa,UAAU,SAAU,QAAO;AACjD,QAAI,KAAK,aAAa,UAAU,SAAU,QAAO;AACjD,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,WAAiC;AAC1C,WAAO,SAAS;AAAA,EAClB;AAAA,EAEA,mBAAmB,WAAmC;AAEpD,WAAO,cAAc,QAAQ,cAAc;AAAA,EAC7C;AAAA,EAEA,mBAAmB,QAAsC;AAEvD,QAAI,WAAW,QAAQ,WAAW,IAAI;AACpC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,WAAyC;AAEpD,WAAO;AAAA,EACT;AAAA,EAEA,YAAkB;AAEhB,aAAS,IAAI,KAAK,oBAAoB,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7D,YAAM,QAAQ,KAAK,oBAAoB,CAAC;AACxC,UAAI,SAAS,MAAM,aAAa,uBAAW;AACzC,cAAM,cAAc,MAAM;AAC1B,YAAI,eAAe,YAAY,aAAa,uBAAW;AACrD,gBAAM,aAAa,MAAM,aAAa,OAAO,YAAY,aAAa;AACtE,eAAK,YAAY,WAAW;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGQ,qBAA6B;AACnC,QAAI,CAAC,KAAK,oBAAqB,QAAO;AACtC,WAAO,KAAK,oBAAoB,oBAAoB,QAAQ,IAAI;AAAA,EAClE;AAAA,EAEQ,gBAAgB,OAAyB;AAC/C,WAAO,KAAK,oBAAoB,QAAQ,KAAK;AAAA,EAC/C;AAAA,EAEQ,gBAA4B;AAClC,UAAM,YAAwB,CAAC;AAC/B,QAAI,UAA2B,KAAK;AACpC,WAAO,SAAS;AACd,gBAAU,KAAK,OAAO;AACtB,gBAAU,QAAQ;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,oBAAoB,UAAqC;AAC/D,QAAI,UAAoB;AACxB,WAAO,QAAQ,uBAAuB,QAAQ,wBAAwB,UAAU;AAC9E,gBAAU,QAAQ;AAAA,IACpB;AACA,WAAO,QAAQ,wBAAwB,WAAW,UAAU;AAAA,EAC9D;AACF;AAAA;AA5gBsB,SAEJ,eAAe;AAFX,SAGJ,iBAAiB;AAHb,SAIJ,YAAY;AAJR,SAKJ,qBAAqB;AALjB,SAMJ,wBAAwB;AANpB,SAOJ,cAAc;AAPV,SAQJ,8BAA8B;AAR1B,SASJ,eAAe;AATX,SAUJ,gBAAgB;AAVZ,SAWJ,qBAAqB;AAXjB,SAYJ,yBAAyB;AAZrB,SAaJ,gBAAgB;AAbZ,SAcJ,iCAAiC;AAd7B,SAeJ,8BAA8B;AAf1B,SAgBJ,8BAA8B;AAhB1B,SAiBJ,6BAA6B;AAjBzB,SAkBJ,iCAAiC;AAlB7B,SAmBJ,4CAA4C;",
   "names": []
 }

package/dist/cjs/node/NodeFilter.js

@@ -0,0 +1,43 @@
+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 NodeFilter_exports = {};
+__export(NodeFilter_exports, {
+  NodeFilter: () => NodeFilter
+});
+module.exports = __toCommonJS(NodeFilter_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
+};
+//# sourceMappingURL=NodeFilter.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/node/NodeFilter.ts"],
+  "sourcesContent": ["// import { Node } from './Node';\n\n/**\n * NodeFilter interface for filtering nodes in NodeIterator and TreeWalker\n */\n// export interface NodeFilter {\n//   acceptNode(node: Node): number;\n// }\n\n/**\n * NodeFilter constants and static methods\n */\nexport const NodeFilter: {\n  readonly FILTER_ACCEPT: number;\n  readonly FILTER_REJECT: number;\n  readonly FILTER_SKIP: number;\n  readonly SHOW_ALL: number;\n  readonly SHOW_ELEMENT: number;\n  readonly SHOW_ATTRIBUTE: number;\n  readonly SHOW_TEXT: number;\n  readonly SHOW_CDATA_SECTION: number;\n  readonly SHOW_ENTITY_REFERENCE: number;\n  readonly SHOW_ENTITY: number;\n  readonly SHOW_PROCESSING_INSTRUCTION: number;\n  readonly SHOW_COMMENT: number;\n  readonly SHOW_DOCUMENT: number;\n  readonly SHOW_DOCUMENT_TYPE: number;\n  readonly SHOW_DOCUMENT_FRAGMENT: number;\n  readonly SHOW_NOTATION: number;\n} = {\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"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAYO,MAAM,aAiBT;AAAA;AAAA,EAEF,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;AACjB;",
+  "names": []
+}

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);