@dereekb/util 0.0.1

package/src/lib/relation/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/relation/index.ts"],"names":[],"mappings":";;;AAAA,0DAA2B"}

package/src/lib/relation/relation.d.ts

@@ -0,0 +1,95 @@
+export declare enum RelationChange {
+    /**
+     * Adds a model to the relation. If the model already exists in
+     * the relation, the new one is used.
+     *
+     * Use INSERT to merge the two values together.
+     */
+    ADD = "add",
+    /**
+     * Sets the relation to be equal to the input.
+     */
+    SET = "set",
+    /**
+     * Variation of SET that performs REMOVE on the collection, and then follows it up with INSERT.
+     *
+     * This can allow the modification function to behave selectively with the items targeted for removal.
+     */
+    REMOVE_AND_INSERT = "remove_and_insert",
+    /**
+     * Removes a model from the relation.
+     */
+    REMOVE = "remove",
+    /**
+     * Updates an existing relation, if it exists.
+     * The existing object is merged with the update object.
+     */
+    UPDATE = "update",
+    /**
+     * Updates an existing relation, if it exists, or creates a new one.
+     */
+    INSERT = "insert"
+}
+export declare type RelationString = string;
+export declare type RelationObject = RelationString | object;
+export declare type RelationModelType = string;
+export declare type RelationKey = string;
+export declare type ReadRelationKeyFn<T> = (model: T) => RelationKey;
+export declare type ReadRelationModelTypeFn<T> = (model: T) => RelationModelType;
+/**
+ * Merges the two input values. The "a" value is usually the existing/incumbent value, while "b" is the new value.
+ */
+export declare type MergeRelationObjectsFn<T> = (a: T, b: T) => T;
+/**
+ * Whether or not the object is changable as part of this request.
+ */
+export declare type ChangeRelationObjectsMaskFn<T> = (x: T) => boolean;
+export interface UpdateRelationConfig<T> {
+    readKey: ReadRelationKeyFn<T>;
+    merge: MergeRelationObjectsFn<T>;
+    /**
+     * Whether or not an item should be removed when remove is called.
+     */
+    shouldRemove?: (x: T) => boolean;
+    /**
+     * Whether or not the item should be considered when performing a change.
+     *
+     * For instance, existing items that are passed to this function and it returns false are unable to be changed,
+     * and new/target items that are passed to this function and it returns false are ignored.
+     */
+    mask?: ChangeRelationObjectsMaskFn<T>;
+}
+export interface UpdateMiltiTypeRelationConfig<T> extends UpdateRelationConfig<T> {
+    readType: ReadRelationModelTypeFn<T>;
+}
+/**
+ * Utility class for modifying a collection of relational objects.
+ *
+ * For instance, a string collection of keys.
+ */
+export declare class ModelRelationUtility {
+    static modifyStringCollection(current: RelationString[], change: RelationChange, mods: RelationString[]): RelationString[];
+    static modifyCollection<T extends RelationObject>(current: T[], change: RelationChange, mods: T[], config: UpdateRelationConfig<T>): T[];
+    static modifyCollection<T extends RelationObject>(current: T[], change: RelationChange, mods: T[], config: UpdateMiltiTypeRelationConfig<T>): T[];
+    /**
+     * The mask results are merged together.
+     *
+     * Order from the "current" is retained. Anything in currentRetain overrides modifiedResults.
+     */
+    private static _mergeMaskResults;
+    private static _modifyCollectionWithoutMask;
+    static updateCollection<T extends RelationObject>(current: T[], update: T[], { readKey, readType, merge }: UpdateMiltiTypeRelationConfig<T>): T[];
+    static insertCollection<T extends RelationObject>(current: T[], update: T[], { readKey, readType, merge }: UpdateMiltiTypeRelationConfig<T>): T[];
+    /**
+     * Used to modify a collection which may be multi-type. If readType is provided, the collection is handled as a multi-type map.
+     */
+    private static _modifyCollection;
+    private static _modifyMultiTypeCollection;
+    private static _insertSingleTypeCollection;
+    private static _updateSingleTypeCollection;
+    static addToCollection<T extends RelationObject>(current: T[], add: T[], readKey: ReadRelationKeyFn<T>): T[];
+    static removeFromCollection<T extends RelationObject>(current: T[], remove: T[], readKey: ReadRelationKeyFn<T>, shouldRemove?: (x: T) => boolean): T[];
+    static removeKeysFromCollection<T extends RelationObject>(current: T[], keysToRemove: string[], readKey: ReadRelationKeyFn<T>): T[];
+    static removeDuplicates<T>(relations: T[], readKey: ReadRelationKeyFn<T>, additionalKeys?: string[]): T[];
+    private static _assertMergeProvided;
+}

