@vielzeug/arsenal 1.0.1

package/dist/array/rotate.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Rotates the elements of an array by a specified number of positions.
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, 4, 5];
+ * rotate(arr, 2); // [3, 4, 5]
+ * rotate(arr, 2, { wrap: true }); // [3, 4, 5, 1, 2]
+ * ```
+ * @param array - The array to rotate.
+ * @param positions - The number of positions to rotate the array.
+ * @param [options] - Options for the rotate operation.
+ * @param [options.wrap] - If `true`, the rotated-out elements are appended to the end.
+ *
+ * @returns A new array with the elements rotated.
+ */
+export declare function rotate<T>(array: T[], positions: number, { wrap }?: {
+    wrap?: boolean;
+}): T[];
+//# sourceMappingURL=rotate.d.ts.map

package/dist/array/rotate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.d.ts","sourceRoot":"","sources":["../../src/array/rotate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,IAAY,EAAE,GAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,CAAC,EAAE,CAOvG"}

package/dist/array/rotate.js

@@ -0,0 +1,10 @@
+//#region src/array/rotate.ts
+function e(e, t, { wrap: n = !1 } = {}) {
+	if (e.length === 0) return e;
+	let r = (t % e.length + e.length) % e.length, i = e.slice(r);
+	return n ? [...i, ...e.slice(0, r)] : i;
+}
+//#endregion
+export { e as rotate };
+
+//# sourceMappingURL=rotate.js.map

package/dist/array/rotate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.js","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["/**\n * Rotates the elements of an array by a specified number of positions.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4, 5];\n * rotate(arr, 2); // [3, 4, 5]\n * rotate(arr, 2, { wrap: true }); // [3, 4, 5, 1, 2]\n * ```\n * @param array - The array to rotate.\n * @param positions - The number of positions to rotate the array.\n * @param [options] - Options for the rotate operation.\n * @param [options.wrap] - If `true`, the rotated-out elements are appended to the end.\n *\n * @returns A new array with the elements rotated.\n */\nexport function rotate<T>(array: T[], positions: number, { wrap = false }: { wrap?: boolean } = {}): T[] {\n  if (array.length === 0) return array;\n\n  const normalizedPos = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPos);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPos)] : rotated;\n}\n"],"mappings":";AAgBA,SAAgB,EAAU,GAAY,GAAmB,EAAE,UAAO,OAA8B,CAAC,GAAQ;CACvG,IAAI,EAAM,WAAW,GAAG,OAAO;CAE/B,IAAM,KAAkB,IAAY,EAAM,SAAU,EAAM,UAAU,EAAM,QACpE,IAAU,EAAM,MAAM,CAAa;CAEzC,OAAO,IAAO,CAAC,GAAG,GAAS,GAAG,EAAM,MAAM,GAAG,CAAa,CAAC,IAAI;AACjE"}

package/dist/array/search.cjs

@@ -0,0 +1,2 @@
+const e=require("../errors.cjs"),t=require("../guards/isString.cjs"),n=require("../guards/isNil.cjs"),r=require("../guards/isNumber.cjs"),i=require("../string/similarity.cjs");var a=10,o=1e3;function s(t){if(t===void 0)return a;if(!Number.isInteger(t)||t<0)throw new e.ArsenalValidationError(`fuzzy: maxDepth must be a non-negative integer, got ${t}`);return Math.min(t,o)}var c=e=>e.normalize(`NFKD`).replace(/\p{M}/gu,``);function l(e,a,o,s,u=0){return u>s||n.isNil(e)?0:t.isString(e)||r.isNumber(e)?i.similarity(o?c(String(e)):String(e),a):Array.isArray(e)?e.reduce((e,t)=>Math.max(e,l(t,a,o,s,u+1)),0):typeof e==`object`?Object.values(e).reduce((e,t)=>Math.max(e,l(t,a,o,s,u+1)),0):0}function u(e,t,n,r,i){return l(e,t,r,i)>=n}function d(e,t,n={}){let{fields:r,normalize:i=!1,threshold:a=.25}=n,o=s(n.maxDepth);if(!t)return[...e];let l=t.trim().toLowerCase();if(!l)return[...e];let d=i?c(l):l;return e.filter(e=>r&&r.length>0&&typeof e==`object`&&e?r.some(t=>u(e[t],d,a,i,o)):u(e,d,a,i,o))}function f(e,t,n={}){let{fields:r,normalize:i=!1,threshold:a=.25}=n,o=s(n.maxDepth);if(!t||!t.trim())return e.map(e=>({item:e,score:1}));let u=t.trim().toLowerCase(),d=i?c(u):u;return e.map(e=>({item:e,score:r&&r.length>0&&typeof e==`object`&&e?r.reduce((t,n)=>Math.max(t,l(e[n],d,i,o)),0):l(e,d,i,o)})).filter(({score:e})=>e>=a).sort((e,t)=>t.score-e.score)}function p(e,t,n={}){let{scored:r,...i}=n;return r?f(e,t,i):d(e,t,i)}exports.fuzzy=p,exports.fuzzyFilter=d,exports.fuzzyScore=f;
+//# sourceMappingURL=search.cjs.map

