@dereekb/util 10.0.5 → 10.0.6

package/src/lib/set/set.js

@@ -1,387 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.setsAreEquivalent = exports.iterablesAreSetEquivalent = exports.setContainsAllValues = exports.containsAllValues = exports.setContainsAnyValue = exports.containsAnyValueFromSet = exports.containsAnyValue = exports.setContainsNoneOfValue = exports.containsNoValueFromSet = exports.containsNoneOfValue = exports.setIncludes = exports.setIncludesFunction = exports.findValuesFrom = exports.setHasValueFunction = exports.hasValueFunction = exports.mapValuesToSet = exports.separateValuesToSets = exports.filterValuesToSet = exports.filterValuesUsingSet = exports.excludeValuesFromSet = exports.excludeValues = exports.keepValuesFromSet = exports.keepFromSetCopy = exports.flattenArrayToSet = exports.symmetricDifferenceArrayBetweenSets = exports.symmetricDifferenceArray = exports.hasDifferentValues = exports.hasSameValues = exports.removeFromSet = exports.removeFromSetCopy = exports.toggleInSet = exports.toggleInSetCopy = exports.addToSet = exports.addToSetCopy = exports.copySetAndDo = exports.asSet = void 0;
-const array_1 = require("../array/array");
-const iterable_1 = require("../iterable/iterable");
-const extra_set_1 = require("extra-set");
-const key_1 = require("../key");
-function asSet(values) {
-    let set;
-    if (typeof values === 'string') {
-        set = new Set([values]);
-    }
-    else {
-        set = new Set();
-        addToSet(set, values);
-    }
-    return set;
-}
-exports.asSet = asSet;
-function copySetAndDo(set, fn) {
-    const newSet = new Set(set);
-    fn(newSet);
-    return newSet;
-}
-exports.copySetAndDo = copySetAndDo;
-function addToSetCopy(set, values) {
-    return copySetAndDo(set, (x) => addToSet(x, values));
-}
-exports.addToSetCopy = addToSetCopy;
-function addToSet(set, values) {
-    (0, iterable_1.useIterableOrValue)(values, (x) => set.add(x));
-}
-exports.addToSet = addToSet;
-function toggleInSetCopy(set, values) {
-    return copySetAndDo(set, (x) => toggleInSet(x, values));
-}
-exports.toggleInSetCopy = toggleInSetCopy;
-function toggleInSet(set, values) {
-    (0, iterable_1.useIterableOrValue)(values, (x) => {
-        if (set.has(x)) {
-            set.delete(x);
-        }
-        else {
-            set.add(x);
-        }
-    });
-}
-exports.toggleInSet = toggleInSet;
-function removeFromSetCopy(set, values) {
-    return copySetAndDo(set, (x) => removeFromSet(x, values));
-}
-exports.removeFromSetCopy = removeFromSetCopy;
-function removeFromSet(set, values) {
-    (0, iterable_1.useIterableOrValue)(values, (x) => set.delete(x));
-}
-exports.removeFromSet = removeFromSet;
-function hasSameValues(a, b) {
-    return !hasDifferentValues(a, b);
-}
-exports.hasSameValues = hasSameValues;
-function hasDifferentValues(a, b) {
-    const setA = new Set(a);
-    return a == null || b == null || !setContainsAllValues(setA, b) || setA.size !== new Set(b).size;
-}
-exports.hasDifferentValues = hasDifferentValues;
-function symmetricDifferenceArray(a, b) {
-    return symmetricDifferenceArrayBetweenSets(new Set(a), new Set(b));
-}
-exports.symmetricDifferenceArray = symmetricDifferenceArray;
-function symmetricDifferenceArrayBetweenSets(a, b) {
-    return Array.from((0, extra_set_1.symmetricDifference)(a, b));
-}
-exports.symmetricDifferenceArrayBetweenSets = symmetricDifferenceArrayBetweenSets;
-function flattenArrayToSet(array) {
-    return new Set((0, array_1.flattenArray)(array));
-}
-exports.flattenArrayToSet = flattenArrayToSet;
-/**
- * If the input values to keep is null or undefined, returns an empty set.
- *
- * @param set
- * @param values
- * @returns
- */
-function keepFromSetCopy(set, values) {
-    return values != null ? filterValuesToSet((0, iterable_1.asIterable)(values), (x) => set.has(x)) : new Set();
-}
-exports.keepFromSetCopy = keepFromSetCopy;
-function keepValuesFromSet(values, set) {
-    return filterValuesUsingSet(values, set, false);
-}
-exports.keepValuesFromSet = keepValuesFromSet;
-function excludeValues(valuesToExclude, iterable) {
-    return excludeValuesFromSet(valuesToExclude, new Set(iterable));
-}
-exports.excludeValues = excludeValues;
-/**
- * Excludes any values in the input array using the set.
- *
- * @param values
- * @param set
- * @returns
- */
-function excludeValuesFromSet(values, set) {
-    return filterValuesUsingSet(values, set, true);
-}
-exports.excludeValuesFromSet = excludeValuesFromSet;
-/**
- * Filters the values from the array using
- *
- * @param values
- * @param set
- * @param exclude
- * @returns
- */
-function filterValuesUsingSet(values, set, exclude = false) {
-    const filterFn = setHasValueFunction(set, exclude);
-    return values.filter(filterFn);
-}
-exports.filterValuesUsingSet = filterValuesUsingSet;
-/**
- * Filters the input iterable using a DecisionFunction and returns a Set.
- *
- * @param values
- * @param fn
- * @returns
- */
-function filterValuesToSet(values, fn) {
-    const keep = new Set();
-    for (const value of values) {
-        if (fn(value)) {
-            keep.add(value);
-        }
-    }
-    return keep;
-}
-exports.filterValuesToSet = filterValuesToSet;
-/**
- * Filters the input iterable using a DecisionFunction and returns a Set.
- *
- * @param values
- * @param fn
- * @returns
- */
-function separateValuesToSets(values, fn, input) {
-    var _a, _b;
-    const included = (_a = input === null || input === void 0 ? void 0 : input.included) !== null && _a !== void 0 ? _a : new Set();
-    const excluded = (_b = input === null || input === void 0 ? void 0 : input.excluded) !== null && _b !== void 0 ? _b : new Set();
-    for (const value of values) {
-        (fn(value) ? included : excluded).add(value);
-    }
-    return {
-        included,
-        excluded
-    };
-}
-exports.separateValuesToSets = separateValuesToSets;
-/**
- * Maps the input iterable using a MapFunction and returns a Set of the mapped values.
- *
- * @param values
- * @param fn
- * @returns
- */
-function mapValuesToSet(values, mapFn) {
-    const set = new Set();
-    for (const value of values) {
-        set.add(mapFn(value));
-    }
-    return set;
-}
-exports.mapValuesToSet = mapValuesToSet;
-/**
- * Convenience function for using setHasValueFunction with IterableOrValue input.
- *
- * @param iterable
- * @param exclude
- * @returns
- */
-function hasValueFunction(iterable, exclude = false) {
-    const set = asSet(iterable);
-    return setHasValueFunction(set, exclude);
-}
-exports.hasValueFunction = hasValueFunction;
-/**
- * Creates a SetHasValueFunction. May create a function that returns the inverse.
- *
- * @param set
- * @param exclude
- * @returns
- */
-function setHasValueFunction(set, exclude) {
-    let hasValueFunction;
-    if (exclude) {
-        hasValueFunction = (x) => !set.has(x);
-    }
-    else {
-        hasValueFunction = (x) => set.has(x);
-    }
-    return hasValueFunction;
-}
-exports.setHasValueFunction = setHasValueFunction;
-/**
- * Finds values from the set based on the input.
- *
- * @param config
- * @returns
- */
-function findValuesFrom(config) {
-    const { readKey, values, exclude = false } = config;
-    let set;
-    if (config.keysToFind != null) {
-        set = asSet(config.keysToFind);
-    }
-    else if (config.valuesToFind != null) {
-        set = (0, key_1.readKeysSetFrom)(readKey, config.valuesToFind);
-    }
-    else {
-        set = new Set();
-    }
-    const filterFn = setHasValueFunction(set, exclude);
-    return values.filter((x) => {
-        const key = readKey(x);
-        return key != null ? filterFn(key) : exclude;
-    });
-}
-exports.findValuesFrom = findValuesFrom;
-/**
- * Creates a SetIncludesFunction using the input valuesSet and optional mode. By default the mode defaults to 'all'.
- *
- * @param valuesSet
- * @param valuesToFind
- * @param mode
- */
-function setIncludesFunction(valuesSet, mode = 'all', emptyValuesToFindArrayResult) {
-    let fn;
-    if (mode === 'any') {
-        fn = setContainsAnyValue;
-    }
-    else {
-        fn = setContainsAllValues;
-    }
-    return (valuesToFind) => fn(valuesSet, valuesToFind, emptyValuesToFindArrayResult);
-}
-exports.setIncludesFunction = setIncludesFunction;
-/**
- * Convenience function for calling setIncludesFunction() and passing the result a value, checking for includion.
- *
- * @param valuesSet
- * @param valuesToFind
- * @param mode
- * @returns
- */
-function setIncludes(valuesSet, valuesToFind, mode) {
-    return setIncludesFunction(valuesSet, mode)(valuesToFind);
-}
-exports.setIncludes = setIncludes;
-/**
- * Returns false if the input array contains any value from the second array.
- */
-function containsNoneOfValue(values, valuesToFind, emptyValuesToFindArrayResult) {
-    const set = new Set((0, iterable_1.asIterable)(valuesToFind, false));
-    return containsNoValueFromSet(values, set, emptyValuesToFindArrayResult);
-}
-exports.containsNoneOfValue = containsNoneOfValue;
-function containsNoValueFromSet(values, valuesToFind, emptyValuesArrayResult) {
-    return setContainsNoneOfValue(valuesToFind, values, emptyValuesArrayResult);
-}
-exports.containsNoValueFromSet = containsNoValueFromSet;
-function setContainsNoneOfValue(valuesSet, valuesToFind, emptyValuesToFindArrayResult = true) {
-    return !setContainsAnyValue(valuesSet, valuesToFind, emptyValuesToFindArrayResult);
-}
-exports.setContainsNoneOfValue = setContainsNoneOfValue;
-/**
- * Returns true if the input array contains any value from the second array.
- *
- * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
- */
-function containsAnyValue(values, valuesToFind, emptyValuesToFindArrayResult) {
-    const set = new Set((0, iterable_1.asIterable)(values, false));
-    return setContainsAnyValue(set, valuesToFind, emptyValuesToFindArrayResult);
-}
-exports.containsAnyValue = containsAnyValue;
-// TODO: Continue checking all values
-/**
- * Returns true if one or more of the input values are contained within the input set.
- *
- * If values is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
- *
- * @param values
- * @param valuesToFind
- * @returns
- */
-function containsAnyValueFromSet(values, valuesToFind, emptyValuesArrayResult) {
-    return setContainsAnyValue(valuesToFind, values, emptyValuesArrayResult);
-}
-exports.containsAnyValueFromSet = containsAnyValueFromSet;
-/**
- * Returns true if the input set contains any values from valuesToFind.
- *
- * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
- *
- * @param valuesSet
- * @param valuesToFind
- * @param emptyValuesToFindArrayResult
- * @returns
- */
-function setContainsAnyValue(valuesSet, valuesToFind, emptyValuesToFindArrayResult = false) {
-    let result;
-    if (valuesSet) {
-        const valuesToFindArray = (0, iterable_1.iterableToArray)(valuesToFind);
-        if (valuesToFindArray.length > 0) {
-            result = valuesToFindArray.findIndex((x) => valuesSet.has(x)) !== -1;
-        }
-        else {
-            result = emptyValuesToFindArrayResult;
-        }
-    }
-    else {
-        result = false;
-    }
-    return result;
-}
-exports.setContainsAnyValue = setContainsAnyValue;
-/**
- * Returns true if values contains all values in valuesToFind.
- *
- * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to true.
- *
- * @param values
- * @param valuesToFind
- * @returns
- */
-function containsAllValues(values, valuesToFind, emptyValuesArrayResult) {
-    const set = new Set(values);
-    return setContainsAllValues(set, valuesToFind, emptyValuesArrayResult);
-}
-exports.containsAllValues = containsAllValues;
-/**
- * Returns true if the input set contains all values from valuesToFind.
- *
- * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to true.
- *
- * @param valuesSet
- * @param valuesToFind
- * @param emptyValuesToFindArrayResult
- * @returns
- */
-function setContainsAllValues(valuesSet, valuesToFind, emptyValuesToFindArrayResult = true) {
-    let result;
-    if (valuesSet) {
-        const valuesToFindArray = (0, iterable_1.iterableToArray)(valuesToFind);
-        if (valuesToFindArray.length > 0) {
-            result = valuesToFindArray.findIndex((x) => !valuesSet.has(x)) == -1;
-        }
-        else {
-            result = emptyValuesToFindArrayResult;
-        }
-    }
-    else {
-        result = false;
-    }
-    return result;
-}
-exports.setContainsAllValues = setContainsAllValues;
-/**
- * Returns true if both iterables are defined (or are both null/undefined) and have the same values exactly.
- *
- * @param a
- * @param b
- * @returns
- */
-function iterablesAreSetEquivalent(a, b) {
-    return a && b ? setsAreEquivalent(new Set(a), new Set(b)) : a == b;
-}
-exports.iterablesAreSetEquivalent = iterablesAreSetEquivalent;
-/**
- * Returns true if both sets are defined (or are both null/undefined) and have the same values exactly.
- *
- * @param a
- * @param b
- */
-function setsAreEquivalent(a, b) {
-    return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
-}
-exports.setsAreEquivalent = setsAreEquivalent;
-//# sourceMappingURL=set.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"set.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/set.ts"],"names":[],"mappings":";;;AACA,0CAA8C;AAC9C,mDAAwG;AACxG,yCAAgD;AAChD,gCAAwE;AAOxE,SAAgB,KAAK,CAAI,MAA0B;IACjD,IAAI,GAAW,CAAC;IAEhB,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC9B,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;KACzB;SAAM;QACL,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;KACvB;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAXD,sBAWC;AAED,SAAgB,YAAY,CAAI,GAAW,EAAE,EAAyB;IACpE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,EAAE,CAAC,MAAM,CAAC,CAAC;IACX,OAAO,MAAM,CAAC;AAChB,CAAC;AAJD,oCAIC;AAED,SAAgB,YAAY,CAAI,GAAW,EAAE,MAAiC;IAC5E,OAAO,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvD,CAAC;AAFD,oCAEC;AAED,SAAgB,QAAQ,CAAI,GAAW,EAAE,MAAiC;IACxE,IAAA,6BAAkB,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAFD,4BAEC;AAED,SAAgB,eAAe,CAAI,GAAW,EAAE,MAAiC;IAC/E,OAAO,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC1D,CAAC;AAFD,0CAEC;AAED,SAAgB,WAAW,CAAI,GAAW,EAAE,MAAiC;IAC3E,IAAA,6BAAkB,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SACf;aAAM;YACL,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACZ;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AARD,kCAQC;AAED,SAAgB,iBAAiB,CAAI,GAAW,EAAE,MAAiC;IACjF,OAAO,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,8CAEC;AAED,SAAgB,aAAa,CAAI,GAAW,EAAE,MAAiC;IAC7E,IAAA,6BAAkB,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAFD,sCAEC;AAED,SAAgB,aAAa,CAAI,CAAqB,EAAE,CAAqB;IAC3E,OAAO,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAFD,sCAEC;AAED,SAAgB,kBAAkB,CAAI,CAAqB,EAAE,CAAqB;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACnG,CAAC;AAHD,gDAGC;AAED,SAAgB,wBAAwB,CAAI,CAAqB,EAAE,CAAqB;IACtF,OAAO,mCAAmC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC;AAFD,4DAEC;AAED,SAAgB,mCAAmC,CAAI,CAAgB,EAAE,CAAgB;IACvF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAA,+BAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAFD,kFAEC;AAED,SAAgB,iBAAiB,CAAI,KAAY;IAC/C,OAAO,IAAI,GAAG,CAAC,IAAA,oBAAY,EAAC,KAAK,CAAC,CAAC,CAAC;AACtC,CAAC;AAFD,8CAEC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAI,GAAW,EAAE,MAAiC;IAC/E,OAAO,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAA,qBAAU,EAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;AAC/F,CAAC;AAFD,0CAEC;AAED,SAAgB,iBAAiB,CAAI,MAAW,EAAE,GAAW;IAC3D,OAAO,oBAAoB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAClD,CAAC;AAFD,8CAEC;AAED,SAAgB,aAAa,CAAI,eAAoB,EAAE,QAA4B;IACjF,OAAO,oBAAoB,CAAC,eAAe,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AAClE,CAAC;AAFD,sCAEC;AAED;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAAI,MAAW,EAAE,GAAW;IAC9D,OAAO,oBAAoB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AACjD,CAAC;AAFD,oDAEC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAI,MAAW,EAAE,GAAW,EAAE,OAAO,GAAG,KAAK;IAC/E,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAHD,oDAGC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAI,MAAmB,EAAE,EAAuB;IAC/E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAE1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;YACb,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SACjB;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAVD,8CAUC;AAeD;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAAI,MAAmB,EAAE,EAAuB,EAAE,KAAoC;;IACxH,MAAM,QAAQ,GAAG,MAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,QAAQ,mCAAI,IAAI,GAAG,EAAK,CAAC;IACjD,MAAM,QAAQ,GAAG,MAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,QAAQ,mCAAI,IAAI,GAAG,EAAK,CAAC;IAEjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;KAC9C;IAED,OAAO;QACL,QAAQ;QACR,QAAQ;KACT,CAAC;AACJ,CAAC;AAZD,oDAYC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAO,MAAmB,EAAE,KAAwB;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAK,CAAC;IAEzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;KACvB;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AARD,wCAQC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAAI,QAA4B,EAAE,UAAmB,KAAK;IACxF,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC5B,OAAO,mBAAmB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;AAC3C,CAAC;AAHD,4CAGC;AAOD;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAAI,GAAW,EAAE,OAAgB;IAClE,IAAI,gBAAwC,CAAC;IAE7C,IAAI,OAAO,EAAE;QACX,gBAAgB,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACvC;SAAM;QACL,gBAAgB,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACtC;IAED,OAAO,gBAAgB,CAAC;AAC1B,CAAC;AAVD,kDAUC;AA2BD;;;;;GAKG;AACH,SAAgB,cAAc,CAA2C,MAAiC;IACxG,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;IAEpD,IAAI,GAAW,CAAC;IAEhB,IAAI,MAAM,CAAC,UAAU,IAAI,IAAI,EAAE;QAC7B,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;KAChC;SAAM,IAAI,MAAM,CAAC,YAAY,IAAI,IAAI,EAAE;QACtC,GAAG,GAAG,IAAA,qBAAe,EAAO,OAAO,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC;KAC3D;SAAM;QACL,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;KACjB;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC;AAlBD,wCAkBC;AAOD;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAAI,SAAiB,EAAE,OAAwB,KAAK,EAAE,4BAAsC;IAC7H,IAAI,EAAgG,CAAC;IAErG,IAAI,IAAI,KAAK,KAAK,EAAE;QAClB,EAAE,GAAG,mBAAmB,CAAC;KAC1B;SAAM;QACL,EAAE,GAAG,oBAAoB,CAAC;KAC3B;IAED,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,EAAE,YAAY,EAAE,4BAA4B,CAAC,CAAC;AACrF,CAAC;AAVD,kDAUC;AAED;;;;;;;GAOG;AACH,SAAgB,WAAW,CAAI,SAAiB,EAAE,YAAgC,EAAE,IAAsB;IACxG,OAAO,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC;AAC5D,CAAC;AAFD,kCAEC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAI,MAA0B,EAAE,YAAgC,EAAE,4BAAsC;IACzI,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAA,qBAAU,EAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;IACrD,OAAO,sBAAsB,CAAC,MAAM,EAAE,GAAG,EAAE,4BAA4B,CAAC,CAAC;AAC3E,CAAC;AAHD,kDAGC;AAED,SAAgB,sBAAsB,CAAI,MAA0B,EAAE,YAAoB,EAAE,sBAAgC;IAC1H,OAAO,sBAAsB,CAAC,YAAY,EAAE,MAAM,EAAE,sBAAsB,CAAC,CAAC;AAC9E,CAAC;AAFD,wDAEC;AAED,SAAgB,sBAAsB,CAAI,SAAiB,EAAE,YAAgC,EAAE,4BAA4B,GAAG,IAAI;IAChI,OAAO,CAAC,mBAAmB,CAAC,SAAS,EAAE,YAAY,EAAE,4BAA4B,CAAC,CAAC;AACrF,CAAC;AAFD,wDAEC;AAED;;;;GAIG;AACH,SAAgB,gBAAgB,CAAI,MAA0B,EAAE,YAAgC,EAAE,4BAAsC;IACtI,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAA,qBAAU,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/C,OAAO,mBAAmB,CAAC,GAAG,EAAE,YAAY,EAAE,4BAA4B,CAAC,CAAC;AAC9E,CAAC;AAHD,4CAGC;AAED,qCAAqC;AAErC;;;;;;;;GAQG;AACH,SAAgB,uBAAuB,CAAI,MAA0B,EAAE,YAAoB,EAAE,sBAAgC;IAC3H,OAAO,mBAAmB,CAAC,YAAY,EAAE,MAAM,EAAE,sBAAsB,CAAC,CAAC;AAC3E,CAAC;AAFD,0DAEC;AAED;;;;;;;;;GASG;AACH,SAAgB,mBAAmB,CAAI,SAAiB,EAAE,YAAgC,EAAE,4BAA4B,GAAG,KAAK;IAC9H,IAAI,MAAe,CAAC;IAEpB,IAAI,SAAS,EAAE;QACb,MAAM,iBAAiB,GAAG,IAAA,0BAAe,EAAC,YAAY,CAAC,CAAC;QAExD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;YAChC,MAAM,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,GAAG,4BAA4B,CAAC;SACvC;KACF;SAAM;QACL,MAAM,GAAG,KAAK,CAAC;KAChB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAhBD,kDAgBC;AAED;;;;;;;;GAQG;AACH,SAAgB,iBAAiB,CAAI,MAAmB,EAAE,YAAgC,EAAE,sBAAgC;IAC1H,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,oBAAoB,CAAC,GAAG,EAAE,YAAY,EAAE,sBAAsB,CAAC,CAAC;AACzE,CAAC;AAHD,8CAGC;AAED;;;;;;;;;GASG;AACH,SAAgB,oBAAoB,CAAI,SAAiB,EAAE,YAAgC,EAAE,4BAA4B,GAAG,IAAI;IAC9H,IAAI,MAAe,CAAC;IAEpB,IAAI,SAAS,EAAE;QACb,MAAM,iBAAiB,GAAG,IAAA,0BAAe,EAAC,YAAY,CAAC,CAAC;QAExD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;YAChC,MAAM,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,GAAG,4BAA4B,CAAC;SACvC;KACF;SAAM;QACL,MAAM,GAAG,KAAK,CAAC;KAChB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAhBD,oDAgBC;AAED;;;;;;GAMG;AACH,SAAgB,yBAAyB,CAAI,CAAqB,EAAE,CAAqB;IACvF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACrE,CAAC;AAFD,8DAEC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAI,CAAgB,EAAE,CAAgB;IACrE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACjF,CAAC;AAFD,8CAEC"}

