@terascope/core-utils 2.0.0-dev.10

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,17 @@
+<!-- THIS FILE IS AUTO-GENERATED, EDIT docs/packages/core-utils/overview.md -->
+
+# Core Utils
+
+> A collection of Teraslice Core Utilities
+
+This is a package within the [Teraslice](https://github.com/terascope/teraslice) monorepo. See our [documentation](https://terascope.github.io/teraslice/docs/packages/core-utils/overview) for more information or the [issues](https://github.com/terascope/teraslice/issues?q=is%3Aopen+is%3Aissue+label%3Apkg%2Fcore-utils) associated with this package
+
+## Contributing
+
+Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
+
+Please make sure to update tests as appropriate.
+
+## License
+
+[MIT](./LICENSE) licensed.

package/dist/src/arrays.d.ts

@@ -0,0 +1,59 @@
+import { Many, ListOfRecursiveArraysOrValues, TypedArray } from '@terascope/types';
+/** A native implementation of lodash flatten */
+export declare function flatten<T>(val: Many<T[]>): T[];
+export declare function flattenDeep<T>(val: ListOfRecursiveArraysOrValues<T>): T[];
+/** A simplified implementation of lodash castArray */
+export declare function castArray<T>(input: T | undefined | null | (T[]) | (readonly T[])): T[];
+/**
+ * Concat and unique the items in the array
+ * Any non-array value will be converted to an array
+*/
+export declare function concat<T>(arr: T | (T[]), arr1?: T | (T[])): readonly T[];
+export declare function concat<T>(arr: readonly T[], arr1?: readonly T[]): readonly T[];
+export declare function concat<T>(arr: readonly T[], arr1?: T | (T[])): readonly T[];
+/** A native implementation of lodash uniq */
+export declare function uniq<T>(arr: T[] | Set<T>): T[];
+/** Sort an arr or set */
+export declare function sort<T>(arr: T[] | (readonly T[]) | Set<T>, compare?: (a: T, b: T) => number): T[];
+/** Sort by path or function that returns the values to sort with */
+export declare function sortBy<T, V = any>(arr: T[] | Set<T>, fnOrPath: ((value: T) => V) | string): T[];
+/**
+ * Get the unique values by a path or function that returns the unique values
+*/
+export declare function uniqBy<T, V = any>(values: T[] | readonly T[], fnOrPath: ((value: T) => V) | string): T[];
+/** A native implementation of lodash times */
+export declare function times(n: number): number[];
+export declare function times<T>(n: number, fn: (index: number) => T): T[];
+/** Like times but an iterable */
+export declare function timesIter(n: number): Iterable<number>;
+export declare function timesIter<T>(n: number, fn: (index: number) => T): Iterable<T>;
+/** Chunk an array into specific sizes */
+export declare function chunk<T>(dataArray: Iterable<T>, size: number): T[][];
+/** Chunk an array into specific size, by using an iterator */
+export declare function chunkIter<T>(dataArray: Iterable<T>, size: number): Iterable<T[]>;
+/** Safely check if an array, object, map, set has a key */
+export declare function includes(input: unknown, key: string): boolean;
+/**
+ * If the input is an array it will return the first item
+ * else if it will return the input
+ */
+export declare function getFirst<T>(input: T | (T[]) | (readonly T[])): T | undefined;
+/**
+ * If the input is an array it will return the first item
+ * else if it will return the input
+ */
+export declare function getLast<T>(input: T | (T[]) | (readonly T[])): T | undefined;
+/**
+ * Check if an input is an array, just Array.isArray
+*/
+export declare function isArray<T = any[]>(input: unknown): input is T;
+/**
+ * Check if an input is an TypedArray instance like: Uint8Array or Uint16Array.
+ * This excludes nodejs Buffers since they aren't really the same.
+*/
+export declare function isTypedArray<T = TypedArray>(input: unknown): input is T;
+/**
+ * Check if an input is an TypedArray or Array instance
+*/
+export declare function isArrayLike<T = any[]>(input: unknown): input is T;
+//# sourceMappingURL=arrays.d.ts.map

package/dist/src/arrays.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrays.d.ts","sourceRoot":"","sources":["../../src/arrays.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,6BAA6B,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAKnF,gDAAgD;AAChD,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAE9C;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,6BAA6B,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAOzE;AAED,sDAAsD;AACtD,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,GAAG,IAAI,GAAC,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAKlF;AAED;;;EAGE;AACF,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AACtE,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;AAChF,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAQ3E,6CAA6C;AAC7C,wBAAgB,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAG9C;AAED,yBAAyB;AACzB,wBAAgB,IAAI,CAAC,CAAC,EAClB,GAAG,EAAE,CAAC,EAAE,GAAC,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAChC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GACjC,CAAC,EAAE,CAIL;AAOD,oEAAoE;AACpE,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAC7B,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,EACjB,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,GACrC,CAAC,EAAE,CAeL;AASD;;EAEE;AACF,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAC7B,MAAM,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EAC1B,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,GACrC,CAAC,EAAE,CAWL;AAED,8CAA8C;AAC9C,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;AAC3C,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;AAMnE,iCAAiC;AACjC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;AACvD,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AAQ/E,yCAAyC;AACzC,wBAAgB,KAAK,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAEpE;AAED,8DAA8D;AAC9D,wBAAiB,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAsBjF;AAcD,2DAA2D;AAC3D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAS7D;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAExE;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAEvE;AAED;;EAEE;AACF,wBAAgB,OAAO,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,CAAC,CAE7D;AAED;;;EAGE;AACF,wBAAgB,YAAY,CAAC,CAAC,GAAG,UAAU,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,CAAC,CAEvE;AAED;;EAEE;AACF,wBAAgB,WAAW,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,CAAC,CAEjE"}

package/dist/src/arrays.js

@@ -0,0 +1,180 @@
+import { get } from './deps.js';
+import { isBuffer } from './buffers.js';
+import { isKey } from './objects.js';
+/** A native implementation of lodash flatten */
+export function flatten(val) {
+    return val.reduce((a, b) => a.concat(b), []);
+}
+export function flattenDeep(val) {
+    return val.reduce((a, b) => {
+        if (isArrayLike(b)) {
+            return a.concat(flattenDeep(b));
+        }
+        return a.concat(b);
+    }, []);
+}
+/** A simplified implementation of lodash castArray */
+export function castArray(input) {
+    if (input == null)
+        return [];
+    if (isArrayLike(input))
+        return input;
+    if (input instanceof Set)
+        return [...input];
+    return [input];
+}
+export function concat(arr, arr1) {
+    return uniq(castArray(arr)
+        .concat(arr1 ? castArray(arr1) : []));
+}
+/** A native implementation of lodash uniq */
+export function uniq(arr) {
+    if (arr instanceof Set)
+        return [...arr];
+    return [...new Set(arr)];
+}
+/** Sort an arr or set */
+export function sort(arr, compare) {
+    if (arr instanceof Set)
+        return [...arr].sort(compare);
+    if (isArrayLike(arr))
+        return arr.sort(compare);
+    return arr;
+}
+const numLike = {
+    bigint: true,
+    number: true,
+};
+/** Sort by path or function that returns the values to sort with */
+export function sortBy(arr, fnOrPath) {
+    return sort(arr, (a, b) => {
+        const aVal = _getValFnOrPath(a, fnOrPath);
+        const bVal = _getValFnOrPath(b, fnOrPath);
+        if (isKey(numLike, typeof aVal) && isKey(numLike, typeof bVal)) {
+            return aVal - bVal;
+        }
+        if (aVal < bVal) {
+            return -1;
+        }
+        if (aVal > bVal) {
+            return 1;
+        }
+        return 0;
+    });
+}
+function _getValFnOrPath(input, fnOrPath) {
+    const uniqVal = typeof fnOrPath === 'function'
+        ? fnOrPath(input)
+        : get(input, fnOrPath);
+    return uniqVal;
+}
+/**
+ * Get the unique values by a path or function that returns the unique values
+*/
+export function uniqBy(values, fnOrPath) {
+    const _values = new Set();
+    const result = [];
+    for (const value of values) {
+        const uniqVal = _getValFnOrPath(value, fnOrPath);
+        if (uniqVal != null && !_values.has(uniqVal)) {
+            _values.add(uniqVal);
+            result.push(value);
+        }
+    }
+    return result;
+}
+export function times(n, fn) {
+    if (fn)
+        return Array.from({ length: n }, (_, x) => fn(x));
+    return Array.from({ length: n }, (_, x) => x);
+}
+export function* timesIter(n, fn) {
+    for (let i = 0; i < n; i++) {
+        if (fn)
+            yield fn(i);
+        yield i;
+    }
+}
+/** Chunk an array into specific sizes */
+export function chunk(dataArray, size) {
+    return Array.from(chunkIter(dataArray, size));
+}
+/** Chunk an array into specific size, by using an iterator */
+export function* chunkIter(dataArray, size) {
+    if (size < 1) {
+        throw new RangeError(`Expected chunk size to be >0, got ${size}`);
+    }
+    if (isArrayLike(dataArray)) {
+        yield* _chunkArrayIterator(dataArray, size);
+        return;
+    }
+    let batch = [];
+    for (const data of dataArray) {
+        batch.push(data);
+        if (batch.length === size) {
+            yield batch;
+            batch = [];
+        }
+    }
+    if (batch.length) {
+        yield batch;
+    }
+}
+/**
+ * This is an optimization for array like chunking
+*/
+function* _chunkArrayIterator(arr, size) {
+    for (let x = 0; x < Math.ceil(arr.length / size); x++) {
+        const start = x * size;
+        const end = start + size;
+        yield arr.slice(start, end);
+    }
+}
+/** Safely check if an array, object, map, set has a key */
+export function includes(input, key) {
+    if (!input)
+        return false;
+    if (isArrayLike(input) || typeof input === 'string')
+        return input.includes(key);
+    const obj = input;
+    if (typeof obj.has === 'function')
+        return obj.has(key);
+    if (typeof obj === 'object') {
+        return key in obj;
+    }
+    return false;
+}
+/**
+ * If the input is an array it will return the first item
+ * else if it will return the input
+ */
+export function getFirst(input) {
+    return castArray(input)[0];
+}
+/**
+ * If the input is an array it will return the first item
+ * else if it will return the input
+ */
+export function getLast(input) {
+    return castArray(input).slice(-1)[0];
+}
+/**
+ * Check if an input is an array, just Array.isArray
+*/
+export function isArray(input) {
+    return Array.isArray(input);
+}
+/**
+ * Check if an input is an TypedArray instance like: Uint8Array or Uint16Array.
+ * This excludes nodejs Buffers since they aren't really the same.
+*/
+export function isTypedArray(input) {
+    return ArrayBuffer.isView(input) && !isBuffer(input);
+}
+/**
+ * Check if an input is an TypedArray or Array instance
+*/
+export function isArrayLike(input) {
+    return Array.isArray(input) || isTypedArray(input);
+}
+//# sourceMappingURL=arrays.js.map

package/dist/src/arrays.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../../src/arrays.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAErC,gDAAgD;AAChD,MAAM,UAAU,OAAO,CAAI,GAAc;IACrC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,UAAU,WAAW,CAAI,GAAqC;IAChE,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAO,EAAE;QAC5B,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,OAAQ,CAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAQ,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,EAAE,EAAE,CAAQ,CAAC;AAClB,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,SAAS,CAAI,KAAgD;IACzE,IAAI,KAAK,IAAI,IAAI;QAAE,OAAO,EAAE,CAAC;IAC7B,IAAI,WAAW,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,IAAI,KAAK,YAAY,GAAG;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IAC5C,OAAO,CAAC,KAAU,CAAC,CAAC;AACxB,CAAC;AASD,MAAM,UAAU,MAAM,CAAI,GAAY,EAAE,IAAc;IAClD,OAAO,IAAI,CACP,SAAS,CAAC,GAAG,CAAC;SACT,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAC3C,CAAC;AACN,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,IAAI,CAAI,GAAiB;IACrC,IAAI,GAAG,YAAY,GAAG;QAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IACxC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,yBAAyB;AACzB,MAAM,UAAU,IAAI,CAChB,GAAgC,EAChC,OAAgC;IAEhC,IAAI,GAAG,YAAY,GAAG;QAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtD,IAAI,WAAW,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/C,OAAO,GAAU,CAAC;AACtB,CAAC;AAED,MAAM,OAAO,GAAG;IACZ,MAAM,EAAE,IAAI;IACZ,MAAM,EAAE,IAAI;CACN,CAAC;AAEX,oEAAoE;AACpE,MAAM,UAAU,MAAM,CAClB,GAAiB,EACjB,QAAoC;IAEpC,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,eAAe,CAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,eAAe,CAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QAChD,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;YAC7D,OAAQ,IAAY,GAAI,IAAY,CAAC;QACzC,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YACd,OAAO,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YACd,OAAO,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACb,CAAC,CAAC,CAAC;AACP,CAAC;AAED,SAAS,eAAe,CAAa,KAAQ,EAAE,QAAoC;IAC/E,MAAM,OAAO,GAAG,OAAO,QAAQ,KAAK,UAAU;QAC1C,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC3B,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;EAEE;AACF,MAAM,UAAU,MAAM,CAClB,MAA0B,EAC1B,QAAoC;IAEpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;IAC7B,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjD,IAAI,OAAO,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAKD,MAAM,UAAU,KAAK,CAAI,CAAS,EAAE,EAAyB;IACzD,IAAI,EAAE;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAKD,MAAM,SAAS,CAAC,CAAC,SAAS,CAAI,CAAS,EAAE,EAAyB;IAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,EAAE;YAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC;IACZ,CAAC;AACL,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,KAAK,CAAI,SAAsB,EAAE,IAAY;IACzD,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,8DAA8D;AAC9D,MAAM,SAAS,CAAC,CAAC,SAAS,CAAI,SAAsB,EAAE,IAAY;IAC9D,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACX,MAAM,IAAI,UAAU,CAAC,qCAAqC,IAAI,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC5C,OAAO;IACX,CAAC;IAED,IAAI,KAAK,GAAQ,EAAE,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACf,CAAC;IACL,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,MAAM,KAAK,CAAC;IAChB,CAAC;AACL,CAAC;AAED;;EAEE;AACF,QAAQ,CAAC,CAAC,mBAAmB,CAAI,GAAQ,EAAE,IAAY;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC;QAEzB,MAAM,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;AACL,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,QAAQ,CAAC,KAAc,EAAE,GAAW;IAChD,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAChF,MAAM,GAAG,GAAG,KAAY,CAAC;IACzB,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,UAAU;QAAE,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,GAAG,IAAI,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAI,KAA6B;IACrD,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAI,KAA6B;IACpD,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;EAEE;AACF,MAAM,UAAU,OAAO,CAAY,KAAc;IAC7C,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;EAGE;AACF,MAAM,UAAU,YAAY,CAAiB,KAAc;IACvD,OAAO,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzD,CAAC;AAED;;EAEE;AACF,MAAM,UAAU,WAAW,CAAY,KAAc;IACjD,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;AACvD,CAAC"}

package/dist/src/big-lru-map.d.ts

@@ -0,0 +1,14 @@
+import { TypedArray } from '@terascope/types';
+import { LRUMap } from 'mnemonist';
+/**
+* This used to ignore the init size of
+* the array in LRUMap. Doing this will avoid
+* running out of memory at 12 million records.
+* */
+export declare class FlexibleArray {
+    constructor();
+}
+export declare class BigLRUMap<V> extends LRUMap<string | number, V> {
+    constructor(mapSize: number, keyArray?: FlexibleArray | TypedArray, valueArray?: FlexibleArray | TypedArray);
+}
+//# sourceMappingURL=big-lru-map.d.ts.map

package/dist/src/big-lru-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"big-lru-map.d.ts","sourceRoot":"","sources":["../../src/big-lru-map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAGnC;;;;IAII;AACJ,qBAAa,aAAa;;CAIzB;AAED,qBAAa,SAAS,CAAC,CAAC,CAAE,SAAQ,MAAM,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC;gBAEpD,OAAO,EAAE,MAAM,EACf,QAAQ,GAAE,aAAa,GAAG,UAA0B,EACpD,UAAU,GAAE,aAAa,GAAG,UAA0B;CAM7D"}

package/dist/src/big-lru-map.js

@@ -0,0 +1,20 @@
+import { LRUMap } from 'mnemonist';
+import { BigMap } from './big-map.js';
+/**
+* This used to ignore the init size of
+* the array in LRUMap. Doing this will avoid
+* running out of memory at 12 million records.
+* */
+export class FlexibleArray {
+    constructor() {
+        return [];
+    }
+}
+export class BigLRUMap extends LRUMap {
+    constructor(mapSize, keyArray = FlexibleArray, valueArray = FlexibleArray) {
+        super(keyArray, valueArray, mapSize);
+        // @ts-expect-error
+        this.items = new BigMap();
+    }
+}
+//# sourceMappingURL=big-lru-map.js.map

package/dist/src/big-lru-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"big-lru-map.js","sourceRoot":"","sources":["../../src/big-lru-map.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC;;;;IAII;AACJ,MAAM,OAAO,aAAa;IACtB;QACI,OAAO,EAAE,CAAC;IACd,CAAC;CACJ;AAED,MAAM,OAAO,SAAa,SAAQ,MAA0B;IACxD,YACI,OAAe,EACf,WAAuC,aAAa,EACpD,aAAyC,aAAa;QAEtD,KAAK,CAAC,QAAe,EAAE,UAAiB,EAAE,OAAO,CAAC,CAAC;QACnD,mBAAmB;QACnB,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;IAC9B,CAAC;CACJ"}

package/dist/src/big-map.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Avoid v8 maximum size for Map by spreading the cache across multiple Maps.
+ * This class has the same API as Map but minus more differences in ->set and ->forEach
+ */
+export declare class BigMap<K, V> {
+    /**
+     * In some cache settings key evictions may not be able to keep up with the addition
+     * of new keys, setting the max size at 8.7M keys solves this issue
+     */
+    static DEFAULT_MAX_SIZE: number;
+    readonly maxMapSize: number;
+    private _maps;
+    private _current;
+    private _simpleMode;
+    constructor(entries?: readonly (readonly [K, V])[] | null);
+    set(key: K, value: V): Map<K, V>;
+    has(key: K): boolean;
+    get(key: K): V | undefined;
+    delete(key: K): boolean;
+    clear(): void;
+    get size(): number;
+    forEach(callbackFn: (value: V, key: K, map: BigMap<K, V>) => void, thisArg?: unknown): void;
+    entries(): IterableIterator<[K, V]>;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+    [Symbol.iterator](): IterableIterator<[K, V]>;
+}
+//# sourceMappingURL=big-map.d.ts.map

package/dist/src/big-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"big-map.d.ts","sourceRoot":"","sources":["../../src/big-map.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC;IACpB;;;OAGG;IACH,MAAM,CAAC,gBAAgB,SAAkC;IAEzD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,QAAQ,CAAY;IAC5B,OAAO,CAAC,WAAW,CAAU;gBAEjB,OAAO,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI;IAOzD,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAUhC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAOpB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAO1B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAavB,KAAK,IAAI,IAAI;IAab,IAAI,IAAI,IAAI,MAAM,CAYjB;IAED,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,IAAI;IAY3F,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAOnC,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAO3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAO7B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAMhD"}

package/dist/src/big-map.js

@@ -0,0 +1,148 @@
+const defaultMaxSize = 2 ** 24;
+/**
+ * Avoid v8 maximum size for Map by spreading the cache across multiple Maps.
+ * This class has the same API as Map but minus more differences in ->set and ->forEach
+ */
+export class BigMap {
+    /**
+     * In some cache settings key evictions may not be able to keep up with the addition
+     * of new keys, setting the max size at 8.7M keys solves this issue
+     */
+    static DEFAULT_MAX_SIZE = Math.floor(defaultMaxSize / 2);
+    maxMapSize;
+    _maps;
+    _current;
+    _simpleMode;
+    constructor(entries) {
+        this.maxMapSize = BigMap.DEFAULT_MAX_SIZE;
+        this._current = new Map(entries);
+        this._simpleMode = true;
+        this._maps = [this._current];
+    }
+    set(key, value) {
+        if (this._current.size >= this.maxMapSize) {
+            this._current = new Map();
+            this._maps.push(this._current);
+            this._simpleMode = false;
+        }
+        return this._current.set(key, value);
+    }
+    has(key) {
+        if (this._simpleMode) {
+            return this._current.has(key);
+        }
+        return _mapForKey(this._maps, key) !== undefined;
+    }
+    get(key) {
+        if (this._simpleMode) {
+            return this._current.get(key);
+        }
+        return _valueForKey(this._maps, key);
+    }
+    delete(key) {
+        if (this._simpleMode) {
+            return this._current.delete(key);
+        }
+        const map = _mapForKey(this._maps, key);
+        if (map !== undefined) {
+            return map.delete(key);
+        }
+        return false;
+    }
+    clear() {
+        if (this._simpleMode) {
+            return this._current.clear();
+        }
+        for (const map of this._maps) {
+            map.clear();
+        }
+        this._maps = [this._current];
+        this._simpleMode = true;
+    }
+    get size() {
+        if (this._simpleMode) {
+            return this._current.size;
+        }
+        let size = 0;
+        for (const map of this._maps) {
+            size += map.size;
+        }
+        return size;
+    }
+    forEach(callbackFn, thisArg) {
+        if (thisArg) {
+            for (const [key, value] of this.entries()) {
+                callbackFn.call(thisArg, value, key, this);
+            }
+        }
+        else {
+            for (const [key, value] of this.entries()) {
+                callbackFn(value, key, this);
+            }
+        }
+    }
+    entries() {
+        if (this._simpleMode) {
+            return this._current.entries();
+        }
+        return _iterator(this._maps, 'entries');
+    }
+    keys() {
+        if (this._simpleMode) {
+            return this._current.keys();
+        }
+        return _iterator(this._maps, 'keys');
+    }
+    values() {
+        if (this._simpleMode) {
+            return this._current.values();
+        }
+        return _iterator(this._maps, 'values');
+    }
+    [Symbol.iterator]() {
+        if (this._simpleMode) {
+            return this._current[Symbol.iterator]();
+        }
+        return _iterator(this._maps, Symbol.iterator);
+    }
+}
+function _mapForKey(maps, key) {
+    const start = maps.length - 1;
+    for (let index = start; index >= 0; index--) {
+        const map = maps[index];
+        if (map.has(key)) {
+            return map;
+        }
+    }
+    return undefined;
+}
+function _valueForKey(maps, key) {
+    const start = maps.length - 1;
+    for (let index = start; index >= 0; index--) {
+        const map = maps[index];
+        const value = map.get(key);
+        if (value !== undefined) {
+            return value;
+        }
+    }
+    return undefined;
+}
+function _iterator(items, name) {
+    let index = 0;
+    let iterator = items[index][name]();
+    return {
+        next: () => {
+            let result = iterator.next();
+            if (result.done && index < items.length - 1) {
+                index++;
+                iterator = items[index][name]();
+                result = iterator.next();
+            }
+            return result;
+        },
+        [Symbol.iterator]() {
+            return this;
+        },
+    };
+}
+//# sourceMappingURL=big-map.js.map

package/dist/src/big-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"big-map.js","sourceRoot":"","sources":["../../src/big-map.ts"],"names":[],"mappings":"AAAA,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,CAAC;AAE/B;;;GAGG;AACH,MAAM,OAAO,MAAM;IACf;;;OAGG;IACH,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;IAEhD,UAAU,CAAS;IACpB,KAAK,CAAc;IACnB,QAAQ,CAAY;IACpB,WAAW,CAAU;IAE7B,YAAY,OAA6C;QACrD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC1C,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAChB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC7B,CAAC;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,GAAG,CAAC,GAAM;QACN,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC;IACrD,CAAC;IAED,GAAG,CAAC,GAAM;QACN,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,CAAC,GAAM;QACT,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAExC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACpB,OAAO,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK;QACD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjC,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,GAAG,CAAC,KAAK,EAAE,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED,IAAI,IAAI;QACJ,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC9B,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,CAAC,UAAyD,EAAE,OAAiB;QAChF,IAAI,OAAO,EAAE,CAAC;YACV,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;gBACxC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YAC/C,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;gBACxC,UAAU,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnC,CAAC;QACD,OAAO,SAAS,CAAS,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IAED,IAAI;QACA,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAChC,CAAC;QACD,OAAO,SAAS,CAAI,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM;QACF,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClC,CAAC;QACD,OAAO,SAAS,CAAI,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5C,CAAC;QACD,OAAO,SAAS,CAAS,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;;AAGL,SAAS,UAAU,CAA4B,IAAS,EAAE,GAAM;IAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACf,OAAO,GAAG,CAAC;QACf,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED,SAAS,YAAY,CAA4B,IAAS,EAAE,GAAM;IAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED,SAAS,SAAS,CACd,KAAsB,EACtB,IAA4D;IAE5D,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,IAAI,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAEpC,OAAO;QACH,IAAI,EAAE,GAAG,EAAE;YACP,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;YAE7B,IAAI,MAAM,CAAC,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1C,KAAK,EAAE,CAAC;gBACR,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC7B,CAAC;YAED,OAAO,MAAM,CAAC;QAClB,CAAC;QACD,CAAC,MAAM,CAAC,QAAQ,CAAC;YACb,OAAO,IAAI,CAAC;QAChB,CAAC;KACmB,CAAC;AAC7B,CAAC"}

