@dereekb/util 10.0.5 → 10.0.7

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/value/index.ts"],"names":[],"mappings":";;;AAAA,oDAA0B;AAC1B,kDAAwB;AACxB,kDAAwB;AACxB,uDAA6B;AAC7B,iDAAuB;AACvB,qDAA2B;AAC3B,kDAAwB;AACxB,oDAA0B;AAC1B,kDAAwB;AACxB,gDAAsB;AACtB,uDAA6B;AAC7B,kDAAwB;AACxB,qDAA2B;AAC3B,kDAAwB;AACxB,kDAAwB;AACxB,iDAAuB;AACvB,gDAAsB;AACtB,gDAAsB;AACtB,mDAAyB;AACzB,iDAAuB"}

package/src/lib/value/indexed.js

@@ -1,420 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isSelectedIndexDecisionFunction = exports.stepsFromIndex = exports.stepsFromIndexFunction = exports.allIndexesInIndexRange = exports.indexRangeOverlapsIndexRangeFunction = exports.indexRangeOverlapsIndexRange = exports.isIndexRangeInIndexRangeFunction = exports.isIndexRangeInIndexRange = exports.isIndexNumberInIndexRangeFunction = exports.isIndexNumberInIndexRange = exports.indexRangeCheckFunction = exports.asIndexRangeCheckFunctionConfig = exports.indexRangeCheckReaderFunction = exports.wrapIndexRangeFunction = exports.fitToIndexRangeFunction = exports.indexRange = exports.indexRangeReaderPairFactory = exports.sortByIndexRangeAscendingCompareFunction = exports.safeFindBestIndexMatch = exports.findBestIndexMatch = exports.findBestIndexMatchFunction = exports.findItemsByIndex = exports.hashSetForIndexed = exports.minAndMaxIndexItemsFunction = exports.minAndMaxIndex = exports.minAndMaxIndexFunction = exports.computeNextFreeIndexFunction = exports.sortByIndexAscendingCompareFunction = exports.indexDeltaGroup = exports.indexDeltaGroupFunction = exports.readIndexNumber = exports.sortAscendingIndexNumberRefFunction = void 0;
-const set_1 = require("../set/set");
-const array_1 = require("../array/array");
-const object_1 = require("../object/object");
-const set_hashset_1 = require("../set/set.hashset");
-const sort_1 = require("../sort");
-const grouping_1 = require("../grouping");
-const map_key_1 = require("../map/map.key");
-const set_selection_1 = require("../set/set.selection");
-const iterable_1 = require("../iterable/iterable");
-const number_1 = require("../number");
-const array_number_1 = require("../array/array.number");
-/**
- * Creates a SortCompareFunction<T> that sorts by index on IndexRef values.
- *
- * @param input
- * @returns
- */
-function sortAscendingIndexNumberRefFunction() {
-    return (a, b) => a.i - b.i;
-}
-exports.sortAscendingIndexNumberRefFunction = sortAscendingIndexNumberRefFunction;
-/**
- * Reads an IndexNumber from an IndexRef.
- *
- * @param indexRef
- * @returns
- */
-function readIndexNumber(indexRef) {
-    return indexRef.i;
-}
-exports.readIndexNumber = readIndexNumber;
-function indexDeltaGroupFunction(readIndex) {
-    return (inputItems, previousItems) => {
-        const { excluded: newItems, // items without an index and treated as "new"
-        included: currentItems } = (0, grouping_1.separateValues)(inputItems, (x) => {
-            const index = readIndex(x);
-            return index != null;
-        });
-        let deletedItems;
-        if (previousItems != null) {
-            // compute delta if available
-            const currentItemsIndexMap = (0, map_key_1.readKeysToMap)(currentItems, readIndex);
-            deletedItems = previousItems.filter((x) => {
-                const index = readIndex(x);
-                return index != null && !currentItemsIndexMap.has(index);
-            });
-        }
-        return {
-            inputItems,
-            previousItems,
-            newItems,
-            currentItems,
-            deletedItems
-        };
-    };
-}
-exports.indexDeltaGroupFunction = indexDeltaGroupFunction;
-function indexDeltaGroup(readIndex, inputItems, previousItems) {
-    return indexDeltaGroupFunction(readIndex)(inputItems, previousItems);
-}
-exports.indexDeltaGroup = indexDeltaGroup;
-/**
- * Creates a SortCompareFunction<T> that sorts by the read index.
- *
- * @param input
- * @returns
- */
-function sortByIndexAscendingCompareFunction(readIndex) {
-    return (a, b) => readIndex(a) - readIndex(b);
-}
-exports.sortByIndexAscendingCompareFunction = sortByIndexAscendingCompareFunction;
-/**
- * Creates a new ComputeNextFreeIndexFunction.
- */
-function computeNextFreeIndexFunction(readIndex, nextIndex) {
-    const findMinMax = minAndMaxIndexItemsFunction(readIndex);
-    const readNextIndex = nextIndex !== null && nextIndex !== void 0 ? nextIndex : ((x) => readIndex(x) + 1); //return the max index + 1 by default.
-    return (values) => {
-        const minMax = findMinMax(values);
-        const max = minMax === null || minMax === void 0 ? void 0 : minMax.max;
-        if (max != null) {
-            return readNextIndex(max);
-        }
-        else {
-            return 0;
-        }
-    };
-}
-exports.computeNextFreeIndexFunction = computeNextFreeIndexFunction;
-/**
- * Returns a MinAndMaxIndexFunction.
- *
- * @param readIndex
- * @returns
- */
-function minAndMaxIndexFunction(readIndex) {
-    const minAndMaxItems = minAndMaxIndexItemsFunction(readIndex);
-    const fn = ((values) => {
-        const result = minAndMaxItems(values);
-        if (result != null) {
-            const { min, max } = result;
-            return { min: readIndex(min), max: readIndex(max) };
-        }
-        else {
-            return null;
-        }
-    });
-    fn._readIndex = readIndex;
-    return fn;
-}
-exports.minAndMaxIndexFunction = minAndMaxIndexFunction;
-/**
- * Returns the min and max index value from the input IndexRef values.
- *
- * @param values
- * @returns
- */
-function minAndMaxIndex(values) {
-    return minAndMaxIndexFunction(readIndexNumber)(values);
-}
-exports.minAndMaxIndex = minAndMaxIndex;
-/**
- * Returns a MinAndMaxIndexItemsFunction.
- *
- * @param readIndex
- * @returns
- */
-function minAndMaxIndexItemsFunction(readIndex) {
-    const fn = (0, sort_1.minAndMaxFunction)(readIndex);
-    fn._readIndex = readIndex;
-    return fn;
-}
-exports.minAndMaxIndexItemsFunction = minAndMaxIndexItemsFunction;
-/**
- * Creates a HashSet with items keyed by their IndexNumber for the input values.
- *
- * @param input
- * @returns
- */
-function hashSetForIndexed(input) {
-    const values = input != null ? (0, array_1.asArray)(input) : undefined;
-    return new set_hashset_1.HashSet({ readKey: readIndexNumber }, values);
-}
-exports.hashSetForIndexed = hashSetForIndexed;
-/**
- * Convenience function to return all values that match one of the input indexes.
- *
- * @param values
- */
-function findItemsByIndex(config) {
-    const { indexes, values, exclude } = config;
-    return (0, set_1.findValuesFrom)({
-        values,
-        exclude,
-        readKey: readIndexNumber,
-        keysToFind: indexes
-    });
-}
-exports.findItemsByIndex = findItemsByIndex;
-function findBestIndexMatchFunction(items) {
-    // reverse the order so we can return the first item that is less than or equal to the input i
-    const bestMatchArray = (0, iterable_1.iterableToArray)(items, false).sort((0, sort_1.reverseCompareFn)(sortAscendingIndexNumberRefFunction()));
-    const defaultMatch = (0, array_1.lastValue)(bestMatchArray);
-    if (bestMatchArray.length === 0) {
-        throw new Error('findBestIndexMatchFunction() input array cannot be empty.');
-    }
-    else if (bestMatchArray.length === 1) {
-        return () => defaultMatch;
-    }
-    else {
-        return (input) => {
-            const { i } = input;
-            const bestMatch = bestMatchArray.find((matchOption) => i >= matchOption.i);
-            return (bestMatch !== null && bestMatch !== void 0 ? bestMatch : defaultMatch);
-        };
-    }
-}
-exports.findBestIndexMatchFunction = findBestIndexMatchFunction;
-/**
- * Finds the best match given the input.
- *
- * Throws an error if the input is an empty array.
- *
- * @param input
- * @param i
- * @returns
- */
-function findBestIndexMatch(input, i) {
-    return findBestIndexMatchFunction(input)({ i });
-}
-exports.findBestIndexMatch = findBestIndexMatch;
-/**
- * Finds the best match given the input.
- *
- * Returns undefined if the input is an empty array.
- *
- * @param input
- * @param i
- * @returns
- */
-function safeFindBestIndexMatch(input, i) {
-    return input != null && input.length > 0 ? findBestIndexMatch(input, i) : undefined;
-}
-exports.safeFindBestIndexMatch = safeFindBestIndexMatch;
-/**
- * Creates a SortCompareFunction<T> that sorts by the read index.
- *
- * @param input
- * @returns
- */
-function sortByIndexRangeAscendingCompareFunction(readIndexRange) {
-    return (a, b) => {
-        const ra = readIndexRange(a);
-        const rb = readIndexRange(b);
-        const comp = ra.minIndex - rb.minIndex; // sort by smaller minIndexes first
-        if (comp === 0) {
-            return ra.maxIndex - rb.maxIndex; // sort by larger maxIndexes first
-        }
-        else {
-            return comp;
-        }
-    };
-}
-exports.sortByIndexRangeAscendingCompareFunction = sortByIndexRangeAscendingCompareFunction;
-/**
- * Creates a new IndexRangeReaderPairFactory
- *
- * @param reader
- * @returns
- */
-function indexRangeReaderPairFactory(reader) {
-    return (value) => {
-        const range = reader(value);
-        return {
-            range,
-            value
-        };
-    };
-}
-exports.indexRangeReaderPairFactory = indexRangeReaderPairFactory;
-/**
- * Creates an IndexRange from the input.
- *
- * @param input
- * @returns
- */
-function indexRange(input) {
-    if (typeof input === 'number') {
-        return { minIndex: input, maxIndex: input + 1 };
-    }
-    else {
-        return input;
-    }
-}
-exports.indexRange = indexRange;
-function fitToIndexRangeFunction(input) {
-    const { minIndex: min, maxIndex } = input;
-    const max = maxIndex - 1;
-    return (0, number_1.boundNumberFunction)({ min, max, wrap: false });
-}
-exports.fitToIndexRangeFunction = fitToIndexRangeFunction;
-/**
- * Creates a WrapNumberFunction.
- *
- * @param input
- * @param fencePosts
- * @returns
- */
-function wrapIndexRangeFunction(input, fencePosts = true) {
-    const { minIndex: min, maxIndex } = input;
-    const max = maxIndex - 1;
-    return (0, number_1.wrapNumberFunction)({ min, max, fencePosts });
-}
-exports.wrapIndexRangeFunction = wrapIndexRangeFunction;
-function indexRangeCheckReaderFunction(input, read = (x) => x.i) {
-    const rangeCheck = indexRangeCheckFunction(input);
-    return (value) => rangeCheck(read(value));
-}
-exports.indexRangeCheckReaderFunction = indexRangeCheckReaderFunction;
-function indexRangeCheckFunctionConfigToIndexRange({ indexRange, inclusiveMaxIndex }) {
-    if (inclusiveMaxIndex) {
-        const { minIndex, maxIndex: maxIndexInput } = indexRange;
-        const maxIndex = inclusiveMaxIndex ? maxIndexInput + 1 : maxIndexInput;
-        return { minIndex, maxIndex };
-    }
-    else {
-        return indexRange;
-    }
-}
-function asIndexRangeCheckFunctionConfig(input) {
-    return (0, object_1.objectHasKey)(input, 'indexRange') ? input : { indexRange: input, inclusiveMaxIndex: false };
-}
-exports.asIndexRangeCheckFunctionConfig = asIndexRangeCheckFunctionConfig;
-/**
- * Creates an IndexRangeCheckFunction
- *
- * @param range
- */
-function indexRangeCheckFunction(input) {
-    const { minIndex, maxIndex } = indexRangeCheckFunctionConfigToIndexRange(asIndexRangeCheckFunctionConfig(input));
-    return (i) => i >= minIndex && i < maxIndex;
-}
-exports.indexRangeCheckFunction = indexRangeCheckFunction;
-function isIndexNumberInIndexRange(index, indexRange, inclusiveMaxIndex = false) {
-    return isIndexNumberInIndexRangeFunction({ indexRange, inclusiveMaxIndex })(index);
-}
-exports.isIndexNumberInIndexRange = isIndexNumberInIndexRange;
-/**
- * Creates an IsIndexNumberInIndexRangeFunction
- *
- * @param indexRange
- * @returns
- */
-function isIndexNumberInIndexRangeFunction(input) {
-    const { minIndex, maxIndex } = indexRangeCheckFunctionConfigToIndexRange(asIndexRangeCheckFunctionConfig(input));
-    return (index) => {
-        return index >= minIndex && index < maxIndex;
-    };
-}
-exports.isIndexNumberInIndexRangeFunction = isIndexNumberInIndexRangeFunction;
-function isIndexRangeInIndexRange(compareIndexRange, indexRange) {
-    return isIndexRangeInIndexRangeFunction(indexRange)(compareIndexRange);
-}
-exports.isIndexRangeInIndexRange = isIndexRangeInIndexRange;
-/**
- * Creates an IsIndexRangeInIndexRangeFunction
- *
- * @param indexRange
- * @returns
- */
-function isIndexRangeInIndexRangeFunction(input) {
-    const { minIndex, maxIndex } = indexRangeCheckFunctionConfigToIndexRange(asIndexRangeCheckFunctionConfig(input));
-    return (input) => {
-        return input.minIndex >= minIndex && input.maxIndex <= maxIndex;
-    };
-}
-exports.isIndexRangeInIndexRangeFunction = isIndexRangeInIndexRangeFunction;
-function indexRangeOverlapsIndexRange(compareIndexRange, indexRange) {
-    return indexRangeOverlapsIndexRangeFunction(indexRange)(compareIndexRange);
-}
-exports.indexRangeOverlapsIndexRange = indexRangeOverlapsIndexRange;
-/**
- * Creates an IndexRangeOverlapsIndexRangeFunction
- *
- * @param indexRange
- * @returns
- */
-function indexRangeOverlapsIndexRangeFunction(input) {
-    const { minIndex, maxIndex } = indexRangeCheckFunctionConfigToIndexRange(asIndexRangeCheckFunctionConfig(input));
-    return (input) => {
-        return input.minIndex <= maxIndex && input.maxIndex >= minIndex;
-    };
-}
-exports.indexRangeOverlapsIndexRangeFunction = indexRangeOverlapsIndexRangeFunction;
-/**
- * Returns an array of all IndexNumbers within the input IndexRange.
- *
- * maxIndex is exclusive.
- *
- * @param indexRange
- * @returns
- */
-function allIndexesInIndexRange(indexRange) {
-    return (0, array_number_1.range)(indexRange.minIndex, indexRange.maxIndex);
-}
-exports.allIndexesInIndexRange = allIndexesInIndexRange;
-function stepsFromIndexFunction(config) {
-    const { range, fitToRange = false, fencePosts = true, wrapAround: defaultWrapAround = false, steps: defaultStep = 1 } = config;
-    const wrapNumber = wrapIndexRangeFunction(range, fencePosts);
-    const fitNumberFunction = fitToRange ? fitToIndexRangeFunction(range) : (x) => x; // unused if fitToRange is not true
-    const fn = ((startIndex, wrapAround = defaultWrapAround, steps = defaultStep) => {
-        let nextIndex;
-        if (!fitToRange && (startIndex < range.minIndex || startIndex >= range.maxIndex)) {
-            nextIndex = undefined; // start indexes outside the range are considered invalid, unless fitToRange is true.
-        }
-        else {
-            const stepIndex = startIndex + steps;
-            // Perform directional wrapping
-            if (fitToRange || wrapAround) {
-                if (wrapAround) {
-                    // wrap around
-                    nextIndex = wrapNumber(stepIndex);
-                }
-                else {
-                    // fit to range
-                    nextIndex = fitNumberFunction(stepIndex);
-                }
-            }
-            else if (stepIndex < range.minIndex || stepIndex >= range.maxIndex) {
-                nextIndex = undefined; // out of bounds
-            }
-            else {
-                nextIndex = stepIndex;
-            }
-        }
-        return nextIndex;
-    });
-    fn._config = { range, fitToRange, wrapAround: defaultWrapAround, steps: defaultStep };
-    return fn;
-}
-exports.stepsFromIndexFunction = stepsFromIndexFunction;
-/**
- * Steps to the next index in the given direction based on the number of steps to take.
- *
- * Starting indexes less than the minIndex are considered to not exist and will return undefined.
- *
- * When wrapAround is true, indexes that are larger than the max index will be used to find an index that is that many steps into the index range.
- *
- * For instance, an index of 5 on a range of 0 to 3 will return the index 1.
- */
-function stepsFromIndex(range, startIndex, step = 1, wrapAround = false) {
-    return stepsFromIndexFunction({ range })(startIndex, wrapAround, step);
-}
-exports.stepsFromIndex = stepsFromIndex;
-// MARK: Selection
-exports.isSelectedIndexDecisionFunction = (0, set_selection_1.isSelectedDecisionFunctionFactory)({ readKey: readIndexNumber });
-//# sourceMappingURL=indexed.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"indexed.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/value/indexed.ts"],"names":[],"mappings":";;;AAAA,oCAAiE;AACjE,0CAAkE;AAClE,6CAAgD;AAChD,oDAA6C;AAC7C,kCAA+H;AAG/H,0CAA6C;AAC7C,4CAA+C;AAC/C,wDAAyE;AACzE,mDAAuD;AAEvD,sCAAwF;AACxF,wDAA8C;AAsB9C;;;;;GAKG;AACH,SAAgB,mCAAmC;IACjD,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7B,CAAC;AAFD,kFAEC;AAYD;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,QAAkB;IAChD,OAAO,QAAQ,CAAC,CAAC,CAAC;AACpB,CAAC;AAFD,0CAEC;AAuBD,SAAgB,uBAAuB,CAAI,SAAoC;IAC7E,OAAO,CAAC,UAAe,EAAE,aAA0B,EAAE,EAAE;QACrD,MAAM,EACJ,QAAQ,EAAE,QAAQ,EAAE,8CAA8C;QAClE,QAAQ,EAAE,YAAY,EACvB,GAAG,IAAA,yBAAc,EAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;YACnC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO,KAAK,IAAI,IAAI,CAAC;QACvB,CAAC,CAAC,CAAC;QAEH,IAAI,YAA6B,CAAC;QAElC,IAAI,aAAa,IAAI,IAAI,EAAE;YACzB,6BAA6B;YAC7B,MAAM,oBAAoB,GAAG,IAAA,uBAAa,EAAC,YAAY,EAAE,SAAS,CAAC,CAAC;YAEpE,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC3B,OAAO,KAAK,IAAI,IAAI,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC3D,CAAC,CAAC,CAAC;SACJ;QAED,OAAO;YACL,UAAU;YACV,aAAa;YACb,QAAQ;YACR,YAAY;YACZ,YAAY;SACb,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AA9BD,0DA8BC;AAED,SAAgB,eAAe,CAAI,SAAoC,EAAE,UAAe,EAAE,aAA0B;IAClH,OAAO,uBAAuB,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;AACvE,CAAC;AAFD,0CAEC;AAED;;;;;GAKG;AACH,SAAgB,mCAAmC,CAAI,SAA+B;IACpF,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAFD,kFAEC;AAOD;;GAEG;AACH,SAAgB,4BAA4B,CAAI,SAA+B,EAAE,SAAqC;IACpH,MAAM,UAAU,GAAG,2BAA2B,CAAI,SAAS,CAAC,CAAC;IAC7D,MAAM,aAAa,GAAG,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,sCAAsC;IAEpG,OAAO,CAAC,MAAW,EAAE,EAAE;QACrB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,GAAG,CAAC;QAExB,IAAI,GAAG,IAAI,IAAI,EAAE;YACf,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;SAC3B;aAAM;YACL,OAAO,CAAC,CAAC;SACV;IACH,CAAC,CAAC;AACJ,CAAC;AAdD,oEAcC;AASD;;;;;GAKG;AACH,SAAgB,sBAAsB,CAAI,SAA+B;IACvE,MAAM,cAAc,GAAG,2BAA2B,CAAC,SAAS,CAAC,CAAC;IAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,MAAW,EAAE,EAAE;QAC1B,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QAEtC,IAAI,MAAM,IAAI,IAAI,EAAE;YAClB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;YAC5B,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;SACrD;aAAM;YACL,OAAO,IAAI,CAAC;SACb;IACH,CAAC,CAAwC,CAAC;IAC1C,EAAE,CAAC,UAAU,GAAG,SAAS,CAAC;IAC1B,OAAO,EAA+B,CAAC;AACzC,CAAC;AAdD,wDAcC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAqB,MAAW;IAC5D,OAAO,sBAAsB,CAAI,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC;AAC5D,CAAC;AAFD,wCAEC;AASD;;;;;GAKG;AACH,SAAgB,2BAA2B,CAAI,SAA+B;IAC5E,MAAM,EAAE,GAAG,IAAA,wBAAiB,EAAC,SAAS,CAA6C,CAAC;IACpF,EAAE,CAAC,UAAU,GAAG,SAAS,CAAC;IAC1B,OAAO,EAAoC,CAAC;AAC9C,CAAC;AAJD,kEAIC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAqB,KAAuB;IAC3E,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1D,OAAO,IAAI,qBAAO,CAAiB,EAAE,OAAO,EAAE,eAAe,EAAE,EAAE,MAAM,CAAC,CAAC;AAC3E,CAAC;AAHD,8CAGC;AASD;;;;GAIG;AACH,SAAgB,gBAAgB,CAAqB,MAAgC;IACnF,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;IAC5C,OAAO,IAAA,oBAAc,EAAC;QACpB,MAAM;QACN,OAAO;QACP,OAAO,EAAE,eAAe;QACxB,UAAU,EAAE,OAAO;KACpB,CAAC,CAAC;AACL,CAAC;AARD,4CAQC;AAOD,SAAgB,0BAA0B,CAAqB,KAAkB;IAC/E,8FAA8F;IAC9F,MAAM,cAAc,GAAG,IAAA,0BAAe,EAAI,KAAK,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAA,uBAAgB,EAAC,mCAAmC,EAAE,CAAC,CAAC,CAAC;IACtH,MAAM,YAAY,GAAG,IAAA,iBAAS,EAAC,cAAc,CAAC,CAAC;IAE/C,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;KAC9E;SAAM,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;QACtC,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC;KAC3B;SAAM;QACL,OAAO,CAAC,KAAK,EAAE,EAAE;YACf,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;YACpB,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3E,OAAO,CAAC,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,YAAY,CAAM,CAAC;QAC1C,CAAC,CAAC;KACH;AACH,CAAC;AAhBD,gEAgBC;AAED;;;;;;;;GAQG;AACH,SAAgB,kBAAkB,CAAqB,KAAU,EAAE,CAAc;IAC/E,OAAO,0BAA0B,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAClD,CAAC;AAFD,gDAEC;AAED;;;;;;;;GAQG;AACH,SAAgB,sBAAsB,CAAqB,KAAiB,EAAE,CAAc;IAC1F,OAAO,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACtF,CAAC;AAFD,wDAEC;AAsBD;;;;;GAKG;AACH,SAAgB,wCAAwC,CAAI,cAAyC;IACnG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACd,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAE7B,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,mCAAmC;QAE3E,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,OAAO,EAAE,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,kCAAkC;SACrE;aAAM;YACL,OAAO,IAAI,CAAC;SACb;IACH,CAAC,CAAC;AACJ,CAAC;AAbD,4FAaC;AAeD;;;;;GAKG;AACH,SAAgB,2BAA2B,CAAI,MAAiC;IAC9E,OAAO,CAAC,KAAQ,EAAE,EAAE;QAClB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO;YACL,KAAK;YACL,KAAK;SACN,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AARD,kEAQC;AAOD;;;;;GAKG;AACH,SAAgB,UAAU,CAAC,KAAsB;IAC/C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC7B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;KACjD;SAAM;QACL,OAAO,KAAK,CAAC;KACd;AACH,CAAC;AAND,gCAMC;AAID,SAAgB,uBAAuB,CAAC,KAAiB;IACvD,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC1C,MAAM,GAAG,GAAG,QAAQ,GAAG,CAAC,CAAC;IACzB,OAAO,IAAA,4BAAmB,EAAc,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AACrE,CAAC;AAJD,0DAIC;AAID;;;;;;GAMG;AACH,SAAgB,sBAAsB,CAAC,KAAiB,EAAE,aAAsB,IAAI;IAClF,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC1C,MAAM,GAAG,GAAG,QAAQ,GAAG,CAAC,CAAC;IACzB,OAAO,IAAA,2BAAkB,EAAc,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC;AACnE,CAAC;AAJD,wDAIC;AAcD,SAAgB,6BAA6B,CAAI,KAA8B,EAAE,OAA6B,CAAC,CAAI,EAAE,EAAE,CAAE,CAAyB,CAAC,CAAC;IAClJ,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,CAAC,KAAQ,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/C,CAAC;AAHD,sEAGC;AAkBD,SAAS,yCAAyC,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAA4B;IAC5G,IAAI,iBAAiB,EAAE;QACrB,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,UAAU,CAAC;QACzD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QACvE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;KAC/B;SAAM;QACL,OAAO,UAAU,CAAC;KACnB;AACH,CAAC;AAID,SAAgB,+BAA+B,CAAC,KAA8B;IAC5E,OAAO,IAAA,qBAAY,EAA2B,KAAiC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAE,KAAkC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAmB,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;AACvM,CAAC;AAFD,0EAEC;AAED;;;;GAIG;AACH,SAAgB,uBAAuB,CAAC,KAA8B;IACpE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,yCAAyC,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,QAAQ,IAAI,CAAC,GAAG,QAAQ,CAAC;AAC9C,CAAC;AAHD,0DAGC;AAQD,SAAgB,yBAAyB,CAAC,KAAkB,EAAE,UAAsB,EAAE,iBAAiB,GAAG,KAAK;IAC7G,OAAO,iCAAiC,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACrF,CAAC;AAFD,8DAEC;AAED;;;;;GAKG;AACH,SAAgB,iCAAiC,CAAC,KAA8B;IAC9E,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,yCAAyC,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,OAAO,CAAC,KAAkB,EAAE,EAAE;QAC5B,OAAO,KAAK,IAAI,QAAQ,IAAI,KAAK,GAAG,QAAQ,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AALD,8EAKC;AAOD,SAAgB,wBAAwB,CAAC,iBAA6B,EAAE,UAAsB;IAC5F,OAAO,gCAAgC,CAAC,UAAU,CAAC,CAAC,iBAAiB,CAAC,CAAC;AACzE,CAAC;AAFD,4DAEC;AAED;;;;;GAKG;AACH,SAAgB,gCAAgC,CAAC,KAA8B;IAC7E,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,yCAAyC,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,OAAO,CAAC,KAAiB,EAAE,EAAE;QAC3B,OAAO,KAAK,CAAC,QAAQ,IAAI,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAClE,CAAC,CAAC;AACJ,CAAC;AALD,4EAKC;AAOD,SAAgB,4BAA4B,CAAC,iBAA6B,EAAE,UAAsB;IAChG,OAAO,oCAAoC,CAAC,UAAU,CAAC,CAAC,iBAAiB,CAAC,CAAC;AAC7E,CAAC;AAFD,oEAEC;AAED;;;;;GAKG;AACH,SAAgB,oCAAoC,CAAC,KAA8B;IACjF,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,yCAAyC,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,OAAO,CAAC,KAAiB,EAAE,EAAE;QAC3B,OAAO,KAAK,CAAC,QAAQ,IAAI,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAClE,CAAC,CAAC;AACJ,CAAC;AALD,oFAKC;AAED;;;;;;;GAOG;AACH,SAAgB,sBAAsB,CAAC,UAAsB;IAC3D,OAAO,IAAA,oBAAK,EAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;AACzD,CAAC;AAFD,wDAEC;AAuBD,SAAgB,sBAAsB,CAAC,MAAoC;IACzE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,KAAK,EAAE,UAAU,GAAG,IAAI,EAAE,UAAU,EAAE,iBAAiB,GAAG,KAAK,EAAE,KAAK,EAAE,WAAW,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC;IAC/H,MAAM,UAAU,GAAG,sBAAsB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC7D,MAAM,iBAAiB,GAAG,UAAU,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,mCAAmC;IAE7H,MAAM,EAAE,GAAG,CAAC,CAAC,UAAkB,EAAE,UAAU,GAAG,iBAAiB,EAAE,KAAK,GAAG,WAAW,EAAE,EAAE;QACtF,IAAI,SAAwB,CAAC;QAE7B,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,IAAI,UAAU,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE;YAChF,SAAS,GAAG,SAAS,CAAC,CAAC,qFAAqF;SAC7G;aAAM;YACL,MAAM,SAAS,GAAG,UAAU,GAAG,KAAK,CAAC;YAErC,+BAA+B;YAC/B,IAAI,UAAU,IAAI,UAAU,EAAE;gBAC5B,IAAI,UAAU,EAAE;oBACd,cAAc;oBACd,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;iBACnC;qBAAM;oBACL,eAAe;oBACf,SAAS,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;iBAC1C;aACF;iBAAM,IAAI,SAAS,GAAG,KAAK,CAAC,QAAQ,IAAI,SAAS,IAAI,KAAK,CAAC,QAAQ,EAAE;gBACpE,SAAS,GAAG,SAAS,CAAC,CAAC,gBAAgB;aACxC;iBAAM;gBACL,SAAS,GAAG,SAAS,CAAC;aACvB;SACF;QAED,OAAO,SAAS,CAAC;IACnB,CAAC,CAAqC,CAAC;IACvC,EAAE,CAAC,OAAO,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,iBAAiB,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;IACtF,OAAO,EAA4B,CAAC;AACtC,CAAC;AAjCD,wDAiCC;AAED;;;;;;;;GAQG;AACH,SAAgB,cAAc,CAAC,KAAiB,EAAE,UAAkB,EAAE,IAAI,GAAG,CAAC,EAAE,UAAU,GAAG,KAAK;IAChG,OAAO,sBAAsB,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAFD,wCAEC;AAED,kBAAkB;AACL,QAAA,+BAA+B,GAAG,IAAA,iDAAiC,EAAwB,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC"}