package/dist/array/search.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.cjs","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { isNil } from '../guards/isNil';\nimport { isNumber } from '../guards/isNumber';\nimport { isString } from '../guards/isString';\nimport { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions<T> = {\n  fields?: ReadonlyArray<keyof T & string>;\n  /**\n   * Maximum recursive depth for full-tree scanning when `fields` is omitted. Values beyond\n   * this depth are not searched. Must be a non-negative integer; silently clamped to\n   * `HARD_MAX_SEEK_DEPTH` to bound worst-case recursion on untrusted, deeply-nested input.\n   * Default: `10`.\n   */\n  maxDepth?: number;\n  /** When `true`, applies Unicode NFKD normalization before comparison so accented characters match their base form (é ≈ e). Default: `false`. */\n  normalize?: boolean;\n  threshold?: number;\n};\n\n/** Default maximum recursive depth for full-tree scanning when `fields` is omitted and `maxDepth` isn't set. */\nconst DEFAULT_MAX_SEEK_DEPTH = 10;\n\n/**\n * Hard ceiling for `maxDepth`, regardless of caller input — bounds worst-case recursion depth\n * (and therefore call-stack usage) even when `maxDepth` is attacker-influenced.\n */\nconst HARD_MAX_SEEK_DEPTH = 1000;\n\n/** @security `maxDepth` may originate from untrusted input reaching a public API — validate and clamp. */\nfunction resolveMaxDepth(maxDepth: number | undefined): number {\n  if (maxDepth === undefined) return DEFAULT_MAX_SEEK_DEPTH;\n\n  if (!Number.isInteger(maxDepth) || maxDepth < 0) {\n    throw new ArsenalValidationError(`fuzzy: maxDepth must be a non-negative integer, got ${maxDepth}`);\n  }\n\n  return Math.min(maxDepth, HARD_MAX_SEEK_DEPTH);\n}\n\nconst normalizeStr = (s: string): string => s.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nfunction seekScore(item: unknown, query: string, normalize: boolean, maxDepth: number, depth = 0): number {\n  if (depth > maxDepth) return 0;\n\n  if (isNil(item)) return 0;\n\n  if (isString(item) || isNumber(item)) {\n    const a = normalize ? normalizeStr(String(item)) : String(item);\n\n    return similarity(a, query);\n  }\n\n  if (Array.isArray(item))\n    return (item as unknown[]).reduce<number>(\n      (max, v) => Math.max(max, seekScore(v, query, normalize, maxDepth, depth + 1)),\n      0,\n    );\n\n  if (typeof item === 'object')\n    return Object.values(item as Record<string, unknown>).reduce<number>(\n      (max, v) => Math.max(max, seekScore(v, query, normalize, maxDepth, depth + 1)),\n      0,\n    );\n\n  return 0;\n}\n\nfunction seekValue(item: unknown, query: string, threshold: number, normalize: boolean, maxDepth: number): boolean {\n  return seekScore(item, query, normalize, maxDepth) >= threshold;\n}\n\n/**\n * Performs a fuzzy filter on an array of items using string similarity.\n * Returns items whose similarity to `query` meets `threshold`.\n * When `fields` is provided, only those keys are searched; otherwise all values are scanned.\n *\n * For results sorted by relevance score, use `fuzzyScore`.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n *\n * fuzzyFilter(data, 'doe'); // [{ name: 'John Doe' }, { name: 'Jane Doe' }]\n * fuzzyFilter(data, 'john', { fields: ['name'] });\n * ```\n *\n * @param array - The array of items to filter.\n * @param query - The string to search for.\n * @param [options.threshold=0.25] - Similarity threshold between 0 and 1. Higher = stricter.\n * @param [options.fields] - Limit search to these object keys. Searches all values when omitted.\n * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).\n * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).\n * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.\n */\nexport function fuzzyFilter<T>(array: T[], query: string, options: FuzzyOptions<T> = {}): T[] {\n  const { fields, normalize = false, threshold = 0.25 } = options;\n  const maxDepth = resolveMaxDepth(options.maxDepth);\n\n  if (!query) return [...array];\n\n  const raw = query.trim().toLowerCase();\n\n  if (!raw) return [...array];\n\n  const searchTerm = normalize ? normalizeStr(raw) : raw;\n\n  return array.filter((item) => {\n    if (fields && fields.length > 0 && typeof item === 'object' && item !== null) {\n      return fields.some((field) =>\n        seekValue((item as Record<string, unknown>)[field], searchTerm, threshold, normalize, maxDepth),\n      );\n    }\n\n    return seekValue(item, searchTerm, threshold, normalize, maxDepth);\n  });\n}\n\n/**\n * Performs a fuzzy score on an array of items using string similarity.\n * Returns all items with their similarity score, filtered by `threshold`, sorted by score descending.\n * When `query` is empty, all items are returned with score `1`.\n *\n * For a simple filtered list without scores, use `fuzzyFilter`.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n *\n * fuzzyScore(data, 'john', { fields: ['name'] });\n * // [{ item: { name: 'John Doe', age: 25 }, score: 0.8 }, ...]\n * ```\n *\n * @param array - The array of items to score.\n * @param query - The string to search for.\n * @param [options.threshold=0.25] - Minimum score to include in results.\n * @param [options.fields] - Limit scoring to these object keys. Scores all values when omitted.\n * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).\n * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).\n * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.\n */\nexport function fuzzyScore<T>(array: T[], query: string, options: FuzzyOptions<T> = {}): ScoredResult<T>[] {\n  const { fields, normalize = false, threshold = 0.25 } = options;\n  const maxDepth = resolveMaxDepth(options.maxDepth);\n\n  if (!query || !query.trim()) {\n    return array.map((item) => ({ item, score: 1 }));\n  }\n\n  const raw = query.trim().toLowerCase();\n  const searchTerm = normalize ? normalizeStr(raw) : raw;\n\n  const scored = array.map((item) => {\n    const score =\n      fields && fields.length > 0 && typeof item === 'object' && item !== null\n        ? fields.reduce<number>(\n            (max, field) =>\n              Math.max(max, seekScore((item as Record<string, unknown>)[field], searchTerm, normalize, maxDepth)),\n            0,\n          )\n        : seekScore(item, searchTerm, normalize, maxDepth);\n\n    return { item, score };\n  });\n\n  return scored.filter(({ score }) => score >= threshold).sort((a, b) => b.score - a.score);\n}\n\n/**\n * Fuzzy-searches an array. In filter mode (default) returns `T[]`.\n * Pass `{ scored: true }` to return `ScoredResult<T>[]` sorted by relevance descending.\n *\n * @example\n * ```ts\n * const users = [{ name: 'Alice' }, { name: 'Bob' }];\n *\n * fuzzy(users, 'ali');                        // [{ name: 'Alice' }]\n * fuzzy(users, 'ali', { scored: true });       // [{ item: { name: 'Alice' }, score: 0.9 }]\n * fuzzy(users, 'ali', { fields: ['name'] });   // field-restricted\n * ```\n */\nexport function fuzzy<T>(array: T[], query: string, options: FuzzyOptions<T> & { scored: true }): ScoredResult<T>[];\nexport function fuzzy<T>(array: T[], query: string, options?: FuzzyOptions<T> & { scored?: false }): T[];\nexport function fuzzy<T>(\n  array: T[],\n  query: string,\n  options: FuzzyOptions<T> & { scored?: boolean } = {},\n): T[] | ScoredResult<T>[] {\n  const { scored, ...rest } = options;\n\n  return scored ? fuzzyScore(array, query, rest) : fuzzyFilter(array, query, rest);\n}\n"],"mappings":"gLAuBA,IAAM,EAAyB,GAMzB,EAAsB,IAG5B,SAAS,EAAgB,EAAsC,CAC7D,GAAI,IAAa,IAAA,GAAW,OAAO,EAEnC,GAAI,CAAC,OAAO,UAAU,CAAQ,GAAK,EAAW,EAC5C,MAAM,IAAI,EAAA,uBAAuB,uDAAuD,GAAU,EAGpG,OAAO,KAAK,IAAI,EAAU,CAAmB,CAC/C,CAEA,IAAM,EAAgB,GAAsB,EAAE,UAAU,MAAM,CAAC,CAAC,QAAQ,UAAW,EAAE,EAErF,SAAS,EAAU,EAAe,EAAe,EAAoB,EAAkB,EAAQ,EAAW,CAuBxG,OAtBI,EAAQ,GAER,EAAA,MAAM,CAAI,EAAU,EAEpB,EAAA,SAAS,CAAI,GAAK,EAAA,SAAS,CAAI,EAG1B,EAAA,WAFG,EAAY,EAAa,OAAO,CAAI,CAAC,EAAI,OAAO,CAAI,EAEzC,CAAK,EAGxB,MAAM,QAAQ,CAAI,EACZ,EAAmB,QACxB,EAAK,IAAM,KAAK,IAAI,EAAK,EAAU,EAAG,EAAO,EAAW,EAAU,EAAQ,CAAC,CAAC,EAC7E,CACF,EAEE,OAAO,GAAS,SACX,OAAO,OAAO,CAA+B,CAAC,CAAC,QACnD,EAAK,IAAM,KAAK,IAAI,EAAK,EAAU,EAAG,EAAO,EAAW,EAAU,EAAQ,CAAC,CAAC,EAC7E,CACF,EAEK,CACT,CAEA,SAAS,EAAU,EAAe,EAAe,EAAmB,EAAoB,EAA2B,CACjH,OAAO,EAAU,EAAM,EAAO,EAAW,CAAQ,GAAK,CACxD,CAyBA,SAAgB,EAAe,EAAY,EAAe,EAA2B,CAAC,EAAQ,CAC5F,GAAM,CAAE,SAAQ,YAAY,GAAO,YAAY,KAAS,EAClD,EAAW,EAAgB,EAAQ,QAAQ,EAEjD,GAAI,CAAC,EAAO,MAAO,CAAC,GAAG,CAAK,EAE5B,IAAM,EAAM,EAAM,KAAK,CAAC,CAAC,YAAY,EAErC,GAAI,CAAC,EAAK,MAAO,CAAC,GAAG,CAAK,EAE1B,IAAM,EAAa,EAAY,EAAa,CAAG,EAAI,EAEnD,OAAO,EAAM,OAAQ,GACf,GAAU,EAAO,OAAS,GAAK,OAAO,GAAS,UAAY,EACtD,EAAO,KAAM,GAClB,EAAW,EAAiC,GAAQ,EAAY,EAAW,EAAW,CAAQ,CAChG,EAGK,EAAU,EAAM,EAAY,EAAW,EAAW,CAAQ,CAClE,CACH,CAyBA,SAAgB,EAAc,EAAY,EAAe,EAA2B,CAAC,EAAsB,CACzG,GAAM,CAAE,SAAQ,YAAY,GAAO,YAAY,KAAS,EAClD,EAAW,EAAgB,EAAQ,QAAQ,EAEjD,GAAI,CAAC,GAAS,CAAC,EAAM,KAAK,EACxB,OAAO,EAAM,IAAK,IAAU,CAAE,OAAM,MAAO,CAAE,EAAE,EAGjD,IAAM,EAAM,EAAM,KAAK,CAAC,CAAC,YAAY,EAC/B,EAAa,EAAY,EAAa,CAAG,EAAI,EAenD,OAbe,EAAM,IAAK,IAUjB,CAAE,OAAM,MARb,GAAU,EAAO,OAAS,GAAK,OAAO,GAAS,UAAY,EACvD,EAAO,QACJ,EAAK,IACJ,KAAK,IAAI,EAAK,EAAW,EAAiC,GAAQ,EAAY,EAAW,CAAQ,CAAC,EACpG,CACF,EACA,EAAU,EAAM,EAAY,EAAW,CAAQ,CAEhC,EAGhB,CAAA,CAAO,QAAQ,CAAE,WAAY,GAAS,CAAS,CAAC,CAAC,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,CAC1F,CAiBA,SAAgB,EACd,EACA,EACA,EAAkD,CAAC,EAC1B,CACzB,GAAM,CAAE,SAAQ,GAAG,GAAS,EAE5B,OAAO,EAAS,EAAW,EAAO,EAAO,CAAI,EAAI,EAAY,EAAO,EAAO,CAAI,CACjF"}

package/dist/array/search.d.ts

@@ -0,0 +1,85 @@
+export type ScoredResult<T> = {
+    item: T;
+    score: number;
+};
+export type FuzzyOptions<T> = {
+    fields?: ReadonlyArray<keyof T & string>;
+    /**
+     * Maximum recursive depth for full-tree scanning when `fields` is omitted. Values beyond
+     * this depth are not searched. Must be a non-negative integer; silently clamped to
+     * `HARD_MAX_SEEK_DEPTH` to bound worst-case recursion on untrusted, deeply-nested input.
+     * Default: `10`.
+     */
+    maxDepth?: number;
+    /** When `true`, applies Unicode NFKD normalization before comparison so accented characters match their base form (é ≈ e). Default: `false`. */
+    normalize?: boolean;
+    threshold?: number;
+};
+/**
+ * Performs a fuzzy filter on an array of items using string similarity.
+ * Returns items whose similarity to `query` meets `threshold`.
+ * When `fields` is provided, only those keys are searched; otherwise all values are scanned.
+ *
+ * For results sorted by relevance score, use `fuzzyScore`.
+ *
+ * @example
+ * ```ts
+ * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];
+ *
+ * fuzzyFilter(data, 'doe'); // [{ name: 'John Doe' }, { name: 'Jane Doe' }]
+ * fuzzyFilter(data, 'john', { fields: ['name'] });
+ * ```
+ *
+ * @param array - The array of items to filter.
+ * @param query - The string to search for.
+ * @param [options.threshold=0.25] - Similarity threshold between 0 and 1. Higher = stricter.
+ * @param [options.fields] - Limit search to these object keys. Searches all values when omitted.
+ * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).
+ * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).
+ * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.
+ */
+export declare function fuzzyFilter<T>(array: T[], query: string, options?: FuzzyOptions<T>): T[];
+/**
+ * Performs a fuzzy score on an array of items using string similarity.
+ * Returns all items with their similarity score, filtered by `threshold`, sorted by score descending.
+ * When `query` is empty, all items are returned with score `1`.
+ *
+ * For a simple filtered list without scores, use `fuzzyFilter`.
+ *
+ * @example
+ * ```ts
+ * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];
+ *
+ * fuzzyScore(data, 'john', { fields: ['name'] });
+ * // [{ item: { name: 'John Doe', age: 25 }, score: 0.8 }, ...]
+ * ```
+ *
+ * @param array - The array of items to score.
+ * @param query - The string to search for.
+ * @param [options.threshold=0.25] - Minimum score to include in results.
+ * @param [options.fields] - Limit scoring to these object keys. Scores all values when omitted.
+ * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).
+ * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).
+ * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.
+ */
+export declare function fuzzyScore<T>(array: T[], query: string, options?: FuzzyOptions<T>): ScoredResult<T>[];
+/**
+ * Fuzzy-searches an array. In filter mode (default) returns `T[]`.
+ * Pass `{ scored: true }` to return `ScoredResult<T>[]` sorted by relevance descending.
+ *
+ * @example
+ * ```ts
+ * const users = [{ name: 'Alice' }, { name: 'Bob' }];
+ *
+ * fuzzy(users, 'ali');                        // [{ name: 'Alice' }]
+ * fuzzy(users, 'ali', { scored: true });       // [{ item: { name: 'Alice' }, score: 0.9 }]
+ * fuzzy(users, 'ali', { fields: ['name'] });   // field-restricted
+ * ```
+ */
+export declare function fuzzy<T>(array: T[], query: string, options: FuzzyOptions<T> & {
+    scored: true;
+}): ScoredResult<T>[];
+export declare function fuzzy<T>(array: T[], query: string, options?: FuzzyOptions<T> & {
+    scored?: false;
+}): T[];
+//# sourceMappingURL=search.d.ts.map

package/dist/array/search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/array/search.ts"],"names":[],"mappings":"AAMA,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzD,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI;IAC5B,MAAM,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gJAAgJ;IAChJ,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,CAAC;AAsDF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,YAAY,CAAC,CAAC,CAAM,GAAG,CAAC,EAAE,CAqB5F;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,YAAY,CAAC,CAAC,CAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAyBzG;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;AACpH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG;IAAE,MAAM,CAAC,EAAE,KAAK,CAAA;CAAE,GAAG,CAAC,EAAE,CAAC"}

package/dist/array/search.js

@@ -0,0 +1,47 @@
+import { ArsenalValidationError as e } from "../errors.js";
+import { isString as t } from "../guards/isString.js";
+import { isNil as n } from "../guards/isNil.js";
+import { isNumber as r } from "../guards/isNumber.js";
+import { similarity as i } from "../string/similarity.js";
+//#region src/array/search.ts
+var a = 10, o = 1e3;
+function s(t) {
+	if (t === void 0) return a;
+	if (!Number.isInteger(t) || t < 0) throw new e(`fuzzy: maxDepth must be a non-negative integer, got ${t}`);
+	return Math.min(t, o);
+}
+var c = (e) => e.normalize("NFKD").replace(/\p{M}/gu, "");
+function l(e, a, o, s, u = 0) {
+	return u > s || n(e) ? 0 : t(e) || r(e) ? i(o ? c(String(e)) : String(e), a) : Array.isArray(e) ? e.reduce((e, t) => Math.max(e, l(t, a, o, s, u + 1)), 0) : typeof e == "object" ? Object.values(e).reduce((e, t) => Math.max(e, l(t, a, o, s, u + 1)), 0) : 0;
+}
+function u(e, t, n, r, i) {
+	return l(e, t, r, i) >= n;
+}
+function d(e, t, n = {}) {
+	let { fields: r, normalize: i = !1, threshold: a = .25 } = n, o = s(n.maxDepth);
+	if (!t) return [...e];
+	let l = t.trim().toLowerCase();
+	if (!l) return [...e];
+	let d = i ? c(l) : l;
+	return e.filter((e) => r && r.length > 0 && typeof e == "object" && e ? r.some((t) => u(e[t], d, a, i, o)) : u(e, d, a, i, o));
+}
+function f(e, t, n = {}) {
+	let { fields: r, normalize: i = !1, threshold: a = .25 } = n, o = s(n.maxDepth);
+	if (!t || !t.trim()) return e.map((e) => ({
+		item: e,
+		score: 1
+	}));
+	let u = t.trim().toLowerCase(), d = i ? c(u) : u;
+	return e.map((e) => ({
+		item: e,
+		score: r && r.length > 0 && typeof e == "object" && e ? r.reduce((t, n) => Math.max(t, l(e[n], d, i, o)), 0) : l(e, d, i, o)
+	})).filter(({ score: e }) => e >= a).sort((e, t) => t.score - e.score);
+}
+function p(e, t, n = {}) {
+	let { scored: r, ...i } = n;
+	return r ? f(e, t, i) : d(e, t, i);
+}
+//#endregion
+export { p as fuzzy, d as fuzzyFilter, f as fuzzyScore };
+
+//# sourceMappingURL=search.js.map

package/dist/array/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { isNil } from '../guards/isNil';\nimport { isNumber } from '../guards/isNumber';\nimport { isString } from '../guards/isString';\nimport { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions<T> = {\n  fields?: ReadonlyArray<keyof T & string>;\n  /**\n   * Maximum recursive depth for full-tree scanning when `fields` is omitted. Values beyond\n   * this depth are not searched. Must be a non-negative integer; silently clamped to\n   * `HARD_MAX_SEEK_DEPTH` to bound worst-case recursion on untrusted, deeply-nested input.\n   * Default: `10`.\n   */\n  maxDepth?: number;\n  /** When `true`, applies Unicode NFKD normalization before comparison so accented characters match their base form (é ≈ e). Default: `false`. */\n  normalize?: boolean;\n  threshold?: number;\n};\n\n/** Default maximum recursive depth for full-tree scanning when `fields` is omitted and `maxDepth` isn't set. */\nconst DEFAULT_MAX_SEEK_DEPTH = 10;\n\n/**\n * Hard ceiling for `maxDepth`, regardless of caller input — bounds worst-case recursion depth\n * (and therefore call-stack usage) even when `maxDepth` is attacker-influenced.\n */\nconst HARD_MAX_SEEK_DEPTH = 1000;\n\n/** @security `maxDepth` may originate from untrusted input reaching a public API — validate and clamp. */\nfunction resolveMaxDepth(maxDepth: number | undefined): number {\n  if (maxDepth === undefined) return DEFAULT_MAX_SEEK_DEPTH;\n\n  if (!Number.isInteger(maxDepth) || maxDepth < 0) {\n    throw new ArsenalValidationError(`fuzzy: maxDepth must be a non-negative integer, got ${maxDepth}`);\n  }\n\n  return Math.min(maxDepth, HARD_MAX_SEEK_DEPTH);\n}\n\nconst normalizeStr = (s: string): string => s.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nfunction seekScore(item: unknown, query: string, normalize: boolean, maxDepth: number, depth = 0): number {\n  if (depth > maxDepth) return 0;\n\n  if (isNil(item)) return 0;\n\n  if (isString(item) || isNumber(item)) {\n    const a = normalize ? normalizeStr(String(item)) : String(item);\n\n    return similarity(a, query);\n  }\n\n  if (Array.isArray(item))\n    return (item as unknown[]).reduce<number>(\n      (max, v) => Math.max(max, seekScore(v, query, normalize, maxDepth, depth + 1)),\n      0,\n    );\n\n  if (typeof item === 'object')\n    return Object.values(item as Record<string, unknown>).reduce<number>(\n      (max, v) => Math.max(max, seekScore(v, query, normalize, maxDepth, depth + 1)),\n      0,\n    );\n\n  return 0;\n}\n\nfunction seekValue(item: unknown, query: string, threshold: number, normalize: boolean, maxDepth: number): boolean {\n  return seekScore(item, query, normalize, maxDepth) >= threshold;\n}\n\n/**\n * Performs a fuzzy filter on an array of items using string similarity.\n * Returns items whose similarity to `query` meets `threshold`.\n * When `fields` is provided, only those keys are searched; otherwise all values are scanned.\n *\n * For results sorted by relevance score, use `fuzzyScore`.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n *\n * fuzzyFilter(data, 'doe'); // [{ name: 'John Doe' }, { name: 'Jane Doe' }]\n * fuzzyFilter(data, 'john', { fields: ['name'] });\n * ```\n *\n * @param array - The array of items to filter.\n * @param query - The string to search for.\n * @param [options.threshold=0.25] - Similarity threshold between 0 and 1. Higher = stricter.\n * @param [options.fields] - Limit search to these object keys. Searches all values when omitted.\n * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).\n * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).\n * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.\n */\nexport function fuzzyFilter<T>(array: T[], query: string, options: FuzzyOptions<T> = {}): T[] {\n  const { fields, normalize = false, threshold = 0.25 } = options;\n  const maxDepth = resolveMaxDepth(options.maxDepth);\n\n  if (!query) return [...array];\n\n  const raw = query.trim().toLowerCase();\n\n  if (!raw) return [...array];\n\n  const searchTerm = normalize ? normalizeStr(raw) : raw;\n\n  return array.filter((item) => {\n    if (fields && fields.length > 0 && typeof item === 'object' && item !== null) {\n      return fields.some((field) =>\n        seekValue((item as Record<string, unknown>)[field], searchTerm, threshold, normalize, maxDepth),\n      );\n    }\n\n    return seekValue(item, searchTerm, threshold, normalize, maxDepth);\n  });\n}\n\n/**\n * Performs a fuzzy score on an array of items using string similarity.\n * Returns all items with their similarity score, filtered by `threshold`, sorted by score descending.\n * When `query` is empty, all items are returned with score `1`.\n *\n * For a simple filtered list without scores, use `fuzzyFilter`.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n *\n * fuzzyScore(data, 'john', { fields: ['name'] });\n * // [{ item: { name: 'John Doe', age: 25 }, score: 0.8 }, ...]\n * ```\n *\n * @param array - The array of items to score.\n * @param query - The string to search for.\n * @param [options.threshold=0.25] - Minimum score to include in results.\n * @param [options.fields] - Limit scoring to these object keys. Scores all values when omitted.\n * @param [options.normalize=false] - NFKD normalization so accented chars match base form (é ≈ e).\n * @param [options.maxDepth=10] - Maximum recursive depth when scanning nested values (ignored when `fields` is set).\n * @throws {ArsenalValidationError} If `maxDepth` is provided and is not a non-negative integer.\n */\nexport function fuzzyScore<T>(array: T[], query: string, options: FuzzyOptions<T> = {}): ScoredResult<T>[] {\n  const { fields, normalize = false, threshold = 0.25 } = options;\n  const maxDepth = resolveMaxDepth(options.maxDepth);\n\n  if (!query || !query.trim()) {\n    return array.map((item) => ({ item, score: 1 }));\n  }\n\n  const raw = query.trim().toLowerCase();\n  const searchTerm = normalize ? normalizeStr(raw) : raw;\n\n  const scored = array.map((item) => {\n    const score =\n      fields && fields.length > 0 && typeof item === 'object' && item !== null\n        ? fields.reduce<number>(\n            (max, field) =>\n              Math.max(max, seekScore((item as Record<string, unknown>)[field], searchTerm, normalize, maxDepth)),\n            0,\n          )\n        : seekScore(item, searchTerm, normalize, maxDepth);\n\n    return { item, score };\n  });\n\n  return scored.filter(({ score }) => score >= threshold).sort((a, b) => b.score - a.score);\n}\n\n/**\n * Fuzzy-searches an array. In filter mode (default) returns `T[]`.\n * Pass `{ scored: true }` to return `ScoredResult<T>[]` sorted by relevance descending.\n *\n * @example\n * ```ts\n * const users = [{ name: 'Alice' }, { name: 'Bob' }];\n *\n * fuzzy(users, 'ali');                        // [{ name: 'Alice' }]\n * fuzzy(users, 'ali', { scored: true });       // [{ item: { name: 'Alice' }, score: 0.9 }]\n * fuzzy(users, 'ali', { fields: ['name'] });   // field-restricted\n * ```\n */\nexport function fuzzy<T>(array: T[], query: string, options: FuzzyOptions<T> & { scored: true }): ScoredResult<T>[];\nexport function fuzzy<T>(array: T[], query: string, options?: FuzzyOptions<T> & { scored?: false }): T[];\nexport function fuzzy<T>(\n  array: T[],\n  query: string,\n  options: FuzzyOptions<T> & { scored?: boolean } = {},\n): T[] | ScoredResult<T>[] {\n  const { scored, ...rest } = options;\n\n  return scored ? fuzzyScore(array, query, rest) : fuzzyFilter(array, query, rest);\n}\n"],"mappings":";;;;;;AAuBA,IAAM,IAAyB,IAMzB,IAAsB;AAG5B,SAAS,EAAgB,GAAsC;CAC7D,IAAI,MAAa,KAAA,GAAW,OAAO;CAEnC,IAAI,CAAC,OAAO,UAAU,CAAQ,KAAK,IAAW,GAC5C,MAAM,IAAI,EAAuB,uDAAuD,GAAU;CAGpG,OAAO,KAAK,IAAI,GAAU,CAAmB;AAC/C;AAEA,IAAM,KAAgB,MAAsB,EAAE,UAAU,MAAM,CAAC,CAAC,QAAQ,WAAW,EAAE;AAErF,SAAS,EAAU,GAAe,GAAe,GAAoB,GAAkB,IAAQ,GAAW;CAuBxG,OAtBI,IAAQ,KAER,EAAM,CAAI,IAAU,IAEpB,EAAS,CAAI,KAAK,EAAS,CAAI,IAG1B,EAFG,IAAY,EAAa,OAAO,CAAI,CAAC,IAAI,OAAO,CAAI,GAEzC,CAAK,IAGxB,MAAM,QAAQ,CAAI,IACZ,EAAmB,QACxB,GAAK,MAAM,KAAK,IAAI,GAAK,EAAU,GAAG,GAAO,GAAW,GAAU,IAAQ,CAAC,CAAC,GAC7E,CACF,IAEE,OAAO,KAAS,WACX,OAAO,OAAO,CAA+B,CAAC,CAAC,QACnD,GAAK,MAAM,KAAK,IAAI,GAAK,EAAU,GAAG,GAAO,GAAW,GAAU,IAAQ,CAAC,CAAC,GAC7E,CACF,IAEK;AACT;AAEA,SAAS,EAAU,GAAe,GAAe,GAAmB,GAAoB,GAA2B;CACjH,OAAO,EAAU,GAAM,GAAO,GAAW,CAAQ,KAAK;AACxD;AAyBA,SAAgB,EAAe,GAAY,GAAe,IAA2B,CAAC,GAAQ;CAC5F,IAAM,EAAE,WAAQ,eAAY,IAAO,eAAY,QAAS,GAClD,IAAW,EAAgB,EAAQ,QAAQ;CAEjD,IAAI,CAAC,GAAO,OAAO,CAAC,GAAG,CAAK;CAE5B,IAAM,IAAM,EAAM,KAAK,CAAC,CAAC,YAAY;CAErC,IAAI,CAAC,GAAK,OAAO,CAAC,GAAG,CAAK;CAE1B,IAAM,IAAa,IAAY,EAAa,CAAG,IAAI;CAEnD,OAAO,EAAM,QAAQ,MACf,KAAU,EAAO,SAAS,KAAK,OAAO,KAAS,YAAY,IACtD,EAAO,MAAM,MAClB,EAAW,EAAiC,IAAQ,GAAY,GAAW,GAAW,CAAQ,CAChG,IAGK,EAAU,GAAM,GAAY,GAAW,GAAW,CAAQ,CAClE;AACH;AAyBA,SAAgB,EAAc,GAAY,GAAe,IAA2B,CAAC,GAAsB;CACzG,IAAM,EAAE,WAAQ,eAAY,IAAO,eAAY,QAAS,GAClD,IAAW,EAAgB,EAAQ,QAAQ;CAEjD,IAAI,CAAC,KAAS,CAAC,EAAM,KAAK,GACxB,OAAO,EAAM,KAAK,OAAU;EAAE;EAAM,OAAO;CAAE,EAAE;CAGjD,IAAM,IAAM,EAAM,KAAK,CAAC,CAAC,YAAY,GAC/B,IAAa,IAAY,EAAa,CAAG,IAAI;CAenD,OAbe,EAAM,KAAK,OAUjB;EAAE;EAAM,OARb,KAAU,EAAO,SAAS,KAAK,OAAO,KAAS,YAAY,IACvD,EAAO,QACJ,GAAK,MACJ,KAAK,IAAI,GAAK,EAAW,EAAiC,IAAQ,GAAY,GAAW,CAAQ,CAAC,GACpG,CACF,IACA,EAAU,GAAM,GAAY,GAAW,CAAQ;CAEhC,EAGhB,CAAA,CAAO,QAAQ,EAAE,eAAY,KAAS,CAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC1F;AAiBA,SAAgB,EACd,GACA,GACA,IAAkD,CAAC,GAC1B;CACzB,IAAM,EAAE,WAAQ,GAAG,MAAS;CAE5B,OAAO,IAAS,EAAW,GAAO,GAAO,CAAI,IAAI,EAAY,GAAO,GAAO,CAAI;AACjF"}

package/dist/array/sort.cjs

@@ -0,0 +1,2 @@
+const e=require("../errors.cjs"),t=require("./compare.cjs"),n=require("./compareBy.cjs");function r(r,i,a=`asc`){if(!Array.isArray(r))throw new e.ArsenalValidationError(`sort: first argument must be an array`);if(typeof i==`function`){let e=a===`desc`?-1:1;return[...r].sort((n,r)=>t.compare(i(n),i(r))*e)}return[...r].sort(n.compareBy(i))}exports.sort=r;
+//# sourceMappingURL=sort.cjs.map

package/dist/array/sort.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.cjs","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { compare } from './compare';\nimport { compareBy } from './compareBy';\n\nexport type SortDirection = 'asc' | 'desc';\nexport type SortSelectors<T> = Partial<Record<keyof T, SortDirection>>;\n\n/**\n * Sorts an array by a selector function (single-field) or by a multi-field\n * object of `{ key: 'asc' | 'desc' }` entries.\n *\n * @example\n * ```ts\n * // Single field\n * sort([{ a: 2 }, { a: 1 }], item => item.a); // [{ a:1 }, { a:2 }]\n * sort([{ a: 2 }, { a: 1 }], item => item.a, 'desc'); // [{ a:2 }, { a:1 }]\n *\n * // Multi-field\n * sort(users, { name: 'asc', age: 'desc' });\n * ```\n *\n * @param array - The array to sort.\n * @param selector - A function extracting the sort key, or a multi-field object.\n * @param direction - `'asc'` (default) or `'desc'` — only applies to single-field mode.\n * @returns A new sorted array.\n *\n * @throws {ArsenalValidationError} If the first argument is not an array.\n */\nexport function sort<T>(array: T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new ArsenalValidationError('sort: first argument must be an array');\n\n  if (typeof selectorOrSelectors === 'function') {\n    const multiplier = direction === 'desc' ? -1 : 1;\n\n    return [...array].sort((a, b) => compare(selectorOrSelectors(a), selectorOrSelectors(b)) * multiplier);\n  }\n\n  return [...array].sort(compareBy(selectorOrSelectors));\n}\n"],"mappings":"yFA8BA,SAAgB,EACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQ,CAAK,EAAG,MAAM,IAAI,EAAA,uBAAuB,uCAAuC,EAEnG,GAAI,OAAO,GAAwB,WAAY,CAC7C,IAAM,EAAa,IAAc,OAAS,GAAK,EAE/C,MAAO,CAAC,GAAG,CAAK,CAAC,CAAC,MAAM,EAAG,IAAM,EAAA,QAAQ,EAAoB,CAAC,EAAG,EAAoB,CAAC,CAAC,EAAI,CAAU,CACvG,CAEA,MAAO,CAAC,GAAG,CAAK,CAAC,CAAC,KAAK,EAAA,UAAU,CAAmB,CAAC,CACvD"}

package/dist/array/sort.d.ts

@@ -0,0 +1,26 @@
+export type SortDirection = 'asc' | 'desc';
+export type SortSelectors<T> = Partial<Record<keyof T, SortDirection>>;
+/**
+ * Sorts an array by a selector function (single-field) or by a multi-field
+ * object of `{ key: 'asc' | 'desc' }` entries.
+ *
+ * @example
+ * ```ts
+ * // Single field
+ * sort([{ a: 2 }, { a: 1 }], item => item.a); // [{ a:1 }, { a:2 }]
+ * sort([{ a: 2 }, { a: 1 }], item => item.a, 'desc'); // [{ a:2 }, { a:1 }]
+ *
+ * // Multi-field
+ * sort(users, { name: 'asc', age: 'desc' });
+ * ```
+ *
+ * @param array - The array to sort.
+ * @param selector - A function extracting the sort key, or a multi-field object.
+ * @param direction - `'asc'` (default) or `'desc'` — only applies to single-field mode.
+ * @returns A new sorted array.
+ *
+ * @throws {ArsenalValidationError} If the first argument is not an array.
+ */
+export declare function sort<T>(array: T[], selector: (item: T) => unknown, direction?: SortDirection): T[];
+export declare function sort<T>(array: T[], selectors: SortSelectors<T>): T[];
+//# sourceMappingURL=sort.d.ts.map

package/dist/array/sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.d.ts","sourceRoot":"","sources":["../../src/array/sort.ts"],"names":[],"mappings":"AAIA,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,MAAM,CAAC;AAC3C,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AAEvE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,SAAS,CAAC,EAAE,aAAa,GAAG,CAAC,EAAE,CAAC;AACpG,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC"}

package/dist/array/sort.js

@@ -0,0 +1,16 @@
+import { ArsenalValidationError as e } from "../errors.js";
+import { compare as t } from "./compare.js";
+import { compareBy as n } from "./compareBy.js";
+//#region src/array/sort.ts
+function r(r, i, a = "asc") {
+	if (!Array.isArray(r)) throw new e("sort: first argument must be an array");
+	if (typeof i == "function") {
+		let e = a === "desc" ? -1 : 1;
+		return [...r].sort((n, r) => t(i(n), i(r)) * e);
+	}
+	return [...r].sort(n(i));
+}
+//#endregion
+export { r as sort };
+
+//# sourceMappingURL=sort.js.map

package/dist/array/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { compare } from './compare';\nimport { compareBy } from './compareBy';\n\nexport type SortDirection = 'asc' | 'desc';\nexport type SortSelectors<T> = Partial<Record<keyof T, SortDirection>>;\n\n/**\n * Sorts an array by a selector function (single-field) or by a multi-field\n * object of `{ key: 'asc' | 'desc' }` entries.\n *\n * @example\n * ```ts\n * // Single field\n * sort([{ a: 2 }, { a: 1 }], item => item.a); // [{ a:1 }, { a:2 }]\n * sort([{ a: 2 }, { a: 1 }], item => item.a, 'desc'); // [{ a:2 }, { a:1 }]\n *\n * // Multi-field\n * sort(users, { name: 'asc', age: 'desc' });\n * ```\n *\n * @param array - The array to sort.\n * @param selector - A function extracting the sort key, or a multi-field object.\n * @param direction - `'asc'` (default) or `'desc'` — only applies to single-field mode.\n * @returns A new sorted array.\n *\n * @throws {ArsenalValidationError} If the first argument is not an array.\n */\nexport function sort<T>(array: T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new ArsenalValidationError('sort: first argument must be an array');\n\n  if (typeof selectorOrSelectors === 'function') {\n    const multiplier = direction === 'desc' ? -1 : 1;\n\n    return [...array].sort((a, b) => compare(selectorOrSelectors(a), selectorOrSelectors(b)) * multiplier);\n  }\n\n  return [...array].sort(compareBy(selectorOrSelectors));\n}\n"],"mappings":";;;;AA8BA,SAAgB,EACd,GACA,GACA,IAA2B,OACtB;CACL,IAAI,CAAC,MAAM,QAAQ,CAAK,GAAG,MAAM,IAAI,EAAuB,uCAAuC;CAEnG,IAAI,OAAO,KAAwB,YAAY;EAC7C,IAAM,IAAa,MAAc,SAAS,KAAK;EAE/C,OAAO,CAAC,GAAG,CAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAQ,EAAoB,CAAC,GAAG,EAAoB,CAAC,CAAC,IAAI,CAAU;CACvG;CAEA,OAAO,CAAC,GAAG,CAAK,CAAC,CAAC,KAAK,EAAU,CAAmB,CAAC;AACvD"}

package/dist/array/take.cjs

@@ -0,0 +1,2 @@
+function e(e,t=1){let n=Math.max(0,Math.floor(t));return e.slice(0,n)}exports.take=e;
+//# sourceMappingURL=take.cjs.map

package/dist/array/take.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"take.cjs","names":[],"sources":["../../src/array/take.ts"],"sourcesContent":["/**\n * Takes the first n elements from an array.\n */\nexport function take<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  return array.slice(0, count);\n}\n"],"mappings":"AAGA,SAAgB,EAAQ,EAAY,EAAI,EAAQ,CAC9C,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,CAAC,EAEvC,OAAO,EAAM,MAAM,EAAG,CAAK,CAC7B"}

package/dist/array/take.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Takes the first n elements from an array.
+ */
+export declare function take<T>(array: T[], n?: number): T[];
+//# sourceMappingURL=take.d.ts.map

package/dist/array/take.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"take.d.ts","sourceRoot":"","sources":["../../src/array/take.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,SAAI,GAAG,CAAC,EAAE,CAI9C"}

package/dist/array/take.js

@@ -0,0 +1,9 @@
+//#region src/array/take.ts
+function e(e, t = 1) {
+	let n = Math.max(0, Math.floor(t));
+	return e.slice(0, n);
+}
+//#endregion
+export { e as take };
+
+//# sourceMappingURL=take.js.map

package/dist/array/take.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"take.js","names":[],"sources":["../../src/array/take.ts"],"sourcesContent":["/**\n * Takes the first n elements from an array.\n */\nexport function take<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  return array.slice(0, count);\n}\n"],"mappings":";AAGA,SAAgB,EAAQ,GAAY,IAAI,GAAQ;CAC9C,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,CAAC;CAEvC,OAAO,EAAM,MAAM,GAAG,CAAK;AAC7B"}

