@dereekb/util 10.0.5 → 10.0.7

package/src/index.js

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

package/src/index.js.map

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

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

@@ -1,69 +0,0 @@
-"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/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);
-    }
-    set(array, value, enable = true) {
-        let result;
-        if (enable) {
-            result = this.insert(array, value);
-        }
-        else {
-            result = this.remove(array, value);
-        }
-        return result;
-    }
-    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

@@ -1 +0,0 @@
-{"version":3,"file":"array.boolean.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.boolean.ts"],"names":[],"mappings":";;;AAAA,0CAAoG;AAiBpG,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,KAAK,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;AAChH,CAAC;AAFD,8DAEC;AAED,SAAgB,yBAAyB,CAAI,KAAyB,EAAE,KAAQ,EAAE,OAAgC;IAChH,OAAO,KAAK,CAAC,CAAC,CAAC,IAAA,+BAAuB,EAAC,KAAK,EAAE,KAAK,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAClG,CAAC;AAFD,8DAEC;AAED,SAAgB,8BAA8B,CAAI,KAAyB,EAAE,GAAW,EAAE,OAAgC;IACxH,OAAO,KAAK,CAAC,CAAC,CAAC,IAAA,2BAAmB,EAAC,KAAK,EAAE,GAAG,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5F,CAAC;AAFD,wEAEC;AAED,MAAa,8BAA8B;IACzC,YAAqB,OAAgC;QAAhC,YAAO,GAAP,OAAO,CAAyB;IAAG,CAAC;IAEzD,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,GAAG,CAAC,KAAyB,EAAE,KAAQ,EAAE,MAAM,GAAG,IAAI;QACpD,IAAI,MAA0B,CAAC;QAE/B,IAAI,MAAM,EAAE;YACV,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACpC;aAAM;YACL,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACpC;QAED,OAAO,MAAM,CAAC;IAChB,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;CACF;AAlCD,wEAkCC;AAEY,QAAA,oCAAoC,GAAG,IAAI,8BAA8B,CAAmB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC"}

package/src/lib/array/array.factory.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayInputFactory = exports.arrayFactory = void 0;
-const getter_1 = require("../getter/getter");
-/**
- * Creates a new ArrayFactory.
- *
- * @param factory
- * @returns
- */
-function arrayFactory(factory) {
-    return (count) => (0, getter_1.makeWithFactory)(factory, count);
-}
-exports.arrayFactory = arrayFactory;
-/**
- * Creates a ArrayInputFactory.
- *
- * @param factory
- * @returns
- */
-function arrayInputFactory(factory) {
-    return (input) => (0, getter_1.makeWithFactoryInput)(factory, input);
-}
-exports.arrayInputFactory = arrayInputFactory;
-//# sourceMappingURL=array.factory.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.factory.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.factory.ts"],"names":[],"mappings":";;;AAAA,6CAA8H;AAuB9H;;;;;GAKG;AACH,SAAgB,YAAY,CAAI,OAAyC;IACvE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,wBAAe,EAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AACpD,CAAC;AAFD,oCAEC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAO,OAAuC;IAC7E,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,IAAA,6BAAoB,EAAO,OAAO,EAAE,KAAK,CAAC,CAAC;AACpE,CAAC;AAFD,8CAEC"}

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

