@dereekb/util 2.1.0 → 4.0.1

package/src/lib/promise/promise.ref.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.makePromiseFullRef = void 0;
+let i = 0;
+/**
+ * Creates a new promise and returns the full ref for it.
+ */
+function makePromiseFullRef(executor) {
+    const ref = {};
+    ref.promise = new Promise((resolve, reject) => {
+        ref.resolve = resolve;
+        ref.reject = reject;
+        executor(resolve, reject);
+    });
+    ref.number = i += 1;
+    return ref;
+}
+exports.makePromiseFullRef = makePromiseFullRef;
+//# sourceMappingURL=promise.ref.js.map

package/src/lib/promise/promise.ref.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.ref.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/promise/promise.ref.ts"],"names":[],"mappings":";;;AAWA,IAAI,CAAC,GAAG,CAAC,CAAC;AAEV;;GAEG;AACH,SAAgB,kBAAkB,CAAI,QAA4B;IAChE,MAAM,GAAG,GAAQ,EAAS,CAAC;IAE3B,GAAG,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAC5C,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC;QACtB,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;QAEpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC;IAEpB,OAAO,GAAG,CAAC;AACb,CAAC;AAbD,gDAaC"}

package/src/lib/promise/wait.js

@@ -3,8 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.waitForMs = void 0;
 const tslib_1 = require("tslib");
 function waitForMs(ms, value) {
-    return (0, tslib_1.__awaiter)(this, void 0, void 0, function* () {
-        return new Promise(resolve => setTimeout(resolve, ms, value));
+    return tslib_1.__awaiter(this, void 0, void 0, function* () {
+        return new Promise(resolve => setTimeout(() => resolve(value), ms));
     });
 }
 exports.waitForMs = waitForMs;

package/src/lib/promise/wait.js.map

@@ -1 +1 @@
-{"version":3,"file":"wait.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/promise/wait.ts"],"names":[],"mappings":";;;;AAOA,SAAsB,SAAS,CAAI,EAAU,EAAE,KAAS;;QACtD,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IAChE,CAAC;CAAA;AAFD,8BAEC"}
+{"version":3,"file":"wait.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/promise/wait.ts"],"names":[],"mappings":";;;;AAOA,SAAsB,SAAS,CAAI,EAAU,EAAE,KAAS;;QACtD,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;CAAA;AAFD,8BAEC"}

package/src/lib/relation/index.js

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

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

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

package/src/lib/relation/relation.js

@@ -121,7 +121,7 @@ class ModelRelationUtility {
         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) => {
+        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 : [];
@@ -134,7 +134,7 @@ class ModelRelationUtility {
             }
         });
         // Rejoin all changes.