package/src/lib/set/set.maybe.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.maybeSet = void 0;
-const array_1 = require("./../array/array");
-/**
- * Creates a Maybe Set with the input.
- *
- * If the input is an array or value, they are returned as a set. Otherwise, returns null/undefined.
- *
- * @param input
- * @returns
- */
-function maybeSet(input) {
-    if (input != null) {
-        return new Set((0, array_1.asArray)(input));
-    }
-    else {
-        return input;
-    }
-}
-exports.maybeSet = maybeSet;
-//# sourceMappingURL=set.maybe.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"set.maybe.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/set.maybe.ts"],"names":[],"mappings":";;;AAAA,4CAAyD;AAGzD;;;;;;;GAOG;AACH,SAAgB,QAAQ,CAAI,KAA6B;IACvD,IAAI,KAAK,IAAI,IAAI,EAAE;QACjB,OAAO,IAAI,GAAG,CAAC,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC,CAAC;KAChC;SAAM;QACL,OAAO,KAAiB,CAAC;KAC1B;AACH,CAAC;AAND,4BAMC"}

package/src/lib/set/set.mode.js

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

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

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

package/src/lib/set/set.selection.js

@@ -1,21 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isSelectedDecisionFunctionFactory = void 0;
-/**
- * Creates a IsSelectedDecisionFunctionFactory
- *
- * @param config
- * @returns
- */
-function isSelectedDecisionFunctionFactory(config) {
-    const { readKey, defaultIfKeyNull = false } = config;
-    return (selectedValues) => {
-        const selectedValuesSet = new Set(selectedValues);
-        return (value) => {
-            const key = readKey(value);
-            return key != null ? selectedValuesSet.has(key) : defaultIfKeyNull;
-        };
-    };
-}
-exports.isSelectedDecisionFunctionFactory = isSelectedDecisionFunctionFactory;
-//# sourceMappingURL=set.selection.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"set.selection.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/set.selection.ts"],"names":[],"mappings":";;;AAqBA;;;;;GAKG;AACH,SAAgB,iCAAiC,CAA2C,MAA8C;IACxI,MAAM,EAAE,OAAO,EAAE,gBAAgB,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;IAErD,OAAO,CAAC,cAA2B,EAAE,EAAE;QACrC,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;QAElD,OAAO,CAAC,KAAQ,EAAE,EAAE;YAClB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;QACrE,CAAC,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAXD,8EAWC"}