@@ -1,107 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.filterAndMapFunction = exports.applyBestFit = exports.makeBestFit = exports.filterValuesByDistanceNoOrder = exports.filterValuesByDistance = void 0;
-const array_1 = require("./array");
-const array_index_1 = require("./array.index");
-const iterable_1 = require("../iterable/iterable");
-/**
- * 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;
-}
-/**
- * Same as applyBestFit, but returns a new array, rather than modifying the existing array.
- *
- * @param input
- * @param filter
- * @param updateNonBestFit
- */
-function makeBestFit(input, filter, compare, updateNonBestFit) {
-    return applyBestFit((0, array_1.copyArray)(input), filter, compare, updateNonBestFit);
-}
-exports.makeBestFit = makeBestFit;
-/**
- * Used for updating an array so that a single element becomes the "best fit" in whatever context is provided.
- *
- * For instance, if two items are selected but only one can be selected by design, this function can be used to
- * pick the best fit, and update the input array.
- *
- * @param input
- * @param filter
- * @param updateNonBestFit
- * @returns
- */
-function applyBestFit(input, filter, compare, updateNonBestFit) {
-    const matchIndexSet = (0, array_index_1.findToIndexSet)(input, filter);
-    if (matchIndexSet.length > 1) {
-        const expansion = (0, array_index_1.expandIndexSet)(input, matchIndexSet);
-        const bestPair = (0, array_index_1.findBestIndexSetPair)(expansion, compare);
-        expansion.forEach(({ i, item }) => {
-            if (i !== bestPair.i) {
-                input[i] = updateNonBestFit(item); // Update value on input.
-            }
-        });
-    }
-    return input;
-}
-exports.applyBestFit = applyBestFit;
-/**
- * Filters the input values and maps all correct values to a new value.
- *
- * @param values
- * @param decisionFunction
- * @param mapFunction
- * @returns
- */
-function filterAndMapFunction(decisionFunction, mapFunction) {
-    return (values) => {
-        const result = [];
-        (0, iterable_1.forEachInIterable)(values, (x) => {
-            if (decisionFunction(x)) {
-                result.push(mapFunction(x));
-            }
-        });
-        return result;
-    };
-}
-exports.filterAndMapFunction = filterAndMapFunction;
-//# sourceMappingURL=array.filter.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.filter.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.filter.ts"],"names":[],"mappings":";;;AAEA,mCAAoC;AACpC,+CAAqF;AACrF,mDAAyD;AAEzD;;;;GAIG;AACH,SAAgB,sBAAsB,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IAC9G,6BAA6B;IAE7B,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;AAChD,CAAC;AAJD,wDAIC;AAED;;;;;GAKG;AACH,SAAgB,6BAA6B,CAAI,KAAU,EAAE,WAAmB,EAAE,QAAqC;IACrH,MAAM,MAAM,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAgB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IAC5G,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;IACzH,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;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAI,KAAU,EAAE,MAA6B,EAAE,OAA+B,EAAE,gBAAiC;IAC1I,OAAO,YAAY,CAAI,IAAA,iBAAS,EAAC,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;AAC9E,CAAC;AAFD,kCAEC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,YAAY,CAAI,KAAU,EAAE,MAA6B,EAAE,OAA+B,EAAE,gBAAiC;IAC3I,MAAM,aAAa,GAAG,IAAA,4BAAc,EAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEpD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;QAC5B,MAAM,SAAS,GAAG,IAAA,4BAAc,EAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAA,kCAAoB,EAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE1D,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;YAChC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE;gBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,IAAS,CAAC,CAAC,CAAC,yBAAyB;aAClE;QACH,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAfD,oCAeC;AAQD;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAO,gBAAqC,EAAE,WAA8B;IAC9G,OAAO,CAAC,MAAmB,EAAE,EAAE;QAC7B,MAAM,MAAM,GAAQ,EAAE,CAAC;QAEvB,IAAA,4BAAiB,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;YAC9B,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE;gBACvB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;aAC7B;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AAZD,oDAYC"}

package/src/lib/array/array.find.js

@@ -1,24 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayDecision = exports.arrayDecisionFunction = void 0;
-const function_boolean_1 = require("../function/function.boolean");
-/**
- * Creates a ArrayDecisionFunction based on the input decision and mode.
- *
- * @param decision
- * @param mode
- * @returns
- */
-function arrayDecisionFunction(decision, mode) {
-    const findFn = mode === 'all' ? (0, function_boolean_1.invertBooleanReturnFunction)(decision) : decision;
-    return (0, function_boolean_1.invertBooleanReturnFunction)((values) => values.findIndex(findFn) !== -1, mode === 'all');
-}
-exports.arrayDecisionFunction = arrayDecisionFunction;
-/**
- * Returns true based on the input values and find decision.
- */
-function arrayDecision(values, decision, mode) {
-    return arrayDecisionFunction(decision, mode)(values);
-}
-exports.arrayDecision = arrayDecision;
-//# sourceMappingURL=array.find.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.find.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.find.ts"],"names":[],"mappings":";;;AAAA,mEAA2E;AAa3E;;;;;;GAMG;AACH,SAAgB,qBAAqB,CAAI,QAAsC,EAAE,IAAqB;IACpG,MAAM,MAAM,GAAiC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAA,8CAA2B,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC/G,OAAO,IAAA,8CAA2B,EAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC;AAClG,CAAC;AAHD,sDAGC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAI,MAAW,EAAE,QAAsC,EAAE,IAAqB;IACzG,OAAO,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC;AACvD,CAAC;AAFD,sCAEC"}

package/src/lib/array/array.index.js

