@pokash/n8n-nodes-ksef 0.2.15 → 0.2.16

package/node_modules/@oozcitak/infra/lib/Set.js

@@ -0,0 +1,467 @@
+"use strict";
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (_) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+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.");
+};
+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;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = require("@oozcitak/util");
+/**
+ * Adds the given item to the end of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function append(set, item) {
+    set.add(item);
+}
+exports.append = append;
+/**
+ * Extends a set by appending all items from another set.
+ *
+ * @param setA - a list to extend
+ * @param setB - a list containing items to append to `setA`
+ */
+function extend(setA, setB) {
+    setB.forEach(setA.add, setA);
+}
+exports.extend = extend;
+/**
+ * Inserts the given item to the start of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function prepend(set, item) {
+    var cloned = new Set(set);
+    set.clear();
+    set.add(item);
+    cloned.forEach(set.add, set);
+}
+exports.prepend = prepend;
+/**
+ * Replaces the given item or all items matching condition with a new item.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to replace or a condition matching items
+ * to replace
+ * @param item - an item
+ */
+function replace(set, conditionOrItem, newItem) {
+    var e_1, _a;
+    var newSet = new Set();
+    try {
+        for (var set_1 = __values(set), set_1_1 = set_1.next(); !set_1_1.done; set_1_1 = set_1.next()) {
+            var oldItem = set_1_1.value;
+            if (util_1.isFunction(conditionOrItem)) {
+                if (!!conditionOrItem.call(null, oldItem)) {
+                    newSet.add(newItem);
+                }
+                else {
+                    newSet.add(oldItem);
+                }
+            }
+            else if (oldItem === conditionOrItem) {
+                newSet.add(newItem);
+            }
+            else {
+                newSet.add(oldItem);
+            }
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (set_1_1 && !set_1_1.done && (_a = set_1.return)) _a.call(set_1);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+    set.clear();
+    newSet.forEach(set.add, set);
+}
+exports.replace = replace;
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function insert(set, item, index) {
+    var e_2, _a;
+    var newSet = new Set();
+    var i = 0;
+    try {
+        for (var set_2 = __values(set), set_2_1 = set_2.next(); !set_2_1.done; set_2_1 = set_2.next()) {
+            var oldItem = set_2_1.value;
+            if (i === index)
+                newSet.add(item);
+            newSet.add(oldItem);
+            i++;
+        }
+    }
+    catch (e_2_1) { e_2 = { error: e_2_1 }; }
+    finally {
+        try {
+            if (set_2_1 && !set_2_1.done && (_a = set_2.return)) _a.call(set_2);
+        }
+        finally { if (e_2) throw e_2.error; }
+    }
+    set.clear();
+    newSet.forEach(set.add, set);
+}
+exports.insert = insert;
+/**
+ * Removes the given item or all items matching condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to remove or a condition matching items
+ * to remove
+ */
+function remove(set, conditionOrItem) {
+    var e_3, _a, e_4, _b;
+    if (!util_1.isFunction(conditionOrItem)) {
+        set.delete(conditionOrItem);
+    }
+    else {
+        var toRemove = [];
+        try {
+            for (var set_3 = __values(set), set_3_1 = set_3.next(); !set_3_1.done; set_3_1 = set_3.next()) {
+                var item = set_3_1.value;
+                if (!!conditionOrItem.call(null, item)) {
+                    toRemove.push(item);
+                }
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (set_3_1 && !set_3_1.done && (_a = set_3.return)) _a.call(set_3);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        try {
+            for (var toRemove_1 = __values(toRemove), toRemove_1_1 = toRemove_1.next(); !toRemove_1_1.done; toRemove_1_1 = toRemove_1.next()) {
+                var oldItem = toRemove_1_1.value;
+                set.delete(oldItem);
+            }
+        }
+        catch (e_4_1) { e_4 = { error: e_4_1 }; }
+        finally {
+            try {
+                if (toRemove_1_1 && !toRemove_1_1.done && (_b = toRemove_1.return)) _b.call(toRemove_1);
+            }
+            finally { if (e_4) throw e_4.error; }
+        }
+    }
+}
+exports.remove = remove;
+/**
+ * Removes all items from the set.
+ */
+function empty(set) {
+    set.clear();
+}
+exports.empty = empty;
+/**
+ * Determines if the set contains the given item or any items matching
+ * condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to a condition to match
+ */
+function contains(set, conditionOrItem) {
+    var e_5, _a;
+    if (!util_1.isFunction(conditionOrItem)) {
+        return set.has(conditionOrItem);
+    }
+    else {
+        try {
+            for (var set_4 = __values(set), set_4_1 = set_4.next(); !set_4_1.done; set_4_1 = set_4.next()) {
+                var oldItem = set_4_1.value;
+                if (!!conditionOrItem.call(null, oldItem)) {
+                    return true;
+                }
+            }
+        }
+        catch (e_5_1) { e_5 = { error: e_5_1 }; }
+        finally {
+            try {
+                if (set_4_1 && !set_4_1.done && (_a = set_4.return)) _a.call(set_4);
+            }
+            finally { if (e_5) throw e_5.error; }
+        }
+    }
+    return false;
+}
+exports.contains = contains;
+/**
+ * Returns the count of items in the set matching the given condition.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+function size(set, condition) {
+    var e_6, _a;
+    if (condition === undefined) {
+        return set.size;
+    }
+    else {
+        var count = 0;
+        try {
+            for (var set_5 = __values(set), set_5_1 = set_5.next(); !set_5_1.done; set_5_1 = set_5.next()) {
+                var item = set_5_1.value;
+                if (!!condition.call(null, item)) {
+                    count++;
+                }
+            }
+        }
+        catch (e_6_1) { e_6 = { error: e_6_1 }; }
+        finally {
+            try {
+                if (set_5_1 && !set_5_1.done && (_a = set_5.return)) _a.call(set_5);
+            }
+            finally { if (e_6) throw e_6.error; }
+        }
+        return count;
+    }
+}
+exports.size = size;
+/**
+ * Determines if the set is empty.
+ *
+ * @param set - a set
+ */
+function isEmpty(set) {
+    return set.size === 0;
+}
+exports.isEmpty = isEmpty;
+/**
+ * Returns an iterator for the items of the set.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+function forEach(set, condition) {
+    var set_6, set_6_1, item, e_7_1;
+    var e_7, _a;
+    return __generator(this, function (_b) {
+        switch (_b.label) {
+            case 0:
+                if (!(condition === undefined)) return [3 /*break*/, 2];
+                return [5 /*yield**/, __values(set)];
+            case 1:
+                _b.sent();
+                return [3 /*break*/, 9];
+            case 2:
+                _b.trys.push([2, 7, 8, 9]);
+                set_6 = __values(set), set_6_1 = set_6.next();
+                _b.label = 3;
+            case 3:
+                if (!!set_6_1.done) return [3 /*break*/, 6];
+                item = set_6_1.value;
+                if (!!!condition.call(null, item)) return [3 /*break*/, 5];
+                return [4 /*yield*/, item];
+            case 4:
+                _b.sent();
+                _b.label = 5;
+            case 5:
+                set_6_1 = set_6.next();
+                return [3 /*break*/, 3];
+            case 6: return [3 /*break*/, 9];
+            case 7:
+                e_7_1 = _b.sent();
+                e_7 = { error: e_7_1 };
+                return [3 /*break*/, 9];
+            case 8:
+                try {
+                    if (set_6_1 && !set_6_1.done && (_a = set_6.return)) _a.call(set_6);
+                }
+                finally { if (e_7) throw e_7.error; }
+                return [7 /*endfinally*/];
+            case 9: return [2 /*return*/];
+        }
+    });
+}
+exports.forEach = forEach;
+/**
+ * Creates and returns a shallow clone of set.
+ *
+ * @param set - a set
+ */
+function clone(set) {
+    return new Set(set);
+}
+exports.clone = clone;
+/**
+ * Returns a new set containing items from the set sorted in ascending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInAscendingOrder(set, lessThanAlgo) {
+    var list = new (Array.bind.apply(Array, __spread([void 0], set)))();
+    list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? -1 : 1;
+    });
+    return new Set(list);
+}
+exports.sortInAscendingOrder = sortInAscendingOrder;
+/**
+ * Returns a new set containing items from the set sorted in descending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInDescendingOrder(set, lessThanAlgo) {
+    var list = new (Array.bind.apply(Array, __spread([void 0], set)))();
+    list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? 1 : -1;
+    });
+    return new Set(list);
+}
+exports.sortInDescendingOrder = sortInDescendingOrder;
+/**
+ * Determines if a set is a subset of another set.
+ *
+ * @param subset - a set
+ * @param superset - a superset possibly containing all items from `subset`.
+ */
+function isSubsetOf(subset, superset) {
+    var e_8, _a;
+    try {
+        for (var subset_1 = __values(subset), subset_1_1 = subset_1.next(); !subset_1_1.done; subset_1_1 = subset_1.next()) {
+            var item = subset_1_1.value;
+            if (!superset.has(item))
+                return false;
+        }
+    }
+    catch (e_8_1) { e_8 = { error: e_8_1 }; }
+    finally {
+        try {
+            if (subset_1_1 && !subset_1_1.done && (_a = subset_1.return)) _a.call(subset_1);
+        }
+        finally { if (e_8) throw e_8.error; }
+    }
+    return true;
+}
+exports.isSubsetOf = isSubsetOf;
+/**
+ * Determines if a set is a superset of another set.
+ *
+ * @param superset - a set
+ * @param subset - a subset possibly contained within `superset`.
+ */
+function isSupersetOf(superset, subset) {
+    return isSubsetOf(subset, superset);
+}
+exports.isSupersetOf = isSupersetOf;
+/**
+ * Returns a new set with items that are contained in both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+function intersection(setA, setB) {
+    var e_9, _a;
+    var newSet = new Set();
+    try {
+        for (var setA_1 = __values(setA), setA_1_1 = setA_1.next(); !setA_1_1.done; setA_1_1 = setA_1.next()) {
+            var item = setA_1_1.value;
+            if (setB.has(item))
+                newSet.add(item);
+        }
+    }
+    catch (e_9_1) { e_9 = { error: e_9_1 }; }
+    finally {
+        try {
+            if (setA_1_1 && !setA_1_1.done && (_a = setA_1.return)) _a.call(setA_1);
+        }
+        finally { if (e_9) throw e_9.error; }
+    }
+    return newSet;
+}
+exports.intersection = intersection;
+/**
+ * Returns a new set with items from both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+function union(setA, setB) {
+    var newSet = new Set(setA);
+    setB.forEach(newSet.add, newSet);
+    return newSet;
+}
+exports.union = union;
+/**
+ * Returns a set of integers from `n` to `m` inclusive.
+ *
+ * @param n - starting number
+ * @param m - ending number
+ */
+function range(n, m) {
+    var newSet = new Set();
+    for (var i = n; i <= m; i++) {
+        newSet.add(i);
+    }
+    return newSet;
+}
+exports.range = range;
+//# sourceMappingURL=Set.js.map