package/src/lib/sort.js

@@ -1,92 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.minAndMaxFunction = exports.simpleSortValuesFunctionWithSortRef = exports.sortValuesFunctionOrMapIdentityWithSortRef = exports.sortValuesFunctionWithSortRef = exports.sortValues = exports.compareFnOrder = exports.reverseCompareFn = exports.SORT_VALUE_EQUAL = exports.SORT_VALUE_GREATER_THAN = exports.SORT_VALUE_LESS_THAN = void 0;
-const iterable_1 = require("./iterable/iterable");
-const map_1 = require("./value/map");
-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 = 'asc') {
-    return order === 'asc' ? ascendingCompareFn : reverseCompareFn(ascendingCompareFn);
-}
-exports.compareFnOrder = compareFnOrder;
-/**
- * Sorts the input values using the input.
- *
- * @param param0
- * @returns
- */
-function sortValues({ values, alwaysReturnCopy, sortOnCopy, sortWith }) {
-    const doSort = sortWith != null;
-    if (alwaysReturnCopy || (sortOnCopy && doSort)) {
-        values = [...values];
-    }
-    return doSort ? values.sort(sortWith) : values;
-}
-exports.sortValues = sortValues;
-/**
- * Creates a SortValuesFunction using the input.
- *
- * @param sortRef
- * @returns
- */
-function sortValuesFunctionWithSortRef(sortRef, sortOnCopyDefault = true) {
-    const sortWith = sortRef === null || sortRef === void 0 ? void 0 : sortRef.sortWith;
-    return (values, sortOnCopy = sortOnCopyDefault) => sortValues({ values, sortOnCopy, sortWith });
-}
-exports.sortValuesFunctionWithSortRef = sortValuesFunctionWithSortRef;
-/**
- * Creates a SortValuesFunction using the input. If the input is not defined, or it's sort function is not defined, then returns mapIdentityFunction().
- */
-function sortValuesFunctionOrMapIdentityWithSortRef(sortRef, sortOnCopyDefault) {
-    const sortWith = sortRef === null || sortRef === void 0 ? void 0 : sortRef.sortWith;
-    return sortWith ? sortValuesFunctionWithSortRef(sortRef, sortOnCopyDefault) : (0, map_1.mapIdentityFunction)();
-}
-exports.sortValuesFunctionOrMapIdentityWithSortRef = sortValuesFunctionOrMapIdentityWithSortRef;
-/**
- * Equivalent to sortValuesFunctionOrMapIdentityWithSortRef(), but returns a SimpleSortValuesFunction instead.
- *
- * @param sortRef
- * @param sortOnCopyDefault
- * @returns
- */
-exports.simpleSortValuesFunctionWithSortRef = sortValuesFunctionOrMapIdentityWithSortRef;
-/**
- * Creates a MinAndMaxFunction using the input compare.
- *
- * @param compare
- */
-function minAndMaxFunction(compareFn) {
-    return (values) => {
-        var _a;
-        let min = (_a = (0, iterable_1.firstValueFromIterable)(values)) !== null && _a !== void 0 ? _a : undefined;
-        let max = min;
-        if (min != null && max != null) {
-            (0, iterable_1.forEachInIterable)(values, (x) => {
-                const compareMin = compareFn(x, min);
-                const compareMax = compareFn(x, max);
-                if (compareMin < 0) {
-                    min = x;
-                }
-                if (compareMax > 0) {
-                    max = x;
-                }
-            });
-            return { min, max };
-        }
-        else {
-            return null;
-        }
-    };
-}
-exports.minAndMaxFunction = minAndMaxFunction;
-//# sourceMappingURL=sort.js.map