@@ -1,71 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sliceIndexRangeFunction = exports.findBestIndexSetPair = exports.findBest = exports.expandIndexSet = exports.findToIndexSet = void 0;
-const indexed_1 = require("../value/indexed");
-/**
- * Runs a filter on an array and returns an IndexSet for values that match.
- *
- * @param input
- * @param filter
- * @returns
- */
-function findToIndexSet(input, filter) {
-    const filterIndexes = [];
-    input.forEach((x, i) => {
-        if (filter(x)) {
-            filterIndexes.push(i);
-        }
-    });
-    return filterIndexes;
-}
-exports.findToIndexSet = findToIndexSet;
-function expandIndexSet(input, indexSet) {
-    return indexSet.map((i) => ({ i, item: input[i] }));
-}
-exports.expandIndexSet = expandIndexSet;
-/**
- * Finds the best item in the input array using the compare function, and returns an IndexSetPair value.
- *
- * @param input
- * @param compare
- */
-function findBest(input, compare) {
-    let bestIndex = 0;
-    let best = input[0];
-    for (let i = 1; i < input.length; i += 1) {
-        const next = input[i];
-        if (next != null && compare(best, next) < 0) {
-            bestIndex = i;
-            best = next;
-        }
-    }
-    return {
-        i: bestIndex,
-        item: best
-    };
-}
-exports.findBest = findBest;
-/**
- * Finds the best item in the input IndexSetPairSet, and returns it.
- *
- * @param input
- * @param compare
- * @returns
- */
-function findBestIndexSetPair(input, compare) {
-    let best = input[0];
-    for (let i = 1; i < input.length; i += 1) {
-        const next = input[i];
-        if (best.item == null || (next.item != null && compare(best.item, next.item) < 0)) {
-            best = next;
-        }
-    }
-    return best;
-}
-exports.findBestIndexSetPair = findBestIndexSetPair;
-function sliceIndexRangeFunction(inputRange) {
-    const range = (0, indexed_1.indexRange)(inputRange);
-    return (input) => input.slice(range.minIndex, range.maxIndex);
-}
-exports.sliceIndexRangeFunction = sliceIndexRangeFunction;
-//# sourceMappingURL=array.index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.index.ts"],"names":[],"mappings":";;;AAAA,8CAAsF;AAgBtF;;;;;;GAMG;AACH,SAAgB,cAAc,CAAI,KAAU,EAAE,MAA6B;IACzE,MAAM,aAAa,GAAkB,EAAE,CAAC;IAExC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;YACb,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,aAAa,CAAC;AACvB,CAAC;AAVD,wCAUC;AAED,SAAgB,cAAc,CAAI,KAAU,EAAE,QAAkB;IAC9D,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAFD,wCAEC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAI,KAAU,EAAE,OAA+B;IACrE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,IAAI,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE;YAC3C,SAAS,GAAG,CAAC,CAAC;YACd,IAAI,GAAG,IAAI,CAAC;SACb;KACF;IAED,OAAO;QACL,CAAC,EAAE,SAAS;QACZ,IAAI,EAAE,IAAI;KACX,CAAC;AACJ,CAAC;AAjBD,4BAiBC;AAED;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAAI,KAAyB,EAAE,OAA+B;IAChG,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YACjF,IAAI,GAAG,IAAI,CAAC;SACb;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAZD,oDAYC;AAOD,SAAgB,uBAAuB,CAAI,UAA2B;IACpE,MAAM,KAAK,GAAG,IAAA,oBAAU,EAAC,UAAU,CAAC,CAAC;IACrC,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;AACrE,CAAC;AAHD,0DAGC"}

package/src/lib/array/array.indexed.js