package/node_modules/@oozcitak/infra/lib/Set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Set.js","sourceRoot":"","sources":["../src/Set.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,uCAA2C;AAE3C;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,IAAO;IAC5C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AAFD,wBAEC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,IAAY,EAAE,IAAY;IAClD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAC9B,CAAC;AAFD,wBAEC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAI,GAAW,EAAE,IAAO;IAC7C,IAAM,MAAM,GAAG,IAAI,GAAG,CAAI,GAAG,CAAC,CAAA;IAC9B,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACb,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AALD,0BAKC;AAED;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,GAAW,EAAE,eAA2C,EACjF,OAAU;;IACV,IAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;;QAC3B,KAAsB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;YAAtB,IAAM,OAAO,gBAAA;YAChB,IAAI,iBAAU,CAAC,eAAe,CAAC,EAAE;gBAC/B,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;oBACzC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;iBACpB;qBAAM;oBACL,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;iBACpB;aACF;iBAAM,IAAI,OAAO,KAAK,eAAe,EAAE;gBACtC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;aACpB;iBAAM;gBACL,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;aACpB;SACF;;;;;;;;;IACD,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAlBD,0BAkBC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,IAAO,EAAE,KAAa;;IAC3D,IAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAA;;QACT,KAAsB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;YAAtB,IAAM,OAAO,gBAAA;YAChB,IAAI,CAAC,KAAK,KAAK;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACnB,CAAC,EAAE,CAAA;SACJ;;;;;;;;;IACD,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAVD,wBAUC;AAED;;;;;;GAMG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,eAA2C;;IAChF,IAAI,CAAC,iBAAU,CAAC,eAAe,CAAC,EAAE;QAChC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,CAAA;KAC5B;SAAM;QACL,IAAM,QAAQ,GAAa,EAAE,CAAA;;YAC7B,KAAmB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;gBAAnB,IAAM,IAAI,gBAAA;gBACb,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;iBACpB;aACF;;;;;;;;;;YACD,KAAqB,IAAA,aAAA,SAAA,QAAQ,CAAA,kCAAA,wDAAE;gBAA3B,IAAM,OAAO,qBAAA;gBACf,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;aACpB;;;;;;;;;KACF;AACH,CAAC;AAdD,wBAcC;AAED;;GAEG;AACH,SAAgB,KAAK,CAAI,GAAW;IAClC,GAAG,CAAC,KAAK,EAAE,CAAA;AACb,CAAC;AAFD,sBAEC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAI,GAAW,EAAE,eAA2C;;IAClF,IAAI,CAAC,iBAAU,CAAC,eAAe,CAAC,EAAE;QAChC,OAAO,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;KAChC;SAAM;;YACL,KAAsB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;gBAAtB,IAAM,OAAO,gBAAA;gBAChB,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;oBACzC,OAAO,IAAI,CAAA;iBACZ;aACF;;;;;;;;;KACF;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAXD,4BAWC;AAED;;;;;GAKG;AACH,SAAgB,IAAI,CAAI,GAAW,EAAE,SAAkC;;IACrE,IAAI,SAAS,KAAK,SAAS,EAAE;QAC3B,OAAO,GAAG,CAAC,IAAI,CAAA;KAChB;SAAM;QACL,IAAI,KAAK,GAAG,CAAC,CAAA;;YACb,KAAmB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;gBAAnB,IAAM,IAAI,gBAAA;gBACb,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;oBAChC,KAAK,EAAE,CAAA;iBACR;aACF;;;;;;;;;QACD,OAAO,KAAK,CAAA;KACb;AACH,CAAC;AAZD,oBAYC;AAED;;;;GAIG;AACH,SAAgB,OAAO,CAAI,GAAW;IACpC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,CAAA;AACvB,CAAC;AAFD,0BAEC;AAED;;;;;GAKG;AACH,SAAiB,OAAO,CAAI,GAAW,EAAE,SAAkC;;;;;;qBACrE,CAAA,SAAS,KAAK,SAAS,CAAA,EAAvB,wBAAuB;gBACzB,sBAAA,SAAO,GAAG,CAAA,EAAA;;gBAAV,SAAU,CAAA;;;;gBAES,QAAA,SAAA,GAAG,CAAA;;;;gBAAX,IAAI;qBACT,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAA5B,wBAA4B;gBAC9B,qBAAM,IAAI,EAAA;;gBAAV,SAAU,CAAA;;;;;;;;;;;;;;;;;;;CAIjB;AAVD,0BAUC;AAED;;;;GAIG;AACH,SAAgB,KAAK,CAAI,GAAW;IAClC,OAAO,IAAI,GAAG,CAAI,GAAG,CAAC,CAAA;AACxB,CAAC;AAFD,sBAEC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAI,GAAW,EACjD,YAA+C;IAC/C,IAAM,IAAI,QAAO,KAAK,YAAL,KAAK,qBAAO,GAAG,KAAC,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAC,KAAQ,EAAE,KAAQ;QAC3B,OAAA,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAA9C,CAA8C,CAAC,CAAA;IACjD,OAAO,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;AACzB,CAAC;AAND,oDAMC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CAAI,GAAW,EAClD,YAA+C;IAC/C,IAAM,IAAI,QAAO,KAAK,YAAL,KAAK,qBAAO,GAAG,KAAC,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAC,KAAQ,EAAE,KAAQ;QAC3B,OAAA,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAA9C,CAA8C,CAAC,CAAA;IACjD,OAAO,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;AACzB,CAAC;AAND,sDAMC;AAED;;;;;GAKG;AACH,SAAgB,UAAU,CAAI,MAAc,EAAE,QAAgB;;;QAC5D,KAAmB,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE;YAAtB,IAAM,IAAI,mBAAA;YACb,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;SACtC;;;;;;;;;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AALD,gCAKC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAI,QAAgB,EAAE,MAAc;IAC9D,OAAO,UAAU,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AACrC,CAAC;AAFD,oCAEC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAI,IAAY,EAAE,IAAY;;IACxD,IAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;;QAC3B,KAAmB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;YAApB,IAAM,IAAI,iBAAA;YACb,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;SACrC;;;;;;;;;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAND,oCAMC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAI,IAAY,EAAE,IAAY;IACjD,IAAM,MAAM,GAAG,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;IAC/B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAChC,OAAO,MAAM,CAAA;AACf,CAAC;AAJD,sBAIC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAC,CAAS,EAAE,CAAS;IACxC,IAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;KACd;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAND,sBAMC"}

