@dereekb/util 0.0.1

package/README.md

@@ -0,0 +1,7 @@
+# util
+
+This library was generated with [Nx](https://nx.dev).
+
+## Running unit tests
+
+Run `nx test util` to execute the unit tests via [Jest](https://jestjs.io).

package/package.json

@@ -0,0 +1,10 @@
+{
+  "name": "@dereekb/util",
+  "version": "0.0.1",
+  "main": "./src/index.js",
+  "typings": "./src/index.d.ts",
+  "dependencies": {
+    "extra-set": "^2.2.11"
+  },
+  "peerDependencies": {}
+}

package/src/index.d.ts

@@ -0,0 +1,2 @@
+export * from './lib';
+export * from './test';

package/src/index.js

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

package/src/index.js.map

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

package/src/lib/array/array.boolean.d.ts

@@ -0,0 +1,28 @@
+import { ReadModelKeyFunction } from "../model";
+export declare type BooleanStringKey = string;
+/**
+ * Boolean represented by an array to describe the current state and reason why.
+ */
+export declare type BooleanStringKeyArray = BooleanKeyArray<BooleanStringKey>;
+/**
+ * Boolean represented by an array to describe the current state and reason why.
+ *
+ * Having any values in the array is considered "true".
+ */
+export declare type BooleanKeyArray<T = any> = T[] | undefined;
+export declare function readBooleanKeySafetyWrap<T>(readKey: ReadModelKeyFunction<T>): ReadModelKeyFunction<T>;
+export declare function isFalseBooleanKeyArray(value: BooleanKeyArray): boolean;
+export declare function isTrueBooleanKeyArray(value: BooleanKeyArray): boolean;
+export declare function insertIntoBooleanKeyArray<T>(array: BooleanKeyArray<T>, value: T, readKey: ReadModelKeyFunction<T>): BooleanKeyArray<T>;
+export declare function removeFromBooleanKeyArray<T>(array: BooleanKeyArray<T>, value: T, readKey: ReadModelKeyFunction<T>): BooleanKeyArray<T>;
+export declare function removeByKeyFromBooleanKeyArray<T>(array: BooleanKeyArray<T>, key: string, readKey: ReadModelKeyFunction<T>): BooleanKeyArray<T>;
+export declare class BooleanKeyArrayUtilityInstance<T> {
+    readonly readKey: ReadModelKeyFunction<T>;
+    constructor(readKey: ReadModelKeyFunction<T>);
+    isFalse(value: BooleanKeyArray): boolean;
+    isTrue(value: BooleanKeyArray): boolean;
+    insert(array: BooleanKeyArray<T>, value: T): BooleanKeyArray<T>;
+    remove(array: BooleanKeyArray<T>, value: T): BooleanKeyArray<T>;
+    removeByKey(array: BooleanKeyArray<T>, key: string): BooleanKeyArray<T>;
+}
+export declare const BooleanStringKeyArrayUtilityInstance: BooleanKeyArrayUtilityInstance<string>;

package/src/lib/array/array.boolean.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BooleanStringKeyArrayUtilityInstance = exports.BooleanKeyArrayUtilityInstance = exports.removeByKeyFromBooleanKeyArray = exports.removeFromBooleanKeyArray = exports.insertIntoBooleanKeyArray = exports.isTrueBooleanKeyArray = exports.isFalseBooleanKeyArray = exports.readBooleanKeySafetyWrap = void 0;
+const model_1 = require("../model");
+function readBooleanKeySafetyWrap(readKey) {
+    return (value) => {
+        const key = readKey(value);
+        if (key === '') {
+            throw new Error('Cannot use "empty" string for BooleanKey.');
+        }
+        else {
+            return key;
+        }
+    };
+}
+exports.readBooleanKeySafetyWrap = readBooleanKeySafetyWrap;
+function isFalseBooleanKeyArray(value) {
+    return !value || value.length <= 0;
+}
+exports.isFalseBooleanKeyArray = isFalseBooleanKeyArray;
+function isTrueBooleanKeyArray(value) {
+    return !isFalseBooleanKeyArray(value);
+}
+exports.isTrueBooleanKeyArray = isTrueBooleanKeyArray;
+function insertIntoBooleanKeyArray(array, value, readKey) {
+    return (array) ? [...(0, model_1.removeModelsWithSameKey)(array, value, readBooleanKeySafetyWrap(readKey)), value] : [value];
+}
+exports.insertIntoBooleanKeyArray = insertIntoBooleanKeyArray;
+function removeFromBooleanKeyArray(array, value, readKey) {
+    return (array) ? (0, model_1.removeModelsWithSameKey)(array, value, readBooleanKeySafetyWrap(readKey)) : array;
+}
+exports.removeFromBooleanKeyArray = removeFromBooleanKeyArray;
+function removeByKeyFromBooleanKeyArray(array, key, readKey) {
+    return (array) ? (0, model_1.removeModelsWithKey)(array, key, readBooleanKeySafetyWrap(readKey)) : array;
+}
+exports.removeByKeyFromBooleanKeyArray = removeByKeyFromBooleanKeyArray;
+class BooleanKeyArrayUtilityInstance {
+    constructor(readKey) {
+        this.readKey = readKey;
+    }
+    isFalse(value) {
+        return isFalseBooleanKeyArray(value);
+    }
+    isTrue(value) {
+        return isTrueBooleanKeyArray(value);
+    }
+    insert(array, value) {
+        return insertIntoBooleanKeyArray(array, value, this.readKey);
+    }
+    remove(array, value) {
+        return removeFromBooleanKeyArray(array, value, this.readKey);
+    }
+    removeByKey(array, key) {
+        return removeByKeyFromBooleanKeyArray(array, key, this.readKey);
+    }
+}
+exports.BooleanKeyArrayUtilityInstance = BooleanKeyArrayUtilityInstance;
+exports.BooleanStringKeyArrayUtilityInstance = new BooleanKeyArrayUtilityInstance(x => (x) ? x : undefined);
+//# sourceMappingURL=array.boolean.js.map

package/src/lib/array/array.boolean.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.boolean.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.boolean.ts"],"names":[],"mappings":";;;AAAA,oCAA8F;AAgB9F,SAAgB,wBAAwB,CAAI,OAAgC;IAC1E,OAAO,CAAC,KAAQ,EAAE,EAAE;QAClB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAE3B,IAAI,GAAG,KAAK,EAAE,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;SAC9D;aAAM;YACL,OAAO,GAAG,CAAC;SACZ;IACH,CAAC,CAAC;AACJ,CAAC;AAVD,4DAUC;AAED,SAAgB,sBAAsB,CAAC,KAAsB;IAC3D,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;AACrC,CAAC;AAFD,wDAEC;AAED,SAAgB,qBAAqB,CAAC,KAAsB;IAC1D,OAAO,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;AACxC,CAAC;AAFD,sDAEC;AAED,SAAgB,yBAAyB,CAAI,KAAyB,EAAE,KAAQ,EAAE,OAAgC;IAChH,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAA,+BAAuB,EAAC,KAAK,EAAE,KAAK,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAClH,CAAC;AAFD,8DAEC;AAED,SAAgB,yBAAyB,CAAI,KAAyB,EAAE,KAAQ,EAAE,OAAgC;IAChH,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,+BAAuB,EAAC,KAAK,EAAE,KAAK,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACpG,CAAC;AAFD,8DAEC;AAED,SAAgB,8BAA8B,CAAI,KAAyB,EAAE,GAAW,EAAE,OAAgC;IACxH,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,2BAAmB,EAAC,KAAK,EAAE,GAAG,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC9F,CAAC;AAFD,wEAEC;AAED,MAAa,8BAA8B;IAEzC,YAAqB,OAAgC;QAAhC,YAAO,GAAP,OAAO,CAAyB;IAAI,CAAC;IAE1D,OAAO,CAAC,KAAsB;QAC5B,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,CAAC,KAAsB;QAC3B,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,CAAC,KAAyB,EAAE,KAAQ;QACxC,OAAO,yBAAyB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,KAAyB,EAAE,KAAQ;QACxC,OAAO,yBAAyB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/D,CAAC;IAED,WAAW,CAAC,KAAyB,EAAE,GAAW;QAChD,OAAO,8BAA8B,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAClE,CAAC;CAEF;AAxBD,wEAwBC;AAEY,QAAA,oCAAoC,GAAG,IAAI,8BAA8B,CAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC"}

package/src/lib/array/array.d.ts

@@ -0,0 +1,60 @@
+import { Maybe } from "../value";
+export declare type ArrayOrValue<T> = T | T[];
+/**
+ * Converts the input value to an array containing itself, or returns itself if it is an array.
+ *
+ * @param arrayOrValue
+ * @returns
+ */
+export declare function convertMaybeToArray<T>(arrayOrValue: Maybe<ArrayOrValue<T>>): T[];
+/**
+ * Converts the input value to an array containing itself, or returns itself if it is an array.
+ *
+ * @param arrayOrValue
+ * @returns
+ */
+export declare function convertToArray<T>(arrayOrValue: ArrayOrValue<T>): T[];
+/**
+ * Returns the first value from the array.
+ */
+export declare function firstValue<T>(input: ArrayOrValue<T>): T;
+/**
+ * Returns the last value from the array.
+ */
+export declare function lastValue<T>(input: ArrayOrValue<T>): T;
+export declare function valueAtIndex<T>(input: ArrayOrValue<T>, index: number): T;
+/**
+ * Concatinates the input arrays and filters out falsy values.
+ */
+export declare function concatArrays<T>(...arrays: (Maybe<T[]>)[]): T[];
+export declare function flattenArray<T>(array: T[][]): T[];
+export declare function copyArray<T>(input: Maybe<T[]>): T[];
+export declare function pushElementOntoArray<T>(target: T[], element: T, times: number): T[];
+export declare function mergeIntoArray<T>(target: Maybe<T[]>, ...arrays: T[][]): T[];
+export declare function mergeArrayOrValueIntoArray<T>(target: T[], value: ArrayOrValue<T>): T[];
+/**
+ * Merges all the values from the second array into the first using push.
+ *
+ * This is preferable in cases where immutability is not required.
+ *
+ * @param target
+ * @param array
+ */
+export declare function mergeArrayIntoArray<T>(target: T[], array: T[]): T[];
+/**
+ * Copies/takes the elements from the front of the array up to the max.
+ *
+ * @param values
+ * @param maxToTake
+ * @returns
+ */
+export declare function takeFront<T>(values: T[], maxToTake: number): T[];
+/**
+ * Copies/takes as many elements as possible from the end.
+ *
+ * @param values Values to take from.
+ * @param maxToTake Max number of values to take from the end of the input array.
+ * @param keepFromFront Number of values to retain in the front of the array. These are not taken.
+ * @returns New array with the subset of taken values.
+ */
+export declare function takeLast<T>(values: T[], maxToTake: number, keepFromFront?: number): T[];

package/src/lib/array/array.filter.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Filters the input values by distance. The original order is retained.
+ *
+ * If order is irrelevant, use filterValuesByDistanceNoOrder().
+ */
+export declare function filterValuesByDistance<T>(input: T[], minDistance: number, getValue: (value: T) => number | null): T[];
+/**
+ * Filters the input values by an arbitrary "distance"/difference from eachother and returns the values sorted by their determined distance.
+ *
+ * This is useful in cases where many values are too "close" to eachother (Generally items that share the same time, or within seconds of eachother), and
+ * we are only interested in seeing one of those items.
+ */
+export declare function filterValuesByDistanceNoOrder<T>(input: T[], minDistance: number, getValue: (value: T) => number | null): T[];

package/src/lib/array/array.filter.js

@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.filterValuesByDistanceNoOrder = exports.filterValuesByDistance = void 0;
+/**
+ * Filters the input values by distance. The original order is retained.
+ *
+ * If order is irrelevant, use filterValuesByDistanceNoOrder().
+ */
+function filterValuesByDistance(input, minDistance, getValue) {
+    // TODO: Implement if needed.
+    throw new Error('Incomplete implementation!');
+}
+exports.filterValuesByDistance = filterValuesByDistance;
+/**
+ * Filters the input values by an arbitrary "distance"/difference from eachother and returns the values sorted by their determined distance.
+ *
+ * This is useful in cases where many values are too "close" to eachother (Generally items that share the same time, or within seconds of eachother), and
+ * we are only interested in seeing one of those items.
+ */
+function filterValuesByDistanceNoOrder(input, minDistance, getValue) {
+    const values = input.map(x => [x, getValue(x)]).filter(x => x[1] != null);
+    return _filterValuesByDistance(values, minDistance, (x) => x[0]);
+}
+exports.filterValuesByDistanceNoOrder = filterValuesByDistanceNoOrder;
+// TODO: Can add a "mergeValuesByDistance" too to merge together values that are too close together.
+function _filterValuesByDistance(values, minDistance, toOutputValue) {
+    // Exit if nothing to do.
+    switch (values.length) {
+        case 0:
+            return [];
+        case 1:
+            return [toOutputValue(values[0])];
+    }
+    // Sort values
+    values.sort((a, b) => a[1] - b[1]);
+    let prev = values[0];
+    const filtered = [toOutputValue(prev)];
+    for (let i = 1, n = values.length; i < n; i += 1) {
+        const current = values[i];
+        const distance = Math.abs(current[1] - prev[1]);
+        if (distance > minDistance) {
+            filtered.push(toOutputValue(current));
+            prev = current;
+        }
+    }
+    return filtered;
+}
+//# sourceMappingURL=array.filter.js.map

package/src/lib/array/array.filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.filter.ts"],"names":[],"mappings":";;;AAEA;;;;GAIG;AACH,SAAgB,sBAAsB,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IAE9G,6BAA6B;IAE7B,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;AAChD,CAAC;AALD,wDAKC;AAED;;;;;GAKG;AACH,SAAgB,6BAA6B,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IACrH,MAAM,MAAM,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAgB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IACxG,OAAO,uBAAuB,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAHD,sEAGC;AAED,oGAAoG;AAEpG,SAAS,uBAAuB,CAAO,MAAqB,EAAE,WAAmB,EAAE,aAAwC;IAEzH,yBAAyB;IACzB,QAAQ,MAAM,CAAC,MAAM,EAAE;QACrB,KAAK,CAAC;YACJ,OAAO,EAAE,CAAC;QACZ,KAAK,CAAC;YACJ,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrC;IAED,cAAc;IACd,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnC,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAErB,MAAM,QAAQ,GAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QAChD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,IAAI,QAAQ,GAAG,WAAW,EAAE;YAC1B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;YACtC,IAAI,GAAG,OAAO,CAAC;SAChB;KACF;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/src/lib/array/array.js

@@ -0,0 +1,149 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.takeLast = exports.takeFront = exports.mergeArrayIntoArray = exports.mergeArrayOrValueIntoArray = exports.mergeIntoArray = exports.pushElementOntoArray = exports.copyArray = exports.flattenArray = exports.concatArrays = exports.valueAtIndex = exports.lastValue = exports.firstValue = exports.convertToArray = exports.convertMaybeToArray = void 0;
+// MARK: Functions
+/**
+ * Converts the input value to an array containing itself, or returns itself if it is an array.
+ *
+ * @param arrayOrValue
+ * @returns
+ */
+function convertMaybeToArray(arrayOrValue) {
+    if (arrayOrValue != null) {
+        return convertToArray(arrayOrValue);
+    }
+    else {
+        return [];
+    }
+}
+exports.convertMaybeToArray = convertMaybeToArray;
+/**
+ * Converts the input value to an array containing itself, or returns itself if it is an array.
+ *
+ * @param arrayOrValue
+ * @returns
+ */
+function convertToArray(arrayOrValue) {
+    return Array.isArray(arrayOrValue) ? arrayOrValue : [arrayOrValue];
+}
+exports.convertToArray = convertToArray;
+/**
+ * Returns the first value from the array.
+ */
+function firstValue(input) {
+    return valueAtIndex(input, 0);
+}
+exports.firstValue = firstValue;
+/**
+ * Returns the last value from the array.
+ */
+function lastValue(input) {
+    if (Array.isArray(input)) {
+        return input[input.length - 1];
+    }
+    else {
+        return input;
+    }
+}
+exports.lastValue = lastValue;
+function valueAtIndex(input, index) {
+    if (Array.isArray(input)) {
+        return input[index];
+    }
+    else {
+        return input;
+    }
+}
+exports.valueAtIndex = valueAtIndex;
+/**
+ * Concatinates the input arrays and filters out falsy values.
+ */
+function concatArrays(...arrays) {
+    return flattenArray(arrays.filter(x => Boolean(x)));
+}
+exports.concatArrays = concatArrays;
+function flattenArray(array) {
+    return array.filter((x) => Boolean(x)).reduce((accumulator, value) => accumulator.concat([...value]), []);
+}
+exports.flattenArray = flattenArray;
+function copyArray(input) {
+    return (input != null) ? Array.from(input) : [];
+}
+exports.copyArray = copyArray;
+function pushElementOntoArray(target, element, times) {
+    for (let i = 0; i < times; i += 1) {
+        target.push(element);
+    }
+    return target;
+}
+exports.pushElementOntoArray = pushElementOntoArray;
+function mergeIntoArray(target, ...arrays) {
+    if (target == null) {
+        target = [];
+    }
+    arrays.forEach((array) => {
+        mergeArrayIntoArray(target, array);
+    });
+    return target;
+}
+exports.mergeIntoArray = mergeIntoArray;
+function mergeArrayOrValueIntoArray(target, value) {
+    if (Array.isArray(value)) {
+        return mergeArrayIntoArray(target, value);
+    }
+    else {
+        target.push(value);
+        return target;
+    }
+}
+exports.mergeArrayOrValueIntoArray = mergeArrayOrValueIntoArray;
+/**
+ * Merges all the values from the second array into the first using push.
+ *
+ * This is preferable in cases where immutability is not required.
+ *
+ * @param target
+ * @param array
+ */
+function mergeArrayIntoArray(target, array) {
+    Array.prototype.push.apply(target, array);
+    return target;
+}
+exports.mergeArrayIntoArray = mergeArrayIntoArray;
+/**
+ * Copies/takes the elements from the front of the array up to the max.
+ *
+ * @param values
+ * @param maxToTake
+ * @returns
+ */
+function takeFront(values, maxToTake) {
+    return values.slice(0, maxToTake);
+}
+exports.takeFront = takeFront;
+/**
+ * Copies/takes as many elements as possible from the end.
+ *
+ * @param values Values to take from.
+ * @param maxToTake Max number of values to take from the end of the input array.
+ * @param keepFromFront Number of values to retain in the front of the array. These are not taken.
+ * @returns New array with the subset of taken values.
+ */
+function takeLast(values, maxToTake, keepFromFront = 0) {
+    let results;
+    if (maxToTake < keepFromFront) {
+        throw new Error('Cannot take more than keeping from front.');
+    }
+    else if (keepFromFront === maxToTake) {
+        results = values.slice(0, keepFromFront);
+    }
+    else {
+        const length = values.length;
+        const secondHalfStartIndex = Math.max(keepFromFront, length - (maxToTake - keepFromFront));
+        const secondHalfEndIndex = length;
+        results = [...values.slice(0, keepFromFront), ...values.slice(secondHalfStartIndex, secondHalfEndIndex)];
+    }
+    return results;
+}
+exports.takeLast = takeLast;
+//# sourceMappingURL=array.js.map

package/src/lib/array/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.ts"],"names":[],"mappings":";;;AAKA,kBAAkB;AAClB;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAI,YAAoC;IACzE,IAAI,YAAY,IAAI,IAAI,EAAE;QACxB,OAAO,cAAc,CAAC,YAAY,CAAC,CAAC;KACrC;SAAM;QACL,OAAO,EAAE,CAAC;KACX;AACH,CAAC;AAND,kDAMC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAI,YAA6B;IAC7D,OAAO,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;AACrE,CAAC;AAFD,wCAEC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAI,KAAsB;IAClD,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC;AAFD,gCAEC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAI,KAAsB;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;KAChC;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,8BAMC;AAED,SAAgB,YAAY,CAAI,KAAsB,EAAE,KAAa;IACnE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACrB;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,oCAMC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAI,GAAG,MAAsB;IACvD,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAU,CAAC,CAAC;AAC/D,CAAC;AAFD,oCAEC;AAED,SAAgB,YAAY,CAAI,KAAY;IAC1C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC5G,CAAC;AAFD,oCAEC;AAED,SAAgB,SAAS,CAAI,KAAiB;IAC5C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAS,CAAC;AACzD,CAAC;AAFD,8BAEC;AAED,SAAgB,oBAAoB,CAAI,MAAW,EAAE,OAAU,EAAE,KAAa;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;QACjC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACtB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAND,oDAMC;AAED,SAAgB,cAAc,CAAI,MAAkB,EAAE,GAAG,MAAa;IACpE,IAAI,MAAM,IAAI,IAAI,EAAE;QAClB,MAAM,GAAG,EAAE,CAAC;KACb;IAED,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QACvB,mBAAmB,CAAC,MAAO,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAVD,wCAUC;AAED,SAAgB,0BAA0B,CAAI,MAAW,EAAE,KAAsB;IAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KAC3C;SAAM;QACL,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,MAAM,CAAC;KACf;AACH,CAAC;AAPD,gEAOC;AAED;;;;;;;GAOG;AACH,SAAgB,mBAAmB,CAAI,MAAW,EAAE,KAAU;IAC5D,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC;AAHD,kDAGC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAI,MAAW,EAAE,SAAiB;IACzD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;AACpC,CAAC;AAFD,8BAEC;AAED;;;;;;;GAOG;AACH,SAAgB,QAAQ,CAAI,MAAW,EAAE,SAAiB,EAAE,gBAAwB,CAAC;IACnF,IAAI,OAAY,CAAC;IAEjB,IAAI,SAAS,GAAG,aAAa,EAAE;QAC7B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;KAC9D;SAAM,IAAI,aAAa,KAAK,SAAS,EAAE;QACtC,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;KAC1C;SAAM;QACL,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE7B,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,GAAG,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC;QAC3F,MAAM,kBAAkB,GAAG,MAAM,CAAC;QAElC,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC,CAAC;KAC1G;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAjBD,4BAiBC"}

package/src/lib/array/array.limit.d.ts

@@ -0,0 +1,13 @@
+import { Maybe } from "../value";
+export interface LimitArrayConfig {
+    /**
+   * Number of items in the list to limit in the result.
+   */
+    limit: number;
+    /**
+     * If true the limit will be pulled from the end instead of the front of the array.
+     */
+    limitFromEnd?: boolean;
+}
+export declare function limitArray<T>(array: T[], { limit, limitFromEnd }: Partial<LimitArrayConfig>): T[];
+export declare function limitArray<T>(array: Maybe<T[]>, { limit, limitFromEnd }: Partial<LimitArrayConfig>): Maybe<T[]>;

package/src/lib/array/array.limit.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.limitArray = void 0;
+const array_1 = require("../array");
+function limitArray(array, { limit, limitFromEnd }) {
+    if (array && limit != null) {
+        if (limitFromEnd) {
+            return (0, array_1.takeLast)(array, limit);
+        }
+        else {
+            return (0, array_1.takeFront)(array, limit);
+        }
+    }
+    else {
+        return array;
+    }
+}
+exports.limitArray = limitArray;
+//# sourceMappingURL=array.limit.js.map

package/src/lib/array/array.limit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.limit.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.limit.ts"],"names":[],"mappings":";;;AAAA,oCAA+C;AAgB/C,SAAgB,UAAU,CAAI,KAAiB,EAAE,EAAE,KAAK,EAAE,YAAY,EAA6B;IACjG,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE;QAC1B,IAAI,YAAY,EAAE;YAChB,OAAO,IAAA,gBAAQ,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAC/B;aAAM;YACL,OAAO,IAAA,iBAAS,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAChC;KACF;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAVD,gCAUC"}

package/src/lib/array/array.map.d.ts

@@ -0,0 +1,18 @@
+import { PrimativeKey, ReadKeyFunction } from "../key";
+import { Maybe } from "../value";
+/**
+ * Maps the values of the input array to a Map. Can additionally specify a value function to map out the input value to another value for the map.
+ */
+export declare function arrayToMap<T, V, K extends PrimativeKey = PrimativeKey>(values: T[], keyFn: ReadKeyFunction<T, K>, valueFn: (t: T) => V): Map<Maybe<K>, V>;
+export declare function arrayToMap<T, K extends PrimativeKey = PrimativeKey>(values: T[], keyFn: ReadKeyFunction<T, K>, valueFn: (t: T) => T): Map<Maybe<K>, T>;
+export declare function arrayToMap<T, K extends PrimativeKey = PrimativeKey>(values: T[], keyFn: ReadKeyFunction<T, K>): Map<Maybe<K>, T>;
+/**
+ * Generates a value for the input
+ *
+ * @param keys
+ * @param existing
+ * @param readKey
+ * @param generateFn
+ * @returns
+ */
+export declare function generateIfDoesNotExist<T, K extends PrimativeKey = PrimativeKey>(keys: K[], existing: T[], readKey: ReadKeyFunction<T, K>, generateFn: (key: K) => T): T[];

package/src/lib/array/array.map.js

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateIfDoesNotExist = exports.arrayToMap = void 0;
+function arrayToMap(values, keyFn, valueFn = ((t) => t)) {
+    return new Map(values.map(x => [keyFn(x), valueFn(x)]));
+}
+exports.arrayToMap = arrayToMap;
+/**
+ * Generates a value for the input
+ *
+ * @param keys
+ * @param existing
+ * @param readKey
+ * @param generateFn
+ * @returns
+ */
+function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
+    const map = arrayToMap(existing, readKey);
+    return keys.map(x => {
+        var _a;
+        const value = (_a = map.get(x)) !== null && _a !== void 0 ? _a : generateFn(x);
+        return value;
+    });
+}
+exports.generateIfDoesNotExist = generateIfDoesNotExist;
+//# sourceMappingURL=array.map.js.map

package/src/lib/array/array.map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.map.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.map.ts"],"names":[],"mappings":";;;AASA,SAAgB,UAAU,CAA8C,MAAW,EAAE,KAA4B,EAAE,UAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAa,CAAC;IAC9J,OAAO,IAAI,GAAG,CAAc,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC;AAFD,gCAEC;AAED;;;;;;;;GAQG;AACH,SAAgB,sBAAsB,CAA2C,IAAS,EAAE,QAAa,EAAE,OAA8B,EAAE,UAAyB;IAClK,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAE1C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;;QAClB,MAAM,KAAK,GAAG,MAAA,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mCAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAPD,wDAOC"}

package/src/lib/array/array.number.d.ts

@@ -0,0 +1,21 @@
+export declare function reduceNumbersWithMax(array: number[], emptyArrayValue?: number): number | undefined;
+export declare function reduceNumbersWithMaxFn(emptyArrayValue?: number): (array: number[]) => number | undefined;
+export declare function reduceNumbersWithMin(array: number[], emptyArrayValue?: number): number | undefined;
+export declare function reduceNumbersWithMinFn(emptyArrayValue?: number): (array: number[]) => number | undefined;
+export declare function reduceNumbersWithAdd(array: number[], emptyArrayValue?: number): number;
+export declare function reduceNumbersWithAddFn(emptyArrayValue?: number): (array: number[]) => number;
+export declare function reduceNumbers(reduceFn: ((a: number, b: number) => number), array: number[], emptyArrayValue?: number): number | undefined;
+export declare function reduceNumbersFn(reduceFn: ((a: number, b: number) => number)): (array: number[]) => number | undefined;
+export declare function reduceNumbersFn<D extends number>(reduceFn: ((a: number, b: number) => number), emptyArrayValue?: D): (array: number[]) => number | D;
+/**
+ * Generates an array containing the range of numbers specified.
+ *
+ * The end value is not included.
+ *
+ * @param param0
+ * @returns
+ */
+export declare function range({ start, end }: {
+    start?: number;
+    end: number;
+}): number[];

package/src/lib/array/array.number.js

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.range = exports.reduceNumbersFn = exports.reduceNumbers = exports.reduceNumbersWithAddFn = exports.reduceNumbersWithAdd = exports.reduceNumbersWithMinFn = exports.reduceNumbersWithMin = exports.reduceNumbersWithMaxFn = exports.reduceNumbersWithMax = void 0;
+function reduceNumbersWithMax(array, emptyArrayValue) {
+    return reduceNumbersWithMaxFn(emptyArrayValue)(array);
+}
+exports.reduceNumbersWithMax = reduceNumbersWithMax;
+function reduceNumbersWithMaxFn(emptyArrayValue) {
+    return reduceNumbersFn((a, b) => Math.max(a, b), emptyArrayValue);
+}
+exports.reduceNumbersWithMaxFn = reduceNumbersWithMaxFn;
+function reduceNumbersWithMin(array, emptyArrayValue) {
+    return reduceNumbersWithMinFn(emptyArrayValue)(array);
+}
+exports.reduceNumbersWithMin = reduceNumbersWithMin;
+function reduceNumbersWithMinFn(emptyArrayValue) {
+    return reduceNumbersFn((a, b) => Math.min(a, b), emptyArrayValue);
+}
+exports.reduceNumbersWithMinFn = reduceNumbersWithMinFn;
+function reduceNumbersWithAdd(array, emptyArrayValue = 0) {
+    return reduceNumbersWithAddFn(emptyArrayValue)(array);
+}
+exports.reduceNumbersWithAdd = reduceNumbersWithAdd;
+function reduceNumbersWithAddFn(emptyArrayValue = 0) {
+    return reduceNumbersFn((a, b) => a + b, emptyArrayValue);
+}
+exports.reduceNumbersWithAddFn = reduceNumbersWithAddFn;
+function reduceNumbers(reduceFn, array, emptyArrayValue) {
+    if (array.length === 0) {
+        return emptyArrayValue;
+    }
+    else {
+        return reduceNumbersFn(reduceFn, emptyArrayValue)(array);
+    }
+}
+exports.reduceNumbers = reduceNumbers;
+function reduceNumbersFn(reduceFn, emptyArrayValue) {
+    const rFn = (array) => array.reduce(reduceFn);
+    return (array) => (array.length) ? rFn(array) : emptyArrayValue;
+}
+exports.reduceNumbersFn = reduceNumbersFn;
+/**
+ * Generates an array containing the range of numbers specified.
+ *
+ * The end value is not included.
+ *
+ * @param param0
+ * @returns
+ */
+function range({ start = 0, end }) {
+    const range = [];
+    for (let i = start; i < end; i += 1) {
+        range.push(i);
+    }
+    return range;
+}
+exports.range = range;
+//# sourceMappingURL=array.number.js.map

package/src/lib/array/array.number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.number.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.number.ts"],"names":[],"mappings":";;;AACA,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAwB;IAC5E,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAwB;IAC7D,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AACpE,CAAC;AAFD,wDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAe,EAAE,eAAe,GAAG,CAAC;IACvE,OAAO,sBAAsB,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAFD,oDAEC;AAED,SAAgB,sBAAsB,CAAC,eAAe,GAAG,CAAC;IACxD,OAAO,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC3D,CAAC;AAFD,wDAEC;AAED,SAAgB,aAAa,CAAC,QAA4C,EAAE,KAAe,EAAE,eAAwB;IACnH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,OAAO,eAAe,CAAC;KACxB;SAAM;QACL,OAAO,eAAe,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC;KAC1D;AACH,CAAC;AAND,sCAMC;AAID,SAAgB,eAAe,CAAmB,QAA4C,EAAE,eAAmB;IACjH,MAAM,GAAG,GAAG,CAAC,KAAe,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,OAAO,CAAC,KAAe,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;AAC5E,CAAC;AAHD,0CAGC;AAED;;;;;;;GAOG;AACH,SAAgB,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAmC;IACvE,MAAM,KAAK,GAAG,EAAE,CAAC;IAEjB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;QACnC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACf;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AARD,sBAQC"}

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

@@ -0,0 +1,20 @@
+import { PrimativeKey } from '../key';
+import { Maybe } from '../value';
+export declare function flattenArrayToSet<T>(array: T[][]): Set<T>;
+export declare function hasDifferentValues<T>(a: T[], b: T[]): boolean;
+export declare function hasDifferentStringsNoCase(a: string[], b: string[]): boolean;
+export declare function symmetricDifferenceKeys<T extends PrimativeKey = PrimativeKey>(a: Maybe<T>[], b: Maybe<T>[]): Maybe<T>[];
+export declare function symmetricDifferenceKeysSet<T>(a: Set<Maybe<T>>, b: Set<Maybe<T>>): Maybe<T>[];
+/**
+ * Returns items that exist in both arrays.
+ */
+export declare function keepValuesFromArray<T>(values: T[], secondArray: T[]): T[];
+export declare function keepValuesFromSet<T>(values: T[], set: Set<T>): T[];
+export declare function excludeValuesFromArray<T>(values: T[], secondArray: 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[];
+/**
+ * Returns true if the input array contains any value from the second array.
+ */
+export declare function containsAnyValue<T>(values: T[], valuesToFind: T[]): boolean;
+export declare function setContainsAnyValue<T>(values: T[], valuesToFind: Set<T>): boolean;