package/dist/src/big-set.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Avoid v8 maximum size for Set by spreading the cache across multiple Sets.
+ * This class has the same API as Set but minus more differences in ->add and ->forEach
+ */
+export declare class BigSet<T> {
+    static DEFAULT_MAX_SIZE: number;
+    readonly maxMapSize: number;
+    private _sets;
+    private _current;
+    private _simpleMode;
+    constructor(values?: readonly T[] | null);
+    add(value: T): Set<T>;
+    has(value: T): boolean;
+    delete(value: T): boolean;
+    clear(): void;
+    get size(): number;
+    forEach(callbackFn: (value: T, value2: T, map: BigSet<T>) => void, thisArg?: unknown): void;
+    [Symbol.iterator](): IterableIterator<T>;
+}
+//# sourceMappingURL=big-set.d.ts.map

package/dist/src/big-set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"big-set.d.ts","sourceRoot":"","sources":["../../src/big-set.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC;IACjB,MAAM,CAAC,gBAAgB,SAAkB;IAEzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,WAAW,CAAU;gBAEjB,MAAM,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI;IAOxC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAUrB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAOtB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAczB,KAAK,IAAI,IAAI;IAab,IAAI,IAAI,IAAI,MAAM,CAYjB;IAED,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,IAAI;IAY3F,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAM3C"}