package/node_modules/@oozcitak/infra/lib/Stack.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Pushes the given item to the stack.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function push<T>(list: Array<T>, item: T): void;
+/**
+ * Pops and returns an item from the stack.
+ *
+ * @param list - a list
+ */
+export declare function pop<T>(list: Array<T>): T | null;

package/node_modules/@oozcitak/infra/lib/Stack.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Pushes the given item to the stack.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function push(list, item) {
+    list.push(item);
+}
+exports.push = push;
+/**
+ * Pops and returns an item from the stack.
+ *
+ * @param list - a list
+ */
+function pop(list) {
+    return list.pop() || null;
+}
+exports.pop = pop;
+//# sourceMappingURL=Stack.js.map

package/node_modules/@oozcitak/infra/lib/Stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Stack.js","sourceRoot":"","sources":["../src/Stack.ts"],"names":[],"mappings":";;AAAA;;;;;GAKG;AACH,SAAgB,IAAI,CAAI,IAAc,EAAE,IAAO;IAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACjB,CAAC;AAFD,oBAEC;AAED;;;;GAIG;AACH,SAAgB,GAAG,CAAI,IAAc;IACnC,OAAO,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAA;AAC3B,CAAC;AAFD,kBAEC"}

package/node_modules/@oozcitak/infra/lib/String.d.ts