package/src/lib/relation/relation.js

@@ -0,0 +1,209 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ModelRelationUtility = exports.RelationChange = void 0;
+const array_1 = require("../array");
+const grouping_1 = require("../grouping");
+var RelationChange;
+(function (RelationChange) {
+    /**
+     * Adds a model to the relation. If the model already exists in
+     * the relation, the new one is used.
+     *
+     * Use INSERT to merge the two values together.
+     */
+    RelationChange["ADD"] = "add";
+    /**
+     * Sets the relation to be equal to the input.
+     */
+    RelationChange["SET"] = "set";
+    /**
+     * Variation of SET that performs REMOVE on the collection, and then follows it up with INSERT.
+     *
+     * This can allow the modification function to behave selectively with the items targeted for removal.
+     */
+    RelationChange["REMOVE_AND_INSERT"] = "remove_and_insert";
+    /**
+     * Removes a model from the relation.
+     */
+    RelationChange["REMOVE"] = "remove";
+    /**
+     * Updates an existing relation, if it exists.
+     * The existing object is merged with the update object.
+     */
+    RelationChange["UPDATE"] = "update";
+    /**
+     * Updates an existing relation, if it exists, or creates a new one.
+     */
+    RelationChange["INSERT"] = "insert";
+})(RelationChange = exports.RelationChange || (exports.RelationChange = {}));
+;
+/**
+ * Utility class for modifying a collection of relational objects.
+ *
+ * For instance, a string collection of keys.
+ */
+class ModelRelationUtility {
+    static modifyStringCollection(current, change, mods) {
+        return ModelRelationUtility.modifyCollection(current, change, mods, { readKey: (x) => x, merge: (a, b) => b });
+    }
+    static modifyCollection(current, change, mods, config) {
+        const { mask, readKey } = config;
+        if (mask) {
+            const { included: currentModify, excluded: currentRetain } = (0, grouping_1.separateValues)(current, mask);
+            const { included: modModify } = (0, grouping_1.separateValues)(mods, mask);
+            const modifiedResults = this._modifyCollectionWithoutMask(currentModify, change, modModify, config);
+            return this._mergeMaskResults(current, currentRetain, modifiedResults, readKey);
+        }
+        else {
+            return this._modifyCollectionWithoutMask(current, change, mods, config);
+        }
+    }
+    /**
+     * The mask results are merged together.
+     *
+     * Order from the "current" is retained. Anything in currentRetain overrides modifiedResults.
+     */
+    static _mergeMaskResults(current, currentRetain, modifiedResults, readKey) {
+        return (0, grouping_1.restoreOrderWithValues)(current, [...currentRetain, ...modifiedResults], { readKey });
+    }
+    static _modifyCollectionWithoutMask(current, change, mods, config) {
+        const { readKey, merge, shouldRemove } = config;
+        const readType = config.readType;
+        function remove(rCurrent = current, rMods = mods) {
+            return ModelRelationUtility._modifyCollection(rCurrent, rMods, (x, y) => {
+                return ModelRelationUtility.removeFromCollection(x, y, readKey, shouldRemove);
+            }, readType);
+        }
+        function performAdd() {
+            return ModelRelationUtility._modifyCollection(current, mods, (x, y) => ModelRelationUtility.addToCollection(x, y, readKey), readType);
+        }
+        function performInsert() {
+            return ModelRelationUtility.insertCollection(current, mods, { readKey, readType, merge });
+        }
+        switch (change) {
+            case RelationChange.SET:
+                current = []; // Set current before performing add.
+                return performAdd();
+            case RelationChange.ADD:
+                return performAdd();
+            case RelationChange.REMOVE:
+                return remove();
+            case RelationChange.UPDATE:
+                return ModelRelationUtility.updateCollection(current, mods, { readKey, readType, merge });
+            case RelationChange.REMOVE_AND_INSERT:
+                current = remove(current, current); // Remove all current values before performing an insert.
+                return performInsert();
+            case RelationChange.INSERT:
+                return performInsert();
+        }
+    }
+    static updateCollection(current, update, { readKey, readType, merge }) {
+        ModelRelationUtility._assertMergeProvided(merge);
+        return ModelRelationUtility._modifyCollection(current, update, (x, y) => ModelRelationUtility._updateSingleTypeCollection(x, y, { readKey, merge }), readType);
+    }
+    static insertCollection(current, update, { readKey, readType, merge }) {
+        ModelRelationUtility._assertMergeProvided(merge);
+        return ModelRelationUtility._modifyCollection(current, update, (x, y) => ModelRelationUtility._insertSingleTypeCollection(x, y, { readKey, merge }), readType);
+    }
+    /**
+     * Used to modify a collection which may be multi-type. If readType is provided, the collection is handled as a multi-type map.
+     */
+    static _modifyCollection(current, mods, modifyCollection, readType) {
+        if (readType) {
+            return ModelRelationUtility._modifyMultiTypeCollection(current, mods, readType, modifyCollection);
+        }
+        else {
+            return modifyCollection(current, mods);
+        }
+    }
+    static _modifyMultiTypeCollection(input, mods, readType, modifyCollection) {
+        const inputMap = (0, grouping_1.makeValuesGroupMap)(input, readType);
+        const modsMap = (0, grouping_1.makeValuesGroupMap)(mods, readType);
+        const typesModified = new Set([...inputMap.keys(), ...modsMap.keys()]);
+        // Break the collections up into their individual types and process separately.
+        const modifiedSubCollections = Array.from(typesModified).map((type) => {
+            var _a, _b;
+            const values = (_a = inputMap.get(type)) !== null && _a !== void 0 ? _a : [];
+            const mods = (_b = modsMap.get(type)) !== null && _b !== void 0 ? _b : [];
+            // Only modify if they've got changes for their type.
+            if (mods.length === 0) {
+                return values; // No mods, no change to those types.
+            }
+            else {
+                return modifyCollection(values, mods);
+            }
+        });
+        // Rejoin all changes.
+        return modifiedSubCollections.reduce((x, y) => x.concat(y), []);
+    }
+    static _insertSingleTypeCollection(current, insert, { readKey, merge }) {
+        const currentKeys = (0, array_1.arrayToMap)(current, readKey);
+        const updateValues = [];
+        const addValues = [];
+        insert.forEach((value) => {
+            const key = readKey(value);
+            if (currentKeys.has(key)) {
+                updateValues.push(value);
+            }
+            else {
+                addValues.push(value);
+            }
+        });
+        const added = ModelRelationUtility.addToCollection(current, addValues, readKey);
+        const results = ModelRelationUtility._updateSingleTypeCollection(added, updateValues, { readKey, merge });
+        return results;
+    }
+    static _updateSingleTypeCollection(current, update, { readKey, merge }) {
+        const keysToUpdate = (0, array_1.arrayToMap)(update, readKey);
+        const updateValues = [];
+        current.forEach((value) => {
+            const key = readKey(value);
+            const mergeWith = keysToUpdate.get(key);
+            if (mergeWith != null) {
+                updateValues.push(merge(value, mergeWith));
+            }
+        });
+        // Add to merge all values and remove duplicates.
+        return ModelRelationUtility.addToCollection(current, updateValues, readKey);
+    }
+    static addToCollection(current, add, readKey) {
+        current = current !== null && current !== void 0 ? current : [];
+        return (add === null || add === void 0 ? void 0 : add.length) ? ModelRelationUtility.removeDuplicates([...add, ...current], readKey) : current; // Will keep any "added" before any existing ones.
+    }
+    static removeFromCollection(current, remove, readKey, shouldRemove) {
+        if (current === null || current === void 0 ? void 0 : current.length) {
+            if (shouldRemove) {
+                const currentKeyPairs = (0, grouping_1.makeKeyPairs)(current, readKey);
+                const map = new Map(currentKeyPairs);
+                remove.forEach((x) => {
+                    const key = readKey(x);
+                    const removalTarget = map.get(key);
+                    if (removalTarget && shouldRemove(removalTarget)) {
+                        map.delete(key); // Remove from the map.
+                    }
+                });
+                return currentKeyPairs.filter(x => map.has(x[0])).map(x => x[1]); // Retain order, remove from map.
+            }
+            else {
+                return ModelRelationUtility.removeKeysFromCollection(current, remove.map(readKey), readKey);
+            }
+        }
+        else {
+            return [];
+        }
+    }
+    static removeKeysFromCollection(current, keysToRemove, readKey) {
+        return ModelRelationUtility.removeDuplicates(current, readKey, keysToRemove);
+    }
+    static removeDuplicates(relations, readKey, additionalKeys = []) {
+        return (0, array_1.findUnique)(relations, readKey, additionalKeys);
+    }
+    // MARK: Internal Utility
+    static _assertMergeProvided(merge) {
+        if (!merge) {
+            throw new Error('Merge was not provided.');
+        }
+    }
+}
+exports.ModelRelationUtility = ModelRelationUtility;
+//# sourceMappingURL=relation.js.map

