@pokash/n8n-nodes-ksef 0.2.12 → 0.2.16

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;

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

@@ -0,0 +1,125 @@
+"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 __spread = (this && this.__spread) || function () {
+    for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));
+    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 infra_1 = require("@oozcitak/infra");
+/**
+ * Converts a whitespace separated string into an array of tokens.
+ *
+ * @param value - a string of whitespace separated tokens
+ */
+function orderedSet_parse(value) {
+    /**
+     * 1. Let inputTokens be the result of splitting input on ASCII whitespace.
+     * 2. Let tokens be a new ordered set.
+     * 3. For each token in inputTokens, append token to tokens.
+     * 4. Return tokens.
+     */
+    var inputTokens = infra_1.string.splitAStringOnASCIIWhitespace(value);
+    return new Set(inputTokens);
+}
+exports.orderedSet_parse = orderedSet_parse;
+/**
+ * Converts an array of tokens into a space separated string.
+ *
+ * @param tokens - an array of token strings
+ */
+function orderedSet_serialize(tokens) {
+    /**
+     * The ordered set serializer takes a set and returns the concatenation of
+     * set using U+0020 SPACE.
+     */
+    return __spread(tokens).join(' ');
+}
+exports.orderedSet_serialize = orderedSet_serialize;
+/**
+ * Removes duplicate tokens and convert all whitespace characters
+ * to space.
+ *
+ * @param value - a string of whitespace separated tokens
+ */
+function orderedSet_sanitize(value) {
+    return orderedSet_serialize(orderedSet_parse(value));
+}
+exports.orderedSet_sanitize = orderedSet_sanitize;
+/**
+ * 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
+ */
+function orderedSet_contains(set1, set2, caseSensitive) {
+    var e_1, _a, e_2, _b;
+    try {
+        for (var set2_1 = __values(set2), set2_1_1 = set2_1.next(); !set2_1_1.done; set2_1_1 = set2_1.next()) {
+            var val2 = set2_1_1.value;
+            var found = false;
+            try {
+                for (var set1_1 = (e_2 = void 0, __values(set1)), set1_1_1 = set1_1.next(); !set1_1_1.done; set1_1_1 = set1_1.next()) {
+                    var val1 = set1_1_1.value;
+                    if (caseSensitive) {
+                        if (val1 === val2) {
+                            found = true;
+                            break;
+                        }
+                    }
+                    else {
+                        if (val1.toUpperCase() === val2.toUpperCase()) {
+                            found = true;
+                            break;
+                        }
+                    }
+                }
+            }
+            catch (e_2_1) { e_2 = { error: e_2_1 }; }
+            finally {
+                try {
+                    if (set1_1_1 && !set1_1_1.done && (_b = set1_1.return)) _b.call(set1_1);
+                }
+                finally { if (e_2) throw e_2.error; }
+            }
+            if (!found)
+                return false;
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (set2_1_1 && !set2_1_1.done && (_a = set2_1.return)) _a.call(set2_1);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+    return true;
+}
+exports.orderedSet_contains = orderedSet_contains;
+//# sourceMappingURL=OrderedSetAlgorithm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedSetAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/OrderedSetAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,yCAAuD;AAEvD;;;;GAIG;AACH,SAAgB,gBAAgB,CAAC,KAAa;IAC5C;;;;;OAKG;IACH,IAAM,WAAW,GAAG,cAAW,CAAC,6BAA6B,CAAC,KAAK,CAAC,CAAA;IACpE,OAAO,IAAI,GAAG,CAAS,WAAW,CAAC,CAAA;AACrC,CAAC;AATD,4CASC;AAED;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,MAAmB;IACtD;;;OAGG;IACH,OAAO,SAAI,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAA;AAC9B,CAAC;AAND,oDAMC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,KAAa;IAC/C,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAA;AACtD,CAAC;AAFD,kDAEC;AAED;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAAC,IAAiB,EAAE,IAAiB,EACtE,aAAsB;;;QAEtB,KAAmB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;YAApB,IAAM,IAAI,iBAAA;YACb,IAAI,KAAK,GAAG,KAAK,CAAA;;gBACjB,KAAmB,IAAA,wBAAA,SAAA,IAAI,CAAA,CAAA,0BAAA,4CAAE;oBAApB,IAAM,IAAI,iBAAA;oBACb,IAAI,aAAa,EAAE;wBACjB,IAAI,IAAI,KAAK,IAAI,EAAE;4BACjB,KAAK,GAAG,IAAI,CAAA;4BACZ,MAAK;yBACN;qBACF;yBAAM;wBACL,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,WAAW,EAAE,EAAE;4BAC7C,KAAK,GAAG,IAAI,CAAA;4BACZ,MAAK;yBACN;qBACF;iBACF;;;;;;;;;YACD,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAA;SACzB;;;;;;;;;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAtBD,kDAsBC"}

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

@@ -0,0 +1,9 @@
+import { Node, Document } from "../dom/interfaces";
+/**
+ * Converts the given nodes or strings into a node (if `nodes` has
+ * only one element) or a document fragment.
+ *
+ * @param nodes - the array of nodes or strings,
+ * @param document - owner document
+ */
+export declare function parentNode_convertNodesIntoANode(nodes: (Node | string)[], document: Document): Node;

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

@@ -0,0 +1,69 @@
+"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 util_1 = require("@oozcitak/util");
+var CreateAlgorithm_1 = require("./CreateAlgorithm");
+/**
+ * Converts the given nodes or strings into a node (if `nodes` has
+ * only one element) or a document fragment.
+ *
+ * @param nodes - the array of nodes or strings,
+ * @param document - owner document
+ */
+function parentNode_convertNodesIntoANode(nodes, document) {
+    var e_1, _a;
+    /**
+     * 1. Let node be null.
+     * 2. Replace each string in nodes with a new Text node whose data is the
+     * string and node document is document.
+     */
+    var node = null;
+    for (var i = 0; i < nodes.length; i++) {
+        var item = nodes[i];
+        if (util_1.isString(item)) {
+            var text = CreateAlgorithm_1.create_text(document, item);
+            nodes[i] = text;
+        }
+    }
+    /**
+     * 3. If nodes contains one node, set node to that node.
+     * 4. Otherwise, set node to a new DocumentFragment whose node document is
+     * document, and then append each node in nodes, if any, to it.
+     */
+    if (nodes.length === 1) {
+        node = nodes[0];
+    }
+    else {
+        node = CreateAlgorithm_1.create_documentFragment(document);
+        var ns = node;
+        try {
+            for (var nodes_1 = __values(nodes), nodes_1_1 = nodes_1.next(); !nodes_1_1.done; nodes_1_1 = nodes_1.next()) {
+                var item = nodes_1_1.value;
+                ns.appendChild(item);
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (nodes_1_1 && !nodes_1_1.done && (_a = nodes_1.return)) _a.call(nodes_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+    }
+    /**
+     * 5. Return node.
+     */
+    return node;
+}
+exports.parentNode_convertNodesIntoANode = parentNode_convertNodesIntoANode;
+//# sourceMappingURL=ParentNodeAlgorithm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ParentNodeAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/ParentNodeAlgorithm.ts"],"names":[],"mappings":";;;;;;;;;;;;;AACA,uCAAyC;AACzC,qDAAwE;AAExE;;;;;;GAMG;AACH,SAAgB,gCAAgC,CAAC,KAAwB,EACvE,QAAkB;;IAElB;;;;OAIG;IACH,IAAI,IAAI,GAAgB,IAAI,CAAA;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,eAAQ,CAAC,IAAI,CAAC,EAAE;YAClB,IAAM,IAAI,GAAG,6BAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;YACxC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;SAChB;KACF;IAED;;;;OAIG;IACH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,IAAI,GAAG,KAAK,CAAC,CAAC,CAAS,CAAA;KACxB;SAAM;QACL,IAAI,GAAG,yCAAuB,CAAC,QAAQ,CAAC,CAAA;QACxC,IAAM,EAAE,GAAG,IAAI,CAAA;;YACf,KAAmB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;gBAArB,IAAM,IAAI,kBAAA;gBACb,EAAE,CAAC,WAAW,CAAC,IAAY,CAAC,CAAA;aAC7B;;;;;;;;;KACF;IAED;;OAEG;IACH,OAAO,IAAI,CAAA;AACb,CAAC;AApCD,4EAoCC"}

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

@@ -0,0 +1,82 @@
+import { Node, AbstractRange, DocumentFragment, Range } from "../dom/interfaces";
+/**
+ * Determines if the node's start boundary point is at its end boundary
+ * point.
+ *
+ * @param range - a range
+ */
+export declare function range_collapsed(range: AbstractRange): boolean;
+/**
+ * Gets the root node of a range.
+ *
+ * @param range - a range
+ */
+export declare function range_root(range: AbstractRange): Node;
+/**
+ * Determines if a node is fully contained in a range.
+ *
+ * @param node - a node
+ * @param range - a range
+ */
+export declare function range_isContained(node: Node, range: AbstractRange): boolean;
+/**
+ * Determines if a node is partially contained in a range.
+ *
+ * @param node - a node
+ * @param range - a range
+ */
+export declare function range_isPartiallyContained(node: Node, range: AbstractRange): boolean;
+/**
+ * Sets the start boundary point of a range.
+ *
+ * @param range - a range
+ * @param node - a node
+ * @param offset - an offset into node
+ */
+export declare function range_setTheStart(range: AbstractRange, node: Node, offset: number): void;
+/**
+ * Sets the end boundary point of a range.
+ *
+ * @param range - a range
+ * @param node - a node
+ * @param offset - an offset into node
+ */
+export declare function range_setTheEnd(range: AbstractRange, node: Node, offset: number): void;
+/**
+ * Selects a node.
+ *
+ * @param range - a range
+ * @param node - a node
+ */
+export declare function range_select(node: Node, range: AbstractRange): void;
+/**
+ * EXtracts the contents of range as a document fragment.
+ *
+ * @param range - a range
+ */
+export declare function range_extract(range: AbstractRange): DocumentFragment;
+/**
+ * Clones the contents of range as a document fragment.
+ *
+ * @param range - a range
+ */
+export declare function range_cloneTheContents(range: AbstractRange): DocumentFragment;
+/**
+ * Inserts a node into a range at the start boundary point.
+ *
+ * @param node - node to insert
+ * @param range - a range
+ */
+export declare function range_insert(node: Node, range: AbstractRange): void;
+/**
+ * Traverses through all contained nodes of a range.
+ *
+ * @param range - a range
+ */
+export declare function range_getContainedNodes(range: Range): Iterable<Node>;
+/**
+ * Traverses through all partially contained nodes of a range.
+ *
+ * @param range - a range
+ */
+export declare function range_getPartiallyContainedNodes(range: Range): Iterable<Node>;