package/dist/array/takeLast.cjs

@@ -0,0 +1,2 @@
+function e(e,t=1){let n=Math.max(0,Math.floor(t));return n===0?[]:e.slice(Math.max(0,e.length-n))}exports.takeLast=e;
+//# sourceMappingURL=takeLast.cjs.map

package/dist/array/takeLast.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"takeLast.cjs","names":[],"sources":["../../src/array/takeLast.ts"],"sourcesContent":["/**\n * Takes the last n elements from an array.\n */\nexport function takeLast<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  if (count === 0) return [];\n\n  return array.slice(Math.max(0, array.length - count));\n}\n"],"mappings":"AAGA,SAAgB,EAAY,EAAY,EAAI,EAAQ,CAClD,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,CAAC,EAIvC,OAFI,IAAU,EAAU,CAAC,EAElB,EAAM,MAAM,KAAK,IAAI,EAAG,EAAM,OAAS,CAAK,CAAC,CACtD"}

package/dist/array/takeLast.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Takes the last n elements from an array.
+ */
+export declare function takeLast<T>(array: T[], n?: number): T[];
+//# sourceMappingURL=takeLast.d.ts.map

package/dist/array/takeLast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"takeLast.d.ts","sourceRoot":"","sources":["../../src/array/takeLast.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,SAAI,GAAG,CAAC,EAAE,CAMlD"}