package/src/lib/relation/relation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/relation/relation.ts"],"names":[],"mappings":";;;AAAA,oCAAkD;AAClD,0CAAuG;AAGvG,IAAY,cA+BX;AA/BD,WAAY,cAAc;IACxB;;;;;OAKG;IACH,6BAAW,CAAA;IACX;;OAEG;IACH,6BAAW,CAAA;IACX;;;;OAIG;IACH,yDAAuC,CAAA;IACvC;;OAEG;IACH,mCAAiB,CAAA;IACjB;;;OAGG;IACH,mCAAiB,CAAA;IACjB;;OAEG;IACH,mCAAiB,CAAA;AACnB,CAAC,EA/BW,cAAc,GAAd,sBAAc,KAAd,sBAAc,QA+BzB;AAAA,CAAC;AAwCF;;;;GAIG;AACH,MAAa,oBAAoB;IAE/B,MAAM,CAAC,sBAAsB,CAAC,OAAyB,EAAE,MAAsB,EAAE,IAAsB;QACrG,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACjH,CAAC;IAID,MAAM,CAAC,gBAAgB,CAA2B,OAAY,EAAE,MAAsB,EAAE,IAAS,EAAE,MAAkE;QACnK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;QAEjC,IAAI,IAAI,EAAE;YACR,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,IAAA,yBAAc,EAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3F,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAA,yBAAc,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAE3D,MAAM,eAAe,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAGpG,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;SACjF;aAAM;YACL,OAAO,IAAI,CAAC,4BAA4B,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;SACzE;IACH,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,iBAAiB,CAA2B,OAAY,EAAE,aAAkB,EAAE,eAAoB,EAAE,OAA6B;QAC9I,OAAO,IAAA,iCAAsB,EAAC,OAAO,EAAE,CAAC,GAAG,aAAa,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9F,CAAC;IAEO,MAAM,CAAC,4BAA4B,CAA2B,OAAY,EAAE,MAAsB,EAAE,IAAS,EAAE,MAAkE;QACvL,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;QAEhD,MAAM,QAAQ,GAAI,MAA2C,CAAC,QAAQ,CAAC;QAEvE,SAAS,MAAM,CAAC,QAAQ,GAAG,OAAO,EAAE,KAAK,GAAG,IAAI;YAC9C,OAAO,oBAAoB,CAAC,iBAAiB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE;gBAChF,OAAO,oBAAoB,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;YAChF,CAAC,EAAE,QAAQ,CAAC,CAAC;QACf,CAAC;QAED,SAAS,UAAU;YACjB,OAAO,oBAAoB,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACxI,CAAC;QAED,SAAS,aAAa;YACpB,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5F,CAAC;QAED,QAAQ,MAAM,EAAE;YACd,KAAK,cAAc,CAAC,GAAG;gBACrB,OAAO,GAAG,EAAE,CAAC,CAAC,qCAAqC;gBACnD,OAAO,UAAU,EAAE,CAAC;YACtB,KAAK,cAAc,CAAC,GAAG;gBACrB,OAAO,UAAU,EAAE,CAAC;YACtB,KAAK,cAAc,CAAC,MAAM;gBACxB,OAAO,MAAM,EAAE,CAAC;YAClB,KAAK,cAAc,CAAC,MAAM;gBACxB,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAC5F,KAAK,cAAc,CAAC,iBAAiB;gBACnC,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,yDAAyD;gBAC7F,OAAO,aAAa,EAAE,CAAC;YACzB,KAAK,cAAc,CAAC,MAAM;gBACxB,OAAO,aAAa,EAAE,CAAC;SAC1B;IACH,CAAC;IAED,MAAM,CAAC,gBAAgB,CAA2B,OAAY,EAAE,MAAW,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAoC;QACzI,oBAAoB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,oBAAoB,CAAC,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjK,CAAC;IAED,MAAM,CAAC,gBAAgB,CAA2B,OAAY,EAAE,MAAW,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAoC;QACzI,oBAAoB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,oBAAoB,CAAC,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjK,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,iBAAiB,CAA2B,OAAY,EAAE,IAAS,EAAE,gBAAwD,EAAE,QAAqC;QACjL,IAAI,QAAQ,EAAE;YACZ,OAAO,oBAAoB,CAAC,0BAA0B,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;SACnG;aAAM;YACL,OAAO,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;SACxC;IACH,CAAC;IAEO,MAAM,CAAC,0BAA0B,CAA2B,KAAU,EAAE,IAAS,EAAE,QAAoC,EAAE,gBAAwD;QACvL,MAAM,QAAQ,GAAG,IAAA,6BAAkB,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACrD,MAAM,OAAO,GAAG,IAAA,6BAAkB,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAEnD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAgB,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEtF,+EAA+E;QAC/E,MAAM,sBAAsB,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;;YACpE,MAAM,MAAM,GAAG,MAAA,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,EAAE,CAAC;YAErC,qDAAqD;YACrD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACrB,OAAO,MAAM,CAAC,CAAE,qCAAqC;aACtD;iBAAM;gBACL,OAAO,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;aACvC;QACH,CAAC,CAAC,CAAC;QAEH,sBAAsB;QACtB,OAAO,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC;IAEO,MAAM,CAAC,2BAA2B,CAA2B,OAAY,EAAE,MAAW,EAAE,EAAE,OAAO,EAAE,KAAK,EAA2B;QACzI,MAAM,WAAW,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,YAAY,GAAQ,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAQ,EAAE,CAAC;QAE1B,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACvB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAE3B,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBACxB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC1B;iBAAM;gBACL,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACvB;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,oBAAoB,CAAC,eAAe,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAChF,MAAM,OAAO,GAAG,oBAAoB,CAAC,2BAA2B,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1G,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,MAAM,CAAC,2BAA2B,CAA2B,OAAY,EAAE,MAAW,EAAE,EAAE,OAAO,EAAE,KAAK,EAA2B;QACzI,MAAM,YAAY,GAAG,IAAA,kBAAU,EAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,YAAY,GAAQ,EAAE,CAAC;QAE7B,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACxB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAExC,IAAI,SAAS,IAAI,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;aAC5C;QACH,CAAC,CAAC,CAAC;QAEH,iDAAiD;QACjD,OAAO,oBAAoB,CAAC,eAAe,CAAC,OAAO,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,CAAC,eAAe,CAA2B,OAAY,EAAE,GAAQ,EAAE,OAA6B;QACpG,OAAO,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,EAAE,CAAC;QACxB,OAAO,CAAC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,gBAAgB,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAE,kDAAkD;IAC5J,CAAC;IAED,MAAM,CAAC,oBAAoB,CAA2B,OAAY,EAAE,MAAW,EAAE,OAA6B,EAAE,YAAgC;QAC9I,IAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,EAAE;YACnB,IAAI,YAAY,EAAE;gBAChB,MAAM,eAAe,GAAG,IAAA,uBAAY,EAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACvD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;gBAErC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oBACnB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;oBACvB,MAAM,aAAa,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAEnC,IAAI,aAAa,IAAI,YAAY,CAAC,aAAa,CAAC,EAAE;wBAChD,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,uBAAuB;qBAC1C;gBACH,CAAC,CAAC,CAAC;gBAEH,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;aACpG;iBAAM;gBACL,OAAO,oBAAoB,CAAC,wBAAwB,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAA;aAC5F;SACF;aAAM;YACL,OAAO,EAAE,CAAC;SACX;IACH,CAAC;IAED,MAAM,CAAC,wBAAwB,CAA2B,OAAY,EAAE,YAAsB,EAAE,OAA6B;QAC3H,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;IAC/E,CAAC;IAED,MAAM,CAAC,gBAAgB,CAAI,SAAc,EAAE,OAA6B,EAAE,iBAA2B,EAAE;QACrG,OAAO,IAAA,kBAAU,EAAC,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;IACxD,CAAC;IAED,yBAAyB;IACjB,MAAM,CAAC,oBAAoB,CAAC,KAAkC;QACpE,IAAI,CAAC,KAAK,EAAE;YACV,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;SAC5C;IACH,CAAC;CAEF;AAnMD,oDAmMC"}