package/dist/src/big-set.js

@@ -0,0 +1,109 @@
+const defaultMaxSize = 2 ** 24;
+/**
+ * Avoid v8 maximum size for Set by spreading the cache across multiple Sets.
+ * This class has the same API as Set but minus more differences in ->add and ->forEach
+ */
+export class BigSet {
+    static DEFAULT_MAX_SIZE = defaultMaxSize;
+    maxMapSize;
+    _sets;
+    _current;
+    _simpleMode;
+    constructor(values) {
+        this.maxMapSize = BigSet.DEFAULT_MAX_SIZE;
+        this._current = new Set(values);
+        this._simpleMode = true;
+        this._sets = [this._current];
+    }
+    add(value) {
+        if (this._current.size >= this.maxMapSize) {
+            this._current = new Set();
+            this._sets.push(this._current);
+            this._simpleMode = false;
+        }
+        return this._current.add(value);
+    }
+    has(value) {
+        if (this._simpleMode) {
+            return this._current.has(value);
+        }
+        return _getSetWithValue(this._sets, value) !== undefined;
+    }
+    delete(value) {
+        if (this._simpleMode) {
+            return this._current.delete(value);
+        }
+        const set = _getSetWithValue(this._sets, value);
+        if (set !== undefined) {
+            return set.delete(value);
+        }
+        return false;
+    }
+    clear() {
+        if (this._simpleMode) {
+            return this._current.clear();
+        }
+        for (const set of this._sets) {
+            set.clear();
+        }
+        this._sets = [this._current];
+        this._simpleMode = true;
+    }
+    get size() {
+        if (this._simpleMode) {
+            return this._current.size;
+        }
+        let size = 0;
+        for (const map of this._sets) {
+            size += map.size;
+        }
+        return size;
+    }
+    forEach(callbackFn, thisArg) {
+        if (thisArg) {
+            for (const value of this) {
+                callbackFn.call(thisArg, value, value, this);
+            }
+        }
+        else {
+            for (const value of this) {
+                callbackFn(value, value, this);
+            }
+        }
+    }
+    [Symbol.iterator]() {
+        if (this._simpleMode) {
+            return this._current[Symbol.iterator]();
+        }
+        return _iterator(this._sets, Symbol.iterator);
+    }
+}
+function _getSetWithValue(sets, value) {
+    const start = sets.length - 1;
+    for (let index = start; index >= 0; index--) {
+        const set = sets[index];
+        if (set.has(value)) {
+            return set;
+        }
+    }
+    return undefined;
+}
+function _iterator(items, name) {
+    let index = 0;
+    let iterator = items[index][name]();
+    return {
+        next: () => {
+            let result = iterator.next();
+            if (result.done && index < items.length - 1) {
+                index++;
+                iterator = items[index][name]();
+                result = iterator.next();
+            }
+            return result;
+        },
+        [Symbol.iterator]() {
+            return this;
+        },
+    };
+}
+//# sourceMappingURL=big-set.js.map