package/dist/array/takeLast.js

@@ -0,0 +1,9 @@
+//#region src/array/takeLast.ts
+function e(e, t = 1) {
+	let n = Math.max(0, Math.floor(t));
+	return n === 0 ? [] : e.slice(Math.max(0, e.length - n));
+}
+//#endregion
+export { e as takeLast };
+
+//# sourceMappingURL=takeLast.js.map

package/dist/array/takeLast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"takeLast.js","names":[],"sources":["../../src/array/takeLast.ts"],"sourcesContent":["/**\n * Takes the last n elements from an array.\n */\nexport function takeLast<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  if (count === 0) return [];\n\n  return array.slice(Math.max(0, array.length - count));\n}\n"],"mappings":";AAGA,SAAgB,EAAY,GAAY,IAAI,GAAQ;CAClD,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,CAAC;CAIvC,OAFI,MAAU,IAAU,CAAC,IAElB,EAAM,MAAM,KAAK,IAAI,GAAG,EAAM,SAAS,CAAK,CAAC;AACtD"}

package/dist/array/toggle.cjs

@@ -0,0 +1,2 @@
+function e(e,t,n,r={}){let{strategy:i=`append`}=r,a=n?e=>n(e)===n(t):e=>e===t,o=e.findIndex(a);return o===-1?i===`prepend`?[t,...e]:[...e,t]:[...e.slice(0,o),...e.slice(o+1)]}exports.toggle=e;
+//# sourceMappingURL=toggle.cjs.map