package/src/lib/set.hashset.d.ts

@@ -0,0 +1,28 @@
+import { PrimativeKey, ReadKeyFunction } from "./key";
+import { Maybe } from "./value";
+export interface HashSetConfig<K extends PrimativeKey, T> {
+    readKey: ReadKeyFunction<T, K>;
+}
+/**
+ * Set that is implemented internally using a Map, and input values have their keys read.
+ *
+ * Useful for cases, such as Date, that are unique by a value, but not self.
+ */
+export declare class HashSet<K extends PrimativeKey, T> implements Set<T> {
+    readonly config: HashSetConfig<K, T>;
+    private _map;
+    constructor(config: HashSetConfig<K, T>, values?: T[]);
+    get size(): number;
+    [Symbol.iterator](): IterableIterator<T>;
+    addAll(values: Maybe<T[]>): this;
+    add(value: T): this;
+    clear(): void;
+    delete(value: T): boolean;
+    has(value: T): boolean;
+    forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void;
+    entries(): IterableIterator<[T, T]>;
+    keys(): IterableIterator<T>;
+    values(): IterableIterator<T>;
+    valuesArray(): T[];
+    get [Symbol.toStringTag](): string;
+}

package/src/lib/set.hashset.js

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HashSet = void 0;
+/**
+ * Set that is implemented internally using a Map, and input values have their keys read.
+ *
+ * Useful for cases, such as Date, that are unique by a value, but not self.
+ */
+class HashSet {
+    constructor(config, values) {
+        this.config = config;
+        this._map = new Map();
+        if (values) {
+            values.forEach(x => this.add(x));
+        }
+    }
+    get size() {
+        return this._map.size;
+    }
+    [Symbol.iterator]() {
+        return this._map.values();
+    }
+    addAll(values) {
+        values === null || values === void 0 ? void 0 : values.forEach(x => this.add(x));
+        return this;
+    }
+    add(value) {
+        const key = this.config.readKey(value);
+        this._map.set(key, value);
+        return this;
+    }
+    clear() {
+        this._map.clear();
+    }
+    delete(value) {
+        const key = this.config.readKey(value);
+        return this._map.delete(key);
+    }
+    has(value) {
+        const key = this.config.readKey(value);
+        return this._map.has(key);
+    }
+    forEach(callbackfn, thisArg) {
+        return this._map.forEach((value, key) => {
+            callbackfn.apply(thisArg, [value, value, this]);
+        });
+    }
+    entries() {
+        const result = this.valuesArray();
+        return result.map(x => [x, x]).values();
+    }
+    keys() {
+        return this.values();
+    }
+    values() {
+        return this._map.values();
+    }
+    valuesArray() {
+        return Array.from(this._map.values());
+    }
+    get [Symbol.toStringTag]() {
+        return this.valuesArray.toString();
+    }
+}
+exports.HashSet = HashSet;
+//# sourceMappingURL=set.hashset.js.map

