projen 0.99.2 → 0.99.3

package/node_modules/@oozcitak/dom/lib/algorithm/NodeAlgorithm.js

@@ -0,0 +1,488 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.node_stringReplaceAll = node_stringReplaceAll;
+exports.node_clone = node_clone;
+exports.node_equals = node_equals;
+exports.node_listOfElementsWithQualifiedName = node_listOfElementsWithQualifiedName;
+exports.node_listOfElementsWithNamespace = node_listOfElementsWithNamespace;
+exports.node_listOfElementsWithClassNames = node_listOfElementsWithClassNames;
+exports.node_locateANamespacePrefix = node_locateANamespacePrefix;
+exports.node_locateANamespace = node_locateANamespace;
+const DOMImpl_1 = require("../dom/DOMImpl");
+const util_1 = require("../util");
+const infra_1 = require("@oozcitak/infra");
+const CreateAlgorithm_1 = require("./CreateAlgorithm");
+const OrderedSetAlgorithm_1 = require("./OrderedSetAlgorithm");
+const DOMAlgorithm_1 = require("./DOMAlgorithm");
+const MutationAlgorithm_1 = require("./MutationAlgorithm");
+const ElementAlgorithm_1 = require("./ElementAlgorithm");
+/**
+ * Replaces the contents of the given node with a single text node.
+ *
+ * @param string - node contents
+ * @param parent - a node
+ */
+function node_stringReplaceAll(str, parent) {
+    /**
+     * 1. Let node be null.
+     * 2. If string is not the empty string, then set node to a new Text node
+     * whose data is string and node document is parent’s node document.
+     * 3. Replace all with node within parent.
+     */
+    let node = null;
+    if (str !== '') {
+        node = (0, CreateAlgorithm_1.create_text)(parent._nodeDocument, str);
+    }
+    (0, MutationAlgorithm_1.mutation_replaceAll)(node, parent);
+}
+/**
+ * Clones a node.
+ *
+ * @param node - a node to clone
+ * @param document - the document to own the cloned node
+ * @param cloneChildrenFlag - whether to clone node's children
+ */
+function node_clone(node, document = null, cloneChildrenFlag = false) {
+    /**
+     * 1. If document is not given, let document be node’s node document.
+     */
+    if (document === null)
+        document = node._nodeDocument;
+    let copy;
+    if (util_1.Guard.isElementNode(node)) {
+        /**
+         * 2. If node is an element, then:
+         * 2.1. Let copy be the result of creating an element, given document,
+         * node’s local name, node’s namespace, node’s namespace prefix,
+         * and node’s is value, with the synchronous custom elements flag unset.
+         * 2.2. For each attribute in node’s attribute list:
+         * 2.2.1. Let copyAttribute be a clone of attribute.
+         * 2.2.2. Append copyAttribute to copy.
+         */
+        copy = (0, ElementAlgorithm_1.element_createAnElement)(document, node._localName, node._namespace, node._namespacePrefix, node._is, false);
+        for (const attribute of node._attributeList) {
+            const copyAttribute = node_clone(attribute, document);
+            (0, ElementAlgorithm_1.element_append)(copyAttribute, copy);
+        }
+    }
+    else {
+        /**
+         * 3. Otherwise, let copy be a node that implements the same interfaces as
+         * node, and fulfills these additional requirements, switching on node:
+         * - Document
+         * Set copy’s encoding, content type, URL, origin, type, and mode, to those
+         * of node.
+         * - DocumentType
+         * Set copy’s name, public ID, and system ID, to those of node.
+         * - Attr
+         * Set copy’s namespace, namespace prefix, local name, and value, to
+         * those of node.
+         * - Text
+         * - Comment
+         * Set copy’s data, to that of node.
+         * - ProcessingInstruction
+         * Set copy’s target and data to those of node.
+         * - Any other node
+         */
+        if (util_1.Guard.isDocumentNode(node)) {
+            const doc = (0, CreateAlgorithm_1.create_document)();
+            doc._encoding = node._encoding;
+            doc._contentType = node._contentType;
+            doc._URL = node._URL;
+            doc._origin = node._origin;
+            doc._type = node._type;
+            doc._mode = node._mode;
+            copy = doc;
+        }
+        else if (util_1.Guard.isDocumentTypeNode(node)) {
+            const doctype = (0, CreateAlgorithm_1.create_documentType)(document, node._name, node._publicId, node._systemId);
+            copy = doctype;
+        }
+        else if (util_1.Guard.isAttrNode(node)) {
+            const attr = (0, CreateAlgorithm_1.create_attr)(document, node.localName);
+            attr._namespace = node._namespace;
+            attr._namespacePrefix = node._namespacePrefix;
+            attr._value = node._value;
+            copy = attr;
+        }
+        else if (util_1.Guard.isExclusiveTextNode(node)) {
+            copy = (0, CreateAlgorithm_1.create_text)(document, node._data);
+        }
+        else if (util_1.Guard.isCDATASectionNode(node)) {
+            copy = (0, CreateAlgorithm_1.create_cdataSection)(document, node._data);
+        }
+        else if (util_1.Guard.isCommentNode(node)) {
+            copy = (0, CreateAlgorithm_1.create_comment)(document, node._data);
+        }
+        else if (util_1.Guard.isProcessingInstructionNode(node)) {
+            copy = (0, CreateAlgorithm_1.create_processingInstruction)(document, node._target, node._data);
+        }
+        else if (util_1.Guard.isDocumentFragmentNode(node)) {
+            copy = (0, CreateAlgorithm_1.create_documentFragment)(document);
+        }
+        else {
+            copy = Object.create(node);
+        }
+    }
+    /**
+     * 4. Set copy’s node document and document to copy, if copy is a document,
+     * and set copy’s node document to document otherwise.
+     */
+    if (util_1.Guard.isDocumentNode(copy)) {
+        copy._nodeDocument = copy;
+        document = copy;
+    }
+    else {
+        copy._nodeDocument = document;
+    }
+    /**
+     * 5. Run any cloning steps defined for node in other applicable
+     * specifications and pass copy, node, document and the clone children flag
+     * if set, as parameters.
+     */
+    if (DOMImpl_1.dom.features.steps) {
+        (0, DOMAlgorithm_1.dom_runCloningSteps)(copy, node, document, cloneChildrenFlag);
+    }
+    /**
+     * 6. If the clone children flag is set, clone all the children of node and
+     * append them to copy, with document as specified and the clone children
+     * flag being set.
+     */
+    if (cloneChildrenFlag) {
+        for (const child of node._children) {
+            const childCopy = node_clone(child, document, true);
+            (0, MutationAlgorithm_1.mutation_append)(childCopy, copy);
+        }
+    }
+    /**
+     * 7. Return copy.
+     */
+    return copy;
+}
+/**
+ * Determines if two nodes can be considered equal.
+ *
+ * @param a - node to compare
+ * @param b - node to compare
+ */
+function node_equals(a, b) {
+    /**
+     * 1. A and B’s nodeType attribute value is identical.
+     */
+    if (a._nodeType !== b._nodeType)
+        return false;
+    /**
+     * 2. The following are also equal, depending on A:
+     * - DocumentType
+     * Its name, public ID, and system ID.
+     * - Element
+     * Its namespace, namespace prefix, local name, and its attribute list’s size.
+     * - Attr
+     * Its namespace, local name, and value.
+     * - ProcessingInstruction
+     * Its target and data.
+     * - Text
+     * - Comment
+     * Its data.
+     */
+    if (util_1.Guard.isDocumentTypeNode(a) && util_1.Guard.isDocumentTypeNode(b)) {
+        if (a._name !== b._name || a._publicId !== b._publicId ||
+            a._systemId !== b._systemId)
+            return false;
+    }
+    else if (util_1.Guard.isElementNode(a) && util_1.Guard.isElementNode(b)) {
+        if (a._namespace !== b._namespace || a._namespacePrefix !== b._namespacePrefix ||
+            a._localName !== b._localName ||
+            a._attributeList.length !== b._attributeList.length)
+            return false;
+    }
+    else if (util_1.Guard.isAttrNode(a) && util_1.Guard.isAttrNode(b)) {
+        if (a._namespace !== b._namespace || a._localName !== b._localName ||
+            a._value !== b._value)
+            return false;
+    }
+    else if (util_1.Guard.isProcessingInstructionNode(a) && util_1.Guard.isProcessingInstructionNode(b)) {
+        if (a._target !== b._target || a._data !== b._data)
+            return false;
+    }
+    else if (util_1.Guard.isCharacterDataNode(a) && util_1.Guard.isCharacterDataNode(b)) {
+        if (a._data !== b._data)
+            return false;
+    }
+    /**
+     * 3. If A is an element, each attribute in its attribute list has an attribute
+     * that equals an attribute in B’s attribute list.
+     */
+    if (util_1.Guard.isElementNode(a) && util_1.Guard.isElementNode(b)) {
+        const attrMap = {};
+        for (const attrA of a._attributeList) {
+            attrMap[attrA._localName] = attrA;
+        }
+        for (const attrB of b._attributeList) {
+            const attrA = attrMap[attrB._localName];
+            if (!attrA)
+                return false;
+            if (!node_equals(attrA, attrB))
+                return false;
+        }
+    }
+    /**
+     * 4. A and B have the same number of children.
+     * 5. Each child of A equals the child of B at the identical index.
+     */
+    if (a._children.size !== b._children.size)
+        return false;
+    const itA = a._children[Symbol.iterator]();
+    const itB = b._children[Symbol.iterator]();
+    let resultA = itA.next();
+    let resultB = itB.next();
+    while (!resultA.done && !resultB.done) {
+        const child1 = resultA.value;
+        const child2 = resultB.value;
+        if (!node_equals(child1, child2))
+            return false;
+        resultA = itA.next();
+        resultB = itB.next();
+    }
+    return true;
+}
+/**
+ * Returns a collection of elements with the given qualified name which are
+ * descendants of the given root node.
+ * See: https://dom.spec.whatwg.org/#concept-getelementsbytagname
+ *
+ * @param qualifiedName - qualified name
+ * @param root - root node
+ */
+function node_listOfElementsWithQualifiedName(qualifiedName, root) {
+    /**
+     * 1. If qualifiedName is "*" (U+002A), return a HTMLCollection rooted at
+     * root, whose filter matches only descendant elements.
+     * 2. Otherwise, if root’s node document is an HTML document, return a
+     * HTMLCollection rooted at root, whose filter matches the following
+     * descendant elements:
+     * 2.1. Whose namespace is the HTML namespace and whose qualified name is
+     * qualifiedName, in ASCII lowercase.
+     * 2.2. Whose namespace is not the HTML namespace and whose qualified name
+     * is qualifiedName.
+     * 3. Otherwise, return a HTMLCollection rooted at root, whose filter
+     * matches descendant elements whose qualified name is qualifiedName.
+     */
+    if (qualifiedName === "*") {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root);
+    }
+    else if (root._nodeDocument._type === "html") {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+            if (ele._namespace === infra_1.namespace.HTML &&
+                ele._qualifiedName === qualifiedName.toLowerCase()) {
+                return true;
+            }
+            else if (ele._namespace !== infra_1.namespace.HTML &&
+                ele._qualifiedName === qualifiedName) {
+                return true;
+            }
+            else {
+                return false;
+            }
+        });
+    }
+    else {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+            return (ele._qualifiedName === qualifiedName);
+        });
+    }
+}
+/**
+ * Returns a collection of elements with the given namespace which are
+ * descendants of the given root node.
+ * See: https://dom.spec.whatwg.org/#concept-getelementsbytagnamens
+ *
+ * @param namespace - element namespace
+ * @param localName - local name
+ * @param root - root node
+ */
+function node_listOfElementsWithNamespace(namespace, localName, root) {
+    /**
+     * 1. If namespace is the empty string, set it to null.
+     * 2. If both namespace and localName are "*" (U+002A), return a
+     * HTMLCollection rooted at root, whose filter matches descendant elements.
+     * 3. Otherwise, if namespace is "*" (U+002A), return a HTMLCollection
+     * rooted at root, whose filter matches descendant elements whose local
+     * name is localName.
+     * 4. Otherwise, if localName is "*" (U+002A), return a HTMLCollection
+     * rooted at root, whose filter matches descendant elements whose
+     * namespace is namespace.
+     * 5. Otherwise, return a HTMLCollection rooted at root, whose filter
+     * matches descendant elements whose namespace is namespace and local
+     * name is localName.
+     */
+    if (namespace === '')
+        namespace = null;
+    if (namespace === "*" && localName === "*") {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root);
+    }
+    else if (namespace === "*") {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+            return (ele._localName === localName);
+        });
+    }
+    else if (localName === "*") {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+            return (ele._namespace === namespace);
+        });
+    }
+    else {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+            return (ele._localName === localName && ele._namespace === namespace);
+        });
+    }
+}
+/**
+ * Returns a collection of elements with the given class names which are
+ * descendants of the given root node.
+ * See: https://dom.spec.whatwg.org/#concept-getelementsbyclassname
+ *
+ * @param namespace - element namespace
+ * @param localName - local name
+ * @param root - root node
+ */
+function node_listOfElementsWithClassNames(classNames, root) {
+    /**
+     * 1. Let classes be the result of running the ordered set parser
+     * on classNames.
+     * 2. If classes is the empty set, return an empty HTMLCollection.
+     * 3. Return a HTMLCollection rooted at root, whose filter matches
+     * descendant elements that have all their classes in classes.
+     * The comparisons for the classes must be done in an ASCII case-insensitive
+     * manner if root’s node document’s mode is "quirks", and in a
+     * case-sensitive manner otherwise.
+     */
+    const classes = (0, OrderedSetAlgorithm_1.orderedSet_parse)(classNames);
+    if (classes.size === 0) {
+        return (0, CreateAlgorithm_1.create_htmlCollection)(root, () => false);
+    }
+    const caseSensitive = (root._nodeDocument._mode !== "quirks");
+    return (0, CreateAlgorithm_1.create_htmlCollection)(root, function (ele) {
+        const eleClasses = ele.classList;
+        return (0, OrderedSetAlgorithm_1.orderedSet_contains)(eleClasses._tokenSet, classes, caseSensitive);
+    });
+}
+/**
+ * Searches for a namespace prefix associated with the given namespace
+ * starting from the given element through its ancestors.
+ *
+ * @param element - an element node to start searching at
+ * @param namespace - namespace to search for
+ */
+function node_locateANamespacePrefix(element, namespace) {
+    /**
+     * 1. If element’s namespace is namespace and its namespace prefix is not
+     * null, then return its namespace prefix.
+     */
+    if (element._namespace === namespace && element._namespacePrefix !== null) {
+        return element._namespacePrefix;
+    }
+    /**
+     * 2. If element has an attribute whose namespace prefix is "xmlns" and
+     * value is namespace, then return element’s first such attribute’s
+     * local name.
+     */
+    for (let i = 0; i < element._attributeList.length; i++) {
+        const attr = element._attributeList[i];
+        if (attr._namespacePrefix === "xmlns" && attr._value === namespace) {
+            return attr._localName;
+        }
+    }
+    /**
+     * 3. If element’s parent element is not null, then return the result of
+     * running locate a namespace prefix on that element using namespace.
+     */
+    if (element._parent && util_1.Guard.isElementNode(element._parent)) {
+        return node_locateANamespacePrefix(element._parent, namespace);
+    }
+    /**
+     * 4. Return null.
+     */
+    return null;
+}
+/**
+ * Searches for a namespace associated with the given namespace prefix
+ * starting from the given node through its ancestors.
+ *
+ * @param node - a node to start searching at
+ * @param prefix - namespace prefix to search for
+ */
+function node_locateANamespace(node, prefix) {
+    if (util_1.Guard.isElementNode(node)) {
+        /**
+         * 1. If its namespace is not null and its namespace prefix is prefix,
+         * then return namespace.
+         */
+        if (node._namespace !== null && node._namespacePrefix === prefix) {
+            return node._namespace;
+        }
+        /**
+         * 2. If it has an attribute whose namespace is the XMLNS namespace,
+         * namespace prefix is "xmlns", and local name is prefix, or if prefix
+         * is null and it has an attribute whose namespace is the XMLNS namespace,
+         * namespace prefix is null, and local name is "xmlns", then return its
+         * value if it is not the empty string, and null otherwise.
+         */
+        for (let i = 0; i < node._attributeList.length; i++) {
+            const attr = node._attributeList[i];
+            if (attr._namespace === infra_1.namespace.XMLNS &&
+                attr._namespacePrefix === "xmlns" &&
+                attr._localName === prefix) {
+                return attr._value || null;
+            }
+            if (prefix === null && attr._namespace === infra_1.namespace.XMLNS &&
+                attr._namespacePrefix === null && attr._localName === "xmlns") {
+                return attr._value || null;
+            }
+        }
+        /**
+         * 3. If its parent element is null, then return null.
+         */
+        if (node.parentElement === null)
+            return null;
+        /**
+         * 4. Return the result of running locate a namespace on its parent
+         * element using prefix.
+         */
+        return node_locateANamespace(node.parentElement, prefix);
+    }
+    else if (util_1.Guard.isDocumentNode(node)) {
+        /**
+         * 1. If its document element is null, then return null.
+         * 2. Return the result of running locate a namespace on its document
+         * element using prefix.
+         */
+        if (node.documentElement === null)
+            return null;
+        return node_locateANamespace(node.documentElement, prefix);
+    }
+    else if (util_1.Guard.isDocumentTypeNode(node) || util_1.Guard.isDocumentFragmentNode(node)) {
+        return null;
+    }
+    else if (util_1.Guard.isAttrNode(node)) {
+        /**
+         * 1. If its element is null, then return null.
+         * 2. Return the result of running locate a namespace on its element
+         * using prefix.
+         */
+        if (node._element === null)
+            return null;
+        return node_locateANamespace(node._element, prefix);
+    }
+    else {
+        /**
+         * 1. If its parent element is null, then return null.
+         * 2. Return the result of running locate a namespace on its parent
+         * element using prefix.
+         */
+        if (!node._parent || !util_1.Guard.isElementNode(node._parent))
+            return null;
+        return node_locateANamespace(node._parent, prefix);
+    }
+}
+//# sourceMappingURL=NodeAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/NodeAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/NodeAlgorithm.ts"],"names":[],"mappings":";;AAsBA,sDAYC;AASD,gCAoHC;AAQD,kCAsEC;AAUD,oFAoCC;AAWD,4EAiCC;AAWD,8EA0BC;AASD,kEAmCC;AASD,sDAmEC;AApeD,4CAAoC;AAIpC,kCAA+B;AAC/B,2CAA6D;AAC7D,uDAI0B;AAC1B,+DAA6E;AAC7E,iDAAoD;AACpD,2DAA0E;AAC1E,yDAA4E;AAE5E;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,GAAW,EAAE,MAAY;IAC7D;;;;;OAKG;IACH,IAAI,IAAI,GAAgB,IAAI,CAAA;IAC5B,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QACf,IAAI,GAAG,IAAA,6BAAW,EAAC,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,CAAA;IAC/C,CAAC;IACD,IAAA,uCAAmB,EAAC,IAAI,EAAE,MAAM,CAAC,CAAA;AACnC,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,IAAU,EAAE,WAA4B,IAAI,EACrE,oBAA6B,KAAK;IAClC;;OAEG;IACH,IAAI,QAAQ,KAAK,IAAI;QACnB,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAA;IAE/B,IAAI,IAAU,CAAA;IAEd,IAAI,YAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B;;;;;;;;WAQG;QACH,IAAI,GAAG,IAAA,0CAAuB,EAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EACtD,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC1D,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;YACrD,IAAA,iCAAc,EAAC,aAAqB,EAAE,IAAe,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;SAAM,CAAC;QACN;;;;;;;;;;;;;;;;;WAiBG;QACH,IAAI,YAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,IAAA,iCAAe,GAAE,CAAA;YAC7B,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;YAC9B,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAA;YACpC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACpB,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;YAC1B,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;YACtB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;YACtB,IAAI,GAAG,GAAG,CAAA;QACZ,CAAC;aAAM,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,IAAA,qCAAmB,EAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EACtD,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;YACjC,IAAI,GAAG,OAAO,CAAA;QAChB,CAAC;aAAM,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAA,6BAAW,EAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;YAClD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;YACjC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAA;YAC7C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IAAI,GAAG,IAAI,CAAA;QACb,CAAC;aAAM,IAAI,YAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,IAAA,6BAAW,EAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,IAAI,GAAG,IAAA,qCAAmB,EAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAClD,CAAC;aAAM,IAAI,YAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,GAAG,IAAA,gCAAc,EAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC7C,CAAC;aAAM,IAAI,YAAK,CAAC,2BAA2B,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,IAAI,GAAG,IAAA,8CAA4B,EAAC,QAAQ,EAC1C,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC7B,CAAC;aAAM,IAAI,YAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,IAAI,GAAG,IAAA,yCAAuB,EAAC,QAAQ,CAAC,CAAA;QAC1C,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,YAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAA;QACzB,QAAQ,GAAG,IAAI,CAAA;IACjB,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAA;IAC/B,CAAC;IAED;;;;OAIG;IACH,IAAI,aAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACvB,IAAA,kCAAmB,EAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAA;IAC9D,CAAC;IAED;;;;OAIG;IACH,IAAI,iBAAiB,EAAE,CAAC;QACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YACnD,IAAA,mCAAe,EAAC,SAAS,EAAE,IAAI,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAC,CAAO,EAAE,CAAO;IAC1C;;OAEG;IACH,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;QAAE,OAAO,KAAK,CAAA;IAE7C;;;;;;;;;;;;;OAaG;IACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;YACpD,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;YAAE,OAAO,KAAK,CAAA;IAC7C,CAAC;SAAM,IAAI,YAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,gBAAgB,KAAK,CAAC,CAAC,gBAAgB;YAC5E,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;YAC7B,CAAC,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,cAAc,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;IACrE,CAAC;SAAM,IAAI,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;YAChE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;IACvC,CAAC;SAAM,IAAI,YAAK,CAAC,2BAA2B,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,2BAA2B,CAAC,CAAC,CAAC,EAAE,CAAC;QACxF,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,KAAK,CAAA;IAClE,CAAC;SAAM,IAAI,YAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,KAAK,CAAA;IACvC,CAAC;IAED;;;OAGG;IACH,IAAI,YAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,YAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAA4B,EAAE,CAAA;QAC3C,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;YACrC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAA;QACnC,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;YACvC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAA;YACxB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAA;QAC9C,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI;QAAE,OAAO,KAAK,CAAA;IACvD,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC1C,IAAI,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;IACxB,IAAI,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;IACxB,OAAO,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAA;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAA;QAC5B,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC;YAAE,OAAO,KAAK,CAAA;QAC9C,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;QACpB,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;IACtB,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,oCAAoC,CAAC,aAAqB,EAAE,IAAU;IAGpF;;;;;;;;;;;;OAYG;IACH,IAAI,aAAa,KAAK,GAAG,EAAE,CAAC;QAC1B,OAAO,IAAA,uCAAqB,EAAC,IAAI,CAAC,CAAA;IACpC,CAAC;SAAM,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;QAC/C,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;YAC9C,IAAI,GAAG,CAAC,UAAU,KAAK,iBAAc,CAAC,IAAI;gBACxC,GAAG,CAAC,cAAc,KAAK,aAAa,CAAC,WAAW,EAAE,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAA;YACb,CAAC;iBAAM,IAAI,GAAG,CAAC,UAAU,KAAK,iBAAc,CAAC,IAAI;gBAC/C,GAAG,CAAC,cAAc,KAAK,aAAa,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAA;YACb,CAAC;iBAAM,CAAC;gBACN,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;YAC9C,OAAO,CAAC,GAAG,CAAC,cAAc,KAAK,aAAa,CAAC,CAAA;QAC/C,CAAC,CAAC,CAAA;IACJ,CAAC;AAEH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,gCAAgC,CAAC,SAAwB,EACvE,SAAiB,EAAE,IAAU;IAC7B;;;;;;;;;;;;;OAaG;IACH,IAAI,SAAS,KAAK,EAAE;QAAE,SAAS,GAAG,IAAI,CAAA;IAEtC,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;QAC3C,OAAO,IAAA,uCAAqB,EAAC,IAAI,CAAC,CAAA;IACpC,CAAC;SAAM,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;QAC7B,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;YAC9C,OAAO,CAAC,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAA;QACvC,CAAC,CAAC,CAAA;IACJ,CAAC;SAAM,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;QAC7B,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;YAC9C,OAAO,CAAC,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAA;QACvC,CAAC,CAAC,CAAA;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;YAC9C,OAAO,CAAC,GAAG,CAAC,UAAU,KAAK,SAAS,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAA;QACvE,CAAC,CAAC,CAAA;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,iCAAiC,CAAC,UAAkB,EAAE,IAAU;IAG9E;;;;;;;;;OASG;IAEH,MAAM,OAAO,GAAG,IAAA,sCAAgB,EAAC,UAAU,CAAC,CAAA;IAC5C,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAA;IACjD,CAAC;IAED,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAA;IAC7D,OAAO,IAAA,uCAAqB,EAAC,IAAI,EAAE,UAAU,GAAG;QAC9C,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,CAAA;QAChC,OAAO,IAAA,yCAAmB,EAAC,UAAU,CAAC,SAAS,EAAE,OAAO,EACtD,aAAa,CAAC,CAAA;IAClB,CAAC,CAAC,CAAA;AAEJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,2BAA2B,CAAC,OAAgB,EAC1D,SAAwB;IACxB;;;OAGG;IACH,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC1E,OAAO,OAAO,CAAC,gBAAgB,CAAA;IACjC,CAAC;IAED;;;;OAIG;IACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;QACtC,IAAI,IAAI,CAAC,gBAAgB,KAAK,OAAO,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnE,OAAO,IAAI,CAAC,UAAU,CAAA;QACxB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,OAAO,CAAC,OAAO,IAAI,YAAK,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5D,OAAO,2BAA2B,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;IAChE,CAAC;IAGD;;OAEG;IACH,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,qBAAqB,CAAC,IAAU,EAAE,MAAqB;IACrE,IAAI,YAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B;;;WAGG;QACH,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,gBAAgB,KAAK,MAAM,EAAE,CAAC;YACjE,OAAO,IAAI,CAAC,UAAU,CAAA;QACxB,CAAC;QACD;;;;;;WAMG;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;YACnC,IAAI,IAAI,CAAC,UAAU,KAAK,iBAAc,CAAC,KAAK;gBAC1C,IAAI,CAAC,gBAAgB,KAAK,OAAO;gBACjC,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAA;YAC5B,CAAC;YACD,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,iBAAc,CAAC,KAAK;gBAC7D,IAAI,CAAC,gBAAgB,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,OAAO,EAAE,CAAC;gBAChE,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAA;YAC5B,CAAC;QACH,CAAC;QAED;;WAEG;QACH,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAE5C;;;WAGG;QACH,OAAO,qBAAqB,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,CAAA;IAC1D,CAAC;SAAM,IAAI,YAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC;;;;WAIG;QACH,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAC9C,OAAO,qBAAqB,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,CAAA;IAC5D,CAAC;SAAM,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,YAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;QAChF,OAAO,IAAI,CAAA;IACb,CAAC;SAAM,IAAI,YAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC;;;;WAIG;QACH,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QACvC,OAAO,qBAAqB,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IACrD,CAAC;SAAM,CAAC;QACN;;;;WAIG;QACH,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,YAAK,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAA;QACpE,OAAO,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;IACpD,CAAC;AAEH,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/NodeIteratorAlgorithm.d.ts