package/dist/array/toggle.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"toggle.cjs","names":[],"sources":["../../src/array/toggle.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\n/**\n * Either adds or removes an item from an array, based on whether it already\n * exists in the array (toggle behaviour).\n *\n * @example\n * ```ts\n * toggle([1, 2, 3], 4) // [1, 2, 3, 4]\n * toggle([1, 2, 3], 2) // [1, 3]\n *\n * toggle(\n *   [{ id: 1 }, { id: 2 }],\n *   { id: 3 },\n *   (obj) => obj.id,\n *   { strategy: 'prepend' }\n * ) // [{ id: 3 }, { id: 1 }, { id: 2 }]\n * ```\n *\n * @param array - The array to modify.\n * @param item - The item to add or remove.\n * @param selector - A function to determine item identity.\n * @param [options] - Options for the toggle operation.\n * @param [options.strategy] - Where to insert when adding: 'prepend' or 'append' (default).\n * @returns A new array with the item toggled.\n */\nexport function toggle<T>(\n  array: T[],\n  item: T,\n  selector?: (item: T) => Primitive,\n  options: { strategy?: 'prepend' | 'append' } = {},\n): T[] {\n  const { strategy = 'append' } = options;\n  const compareFn = selector ? (el: T) => selector(el) === selector(item) : (el: T) => el === item;\n\n  const index = array.findIndex(compareFn);\n\n  if (index !== -1) {\n    return [...array.slice(0, index), ...array.slice(index + 1)];\n  }\n\n  return strategy === 'prepend' ? [item, ...array] : [...array, item];\n}\n"],"mappings":"AA0BA,SAAgB,EACd,EACA,EACA,EACA,EAA+C,CAAC,EAC3C,CACL,GAAM,CAAE,WAAW,UAAa,EAC1B,EAAY,EAAY,GAAU,EAAS,CAAE,IAAM,EAAS,CAAI,EAAK,GAAU,IAAO,EAEtF,EAAQ,EAAM,UAAU,CAAS,EAMvC,OAJI,IAAU,GAIP,IAAa,UAAY,CAAC,EAAM,GAAG,CAAK,EAAI,CAAC,GAAG,EAAO,CAAI,EAHzD,CAAC,GAAG,EAAM,MAAM,EAAG,CAAK,EAAG,GAAG,EAAM,MAAM,EAAQ,CAAC,CAAC,CAI/D"}

