@pokash/n8n-nodes-ksef 0.2.12 → 0.2.16

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

@@ -0,0 +1,308 @@
+"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");
+/**
+ * Gets the value corresponding to the given key.
+ *
+ * @param map - a map
+ * @param key - a key
+ */
+function get(map, key) {
+    return map.get(key);
+}
+exports.get = get;
+/**
+ * Sets the value corresponding to the given key.
+ *
+ * @param map - a map
+ * @param key - a key
+ * @param val - a value
+ */
+function set(map, key, val) {
+    map.set(key, val);
+}
+exports.set = set;
+/**
+ * Removes the item with the given key or all items matching condition.
+ *
+ * @param map - a map
+ * @param conditionOrItem - the key of an item to remove or a condition matching
+ * items to remove
+ */
+function remove(map, conditionOrItem) {
+    var e_1, _a, e_2, _b;
+    if (!util_1.isFunction(conditionOrItem)) {
+        map.delete(conditionOrItem);
+    }
+    else {
+        var toRemove = [];
+        try {
+            for (var map_1 = __values(map), map_1_1 = map_1.next(); !map_1_1.done; map_1_1 = map_1.next()) {
+                var item = map_1_1.value;
+                if (!!conditionOrItem.call(null, item)) {
+                    toRemove.push(item[0]);
+                }
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (map_1_1 && !map_1_1.done && (_a = map_1.return)) _a.call(map_1);
+            }
+            finally { if (e_1) throw e_1.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 key = toRemove_1_1.value;
+                map.delete(key);
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (toRemove_1_1 && !toRemove_1_1.done && (_b = toRemove_1.return)) _b.call(toRemove_1);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+    }
+}
+exports.remove = remove;
+/**
+ * Determines if the map contains a value with the given key.
+ *
+ * @param map - a map
+ * @param conditionOrItem - the key of an item to match or a condition matching
+ * items
+ */
+function contains(map, conditionOrItem) {
+    var e_3, _a;
+    if (!util_1.isFunction(conditionOrItem)) {
+        return map.has(conditionOrItem);
+    }
+    else {
+        try {
+            for (var map_2 = __values(map), map_2_1 = map_2.next(); !map_2_1.done; map_2_1 = map_2.next()) {
+                var item = map_2_1.value;
+                if (!!conditionOrItem.call(null, item)) {
+                    return true;
+                }
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (map_2_1 && !map_2_1.done && (_a = map_2.return)) _a.call(map_2);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        return false;
+    }
+}
+exports.contains = contains;
+/**
+ * Gets the keys of the map.
+ *
+ * @param map - a map
+ */
+function keys(map) {
+    return new Set(map.keys());
+}
+exports.keys = keys;
+/**
+ * Gets the values of the map.
+ *
+ * @param map - a map
+ */
+function values(map) {
+    return __spread(map.values());
+}
+exports.values = values;
+/**
+ * Gets the size of the map.
+ *
+ * @param map - a map
+ * @param condition - an optional condition to match
+ */
+function size(map, condition) {
+    var e_4, _a;
+    if (condition === undefined) {
+        return map.size;
+    }
+    else {
+        var count = 0;
+        try {
+            for (var map_3 = __values(map), map_3_1 = map_3.next(); !map_3_1.done; map_3_1 = map_3.next()) {
+                var item = map_3_1.value;
+                if (!!condition.call(null, item)) {
+                    count++;
+                }
+            }
+        }
+        catch (e_4_1) { e_4 = { error: e_4_1 }; }
+        finally {
+            try {
+                if (map_3_1 && !map_3_1.done && (_a = map_3.return)) _a.call(map_3);
+            }
+            finally { if (e_4) throw e_4.error; }
+        }
+        return count;
+    }
+}
+exports.size = size;
+/**
+ * Determines if the map is empty.
+ *
+ * @param map - a map
+ */
+function isEmpty(map) {
+    return map.size === 0;
+}
+exports.isEmpty = isEmpty;
+/**
+ * Returns an iterator for the items of the map.
+ *
+ * @param map - a map
+ * @param condition - an optional condition to match
+ */
+function forEach(map, condition) {
+    var map_4, map_4_1, item, e_5_1;
+    var e_5, _a;
+    return __generator(this, function (_b) {
+        switch (_b.label) {
+            case 0:
+                if (!(condition === undefined)) return [3 /*break*/, 2];
+                return [5 /*yield**/, __values(map)];
+            case 1:
+                _b.sent();
+                return [3 /*break*/, 9];
+            case 2:
+                _b.trys.push([2, 7, 8, 9]);
+                map_4 = __values(map), map_4_1 = map_4.next();
+                _b.label = 3;
+            case 3:
+                if (!!map_4_1.done) return [3 /*break*/, 6];
+                item = map_4_1.value;
+                if (!!!condition.call(null, item)) return [3 /*break*/, 5];
+                return [4 /*yield*/, item];
+            case 4:
+                _b.sent();
+                _b.label = 5;
+            case 5:
+                map_4_1 = map_4.next();
+                return [3 /*break*/, 3];
+            case 6: return [3 /*break*/, 9];
+            case 7:
+                e_5_1 = _b.sent();
+                e_5 = { error: e_5_1 };
+                return [3 /*break*/, 9];
+            case 8:
+                try {
+                    if (map_4_1 && !map_4_1.done && (_a = map_4.return)) _a.call(map_4);
+                }
+                finally { if (e_5) throw e_5.error; }
+                return [7 /*endfinally*/];
+            case 9: return [2 /*return*/];
+        }
+    });
+}
+exports.forEach = forEach;
+/**
+ * Creates and returns a shallow clone of map.
+ *
+ * @param map - a map
+ */
+function clone(map) {
+    return new Map(map);
+}
+exports.clone = clone;
+/**
+ * Returns a new map containing items from the map sorted in ascending
+ * order.
+ *
+ * @param map - a map
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInAscendingOrder(map, lessThanAlgo) {
+    var list = new (Array.bind.apply(Array, __spread([void 0], map)))();
+    list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? -1 : 1;
+    });
+    return new Map(list);
+}
+exports.sortInAscendingOrder = sortInAscendingOrder;
+/**
+ * Returns a new map containing items from the map sorted in descending
+ * order.
+ *
+ * @param map - a map
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInDescendingOrder(map, lessThanAlgo) {
+    var list = new (Array.bind.apply(Array, __spread([void 0], map)))();
+    list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? 1 : -1;
+    });
+    return new Map(list);
+}
+exports.sortInDescendingOrder = sortInDescendingOrder;
+//# sourceMappingURL=Map.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Map.js","sourceRoot":"","sources":["../src/Map.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,uCAA2C;AAE3C;;;;;GAKG;AACH,SAAgB,GAAG,CAAO,GAAc,EAAE,GAAM;IAC9C,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AACrB,CAAC;AAFD,kBAEC;AAED;;;;;;GAMG;AACH,SAAgB,GAAG,CAAO,GAAc,EAAE,GAAM,EAAE,GAAK;IACrD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AACnB,CAAC;AAFD,kBAEC;AAED;;;;;;GAMG;AACH,SAAgB,MAAM,CAAO,GAAc,EAAE,eAAgD;;IAC3F,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,CAAC,CAAC,CAAC,CAAA;iBACvB;aACF;;;;;;;;;;YACD,KAAiB,IAAA,aAAA,SAAA,QAAQ,CAAA,kCAAA,wDAAE;gBAAvB,IAAM,GAAG,qBAAA;gBACX,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;aAChB;;;;;;;;;KACF;AACH,CAAC;AAdD,wBAcC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAO,GAAc,EAAE,eAAgD;;IAC7F,IAAI,CAAC,iBAAU,CAAC,eAAe,CAAC,EAAE;QAChC,OAAO,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;KAChC;SAAM;;YACL,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,OAAO,IAAI,CAAA;iBACZ;aACF;;;;;;;;;QACD,OAAO,KAAK,CAAA;KACb;AACH,CAAC;AAXD,4BAWC;AAED;;;;GAIG;AACH,SAAgB,IAAI,CAAO,GAAc;IACvC,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;AAC5B,CAAC;AAFD,oBAEC;AAED;;;;GAIG;AACH,SAAgB,MAAM,CAAO,GAAc;IACzC,gBAAW,GAAG,CAAC,MAAM,EAAE,EAAC;AAC1B,CAAC;AAFD,wBAEC;AAED;;;;;GAKG;AACH,SAAgB,IAAI,CAAO,GAAc,EAAE,SAAuC;;IAChF,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,CAAO,GAAc;IAC1C,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,CAAA;AACvB,CAAC;AAFD,0BAEC;AAED;;;;;GAKG;AACH,SAAiB,OAAO,CAAO,GAAc,EAAE,SAAuC;;;;;;qBAChF,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,CAAO,GAAc;IACxC,OAAO,IAAI,GAAG,CAAO,GAAG,CAAC,CAAA;AAC3B,CAAC;AAFD,sBAEC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAO,GAAc,EACvD,YAAyD;IACzD,IAAM,IAAI,QAAO,KAAK,YAAL,KAAK,qBAAY,GAAG,KAAC,CAAA;IACtC,IAAI,CAAC,IAAI,CAAC,UAAC,KAAK,EAAE,KAAK;QACrB,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,CAAO,IAAI,CAAC,CAAA;AAC5B,CAAC;AAND,oDAMC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CAAO,GAAc,EACxD,YAAyD;IACzD,IAAM,IAAI,QAAO,KAAK,YAAL,KAAK,qBAAY,GAAG,KAAC,CAAA;IACtC,IAAI,CAAC,IAAI,CAAC,UAAC,KAAK,EAAE,KAAK;QACrB,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,CAAO,IAAI,CAAC,CAAA;AAC5B,CAAC;AAND,sDAMC"}

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

@@ -0,0 +1,6 @@
+export declare const HTML = "http://www.w3.org/1999/xhtml";
+export declare const XML = "http://www.w3.org/XML/1998/namespace";
+export declare const XMLNS = "http://www.w3.org/2000/xmlns/";
+export declare const MathML = "http://www.w3.org/1998/Math/MathML";
+export declare const SVG = "http://www.w3.org/2000/svg";
+export declare const XLink = "http://www.w3.org/1999/xlink";

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

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HTML = "http://www.w3.org/1999/xhtml";
+exports.XML = "http://www.w3.org/XML/1998/namespace";
+exports.XMLNS = "http://www.w3.org/2000/xmlns/";
+exports.MathML = "http://www.w3.org/1998/Math/MathML";
+exports.SVG = "http://www.w3.org/2000/svg";
+exports.XLink = "http://www.w3.org/1999/xlink";
+//# sourceMappingURL=Namespace.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Namespace.js","sourceRoot":"","sources":["../src/Namespace.ts"],"names":[],"mappings":";;AAAa,QAAA,IAAI,GAAG,8BAA8B,CAAA;AACrC,QAAA,GAAG,GAAG,sCAAsC,CAAA;AAC5C,QAAA,KAAK,GAAG,+BAA+B,CAAA;AACvC,QAAA,MAAM,GAAG,oCAAoC,CAAA;AAC7C,QAAA,GAAG,GAAG,4BAA4B,CAAA;AAClC,QAAA,KAAK,GAAG,8BAA8B,CAAA"}

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

@@ -0,0 +1,13 @@
+/**
+ * Appends the given item to the queue.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function enqueue<T>(list: Array<T>, item: T): void;
+/**
+ * Removes and returns an item from the queue.
+ *
+ * @param list - a list
+ */
+export declare function dequeue<T>(list: Array<T>): T | null;

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

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Appends the given item to the queue.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function enqueue(list, item) {
+    list.push(item);
+}
+exports.enqueue = enqueue;
+/**
+ * Removes and returns an item from the queue.
+ *
+ * @param list - a list
+ */
+function dequeue(list) {
+    return list.shift() || null;
+}
+exports.dequeue = dequeue;
+//# sourceMappingURL=Queue.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../src/Queue.ts"],"names":[],"mappings":";;AAAA;;;;;GAKG;AACH,SAAgB,OAAO,CAAI,IAAc,EAAE,IAAO;IAChD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACjB,CAAC;AAFD,0BAEC;AAED;;;;GAIG;AACH,SAAgB,OAAO,CAAI,IAAc;IACvC,OAAO,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,CAAA;AAC7B,CAAC;AAFD,0BAEC"}

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

@@ -0,0 +1,136 @@
+/**
+ * Adds the given item to the end of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function append<T>(set: Set<T>, item: T): void;
+/**
+ * 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`
+ */
+export declare function extend<T>(setA: Set<T>, setB: Set<T>): void;
+/**
+ * Inserts the given item to the start of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function prepend<T>(set: Set<T>, item: T): void;
+/**
+ * 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
+ */
+export declare function replace<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean), newItem: T): void;
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function insert<T>(set: Set<T>, item: T, index: number): void;
+/**
+ * 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
+ */
+export declare function remove<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean)): void;
+/**
+ * Removes all items from the set.
+ */
+export declare function empty<T>(set: Set<T>): void;
+/**
+ * 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
+ */
+export declare function contains<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean)): boolean;
+/**
+ * Returns the count of items in the set matching the given condition.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+export declare function size<T>(set: Set<T>, condition?: ((item: T) => boolean)): number;
+/**
+ * Determines if the set is empty.
+ *
+ * @param set - a set
+ */
+export declare function isEmpty<T>(set: Set<T>): boolean;
+/**
+ * Returns an iterator for the items of the set.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+export declare function forEach<T>(set: Set<T>, condition?: ((item: T) => boolean)): IterableIterator<T>;
+/**
+ * Creates and returns a shallow clone of set.
+ *
+ * @param set - a set
+ */
+export declare function clone<T>(set: Set<T>): Set<T>;
+/**
+ * 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.
+ */
+export declare function sortInAscendingOrder<T>(set: Set<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Set<T>;
+/**
+ * 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.
+ */
+export declare function sortInDescendingOrder<T>(set: Set<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Set<T>;
+/**
+ * Determines if a set is a subset of another set.
+ *
+ * @param subset - a set
+ * @param superset - a superset possibly containing all items from `subset`.
+ */
+export declare function isSubsetOf<T>(subset: Set<T>, superset: Set<T>): boolean;
+/**
+ * Determines if a set is a superset of another set.
+ *
+ * @param superset - a set
+ * @param subset - a subset possibly contained within `superset`.
+ */
+export declare function isSupersetOf<T>(superset: Set<T>, subset: Set<T>): boolean;
+/**
+ * Returns a new set with items that are contained in both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+export declare function intersection<T>(setA: Set<T>, setB: Set<T>): Set<T>;
+/**
+ * Returns a new set with items from both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+export declare function union<T>(setA: Set<T>, setB: Set<T>): Set<T>;
+/**
+ * Returns a set of integers from `n` to `m` inclusive.
+ *
+ * @param n - starting number
+ * @param m - ending number
+ */
+export declare function range(n: number, m: number): Set<number>;