projen 0.0.0

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

@@ -0,0 +1,123 @@
+"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");
+/**
+ * Parses the given byte sequence representing a JSON string into an object.
+ *
+ * @param bytes - a byte sequence
+ */
+function parseJSONFromBytes(bytes) {
+    /**
+     * 1. Let jsonText be the result of running UTF-8 decode on bytes. [ENCODING]
+     * 2. Return ? Call(%JSONParse%, undefined, « jsonText »).
+     */
+    var jsonText = util_1.utf8Decode(bytes);
+    return JSON.parse.call(undefined, jsonText);
+}
+exports.parseJSONFromBytes = parseJSONFromBytes;
+/**
+ * Serialize the given JavaScript value into a byte sequence.
+ *
+ * @param value - a JavaScript value
+ */
+function serializeJSONToBytes(value) {
+    /**
+     * 1. Let jsonString be ? Call(%JSONStringify%, undefined, « value »).
+     * 2. Return the result of running UTF-8 encode on jsonString. [ENCODING]
+     */
+    var jsonString = JSON.stringify.call(undefined, value);
+    return util_1.utf8Encode(jsonString);
+}
+exports.serializeJSONToBytes = serializeJSONToBytes;
+/**
+ * Parses the given JSON string into a Realm-independent JavaScript value.
+ *
+ * @param jsonText - a JSON string
+ */
+function parseJSONIntoInfraValues(jsonText) {
+    /**
+     * 1. Let jsValue be ? Call(%JSONParse%, undefined, « jsonText »).
+     * 2. Return the result of converting a JSON-derived JavaScript value to an
+     * Infra value, given jsValue.
+     */
+    var jsValue = JSON.parse.call(undefined, jsonText);
+    return convertAJSONDerivedJavaScriptValueToAnInfraValue(jsValue);
+}
+exports.parseJSONIntoInfraValues = parseJSONIntoInfraValues;
+/**
+ * Parses the value into a Realm-independent JavaScript value.
+ *
+ * @param jsValue - a JavaScript value
+ */
+function convertAJSONDerivedJavaScriptValueToAnInfraValue(jsValue) {
+    var e_1, _a;
+    /**
+     * 1. If Type(jsValue) is Null, String, or Number, then return jsValue.
+     */
+    if (jsValue === null || util_1.isString(jsValue) || util_1.isNumber(jsValue))
+        return jsValue;
+    /**
+     * 2. If IsArray(jsValue) is true, then:
+     * 2.1. Let result be an empty list.
+     * 2.2. Let length be ! ToLength(! Get(jsValue, "length")).
+     * 2.3. For each index of the range 0 to length − 1, inclusive:
+     * 2.3.1. Let indexName be ! ToString(index).
+     * 2.3.2. Let jsValueAtIndex be ! Get(jsValue, indexName).
+     * 2.3.3. Let infraValueAtIndex be the result of converting a JSON-derived
+     * JavaScript value to an Infra value, given jsValueAtIndex.
+     * 2.3.4. Append infraValueAtIndex to result.
+     * 2.8. Return result.
+     */
+    if (util_1.isArray(jsValue)) {
+        var result = new Array();
+        try {
+            for (var jsValue_1 = __values(jsValue), jsValue_1_1 = jsValue_1.next(); !jsValue_1_1.done; jsValue_1_1 = jsValue_1.next()) {
+                var jsValueAtIndex = jsValue_1_1.value;
+                result.push(convertAJSONDerivedJavaScriptValueToAnInfraValue(jsValueAtIndex));
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (jsValue_1_1 && !jsValue_1_1.done && (_a = jsValue_1.return)) _a.call(jsValue_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        return result;
+    }
+    else if (util_1.isObject(jsValue)) {
+        /**
+         * 3. Let result be an empty ordered map.
+         * 4. For each key of ! jsValue.[[OwnPropertyKeys]]():
+         * 4.1. Let jsValueAtKey be ! Get(jsValue, key).
+         * 4.2. Let infraValueAtKey be the result of converting a JSON-derived
+         * JavaScript value to an Infra value, given jsValueAtKey.
+         * 4.3. Set result[key] to infraValueAtKey.
+         * 5. Return result.
+         */
+        var result = new Map();
+        for (var key in jsValue) {
+            /* istanbul ignore else */
+            if (jsValue.hasOwnProperty(key)) {
+                var jsValueAtKey = jsValue[key];
+                result.set(key, convertAJSONDerivedJavaScriptValueToAnInfraValue(jsValueAtKey));
+            }
+        }
+        return result;
+    }
+    /* istanbul ignore next */
+    return jsValue;
+}
+exports.convertAJSONDerivedJavaScriptValueToAnInfraValue = convertAJSONDerivedJavaScriptValueToAnInfraValue;
+//# sourceMappingURL=JSON.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"JSON.js","sourceRoot":"","sources":["../src/JSON.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAAA,uCAEuB;AAEvB;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,KAAiB;IAClD;;;OAGG;IACH,IAAM,QAAQ,GAAG,iBAAU,CAAC,KAAK,CAAC,CAAA;IAClC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;AAC7C,CAAC;AAPD,gDAOC;AAED;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,KAAU;IAC7C;;;OAGG;IACH,IAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAA;IACxD,OAAO,iBAAU,CAAC,UAAU,CAAC,CAAA;AAC/B,CAAC;AAPD,oDAOC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,QAAgB;IACvD;;;;OAIG;IACH,IAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;IACpD,OAAO,gDAAgD,CAAC,OAAO,CAAC,CAAA;AAClE,CAAC;AARD,4DAQC;AAED;;;;GAIG;AACH,SAAgB,gDAAgD,CAAC,OAAY;;IAC3E;;OAEG;IACH,IAAI,OAAO,KAAK,IAAI,IAAI,eAAQ,CAAC,OAAO,CAAC,IAAI,eAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAA;IAE9E;;;;;;;;;;;OAWG;IACH,IAAI,cAAO,CAAC,OAAO,CAAC,EAAE;QACpB,IAAM,MAAM,GAAG,IAAI,KAAK,EAAO,CAAA;;YAC/B,KAA6B,IAAA,YAAA,SAAA,OAAO,CAAA,gCAAA,qDAAE;gBAAjC,IAAM,cAAc,oBAAA;gBACvB,MAAM,CAAC,IAAI,CAAC,gDAAgD,CAAC,cAAc,CAAC,CAAC,CAAA;aAC9E;;;;;;;;;QACD,OAAO,MAAM,CAAA;KACd;SAAM,IAAI,eAAQ,CAAC,OAAO,CAAC,EAAE;QAC5B;;;;;;;;WAQG;QACH,IAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAA;QACrC,KAAK,IAAM,GAAG,IAAI,OAAO,EAAE;YACzB,0BAA0B;YAC1B,IAAI,OAAO,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;gBAC/B,IAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAA;gBACjC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,gDAAgD,CAAC,YAAY,CAAC,CAAC,CAAA;aAChF;SACF;QACD,OAAO,MAAM,CAAA;KACd;IAED,0BAA0B;IAC1B,OAAO,OAAO,CAAA;AAChB,CAAC;AA/CD,4GA+CC"}

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

@@ -0,0 +1,101 @@
+/**
+ * Adds the given item to the end of the list.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function append<T>(list: Array<T>, item: T): void;
+/**
+ * Extends a list by appending all items from another list.
+ *
+ * @param listA - a list to extend
+ * @param listB - a list containing items to append to `listA`
+ */
+export declare function extend<T>(listA: Array<T>, listB: Array<T>): void;
+/**
+ * Inserts the given item to the start of the list.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function prepend<T>(list: Array<T>, item: T): void;
+/**
+ * Replaces the given item or all items matching condition with a new item.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to replace or a condition matching items
+ * to replace
+ * @param item - an item
+ */
+export declare function replace<T>(list: Array<T>, conditionOrItem: T | ((item: T) => boolean), newItem: T): void;
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function insert<T>(list: Array<T>, item: T, index: number): void;
+/**
+ * Removes the given item or all items matching condition.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to remove or a condition matching items
+ * to remove
+ */
+export declare function remove<T>(list: Array<T>, conditionOrItem: T | ((item: T) => boolean)): void;
+/**
+ * Removes all items from the list.
+ */
+export declare function empty<T>(list: Array<T>): void;
+/**
+ * Determines if the list contains the given item or any items matching
+ * condition.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to a condition to match
+ */
+export declare function contains<T>(list: Array<T>, conditionOrItem: T | ((item: T) => boolean)): boolean;
+/**
+ * Returns the count of items in the list matching the given condition.
+ *
+ * @param list - a list
+ * @param condition - an optional condition to match
+ */
+export declare function size<T>(list: Array<T>, condition?: ((item: T) => boolean)): number;
+/**
+ * Determines if the list is empty.
+ *
+ * @param list - a list
+ */
+export declare function isEmpty<T>(list: Array<T>): boolean;
+/**
+ * Returns an iterator for the items of the list.
+ *
+ * @param list - a list
+ * @param condition - an optional condition to match
+ */
+export declare function forEach<T>(list: Array<T>, condition?: ((item: T) => any)): IterableIterator<T>;
+/**
+ * Creates and returns a shallow clone of list.
+ *
+ * @param list - a list
+ */
+export declare function clone<T>(list: Array<T>): Array<T>;
+/**
+ * Returns a new list containing items from the list sorted in ascending
+ * order.
+ *
+ * @param list - a list
+ * @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>(list: Array<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Array<T>;
+/**
+ * Returns a new list containing items from the list sorted in descending
+ * order.
+ *
+ * @param list - a list
+ * @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>(list: Array<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Array<T>;

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

@@ -0,0 +1,325 @@
+"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 __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 util_1 = require("@oozcitak/util");
+/**
+ * Adds the given item to the end of the list.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function append(list, item) {
+    list.push(item);
+}
+exports.append = append;
+/**
+ * Extends a list by appending all items from another list.
+ *
+ * @param listA - a list to extend
+ * @param listB - a list containing items to append to `listA`
+ */
+function extend(listA, listB) {
+    listA.push.apply(listA, __spread(listB));
+}
+exports.extend = extend;
+/**
+ * Inserts the given item to the start of the list.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function prepend(list, item) {
+    list.unshift(item);
+}
+exports.prepend = prepend;
+/**
+ * Replaces the given item or all items matching condition with a new item.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to replace or a condition matching items
+ * to replace
+ * @param item - an item
+ */
+function replace(list, conditionOrItem, newItem) {
+    var e_1, _a;
+    var i = 0;
+    try {
+        for (var list_1 = __values(list), list_1_1 = list_1.next(); !list_1_1.done; list_1_1 = list_1.next()) {
+            var oldItem = list_1_1.value;
+            if (util_1.isFunction(conditionOrItem)) {
+                if (!!conditionOrItem.call(null, oldItem)) {
+                    list[i] = newItem;
+                }
+            }
+            else if (oldItem === conditionOrItem) {
+                list[i] = newItem;
+                return;
+            }
+            i++;
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (list_1_1 && !list_1_1.done && (_a = list_1.return)) _a.call(list_1);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+}
+exports.replace = replace;
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function insert(list, item, index) {
+    list.splice(index, 0, item);
+}
+exports.insert = insert;
+/**
+ * Removes the given item or all items matching condition.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to remove or a condition matching items
+ * to remove
+ */
+function remove(list, conditionOrItem) {
+    var i = list.length;
+    while (i--) {
+        var oldItem = list[i];
+        if (util_1.isFunction(conditionOrItem)) {
+            if (!!conditionOrItem.call(null, oldItem)) {
+                list.splice(i, 1);
+            }
+        }
+        else if (oldItem === conditionOrItem) {
+            list.splice(i, 1);
+            return;
+        }
+    }
+}
+exports.remove = remove;
+/**
+ * Removes all items from the list.
+ */
+function empty(list) {
+    list.length = 0;
+}
+exports.empty = empty;
+/**
+ * Determines if the list contains the given item or any items matching
+ * condition.
+ *
+ * @param list - a list
+ * @param conditionOrItem - an item to a condition to match
+ */
+function contains(list, conditionOrItem) {
+    var e_2, _a;
+    try {
+        for (var list_2 = __values(list), list_2_1 = list_2.next(); !list_2_1.done; list_2_1 = list_2.next()) {
+            var oldItem = list_2_1.value;
+            if (util_1.isFunction(conditionOrItem)) {
+                if (!!conditionOrItem.call(null, oldItem)) {
+                    return true;
+                }
+            }
+            else if (oldItem === conditionOrItem) {
+                return true;
+            }
+        }
+    }
+    catch (e_2_1) { e_2 = { error: e_2_1 }; }
+    finally {
+        try {
+            if (list_2_1 && !list_2_1.done && (_a = list_2.return)) _a.call(list_2);
+        }
+        finally { if (e_2) throw e_2.error; }
+    }
+    return false;
+}
+exports.contains = contains;
+/**
+ * Returns the count of items in the list matching the given condition.
+ *
+ * @param list - a list
+ * @param condition - an optional condition to match
+ */
+function size(list, condition) {
+    var e_3, _a;
+    if (condition === undefined) {
+        return list.length;
+    }
+    else {
+        var count = 0;
+        try {
+            for (var list_3 = __values(list), list_3_1 = list_3.next(); !list_3_1.done; list_3_1 = list_3.next()) {
+                var item = list_3_1.value;
+                if (!!condition.call(null, item)) {
+                    count++;
+                }
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (list_3_1 && !list_3_1.done && (_a = list_3.return)) _a.call(list_3);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        return count;
+    }
+}
+exports.size = size;
+/**
+ * Determines if the list is empty.
+ *
+ * @param list - a list
+ */
+function isEmpty(list) {
+    return list.length === 0;
+}
+exports.isEmpty = isEmpty;
+/**
+ * Returns an iterator for the items of the list.
+ *
+ * @param list - a list
+ * @param condition - an optional condition to match
+ */
+function forEach(list, condition) {
+    var list_4, list_4_1, item, e_4_1;
+    var e_4, _a;
+    return __generator(this, function (_b) {
+        switch (_b.label) {
+            case 0:
+                if (!(condition === undefined)) return [3 /*break*/, 2];
+                return [5 /*yield**/, __values(list)];
+            case 1:
+                _b.sent();
+                return [3 /*break*/, 9];
+            case 2:
+                _b.trys.push([2, 7, 8, 9]);
+                list_4 = __values(list), list_4_1 = list_4.next();
+                _b.label = 3;
+            case 3:
+                if (!!list_4_1.done) return [3 /*break*/, 6];
+                item = list_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:
+                list_4_1 = list_4.next();
+                return [3 /*break*/, 3];
+            case 6: return [3 /*break*/, 9];
+            case 7:
+                e_4_1 = _b.sent();
+                e_4 = { error: e_4_1 };
+                return [3 /*break*/, 9];
+            case 8:
+                try {
+                    if (list_4_1 && !list_4_1.done && (_a = list_4.return)) _a.call(list_4);
+                }
+                finally { if (e_4) throw e_4.error; }
+                return [7 /*endfinally*/];
+            case 9: return [2 /*return*/];
+        }
+    });
+}
+exports.forEach = forEach;
+/**
+ * Creates and returns a shallow clone of list.
+ *
+ * @param list - a list
+ */
+function clone(list) {
+    return new (Array.bind.apply(Array, __spread([void 0], list)))();
+}
+exports.clone = clone;
+/**
+ * Returns a new list containing items from the list sorted in ascending
+ * order.
+ *
+ * @param list - a list
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInAscendingOrder(list, lessThanAlgo) {
+    return list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? -1 : 1;
+    });
+}
+exports.sortInAscendingOrder = sortInAscendingOrder;
+/**
+ * Returns a new list containing items from the list sorted in descending
+ * order.
+ *
+ * @param list - a list
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInDescendingOrder(list, lessThanAlgo) {
+    return list.sort(function (itemA, itemB) {
+        return lessThanAlgo.call(null, itemA, itemB) ? 1 : -1;
+    });
+}
+exports.sortInDescendingOrder = sortInDescendingOrder;
+//# sourceMappingURL=List.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"List.js","sourceRoot":"","sources":["../src/List.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,uCAA2C;AAE3C;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,IAAc,EAAE,IAAO;IAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACjB,CAAC;AAFD,wBAEC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,KAAe,EAAE,KAAe;IACxD,KAAK,CAAC,IAAI,OAAV,KAAK,WAAS,KAAK,GAAC;AACtB,CAAC;AAFD,wBAEC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAI,IAAc,EAAE,IAAO;IAChD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AACpB,CAAC;AAFD,0BAEC;AAED;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,IAAc,EAAE,eAA2C,EACpF,OAAU;;IACV,IAAI,CAAC,GAAG,CAAC,CAAA;;QACT,KAAsB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;YAAvB,IAAM,OAAO,iBAAA;YAChB,IAAI,iBAAU,CAAC,eAAe,CAAC,EAAE;gBAC/B,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;oBACzC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;iBAClB;aACF;iBAAM,IAAI,OAAO,KAAK,eAAe,EAAE;gBACtC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;gBACjB,OAAM;aACP;YACD,CAAC,EAAE,CAAA;SACJ;;;;;;;;;AACH,CAAC;AAdD,0BAcC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,IAAc,EAAE,IAAO,EAAE,KAAa;IAC9D,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;AAC7B,CAAC;AAFD,wBAEC;AAED;;;;;;GAMG;AACH,SAAgB,MAAM,CAAI,IAAc,EAAE,eAA2C;IACnF,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACnB,OAAO,CAAC,EAAE,EAAE;QACV,IAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACvB,IAAI,iBAAU,CAAC,eAAe,CAAC,EAAE;YAC/B,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;gBACzC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;aAClB;SACF;aAAM,IAAI,OAAO,KAAK,eAAe,EAAE;YACtC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACjB,OAAM;SACP;KACF;AACH,CAAC;AAbD,wBAaC;AAED;;GAEG;AACH,SAAgB,KAAK,CAAI,IAAc;IACrC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;AACjB,CAAC;AAFD,sBAEC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAI,IAAc,EAAE,eAA2C;;;QACrF,KAAsB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;YAAvB,IAAM,OAAO,iBAAA;YAChB,IAAI,iBAAU,CAAC,eAAe,CAAC,EAAE;gBAC/B,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;oBACzC,OAAO,IAAI,CAAA;iBACZ;aACF;iBAAM,IAAI,OAAO,KAAK,eAAe,EAAE;gBACtC,OAAO,IAAI,CAAA;aACZ;SACF;;;;;;;;;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAXD,4BAWC;AAED;;;;;GAKG;AACH,SAAgB,IAAI,CAAI,IAAc,EAAE,SAAkC;;IACxE,IAAI,SAAS,KAAK,SAAS,EAAE;QAC3B,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;SAAM;QACL,IAAI,KAAK,GAAG,CAAC,CAAA;;YACb,KAAmB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;gBAApB,IAAM,IAAI,iBAAA;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,IAAc;IACvC,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAA;AAC1B,CAAC;AAFD,0BAEC;AAED;;;;;GAKG;AACH,SAAiB,OAAO,CAAI,IAAc,EAAE,SAA8B;;;;;;qBACpE,CAAA,SAAS,KAAK,SAAS,CAAA,EAAvB,wBAAuB;gBACzB,sBAAA,SAAO,IAAI,CAAA,EAAA;;gBAAX,SAAW,CAAA;;;;gBAEQ,SAAA,SAAA,IAAI,CAAA;;;;gBAAZ,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,IAAc;IACrC,YAAW,KAAK,YAAL,KAAK,qBAAO,IAAI,MAAC;AAC9B,CAAC;AAFD,sBAEC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAI,IAAc,EACpD,YAA+C;IAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,UAAC,KAAQ,EAAE,KAAQ;QAClC,OAAA,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAA9C,CAA8C,CAAC,CAAA;AACnD,CAAC;AAJD,oDAIC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CAAI,IAAc,EACrD,YAA+C;IAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,UAAC,KAAQ,EAAE,KAAQ;QAClC,OAAA,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAA9C,CAA8C,CAAC,CAAA;AACnD,CAAC;AAJD,sDAIC"}

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

@@ -0,0 +1,87 @@
+/**
+ * Gets the value corresponding to the given key.
+ *
+ * @param map - a map
+ * @param key - a key
+ */
+export declare function get<K, V>(map: Map<K, V>, key: K): V | undefined;
+/**
+ * Sets the value corresponding to the given key.
+ *
+ * @param map - a map
+ * @param key - a key
+ * @param val - a value
+ */
+export declare function set<K, V>(map: Map<K, V>, key: K, val: V): void;
+/**
+ * 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
+ */
+export declare function remove<K, V>(map: Map<K, V>, conditionOrItem: K | ((item: [K, V]) => boolean)): void;
+/**
+ * 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
+ */
+export declare function contains<K, V>(map: Map<K, V>, conditionOrItem: K | ((item: [K, V]) => boolean)): boolean;
+/**
+ * Gets the keys of the map.
+ *
+ * @param map - a map
+ */
+export declare function keys<K, V>(map: Map<K, V>): Set<K>;
+/**
+ * Gets the values of the map.
+ *
+ * @param map - a map
+ */
+export declare function values<K, V>(map: Map<K, V>): V[];
+/**
+ * Gets the size of the map.
+ *
+ * @param map - a map
+ * @param condition - an optional condition to match
+ */
+export declare function size<K, V>(map: Map<K, V>, condition?: ((item: [K, V]) => boolean)): number;
+/**
+ * Determines if the map is empty.
+ *
+ * @param map - a map
+ */
+export declare function isEmpty<K, V>(map: Map<K, V>): boolean;
+/**
+ * Returns an iterator for the items of the map.
+ *
+ * @param map - a map
+ * @param condition - an optional condition to match
+ */
+export declare function forEach<K, V>(map: Map<K, V>, condition?: ((item: [K, V]) => boolean)): IterableIterator<[K, V]>;
+/**
+ * Creates and returns a shallow clone of map.
+ *
+ * @param map - a map
+ */
+export declare function clone<K, V>(map: Map<K, V>): Map<K, V>;
+/**
+ * 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.
+ */
+export declare function sortInAscendingOrder<K, V>(map: Map<K, V>, lessThanAlgo: ((itemA: [K, V], itemB: [K, V]) => boolean)): Map<K, V>;
+/**
+ * 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.
+ */
+export declare function sortInDescendingOrder<K, V>(map: Map<K, V>, lessThanAlgo: ((itemA: [K, V], itemB: [K, V]) => boolean)): Map<K, V>;