package/src/lib/set.hashset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set.hashset.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/set.hashset.ts"],"names":[],"mappings":";;;AAOA;;;;GAIG;AACH,MAAa,OAAO;IAIlB,YAAqB,MAA2B,EAAE,MAAY;QAAzC,WAAM,GAAN,MAAM,CAAqB;QAFxC,SAAI,GAAG,IAAI,GAAG,EAAe,CAAC;QAGpC,IAAI,MAAM,EAAE;YACV,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,MAAkB;QACvB,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,UAAsD,EAAE,OAAa;QAC3E,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YACtC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAClC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAW,CAAC,CAAC,MAAM,EAAE,CAAC;IACpD,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;IACvB,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC;CAEF;AAtED,0BAsEC"}

package/src/lib/set.js

@@ -0,0 +1,2 @@
+"use strict";
+//# sourceMappingURL=set.js.map

package/src/lib/set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/set.ts"],"names":[],"mappings":""}

package/src/lib/sort.d.ts

@@ -0,0 +1,45 @@
+export declare enum SortingOrder {
+    ASCENDING = "asc",
+    DESCENDING = "desc"
+}
+export declare const SORT_VALUE_LESS_THAN: SortComparisonNumber;
+export declare const SORT_VALUE_GREATER_THAN: SortComparisonNumber;
+export declare const SORT_VALUE_EQUAL: SortComparisonNumber;
+/**
+ * A number that is the result of comparison two items.
+ *
+ * In "ascending" order, a value:
+ * - smaller than another will return -1 (or less).
+ * - equal to another will return 0
+ * - greater than another will return 1 (or more).
+ *
+ * In "descending" order, this returns the opposite values as "ascending".
+ */
+export declare type SortComparisonNumber = number;
+/**
+ * A comparison function that returns a SortComparisonNumber.
+ */
+export declare type SortCompareFunction<T> = (a: T, b: T) => SortComparisonNumber;
+/**
+ * Comparison function that sorts in ascending order.
+ *
+ * This is the logical normal return order, where if an item is less than another, it should return SORT_VALUE_LESS_THAN (-1), etc.
+ */
+export declare type AscendingSortCompareFunction<T> = SortCompareFunction<T>;
+/**
+ * Comparison function that sorts in descending order.
+ *
+ * This is the logical normal return order, where if an item is less than another, it should return SORT_VALUE_LESS_THAN (-1), etc.
+ */
+export declare type SortDescendingCompareFunction<T> = SortCompareFunction<T>;
+/**
+ * Convenience function that reverses the order of the sorted values.
+ */
+export declare function reverseCompareFn<T>(compareFn: AscendingSortCompareFunction<T>): SortDescendingCompareFunction<T>;
+export declare function reverseCompareFn<T>(compareFn: SortDescendingCompareFunction<T>): AscendingSortCompareFunction<T>;
+/**
+ * Convenience function that reverses the order of the sorted values if the order is specified descending.
+ *
+ * The input comparison function must be in ascending order.
+ */
+export declare function compareFnOrder<T>(ascendingCompareFn: AscendingSortCompareFunction<T>, order?: SortingOrder): SortCompareFunction<T>;