package/src/lib/value/label.js

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

package/src/lib/value/label.js.map

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

package/src/lib/value/map.js

@@ -1,107 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.chainMapFunction = exports.chainMapSameFunctions = exports.mapFunctionOutput = exports.wrapMapFunctionOutput = exports.mapFunctionOutputPair = exports.isMapIdentityFunction = exports.mapIdentityFunction = exports.MAP_IDENTITY = exports.mapArrayFunction = exports.mapMaybeFunction = void 0;
-const array_1 = require("../array/array");
-const array_value_1 = require("../array/array.value");
-const build_1 = require("./build");
-const maybe_1 = require("./maybe");
-/**
- * Turns a normal MapFunction into one that passes through Maybe values without attempting to map them.
- *
- * @param mapFunction
- * @returns
- */
-function mapMaybeFunction(mapFunction) {
-    return (input) => {
-        const output = (0, maybe_1.isMaybeNot)(input) ? input : mapFunction(input);
-        return output;
-    };
-}
-exports.mapMaybeFunction = mapMaybeFunction;
-function mapArrayFunction(mapFunction) {
-    return (input) => input.map(mapFunction);
-}
-exports.mapArrayFunction = mapArrayFunction;
-const MAP_IDENTITY = (input) => input;
-exports.MAP_IDENTITY = MAP_IDENTITY;
-function mapIdentityFunction() {
-    return exports.MAP_IDENTITY;
-}
-exports.mapIdentityFunction = mapIdentityFunction;
-function isMapIdentityFunction(fn) {
-    return fn === exports.MAP_IDENTITY;
-}
-exports.isMapIdentityFunction = isMapIdentityFunction;
-/**
- * Wraps a MapFunction to instead provide the input and output values.
- *
- * @param fn
- * @returns
- */
-function mapFunctionOutputPair(fn) {
-    return (input) => {
-        const output = fn(input);
-        return {
-            input,
-            output
-        };
-    };
-}
-exports.mapFunctionOutputPair = mapFunctionOutputPair;
-/**
- *
- * @param fn
- * @returns
- */
-function wrapMapFunctionOutput(fn) {
-    return (input) => {
-        const result = fn(input);
-        return mapFunctionOutput(result, input);
-    };
-}
-exports.wrapMapFunctionOutput = wrapMapFunctionOutput;
-function mapFunctionOutput(output, input) {
-    return (0, build_1.build)({
-        base: output,
-        build: (x) => {
-            x._input = input;
-        }
-    });
-}
-exports.mapFunctionOutput = mapFunctionOutput;
-// MARK: Chaining
-/**
- * Chains together multiple MapSameFunctions in the same order. Functions that are not defined are ignored.
- *
- * @param fns
- */
-function chainMapSameFunctions(input) {
-    const fns = (0, array_value_1.filterMaybeValues)((0, array_1.asArray)(input).filter((x) => !isMapIdentityFunction(x))); // remove all identify functions too
-    let fn;
-    switch (fns.length) {
-        case 0:
-            fn = mapIdentityFunction();
-            break;
-        case 1:
-            fn = fns[0];
-            break;
-        default:
-            fn = fns[0];
-            for (let i = 1; i < fns.length; i += 1) {
-                fn = chainMapFunction(fn, fns[i]);
-            }
-            break;
-    }
-    return fn;
-}
-exports.chainMapSameFunctions = chainMapSameFunctions;
-function chainMapFunction(a, b, apply = true) {
-    if (apply && b != null) {
-        return (x) => b(a(x));
-    }
-    else {
-        return a;
-    }
-}
-exports.chainMapFunction = chainMapFunction;
-//# sourceMappingURL=map.js.map