@@ -0,0 +1,15 @@
+import { Node, NodeIterator } from "../dom/interfaces";
+import { FixedSizeSet } from "@oozcitak/util";
+/**
+ * Returns the next or previous node in the subtree, or `null` if
+ * there are none.
+ *
+ * @param iterator - the `NodeIterator` instance
+ * @param forward- `true` to return the next node, or `false` to
+ * return the previous node.
+ */
+export declare function nodeIterator_traverse(iterator: NodeIterator, forward: boolean): Node | null;
+/**
+ * Gets the global iterator list.
+ */
+export declare function nodeIterator_iteratorList(): FixedSizeSet<NodeIterator>;

package/node_modules/@oozcitak/dom/lib/algorithm/NodeIteratorAlgorithm.js

@@ -0,0 +1,105 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nodeIterator_traverse = nodeIterator_traverse;
+exports.nodeIterator_iteratorList = nodeIterator_iteratorList;
+const DOMImpl_1 = require("../dom/DOMImpl");
+const interfaces_1 = require("../dom/interfaces");
+const TraversalAlgorithm_1 = require("./TraversalAlgorithm");
+const TreeAlgorithm_1 = require("./TreeAlgorithm");
+/**
+ * Returns the next or previous node in the subtree, or `null` if
+ * there are none.
+ *
+ * @param iterator - the `NodeIterator` instance
+ * @param forward- `true` to return the next node, or `false` to
+ * return the previous node.
+ */
+function nodeIterator_traverse(iterator, forward) {
+    /**
+     * 1. Let node be iterator’s reference.
+     * 2. Let beforeNode be iterator’s pointer before reference.
+     */
+    let node = iterator._reference;
+    let beforeNode = iterator._pointerBeforeReference;
+    /**
+     * 3. While true:
+     */
+    while (true) {
+        /**
+         * 3.1. Branch on direction:
+         */
+        if (forward) {
+            /**
+             * - next
+             */
+            if (!beforeNode) {
+                /**
+                 * If beforeNode is false, then set node to the first node following
+                 * node in iterator’s iterator collection. If there is no such node,
+                 * then return null.
+                 */
+                const nextNode = (0, TreeAlgorithm_1.tree_getFollowingNode)(iterator._root, node);
+                if (nextNode) {
+                    node = nextNode;
+                }
+                else {
+                    return null;
+                }
+            }
+            else {
+                /**
+                 * If beforeNode is true, then set it to false.
+                 */
+                beforeNode = false;
+            }
+        }
+        else {
+            /**
+             * - previous
+             */
+            if (beforeNode) {
+                /**
+                 * If beforeNode is true, then set node to the first node preceding
+                 * node in iterator’s iterator collection. If there is no such node,
+                 * then return null.
+                 */
+                const prevNode = (0, TreeAlgorithm_1.tree_getPrecedingNode)(iterator.root, node);
+                if (prevNode) {
+                    node = prevNode;
+                }
+                else {
+                    return null;
+                }
+            }
+            else {
+                /**
+                 * If beforeNode is false, then set it to true.
+                 */
+                beforeNode = true;
+            }
+        }
+        /**
+         * 3.2. Let result be the result of filtering node within iterator.
+         * 3.3. If result is FILTER_ACCEPT, then break.
+         */
+        const result = (0, TraversalAlgorithm_1.traversal_filter)(iterator, node);
+        if (result === interfaces_1.FilterResult.Accept) {
+            break;
+        }
+    }
+    /**
+     * 4. Set iterator’s reference to node.
+     * 5. Set iterator’s pointer before reference to beforeNode.
+     * 6. Return node.
+     */
+    iterator._reference = node;
+    iterator._pointerBeforeReference = beforeNode;
+    return node;
+}
+/**
+ * Gets the global iterator list.
+ */
+function nodeIterator_iteratorList() {
+    return DOMImpl_1.dom.window._iteratorList;
+}
+//# sourceMappingURL=NodeIteratorAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/NodeIteratorAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeIteratorAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/NodeIteratorAlgorithm.ts"],"names":[],"mappings":";;AAcA,sDA+EC;AAKD,8DAEC;AApGD,4CAAoC;AACpC,kDAAoE;AAEpE,6DAAuD;AACvD,mDAA8E;AAE9E;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CAAC,QAAsB,EAAE,OAAgB;IAC5E;;;OAGG;IACH,IAAI,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAA;IAC9B,IAAI,UAAU,GAAG,QAAQ,CAAC,uBAAuB,CAAA;IAEjD;;OAEG;IACH,OAAO,IAAI,EAAE,CAAC;QACZ;;WAEG;QACH,IAAI,OAAO,EAAE,CAAC;YACZ;;eAEG;YACH,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB;;;;mBAIG;gBACH,MAAM,QAAQ,GAAG,IAAA,qCAAqB,EAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAC5D,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,GAAG,QAAQ,CAAA;gBACjB,CAAC;qBAAM,CAAC;oBACN,OAAO,IAAI,CAAA;gBACb,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN;;mBAEG;gBACH,UAAU,GAAG,KAAK,CAAA;YACpB,CAAC;QACH,CAAC;aAAM,CAAC;YACN;;eAEG;YACH,IAAI,UAAU,EAAE,CAAC;gBACf;;;;mBAIG;gBACH,MAAM,QAAQ,GAAG,IAAA,qCAAqB,EAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;gBAC3D,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,GAAG,QAAQ,CAAA;gBACjB,CAAC;qBAAM,CAAC;oBACN,OAAO,IAAI,CAAA;gBACb,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN;;mBAEG;gBACH,UAAU,GAAG,IAAI,CAAA;YACnB,CAAC;QACH,CAAC;QAED;;;WAGG;QACH,MAAM,MAAM,GAAG,IAAA,qCAAgB,EAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;QAC/C,IAAI,MAAM,KAAK,yBAAY,CAAC,MAAM,EAAE,CAAC;YACnC,MAAK;QACP,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAA;IAC1B,QAAQ,CAAC,uBAAuB,GAAG,UAAU,CAAA;IAC7C,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;GAEG;AACH,SAAgB,yBAAyB;IACvC,OAAO,aAAG,CAAC,MAAM,CAAC,aAAa,CAAA;AACjC,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/OrderedSetAlgorithm.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Converts a whitespace separated string into an array of tokens.
+ *
+ * @param value - a string of whitespace separated tokens
+ */
+export declare function orderedSet_parse(value: string): Set<string>;
+/**
+ * Converts an array of tokens into a space separated string.
+ *
+ * @param tokens - an array of token strings
+ */
+export declare function orderedSet_serialize(tokens: Set<string>): string;
+/**
+ * Removes duplicate tokens and convert all whitespace characters
+ * to space.
+ *
+ * @param value - a string of whitespace separated tokens
+ */
+export declare function orderedSet_sanitize(value: string): string;
+/**
+ * Determines whether a set contains the other.
+ *
+ * @param set1 - a set
+ * @param set1 - a set that is contained in set1
+ * @param caseSensitive - whether matches are case-sensitive
+ */
+export declare function orderedSet_contains(set1: Set<string>, set2: Set<string>, caseSensitive: boolean): boolean;