@@ -0,0 +1,129 @@
+/**
+ * Determines if the string `a` is a code unit prefix of string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function isCodeUnitPrefix(a: string, b: string): boolean;
+/**
+ * Determines if the string `a` is a code unit less than string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function isCodeUnitLessThan(a: string, b: string): boolean;
+/**
+ * Isomorphic encodes the given string.
+ *
+ * @param str - a string
+ */
+export declare function isomorphicEncode(str: string): Uint8Array;
+/**
+ * Determines if the given string is An ASCII string.
+ *
+ * @param str - a string
+ */
+export declare function isASCIIString(str: string): boolean;
+/**
+ * Converts all uppercase ASCII code points to lowercase.
+ *
+ * @param str - a string
+ */
+export declare function asciiLowercase(str: string): string;
+/**
+ * Converts all uppercase ASCII code points to uppercase.
+ *
+ * @param str - a string
+ */
+export declare function asciiUppercase(str: string): string;
+/**
+ * Compares two ASCII strings case-insensitively.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function asciiCaseInsensitiveMatch(a: string, b: string): boolean;
+/**
+ * ASCII encodes a string.
+ *
+ * @param str - a string
+ */
+export declare function asciiEncode(str: string): Uint8Array;
+/**
+ * ASCII decodes a byte sequence.
+ *
+ * @param bytes - a byte sequence
+ */
+export declare function asciiDecode(bytes: Uint8Array): string;
+/**
+ * Strips newline characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripNewlines(str: string): string;
+/**
+ * Normalizes newline characters in a string by converting consecutive
+ * carriage-return newline characters and also single carriage return characters
+ * into a single newline.
+ *
+ * @param str - a string
+ */
+export declare function normalizeNewlines(str: string): string;
+/**
+ * Removes leading and trailing whitespace characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripLeadingAndTrailingASCIIWhitespace(str: string): string;
+/**
+ * Removes consecutive newline characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripAndCollapseASCIIWhitespace(str: string): string;
+/**
+ * Collects a sequence of code points matching a given condition from the input
+ * string.
+ *
+ * @param condition - a condition to match
+ * @param input - a string
+ * @param options - starting position
+ */
+export declare function collectASequenceOfCodePoints(condition: ((str: string) => boolean), input: string | string[], options: {
+    position: number;
+}): string;
+/**
+ * Skips over ASCII whitespace.
+ *
+ * @param input - input string
+ * @param options - starting position
+ */
+export declare function skipASCIIWhitespace(input: string | string[], options: {
+    position: number;
+}): void;
+/**
+ * Solits a string at the given delimiter.
+ *
+ * @param input - input string
+ * @param delimiter - a delimiter string
+ */
+export declare function strictlySplit(input: string | string[], delimiter: string): string[];
+/**
+ * Splits a string on ASCII whitespace.
+ *
+ * @param input - a string
+ */
+export declare function splitAStringOnASCIIWhitespace(input: string | string[]): string[];
+/**
+ * Splits a string on commas.
+ *
+ * @param input - a string
+ */
+export declare function splitAStringOnCommas(input: string | string[]): string[];
+/**
+ * Concatenates a list of strings with the given separator.
+ *
+ * @param list - a list of strings
+ * @param separator - a separator string
+ */
+export declare function concatenate(list: string[], separator?: string): string;