package/src/lib/sort.js

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compareFnOrder = exports.reverseCompareFn = exports.SORT_VALUE_EQUAL = exports.SORT_VALUE_GREATER_THAN = exports.SORT_VALUE_LESS_THAN = exports.SortingOrder = void 0;
+var SortingOrder;
+(function (SortingOrder) {
+    SortingOrder["ASCENDING"] = "asc";
+    SortingOrder["DESCENDING"] = "desc";
+})(SortingOrder = exports.SortingOrder || (exports.SortingOrder = {}));
+exports.SORT_VALUE_LESS_THAN = -1;
+exports.SORT_VALUE_GREATER_THAN = 1;
+exports.SORT_VALUE_EQUAL = 0;
+function reverseCompareFn(compareFn) {
+    return (a, b) => compareFn(a, b) * -1;
+}
+exports.reverseCompareFn = reverseCompareFn;
+/**
+ * Convenience function that reverses the order of the sorted values if the order is specified descending.
+ *
+ * The input comparison function must be in ascending order.
+ */
+function compareFnOrder(ascendingCompareFn, order = SortingOrder.ASCENDING) {
+    return (order === SortingOrder.ASCENDING) ? ascendingCompareFn : reverseCompareFn(ascendingCompareFn);
+}
+exports.compareFnOrder = compareFnOrder;
+//# sourceMappingURL=sort.js.map