package/src/lib/value/map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"map.js","sourceRoot":"","sources":["../../../../../../packages/util/src/lib/value/map.ts"],"names":[],"mappings":";;;AAAA,0CAAuD;AACvD,sDAAyD;AAEzD,mCAAgC;AAChC,mCAAqC;AAerC;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAO,WAA8B;IACnE,OAAO,CAAC,KAAe,EAAE,EAAE;QACzB,MAAM,MAAM,GAAa,IAAA,kBAAU,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxE,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AALD,4CAKC;AA6BD,SAAgB,gBAAgB,CAAO,WAA8B;IACnE,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAChD,CAAC;AAFD,4CAEC;AAEM,MAAM,YAAY,GAAG,CAAC,KAAc,EAAE,EAAE,CAAC,KAAK,CAAC;AAAzC,QAAA,YAAY,gBAA6B;AAEtD,SAAgB,mBAAmB;IACjC,OAAO,oBAAiC,CAAC;AAC3C,CAAC;AAFD,kDAEC;AAED,SAAgB,qBAAqB,CAAC,EAAW;IAC/C,OAAO,EAAE,KAAK,oBAAY,CAAC;AAC7B,CAAC;AAFD,sDAEC;AAQD;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAiB,EAAqB;IACzE,OAAO,CAAC,KAAQ,EAAE,EAAE;QAClB,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAEzB,OAAO;YACL,KAAK;YACL,MAAM;SACP,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AATD,sDASC;AAQD;;;;GAIG;AACH,SAAgB,qBAAqB,CAAgC,EAAqB;IACxF,OAAO,CAAC,KAAQ,EAAE,EAAE;QAClB,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC;AACJ,CAAC;AALD,sDAKC;AAED,SAAgB,iBAAiB,CAAgC,MAAS,EAAE,KAAQ;IAClF,OAAO,IAAA,aAAK,EAA0B;QACpC,IAAI,EAAE,MAAM;QACZ,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE;YACX,CAAC,CAAC,MAAM,GAAG,KAA0C,CAAC;QACxD,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAPD,8CAOC;AAED,iBAAiB;AACjB;;;;GAIG;AACH,SAAgB,qBAAqB,CAAI,KAA8C;IACrF,MAAM,GAAG,GAAG,IAAA,+BAAiB,EAAC,IAAA,eAAO,EAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAoC;IAC5H,IAAI,EAAsB,CAAC;IAE3B,QAAQ,GAAG,CAAC,MAAM,EAAE;QAClB,KAAK,CAAC;YACJ,EAAE,GAAG,mBAAmB,EAAE,CAAC;YAC3B,MAAM;QACR,KAAK,CAAC;YACJ,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,MAAM;QACR;YACE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;gBACtC,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aACnC;YACD,MAAM;KACT;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AArBD,sDAqBC;AAkBD,SAAgB,gBAAgB,CAAU,CAAoB,EAAE,CAA2B,EAAE,KAAK,GAAG,IAAI;IACvG,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE;QACtB,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACvB;SAAM;QACL,OAAO,CAAC,CAAC;KACV;AACH,CAAC;AAND,4CAMC"}