package/dist/array/toggle.d.ts

@@ -0,0 +1,29 @@
+import type { Primitive } from '../types';
+/**
+ * Either adds or removes an item from an array, based on whether it already
+ * exists in the array (toggle behaviour).
+ *
+ * @example
+ * ```ts
+ * toggle([1, 2, 3], 4) // [1, 2, 3, 4]
+ * toggle([1, 2, 3], 2) // [1, 3]
+ *
+ * toggle(
+ *   [{ id: 1 }, { id: 2 }],
+ *   { id: 3 },
+ *   (obj) => obj.id,
+ *   { strategy: 'prepend' }
+ * ) // [{ id: 3 }, { id: 1 }, { id: 2 }]
+ * ```
+ *
+ * @param array - The array to modify.
+ * @param item - The item to add or remove.
+ * @param selector - A function to determine item identity.
+ * @param [options] - Options for the toggle operation.
+ * @param [options.strategy] - Where to insert when adding: 'prepend' or 'append' (default).
+ * @returns A new array with the item toggled.
+ */
+export declare function toggle<T>(array: T[], item: T, selector?: (item: T) => Primitive, options?: {
+    strategy?: 'prepend' | 'append';
+}): T[];
+//# sourceMappingURL=toggle.d.ts.map

package/dist/array/toggle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toggle.d.ts","sourceRoot":"","sources":["../../src/array/toggle.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAE1C;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,EACP,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,EACjC,OAAO,GAAE;IAAE,QAAQ,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAA;CAAO,GAChD,CAAC,EAAE,CAWL"}

package/dist/array/toggle.js

