@r01al/array-polyfills 1.0.5 → 1.0.7

package/dist/auto.cjs

@@ -69,6 +69,30 @@ function unique () {
     return result;
 }
 
+/**
+ * Removes falsy values from the array.
+ * @returns A new array without falsy values.
+ */
+function compact () {
+    return this.filter((value) => Boolean(value));
+}
+
+/**
+ * Maps items and removes null/undefined results.
+ * @param mapper Function to map items.
+ * @returns A new array of mapped values without null/undefined.
+ */
+function compactMap (mapper) {
+    const out = [];
+    for (let index = 0; index < this.length; index++) {
+        const value = mapper(this[index], index, this);
+        if (value !== null && value !== undefined) {
+            out.push(value);
+        }
+    }
+    return out;
+}
+
 /**
  * Creates an object mapping each value of the given key to the corresponding value from the array of objects.
  * @param key The property name to use as keys in the result object.
@@ -169,6 +193,229 @@ function shuffle() {
     return this;
 }
 
+/**
+ * Groups array items by a key or mapper function.
+ * @param key The property name or mapper function to group by.
+ * @returns An object where keys are group identifiers and values are arrays of items.
+ */
+function groupBy (key) {
+    const result = {};
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const groupKey = getKey(item, index, this);
+        if (!result[groupKey])
+            result[groupKey] = [];
+        result[groupKey].push(item);
+    }
+    return result;
+}
+
+/**
+ * Flattens the array by one level.
+ * @returns A new flattened array.
+ */
+function flatten () {
+    const out = [];
+    for (const item of this) {
+        if (Array.isArray(item))
+            out.push(...item);
+        else
+            out.push(item);
+    }
+    return out;
+}
+
+/**
+ * Zips the array with other arrays.
+ * @param arrays Arrays to zip with.
+ * @returns An array of tuples, truncated to the shortest length.
+ */
+function zip (...arrays) {
+    if (arrays.length === 0)
+        return this.map(item => [item]);
+    const minLength = Math.min(this.length, ...arrays.map(arr => arr.length));
+    const out = [];
+    for (let index = 0; index < minLength; index++) {
+        out.push([this[index], ...arrays.map(arr => arr[index])]);
+    }
+    return out;
+}
+
+/**
+ * Splits the array into two arrays based on a predicate.
+ * @param predicate Function to test each element.
+ * @returns A tuple: [items that pass, items that fail].
+ */
+function partition (predicate) {
+    const pass = [];
+    const fail = [];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        if (predicate(item, index, this))
+            pass.push(item);
+        else
+            fail.push(item);
+    }
+    return [pass, fail];
+}
+
+/**
+ * Plucks a property from each item in the array.
+ * @param key Property name to pluck.
+ * @returns A new array of property values.
+ */
+function pluck (key) {
+    return this.map(item => item[key]);
+}
+
+/**
+ * Counts items by a key or mapper function.
+ * @param key The property name or mapper function to count by.
+ * @returns An object where keys are group identifiers and values are counts.
+ */
+function countBy (key) {
+    const result = {};
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const groupKey = getKey(item, index, this);
+        result[groupKey] = (result[groupKey] ?? 0) + 1;
+    }
+    return result;
+}
+
+/**
+ * Returns items that are not present in the other arrays.
+ * @param arrays Arrays to exclude.
+ * @returns A new array of values not found in other arrays.
+ */
+function difference (...arrays) {
+    if (arrays.length === 0)
+        return this.slice();
+    const other = new Set();
+    for (const arr of arrays) {
+        for (const item of arr)
+            other.add(item);
+    }
+    return this.filter(item => !other.has(item));
+}
+
+/**
+ * Returns items present in all arrays.
+ * @param arrays Arrays to intersect with.
+ * @returns A new array of items found in every array.
+ */
+function intersection (...arrays) {
+    if (arrays.length === 0)
+        return this.slice();
+    const sets = arrays.map(arr => new Set(arr));
+    return this.filter(item => sets.every(set => set.has(item)));
+}
+
+/**
+ * Returns a unique merge of the array and the other arrays.
+ * @param arrays Arrays to merge.
+ * @returns A new array with unique values.
+ */
+function union (...arrays) {
+    const out = [];
+    const seen = new Set();
+    const push = (item) => {
+        if (seen.has(item))
+            return;
+        seen.add(item);
+        out.push(item);
+    };
+    for (const item of this)
+        push(item);
+    for (const arr of arrays) {
+        for (const item of arr)
+            push(item);
+    }
+    return out;
+}
+
+/**
+ * Returns unique items by a key or mapper function.
+ * @param key The property name or mapper function to determine uniqueness.
+ * @returns A new array with unique items.
+ */
+function uniqBy (key) {
+    const result = [];
+    const seen = new Set();
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const keyValue = getKey(item, index, this);
+        if (!seen.has(keyValue)) {
+            seen.add(keyValue);
+            result.push(item);
+        }
+    }
+    return result;
+}
+
+/**
+ * Sorts items by a key or mapper function (stable).
+ * @param key The property name or mapper function to sort by.
+ * @returns A new array sorted by the key.
+ */
+function sortBy (key) {
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    return this
+        .map((item, index) => ({ item, index, key: getKey(item, index, this) }))
+        .sort((a, b) => {
+        if (a.key < b.key)
+            return -1;
+        if (a.key > b.key)
+            return 1;
+        return a.index - b.index;
+    })
+        .map(entry => entry.item);
+}
+
+/**
+ * Returns a random sample of items without replacement.
+ * @param count Number of items to sample.
+ * @returns A new array containing sampled items.
+ */
+function sample (count) {
+    if (!Number.isInteger(count) || count <= 0) {
+        throw new Error("count must be a positive integer");
+    }
+    const out = this.slice();
+    for (let i = out.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [out[i], out[j]] = [out[j], out[i]];
+    }
+    return out.slice(0, Math.min(count, out.length));
+}
+
+/**
+ * Pads the array to the given length with the provided value.
+ * @param length Target length.
+ * @param value Value to pad with.
+ * @returns A new padded array.
+ */
+function pad (length, value) {
+    if (!Number.isInteger(length) || length < 0) {
+        throw new Error("length must be a non-negative integer");
+    }
+    const out = this.slice();
+    while (out.length < length)
+        out.push(value);
+    return out;
+}
+
 function defineArrayMethod(name, fn) {
     if (!Array.prototype[name]) {
         Object.defineProperty(Array.prototype, name, {
@@ -182,6 +429,8 @@ defineArrayMethod("first", first);
 defineArrayMethod("last", last);
 defineArrayMethod("unique", unique);
 defineArrayMethod("chunk", chunk);
+defineArrayMethod("compact", compact);
+defineArrayMethod("compactMap", compactMap);
 defineArrayMethod("random", random);
 defineArrayMethod("keyValueMap", keyValueMap);
 defineArrayMethod("sum", sum);
@@ -189,4 +438,17 @@ defineArrayMethod("avg", avg);
 defineArrayMethod("max", max);
 defineArrayMethod("min", min);
 defineArrayMethod("shuffle", shuffle);
+defineArrayMethod("groupBy", groupBy);
+defineArrayMethod("flatten", flatten);
+defineArrayMethod("zip", zip);
+defineArrayMethod("partition", partition);
+defineArrayMethod("pluck", pluck);
+defineArrayMethod("countBy", countBy);
+defineArrayMethod("difference", difference);
+defineArrayMethod("intersection", intersection);
+defineArrayMethod("union", union);
+defineArrayMethod("uniqBy", uniqBy);
+defineArrayMethod("sortBy", sortBy);
+defineArrayMethod("sample", sample);
+defineArrayMethod("pad", pad);
 //# sourceMappingURL=auto.cjs.map

package/dist/auto.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"auto.cjs","sources":["../src/functions/chunk.ts","../src/functions/first.ts","../src/functions/last.ts","../src/functions/random.ts","../src/functions/unique.ts","../src/functions/keyValueMap.ts","../src/functions/sum.ts","../src/functions/avg.ts","../src/functions/max.ts","../src/functions/min.ts","../src/functions/shuffle.ts","../src/polyfills/array.ts"],"sourcesContent":["/**\n* Splits the array into smaller arrays of the given size.\n* @param size Number of items per chunk\n* @returns Array of chunks\n*/\n\nexport default function <T>(this: T[], size: number) {\n\tif (!Number.isInteger(size) || size <= 0) throw new Error(\"size must be a positive integer\");\n\tconst out: T[][] = [];\n\tfor (let i = 0; i < this.length; i += size) out.push(this.slice(i, i + size));\n\treturn out;\n}","/**\n* @returns the first element of the array, or undefined if the array is empty.\n*/\nexport default function <T>(this: T[]) { return this.length ? this[0] : undefined; }","/**\n* @returns the last element of the array, or undefined if the array is empty.\n*/\nexport default function <T>(this: T[]) { return this.length ? this[this.length - 1] : undefined; }","/**\n * @returns a random element from the array, or undefined if the array is empty.\n */\nexport default function <T>(this: T[]) {\n\treturn this.length ? this[Math.floor(Math.random() * this.length)] : undefined;\n}","/**\n * @returns a new array with only unique elements from the original array.\n * Supports deep comparison for objects.\n * Uses a map for improved performance with primitives.\n */\nfunction deepEqual(a: any, b: any): boolean {\n    if (a === b) return true;\n    if (typeof a !== \"object\" || typeof b !== \"object\" || a === null || b === null) return false;\n    const keysA = Object.keys(a), keysB = Object.keys(b);\n    if (keysA.length !== keysB.length) return false;\n    for (const key of keysA) {\n        if (!keysB.includes(key) || !deepEqual(a[key], b[key])) return false;\n    }\n    return true;\n}\n\nexport default function <T>(this: T[]): T[] {\n    const result: T[] = [];\n    const primitiveMap = new Map<any, boolean>();\n\n    for (const item of this) {\n        if (item === null || typeof item !== \"object\") {\n            if (!primitiveMap.has(item)) {\n                primitiveMap.set(item, true);\n                result.push(item);\n            }\n        } else {\n            if (!result.some(existing => deepEqual(existing, item))) {\n                result.push(item);\n            }\n        }\n    }\n    return result;\n}","/**\n * Creates an object mapping each value of the given key to the corresponding value from the array of objects.\n * @param key The property name to use as keys in the result object.\n * @param value The property name to use as values in the result object.\n * @returns An object mapping key values to value values.\n */\nexport default function (this: KeyValueMap[], key: string, value: string) {\n\tif (!key) {\n\t\tthrow new Error('keyValueMap: key is required');\n\t}\n\n\tif (!value) {\n\t\tthrow new Error(\"keyValueMap: value is required\");\n\t}\n\n\tif (this.some(el => !el)) {\n\t\tthrow new Error('keyValueMap: Array contains falsy values');\n\t}\n\n\tif (this.some(el => typeof el !== 'object')) {\n\t\tthrow new Error('keyValueMap: Array contains non-object values');\n\t}\n\n\tif (this.some(el => !el.hasOwnProperty(key))) {\n\t\tthrow new Error(`keyValueMap: key \"${key}\" does not exist on all objects`);\n\t}\n\n\tvar map : KeyValueMap = {};\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tvar element: KeyValueMap = this[index];\n\n\t\tmap[element[key]] = element[value];\n\t}\n\t\n\treturn map;\n}","/**\n * Calculates the sum of all numbers in an array.\n * @returns The sum of all numbers in the array.\n * @throws Will throw an error if any element in the array is not a number.\n * @example\n * [1, 2, 3].sum() // returns 6\n * [10, -2, 5].sum() // returns 13\n * [1, '2', 3].sum() // throws Error\n */\n\nexport default function <T>(this: T[]) { \n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n\n    let sum = 0;\n\n    for (const num of this as unknown as number[]) {\n        sum += num;\n    }\n\n    return sum\n}","/**\n * Calculates the average of all numbers in an array.\n * @returns The average value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return this.reduce((a, b) => a + b, 0) / this.length;\n}","/**\n * Returns the maximum number in the array.\n * @returns The maximum value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return Math.max(...this);\n}","/**\n * Returns the minimum number in the array.\n * @returns The minimum value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return Math.min(...this);\n}","export default function shuffle<T>(this: T[]): T[] {\n    for (let i = this.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        [this[i], this[j]] = [this[j], this[i]];\n    }\n    \n    return this;\n}","import chunk from \"../functions/chunk\";\nimport first from \"../functions/first\";\nimport last from \"../functions/last\";\nimport random from \"../functions/random\";\nimport unique from \"../functions/unique\";\nimport keyValueMap from \"../functions/keyValueMap\";\nimport sum from \"../functions/sum\";\nimport avg from \"../functions/avg\";\nimport max from \"../functions/max\";\nimport min from \"../functions/min\";\nimport shuffle from \"../functions/shuffle\";\n\ndeclare global {\n\tinterface Array<T> {\n\t\tfirst(): T | undefined;\n\t\tlast(): T | undefined;\n\t\tunique(): T[];\n\t\tchunk(size: number): T[][];\n\t\trandom(): T | undefined;\n\t\tkeyValueMap(key: string, value: string): Record<string, any>[];\n\t\tsum(this: number[]): number;\n\t\tavg(this: number[]): number | undefined;\n\t\tmax(this: number[]): number | undefined;\n\t\tmin(this: number[]): number | undefined;\n\t\tshuffle(): T[];\t\n\t}\n}\n\nfunction defineArrayMethod (name: string, fn: Function) {\n\tif (!(Array.prototype as any)[name]) {\n\t\tObject.defineProperty(Array.prototype, name, {\n\t\t\tvalue: fn,\n\t\t\twritable: false,\n\t\t\tconfigurable: false\n\t\t});\n\t}\n}\n\ndefineArrayMethod(\"first\", first);\ndefineArrayMethod(\"last\", last);\ndefineArrayMethod(\"unique\", unique);\ndefineArrayMethod(\"chunk\", chunk);\ndefineArrayMethod(\"random\", random);\ndefineArrayMethod(\"keyValueMap\", keyValueMap);\ndefineArrayMethod(\"sum\", sum);\ndefineArrayMethod(\"avg\", avg);\ndefineArrayMethod(\"max\", max);\ndefineArrayMethod(\"min\", min);\ndefineArrayMethod(\"shuffle\", shuffle);\n\nexport {};\n"],"names":[],"mappings":";;AAAA;;;;AAIE;AAEY,cAAA,EAAyB,IAAY,EAAA;IAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;AAAE,QAAA,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC;IAC5F,MAAM,GAAG,GAAU,EAAE;AACrB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;AAAE,QAAA,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7E,IAAA,OAAO,GAAG;AACX;;ACXA;;AAEE;AACY,cAAA,IAAA,EAA2B,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;;ACHnF;;AAEE;AACY,aAAA,IAAA,EAA2B,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;;ACHjG;;AAEG;AACW,eAAA,IAAA;IACb,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS;AAC/E;;ACLA;;;;AAIG;AACH,SAAS,SAAS,CAAC,CAAM,EAAE,CAAM,EAAA;IAC7B,IAAI,CAAC,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AACxB,IAAA,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;AAAE,QAAA,OAAO,KAAK;AAC5F,IAAA,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AACpD,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAAE,QAAA,OAAO,KAAK;AAC/C,IAAA,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;QACrB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAAE,YAAA,OAAO,KAAK;IACxE;AACA,IAAA,OAAO,IAAI;AACf;AAEc,eAAA,IAAA;IACV,MAAM,MAAM,GAAQ,EAAE;AACtB,IAAA,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgB;AAE5C,IAAA,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACrB,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC3C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACzB,gBAAA,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC;AAC5B,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB;QACJ;aAAO;AACH,YAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE;AACrD,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB;QACJ;IACJ;AACA,IAAA,OAAO,MAAM;AACjB;;ACjCA;;;;;AAKG;AACW,oBAAA,EAAgC,GAAW,EAAE,KAAa,EAAA;IACvE,IAAI,CAAC,GAAG,EAAE;AACT,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IAChD;IAEA,IAAI,CAAC,KAAK,EAAE;AACX,QAAA,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC;IAClD;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE;AACzB,QAAA,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC;IAC5D;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AAC5C,QAAA,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC;IACjE;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE;AAC7C,QAAA,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,CAAA,+BAAA,CAAiC,CAAC;IAC3E;IAEA,IAAI,GAAG,GAAiB,EAAE;AAE1B,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,IAAI,OAAO,GAAgB,IAAI,CAAC,KAAK,CAAC;QAEtC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IACnC;AAEA,IAAA,OAAO,GAAG;AACX;;ACpCA;;;;;;;;AAQG;AAEW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;IAEA,IAAI,GAAG,GAAG,CAAC;AAEX,IAAA,KAAK,MAAM,GAAG,IAAI,IAA2B,EAAE;QAC3C,GAAG,IAAI,GAAG;IACd;AAEA,IAAA,OAAO,GAAG;AACd;;ACtBA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;IACA,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;AACxD;;ACXA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;AACA,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AAC5B;;ACXA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;AACA,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AAC5B;;ACXc,SAAU,OAAO,GAAA;AAC3B,IAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACtC,QAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C;AAEA,IAAA,OAAO,IAAI;AACf;;ACqBA,SAAS,iBAAiB,CAAE,IAAY,EAAE,EAAY,EAAA;IACrD,IAAI,CAAE,KAAK,CAAC,SAAiB,CAAC,IAAI,CAAC,EAAE;QACpC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE;AAC5C,YAAA,KAAK,EAAE,EAAE;AACT,YAAA,QAAQ,EAAE,KAAK;AACf,YAAA,YAAY,EAAE;AACd,SAAA,CAAC;IACH;AACD;AAEA,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC;AAC/B,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,aAAa,EAAE,WAAW,CAAC;AAC7C,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;;"}
+{"version":3,"file":"auto.cjs","sources":["../src/functions/chunk.ts","../src/functions/first.ts","../src/functions/last.ts","../src/functions/random.ts","../src/functions/unique.ts","../src/functions/compact.ts","../src/functions/compactMap.ts","../src/functions/keyValueMap.ts","../src/functions/sum.ts","../src/functions/avg.ts","../src/functions/max.ts","../src/functions/min.ts","../src/functions/shuffle.ts","../src/functions/groupBy.ts","../src/functions/flatten.ts","../src/functions/zip.ts","../src/functions/partition.ts","../src/functions/pluck.ts","../src/functions/countBy.ts","../src/functions/difference.ts","../src/functions/intersection.ts","../src/functions/union.ts","../src/functions/uniqBy.ts","../src/functions/sortBy.ts","../src/functions/sample.ts","../src/functions/pad.ts","../src/polyfills/array.ts"],"sourcesContent":["/**\n* Splits the array into smaller arrays of the given size.\n* @param size Number of items per chunk\n* @returns Array of chunks\n*/\n\nexport default function <T>(this: T[], size: number) {\n\tif (!Number.isInteger(size) || size <= 0) throw new Error(\"size must be a positive integer\");\n\tconst out: T[][] = [];\n\tfor (let i = 0; i < this.length; i += size) out.push(this.slice(i, i + size));\n\treturn out;\n}","/**\n* @returns the first element of the array, or undefined if the array is empty.\n*/\nexport default function <T>(this: T[]) { return this.length ? this[0] : undefined; }","/**\n* @returns the last element of the array, or undefined if the array is empty.\n*/\nexport default function <T>(this: T[]) { return this.length ? this[this.length - 1] : undefined; }","/**\n * @returns a random element from the array, or undefined if the array is empty.\n */\nexport default function <T>(this: T[]) {\n\treturn this.length ? this[Math.floor(Math.random() * this.length)] : undefined;\n}","/**\n * @returns a new array with only unique elements from the original array.\n * Supports deep comparison for objects.\n * Uses a map for improved performance with primitives.\n */\nfunction deepEqual(a: any, b: any): boolean {\n    if (a === b) return true;\n    if (typeof a !== \"object\" || typeof b !== \"object\" || a === null || b === null) return false;\n    const keysA = Object.keys(a), keysB = Object.keys(b);\n    if (keysA.length !== keysB.length) return false;\n    for (const key of keysA) {\n        if (!keysB.includes(key) || !deepEqual(a[key], b[key])) return false;\n    }\n    return true;\n}\n\nexport default function <T>(this: T[]): T[] {\n    const result: T[] = [];\n    const primitiveMap = new Map<any, boolean>();\n\n    for (const item of this) {\n        if (item === null || typeof item !== \"object\") {\n            if (!primitiveMap.has(item)) {\n                primitiveMap.set(item, true);\n                result.push(item);\n            }\n        } else {\n            if (!result.some(existing => deepEqual(existing, item))) {\n                result.push(item);\n            }\n        }\n    }\n    return result;\n}","type Falsy = false | 0 | \"\" | null | undefined;\n\n/**\n * Removes falsy values from the array.\n * @returns A new array without falsy values.\n */\nexport default function <T>(this: T[]) {\n\treturn this.filter((value): value is Exclude<T, Falsy> => Boolean(value));\n}\n","/**\n * Maps items and removes null/undefined results.\n * @param mapper Function to map items.\n * @returns A new array of mapped values without null/undefined.\n */\nexport default function <T, R>(\n\tthis: T[],\n\tmapper: (value: T, index: number, arr: T[]) => R\n) {\n\tconst out: Exclude<R, null | undefined>[] = [];\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tconst value = mapper(this[index], index, this);\n\t\tif (value !== null && value !== undefined) {\n\t\t\tout.push(value as Exclude<R, null | undefined>);\n\t\t}\n\t}\n\n\treturn out;\n}\n","/**\n * Creates an object mapping each value of the given key to the corresponding value from the array of objects.\n * @param key The property name to use as keys in the result object.\n * @param value The property name to use as values in the result object.\n * @returns An object mapping key values to value values.\n */\nexport default function (this: KeyValueMap[], key: string, value: string) {\n\tif (!key) {\n\t\tthrow new Error('keyValueMap: key is required');\n\t}\n\n\tif (!value) {\n\t\tthrow new Error(\"keyValueMap: value is required\");\n\t}\n\n\tif (this.some(el => !el)) {\n\t\tthrow new Error('keyValueMap: Array contains falsy values');\n\t}\n\n\tif (this.some(el => typeof el !== 'object')) {\n\t\tthrow new Error('keyValueMap: Array contains non-object values');\n\t}\n\n\tif (this.some(el => !el.hasOwnProperty(key))) {\n\t\tthrow new Error(`keyValueMap: key \"${key}\" does not exist on all objects`);\n\t}\n\n\tvar map : KeyValueMap = {};\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tvar element: KeyValueMap = this[index];\n\n\t\tmap[element[key]] = element[value];\n\t}\n\t\n\treturn map;\n}","/**\n * Calculates the sum of all numbers in an array.\n * @returns The sum of all numbers in the array.\n * @throws Will throw an error if any element in the array is not a number.\n * @example\n * [1, 2, 3].sum() // returns 6\n * [10, -2, 5].sum() // returns 13\n * [1, '2', 3].sum() // throws Error\n */\n\nexport default function <T>(this: T[]) { \n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n\n    let sum = 0;\n\n    for (const num of this as unknown as number[]) {\n        sum += num;\n    }\n\n    return sum\n}","/**\n * Calculates the average of all numbers in an array.\n * @returns The average value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return this.reduce((a, b) => a + b, 0) / this.length;\n}","/**\n * Returns the maximum number in the array.\n * @returns The maximum value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return Math.max(...this);\n}","/**\n * Returns the minimum number in the array.\n * @returns The minimum value.\n * @throws If any element is not a number.\n */\nexport default function(this: number[]) {\n    if (this.length === 0) return undefined;\n    if (this.some(el => typeof el !== 'number')) {\n        throw new Error('All elements must be numbers');\n    }\n    return Math.min(...this);\n}","export default function shuffle<T>(this: T[]): T[] {\n    for (let i = this.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        [this[i], this[j]] = [this[j], this[i]];\n    }\n    \n    return this;\n}","/**\n * Groups array items by a key or mapper function.\n * @param key The property name or mapper function to group by.\n * @returns An object where keys are group identifiers and values are arrays of items.\n */\nexport default function <T, K extends PropertyKey>(\n\tthis: T[],\n\tkey: ((item: T, index: number, arr: T[]) => K) | keyof T\n) {\n\tconst result = {} as Record<K, T[]>;\n\tconst getKey = typeof key === \"function\"\n\t\t? key\n\t\t: (item: T) => item[key] as unknown as K;\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tconst item = this[index];\n\t\tconst groupKey = getKey(item, index, this);\n\t\tif (!result[groupKey]) result[groupKey] = [];\n\t\tresult[groupKey].push(item);\n\t}\n\n\treturn result;\n}\n","/**\n * Flattens the array by one level.\n * @returns A new flattened array.\n */\nexport default function <T>(this: (T | T[])[]) {\n\tconst out: T[] = [];\n\n\tfor (const item of this) {\n\t\tif (Array.isArray(item)) out.push(...item);\n\t\telse out.push(item);\n\t}\n\n\treturn out;\n}\n","/**\n * Zips the array with other arrays.\n * @param arrays Arrays to zip with.\n * @returns An array of tuples, truncated to the shortest length.\n */\nexport default function <T>(this: T[], ...arrays: any[][]) {\n\tif (arrays.length === 0) return this.map(item => [item]);\n\n\tconst minLength = Math.min(this.length, ...arrays.map(arr => arr.length));\n\tconst out: any[][] = [];\n\n\tfor (let index = 0; index < minLength; index++) {\n\t\tout.push([this[index], ...arrays.map(arr => arr[index])]);\n\t}\n\n\treturn out;\n}\n","/**\n * Splits the array into two arrays based on a predicate.\n * @param predicate Function to test each element.\n * @returns A tuple: [items that pass, items that fail].\n */\nexport default function <T>(\n\tthis: T[],\n\tpredicate: (value: T, index: number, arr: T[]) => boolean\n) {\n\tconst pass: T[] = [];\n\tconst fail: T[] = [];\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tconst item = this[index];\n\t\tif (predicate(item, index, this)) pass.push(item);\n\t\telse fail.push(item);\n\t}\n\n\treturn [pass, fail] as [T[], T[]];\n}\n","/**\n * Plucks a property from each item in the array.\n * @param key Property name to pluck.\n * @returns A new array of property values.\n */\nexport default function <T, K extends keyof T>(this: T[], key: K) {\n\treturn this.map(item => item[key]);\n}\n","/**\n * Counts items by a key or mapper function.\n * @param key The property name or mapper function to count by.\n * @returns An object where keys are group identifiers and values are counts.\n */\nexport default function <T, K extends PropertyKey>(\n\tthis: T[],\n\tkey: ((item: T, index: number, arr: T[]) => K) | keyof T\n) {\n\tconst result = {} as Record<K, number>;\n\tconst getKey = typeof key === \"function\"\n\t\t? key\n\t\t: (item: T) => item[key] as unknown as K;\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tconst item = this[index];\n\t\tconst groupKey = getKey(item, index, this);\n\t\tresult[groupKey] = (result[groupKey] ?? 0) + 1;\n\t}\n\n\treturn result;\n}\n","/**\n * Returns items that are not present in the other arrays.\n * @param arrays Arrays to exclude.\n * @returns A new array of values not found in other arrays.\n */\nexport default function <T>(this: T[], ...arrays: T[][]) {\n\tif (arrays.length === 0) return this.slice();\n\n\tconst other = new Set<T>();\n\n\tfor (const arr of arrays) {\n\t\tfor (const item of arr) other.add(item);\n\t}\n\n\treturn this.filter(item => !other.has(item));\n}\n","/**\n * Returns items present in all arrays.\n * @param arrays Arrays to intersect with.\n * @returns A new array of items found in every array.\n */\nexport default function <T>(this: T[], ...arrays: T[][]) {\n\tif (arrays.length === 0) return this.slice();\n\n\tconst sets = arrays.map(arr => new Set(arr));\n\n\treturn this.filter(item => sets.every(set => set.has(item)));\n}\n","/**\n * Returns a unique merge of the array and the other arrays.\n * @param arrays Arrays to merge.\n * @returns A new array with unique values.\n */\nexport default function <T>(this: T[], ...arrays: T[][]) {\n\tconst out: T[] = [];\n\tconst seen = new Set<T>();\n\n\tconst push = (item: T) => {\n\t\tif (seen.has(item)) return;\n\t\tseen.add(item);\n\t\tout.push(item);\n\t};\n\n\tfor (const item of this) push(item);\n\tfor (const arr of arrays) {\n\t\tfor (const item of arr) push(item);\n\t}\n\n\treturn out;\n}\n","/**\n * Returns unique items by a key or mapper function.\n * @param key The property name or mapper function to determine uniqueness.\n * @returns A new array with unique items.\n */\nexport default function <T, K>(\n\tthis: T[],\n\tkey: ((item: T, index: number, arr: T[]) => K) | keyof T\n) {\n\tconst result: T[] = [];\n\tconst seen = new Set<unknown>();\n\tconst getKey = typeof key === \"function\"\n\t\t? key\n\t\t: (item: T) => item[key] as unknown as K;\n\n\tfor (let index = 0; index < this.length; index++) {\n\t\tconst item = this[index];\n\t\tconst keyValue = getKey(item, index, this);\n\t\tif (!seen.has(keyValue)) {\n\t\t\tseen.add(keyValue);\n\t\t\tresult.push(item);\n\t\t}\n\t}\n\n\treturn result;\n}\n","/**\n * Sorts items by a key or mapper function (stable).\n * @param key The property name or mapper function to sort by.\n * @returns A new array sorted by the key.\n */\nexport default function <T, K extends string | number | bigint>(\n\tthis: T[],\n\tkey: ((item: T, index: number, arr: T[]) => K) | keyof T\n) {\n\tconst getKey = typeof key === \"function\"\n\t\t? key\n\t\t: (item: T) => item[key] as unknown as K;\n\n\treturn this\n\t\t.map((item, index) => ({ item, index, key: getKey(item, index, this) }))\n\t\t.sort((a, b) => {\n\t\t\tif (a.key < b.key) return -1;\n\t\t\tif (a.key > b.key) return 1;\n\t\t\treturn a.index - b.index;\n\t\t})\n\t\t.map(entry => entry.item);\n}\n","/**\n * Returns a random sample of items without replacement.\n * @param count Number of items to sample.\n * @returns A new array containing sampled items.\n */\nexport default function <T>(this: T[], count: number) {\n\tif (!Number.isInteger(count) || count <= 0) {\n\t\tthrow new Error(\"count must be a positive integer\");\n\t}\n\n\tconst out = this.slice();\n\n\tfor (let i = out.length - 1; i > 0; i--) {\n\t\tconst j = Math.floor(Math.random() * (i + 1));\n\t\t[out[i], out[j]] = [out[j], out[i]];\n\t}\n\n\treturn out.slice(0, Math.min(count, out.length));\n}\n","/**\n * Pads the array to the given length with the provided value.\n * @param length Target length.\n * @param value Value to pad with.\n * @returns A new padded array.\n */\nexport default function <T>(this: T[], length: number, value: T) {\n\tif (!Number.isInteger(length) || length < 0) {\n\t\tthrow new Error(\"length must be a non-negative integer\");\n\t}\n\n\tconst out = this.slice();\n\n\twhile (out.length < length) out.push(value);\n\n\treturn out;\n}\n","import chunk from \"../functions/chunk\";\nimport first from \"../functions/first\";\nimport last from \"../functions/last\";\nimport random from \"../functions/random\";\nimport unique from \"../functions/unique\";\nimport compact from \"../functions/compact\";\nimport compactMap from \"../functions/compactMap\";\nimport keyValueMap from \"../functions/keyValueMap\";\nimport sum from \"../functions/sum\";\nimport avg from \"../functions/avg\";\nimport max from \"../functions/max\";\nimport min from \"../functions/min\";\nimport shuffle from \"../functions/shuffle\";\nimport groupBy from \"../functions/groupBy\";\nimport flatten from \"../functions/flatten\";\nimport zip from \"../functions/zip\";\nimport partition from \"../functions/partition\";\nimport pluck from \"../functions/pluck\";\nimport countBy from \"../functions/countBy\";\nimport difference from \"../functions/difference\";\nimport intersection from \"../functions/intersection\";\nimport union from \"../functions/union\";\nimport uniqBy from \"../functions/uniqBy\";\nimport sortBy from \"../functions/sortBy\";\nimport sample from \"../functions/sample\";\nimport pad from \"../functions/pad\";\n\ndeclare global {\n\tinterface Array<T> {\n\t\tfirst(): T | undefined;\n\t\tlast(): T | undefined;\n\t\tunique(): T[];\n\t\tchunk(size: number): T[][];\n\t\tcompact(): T[];\n\t\tcompactMap<R>(mapper: (value: T, index: number, arr: T[]) => R): Exclude<R, null | undefined>[];\n\t\trandom(): T | undefined;\n\t\tkeyValueMap(key: string, value: string): Record<string, any>[];\n\t\tsum(this: number[]): number;\n\t\tavg(this: number[]): number | undefined;\n\t\tmax(this: number[]): number | undefined;\n\t\tmin(this: number[]): number | undefined;\n\t\tshuffle(): T[];\t\n\t\tgroupBy<K extends PropertyKey>(key: ((item: T, index: number, arr: T[]) => K) | keyof T): Record<K, T[]>;\n\t\tflatten(this: (T | T[])[]): T[];\n\t\tzip(...arrays: any[][]): any[][];\n\t\tpartition(predicate: (value: T, index: number, arr: T[]) => boolean): [T[], T[]];\n\t\tpluck<K extends keyof T>(key: K): T[K][];\n\t\tcountBy<K extends PropertyKey>(key: ((item: T, index: number, arr: T[]) => K) | keyof T): Record<K, number>;\n\t\tdifference(...arrays: T[][]): T[];\n\t\tintersection(...arrays: T[][]): T[];\n\t\tunion(...arrays: T[][]): T[];\n\t\tuniqBy<K>(key: ((item: T, index: number, arr: T[]) => K) | keyof T): T[];\n\t\tsortBy<K extends string | number | bigint>(key: ((item: T, index: number, arr: T[]) => K) | keyof T): T[];\n\t\tsample(count: number): T[];\n\t\tpad(length: number, value: T): T[];\n\t}\n}\n\nfunction defineArrayMethod (name: string, fn: Function) {\n\tif (!(Array.prototype as any)[name]) {\n\t\tObject.defineProperty(Array.prototype, name, {\n\t\t\tvalue: fn,\n\t\t\twritable: false,\n\t\t\tconfigurable: false\n\t\t});\n\t}\n}\n\ndefineArrayMethod(\"first\", first);\ndefineArrayMethod(\"last\", last);\ndefineArrayMethod(\"unique\", unique);\ndefineArrayMethod(\"chunk\", chunk);\ndefineArrayMethod(\"compact\", compact);\ndefineArrayMethod(\"compactMap\", compactMap);\ndefineArrayMethod(\"random\", random);\ndefineArrayMethod(\"keyValueMap\", keyValueMap);\ndefineArrayMethod(\"sum\", sum);\ndefineArrayMethod(\"avg\", avg);\ndefineArrayMethod(\"max\", max);\ndefineArrayMethod(\"min\", min);\ndefineArrayMethod(\"shuffle\", shuffle);\ndefineArrayMethod(\"groupBy\", groupBy);\ndefineArrayMethod(\"flatten\", flatten);\ndefineArrayMethod(\"zip\", zip);\ndefineArrayMethod(\"partition\", partition);\ndefineArrayMethod(\"pluck\", pluck);\ndefineArrayMethod(\"countBy\", countBy);\ndefineArrayMethod(\"difference\", difference);\ndefineArrayMethod(\"intersection\", intersection);\ndefineArrayMethod(\"union\", union);\ndefineArrayMethod(\"uniqBy\", uniqBy);\ndefineArrayMethod(\"sortBy\", sortBy);\ndefineArrayMethod(\"sample\", sample);\ndefineArrayMethod(\"pad\", pad);\n\nexport {};\n"],"names":[],"mappings":";;AAAA;;;;AAIE;AAEY,cAAA,EAAyB,IAAY,EAAA;IAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;AAAE,QAAA,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC;IAC5F,MAAM,GAAG,GAAU,EAAE;AACrB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;AAAE,QAAA,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7E,IAAA,OAAO,GAAG;AACX;;ACXA;;AAEE;AACY,cAAA,IAAA,EAA2B,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;;ACHnF;;AAEE;AACY,aAAA,IAAA,EAA2B,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;;ACHjG;;AAEG;AACW,eAAA,IAAA;IACb,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS;AAC/E;;ACLA;;;;AAIG;AACH,SAAS,SAAS,CAAC,CAAM,EAAE,CAAM,EAAA;IAC7B,IAAI,CAAC,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AACxB,IAAA,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;AAAE,QAAA,OAAO,KAAK;AAC5F,IAAA,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AACpD,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAAE,QAAA,OAAO,KAAK;AAC/C,IAAA,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;QACrB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAAE,YAAA,OAAO,KAAK;IACxE;AACA,IAAA,OAAO,IAAI;AACf;AAEc,eAAA,IAAA;IACV,MAAM,MAAM,GAAQ,EAAE;AACtB,IAAA,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgB;AAE5C,IAAA,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACrB,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC3C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACzB,gBAAA,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC;AAC5B,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB;QACJ;aAAO;AACH,YAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE;AACrD,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB;QACJ;IACJ;AACA,IAAA,OAAO,MAAM;AACjB;;AC/BA;;;AAGG;AACW,gBAAA,IAAA;AACb,IAAA,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,KAAiC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1E;;ACRA;;;;AAIG;AACW,mBAAA,EAEb,MAAgD,EAAA;IAEhD,MAAM,GAAG,GAAmC,EAAE;AAE9C,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC;QAC9C,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;AAC1C,YAAA,GAAG,CAAC,IAAI,CAAC,KAAqC,CAAC;QAChD;IACD;AAEA,IAAA,OAAO,GAAG;AACX;;ACnBA;;;;;AAKG;AACW,oBAAA,EAAgC,GAAW,EAAE,KAAa,EAAA;IACvE,IAAI,CAAC,GAAG,EAAE;AACT,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IAChD;IAEA,IAAI,CAAC,KAAK,EAAE;AACX,QAAA,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC;IAClD;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE;AACzB,QAAA,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC;IAC5D;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AAC5C,QAAA,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC;IACjE;AAEA,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE;AAC7C,QAAA,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,CAAA,+BAAA,CAAiC,CAAC;IAC3E;IAEA,IAAI,GAAG,GAAiB,EAAE;AAE1B,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,IAAI,OAAO,GAAgB,IAAI,CAAC,KAAK,CAAC;QAEtC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IACnC;AAEA,IAAA,OAAO,GAAG;AACX;;ACpCA;;;;;;;;AAQG;AAEW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;IAEA,IAAI,GAAG,GAAG,CAAC;AAEX,IAAA,KAAK,MAAM,GAAG,IAAI,IAA2B,EAAE;QAC3C,GAAG,IAAI,GAAG;IACd;AAEA,IAAA,OAAO,GAAG;AACd;;ACtBA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;IACA,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;AACxD;;ACXA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;AACA,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AAC5B;;ACXA;;;;AAIG;AACW,YAAA,IAAA;AACV,IAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,SAAS;AACvC,IAAA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;IACnD;AACA,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AAC5B;;ACXc,SAAU,OAAO,GAAA;AAC3B,IAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACtC,QAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C;AAEA,IAAA,OAAO,IAAI;AACf;;ACPA;;;;AAIG;AACW,gBAAA,EAEb,GAAwD,EAAA;IAExD,MAAM,MAAM,GAAG,EAAoB;AACnC,IAAA,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK;AAC7B,UAAE;UACA,CAAC,IAAO,KAAK,IAAI,CAAC,GAAG,CAAiB;AAEzC,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;AAC1C,QAAA,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;AAAE,YAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE;QAC5C,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAC5B;AAEA,IAAA,OAAO,MAAM;AACd;;ACtBA;;;AAGG;AACW,gBAAA,IAAA;IACb,MAAM,GAAG,GAAQ,EAAE;AAEnB,IAAA,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;AACxB,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;AAAE,YAAA,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;;AACrC,YAAA,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;IACpB;AAEA,IAAA,OAAO,GAAG;AACX;;ACbA;;;;AAIG;AACW,YAAA,EAAyB,GAAG,MAAe,EAAA;AACxD,IAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IAExD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACzE,MAAM,GAAG,GAAY,EAAE;AAEvB,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE;QAC/C,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1D;AAEA,IAAA,OAAO,GAAG;AACX;;AChBA;;;;AAIG;AACW,kBAAA,EAEb,SAAyD,EAAA;IAEzD,MAAM,IAAI,GAAQ,EAAE;IACpB,MAAM,IAAI,GAAQ,EAAE;AAEpB,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;AACxB,QAAA,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;AAAE,YAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;;AAC5C,YAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACrB;AAEA,IAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAe;AAClC;;ACnBA;;;;AAIG;AACW,cAAA,EAA4C,GAAM,EAAA;AAC/D,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;AACnC;;ACPA;;;;AAIG;AACW,gBAAA,EAEb,GAAwD,EAAA;IAExD,MAAM,MAAM,GAAG,EAAuB;AACtC,IAAA,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK;AAC7B,UAAE;UACA,CAAC,IAAO,KAAK,IAAI,CAAC,GAAG,CAAiB;AAEzC,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;AAC1C,QAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;IAC/C;AAEA,IAAA,OAAO,MAAM;AACd;;ACrBA;;;;AAIG;AACW,mBAAA,EAAyB,GAAG,MAAa,EAAA;AACtD,IAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI,CAAC,KAAK,EAAE;AAE5C,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,EAAK;AAE1B,IAAA,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE;QACzB,KAAK,MAAM,IAAI,IAAI,GAAG;AAAE,YAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;IACxC;AAEA,IAAA,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC7C;;ACfA;;;;AAIG;AACW,qBAAA,EAAyB,GAAG,MAAa,EAAA;AACtD,IAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI,CAAC,KAAK,EAAE;AAE5C,IAAA,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAE5C,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7D;;ACXA;;;;AAIG;AACW,cAAA,EAAyB,GAAG,MAAa,EAAA;IACtD,MAAM,GAAG,GAAQ,EAAE;AACnB,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK;AAEzB,IAAA,MAAM,IAAI,GAAG,CAAC,IAAO,KAAI;AACxB,QAAA,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE;AACpB,QAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;AACd,QAAA,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AACf,IAAA,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC;AACnC,IAAA,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE;QACzB,KAAK,MAAM,IAAI,IAAI,GAAG;YAAE,IAAI,CAAC,IAAI,CAAC;IACnC;AAEA,IAAA,OAAO,GAAG;AACX;;ACrBA;;;;AAIG;AACW,eAAA,EAEb,GAAwD,EAAA;IAExD,MAAM,MAAM,GAAQ,EAAE;AACtB,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW;AAC/B,IAAA,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK;AAC7B,UAAE;UACA,CAAC,IAAO,KAAK,IAAI,CAAC,GAAG,CAAiB;AAEzC,IAAA,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;AACjD,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;AACxB,YAAA,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;AAClB,YAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB;IACD;AAEA,IAAA,OAAO,MAAM;AACd;;ACzBA;;;;AAIG;AACW,eAAA,EAEb,GAAwD,EAAA;AAExD,IAAA,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK;AAC7B,UAAE;UACA,CAAC,IAAO,KAAK,IAAI,CAAC,GAAG,CAAiB;AAEzC,IAAA,OAAO;SACL,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;AACtE,SAAA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AACd,QAAA,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;YAAE,OAAO,EAAE;AAC5B,QAAA,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;AAAE,YAAA,OAAO,CAAC;AAC3B,QAAA,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;AACzB,IAAA,CAAC;SACA,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC;AAC3B;;ACrBA;;;;AAIG;AACW,eAAA,EAAyB,KAAa,EAAA;AACnD,IAAA,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE;AAC3C,QAAA,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC;IACpD;AAEA,IAAA,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE;AAExB,IAAA,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACxC,QAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC;AAEA,IAAA,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;AACjD;;AClBA;;;;;AAKG;AACW,YAAA,EAAyB,MAAc,EAAE,KAAQ,EAAA;AAC9D,IAAA,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;AAC5C,QAAA,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC;IACzD;AAEA,IAAA,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE;AAExB,IAAA,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM;AAAE,QAAA,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAE3C,IAAA,OAAO,GAAG;AACX;;AC0CA,SAAS,iBAAiB,CAAE,IAAY,EAAE,EAAY,EAAA;IACrD,IAAI,CAAE,KAAK,CAAC,SAAiB,CAAC,IAAI,CAAC,EAAE;QACpC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE;AAC5C,YAAA,KAAK,EAAE,EAAE;AACT,YAAA,QAAQ,EAAE,KAAK;AACf,YAAA,YAAY,EAAE;AACd,SAAA,CAAC;IACH;AACD;AAEA,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC;AAC/B,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;AACrC,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC;AAC3C,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,aAAa,EAAE,WAAW,CAAC;AAC7C,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;AACrC,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;AACrC,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;AACrC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;AAC7B,iBAAiB,CAAC,WAAW,EAAE,SAAS,CAAC;AACzC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC;AACrC,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC;AAC3C,iBAAiB,CAAC,cAAc,EAAE,YAAY,CAAC;AAC/C,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC;AACjC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;;"}

package/dist/auto.mjs

@@ -67,6 +67,30 @@ function unique () {
     return result;
 }
 
+/**
+ * Removes falsy values from the array.
+ * @returns A new array without falsy values.
+ */
+function compact () {
+    return this.filter((value) => Boolean(value));
+}
+
+/**
+ * Maps items and removes null/undefined results.
+ * @param mapper Function to map items.
+ * @returns A new array of mapped values without null/undefined.
+ */
+function compactMap (mapper) {
+    const out = [];
+    for (let index = 0; index < this.length; index++) {
+        const value = mapper(this[index], index, this);
+        if (value !== null && value !== undefined) {
+            out.push(value);
+        }
+    }
+    return out;
+}
+
 /**
  * Creates an object mapping each value of the given key to the corresponding value from the array of objects.
  * @param key The property name to use as keys in the result object.
@@ -167,6 +191,229 @@ function shuffle() {
     return this;
 }
 
+/**
+ * Groups array items by a key or mapper function.
+ * @param key The property name or mapper function to group by.
+ * @returns An object where keys are group identifiers and values are arrays of items.
+ */
+function groupBy (key) {
+    const result = {};
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const groupKey = getKey(item, index, this);
+        if (!result[groupKey])
+            result[groupKey] = [];
+        result[groupKey].push(item);
+    }
+    return result;
+}
+
+/**
+ * Flattens the array by one level.
+ * @returns A new flattened array.
+ */
+function flatten () {
+    const out = [];
+    for (const item of this) {
+        if (Array.isArray(item))
+            out.push(...item);
+        else
+            out.push(item);
+    }
+    return out;
+}
+
+/**
+ * Zips the array with other arrays.
+ * @param arrays Arrays to zip with.
+ * @returns An array of tuples, truncated to the shortest length.
+ */
+function zip (...arrays) {
+    if (arrays.length === 0)
+        return this.map(item => [item]);
+    const minLength = Math.min(this.length, ...arrays.map(arr => arr.length));
+    const out = [];
+    for (let index = 0; index < minLength; index++) {
+        out.push([this[index], ...arrays.map(arr => arr[index])]);
+    }
+    return out;
+}
+
+/**
+ * Splits the array into two arrays based on a predicate.
+ * @param predicate Function to test each element.
+ * @returns A tuple: [items that pass, items that fail].
+ */
+function partition (predicate) {
+    const pass = [];
+    const fail = [];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        if (predicate(item, index, this))
+            pass.push(item);
+        else
+            fail.push(item);
+    }
+    return [pass, fail];
+}
+
+/**
+ * Plucks a property from each item in the array.
+ * @param key Property name to pluck.
+ * @returns A new array of property values.
+ */
+function pluck (key) {
+    return this.map(item => item[key]);
+}
+
+/**
+ * Counts items by a key or mapper function.
+ * @param key The property name or mapper function to count by.
+ * @returns An object where keys are group identifiers and values are counts.
+ */
+function countBy (key) {
+    const result = {};
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const groupKey = getKey(item, index, this);
+        result[groupKey] = (result[groupKey] ?? 0) + 1;
+    }
+    return result;
+}
+
+/**
+ * Returns items that are not present in the other arrays.
+ * @param arrays Arrays to exclude.
+ * @returns A new array of values not found in other arrays.
+ */
+function difference (...arrays) {
+    if (arrays.length === 0)
+        return this.slice();
+    const other = new Set();
+    for (const arr of arrays) {
+        for (const item of arr)
+            other.add(item);
+    }
+    return this.filter(item => !other.has(item));
+}
+
+/**
+ * Returns items present in all arrays.
+ * @param arrays Arrays to intersect with.
+ * @returns A new array of items found in every array.
+ */
+function intersection (...arrays) {
+    if (arrays.length === 0)
+        return this.slice();
+    const sets = arrays.map(arr => new Set(arr));
+    return this.filter(item => sets.every(set => set.has(item)));
+}
+
+/**
+ * Returns a unique merge of the array and the other arrays.
+ * @param arrays Arrays to merge.
+ * @returns A new array with unique values.
+ */
+function union (...arrays) {
+    const out = [];
+    const seen = new Set();
+    const push = (item) => {
+        if (seen.has(item))
+            return;
+        seen.add(item);
+        out.push(item);
+    };
+    for (const item of this)
+        push(item);
+    for (const arr of arrays) {
+        for (const item of arr)
+            push(item);
+    }
+    return out;
+}
+
+/**
+ * Returns unique items by a key or mapper function.
+ * @param key The property name or mapper function to determine uniqueness.
+ * @returns A new array with unique items.
+ */
+function uniqBy (key) {
+    const result = [];
+    const seen = new Set();
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    for (let index = 0; index < this.length; index++) {
+        const item = this[index];
+        const keyValue = getKey(item, index, this);
+        if (!seen.has(keyValue)) {
+            seen.add(keyValue);
+            result.push(item);
+        }
+    }
+    return result;
+}
+
+/**
+ * Sorts items by a key or mapper function (stable).
+ * @param key The property name or mapper function to sort by.
+ * @returns A new array sorted by the key.
+ */
+function sortBy (key) {
+    const getKey = typeof key === "function"
+        ? key
+        : (item) => item[key];
+    return this
+        .map((item, index) => ({ item, index, key: getKey(item, index, this) }))
+        .sort((a, b) => {
+        if (a.key < b.key)
+            return -1;
+        if (a.key > b.key)
+            return 1;
+        return a.index - b.index;
+    })
+        .map(entry => entry.item);
+}
+
+/**
+ * Returns a random sample of items without replacement.
+ * @param count Number of items to sample.
+ * @returns A new array containing sampled items.
+ */
+function sample (count) {
+    if (!Number.isInteger(count) || count <= 0) {
+        throw new Error("count must be a positive integer");
+    }
+    const out = this.slice();
+    for (let i = out.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [out[i], out[j]] = [out[j], out[i]];
+    }
+    return out.slice(0, Math.min(count, out.length));
+}
+
+/**
+ * Pads the array to the given length with the provided value.
+ * @param length Target length.
+ * @param value Value to pad with.
+ * @returns A new padded array.
+ */
+function pad (length, value) {
+    if (!Number.isInteger(length) || length < 0) {
+        throw new Error("length must be a non-negative integer");
+    }
+    const out = this.slice();
+    while (out.length < length)
+        out.push(value);
+    return out;
+}
+
 function defineArrayMethod(name, fn) {
     if (!Array.prototype[name]) {
         Object.defineProperty(Array.prototype, name, {
@@ -180,6 +427,8 @@ defineArrayMethod("first", first);
 defineArrayMethod("last", last);
 defineArrayMethod("unique", unique);
 defineArrayMethod("chunk", chunk);
+defineArrayMethod("compact", compact);
+defineArrayMethod("compactMap", compactMap);
 defineArrayMethod("random", random);
 defineArrayMethod("keyValueMap", keyValueMap);
 defineArrayMethod("sum", sum);
@@ -187,4 +436,17 @@ defineArrayMethod("avg", avg);
 defineArrayMethod("max", max);
 defineArrayMethod("min", min);
 defineArrayMethod("shuffle", shuffle);
+defineArrayMethod("groupBy", groupBy);
+defineArrayMethod("flatten", flatten);
+defineArrayMethod("zip", zip);
+defineArrayMethod("partition", partition);
+defineArrayMethod("pluck", pluck);
+defineArrayMethod("countBy", countBy);
+defineArrayMethod("difference", difference);
+defineArrayMethod("intersection", intersection);
+defineArrayMethod("union", union);
+defineArrayMethod("uniqBy", uniqBy);
+defineArrayMethod("sortBy", sortBy);
+defineArrayMethod("sample", sample);
+defineArrayMethod("pad", pad);
 //# sourceMappingURL=auto.mjs.map