@dooboostore/dom-parser 1.0.0

package/dist/esm/node/NodeBase.js

@@ -0,0 +1,380 @@
+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.js";
+import { NodeListOf } from "./collection/NodeListOf.js";
+class NodeBase {
+  constructor(nodeType, nodeName, ownerDocument) {
+    this.nodeType = nodeType;
+    this.nodeName = nodeName;
+    // Internal properties (for Base class implementations)
+    this._childNodesInternal = [];
+    this._parentNodeInternal = null;
+    // Internal parent reference
+    this._ownerDocument = null;
+    // Made public for ChildNodeBase access
+    this._nodeValue = null;
+    this._textContent = null;
+    this._ownerDocument = ownerDocument || null;
+  }
+  // Node interface implementation
+  get baseURI() {
+    return this._ownerDocument?.URL || "";
+  }
+  // External interface - returns proper Node interface types
+  get childNodes() {
+    return new NodeListOf(this._childNodesInternal);
+  }
+  get firstChild() {
+    return this._childNodesInternal.length > 0 ? this._childNodesInternal[0] : null;
+  }
+  get lastChild() {
+    const length = this._childNodesInternal.length;
+    return length > 0 ? this._childNodesInternal[length - 1] : null;
+  }
+  get nextSibling() {
+    if (!this._parentNodeInternal) return null;
+    const siblings = this._parentNodeInternal._childNodesInternal;
+    const index = this._findIndexInParent();
+    return index !== -1 && index < siblings.length - 1 ? siblings[index + 1] : null;
+  }
+  get previousSibling() {
+    if (!this._parentNodeInternal) return null;
+    const siblings = this._parentNodeInternal._childNodesInternal;
+    const index = this._findIndexInParent();
+    return index > 0 ? siblings[index - 1] : null;
+  }
+  get parentNode() {
+    return this._parentNodeInternal;
+  }
+  get parentElement() {
+    return this._parentNodeInternal && this._parentNodeInternal.nodeType === ELEMENT_NODE ? this._parentNodeInternal : null;
+  }
+  get ownerDocument() {
+    return this._ownerDocument;
+  }
+  get isConnected() {
+    let node = this;
+    while (node) {
+      if (node.nodeType === DOCUMENT_NODE) return true;
+      node = node.parentNode;
+    }
+    return false;
+  }
+  get nodeValue() {
+    return this._nodeValue;
+  }
+  set nodeValue(value) {
+    this._nodeValue = value;
+  }
+  get textContent() {
+    if (this.nodeType === TEXT_NODE || this.nodeType === COMMENT_NODE) {
+      return this._nodeValue ? this.decodeHTMLEntities(this._nodeValue) : this._nodeValue;
+    }
+    if (this._textContent !== void 0 && this._textContent !== null) {
+      return this._textContent;
+    }
+    let text = "";
+    for (const child of this._childNodesInternal) {
+      const childText = child.textContent;
+      if (childText !== null && childText !== void 0) {
+        text += childText;
+      }
+    }
+    return text.length > 0 ? text : null;
+  }
+  set textContent(value) {
+    const stringValue = String(value);
+    this._textContent = stringValue;
+    this._childNodesInternal = [];
+    if (stringValue) {
+      const escapedValue = this.escapeHTMLEntities(stringValue);
+      const { TextBase } = require("./TextBase");
+      const textNode = new TextBase(escapedValue, this._ownerDocument);
+      this._childNodesInternal.push(textNode);
+      textNode._parentNodeInternal = this;
+    }
+  }
+  /**
+   * Escape HTML entities in a string to prevent XSS
+   */
+  escapeHTMLEntities(str) {
+    const entityMap = {
+      "&": "&amp;",
+      "<": "&lt;",
+      ">": "&gt;",
+      '"': "&quot;",
+      "'": "&#39;"
+    };
+    return str.replace(/[&<>"']/g, (char) => {
+      return entityMap[char] || char;
+    });
+  }
+  /**
+   * Decode HTML entities in a string
+   */
+  decodeHTMLEntities(str) {
+    const entityMap = {
+      "&amp;": "&",
+      "&lt;": "<",
+      "&gt;": ">",
+      "&quot;": '"',
+      "&#39;": "'",
+      "&#34;": '"',
+      "&apos;": "'",
+      "&copy;": "\xA9",
+      "&reg;": "\xAE",
+      "&trade;": "\u2122",
+      "&nbsp;": " ",
+      "&hellip;": "\u2026",
+      "&mdash;": "\u2014",
+      "&ndash;": "\u2013",
+      "&lsquo;": "\u2018",
+      "&rsquo;": "\u2019",
+      "&ldquo;": '"',
+      "&rdquo;": '"'
+    };
+    return str.replace(/&[a-zA-Z0-9#]+;/g, (entity) => {
+      if (entityMap[entity]) {
+        return entityMap[entity];
+      }
+      if (entity.startsWith("&#") && entity.endsWith(";")) {
+        const numStr = entity.slice(2, -1);
+        const num = parseInt(numStr, 10);
+        if (!isNaN(num)) {
+          return String.fromCharCode(num);
+        }
+      }
+      if (entity.startsWith("&#x") && entity.endsWith(";")) {
+        const hexStr = entity.slice(3, -1);
+        const num = parseInt(hexStr, 16);
+        if (!isNaN(num)) {
+          return String.fromCharCode(num);
+        }
+      }
+      return entity;
+    });
+  }
+  // Node methods - external interface uses Node types, internal uses NodeBase
+  appendChild(node) {
+    const nodeBase = node;
+    if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {
+      const fragment = nodeBase;
+      while (fragment._childNodesInternal.length > 0) {
+        const child = fragment._childNodesInternal[0];
+        if (child) {
+          fragment.removeChild(child);
+          this.appendChild(child);
+        }
+      }
+      return node;
+    }
+    if (nodeBase._parentNodeInternal) {
+      nodeBase._parentNodeInternal.removeChild(nodeBase);
+    }
+    this._childNodesInternal.push(nodeBase);
+    nodeBase._parentNodeInternal = this;
+    nodeBase._ownerDocument = this._ownerDocument;
+    return node;
+  }
+  removeChild(child) {
+    const childBase = child;
+    const index = this._findChildIndex(childBase);
+    if (index === -1) {
+      throw new Error("Node not found");
+    }
+    this._childNodesInternal.splice(index, 1);
+    childBase._parentNodeInternal = null;
+    return child;
+  }
+  insertBefore(node, child) {
+    if (child === null) {
+      return this.appendChild(node);
+    }
+    const nodeBase = node;
+    const childBase = child;
+    const index = this._findChildIndex(childBase);
+    if (index === -1) {
+      throw new Error("Reference node not found");
+    }
+    if (nodeBase.nodeType === DOCUMENT_FRAGMENT_NODE) {
+      const fragment = nodeBase;
+      const children = [...fragment._childNodesInternal];
+      let insertIndex = index;
+      for (const fragmentChild of children) {
+        fragment.removeChild(fragmentChild);
+        this._childNodesInternal.splice(insertIndex, 0, fragmentChild);
+        fragmentChild._parentNodeInternal = this;
+        fragmentChild._ownerDocument = this._ownerDocument;
+        insertIndex++;
+      }
+      return node;
+    }
+    if (nodeBase._parentNodeInternal) {
+      nodeBase._parentNodeInternal.removeChild(nodeBase);
+    }
+    this._childNodesInternal.splice(index, 0, nodeBase);
+    nodeBase._parentNodeInternal = this;
+    nodeBase._ownerDocument = this._ownerDocument;
+    return node;
+  }
+  replaceChild(node, child) {
+    this.insertBefore(node, child);
+    this.removeChild(child);
+    return child;
+  }
+  cloneNode(deep) {
+    throw new Error("cloneNode must be implemented by subclasses");
+  }
+  hasChildNodes() {
+    return this._childNodesInternal.length > 0;
+  }
+  contains(other) {
+    if (!other || other === this) return other === this;
+    let node = other;
+    while (node) {
+      if (node.parentNode === this) return true;
+      node = node.parentNode;
+    }
+    return false;
+  }
+  compareDocumentPosition(other) {
+    if (this === other) return 0;
+    const otherBase = other;
+    const thisRoot = this.getRootNode();
+    const otherRoot = otherBase.getRootNode();
+    if (thisRoot !== otherRoot) {
+      return DOCUMENT_POSITION_DISCONNECTED;
+    }
+    if (this.contains(other)) return DOCUMENT_POSITION_CONTAINED_BY;
+    if (other.contains(this)) return DOCUMENT_POSITION_CONTAINS;
+    const thisAncestors = this._getAncestors();
+    const otherAncestors = otherBase._getAncestors();
+    let commonAncestor = null;
+    for (let i = 0; i < thisAncestors.length; i++) {
+      if (otherAncestors.includes(thisAncestors[i])) {
+        commonAncestor = thisAncestors[i];
+        break;
+      }
+    }
+    if (!commonAncestor) {
+      return DOCUMENT_POSITION_DISCONNECTED;
+    }
+    const thisChild = this._getChildInAncestor(commonAncestor);
+    const otherChild = otherBase._getChildInAncestor(commonAncestor);
+    if (thisChild && otherChild && commonAncestor._childNodesInternal) {
+      const thisIndex = commonAncestor._childNodesInternal.indexOf(thisChild);
+      const otherIndex = commonAncestor._childNodesInternal.indexOf(otherChild);
+      if (thisIndex < otherIndex) {
+        return DOCUMENT_POSITION_FOLLOWING;
+      } else if (thisIndex > otherIndex) {
+        return DOCUMENT_POSITION_PRECEDING;
+      }
+    }
+    return DOCUMENT_POSITION_DISCONNECTED;
+  }
+  getRootNode(options) {
+    let root = this;
+    while (root.parentNode) {
+      root = root.parentNode;
+    }
+    return root;
+  }
+  isEqualNode(otherNode) {
+    if (!otherNode) return false;
+    if (this === otherNode) return true;
+    if (this.nodeType !== otherNode.nodeType) return false;
+    if (this.nodeName !== otherNode.nodeName) return false;
+    return true;
+  }
+  isSameNode(otherNode) {
+    return this === otherNode;
+  }
+  isDefaultNamespace(namespace) {
+    return namespace === null || namespace === "http://www.w3.org/1999/xhtml";
+  }
+  lookupNamespaceURI(prefix) {
+    if (prefix === null || prefix === "") {
+      return "http://www.w3.org/1999/xhtml";
+    }
+    return null;
+  }
+  lookupPrefix(namespace) {
+    return null;
+  }
+  normalize() {
+    for (let i = this._childNodesInternal.length - 1; i >= 0; i--) {
+      const child = this._childNodesInternal[i];
+      if (child && child.nodeType === TEXT_NODE) {
+        const nextSibling = child.nextSibling;
+        if (nextSibling && nextSibling.nodeType === TEXT_NODE) {
+          child.nodeValue = (child.nodeValue || "") + (nextSibling.nodeValue || "");
+          this.removeChild(nextSibling);
+        }
+      }
+    }
+  }
+  // Helper methods
+  _findIndexInParent() {
+    if (!this._parentNodeInternal) return -1;
+    return this._parentNodeInternal._childNodesInternal.indexOf(this);
+  }
+  _findChildIndex(child) {
+    return this._childNodesInternal.indexOf(child);
+  }
+  _getAncestors() {
+    const ancestors = [];
+    let current = this._parentNodeInternal;
+    while (current) {
+      ancestors.push(current);
+      current = current._parentNodeInternal;
+    }
+    return ancestors;
+  }
+  _getChildInAncestor(ancestor) {
+    let current = this;
+    while (current._parentNodeInternal && current._parentNodeInternal !== ancestor) {
+      current = current._parentNodeInternal;
+    }
+    return current._parentNodeInternal === ancestor ? current : null;
+  }
+}
+// Node constants as instance properties
+NodeBase.ELEMENT_NODE = ELEMENT_NODE;
+NodeBase.ATTRIBUTE_NODE = ATTRIBUTE_NODE;
+NodeBase.TEXT_NODE = TEXT_NODE;
+NodeBase.CDATA_SECTION_NODE = CDATA_SECTION_NODE;
+NodeBase.ENTITY_REFERENCE_NODE = ENTITY_REFERENCE_NODE;
+NodeBase.ENTITY_NODE = ENTITY_NODE;
+NodeBase.PROCESSING_INSTRUCTION_NODE = PROCESSING_INSTRUCTION_NODE;
+NodeBase.COMMENT_NODE = COMMENT_NODE;
+NodeBase.DOCUMENT_NODE = DOCUMENT_NODE;
+NodeBase.DOCUMENT_TYPE_NODE = DOCUMENT_TYPE_NODE;
+NodeBase.DOCUMENT_FRAGMENT_NODE = DOCUMENT_FRAGMENT_NODE;
+NodeBase.NOTATION_NODE = NOTATION_NODE;
+NodeBase.DOCUMENT_POSITION_DISCONNECTED = DOCUMENT_POSITION_DISCONNECTED;
+NodeBase.DOCUMENT_POSITION_PRECEDING = DOCUMENT_POSITION_PRECEDING;
+NodeBase.DOCUMENT_POSITION_FOLLOWING = DOCUMENT_POSITION_FOLLOWING;
+NodeBase.DOCUMENT_POSITION_CONTAINS = DOCUMENT_POSITION_CONTAINS;
+NodeBase.DOCUMENT_POSITION_CONTAINED_BY = DOCUMENT_POSITION_CONTAINED_BY;
+NodeBase.DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;
+export {
+  NodeBase
+};
+//# sourceMappingURL=NodeBase.js.map

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