-        return modifiedSubCollections.reduce((x, y) => x.concat(y), []);
+        return modifiedSubcollections.reduce((x, y) => x.concat(y), []);
     }
     static _insertSingleTypeCollection(current, insert, { readKey, merge }) {
         const currentKeys = (0, array_1.arrayToMap)(current, readKey);

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

@@ -0,0 +1,4 @@
+export * from './set.allowed';
+export * from './set.hashset';
+export * from './set.maybe';
+export * from './set';

package/src/lib/set/index.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/index.ts"],"names":[],"mappings":";;;AAAA,wDAA8B;AAC9B,wDAA8B;AAC9B,sDAA4B;AAC5B,gDAAsB"}

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

@@ -0,0 +1,23 @@
+import { ArrayOrValue } from './../array/array';
+import { Maybe } from "../value/maybe";
+/**
+ * Pair of allowed/disallowed values.
+ */
+export interface AllowedSet<T> {
+    /**
+     * Values that are allowed. Hits against this set result in an initial true.
+     */
+    allowed?: Maybe<Set<T>>;
+    /**
+     * Values that are disallowed. Hits against this set result in false.
+     */
+    disallowed?: Maybe<Set<T>>;
+}
+/**
+ * Determines whether the input values are "allowed" for the given AllowedSet.
+ *
+ * @param input
+ * @param allowedSet
+ * @returns
+ */
+export declare function isAllowed<T>(input: ArrayOrValue<T>, allowedSet: AllowedSet<T>): boolean;

package/src/lib/set/set.allowed.js

@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isAllowed = void 0;
+const array_1 = require("./../array/array");
+const set_1 = require("./set");
+/**
+ * Determines whether the input values are "allowed" for the given AllowedSet.
+ *
+ * @param input
+ * @param allowedSet
+ * @returns
+ */
+function isAllowed(input, allowedSet) {
+    const { allowed, disallowed } = allowedSet;
+    const values = (0, array_1.asArray)(input);
+    let isAllowed = false;
+    if (allowed) {
+        isAllowed = (0, set_1.setContainsAnyValue)(allowed, values);
+    }
+    else {
+        isAllowed = true;
+    }
+    if (isAllowed && disallowed) {
+        isAllowed = !(0, set_1.setContainsAnyValue)(disallowed, values);
+    }
+    return isAllowed;
+}
+exports.isAllowed = isAllowed;
+//# sourceMappingURL=set.allowed.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"set.allowed.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/set.allowed.ts"],"names":[],"mappings":";;;AAAA,4CAAyD;AAEzD,+BAA4C;AAgB5C;;;;;;GAMG;AACH,SAAgB,SAAS,CAAI,KAAsB,EAAE,UAAyB;IAC5E,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,UAAU,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC;IAE9B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,IAAI,OAAO,EAAE;QACX,SAAS,GAAG,IAAA,yBAAmB,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC;KAClD;SAAM;QACL,SAAS,GAAG,IAAI,CAAC;KAClB;IAED,IAAI,SAAS,IAAI,UAAU,EAAE;QAC3B,SAAS,GAAG,CAAC,IAAA,yBAAmB,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;KACtD;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAjBD,8BAiBC"}

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

@@ -0,0 +1,53 @@
+import { Maybe } from '../value/maybe';
+import { IterableOrValue } from '../iterable/iterable';
+export declare function asSet<T>(values: IterableOrValue<T>): Set<T>;
+export declare function addToSet<T>(set: Set<T>, values: Maybe<IterableOrValue<T>>): void;
+export declare function removeFromSet<T>(set: Set<T>, values: Maybe<IterableOrValue<T>>): void;
+export declare function hasDifferentValues<T>(a: Maybe<Iterable<T>>, b: Maybe<Iterable<T>>): boolean;
+export declare function symmetricDifferenceKeys<T>(a: Maybe<Iterable<T>>, b: Maybe<Iterable<T>>): Maybe<T>[];
+export declare function symmetricDifferenceKeysSet<T>(a: Set<Maybe<T>>, b: Set<Maybe<T>>): Maybe<T>[];
+export declare function flattenArrayToSet<T>(array: T[][]): Set<T>;
+export declare function keepValuesFromSet<T>(values: T[], set: Set<T>): T[];
+export declare function excludeValuesFromSet<T>(values: T[], set: Set<T>): T[];
+export declare function filterValuesFromSet<T>(values: T[], set: Set<T>, exclude?: boolean): T[];
+/**
+ * Set inclusion comparison type.
+ * - all: All values must be included
+ * - any: Any value is included
+ */
+export declare type SetIncludesMode = 'all' | 'any';
+/**
+ * Contextual function that checks whether or not the input values are included.
+ */
+export declare type SetIncludesFunction<T> = (valuesToFind: Iterable<T>) => boolean;
+/**
+ * Creates a SetIncludesFunction using the input valuesSet and optional mode. By default the mode defaults to 'all'.
+ *
+ * @param valuesSet
+ * @param valuesToFind
+ * @param mode
+ */
+export declare function setIncludesFunction<T>(valuesSet: Set<T>, mode?: SetIncludesMode): SetIncludesFunction<T>;
+/**
+ * Returns true if the input array contains any value from the second array.
+ */
+export declare function containsAnyValue<T>(values: Iterable<T>, valuesToFind: Iterable<T>): boolean;
+export declare function containsAnyValueFromSet<T>(values: Iterable<T>, valuesToFind: Set<T>): boolean;
+export declare function setContainsAnyValue<T>(valuesSet: Set<T>, valuesToFind: Iterable<T>): boolean;
+/**
+ * Returns true if values contains all values in valuesToFind.
+ *
+ * @param values
+ * @param valuesToFind
+ * @returns
+ */
+export declare function containsAllValues<T>(values: Iterable<T>, valuesToFind: Iterable<T>): boolean;
+/**
+ * Returns true if valuesSet contains all values in valuesToFind.
+ *
+ * @param valuesSet
+ * @param valuesToFind
+ * @param returnOnEmptyValuesSet
+ * @returns
+ */
+export declare function setContainsAllValues<T>(valuesSet: Set<T>, valuesToFind: Iterable<T>): boolean;

package/src/lib/{set.hashset.d.ts → set/set.hashset.d.ts}

@@ -1,5 +1,5 @@
-import { PrimativeKey, ReadKeyFunction } from "./key";
-import { Maybe } from "./value";
+import { PrimativeKey, ReadKeyFunction } from "../key";
+import { Maybe } from "../value/maybe";
 export interface HashSetConfig<K extends PrimativeKey, T> {
     readKey: ReadKeyFunction<T, K>;
 }

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

@@ -0,0 +1 @@
+{"version":3,"file":"set.hashset.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/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/set.js

@@ -0,0 +1,114 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.setContainsAllValues = exports.containsAllValues = exports.setContainsAnyValue = exports.containsAnyValueFromSet = exports.containsAnyValue = exports.setIncludesFunction = exports.filterValuesFromSet = exports.excludeValuesFromSet = exports.keepValuesFromSet = exports.flattenArrayToSet = exports.symmetricDifferenceKeysSet = exports.symmetricDifferenceKeys = exports.hasDifferentValues = exports.removeFromSet = exports.addToSet = exports.asSet = void 0;
+const array_1 = require("../array/array");
+const iterable_1 = require("../iterable/iterable");
+const extra_set_1 = require("extra-set");
+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 addToSet(set, values) {
+    (0, iterable_1.useIterableOrValue)(values, (x) => set.add(x));
+}
+exports.addToSet = addToSet;
+function removeFromSet(set, values) {
+    (0, iterable_1.useIterableOrValue)(values, (x) => set.delete(x));
+}
+exports.removeFromSet = removeFromSet;
+function hasDifferentValues(a, b) {
+    return (0, extra_set_1.symmetricDifference)(new Set(a), new Set(b)).size > 0;
+}
+exports.hasDifferentValues = hasDifferentValues;
+function symmetricDifferenceKeys(a, b) {
+    return symmetricDifferenceKeysSet(new Set(a), new Set(b));
+}
+exports.symmetricDifferenceKeys = symmetricDifferenceKeys;
+function symmetricDifferenceKeysSet(a, b) {
+    return Array.from((0, extra_set_1.symmetricDifference)(a, b));
+}
+exports.symmetricDifferenceKeysSet = symmetricDifferenceKeysSet;
+function flattenArrayToSet(array) {
+    return new Set((0, array_1.flattenArray)(array));
+}
+exports.flattenArrayToSet = flattenArrayToSet;
+function keepValuesFromSet(values, set) {
+    return filterValuesFromSet(values, set, false);
+}
+exports.keepValuesFromSet = keepValuesFromSet;
+function excludeValuesFromSet(values, set) {
+    return filterValuesFromSet(values, set, true);
+}
+exports.excludeValuesFromSet = excludeValuesFromSet;
+function filterValuesFromSet(values, set, exclude = false) {
+    const filterFn = (exclude) ? ((x) => !set.has(x)) : ((x) => set.has(x));
+    return values.filter(filterFn);
+}
+exports.filterValuesFromSet = filterValuesFromSet;
+/**
+ * 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') {
+    let fn;
+    if (mode === 'any') {
+        fn = setContainsAnyValue;
+    }
+    else {
+        fn = setContainsAllValues;
+    }
+    return (valuesToFind) => fn(valuesSet, valuesToFind);
+}
+exports.setIncludesFunction = setIncludesFunction;
+/**
+ * Returns true if the input array contains any value from the second array.
+ */
+function containsAnyValue(values, valuesToFind) {
+    const set = new Set(valuesToFind);
+    return containsAnyValueFromSet(values, set);
+}
+exports.containsAnyValue = containsAnyValue;
+function containsAnyValueFromSet(values, valuesToFind) {
+    return setContainsAnyValue(valuesToFind, values);
+}
+exports.containsAnyValueFromSet = containsAnyValueFromSet;
+function setContainsAnyValue(valuesSet, valuesToFind) {
+    return (valuesSet) ? Array.from(valuesToFind).findIndex((x) => valuesSet.has(x)) !== -1 : false;
+}
+exports.setContainsAnyValue = setContainsAnyValue;
+/**
+ * Returns true if values contains all values in valuesToFind.
+ *
+ * @param values
+ * @param valuesToFind
+ * @returns
+ */
+function containsAllValues(values, valuesToFind) {
+    const set = new Set(values);
+    return setContainsAllValues(set, valuesToFind);
+}
+exports.containsAllValues = containsAllValues;
+/**
+ * Returns true if valuesSet contains all values in valuesToFind.
+ *
+ * @param valuesSet
+ * @param valuesToFind
+ * @param returnOnEmptyValuesSet
+ * @returns
+ */
+function setContainsAllValues(valuesSet, valuesToFind) {
+    return (valuesSet) ? Array.from(valuesToFind).findIndex((x) => !valuesSet.has(x)) == -1 : false;
+}
+exports.setContainsAllValues = setContainsAllValues;
+//# sourceMappingURL=set.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"set.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/set/set.ts"],"names":[],"mappings":";;;AACA,0CAA8C;AAC9C,mDAA2E;AAC3E,yCAAgD;AAEhD,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,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,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,kBAAkB,CAAI,CAAqB,EAAE,CAAqB;IAChF,OAAO,IAAA,+BAAmB,EAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AAC9D,CAAC;AAFD,gDAEC;AAED,SAAgB,uBAAuB,CAAI,CAAqB,EAAE,CAAqB;IACrF,OAAO,0BAA0B,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAFD,0DAEC;AAED,SAAgB,0BAA0B,CAAI,CAAgB,EAAE,CAAgB;IAC9E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAA,+BAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAFD,gEAEC;AAED,SAAgB,iBAAiB,CAAI,KAAY;IAC/C,OAAO,IAAI,GAAG,CAAC,IAAA,oBAAY,EAAC,KAAK,CAAC,CAAC,CAAC;AACtC,CAAC;AAFD,8CAEC;AAED,SAAgB,iBAAiB,CAAI,MAAW,EAAE,GAAW;IAC3D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAFD,8CAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,GAAW;IAC9D,OAAO,mBAAmB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAFD,oDAEC;AAED,SAAgB,mBAAmB,CAAI,MAAW,EAAE,GAAW,EAAE,OAAO,GAAG,KAAK;IAC9E,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAHD,kDAGC;AAcD;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAAI,SAAiB,EAAE,OAAwB,KAAK;IACrF,IAAI,EAAiD,CAAC;IAEtD,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,CAAC,CAAC;AACvD,CAAC;AAVD,kDAUC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAI,MAAmB,EAAE,YAAyB;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAClC,OAAO,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AAHD,4CAGC;AAED,SAAgB,uBAAuB,CAAI,MAAmB,EAAE,YAAoB;IAClF,OAAO,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;AACnD,CAAC;AAFD,0DAEC;AAED,SAAgB,mBAAmB,CAAI,SAAiB,EAAE,YAAyB;IACjF,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAClG,CAAC;AAFD,kDAEC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAI,MAAmB,EAAE,YAAyB;IACjF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,oBAAoB,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AACjD,CAAC;AAHD,8CAGC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAI,SAAiB,EAAE,YAAyB;IAClF,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAClG,CAAC;AAFD,oDAEC"}

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

@@ -0,0 +1,11 @@
+import { ArrayOrValue } from './../array/array';
+import { Maybe } from "../value/maybe";
+/**
+ * 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
+ */
+export declare function maybeSet<T>(input: Maybe<ArrayOrValue<T>>): Maybe<Set<T>>;

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

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

@@ -0,0 +1 @@
+{"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/sort.d.ts

@@ -1,7 +1,4 @@
-export declare enum SortingOrder {
-    ASCENDING = "asc",
-    DESCENDING = "desc"
-}
+export declare type SortingOrder = 'desc' | 'asc';
 export declare const SORT_VALUE_LESS_THAN: SortComparisonNumber;
 export declare const SORT_VALUE_GREATER_THAN: SortComparisonNumber;
 export declare const SORT_VALUE_EQUAL: SortComparisonNumber;

package/src/lib/sort.js

@@ -1,11 +1,6 @@
 "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.compareFnOrder = exports.reverseCompareFn = exports.SORT_VALUE_EQUAL = exports.SORT_VALUE_GREATER_THAN = exports.SORT_VALUE_LESS_THAN = void 0;
 exports.SORT_VALUE_LESS_THAN = -1;
 exports.SORT_VALUE_GREATER_THAN = 1;
 exports.SORT_VALUE_EQUAL = 0;
@@ -18,8 +13,8 @@ exports.reverseCompareFn = reverseCompareFn;
  *
  * The input comparison function must be in ascending order.
  */
-function compareFnOrder(ascendingCompareFn, order = SortingOrder.ASCENDING) {
-    return (order === SortingOrder.ASCENDING) ? ascendingCompareFn : reverseCompareFn(ascendingCompareFn);
+function compareFnOrder(ascendingCompareFn, order = 'asc') {
+    return (order === 'asc') ? ascendingCompareFn : reverseCompareFn(ascendingCompareFn);
 }
 exports.compareFnOrder = compareFnOrder;
 //# sourceMappingURL=sort.js.map

package/src/lib/sort.js.map

@@ -1 +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"}
+{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/sort.ts"],"names":[],"mappings":";;;AAGa,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,KAAK;IAChH,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;AACvF,CAAC;AAFD,wCAEC"}

package/src/lib/storage/index.js

@@ -1,8 +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);
+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 +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"}
+{"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.memory.d.ts

@@ -1,4 +1,4 @@
-import { Maybe } from "../value";
+import { Maybe } from '../value/maybe';
 import { StorageObject } from "./storage.object";
 export declare class MemoryStorageInstance implements StorageObject {
     private _length;

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

@@ -1,4 +1,4 @@
-import { Maybe } from '../value';
+import { Maybe } from '../value/maybe';
 import { StoredDataStorageKey } from './storage';
 /**
  * Limited Class/Interface for storing string values synchronously.

package/src/lib/string.d.ts

@@ -1,5 +1,5 @@
-import { MapStringFn } from "./map";
-import { Maybe } from "./value";
+import { MapStringFn } from "./map/map";
+import { Maybe } from "./value/maybe";
 /**
  * Represents a string that is made up of comma-separated values.
  *
@@ -18,3 +18,10 @@ export declare function splitCommaSeparatedStringToSet(input: Maybe<CommaSeparat
  * Undefined is returned if a null/undefined value is input.
  */
 export declare function addPlusPrefixToNumber(value?: Maybe<number>, prefix?: string): string | undefined;
+/**
+ * Capitalizes the first letter of the input.
+ *
+ * @param value
+ * @returns
+ */
+export declare function capitalizeFirstLetter(value: string): string;

package/src/lib/string.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.addPlusPrefixToNumber = exports.splitCommaSeparatedStringToSet = exports.splitCommaSeparatedString = exports.caseInsensitiveString = void 0;
+exports.capitalizeFirstLetter = exports.addPlusPrefixToNumber = exports.splitCommaSeparatedStringToSet = exports.splitCommaSeparatedString = exports.caseInsensitiveString = void 0;
 function caseInsensitiveString(input) {
     return input === null || input === void 0 ? void 0 : input.toLocaleLowerCase();
 }
@@ -28,4 +28,14 @@ function addPlusPrefixToNumber(value, prefix = '+') {
     }
 }
 exports.addPlusPrefixToNumber = addPlusPrefixToNumber;
+/**
+ * Capitalizes the first letter of the input.
+ *
+ * @param value
+ * @returns
+ */
+function capitalizeFirstLetter(value) {
+    return value.charAt(0).toUpperCase() + value.slice(1);
+}
+exports.capitalizeFirstLetter = capitalizeFirstLetter;
 //# sourceMappingURL=string.js.map

package/src/lib/string.js.map

@@ -1 +1 @@
-{"version":3,"file":"string.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/string.ts"],"names":[],"mappings":";;;AAaA,SAAgB,qBAAqB,CAAC,KAAU;IAC9C,OAAO,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,iBAAiB,EAAE,CAAC;AACpC,CAAC;AAFD,sDAEC;AAID,SAAgB,yBAAyB,CAAU,KAA8B,EAAE,QAAwB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAQ;IACxH,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAHD,8DAGC;AAED,SAAgB,8BAA8B,CAAC,KAAkC;IAC/E,OAAO,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACxE,CAAC;AAFD,wEAEC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,KAAqB,EAAE,MAAM,GAAG,GAAG;IACvE,IAAI,KAAK,IAAI,IAAI,EAAE;QACjB,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;KACvD;SAAM;QACL,OAAO,SAAS,CAAC;KAClB;AACH,CAAC;AAND,sDAMC"}
+{"version":3,"file":"string.js","sourceRoot":"","sources":["../../../../../packages/util/src/lib/string.ts"],"names":[],"mappings":";;;AAcA,SAAgB,qBAAqB,CAAC,KAAU;IAC9C,OAAO,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,iBAAiB,EAAE,CAAC;AACpC,CAAC;AAFD,sDAEC;AAID,SAAgB,yBAAyB,CAAU,KAA8B,EAAE,QAAwB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAQ;IACxH,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAHD,8DAGC;AAED,SAAgB,8BAA8B,CAAC,KAAkC;IAC/E,OAAO,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACxE,CAAC;AAFD,wEAEC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,KAAqB,EAAE,MAAM,GAAG,GAAG;IACvE,IAAI,KAAK,IAAI,IAAI,EAAE;QACjB,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;KACvD;SAAM;QACL,OAAO,SAAS,CAAC;KAClB;AACH,CAAC;AAND,sDAMC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,KAAa;IACjD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC;AAFD,sDAEC"}

package/src/lib/tree/index.js

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

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/tree/index.ts"],"names":[],"mappings":";;;AAAA,sDAAuB;AACvB,6DAA8B;AAC9B,8DAA+B;AAC/B,4DAA6B"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/tree/index.ts"],"names":[],"mappings":";;;AAAA,iDAAuB;AACvB,wDAA8B;AAC9B,yDAA+B;AAC/B,uDAA6B"}

package/src/lib/tree/tree.expand.d.ts

@@ -1,5 +1,5 @@
 import { TreeNode, TreeNodeWithoutChildren } from "./tree";
-import { Maybe } from "../value";
+import { Maybe } from "../value/maybe";
 /**
  * ExpandTreeFunction configuration.
  */

package/src/lib/type.d.ts

@@ -1,6 +1,13 @@
-export declare type ClassType<T> = {
+/**
+ * Class typing, restricted to types that have a constructor via the new keyword.
+ */
+export declare type ClassType<T = any> = {
     new (...args: any[]): T;
 };
+/**
+ * Similar to ClassType, but allows for abstract classes.
+ */
+export declare type ClassLikeType<T = any> = abstract new (...args: any[]) => T;
 /**
  * Special type used to defined other type definitions that state the defined type has every key of one type, but each key has a single/new value type.
  */
@@ -8,3 +15,12 @@ export declare type KeyValueTransformMap<T, V, K extends keyof T = keyof T> = {
     [k in K]: V;
 };
 export declare type BooleanKeyValueTransformMap<T> = KeyValueTransformMap<T, boolean>;
+export declare type RemoveIndex<T> = {
+    [K in keyof T as string extends K ? never : number extends K ? never : K]: T[K];
+};
+/**
+ * Custom typing used to only retain known keys on types that have a [key: string] in their type.
+ *
+ * https://stackoverflow.com/questions/51954558/how-can-i-remove-a-wider-type-from-a-union-type-without-removing-its-subtypes-in/51955852#51955852
+ */
+export declare type KnownKeys<T> = keyof RemoveIndex<T>;

package/src/lib/value/equal.d.ts

@@ -0,0 +1,41 @@
+import { IterableOrValue } from './../iterable/iterable';
+/**
+ * Function used for equivalence comparisons on an object.
+ */
+export declare type IsEqualFunction<T = any> = (a: T, b: T) => boolean;
+/**
+ * Used to check if the input object is considered equal to the current context.
+ */
+export declare type IsEqualContext<T = any> = (x: T) => boolean;
+/**
+ * Similar to IsEqualContext, but supports an array of objects.
+ *
+ * Used to check if the input object or array of objects are considered equal to the current context.
+ */
+export declare type AreEqualContext<T = any> = (x: IterableOrValue<T>) => boolean;
+/**
+ * Creates an IsEqualContext
+ *
+ * @param contextValue
+ * @param fn
+ * @returns
+ */
+export declare function isEqualContext<T>(contextValue: T, fn: IsEqualFunction<T>): IsEqualContext<T>;
+/**
+ * Creates an AreEqualContext
+ *
+ * @param contextValue
+ * @param fn
+ * @returns
+ */
+export declare function areEqualContext<T>(contextValue: T, fn: IsEqualFunction<T>): AreEqualContext<T>;
+/**
+ * Returns true if all input values are equal.
+ *
+ * Arrays that are empty or have one value will return true by default.
+ *
+ * @param values
+ * @param fn
+ * @returns
+ */
+export declare function allObjectsAreEqual<T>(values: IterableOrValue<T>, fn: IsEqualFunction<T>): boolean;