@pokash/n8n-nodes-ksef 0.2.12 → 0.2.16

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

@@ -0,0 +1,288 @@
+"use strict";
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var DOMImpl_1 = require("../dom/DOMImpl");
+var TreeAlgorithm_1 = require("./TreeAlgorithm");
+var util_1 = require("../util");
+var ShadowTreeAlgorithm_1 = require("./ShadowTreeAlgorithm");
+var supportedTokens = new Map();
+/**
+ * Runs removing steps for node.
+ *
+ * @param removedNode - removed node
+ * @param oldParent - old parent node
+ */
+function dom_runRemovingSteps(removedNode, oldParent) {
+    // No steps defined
+}
+exports.dom_runRemovingSteps = dom_runRemovingSteps;
+/**
+ * Runs cloning steps for node.
+ *
+ * @param copy - node clone
+ * @param node - node
+ * @param document - document to own the cloned node
+ * @param cloneChildrenFlag - whether child nodes are cloned
+ */
+function dom_runCloningSteps(copy, node, document, cloneChildrenFlag) {
+    // No steps defined
+}
+exports.dom_runCloningSteps = dom_runCloningSteps;
+/**
+ * Runs adopting steps for node.
+ *
+ * @param node - node
+ * @param oldDocument - old document
+ */
+function dom_runAdoptingSteps(node, oldDocument) {
+    // No steps defined
+}
+exports.dom_runAdoptingSteps = dom_runAdoptingSteps;
+/**
+ * Runs attribute change steps for an element node.
+ *
+ * @param element - element node owning the attribute
+ * @param localName - attribute's local name
+ * @param oldValue - attribute's old value
+ * @param value - attribute's new value
+ * @param namespace - attribute's namespace
+ */
+function dom_runAttributeChangeSteps(element, localName, oldValue, value, namespace) {
+    var e_1, _a;
+    // run default steps
+    if (DOMImpl_1.dom.features.slots) {
+        updateASlotablesName.call(element, element, localName, oldValue, value, namespace);
+        updateASlotsName.call(element, element, localName, oldValue, value, namespace);
+    }
+    updateAnElementID.call(element, element, localName, value, namespace);
+    try {
+        // run custom steps
+        for (var _b = __values(element._attributeChangeSteps), _c = _b.next(); !_c.done; _c = _b.next()) {
+            var step = _c.value;
+            step.call(element, element, localName, oldValue, value, namespace);
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+}
+exports.dom_runAttributeChangeSteps = dom_runAttributeChangeSteps;
+/**
+ * Runs insertion steps for a node.
+ *
+ * @param insertedNode - inserted node
+ */
+function dom_runInsertionSteps(insertedNode) {
+    // No steps defined
+}
+exports.dom_runInsertionSteps = dom_runInsertionSteps;
+/**
+ * Runs pre-removing steps for a node iterator and node.
+ *
+ * @param nodeIterator - a node iterator
+ * @param toBeRemoved - node to be removed
+ */
+function dom_runNodeIteratorPreRemovingSteps(nodeIterator, toBeRemoved) {
+    removeNodeIterator.call(nodeIterator, nodeIterator, toBeRemoved);
+}
+exports.dom_runNodeIteratorPreRemovingSteps = dom_runNodeIteratorPreRemovingSteps;
+/**
+ * Determines if there are any supported tokens defined for the given
+ * attribute name.
+ *
+ * @param attributeName - an attribute name
+ */
+function dom_hasSupportedTokens(attributeName) {
+    return supportedTokens.has(attributeName);
+}
+exports.dom_hasSupportedTokens = dom_hasSupportedTokens;
+/**
+ * Returns the set of supported tokens defined for the given attribute name.
+ *
+ * @param attributeName - an attribute name
+ */
+function dom_getSupportedTokens(attributeName) {
+    return supportedTokens.get(attributeName) || new Set();
+}
+exports.dom_getSupportedTokens = dom_getSupportedTokens;
+/**
+ * Runs event construction steps.
+ *
+ * @param event - an event
+ */
+function dom_runEventConstructingSteps(event) {
+    // No steps defined
+}
+exports.dom_runEventConstructingSteps = dom_runEventConstructingSteps;
+/**
+ * Runs child text content change steps for a parent node.
+ *
+ * @param parent - parent node with text node child nodes
+ */
+function dom_runChildTextContentChangeSteps(parent) {
+    // No steps defined
+}
+exports.dom_runChildTextContentChangeSteps = dom_runChildTextContentChangeSteps;
+/**
+ * Defines pre-removing steps for a node iterator.
+ */
+function removeNodeIterator(nodeIterator, toBeRemovedNode) {
+    /**
+     * 1. If toBeRemovedNode is not an inclusive ancestor of nodeIterator’s
+     * reference, or toBeRemovedNode is nodeIterator’s root, then return.
+     */
+    if (toBeRemovedNode === nodeIterator._root ||
+        !TreeAlgorithm_1.tree_isAncestorOf(nodeIterator._reference, toBeRemovedNode, true)) {
+        return;
+    }
+    /**
+     * 2. If nodeIterator’s pointer before reference is true, then:
+     */
+    if (nodeIterator._pointerBeforeReference) {
+        /**
+         * 2.1. Let next be toBeRemovedNode’s first following node that is an
+         * inclusive descendant of nodeIterator’s root and is not an inclusive
+         * descendant of toBeRemovedNode, and null if there is no such node.
+         */
+        while (true) {
+            var nextNode = TreeAlgorithm_1.tree_getFollowingNode(nodeIterator._root, toBeRemovedNode);
+            if (nextNode !== null &&
+                TreeAlgorithm_1.tree_isDescendantOf(nodeIterator._root, nextNode, true) &&
+                !TreeAlgorithm_1.tree_isDescendantOf(toBeRemovedNode, nextNode, true)) {
+                /**
+                 * 2.2. If next is non-null, then set nodeIterator’s reference to next
+                 * and return.
+                 */
+                nodeIterator._reference = nextNode;
+                return;
+            }
+            else if (nextNode === null) {
+                /**
+                 * 2.3. Otherwise, set nodeIterator’s pointer before reference to false.
+                 */
+                nodeIterator._pointerBeforeReference = false;
+                return;
+            }
+        }
+    }
+    /**
+     * 3. Set nodeIterator’s reference to toBeRemovedNode’s parent, if
+     * toBeRemovedNode’s previous sibling is null, and to the inclusive
+     * descendant of toBeRemovedNode’s previous sibling that appears last in
+     * tree order otherwise.
+     */
+    if (toBeRemovedNode._previousSibling === null) {
+        if (toBeRemovedNode._parent !== null) {
+            nodeIterator._reference = toBeRemovedNode._parent;
+        }
+    }
+    else {
+        var referenceNode = toBeRemovedNode._previousSibling;
+        var childNode = TreeAlgorithm_1.tree_getFirstDescendantNode(toBeRemovedNode._previousSibling, true, false);
+        while (childNode !== null) {
+            if (childNode !== null) {
+                referenceNode = childNode;
+            }
+            // loop through to get the last descendant node
+            childNode = TreeAlgorithm_1.tree_getNextDescendantNode(toBeRemovedNode._previousSibling, childNode, true, false);
+        }
+        nodeIterator._reference = referenceNode;
+    }
+}
+/**
+ * Defines attribute change steps to update a slot’s name.
+ */
+function updateASlotsName(element, localName, oldValue, value, namespace) {
+    /**
+     * 1. If element is a slot, localName is name, and namespace is null, then:
+     * 1.1. If value is oldValue, then return.
+     * 1.2. If value is null and oldValue is the empty string, then return.
+     * 1.3. If value is the empty string and oldValue is null, then return.
+     * 1.4. If value is null or the empty string, then set element’s name to the
+     * empty string.
+     * 1.5. Otherwise, set element’s name to value.
+     * 1.6. Run assign slotables for a tree with element’s root.
+     */
+    if (util_1.Guard.isSlot(element) && localName === "name" && namespace === null) {
+        if (value === oldValue)
+            return;
+        if (value === null && oldValue === '')
+            return;
+        if (value === '' && oldValue === null)
+            return;
+        if ((value === null || value === '')) {
+            element._name = '';
+        }
+        else {
+            element._name = value;
+        }
+        ShadowTreeAlgorithm_1.shadowTree_assignSlotablesForATree(TreeAlgorithm_1.tree_rootNode(element));
+    }
+}
+/**
+ * Defines attribute change steps to update a slotable’s name.
+ */
+function updateASlotablesName(element, localName, oldValue, value, namespace) {
+    /**
+     * 1. If localName is slot and namespace is null, then:
+     * 1.1. If value is oldValue, then return.
+     * 1.2. If value is null and oldValue is the empty string, then return.
+     * 1.3. If value is the empty string and oldValue is null, then return.
+     * 1.4. If value is null or the empty string, then set element’s name to
+     * the empty string.
+     * 1.5. Otherwise, set element’s name to value.
+     * 1.6. If element is assigned, then run assign slotables for element’s
+     * assigned slot.
+     * 1.7. Run assign a slot for element.
+     */
+    if (util_1.Guard.isSlotable(element) && localName === "slot" && namespace === null) {
+        if (value === oldValue)
+            return;
+        if (value === null && oldValue === '')
+            return;
+        if (value === '' && oldValue === null)
+            return;
+        if ((value === null || value === '')) {
+            element._name = '';
+        }
+        else {
+            element._name = value;
+        }
+        if (ShadowTreeAlgorithm_1.shadowTree_isAssigned(element)) {
+            ShadowTreeAlgorithm_1.shadowTree_assignSlotables(element._assignedSlot);
+        }
+        ShadowTreeAlgorithm_1.shadowTree_assignASlot(element);
+    }
+}
+/**
+ * Defines attribute change steps to update an element's ID.
+ */
+function updateAnElementID(element, localName, value, namespace) {
+    /**
+     * 1. If localName is id, namespace is null, and value is null or the empty
+     * string, then unset element’s ID.
+     * 2. Otherwise, if localName is id, namespace is null, then set element’s
+     * ID to value.
+     */
+    if (localName === "id" && namespace === null) {
+        if (!value)
+            element._uniqueIdentifier = undefined;
+        else
+            element._uniqueIdentifier = value;
+    }
+}
+//# sourceMappingURL=DOMAlgorithm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DOMAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/DOMAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAAA,0CAAoC;AAEpC,iDAGwB;AACxB,gCAA+B;AAC/B,6DAG8B;AAE9B,IAAM,eAAe,GAAG,IAAI,GAAG,EAAE,CAAA;AAEjC;;;;;GAKG;AACH,SAAgB,oBAAoB,CAAC,WAAiB,EAAE,SAAe;IACrE,mBAAmB;AACrB,CAAC;AAFD,oDAEC;AAED;;;;;;;GAOG;AACH,SAAgB,mBAAmB,CAAC,IAAU,EAAE,IAAU,EAAE,QAAkB,EAC5E,iBAA0B;IAC1B,mBAAmB;AACrB,CAAC;AAHD,kDAGC;AAED;;;;;GAKG;AACH,SAAgB,oBAAoB,CAAC,IAAU,EAAE,WAAqB;IACpE,mBAAmB;AACrB,CAAC;AAFD,oDAEC;AAED;;;;;;;;GAQG;AACH,SAAgB,2BAA2B,CAAC,OAAgB,EAAE,SAAiB,EAC7E,QAAuB,EAAE,KAAoB,EAC7C,SAAwB;;IAExB,oBAAoB;IACpB,IAAI,aAAG,CAAC,QAAQ,CAAC,KAAK,EAAE;QACtB,oBAAoB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;QAClF,gBAAgB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;KAC/E;IACD,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;;QAErE,mBAAmB;QACnB,KAAmB,IAAA,KAAA,SAAA,OAAO,CAAC,qBAAqB,CAAA,gBAAA,4BAAE;YAA7C,IAAM,IAAI,WAAA;YACb,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;SACnE;;;;;;;;;AACH,CAAC;AAfD,kEAeC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,YAAkB;IACtD,mBAAmB;AACrB,CAAC;AAFD,sDAEC;AAED;;;;;GAKG;AACH,SAAgB,mCAAmC,CAAC,YAA0B,EAC5E,WAAiB;IACjB,kBAAkB,CAAC,IAAI,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAA;AAClE,CAAC;AAHD,kFAGC;AAED;;;;;GAKG;AACH,SAAgB,sBAAsB,CAAC,aAAqB;IAC1D,OAAO,eAAe,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;AAC3C,CAAC;AAFD,wDAEC;AAED;;;;GAIG;AACH,SAAgB,sBAAsB,CAAC,aAAqB;IAC1D,OAAO,eAAe,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;AACxD,CAAC;AAFD,wDAEC;AAED;;;;GAIG;AACH,SAAgB,6BAA6B,CAAC,KAAY;IACxD,mBAAmB;AACrB,CAAC;AAFD,sEAEC;AAED;;;;GAIG;AACH,SAAgB,kCAAkC,CAAC,MAAY;IAC7D,mBAAmB;AACrB,CAAC;AAFD,gFAEC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,YAA0B,EACpD,eAAqB;IACrB;;;OAGG;IACH,IAAI,eAAe,KAAK,YAAY,CAAC,KAAK;QACxC,CAAC,iCAAiB,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE;QACpE,OAAM;KACP;IAED;;OAEG;IACH,IAAI,YAAY,CAAC,uBAAuB,EAAE;QACxC;;;;WAIG;QACH,OAAO,IAAI,EAAE;YACX,IAAM,QAAQ,GAAG,qCAAqB,CAAC,YAAY,CAAC,KAAK,EAAE,eAAe,CAAC,CAAA;YAC3E,IAAI,QAAQ,KAAK,IAAI;gBACnB,mCAAmB,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC;gBACvD,CAAC,mCAAmB,CAAC,eAAe,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACvD;;;mBAGG;gBACH,YAAY,CAAC,UAAU,GAAG,QAAQ,CAAA;gBAClC,OAAM;aACP;iBAAM,IAAI,QAAQ,KAAK,IAAI,EAAE;gBAC5B;;mBAEG;gBACH,YAAY,CAAC,uBAAuB,GAAG,KAAK,CAAA;gBAC5C,OAAM;aACP;SACF;KACF;IAED;;;;;OAKG;IACH,IAAI,eAAe,CAAC,gBAAgB,KAAK,IAAI,EAAE;QAC7C,IAAI,eAAe,CAAC,OAAO,KAAK,IAAI,EAAE;YACpC,YAAY,CAAC,UAAU,GAAG,eAAe,CAAC,OAAO,CAAA;SAClD;KACF;SAAM;QACL,IAAI,aAAa,GAAG,eAAe,CAAC,gBAAgB,CAAA;QACpD,IAAI,SAAS,GAAG,2CAA2B,CAAC,eAAe,CAAC,gBAAgB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QAC1F,OAAO,SAAS,KAAK,IAAI,EAAE;YACzB,IAAI,SAAS,KAAK,IAAI,EAAE;gBACtB,aAAa,GAAG,SAAS,CAAA;aAC1B;YACD,+CAA+C;YAC/C,SAAS,GAAG,0CAA0B,CAAC,eAAe,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;SACjG;QACD,YAAY,CAAC,UAAU,GAAG,aAAa,CAAA;KACxC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,OAAgB,EAAE,SAAiB,EAC3D,QAAuB,EAAE,KAAoB,EAAE,SAAwB;IACvE;;;;;;;;;OASG;IACH,IAAI,YAAK,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,IAAI,EAAE;QACvE,IAAI,KAAK,KAAK,QAAQ;YAAE,OAAM;QAC9B,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,EAAE;YAAE,OAAM;QAC7C,IAAI,KAAK,KAAK,EAAE,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAM;QAE7C,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC,EAAE;YACpC,OAAO,CAAC,KAAK,GAAG,EAAE,CAAA;SACnB;aAAM;YACL,OAAO,CAAC,KAAK,GAAG,KAAK,CAAA;SACtB;QAED,wDAAkC,CAAC,6BAAa,CAAC,OAAO,CAAC,CAAC,CAAA;KAC3D;AACH,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,OAAgB,EAAE,SAAiB,EAC/D,QAAuB,EAAE,KAAoB,EAAE,SAAwB;IACvE;;;;;;;;;;;OAWG;IACH,IAAI,YAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,IAAI,EAAE;QAC3E,IAAI,KAAK,KAAK,QAAQ;YAAE,OAAM;QAC9B,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,EAAE;YAAE,OAAM;QAC7C,IAAI,KAAK,KAAK,EAAE,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAM;QAE7C,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC,EAAE;YACpC,OAAO,CAAC,KAAK,GAAG,EAAE,CAAA;SACnB;aAAM;YACL,OAAO,CAAC,KAAK,GAAG,KAAK,CAAA;SACtB;QAED,IAAI,2CAAqB,CAAC,OAAO,CAAC,EAAE;YAClC,gDAA0B,CAAC,OAAO,CAAC,aAAqB,CAAC,CAAA;SAC1D;QAED,4CAAsB,CAAC,OAAO,CAAC,CAAA;KAChC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAgB,EAAE,SAAiB,EAC5D,KAAoB,EAAE,SAAwB;IAC9C;;;;;OAKG;IACH,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE;QAC5C,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAA;;YAErC,OAAO,CAAC,iBAAiB,GAAG,KAAK,CAAA;KACpC;AACH,CAAC"}

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

@@ -0,0 +1,21 @@
+import { DOMTokenList } from "../dom/interfaces";
+/**
+ * Validates a given token against the supported tokens defined for the given
+ * token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ * @param token - a token
+ */
+export declare function tokenList_validationSteps(tokenList: DOMTokenList, token: string): boolean;
+/**
+ * Updates the value of the token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ */
+export declare function tokenList_updateSteps(tokenList: DOMTokenList): void;
+/**
+ * Gets the value of the token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ */
+export declare function tokenList_serializeSteps(tokenList: DOMTokenList): string;

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

@@ -0,0 +1,61 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var OrderedSetAlgorithm_1 = require("./OrderedSetAlgorithm");
+var DOMAlgorithm_1 = require("./DOMAlgorithm");
+var ElementAlgorithm_1 = require("./ElementAlgorithm");
+/**
+ * Validates a given token against the supported tokens defined for the given
+ * token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ * @param token - a token
+ */
+function tokenList_validationSteps(tokenList, token) {
+    /**
+     * 1. If the associated attribute’s local name does not define supported
+     * tokens, throw a TypeError.
+     * 2. Let lowercase token be a copy of token, in ASCII lowercase.
+     * 3. If lowercase token is present in supported tokens, return true.
+     * 4. Return false.
+     */
+    if (!DOMAlgorithm_1.dom_hasSupportedTokens(tokenList._attribute._localName)) {
+        throw new TypeError("There are no supported tokens defined for attribute name: '" + tokenList._attribute._localName + "'.");
+    }
+    return DOMAlgorithm_1.dom_getSupportedTokens(tokenList._attribute._localName).has(token.toLowerCase());
+}
+exports.tokenList_validationSteps = tokenList_validationSteps;
+/**
+ * Updates the value of the token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ */
+function tokenList_updateSteps(tokenList) {
+    /**
+     * 1. If the associated element does not have an associated attribute and
+     * token set is empty, then return.
+     * 2. Set an attribute value for the associated element using associated
+     * attribute’s local name and the result of running the ordered set
+     * serializer for token set.
+     */
+    if (!tokenList._element.hasAttribute(tokenList._attribute._localName) &&
+        tokenList._tokenSet.size === 0) {
+        return;
+    }
+    ElementAlgorithm_1.element_setAnAttributeValue(tokenList._element, tokenList._attribute._localName, OrderedSetAlgorithm_1.orderedSet_serialize(tokenList._tokenSet));
+}
+exports.tokenList_updateSteps = tokenList_updateSteps;
+/**
+ * Gets the value of the token lists' associated attribute.
+ *
+ * @param tokenList - a token list
+ */
+function tokenList_serializeSteps(tokenList) {
+    /**
+     * A DOMTokenList object’s serialize steps are to return the result of
+     * running get an attribute value given the associated element and the
+     * associated attribute’s local name.
+     */
+    return ElementAlgorithm_1.element_getAnAttributeValue(tokenList._element, tokenList._attribute._localName);
+}
+exports.tokenList_serializeSteps = tokenList_serializeSteps;
+//# sourceMappingURL=DOMTokenListAlgorithm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DOMTokenListAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/DOMTokenListAlgorithm.ts"],"names":[],"mappings":";;AACA,6DAA4D;AAC5D,+CAA+E;AAC/E,uDAE2B;AAE3B;;;;;;GAMG;AACH,SAAgB,yBAAyB,CAAC,SAAuB,EAC/D,KAAa;IACb;;;;;;OAMG;IACH,IAAI,CAAC,qCAAsB,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;QAC5D,MAAM,IAAI,SAAS,CAAC,gEAA8D,SAAS,CAAC,UAAU,CAAC,UAAU,OAAI,CAAC,CAAA;KACvH;IACD,OAAO,qCAAsB,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAA;AACzF,CAAC;AAbD,8DAaC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,SAAuB;IAC3D;;;;;;OAMG;IACH,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC;QACnE,SAAS,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE;QAChC,OAAM;KACP;IACD,8CAA2B,CAAC,SAAS,CAAC,QAAQ,EAC5C,SAAS,CAAC,UAAU,CAAC,UAAU,EAAE,0CAAoB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAA;AAC/E,CAAC;AAdD,sDAcC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,SAAuB;IAC9D;;;;OAIG;IACH,OAAO,8CAA2B,CAChC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;AACxD,CAAC;AARD,4DAQC"}

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

@@ -0,0 +1,29 @@
+import { Element, Document, Node } from "../dom/interfaces";
+/**
+ * Returns an element interface for the given name and namespace.
+ *
+ * @param name - element name
+ * @param namespace - namespace
+ */
+export declare function document_elementInterface(name: string, namespace: string | null): (new (...args: any[]) => Element);
+/**
+ * Creates a new element node.
+ * See: https://dom.spec.whatwg.org/#internal-createelementns-steps
+ *
+ * @param document - owner document
+ * @param namespace - element namespace
+ * @param qualifiedName - qualified name
+ * @param options - element options
+ */
+export declare function document_internalCreateElementNS(document: Document, namespace: string | null, qualifiedName: string, options?: string | {
+    is: string;
+}): Element;
+/**
+ * Removes `node` and its subtree from its document and changes
+ * its owner document to `document` so that it can be inserted
+ * into `document`.
+ *
+ * @param node - the node to move
+ * @param document - document to receive the node and its subtree
+ */
+export declare function document_adopt(node: Node, document: Document): void;

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

@@ -0,0 +1,161 @@
+"use strict";
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var DOMImpl_1 = require("../dom/DOMImpl");
+var util_1 = require("../util");
+var util_2 = require("@oozcitak/util");
+var ElementImpl_1 = require("../dom/ElementImpl");
+var CustomElementAlgorithm_1 = require("./CustomElementAlgorithm");
+var TreeAlgorithm_1 = require("./TreeAlgorithm");
+var NamespaceAlgorithm_1 = require("./NamespaceAlgorithm");
+var DOMAlgorithm_1 = require("./DOMAlgorithm");
+var ElementAlgorithm_1 = require("./ElementAlgorithm");
+var MutationAlgorithm_1 = require("./MutationAlgorithm");
+/**
+ * Returns an element interface for the given name and namespace.
+ *
+ * @param name - element name
+ * @param namespace - namespace
+ */
+function document_elementInterface(name, namespace) {
+    return ElementImpl_1.ElementImpl;
+}
+exports.document_elementInterface = document_elementInterface;
+/**
+ * Creates a new element node.
+ * See: https://dom.spec.whatwg.org/#internal-createelementns-steps
+ *
+ * @param document - owner document
+ * @param namespace - element namespace
+ * @param qualifiedName - qualified name
+ * @param options - element options
+ */
+function document_internalCreateElementNS(document, namespace, qualifiedName, options) {
+    /**
+     * 1. Let namespace, prefix, and localName be the result of passing
+     * namespace and qualifiedName to validate and extract.
+     * 2. Let is be null.
+     * 3. If options is a dictionary and options’s is is present, then set
+     * is to it.
+     * 4. Return the result of creating an element given document, localName,
+     * namespace, prefix, is, and with the synchronous custom elements flag set.
+     */
+    var _a = __read(NamespaceAlgorithm_1.namespace_validateAndExtract(namespace, qualifiedName), 3), ns = _a[0], prefix = _a[1], localName = _a[2];
+    var is = null;
+    if (options !== undefined) {
+        if (util_2.isString(options)) {
+            is = options;
+        }
+        else {
+            is = options.is;
+        }
+    }
+    return ElementAlgorithm_1.element_createAnElement(document, localName, ns, prefix, is, true);
+}
+exports.document_internalCreateElementNS = document_internalCreateElementNS;
+/**
+ * Removes `node` and its subtree from its document and changes
+ * its owner document to `document` so that it can be inserted
+ * into `document`.
+ *
+ * @param node - the node to move
+ * @param document - document to receive the node and its subtree
+ */
+function document_adopt(node, document) {
+    var e_1, _a;
+    // Optimize for common case of inserting a fresh node
+    if (node._nodeDocument === document && node._parent === null) {
+        return;
+    }
+    /**
+     * 1. Let oldDocument be node’s node document.
+     * 2. If node’s parent is not null, remove node from its parent.
+     */
+    var oldDocument = node._nodeDocument;
+    if (node._parent)
+        MutationAlgorithm_1.mutation_remove(node, node._parent);
+    /**
+     * 3. If document is not oldDocument, then:
+     */
+    if (document !== oldDocument) {
+        /**
+         * 3.1. For each inclusiveDescendant in node’s shadow-including inclusive
+         * descendants:
+         */
+        var inclusiveDescendant = TreeAlgorithm_1.tree_getFirstDescendantNode(node, true, true);
+        while (inclusiveDescendant !== null) {
+            /**
+             * 3.1.1. Set inclusiveDescendant’s node document to document.
+             * 3.1.2. If inclusiveDescendant is an element, then set the node
+             * document of each attribute in inclusiveDescendant’s attribute list
+             * to document.
+             */
+            inclusiveDescendant._nodeDocument = document;
+            if (util_1.Guard.isElementNode(inclusiveDescendant)) {
+                try {
+                    for (var _b = (e_1 = void 0, __values(inclusiveDescendant._attributeList._asArray())), _c = _b.next(); !_c.done; _c = _b.next()) {
+                        var attr = _c.value;
+                        attr._nodeDocument = document;
+                    }
+                }
+                catch (e_1_1) { e_1 = { error: e_1_1 }; }
+                finally {
+                    try {
+                        if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+                    }
+                    finally { if (e_1) throw e_1.error; }
+                }
+            }
+            /**
+             * 3.2. For each inclusiveDescendant in node's shadow-including
+             * inclusive descendants that is custom, enqueue a custom
+             * element callback reaction with inclusiveDescendant,
+             * callback name "adoptedCallback", and an argument list
+             * containing oldDocument and document.
+             */
+            if (DOMImpl_1.dom.features.customElements) {
+                if (util_1.Guard.isElementNode(inclusiveDescendant) &&
+                    inclusiveDescendant._customElementState === "custom") {
+                    CustomElementAlgorithm_1.customElement_enqueueACustomElementCallbackReaction(inclusiveDescendant, "adoptedCallback", [oldDocument, document]);
+                }
+            }
+            /**
+             * 3.3. For each inclusiveDescendant in node’s shadow-including
+             * inclusive descendants, in shadow-including tree order, run the
+             * adopting steps with inclusiveDescendant and oldDocument.
+             */
+            if (DOMImpl_1.dom.features.steps) {
+                DOMAlgorithm_1.dom_runAdoptingSteps(inclusiveDescendant, oldDocument);
+            }
+            inclusiveDescendant = TreeAlgorithm_1.tree_getNextDescendantNode(node, inclusiveDescendant, true, true);
+        }
+    }
+}
+exports.document_adopt = document_adopt;
+//# sourceMappingURL=DocumentAlgorithm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DocumentAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/DocumentAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,0CAAoC;AAEpC,gCAA+B;AAC/B,uCAAyC;AACzC,kDAAgD;AAChD,mEAA8F;AAC9F,iDAAyF;AACzF,2DAAmE;AACnE,+CAAqD;AACrD,uDAA4D;AAC5D,yDAAqD;AAErD;;;;;GAKG;AACH,SAAgB,yBAAyB,CAAC,IAAY,EAAE,SAAwB;IAE9E,OAAO,yBAAW,CAAA;AACpB,CAAC;AAHD,8DAGC;AAED;;;;;;;;GAQG;AACH,SAAgB,gCAAgC,CAAC,QAAkB,EAAE,SAAwB,EAC3F,aAAqB,EAAE,OAAiC;IACxD;;;;;;;;OAQG;IACG,IAAA,2FACkD,EADjD,UAAE,EAAE,cAAM,EAAE,iBACqC,CAAA;IAExD,IAAI,EAAE,GAAkB,IAAI,CAAA;IAC5B,IAAI,OAAO,KAAK,SAAS,EAAE;QACzB,IAAI,eAAQ,CAAC,OAAO,CAAC,EAAE;YACrB,EAAE,GAAG,OAAO,CAAA;SACb;aAAM;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,CAAA;SAChB;KACF;IAED,OAAO,0CAAuB,CAAC,QAAQ,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;AAC3E,CAAC;AAxBD,4EAwBC;AAED;;;;;;;GAOG;AACH,SAAgB,cAAc,CAAC,IAAU,EAAE,QAAkB;;IAC3D,qDAAqD;IACrD,IAAI,IAAI,CAAC,aAAa,KAAK,QAAQ,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE;QAC5D,OAAM;KACP;IAED;;;OAGG;IACH,IAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAA;IAEtC,IAAI,IAAI,CAAC,OAAO;QACd,mCAAe,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAA;IAErC;;OAEG;IACH,IAAI,QAAQ,KAAK,WAAW,EAAE;QAC5B;;;WAGG;QACH,IAAI,mBAAmB,GAAG,2CAA2B,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QACvE,OAAO,mBAAmB,KAAK,IAAI,EAAE;YACnC;;;;;eAKG;YACH,mBAAmB,CAAC,aAAa,GAAG,QAAoB,CAAA;YAExD,IAAI,YAAK,CAAC,aAAa,CAAC,mBAAmB,CAAC,EAAE;;oBAC5C,KAAmB,IAAA,oBAAA,SAAA,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,CAAA,CAAA,gBAAA,4BAAE;wBAA7D,IAAM,IAAI,WAAA;wBACb,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAA;qBAC9B;;;;;;;;;aACF;YAED;;;;;;eAMG;YACH,IAAI,aAAG,CAAC,QAAQ,CAAC,cAAc,EAAE;gBAC/B,IAAI,YAAK,CAAC,aAAa,CAAC,mBAAmB,CAAC;oBAC1C,mBAAmB,CAAC,mBAAmB,KAAK,QAAQ,EAAE;oBACtD,4EAAmD,CACjD,mBAAmB,EAAE,iBAAiB,EAAE,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAA;iBACnE;aACF;YAED;;;;eAIG;YACH,IAAI,aAAG,CAAC,QAAQ,CAAC,KAAK,EAAE;gBACtB,mCAAoB,CAAC,mBAAmB,EAAE,WAAW,CAAC,CAAA;aACvD;YAED,mBAAmB,GAAG,0CAA0B,CAAC,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;SACxF;KACF;AACH,CAAC;AAlED,wCAkEC"}