package/src/lib/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/sort.ts"],"names":[],"mappings":";;;AAAA,kDAAgF;AAChF,qCAAmE;AAKtD,QAAA,oBAAoB,GAAyB,CAAC,CAAC,CAAC;AAChD,QAAA,uBAAuB,GAAyB,CAAC,CAAC;AAClD,QAAA,gBAAgB,GAAyB,CAAC,CAAC;AA8CxD,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,KAAK;IAChH,OAAO,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;AACrF,CAAC;AAFD,wCAEC;AA8BD;;;;;GAKG;AACH,SAAgB,UAAU,CAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAsB;IAClG,MAAM,MAAM,GAAG,QAAQ,IAAI,IAAI,CAAC;IAEhC,IAAI,gBAAgB,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,EAAE;QAC9C,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;KACtB;IAED,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACjD,CAAC;AARD,gCAQC;AAED;;;;;GAKG;AACH,SAAgB,6BAA6B,CAAI,OAAkD,EAAE,oBAA6B,IAAI;IACpI,MAAM,QAAQ,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,QAAQ,CAAC;IACnC,OAAO,CAAC,MAAW,EAAE,UAAU,GAAG,iBAAiB,EAAE,EAAE,CAAC,UAAU,CAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC1G,CAAC;AAHD,sEAGC;AAED;;GAEG;AACH,SAAgB,0CAA0C,CAAI,OAAkD,EAAE,iBAA2B;IAC3I,MAAM,QAAQ,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,QAAQ,CAAC;IACnC,OAAO,QAAQ,CAAC,CAAC,CAAC,6BAA6B,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAA,yBAAmB,GAAE,CAAC;AACtG,CAAC;AAHD,gGAGC;AAED;;;;;;GAMG;AACU,QAAA,mCAAmC,GAAwH,0CAA0C,CAAC;AAiBnN;;;;GAIG;AACH,SAAgB,iBAAiB,CAAI,SAAiC;IACpE,OAAO,CAAC,MAAmB,EAAE,EAAE;;QAC7B,IAAI,GAAG,GAAa,MAAA,IAAA,iCAAsB,EAAC,MAAM,CAAC,mCAAI,SAAS,CAAC;QAChE,IAAI,GAAG,GAAa,GAAG,CAAC;QAExB,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;YAC9B,IAAA,4BAAiB,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC9B,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,EAAE,GAAQ,CAAC,CAAC;gBAC1C,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,EAAE,GAAQ,CAAC,CAAC;gBAE1C,IAAI,UAAU,GAAG,CAAC,EAAE;oBAClB,GAAG,GAAG,CAAC,CAAC;iBACT;gBAED,IAAI,UAAU,GAAG,CAAC,EAAE;oBAClB,GAAG,GAAG,CAAC,CAAC;iBACT;YACH,CAAC,CAAC,CAAC;YAEH,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;SACrB;aAAM;YACL,OAAO,IAAI,CAAC;SACb;IACH,CAAC,CAAC;AACJ,CAAC;AAxBD,8CAwBC"}