@@ -0,0 +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,EACI;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACG;AAGP,SAAS,kBAAkB;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,WAAsB,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,eACnE,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,cAAe,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,aAAa,KAAK,aAAa,cAAc;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,wBAAwB;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,wBAAwB;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,WAAW;AACvC,cAAM,cAAc,MAAM;AAC1B,YAAI,eAAe,YAAY,aAAa,WAAW;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;",
+  "names": []
+}

package/dist/esm/node/NodeIterator.js

@@ -0,0 +1,144 @@
+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;
+    this._root = root;
+    this._whatToShow = whatToShow;
+    this._filter = filter;
+    this._currentNode = root;
+  }
+  get root() {
+    return this._root;
+  }
+  get whatToShow() {
+    return this._whatToShow;
+  }
+  get filter() {
+    return this._filter;
+  }
+  get referenceNode() {
+    return this._currentNode;
+  }
+  get pointerBeforeReferenceNode() {
+    return this._beforeReferenceNode;
+  }
+  /**
+   * Move to the next node in document order
+   */
+  nextNode() {
+    let node = this._currentNode;
+    if (this._beforeReferenceNode) {
+      this._beforeReferenceNode = false;
+      if (this._acceptNode(node)) {
+        return node;
+      }
+    }
+    while (node) {
+      const firstChild = node.firstChild;
+      if (firstChild) {
+        node = firstChild;
+        if (this._acceptNode(node)) {
+          this._currentNode = node;
+          return node;
+        }
+        continue;
+      }
+      while (node && !node.nextSibling) {
+        node = node.parentNode;
+        if (!node || node === this._root.parentNode) {
+          return null;
+        }
+      }
+      if (!node) {
+        return null;
+      }
+      node = node.nextSibling;
+      if (this._acceptNode(node)) {
+        this._currentNode = node;
+        return node;
+      }
+    }
+    return null;
+  }
+  /**
+   * Move to the previous node in document order
+   */
+  previousNode() {
+    let node = this._currentNode;
+    if (!this._beforeReferenceNode) {
+      this._beforeReferenceNode = true;
+      if (this._acceptNode(node)) {
+        return node;
+      }
+    }
+    while (node && node !== this._root) {
+      const prevSibling = node.previousSibling;
+      if (prevSibling) {
+        node = prevSibling;
+        while (node.lastChild) {
+          node = node.lastChild;
+        }
+        if (this._acceptNode(node)) {
+          this._currentNode = node;
+          return node;
+        }
+        continue;
+      }
+      node = node.parentNode;
+      if (!node || node === this._root.parentNode) {
+        return null;
+      }
+      if (this._acceptNode(node)) {
+        this._currentNode = node;
+        return node;
+      }
+    }
+    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;
+    }
+    const nodeTypeMask = 1 << node.nodeType - 1;
+    if (!(this._whatToShow & nodeTypeMask)) {
+      return false;
+    }
+    if (this._filter) {
+      const result = this._filter.acceptNode(node);
+      return result === NodeFilter.FILTER_ACCEPT;
+    }
+    return true;
+  }
+}
+export {
+  NodeFilter,
+  NodeIterator
+};
+//# sourceMappingURL=NodeIterator.js.map

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

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

package/dist/esm/node/ParentNode.js

@@ -0,0 +1 @@
+//# sourceMappingURL=ParentNode.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
+  "names": []
+}