@@ -0,0 +1,9 @@
+//#region src/array/toggle.ts
+function e(e, t, n, r = {}) {
+	let { strategy: i = "append" } = r, a = n ? (e) => n(e) === n(t) : (e) => e === t, o = e.findIndex(a);
+	return o === -1 ? i === "prepend" ? [t, ...e] : [...e, t] : [...e.slice(0, o), ...e.slice(o + 1)];
+}
+//#endregion
+export { e as toggle };
+
+//# sourceMappingURL=toggle.js.map

package/dist/array/toggle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toggle.js","names":[],"sources":["../../src/array/toggle.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\n/**\n * Either adds or removes an item from an array, based on whether it already\n * exists in the array (toggle behaviour).\n *\n * @example\n * ```ts\n * toggle([1, 2, 3], 4) // [1, 2, 3, 4]\n * toggle([1, 2, 3], 2) // [1, 3]\n *\n * toggle(\n *   [{ id: 1 }, { id: 2 }],\n *   { id: 3 },\n *   (obj) => obj.id,\n *   { strategy: 'prepend' }\n * ) // [{ id: 3 }, { id: 1 }, { id: 2 }]\n * ```\n *\n * @param array - The array to modify.\n * @param item - The item to add or remove.\n * @param selector - A function to determine item identity.\n * @param [options] - Options for the toggle operation.\n * @param [options.strategy] - Where to insert when adding: 'prepend' or 'append' (default).\n * @returns A new array with the item toggled.\n */\nexport function toggle<T>(\n  array: T[],\n  item: T,\n  selector?: (item: T) => Primitive,\n  options: { strategy?: 'prepend' | 'append' } = {},\n): T[] {\n  const { strategy = 'append' } = options;\n  const compareFn = selector ? (el: T) => selector(el) === selector(item) : (el: T) => el === item;\n\n  const index = array.findIndex(compareFn);\n\n  if (index !== -1) {\n    return [...array.slice(0, index), ...array.slice(index + 1)];\n  }\n\n  return strategy === 'prepend' ? [item, ...array] : [...array, item];\n}\n"],"mappings":";AA0BA,SAAgB,EACd,GACA,GACA,GACA,IAA+C,CAAC,GAC3C;CACL,IAAM,EAAE,cAAW,aAAa,GAC1B,IAAY,KAAY,MAAU,EAAS,CAAE,MAAM,EAAS,CAAI,KAAK,MAAU,MAAO,GAEtF,IAAQ,EAAM,UAAU,CAAS;CAMvC,OAJI,MAAU,KAIP,MAAa,YAAY,CAAC,GAAM,GAAG,CAAK,IAAI,CAAC,GAAG,GAAO,CAAI,IAHzD,CAAC,GAAG,EAAM,MAAM,GAAG,CAAK,GAAG,GAAG,EAAM,MAAM,IAAQ,CAAC,CAAC;AAI/D"}

package/dist/array/union.cjs

@@ -0,0 +1,2 @@
+const e=require("../_common/_selectorSet.cjs");function t(t,n,r){return r?e.dedupeBySelector([...t,...n],r):[...new Set([...t,...n])]}exports.union=t;
+//# sourceMappingURL=union.cjs.map

package/dist/array/union.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.cjs","names":[],"sources":["../../src/array/union.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { dedupeBySelector } from '../_common/_selectorSet';\n\n/**\n * Returns a deduplicated union of both arrays.\n */\nexport function union<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    return [...new Set([...source, ...other])];\n  }\n\n  return dedupeBySelector([...source, ...other], selector);\n}\n"],"mappings":"+CAOA,SAAgB,EAAS,EAAa,EAAY,EAAwC,CAKxF,OAJK,EAIE,EAAA,iBAAiB,CAAC,GAAG,EAAQ,GAAG,CAAK,EAAG,CAAQ,EAH9C,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAQ,GAAG,CAAK,CAAC,CAAC,CAI7C"}

package/dist/array/union.d.ts

@@ -0,0 +1,6 @@
+import type { Primitive } from '../types';
+/**
+ * Returns a deduplicated union of both arrays.
+ */
+export declare function union<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[];
+//# sourceMappingURL=union.d.ts.map

package/dist/array/union.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.d.ts","sourceRoot":"","sources":["../../src/array/union.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAI1C;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,GAAG,CAAC,EAAE,CAMxF"}

package/dist/array/union.js

@@ -0,0 +1,9 @@
+import { dedupeBySelector as e } from "../_common/_selectorSet.js";
+//#region src/array/union.ts
+function t(t, n, r) {
+	return r ? e([...t, ...n], r) : [.../* @__PURE__ */ new Set([...t, ...n])];
+}
+//#endregion
+export { t as union };
+
+//# sourceMappingURL=union.js.map

package/dist/array/union.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.js","names":[],"sources":["../../src/array/union.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { dedupeBySelector } from '../_common/_selectorSet';\n\n/**\n * Returns a deduplicated union of both arrays.\n */\nexport function union<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    return [...new Set([...source, ...other])];\n  }\n\n  return dedupeBySelector([...source, ...other], selector);\n}\n"],"mappings":";;AAOA,SAAgB,EAAS,GAAa,GAAY,GAAwC;CAKxF,OAJK,IAIE,EAAiB,CAAC,GAAG,GAAQ,GAAG,CAAK,GAAG,CAAQ,IAH9C,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,GAAQ,GAAG,CAAK,CAAC,CAAC;AAI7C"}

package/dist/array/uniq.cjs

@@ -0,0 +1,2 @@
+const e=require("../_common/_selectorSet.cjs");function t(t,n){return t.length<=1?[...t]:n?e.dedupeBySelector(t,n):[...new Set(t)]}exports.uniq=t;
+//# sourceMappingURL=uniq.cjs.map

package/dist/array/uniq.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"uniq.cjs","names":[],"sources":["../../src/array/uniq.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { dedupeBySelector } from '../_common/_selectorSet';\n\n/**\n * Creates a new array with duplicate values removed.\n *\n * @example\n * ```ts\n * uniq([1, 2, 2, 3, 3, 3]); // [1, 2, 3]\n * const arrObj = [{ id: 1 }, { id: 2 }, { id: 2 }, { id: 3 }, { id: 3 }, { id: 3 }];\n * uniq(arrObj, item => item.id); // [{ id: 1 }, { id: 2 }, { id: 3 }]\n * ```\n *\n * @param array - The array to process.\n * @param [selector] - Function used to generate comparison values for each item.\n\n * @returns A new duplicate-free array.\n */\nexport function uniq<T>(array: T[], selector?: (item: T) => Primitive): T[] {\n  if (array.length <= 1) {\n    return [...array];\n  }\n\n  if (!selector) {\n    return [...new Set(array)];\n  }\n\n  return dedupeBySelector(array, selector);\n}\n"],"mappings":"+CAmBA,SAAgB,EAAQ,EAAY,EAAwC,CAS1E,OARI,EAAM,QAAU,EACX,CAAC,GAAG,CAAK,EAGb,EAIE,EAAA,iBAAiB,EAAO,CAAQ,EAH9B,CAAC,GAAG,IAAI,IAAI,CAAK,CAAC,CAI7B"}

package/dist/array/uniq.d.ts

@@ -0,0 +1,18 @@
+import type { Primitive } from '../types';
+/**
+ * Creates a new array with duplicate values removed.
+ *
+ * @example
+ * ```ts
+ * uniq([1, 2, 2, 3, 3, 3]); // [1, 2, 3]
+ * const arrObj = [{ id: 1 }, { id: 2 }, { id: 2 }, { id: 3 }, { id: 3 }, { id: 3 }];
+ * uniq(arrObj, item => item.id); // [{ id: 1 }, { id: 2 }, { id: 3 }]
+ * ```
+ *
+ * @param array - The array to process.
+ * @param [selector] - Function used to generate comparison values for each item.
+
+ * @returns A new duplicate-free array.
+ */
+export declare function uniq<T>(array: T[], selector?: (item: T) => Primitive): T[];
+//# sourceMappingURL=uniq.d.ts.map

package/dist/array/uniq.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uniq.d.ts","sourceRoot":"","sources":["../../src/array/uniq.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAI1C;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,GAAG,CAAC,EAAE,CAU1E"}

package/dist/array/uniq.js

@@ -0,0 +1,9 @@
+import { dedupeBySelector as e } from "../_common/_selectorSet.js";
+//#region src/array/uniq.ts
+function t(t, n) {
+	return t.length <= 1 ? [...t] : n ? e(t, n) : [...new Set(t)];
+}
+//#endregion
+export { t as uniq };
+
+//# sourceMappingURL=uniq.js.map