package/src/lib/storage/index.js

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

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

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

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

@@ -1,24 +0,0 @@
-"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

@@ -1 +0,0 @@
-{"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;IAC5C,YAAY,OAAgB;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;IACjB,CAAC;CACF;AAJD,0CAIC;AAED,MAAa,qBAAsB,SAAQ,eAAe;IACxD,YAAY,OAAgB;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;IACjB,CAAC;CACF;AAJD,sDAIC;AAED,MAAa,kBAAsB,SAAQ,eAAe;IACxD,YAA4B,IAAuB,EAAE,OAAgB;QACnE,KAAK,CAAC,OAAO,CAAC,CAAC;QADW,SAAI,GAAJ,IAAI,CAAmB;IAEnD,CAAC;CACF;AAJD,gDAIC"}

package/src/lib/storage/storage.js

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

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

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

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

@@ -1,48 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SHARED_MEMORY_STORAGE = exports.MemoryStorageInstance = void 0;
-const object_1 = require("../object/object");
-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 (0, object_1.objectHasKey)(this._storage, 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

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

@@ -1 +0,0 @@
-{"version":3,"file":"storage.memory.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/storage/storage.memory.ts"],"names":[],"mappings":";;;AAAA,6CAAgD;AAIhD,MAAa,qBAAqB;IAAlC;QACU,YAAO,GAAG,CAAC,CAAC;QACZ,aAAQ,GAA8B,EAAE,CAAC;IAyCnD,CAAC;IAvCC,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,GAAG,CAAC,KAAa;;QACf,OAAO,MAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,mCAAI,IAAI,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,OAAO,IAAA,qBAAY,EAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,CAAC,GAAW;;QACjB,OAAO,MAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC;IACpC,CAAC;IAED,OAAO,CAAC,GAAW,EAAE,IAAmB;QACtC,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;SACtB;aAAM;YACL,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;gBACrB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;aACjC;YAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;SACnC;IACH,CAAC;IAED,UAAU,CAAC,GAAW;QACpB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,sBAAsB;YACjD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;SACjC;IACH,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;CACF;AA3CD,sDA2CC;AAEY,QAAA,qBAAqB,GAAG,IAAI,qBAAqB,EAAE,CAAC"}