package/src/lib/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/sort.ts"],"names":[],"mappings":";;;AACA,IAAY,YAGX;AAHD,WAAY,YAAY;IACtB,iCAAiB,CAAA;IACjB,mCAAmB,CAAA;AACrB,CAAC,EAHW,YAAY,GAAZ,oBAAY,KAAZ,oBAAY,QAGvB;AAEY,QAAA,oBAAoB,GAAyB,CAAC,CAAC,CAAC;AAChD,QAAA,uBAAuB,GAAyB,CAAC,CAAC;AAClD,QAAA,gBAAgB,GAAyB,CAAC,CAAC;AAsCxD,SAAgB,gBAAgB,CAAI,SAAiC;IACnE,OAAO,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9C,CAAC;AAFD,4CAEC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAI,kBAAmD,EAAE,QAAsB,YAAY,CAAC,SAAS;IACjI,OAAO,CAAC,KAAK,KAAK,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;AACxG,CAAC;AAFD,wCAEC"}

package/src/lib/storage/index.d.ts

@@ -0,0 +1,4 @@
+export * from './storage';
+export * from './storage.error';
+export * from './storage.memory';
+export * from './storage.object';

package/src/lib/storage/index.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+(0, tslib_1.__exportStar)(require("./storage"), exports);
+(0, tslib_1.__exportStar)(require("./storage.error"), exports);
+(0, tslib_1.__exportStar)(require("./storage.memory"), exports);
+(0, tslib_1.__exportStar)(require("./storage.object"), exports);
+//# sourceMappingURL=index.js.map

package/src/lib/storage/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/storage/index.ts"],"names":[],"mappings":";;;AAAA,yDAA0B;AAC1B,+DAAgC;AAChC,gEAAiC;AACjC,gEAAiC"}

package/src/lib/storage/storage.d.ts

@@ -0,0 +1,11 @@
+import { UnixDateTimeNumber } from '@dereekb/util';
+export declare type StoredDataString = string;
+export declare type StoredDataStorageKey = string;
+export interface StoredData {
+    storedAt: UnixDateTimeNumber | undefined;
+    data: StoredDataString;
+}
+export interface ReadStoredData<T> extends StoredData {
+    expired: boolean;
+    convertedData: T;
+}