@@ -1,142 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.rangedIndexedValuesArrayAccessorInfoFactory = exports.indexedValuesArrayAccessorFactory = exports.rangedIndexedValuesArrayAccessorFactory = exports.getArrayNextIndex = exports.findNext = exports.indexRangeForArray = void 0;
-const indexed_1 = require("../value/indexed");
-/**
- * Creates an IndexRange for the input array.
- *
- * @param array
- * @returns
- */
-function indexRangeForArray(array) {
-    return { minIndex: 0, maxIndex: array.length };
-}
-exports.indexRangeForArray = indexRangeForArray;
-/**
- * Finds a value, then returns the next value, if applicable.
- *
- * @param array array to look in
- * @param find find function
- * @param wrapAround Whether or not to loop around to the front of the array if the value fonud is at the last index.
- * @param steps
- */
-function findNext(array, find, wrapAround = false, steps) {
-    let result;
-    if (array) {
-        const index = array.findIndex(find);
-        const nextIndex = getArrayNextIndex(array, index, wrapAround, steps);
-        if (nextIndex != null) {
-            result = array[nextIndex];
-        }
-    }
-    return result;
-}
-exports.findNext = findNext;
-/**
- * Returns the next index of an element in the input array based in the input index.
- *
- * Indexes less than 0 are considered to not exist.
- *
- * When wrapAround is true, indexes that are larger than the entire array will be used to find an index that is that many steps into the array.
- *
- * For instance, an index of 5 on an array of length 3 will return the index 1.
- *
- * @param array
- * @param index
- * @param wrapAround
- * @param steps
- */
-function getArrayNextIndex(array, index, wrapAround = false, steps = 1) {
-    let nextIndex;
-    const arrayLength = array.length;
-    if (index >= 0 && index <= arrayLength - 1) {
-        nextIndex = (0, indexed_1.stepsFromIndex)(indexRangeForArray(array), index, steps, wrapAround);
-    }
-    return nextIndex;
-}
-exports.getArrayNextIndex = getArrayNextIndex;
-function rangedIndexedValuesArrayAccessorFactory(readIndexRange) {
-    const readInfoFactory = rangedIndexedValuesArrayAccessorInfoFactory({
-        readIndexRange
-    });
-    return (values) => {
-        const readInfo = readInfoFactory(values);
-        return (index) => {
-            const result = readInfo(index);
-            return result.match; // only return matches
-        };
-    };
-}
-exports.rangedIndexedValuesArrayAccessorFactory = rangedIndexedValuesArrayAccessorFactory;
-function indexedValuesArrayAccessorFactory(readIndexRange) {
-    const readInfoFactory = rangedIndexedValuesArrayAccessorInfoFactory({
-        readIndexRange
-    });
-    return (values) => {
-        if (values.length === 0) {
-            throw new Error('Requires atleast one value to be defined.');
-        }
-        const readInfo = readInfoFactory(values);
-        return (index) => {
-            var _a, _b;
-            const result = readInfo(index);
-            // Return the exact match, otherwise return the previous value, otherwise return the next/final value.
-            return (_b = (_a = result.match) !== null && _a !== void 0 ? _a : result.prev) !== null && _b !== void 0 ? _b : result.next;
-        };
-    };
-}
-exports.indexedValuesArrayAccessorFactory = indexedValuesArrayAccessorFactory;
-function rangedIndexedValuesArrayAccessorInfoFactory(config) {
-    const pairFactory = (0, indexed_1.indexRangeReaderPairFactory)(config.readIndexRange);
-    return (values) => {
-        if (values.length === 0) {
-            return () => ({}); // no pairs to match on
-        }
-        else {
-            // pairs sorted in ascending order
-            const pairs = values.map(pairFactory).sort((0, indexed_1.sortByIndexRangeAscendingCompareFunction)((x) => x.range));
-            return (index) => {
-                var _a, _b, _c, _d, _e;
-                // find the first item that fits the
-                let matchIndex = -1;
-                let i;
-                for (i = 0; i < pairs.length; i += 1) {
-                    const comparison = pairs[i];
-                    if (comparison.range.minIndex <= index) {
-                        if (comparison.range.maxIndex > index) {
-                            matchIndex = i;
-                            break;
-                        }
-                        // continue otherwise.
-                    }
-                    else {
-                        break; // outside the min index, is not within these values at all
-                    }
-                }
-                let match;
-                let prev;
-                let next;
-                if (matchIndex === -1) {
-                    // no match
-                    match = undefined;
-                    // use i otherwise
-                    prev = (_a = pairs[i - 1]) === null || _a === void 0 ? void 0 : _a.value;
-                    next = (_b = pairs[i]) === null || _b === void 0 ? void 0 : _b.value;
-                }
-                else {
-                    match = (_c = pairs[matchIndex]) === null || _c === void 0 ? void 0 : _c.value;
-                    prev = (_d = pairs[matchIndex - 1]) === null || _d === void 0 ? void 0 : _d.value;
-                    next = (_e = pairs[matchIndex + 1]) === null || _e === void 0 ? void 0 : _e.value;
-                }
-                const info = {
-                    prev,
-                    match,
-                    next
-                };
-                return info;
-            };
-        }
-    };
-}
-exports.rangedIndexedValuesArrayAccessorInfoFactory = rangedIndexedValuesArrayAccessorInfoFactory;
-//# sourceMappingURL=array.indexed.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.indexed.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/array/array.indexed.ts"],"names":[],"mappings":";;;AAAA,8CAA0K;AAI1K;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAI,KAAU;IAC9C,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;AACjD,CAAC;AAFD,gDAEC;AAED;;;;;;;GAOG;AACH,SAAgB,QAAQ,CAAI,KAAiB,EAAE,IAAkC,EAAE,UAAU,GAAG,KAAK,EAAE,KAAc;IACnH,IAAI,MAAgB,CAAC;IAErB,IAAI,KAAK,EAAE;QACT,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAErE,IAAI,SAAS,IAAI,IAAI,EAAE;YACrB,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;SAC3B;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAbD,4BAaC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,iBAAiB,CAAI,KAAU,EAAE,KAAa,EAAE,UAAU,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC;IAC3F,IAAI,SAAwB,CAAC;IAC7B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC;IAEjC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE;QAC1C,SAAS,GAAG,IAAA,wBAAc,EAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;KACjF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AATD,8CASC;AASD,SAAgB,uCAAuC,CAAI,cAAyC;IAClG,MAAM,eAAe,GAAG,2CAA2C,CAAC;QAClE,cAAc;KACf,CAAC,CAAC;IAEH,OAAO,CAAC,MAAM,EAAE,EAAE;QAChB,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QAEzC,OAAO,CAAC,KAAK,EAAE,EAAE;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC/B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,sBAAsB;QAC7C,CAAC,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAbD,0FAaC;AASD,SAAgB,iCAAiC,CAAI,cAAyC;IAC5F,MAAM,eAAe,GAAG,2CAA2C,CAAC;QAClE,cAAc;KACf,CAAC,CAAC;IAEH,OAAO,CAAC,MAAM,EAAE,EAAE;QAChB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YACvB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;SAC9D;QAED,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QAEzC,OAAO,CAAC,KAAK,EAAE,EAAE;;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC/B,sGAAsG;YACtG,OAAO,MAAA,MAAA,MAAM,CAAC,KAAK,mCAAI,MAAM,CAAC,IAAI,mCAAK,MAAM,CAAC,IAAU,CAAC;QAC3D,CAAC,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAlBD,8EAkBC;AAoBD,SAAgB,2CAA2C,CAAI,MAA4D;IACzH,MAAM,WAAW,GAAG,IAAA,qCAA2B,EAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IACvE,OAAO,CAAC,MAAW,EAAE,EAAE;QACrB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YACvB,OAAO,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,uBAAuB;SAC3C;aAAM;YACL,kCAAkC;YAClC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAA,kDAAwC,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAErG,OAAO,CAAC,KAAkB,EAAE,EAAE;;gBAC5B,oCAAoC;gBACpC,IAAI,UAAU,GAAgB,CAAC,CAAC,CAAC;gBACjC,IAAI,CAAc,CAAC;gBAEnB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;oBACpC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAE5B,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE;wBACtC,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,GAAG,KAAK,EAAE;4BACrC,UAAU,GAAG,CAAC,CAAC;4BACf,MAAM;yBACP;wBACD,sBAAsB;qBACvB;yBAAM;wBACL,MAAM,CAAC,2DAA2D;qBACnE;iBACF;gBAED,IAAI,KAAe,CAAC;gBACpB,IAAI,IAAc,CAAC;gBACnB,IAAI,IAAc,CAAC;gBAEnB,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE;oBACrB,WAAW;oBACX,KAAK,GAAG,SAAS,CAAC;oBAElB,kBAAkB;oBAClB,IAAI,GAAG,MAAA,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,0CAAE,KAAK,CAAC;oBAC3B,IAAI,GAAG,MAAA,KAAK,CAAC,CAAC,CAAC,0CAAE,KAAK,CAAC;iBACxB;qBAAM;oBACL,KAAK,GAAG,MAAA,KAAK,CAAC,UAAU,CAAC,0CAAE,KAAK,CAAC;oBACjC,IAAI,GAAG,MAAA,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,0CAAE,KAAK,CAAC;oBACpC,IAAI,GAAG,MAAA,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,0CAAE,KAAK,CAAC;iBACrC;gBAED,MAAM,IAAI,GAA0C;oBAClD,IAAI;oBACJ,KAAK;oBACL,IAAI;iBACL,CAAC;gBAEF,OAAO,IAAI,CAAC;YACd,CAAC,CAAC;SACH;IACH,CAAC,CAAC;AACJ,CAAC;AAvDD,kGAuDC"}