package/dist/array/uniq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uniq.js","names":[],"sources":["../../src/array/uniq.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { dedupeBySelector } from '../_common/_selectorSet';\n\n/**\n * Creates a new array with duplicate values removed.\n *\n * @example\n * ```ts\n * uniq([1, 2, 2, 3, 3, 3]); // [1, 2, 3]\n * const arrObj = [{ id: 1 }, { id: 2 }, { id: 2 }, { id: 3 }, { id: 3 }, { id: 3 }];\n * uniq(arrObj, item => item.id); // [{ id: 1 }, { id: 2 }, { id: 3 }]\n * ```\n *\n * @param array - The array to process.\n * @param [selector] - Function used to generate comparison values for each item.\n\n * @returns A new duplicate-free array.\n */\nexport function uniq<T>(array: T[], selector?: (item: T) => Primitive): T[] {\n  if (array.length <= 1) {\n    return [...array];\n  }\n\n  if (!selector) {\n    return [...new Set(array)];\n  }\n\n  return dedupeBySelector(array, selector);\n}\n"],"mappings":";;AAmBA,SAAgB,EAAQ,GAAY,GAAwC;CAS1E,OARI,EAAM,UAAU,IACX,CAAC,GAAG,CAAK,IAGb,IAIE,EAAiB,GAAO,CAAQ,IAH9B,CAAC,GAAG,IAAI,IAAI,CAAK,CAAC;AAI7B"}

package/dist/array/unzip.cjs

@@ -0,0 +1,2 @@
+function e(e){if(e.length===0)return[];let t=e[0].length,n=Array.from({length:t},()=>[]);for(let r of e)for(let e=0;e<t;e++)n[e].push(r[e]);return n}exports.unzip=e;
+//# sourceMappingURL=unzip.cjs.map

package/dist/array/unzip.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"unzip.cjs","names":[],"sources":["../../src/array/unzip.ts"],"sourcesContent":["/**\n * Transposes an array of tuples into tuple arrays.\n */\nexport function unzip<T extends readonly unknown[]>(rows: readonly T[]): { [K in keyof T]: Array<T[K]> } {\n  if (rows.length === 0) return [] as unknown as { [K in keyof T]: Array<T[K]> };\n\n  const width = rows[0].length;\n  const out = Array.from({ length: width }, () => [] as unknown[]);\n\n  for (const row of rows) {\n    for (let index = 0; index < width; index++) {\n      out[index].push(row[index]);\n    }\n  }\n\n  return out as { [K in keyof T]: Array<T[K]> };\n}\n"],"mappings":"AAGA,SAAgB,EAAoC,EAAqD,CACvG,GAAI,EAAK,SAAW,EAAG,MAAO,CAAC,EAE/B,IAAM,EAAQ,EAAK,EAAE,CAAC,OAChB,EAAM,MAAM,KAAK,CAAE,OAAQ,CAAM,MAAS,CAAC,CAAc,EAE/D,IAAK,IAAM,KAAO,EAChB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAO,IACjC,EAAI,EAAM,CAAC,KAAK,EAAI,EAAM,EAI9B,OAAO,CACT"}

package/dist/array/unzip.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Transposes an array of tuples into tuple arrays.
+ */
+export declare function unzip<T extends readonly unknown[]>(rows: readonly T[]): {
+    [K in keyof T]: Array<T[K]>;
+};
+//# sourceMappingURL=unzip.d.ts.map

package/dist/array/unzip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unzip.d.ts","sourceRoot":"","sources":["../../src/array/unzip.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,CAavG"}

package/dist/array/unzip.js

@@ -0,0 +1,11 @@
+//#region src/array/unzip.ts
+function e(e) {
+	if (e.length === 0) return [];
+	let t = e[0].length, n = Array.from({ length: t }, () => []);
+	for (let r of e) for (let e = 0; e < t; e++) n[e].push(r[e]);
+	return n;
+}
+//#endregion
+export { e as unzip };
+
+//# sourceMappingURL=unzip.js.map

package/dist/array/unzip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unzip.js","names":[],"sources":["../../src/array/unzip.ts"],"sourcesContent":["/**\n * Transposes an array of tuples into tuple arrays.\n */\nexport function unzip<T extends readonly unknown[]>(rows: readonly T[]): { [K in keyof T]: Array<T[K]> } {\n  if (rows.length === 0) return [] as unknown as { [K in keyof T]: Array<T[K]> };\n\n  const width = rows[0].length;\n  const out = Array.from({ length: width }, () => [] as unknown[]);\n\n  for (const row of rows) {\n    for (let index = 0; index < width; index++) {\n      out[index].push(row[index]);\n    }\n  }\n\n  return out as { [K in keyof T]: Array<T[K]> };\n}\n"],"mappings":";AAGA,SAAgB,EAAoC,GAAqD;CACvG,IAAI,EAAK,WAAW,GAAG,OAAO,CAAC;CAE/B,IAAM,IAAQ,EAAK,EAAE,CAAC,QAChB,IAAM,MAAM,KAAK,EAAE,QAAQ,EAAM,SAAS,CAAC,CAAc;CAE/D,KAAK,IAAM,KAAO,GAChB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAO,KACjC,EAAI,EAAM,CAAC,KAAK,EAAI,EAAM;CAI9B,OAAO;AACT"}

package/dist/array/zip.cjs

@@ -0,0 +1,2 @@
+function e(...e){if(e.length===0)return[];let t=Math.max(...e.map(e=>e.length)),n=Array(t);for(let r=0;r<t;r++)n[r]=e.map(e=>e[r]);return n}exports.zip=e;
+//# sourceMappingURL=zip.cjs.map

package/dist/array/zip.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"zip.cjs","names":[],"sources":["../../src/array/zip.ts"],"sourcesContent":["/**\n * Zips multiple arrays by index.\n */\nexport function zip<T extends readonly unknown[][]>(\n  ...arrays: T\n): Array<{ [K in keyof T]: T[K] extends readonly (infer U)[] ? U | undefined : never }> {\n  if (arrays.length === 0) return [];\n\n  const length = Math.max(...arrays.map((arr) => arr.length));\n  const out = new Array(length);\n\n  for (let index = 0; index < length; index++) {\n    out[index] = arrays.map((array) => array[index]);\n  }\n\n  return out as Array<{ [K in keyof T]: T[K] extends readonly (infer U)[] ? U | undefined : never }>;\n}\n"],"mappings":"AAGA,SAAgB,EACd,GAAG,EACmF,CACtF,GAAI,EAAO,SAAW,EAAG,MAAO,CAAC,EAEjC,IAAM,EAAS,KAAK,IAAI,GAAG,EAAO,IAAK,GAAQ,EAAI,MAAM,CAAC,EACpD,EAAU,MAAM,CAAM,EAE5B,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAQ,IAClC,EAAI,GAAS,EAAO,IAAK,GAAU,EAAM,EAAM,EAGjD,OAAO,CACT"}

package/dist/array/zip.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Zips multiple arrays by index.
+ */
+export declare function zip<T extends readonly unknown[][]>(...arrays: T): Array<{
+    [K in keyof T]: T[K] extends readonly (infer U)[] ? U | undefined : never;
+}>;
+//# sourceMappingURL=zip.d.ts.map

package/dist/array/zip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"zip.d.ts","sourceRoot":"","sources":["../../src/array/zip.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,GAAG,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,EAChD,GAAG,MAAM,EAAE,CAAC,GACX,KAAK,CAAC;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,KAAK;CAAE,CAAC,CAWtF"}

package/dist/array/zip.js

@@ -0,0 +1,11 @@
+//#region src/array/zip.ts
+function e(...e) {
+	if (e.length === 0) return [];
+	let t = Math.max(...e.map((e) => e.length)), n = Array(t);
+	for (let r = 0; r < t; r++) n[r] = e.map((e) => e[r]);
+	return n;
+}
+//#endregion
+export { e as zip };
+
+//# sourceMappingURL=zip.js.map

package/dist/array/zip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zip.js","names":[],"sources":["../../src/array/zip.ts"],"sourcesContent":["/**\n * Zips multiple arrays by index.\n */\nexport function zip<T extends readonly unknown[][]>(\n  ...arrays: T\n): Array<{ [K in keyof T]: T[K] extends readonly (infer U)[] ? U | undefined : never }> {\n  if (arrays.length === 0) return [];\n\n  const length = Math.max(...arrays.map((arr) => arr.length));\n  const out = new Array(length);\n\n  for (let index = 0; index < length; index++) {\n    out[index] = arrays.map((array) => array[index]);\n  }\n\n  return out as Array<{ [K in keyof T]: T[K] extends readonly (infer U)[] ? U | undefined : never }>;\n}\n"],"mappings":";AAGA,SAAgB,EACd,GAAG,GACmF;CACtF,IAAI,EAAO,WAAW,GAAG,OAAO,CAAC;CAEjC,IAAM,IAAS,KAAK,IAAI,GAAG,EAAO,KAAK,MAAQ,EAAI,MAAM,CAAC,GACpD,IAAU,MAAM,CAAM;CAE5B,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAQ,KAClC,EAAI,KAAS,EAAO,KAAK,MAAU,EAAM,EAAM;CAGjD,OAAO;AACT"}