package/src/lib/storage/storage.error.d.ts

@@ -0,0 +1,12 @@
+import { BaseError } from 'make-error';
+import { ReadStoredData } from './storage';
+export declare class StoredDataError extends BaseError {
+    constructor(message?: string);
+}
+export declare class DataDoesNotExistError extends StoredDataError {
+    constructor(message?: string);
+}
+export declare class DataIsExpiredError<T> extends StoredDataError {
+    readonly data: ReadStoredData<T>;
+    constructor(data: ReadStoredData<T>, message?: string);
+}

package/src/lib/storage/storage.error.js

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DataIsExpiredError = exports.DataDoesNotExistError = exports.StoredDataError = void 0;
+const make_error_1 = require("make-error");
+class StoredDataError extends make_error_1.BaseError {
+    constructor(message) { super(message); }
+}
+exports.StoredDataError = StoredDataError;
+class DataDoesNotExistError extends StoredDataError {
+    constructor(message) { super(message); }
+}
+exports.DataDoesNotExistError = DataDoesNotExistError;
+class DataIsExpiredError extends StoredDataError {
+    constructor(data, message) {
+        super(message);
+        this.data = data;
+    }
+}
+exports.DataIsExpiredError = DataIsExpiredError;
+//# sourceMappingURL=storage.error.js.map

package/src/lib/storage/storage.error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage.error.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/storage/storage.error.ts"],"names":[],"mappings":";;;AAAA,2CAAuC;AAGvC,MAAa,eAAgB,SAAQ,sBAAS;IAE5C,YAAY,OAAgB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CAElD;AAJD,0CAIC;AAED,MAAa,qBAAsB,SAAQ,eAAe;IAExD,YAAY,OAAgB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CAElD;AAJD,sDAIC;AAED,MAAa,kBAAsB,SAAQ,eAAe;IAExD,YAA4B,IAAuB,EAAE,OAAgB;QAAI,KAAK,CAAC,OAAO,CAAC,CAAC;QAA5D,SAAI,GAAJ,IAAI,CAAmB;IAAsC,CAAC;CAE3F;AAJD,gDAIC"}

package/src/lib/storage/storage.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=storage.js.map

package/src/lib/storage/storage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/storage/storage.ts"],"names":[],"mappings":""}

package/src/lib/storage/storage.memory.d.ts

@@ -0,0 +1,14 @@
+import { Maybe } from "../value";
+import { StorageObject } from "./storage.object";
+export declare class MemoryStorageInstance implements StorageObject {
+    private _length;
+    private _storage;
+    get length(): number;
+    key(index: number): string;
+    hasKey(key: string): boolean;
+    getItem(key: string): Maybe<string>;
+    setItem(key: string, item: Maybe<string>): void;
+    removeItem(key: string): void;
+    clear(): void;
+}
+export declare const SHARED_MEMORY_STORAGE: MemoryStorageInstance;

package/src/lib/storage/storage.memory.js

@@ -0,0 +1,47 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SHARED_MEMORY_STORAGE = exports.MemoryStorageInstance = void 0;
+class MemoryStorageInstance {
+    constructor() {
+        this._length = 0;
+        this._storage = {};
+    }
+    get length() {
+        return this._length;
+    }
+    key(index) {
+        var _a;
+        return (_a = Object.keys(this._storage)[index]) !== null && _a !== void 0 ? _a : null;
+    }
+    hasKey(key) {
+        return this._storage.hasOwnProperty(key);
+    }
+    getItem(key) {
+        var _a;
+        return (_a = this._storage[key]) !== null && _a !== void 0 ? _a : null;
+    }
+    setItem(key, item) {
+        if (item == null) {
+            this.removeItem(key);
+        }
+        else {
+            if (!this.hasKey(key)) {
+                this._length = this._length + 1;
+            }
+            this._storage[key] = String(item);
+        }
+    }
+    removeItem(key) {
+        if (this.hasKey(key)) {
+            delete this._storage[key]; // Remove the property
+            this._length = this._length - 1;
+        }
+    }
+    clear() {
+        this._storage = {};
+        this._length = 0;
+    }
+}
+exports.MemoryStorageInstance = MemoryStorageInstance;
+exports.SHARED_MEMORY_STORAGE = new MemoryStorageInstance();
+//# sourceMappingURL=storage.memory.js.map