@vielzeug/arsenal 3.0.0 → 26.10.0

package/dist/array/first.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"first.cjs","names":[],"sources":["../../src/array/first.ts"],"sourcesContent":["/**\n * Returns the first element or fallback when array is empty.\n */\nexport function first<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,EAAS,EAAqB,EAA6B,CACzE,OAAO,EAAM,OAAS,EAAI,EAAM,GAAK,CACvC"}
+{"version":3,"file":"first.cjs","names":[],"sources":["../../src/array/first.ts"],"sourcesContent":["/**\n * Returns the first element or fallback when array is empty.\n */\nexport function first<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,MAAS,EAAqB,EAA6B,CACzE,OAAO,EAAM,OAAS,EAAI,EAAM,GAAK,CACvC"}

package/dist/array/first.js

@@ -1,8 +1,2 @@
-//#region src/array/first.ts
-function e(e, t) {
-	return e.length > 0 ? e[0] : t;
-}
-//#endregion
-export { e as first };
-
+function first(e,t){return e.length>0?e[0]:t}export{first};
 //# sourceMappingURL=first.js.map

package/dist/array/first.js.map

@@ -1 +1 @@
-{"version":3,"file":"first.js","names":[],"sources":["../../src/array/first.ts"],"sourcesContent":["/**\n * Returns the first element or fallback when array is empty.\n */\nexport function first<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":";AAGA,SAAgB,EAAS,GAAqB,GAA6B;CACzE,OAAO,EAAM,SAAS,IAAI,EAAM,KAAK;AACvC"}
+{"version":3,"file":"first.js","names":[],"sources":["../../src/array/first.ts"],"sourcesContent":["/**\n * Returns the first element or fallback when array is empty.\n */\nexport function first<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,MAAS,EAAqB,EAA6B,CACzE,OAAO,EAAM,OAAS,EAAI,EAAM,GAAK,CACvC"}

package/dist/array/groupBy.cjs

@@ -1,2 +1,2 @@
-const e=require("../_common/unsafePaths.cjs");function t(t,n){let r={};for(let i of t){let t=n(i),a=t==null?`_`:String(t);e.isUnsafeKey(a)||(r[a]||(r[a]=[]),r[a].push(i))}return r}exports.groupBy=t;
+const e=require("../_common/unsafePaths.cjs");function groupBy(t,n){let r={};for(let i of t){let t=n(i),a=t==null?`_`:String(t);e.isUnsafeKey(a)||(r[a]||(r[a]=[]),r[a].push(i))}return r}exports.groupBy=groupBy;
 //# sourceMappingURL=groupBy.cjs.map

package/dist/array/groupBy.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"groupBy.cjs","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T[]> {\n  const result: Record<string, T[]> = {};\n\n  for (const item of array) {\n    const rawKey = selector(item);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    if (!result[key]) {\n      result[key] = [];\n    }\n\n    result[key].push(item);\n  }\n\n  return result;\n}\n"],"mappings":"8CAOA,SAAgB,EAAW,EAAqB,EAAuD,CACrG,IAAM,EAA8B,CAAC,EAErC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAS,EAAS,CAAI,EACtB,EAAM,GAAmC,KAAO,IAAM,OAAO,CAAM,EAErE,EAAA,YAAY,CAAG,IAEd,EAAO,KACV,EAAO,GAAO,CAAC,GAGjB,EAAO,EAAI,CAAC,KAAK,CAAI,EACvB,CAEA,OAAO,CACT"}
+{"version":3,"file":"groupBy.cjs","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T[]> {\n  const result: Record<string, T[]> = {};\n\n  for (const item of array) {\n    const rawKey = selector(item);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    if (!result[key]) {\n      result[key] = [];\n    }\n\n    result[key].push(item);\n  }\n\n  return result;\n}\n"],"mappings":"8CAOA,SAAgB,QAAW,EAAqB,EAAuD,CACrG,IAAM,EAA8B,CAAC,EAErC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAS,EAAS,CAAI,EACtB,EAAM,GAAmC,KAAO,IAAM,OAAO,CAAM,EAErE,EAAA,YAAY,CAAG,IAEd,EAAO,KACV,EAAO,GAAO,CAAC,GAGjB,EAAO,EAAI,CAAC,KAAK,CAAI,EACvB,CAEA,OAAO,CACT"}

package/dist/array/groupBy.js

@@ -1,14 +1,2 @@
-import { isUnsafeKey as e } from "../_common/unsafePaths.js";
-//#region src/array/groupBy.ts
-function t(t, n) {
-	let r = {};
-	for (let i of t) {
-		let t = n(i), a = t == null ? "_" : String(t);
-		e(a) || (r[a] || (r[a] = []), r[a].push(i));
-	}
-	return r;
-}
-//#endregion
-export { t as groupBy };
-
+import{isUnsafeKey as e}from"../_common/unsafePaths.js";function groupBy(t,n){let r={};for(let i of t){let t=n(i),a=t==null?`_`:String(t);e(a)||(r[a]||(r[a]=[]),r[a].push(i))}return r}export{groupBy};
 //# sourceMappingURL=groupBy.js.map

package/dist/array/groupBy.js.map

@@ -1 +1 @@
-{"version":3,"file":"groupBy.js","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T[]> {\n  const result: Record<string, T[]> = {};\n\n  for (const item of array) {\n    const rawKey = selector(item);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    if (!result[key]) {\n      result[key] = [];\n    }\n\n    result[key].push(item);\n  }\n\n  return result;\n}\n"],"mappings":";;AAOA,SAAgB,EAAW,GAAqB,GAAuD;CACrG,IAAM,IAA8B,CAAC;CAErC,KAAK,IAAM,KAAQ,GAAO;EACxB,IAAM,IAAS,EAAS,CAAI,GACtB,IAAM,KAAmC,OAAO,MAAM,OAAO,CAAM;EAErE,EAAY,CAAG,MAEd,EAAO,OACV,EAAO,KAAO,CAAC,IAGjB,EAAO,EAAI,CAAC,KAAK,CAAI;CACvB;CAEA,OAAO;AACT"}
+{"version":3,"file":"groupBy.js","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T[]> {\n  const result: Record<string, T[]> = {};\n\n  for (const item of array) {\n    const rawKey = selector(item);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    if (!result[key]) {\n      result[key] = [];\n    }\n\n    result[key].push(item);\n  }\n\n  return result;\n}\n"],"mappings":"wDAOA,SAAgB,QAAW,EAAqB,EAAuD,CACrG,IAAM,EAA8B,CAAC,EAErC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAS,EAAS,CAAI,EACtB,EAAM,GAAmC,KAAO,IAAM,OAAO,CAAM,EAErE,EAAY,CAAG,IAEd,EAAO,KACV,EAAO,GAAO,CAAC,GAGjB,EAAO,EAAI,CAAC,KAAK,CAAI,EACvB,CAEA,OAAO,CACT"}

package/dist/array/index.js

@@ -1,28 +1 @@
-import { chunk as e } from "./chunk.js";
-import { compact as t } from "./compact.js";
-import { compare as n } from "./compare.js";
-import { compareBy as r } from "./compareBy.js";
-import { contains as i } from "./contains.js";
-import { countBy as a } from "./countBy.js";
-import { difference as o } from "./difference.js";
-import { drop as s } from "./drop.js";
-import { dropLast as c } from "./dropLast.js";
-import { filterMap as l } from "./filterMap.js";
-import { first as u } from "./first.js";
-import { groupBy as d } from "./groupBy.js";
-import { indexBy as f } from "./indexBy.js";
-import { intersection as p } from "./intersection.js";
-import { last as m } from "./last.js";
-import { partition as h } from "./partition.js";
-import { replace as g } from "./replace.js";
-import { rotate as _ } from "./rotate.js";
-import { fuzzyFilter as v, fuzzyScore as y } from "./search.js";
-import { sort as b } from "./sort.js";
-import { take as x } from "./take.js";
-import { takeLast as S } from "./takeLast.js";
-import { toggle as C } from "./toggle.js";
-import { union as w } from "./union.js";
-import { uniq as T } from "./uniq.js";
-import { unzip as E } from "./unzip.js";
-import { zip as D } from "./zip.js";
-export { e as chunk, t as compact, n as compare, r as compareBy, i as contains, a as countBy, o as difference, s as drop, c as dropLast, l as filterMap, u as first, v as fuzzyFilter, y as fuzzyScore, d as groupBy, f as indexBy, p as intersection, m as last, h as partition, g as replace, _ as rotate, b as sort, x as take, S as takeLast, C as toggle, w as union, T as uniq, E as unzip, D as zip };
+import{chunk as e}from"./chunk.js";import{compact as t}from"./compact.js";import{compare as n}from"./compare.js";import{compareBy as r}from"./compareBy.js";import{contains as i}from"./contains.js";import{countBy as a}from"./countBy.js";import{difference as o}from"./difference.js";import{drop as s}from"./drop.js";import{dropLast as c}from"./dropLast.js";import{filterMap as l}from"./filterMap.js";import{first as u}from"./first.js";import{groupBy as d}from"./groupBy.js";import{indexBy as f}from"./indexBy.js";import{intersection as p}from"./intersection.js";import{last as m}from"./last.js";import{partition as h}from"./partition.js";import{replace as g}from"./replace.js";import{rotate as _}from"./rotate.js";import{fuzzyFilter as v,fuzzyScore as y}from"./search.js";import{sort as b}from"./sort.js";import{take as x}from"./take.js";import{takeLast as S}from"./takeLast.js";import{toggle as C}from"./toggle.js";import{union as w}from"./union.js";import{uniq as T}from"./uniq.js";import{unzip as E}from"./unzip.js";import{zip as D}from"./zip.js";export{e as chunk,t as compact,n as compare,r as compareBy,i as contains,a as countBy,o as difference,s as drop,c as dropLast,l as filterMap,u as first,v as fuzzyFilter,y as fuzzyScore,d as groupBy,f as indexBy,p as intersection,m as last,h as partition,g as replace,_ as rotate,b as sort,x as take,S as takeLast,C as toggle,w as union,T as uniq,E as unzip,D as zip};

package/dist/array/indexBy.cjs

@@ -1,2 +1,2 @@
-const e=require("../_common/unsafePaths.cjs");function t(t,n){let r={};for(let i of t){let t=String(n(i));e.isUnsafeKey(t)||(r[t]=i)}return r}exports.indexBy=t;
+const e=require("../_common/unsafePaths.cjs");function indexBy(t,n){let r={};for(let i of t){let t=String(n(i));e.isUnsafeKey(t)||(r[t]=i)}return r}exports.indexBy=indexBy;
 //# sourceMappingURL=indexBy.cjs.map

package/dist/array/indexBy.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"indexBy.cjs","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Creates an object keyed by selector result. Last item wins on collisions. Dangerous keys\n * (`__proto__`, `constructor`, `prototype`) are skipped.\n */\nexport function indexBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T> {\n  const result: Record<string, T> = {};\n\n  for (const item of array) {\n    const key = String(selector(item));\n\n    if (isUnsafeKey(key)) continue;\n\n    result[key] = item;\n  }\n\n  return result;\n}\n"],"mappings":"8CAOA,SAAgB,EAAW,EAAqB,EAAqD,CACnG,IAAM,EAA4B,CAAC,EAEnC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAM,OAAO,EAAS,CAAI,CAAC,EAE7B,EAAA,YAAY,CAAG,IAEnB,EAAO,GAAO,EAChB,CAEA,OAAO,CACT"}
+{"version":3,"file":"indexBy.cjs","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Creates an object keyed by selector result. Last item wins on collisions. Dangerous keys\n * (`__proto__`, `constructor`, `prototype`) are skipped.\n */\nexport function indexBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T> {\n  const result: Record<string, T> = {};\n\n  for (const item of array) {\n    const key = String(selector(item));\n\n    if (isUnsafeKey(key)) continue;\n\n    result[key] = item;\n  }\n\n  return result;\n}\n"],"mappings":"8CAOA,SAAgB,QAAW,EAAqB,EAAqD,CACnG,IAAM,EAA4B,CAAC,EAEnC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAM,OAAO,EAAS,CAAI,CAAC,EAE7B,EAAA,YAAY,CAAG,IAEnB,EAAO,GAAO,EAChB,CAEA,OAAO,CACT"}

package/dist/array/indexBy.js

@@ -1,14 +1,2 @@
-import { isUnsafeKey as e } from "../_common/unsafePaths.js";
-//#region src/array/indexBy.ts
-function t(t, n) {
-	let r = {};
-	for (let i of t) {
-		let t = String(n(i));
-		e(t) || (r[t] = i);
-	}
-	return r;
-}
-//#endregion
-export { t as indexBy };
-
+import{isUnsafeKey as e}from"../_common/unsafePaths.js";function indexBy(t,n){let r={};for(let i of t){let t=String(n(i));e(t)||(r[t]=i)}return r}export{indexBy};
 //# sourceMappingURL=indexBy.js.map

package/dist/array/indexBy.js.map

@@ -1 +1 @@
-{"version":3,"file":"indexBy.js","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Creates an object keyed by selector result. Last item wins on collisions. Dangerous keys\n * (`__proto__`, `constructor`, `prototype`) are skipped.\n */\nexport function indexBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T> {\n  const result: Record<string, T> = {};\n\n  for (const item of array) {\n    const key = String(selector(item));\n\n    if (isUnsafeKey(key)) continue;\n\n    result[key] = item;\n  }\n\n  return result;\n}\n"],"mappings":";;AAOA,SAAgB,EAAW,GAAqB,GAAqD;CACnG,IAAM,IAA4B,CAAC;CAEnC,KAAK,IAAM,KAAQ,GAAO;EACxB,IAAM,IAAM,OAAO,EAAS,CAAI,CAAC;EAE7B,EAAY,CAAG,MAEnB,EAAO,KAAO;CAChB;CAEA,OAAO;AACT"}
+{"version":3,"file":"indexBy.js","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import { isUnsafeKey } from '../_common/unsafePaths';\nimport type { Primitive } from '../types';\n\n/**\n * Creates an object keyed by selector result. Last item wins on collisions. Dangerous keys\n * (`__proto__`, `constructor`, `prototype`) are skipped.\n */\nexport function indexBy<T>(array: readonly T[], selector: (item: T) => Primitive): Record<string, T> {\n  const result: Record<string, T> = {};\n\n  for (const item of array) {\n    const key = String(selector(item));\n\n    if (isUnsafeKey(key)) continue;\n\n    result[key] = item;\n  }\n\n  return result;\n}\n"],"mappings":"wDAOA,SAAgB,QAAW,EAAqB,EAAqD,CACnG,IAAM,EAA4B,CAAC,EAEnC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAM,OAAO,EAAS,CAAI,CAAC,EAE7B,EAAY,CAAG,IAEnB,EAAO,GAAO,EAChB,CAEA,OAAO,CACT"}

package/dist/array/intersection.cjs

@@ -1,2 +1,2 @@
-const e=require("../_common/_selectorSet.cjs");function t(t,n,r){if(!r){let e=new Set(n);return t.filter(t=>e.has(t))}let i=e.toSelectorSet(n,r);return t.filter(e=>i.has(r(e)))}exports.intersection=t;
+const e=require("../_common/_selectorSet.cjs");function intersection(t,n,r){if(!r){let e=new Set(n);return t.filter(t=>e.has(t))}let i=e.toSelectorSet(n,r);return t.filter(e=>i.has(r(e)))}exports.intersection=intersection;
 //# sourceMappingURL=intersection.cjs.map

package/dist/array/intersection.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"intersection.cjs","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import { toSelectorSet } from '../_common/_selectorSet';\nimport type { Primitive } from '../types';\n\n/**\n * Returns elements that are present in both `source` and `other`.\n *\n * Allocates a `Set` from `other` for O(1) membership checks, plus a new array for the result.\n */\nexport function intersection<T>(source: readonly T[], other: readonly T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const allow = new Set(other);\n\n    return source.filter((item) => allow.has(item));\n  }\n\n  const allow = toSelectorSet(other, selector);\n\n  return source.filter((item) => allow.has(selector(item)));\n}\n"],"mappings":"+CAQA,SAAgB,EAAgB,EAAsB,EAAqB,EAAwC,CACjH,GAAI,CAAC,EAAU,CACb,IAAM,EAAQ,IAAI,IAAI,CAAK,EAE3B,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,CAAI,CAAC,CAChD,CAEA,IAAM,EAAQ,EAAA,cAAc,EAAO,CAAQ,EAE3C,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,EAAS,CAAI,CAAC,CAAC,CAC1D"}
+{"version":3,"file":"intersection.cjs","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import { toSelectorSet } from '../_common/_selectorSet';\nimport type { Primitive } from '../types';\n\n/**\n * Returns elements that are present in both `source` and `other`.\n *\n * Allocates a `Set` from `other` for O(1) membership checks, plus a new array for the result.\n */\nexport function intersection<T>(source: readonly T[], other: readonly T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const allow = new Set(other);\n\n    return source.filter((item) => allow.has(item));\n  }\n\n  const allow = toSelectorSet(other, selector);\n\n  return source.filter((item) => allow.has(selector(item)));\n}\n"],"mappings":"+CAQA,SAAgB,aAAgB,EAAsB,EAAqB,EAAwC,CACjH,GAAI,CAAC,EAAU,CACb,IAAM,EAAQ,IAAI,IAAI,CAAK,EAE3B,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,CAAI,CAAC,CAChD,CAEA,IAAM,EAAQ,EAAA,cAAc,EAAO,CAAQ,EAE3C,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,EAAS,CAAI,CAAC,CAAC,CAC1D"}

package/dist/array/intersection.js

@@ -1,14 +1,2 @@
-import { toSelectorSet as e } from "../_common/_selectorSet.js";
-//#region src/array/intersection.ts
-function t(t, n, r) {
-	if (!r) {
-		let e = new Set(n);
-		return t.filter((t) => e.has(t));
-	}
-	let i = e(n, r);
-	return t.filter((e) => i.has(r(e)));
-}
-//#endregion
-export { t as intersection };
-
+import{toSelectorSet as e}from"../_common/_selectorSet.js";function intersection(t,n,r){if(!r){let e=new Set(n);return t.filter(t=>e.has(t))}let i=e(n,r);return t.filter(e=>i.has(r(e)))}export{intersection};
 //# sourceMappingURL=intersection.js.map

package/dist/array/intersection.js.map

@@ -1 +1 @@
-{"version":3,"file":"intersection.js","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import { toSelectorSet } from '../_common/_selectorSet';\nimport type { Primitive } from '../types';\n\n/**\n * Returns elements that are present in both `source` and `other`.\n *\n * Allocates a `Set` from `other` for O(1) membership checks, plus a new array for the result.\n */\nexport function intersection<T>(source: readonly T[], other: readonly T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const allow = new Set(other);\n\n    return source.filter((item) => allow.has(item));\n  }\n\n  const allow = toSelectorSet(other, selector);\n\n  return source.filter((item) => allow.has(selector(item)));\n}\n"],"mappings":";;AAQA,SAAgB,EAAgB,GAAsB,GAAqB,GAAwC;CACjH,IAAI,CAAC,GAAU;EACb,IAAM,IAAQ,IAAI,IAAI,CAAK;EAE3B,OAAO,EAAO,QAAQ,MAAS,EAAM,IAAI,CAAI,CAAC;CAChD;CAEA,IAAM,IAAQ,EAAc,GAAO,CAAQ;CAE3C,OAAO,EAAO,QAAQ,MAAS,EAAM,IAAI,EAAS,CAAI,CAAC,CAAC;AAC1D"}
+{"version":3,"file":"intersection.js","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import { toSelectorSet } from '../_common/_selectorSet';\nimport type { Primitive } from '../types';\n\n/**\n * Returns elements that are present in both `source` and `other`.\n *\n * Allocates a `Set` from `other` for O(1) membership checks, plus a new array for the result.\n */\nexport function intersection<T>(source: readonly T[], other: readonly T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const allow = new Set(other);\n\n    return source.filter((item) => allow.has(item));\n  }\n\n  const allow = toSelectorSet(other, selector);\n\n  return source.filter((item) => allow.has(selector(item)));\n}\n"],"mappings":"2DAQA,SAAgB,aAAgB,EAAsB,EAAqB,EAAwC,CACjH,GAAI,CAAC,EAAU,CACb,IAAM,EAAQ,IAAI,IAAI,CAAK,EAE3B,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,CAAI,CAAC,CAChD,CAEA,IAAM,EAAQ,EAAc,EAAO,CAAQ,EAE3C,OAAO,EAAO,OAAQ,GAAS,EAAM,IAAI,EAAS,CAAI,CAAC,CAAC,CAC1D"}

package/dist/array/last.cjs

@@ -1,2 +1,2 @@
-function e(e,t){return e.length>0?e[e.length-1]:t}exports.last=e;
+function last(e,t){return e.length>0?e[e.length-1]:t}exports.last=last;
 //# sourceMappingURL=last.cjs.map

package/dist/array/last.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"last.cjs","names":[],"sources":["../../src/array/last.ts"],"sourcesContent":["/**\n * Returns the last element or fallback when array is empty.\n */\nexport function last<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,EAAQ,EAAqB,EAA6B,CACxE,OAAO,EAAM,OAAS,EAAI,EAAM,EAAM,OAAS,GAAK,CACtD"}
+{"version":3,"file":"last.cjs","names":[],"sources":["../../src/array/last.ts"],"sourcesContent":["/**\n * Returns the last element or fallback when array is empty.\n */\nexport function last<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,KAAQ,EAAqB,EAA6B,CACxE,OAAO,EAAM,OAAS,EAAI,EAAM,EAAM,OAAS,GAAK,CACtD"}

package/dist/array/last.js

@@ -1,8 +1,2 @@
-//#region src/array/last.ts
-function e(e, t) {
-	return e.length > 0 ? e[e.length - 1] : t;
-}
-//#endregion
-export { e as last };
-
+function last(e,t){return e.length>0?e[e.length-1]:t}export{last};
 //# sourceMappingURL=last.js.map

package/dist/array/last.js.map

@@ -1 +1 @@
-{"version":3,"file":"last.js","names":[],"sources":["../../src/array/last.ts"],"sourcesContent":["/**\n * Returns the last element or fallback when array is empty.\n */\nexport function last<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":";AAGA,SAAgB,EAAQ,GAAqB,GAA6B;CACxE,OAAO,EAAM,SAAS,IAAI,EAAM,EAAM,SAAS,KAAK;AACtD"}
+{"version":3,"file":"last.js","names":[],"sources":["../../src/array/last.ts"],"sourcesContent":["/**\n * Returns the last element or fallback when array is empty.\n */\nexport function last<T>(array: readonly T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,KAAQ,EAAqB,EAA6B,CACxE,OAAO,EAAM,OAAS,EAAI,EAAM,EAAM,OAAS,GAAK,CACtD"}

package/dist/array/partition.cjs

@@ -1,2 +1,2 @@
-function e(e,t){let n=[],r=[];for(let i=0;i<e.length;i++)t(e[i],i,e)?n.push(e[i]):r.push(e[i]);return[n,r]}exports.partition=e;
+function partition(e,t){let n=[],r=[];for(let i=0;i<e.length;i++)t(e[i],i,e)?n.push(e[i]):r.push(e[i]);return[n,r]}exports.partition=partition;
 //# sourceMappingURL=partition.cjs.map

package/dist/array/partition.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"partition.cjs","names":[],"sources":["../../src/array/partition.ts"],"sourcesContent":["/**\n * Splits an array into values that match and do not match the predicate.\n *\n * Allocates two new arrays for the accepted and rejected partitions.\n */\nexport function partition<T>(\n  array: readonly T[],\n  predicate: (item: T, index: number, array: readonly T[]) => boolean,\n): [T[], T[]] {\n  const accepted: T[] = [];\n  const rejected: T[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    if (predicate(array[index], index, array)) {\n      accepted.push(array[index]);\n    } else {\n      rejected.push(array[index]);\n    }\n  }\n\n  return [accepted, rejected];\n}\n"],"mappings":"AAKA,SAAgB,EACd,EACA,EACY,CACZ,IAAM,EAAgB,CAAC,EACjB,EAAgB,CAAC,EAEvB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IACpC,EAAU,EAAM,GAAQ,EAAO,CAAK,EACtC,EAAS,KAAK,EAAM,EAAM,EAE1B,EAAS,KAAK,EAAM,EAAM,EAI9B,MAAO,CAAC,EAAU,CAAQ,CAC5B"}
+{"version":3,"file":"partition.cjs","names":[],"sources":["../../src/array/partition.ts"],"sourcesContent":["/**\n * Splits an array into values that match and do not match the predicate.\n *\n * Allocates two new arrays for the accepted and rejected partitions.\n */\nexport function partition<T>(\n  array: readonly T[],\n  predicate: (item: T, index: number, array: readonly T[]) => boolean,\n): [T[], T[]] {\n  const accepted: T[] = [];\n  const rejected: T[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    if (predicate(array[index], index, array)) {\n      accepted.push(array[index]);\n    } else {\n      rejected.push(array[index]);\n    }\n  }\n\n  return [accepted, rejected];\n}\n"],"mappings":"AAKA,SAAgB,UACd,EACA,EACY,CACZ,IAAM,EAAgB,CAAC,EACjB,EAAgB,CAAC,EAEvB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IACpC,EAAU,EAAM,GAAQ,EAAO,CAAK,EACtC,EAAS,KAAK,EAAM,EAAM,EAE1B,EAAS,KAAK,EAAM,EAAM,EAI9B,MAAO,CAAC,EAAU,CAAQ,CAC5B"}

package/dist/array/partition.js

@@ -1,10 +1,2 @@
-//#region src/array/partition.ts
-function e(e, t) {
-	let n = [], r = [];
-	for (let i = 0; i < e.length; i++) t(e[i], i, e) ? n.push(e[i]) : r.push(e[i]);
-	return [n, r];
-}
-//#endregion
-export { e as partition };
-
+function partition(e,t){let n=[],r=[];for(let i=0;i<e.length;i++)t(e[i],i,e)?n.push(e[i]):r.push(e[i]);return[n,r]}export{partition};
 //# sourceMappingURL=partition.js.map

package/dist/array/partition.js.map

@@ -1 +1 @@
-{"version":3,"file":"partition.js","names":[],"sources":["../../src/array/partition.ts"],"sourcesContent":["/**\n * Splits an array into values that match and do not match the predicate.\n *\n * Allocates two new arrays for the accepted and rejected partitions.\n */\nexport function partition<T>(\n  array: readonly T[],\n  predicate: (item: T, index: number, array: readonly T[]) => boolean,\n): [T[], T[]] {\n  const accepted: T[] = [];\n  const rejected: T[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    if (predicate(array[index], index, array)) {\n      accepted.push(array[index]);\n    } else {\n      rejected.push(array[index]);\n    }\n  }\n\n  return [accepted, rejected];\n}\n"],"mappings":";AAKA,SAAgB,EACd,GACA,GACY;CACZ,IAAM,IAAgB,CAAC,GACjB,IAAgB,CAAC;CAEvB,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KACxC,AAAI,EAAU,EAAM,IAAQ,GAAO,CAAK,IACtC,EAAS,KAAK,EAAM,EAAM,IAE1B,EAAS,KAAK,EAAM,EAAM;CAI9B,OAAO,CAAC,GAAU,CAAQ;AAC5B"}
+{"version":3,"file":"partition.js","names":[],"sources":["../../src/array/partition.ts"],"sourcesContent":["/**\n * Splits an array into values that match and do not match the predicate.\n *\n * Allocates two new arrays for the accepted and rejected partitions.\n */\nexport function partition<T>(\n  array: readonly T[],\n  predicate: (item: T, index: number, array: readonly T[]) => boolean,\n): [T[], T[]] {\n  const accepted: T[] = [];\n  const rejected: T[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    if (predicate(array[index], index, array)) {\n      accepted.push(array[index]);\n    } else {\n      rejected.push(array[index]);\n    }\n  }\n\n  return [accepted, rejected];\n}\n"],"mappings":"AAKA,SAAgB,UACd,EACA,EACY,CACZ,IAAM,EAAgB,CAAC,EACjB,EAAgB,CAAC,EAEvB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IACpC,EAAU,EAAM,GAAQ,EAAO,CAAK,EACtC,EAAS,KAAK,EAAM,EAAM,EAE1B,EAAS,KAAK,EAAM,EAAM,EAI9B,MAAO,CAAC,EAAU,CAAQ,CAC5B"}

package/dist/array/replace.cjs

@@ -1,2 +1,2 @@
-function e(e,t,n){let r=e.findIndex(t);return r===-1?e:[...e.slice(0,r),n,...e.slice(r+1)]}exports.replace=e;
+function replace(e,t,n){let r=e.findIndex(t);return r===-1?e:[...e.slice(0,r),n,...e.slice(r+1)]}exports.replace=replace;
 //# sourceMappingURL=replace.cjs.map

package/dist/array/replace.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"replace.cjs","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/** Replaces the first matching item without mutating the input. */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[] {\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":"AAKA,SAAgB,EAAW,EAAqB,EAAyB,EAAwB,CAC/F,IAAM,EAAQ,EAAM,UAAU,CAAS,EAIvC,OAFI,IAAU,GAAW,EAElB,CAAC,GAAG,EAAM,MAAM,EAAG,CAAK,EAAG,EAAO,GAAG,EAAM,MAAM,EAAQ,CAAC,CAAC,CACpE"}
+{"version":3,"file":"replace.cjs","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/** Replaces the first matching item without mutating the input. */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[] {\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":"AAKA,SAAgB,QAAW,EAAqB,EAAyB,EAAwB,CAC/F,IAAM,EAAQ,EAAM,UAAU,CAAS,EAIvC,OAFI,IAAU,GAAW,EAElB,CAAC,GAAG,EAAM,MAAM,EAAG,CAAK,EAAG,EAAO,GAAG,EAAM,MAAM,EAAQ,CAAC,CAAC,CACpE"}

package/dist/array/replace.js

@@ -1,13 +1,2 @@
-//#region src/array/replace.ts
-function e(e, t, n) {
-	let r = e.findIndex(t);
-	return r === -1 ? e : [
-		...e.slice(0, r),
-		n,
-		...e.slice(r + 1)
-	];
-}
-//#endregion
-export { e as replace };
-
+function replace(e,t,n){let r=e.findIndex(t);return r===-1?e:[...e.slice(0,r),n,...e.slice(r+1)]}export{replace};
 //# sourceMappingURL=replace.js.map

package/dist/array/replace.js.map

@@ -1 +1 @@
-{"version":3,"file":"replace.js","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/** Replaces the first matching item without mutating the input. */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[] {\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":";AAKA,SAAgB,EAAW,GAAqB,GAAyB,GAAwB;CAC/F,IAAM,IAAQ,EAAM,UAAU,CAAS;CAIvC,OAFI,MAAU,KAAW,IAElB;EAAC,GAAG,EAAM,MAAM,GAAG,CAAK;EAAG;EAAO,GAAG,EAAM,MAAM,IAAQ,CAAC;CAAC;AACpE"}
+{"version":3,"file":"replace.js","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/** Replaces the first matching item without mutating the input. */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[];\nexport function replace<T>(array: readonly T[], predicate: Predicate<T>, value: T): readonly T[] {\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":"AAKA,SAAgB,QAAW,EAAqB,EAAyB,EAAwB,CAC/F,IAAM,EAAQ,EAAM,UAAU,CAAS,EAIvC,OAFI,IAAU,GAAW,EAElB,CAAC,GAAG,EAAM,MAAM,EAAG,CAAK,EAAG,EAAO,GAAG,EAAM,MAAM,EAAQ,CAAC,CAAC,CACpE"}

package/dist/array/rotate.cjs

@@ -1,2 +1,2 @@
-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}exports.rotate=e;
+function rotate(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}exports.rotate=rotate;
 //# sourceMappingURL=rotate.cjs.map

package/dist/array/rotate.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"rotate.cjs","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["/** Rotates or drops leading items without mutating the input. */\nexport function rotate<T>(array: T[], positions: number, options?: { wrap?: boolean }): T[];\nexport function rotate<T>(array: readonly T[], positions: number, options?: { wrap?: boolean }): readonly T[];\nexport function rotate<T>(\n  array: readonly T[],\n  positions: number,\n  { wrap = false }: { wrap?: boolean } = {},\n): readonly T[] {\n  if (array.length === 0) return array;\n\n  const normalizedPosition = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPosition);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPosition)] : rotated;\n}\n"],"mappings":"AAGA,SAAgB,EACd,EACA,EACA,CAAE,OAAO,IAA8B,CAAC,EAC1B,CACd,GAAI,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,GAAuB,EAAY,EAAM,OAAU,EAAM,QAAU,EAAM,OACzE,EAAU,EAAM,MAAM,CAAkB,EAE9C,OAAO,EAAO,CAAC,GAAG,EAAS,GAAG,EAAM,MAAM,EAAG,CAAkB,CAAC,EAAI,CACtE"}
+{"version":3,"file":"rotate.cjs","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["/** Rotates or drops leading items without mutating the input. */\nexport function rotate<T>(array: T[], positions: number, options?: { wrap?: boolean }): T[];\nexport function rotate<T>(array: readonly T[], positions: number, options?: { wrap?: boolean }): readonly T[];\nexport function rotate<T>(\n  array: readonly T[],\n  positions: number,\n  { wrap = false }: { wrap?: boolean } = {},\n): readonly T[] {\n  if (array.length === 0) return array;\n\n  const normalizedPosition = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPosition);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPosition)] : rotated;\n}\n"],"mappings":"AAGA,SAAgB,OACd,EACA,EACA,CAAE,OAAO,IAA8B,CAAC,EAC1B,CACd,GAAI,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,GAAuB,EAAY,EAAM,OAAU,EAAM,QAAU,EAAM,OACzE,EAAU,EAAM,MAAM,CAAkB,EAE9C,OAAO,EAAO,CAAC,GAAG,EAAS,GAAG,EAAM,MAAM,EAAG,CAAkB,CAAC,EAAI,CACtE"}

package/dist/array/rotate.js

@@ -1,10 +1,2 @@
-//#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 };
-
+function rotate(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}export{rotate};
 //# sourceMappingURL=rotate.js.map

package/dist/array/rotate.js.map

@@ -1 +1 @@
-{"version":3,"file":"rotate.js","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["/** Rotates or drops leading items without mutating the input. */\nexport function rotate<T>(array: T[], positions: number, options?: { wrap?: boolean }): T[];\nexport function rotate<T>(array: readonly T[], positions: number, options?: { wrap?: boolean }): readonly T[];\nexport function rotate<T>(\n  array: readonly T[],\n  positions: number,\n  { wrap = false }: { wrap?: boolean } = {},\n): readonly T[] {\n  if (array.length === 0) return array;\n\n  const normalizedPosition = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPosition);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPosition)] : rotated;\n}\n"],"mappings":";AAGA,SAAgB,EACd,GACA,GACA,EAAE,UAAO,OAA8B,CAAC,GAC1B;CACd,IAAI,EAAM,WAAW,GAAG,OAAO;CAE/B,IAAM,KAAuB,IAAY,EAAM,SAAU,EAAM,UAAU,EAAM,QACzE,IAAU,EAAM,MAAM,CAAkB;CAE9C,OAAO,IAAO,CAAC,GAAG,GAAS,GAAG,EAAM,MAAM,GAAG,CAAkB,CAAC,IAAI;AACtE"}
+{"version":3,"file":"rotate.js","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["/** Rotates or drops leading items without mutating the input. */\nexport function rotate<T>(array: T[], positions: number, options?: { wrap?: boolean }): T[];\nexport function rotate<T>(array: readonly T[], positions: number, options?: { wrap?: boolean }): readonly T[];\nexport function rotate<T>(\n  array: readonly T[],\n  positions: number,\n  { wrap = false }: { wrap?: boolean } = {},\n): readonly T[] {\n  if (array.length === 0) return array;\n\n  const normalizedPosition = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPosition);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPosition)] : rotated;\n}\n"],"mappings":"AAGA,SAAgB,OACd,EACA,EACA,CAAE,OAAO,IAA8B,CAAC,EAC1B,CACd,GAAI,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,GAAuB,EAAY,EAAM,OAAU,EAAM,QAAU,EAAM,OACzE,EAAU,EAAM,MAAM,CAAkB,EAE9C,OAAO,EAAO,CAAC,GAAG,EAAS,GAAG,EAAM,MAAM,EAAG,CAAkB,CAAC,EAAI,CACtE"}

package/dist/array/search.cjs

@@ -1,2 +1,2 @@
-const e=require("../string/similarity.cjs");var t=e=>e.normalize(`NFKD`).replace(/\p{M}/gu,``),n=(e,t)=>{let n=t(e);return typeof n==`string`?[n]:n},r=(e,n)=>{let r=e.trim().toLowerCase();return n?t(r):r},i=(r,i,a,o)=>n(r,o).reduce((n,r)=>{let o=a?t(r.toLowerCase()):r.toLowerCase();return Math.max(n,e.similarity(o,i))},0),a=e=>e;function o(e,t,n={}){let{normalize:o=!1,threshold:s=.25}=n,c=`select`in n?n.select:a,l=r(t,o);return l?e.filter(e=>i(e,l,o,c)>=s):[...e]}function s(e,t,n={}){let{normalize:o=!1,threshold:s=.25}=n,c=`select`in n?n.select:a,l=r(t,o);return l?e.map(e=>({item:e,score:i(e,l,o,c)})).filter(e=>e.score>=s).sort((e,t)=>t.score-e.score):e.map(e=>({item:e,score:1}))}exports.fuzzyFilter=o,exports.fuzzyScore=s;
+const e=require("../string/similarity.cjs");var normalizeText=e=>e.normalize(`NFKD`).replace(/\p{M}/gu,``),termsFor=(e,t)=>{let n=t(e);return typeof n==`string`?[n]:n},prepareQuery=(e,t)=>{let n=e.trim().toLowerCase();return t?normalizeText(n):n},score=(t,n,r,i)=>termsFor(t,i).reduce((t,i)=>{let a=r?normalizeText(i.toLowerCase()):i.toLowerCase();return Math.max(t,e.similarity(a,n))},0),stringSelection=e=>e;function fuzzyFilter(e,t,n={}){let{normalize:r=!1,threshold:i=.25}=n,a=`select`in n?n.select:stringSelection,o=prepareQuery(t,r);return o?e.filter(e=>score(e,o,r,a)>=i):[...e]}function fuzzyScore(e,t,n={}){let{normalize:r=!1,threshold:i=.25}=n,a=`select`in n?n.select:stringSelection,o=prepareQuery(t,r);return o?e.map(e=>({item:e,score:score(e,o,r,a)})).filter(e=>e.score>=i).sort((e,t)=>t.score-e.score):e.map(e=>({item:e,score:1}))}exports.fuzzyFilter=fuzzyFilter,exports.fuzzyScore=fuzzyScore;
 //# sourceMappingURL=search.cjs.map

package/dist/array/search.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"search.cjs","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions = {\n  normalize?: boolean;\n  threshold?: number;\n};\n\nexport type FuzzySelection<T> = FuzzyOptions & {\n  select: (item: T) => string | readonly string[];\n};\n\nconst normalizeText = (value: string): string => value.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nconst termsFor = <T>(item: T, select: (item: T) => string | readonly string[]): readonly string[] => {\n  const selected = select(item);\n\n  return typeof selected === 'string' ? [selected] : selected;\n};\n\nconst prepareQuery = (query: string, normalize: boolean): string => {\n  const trimmed = query.trim().toLowerCase();\n\n  return normalize ? normalizeText(trimmed) : trimmed;\n};\n\nconst score = <T>(\n  item: T,\n  query: string,\n  normalize: boolean,\n  select: (item: T) => string | readonly string[],\n): number => {\n  return termsFor(item, select).reduce((best, term) => {\n    const value = normalize ? normalizeText(term.toLowerCase()) : term.toLowerCase();\n\n    return Math.max(best, similarity(value, query));\n  }, 0);\n};\n\nconst stringSelection = (value: string): string => value;\n\nexport function fuzzyFilter(array: readonly string[], query: string, options?: FuzzyOptions): string[];\nexport function fuzzyFilter<T>(array: readonly T[], query: string, options: FuzzySelection<T>): T[];\nexport function fuzzyFilter<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): T[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return [...array];\n\n  return array.filter((item) => score(item, searchTerm, normalize, select) >= threshold);\n}\n\nexport function fuzzyScore(array: readonly string[], query: string, options?: FuzzyOptions): ScoredResult<string>[];\nexport function fuzzyScore<T>(array: readonly T[], query: string, options: FuzzySelection<T>): ScoredResult<T>[];\nexport function fuzzyScore<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): ScoredResult<T>[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return array.map((item) => ({ item, score: 1 }));\n\n  return array\n    .map((item) => ({ item, score: score(item, searchTerm, normalize, select) }))\n    .filter((result) => result.score >= threshold)\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":"4CAaA,IAAM,EAAiB,GAA0B,EAAM,UAAU,MAAM,CAAC,CAAC,QAAQ,UAAW,EAAE,EAExF,GAAe,EAAS,IAAuE,CACnG,IAAM,EAAW,EAAO,CAAI,EAE5B,OAAO,OAAO,GAAa,SAAW,CAAC,CAAQ,EAAI,CACrD,EAEM,GAAgB,EAAe,IAA+B,CAClE,IAAM,EAAU,EAAM,KAAK,CAAC,CAAC,YAAY,EAEzC,OAAO,EAAY,EAAc,CAAO,EAAI,CAC9C,EAEM,GACJ,EACA,EACA,EACA,IAEO,EAAS,EAAM,CAAM,CAAC,CAAC,QAAQ,EAAM,IAAS,CACnD,IAAM,EAAQ,EAAY,EAAc,EAAK,YAAY,CAAC,EAAI,EAAK,YAAY,EAE/E,OAAO,KAAK,IAAI,EAAM,EAAA,WAAW,EAAO,CAAK,CAAC,CAChD,EAAG,CAAC,EAGA,EAAmB,GAA0B,EAInD,SAAgB,EACd,EACA,EACA,EAA4C,CAAC,EACxC,CACL,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,EACjD,EAAa,EAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EAAM,OAAQ,GAAS,EAAM,EAAM,EAAY,EAAW,CAAM,GAAK,CAAS,EAF7D,CAAC,GAAG,CAAK,CAGnC,CAIA,SAAgB,EACd,EACA,EACA,EAA4C,CAAC,EAC1B,CACnB,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,EACjD,EAAa,EAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EACJ,IAAK,IAAU,CAAE,OAAM,MAAO,EAAM,EAAM,EAAY,EAAW,CAAM,CAAE,EAAE,CAAC,CAC5E,OAAQ,GAAW,EAAO,OAAS,CAAS,CAAC,CAC7C,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,EALX,EAAM,IAAK,IAAU,CAAE,OAAM,MAAO,CAAE,EAAE,CAMlE"}
+{"version":3,"file":"search.cjs","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions = {\n  normalize?: boolean;\n  threshold?: number;\n};\n\nexport type FuzzySelection<T> = FuzzyOptions & {\n  select: (item: T) => string | readonly string[];\n};\n\nconst normalizeText = (value: string): string => value.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nconst termsFor = <T>(item: T, select: (item: T) => string | readonly string[]): readonly string[] => {\n  const selected = select(item);\n\n  return typeof selected === 'string' ? [selected] : selected;\n};\n\nconst prepareQuery = (query: string, normalize: boolean): string => {\n  const trimmed = query.trim().toLowerCase();\n\n  return normalize ? normalizeText(trimmed) : trimmed;\n};\n\nconst score = <T>(\n  item: T,\n  query: string,\n  normalize: boolean,\n  select: (item: T) => string | readonly string[],\n): number => {\n  return termsFor(item, select).reduce((best, term) => {\n    const value = normalize ? normalizeText(term.toLowerCase()) : term.toLowerCase();\n\n    return Math.max(best, similarity(value, query));\n  }, 0);\n};\n\nconst stringSelection = (value: string): string => value;\n\nexport function fuzzyFilter(array: readonly string[], query: string, options?: FuzzyOptions): string[];\nexport function fuzzyFilter<T>(array: readonly T[], query: string, options: FuzzySelection<T>): T[];\nexport function fuzzyFilter<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): T[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return [...array];\n\n  return array.filter((item) => score(item, searchTerm, normalize, select) >= threshold);\n}\n\nexport function fuzzyScore(array: readonly string[], query: string, options?: FuzzyOptions): ScoredResult<string>[];\nexport function fuzzyScore<T>(array: readonly T[], query: string, options: FuzzySelection<T>): ScoredResult<T>[];\nexport function fuzzyScore<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): ScoredResult<T>[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return array.map((item) => ({ item, score: 1 }));\n\n  return array\n    .map((item) => ({ item, score: score(item, searchTerm, normalize, select) }))\n    .filter((result) => result.score >= threshold)\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":"4CAaA,IAAM,cAAiB,GAA0B,EAAM,UAAU,MAAM,CAAC,CAAC,QAAQ,UAAW,EAAE,EAExF,UAAe,EAAS,IAAuE,CACnG,IAAM,EAAW,EAAO,CAAI,EAE5B,OAAO,OAAO,GAAa,SAAW,CAAC,CAAQ,EAAI,CACrD,EAEM,cAAgB,EAAe,IAA+B,CAClE,IAAM,EAAU,EAAM,KAAK,CAAC,CAAC,YAAY,EAEzC,OAAO,EAAY,cAAc,CAAO,EAAI,CAC9C,EAEM,OACJ,EACA,EACA,EACA,IAEO,SAAS,EAAM,CAAM,CAAC,CAAC,QAAQ,EAAM,IAAS,CACnD,IAAM,EAAQ,EAAY,cAAc,EAAK,YAAY,CAAC,EAAI,EAAK,YAAY,EAE/E,OAAO,KAAK,IAAI,EAAM,EAAA,WAAW,EAAO,CAAK,CAAC,CAChD,EAAG,CAAC,EAGA,gBAAmB,GAA0B,EAInD,SAAgB,YACd,EACA,EACA,EAA4C,CAAC,EACxC,CACL,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,gBACjD,EAAa,aAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EAAM,OAAQ,GAAS,MAAM,EAAM,EAAY,EAAW,CAAM,GAAK,CAAS,EAF7D,CAAC,GAAG,CAAK,CAGnC,CAIA,SAAgB,WACd,EACA,EACA,EAA4C,CAAC,EAC1B,CACnB,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,gBACjD,EAAa,aAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EACJ,IAAK,IAAU,CAAE,OAAM,MAAO,MAAM,EAAM,EAAY,EAAW,CAAM,CAAE,EAAE,CAAC,CAC5E,OAAQ,GAAW,EAAO,OAAS,CAAS,CAAC,CAC7C,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,EALX,EAAM,IAAK,IAAU,CAAE,OAAM,MAAO,CAAE,EAAE,CAMlE"}

package/dist/array/search.js

@@ -1,30 +1,2 @@
-import { similarity as e } from "../string/similarity.js";
-//#region src/array/search.ts
-var t = (e) => e.normalize("NFKD").replace(/\p{M}/gu, ""), n = (e, t) => {
-	let n = t(e);
-	return typeof n == "string" ? [n] : n;
-}, r = (e, n) => {
-	let r = e.trim().toLowerCase();
-	return n ? t(r) : r;
-}, i = (r, i, a, o) => n(r, o).reduce((n, r) => {
-	let o = a ? t(r.toLowerCase()) : r.toLowerCase();
-	return Math.max(n, e(o, i));
-}, 0), a = (e) => e;
-function o(e, t, n = {}) {
-	let { normalize: o = !1, threshold: s = .25 } = n, c = "select" in n ? n.select : a, l = r(t, o);
-	return l ? e.filter((e) => i(e, l, o, c) >= s) : [...e];
-}
-function s(e, t, n = {}) {
-	let { normalize: o = !1, threshold: s = .25 } = n, c = "select" in n ? n.select : a, l = r(t, o);
-	return l ? e.map((e) => ({
-		item: e,
-		score: i(e, l, o, c)
-	})).filter((e) => e.score >= s).sort((e, t) => t.score - e.score) : e.map((e) => ({
-		item: e,
-		score: 1
-	}));
-}
-//#endregion
-export { o as fuzzyFilter, s as fuzzyScore };
-
+import{similarity as e}from"../string/similarity.js";var normalizeText=e=>e.normalize(`NFKD`).replace(/\p{M}/gu,``),termsFor=(e,t)=>{let n=t(e);return typeof n==`string`?[n]:n},prepareQuery=(e,t)=>{let n=e.trim().toLowerCase();return t?normalizeText(n):n},score=(t,n,r,i)=>termsFor(t,i).reduce((t,i)=>{let a=r?normalizeText(i.toLowerCase()):i.toLowerCase();return Math.max(t,e(a,n))},0),stringSelection=e=>e;function fuzzyFilter(e,t,n={}){let{normalize:r=!1,threshold:i=.25}=n,a=`select`in n?n.select:stringSelection,o=prepareQuery(t,r);return o?e.filter(e=>score(e,o,r,a)>=i):[...e]}function fuzzyScore(e,t,n={}){let{normalize:r=!1,threshold:i=.25}=n,a=`select`in n?n.select:stringSelection,o=prepareQuery(t,r);return o?e.map(e=>({item:e,score:score(e,o,r,a)})).filter(e=>e.score>=i).sort((e,t)=>t.score-e.score):e.map(e=>({item:e,score:1}))}export{fuzzyFilter,fuzzyScore};
 //# sourceMappingURL=search.js.map

package/dist/array/search.js.map

@@ -1 +1 @@
-{"version":3,"file":"search.js","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions = {\n  normalize?: boolean;\n  threshold?: number;\n};\n\nexport type FuzzySelection<T> = FuzzyOptions & {\n  select: (item: T) => string | readonly string[];\n};\n\nconst normalizeText = (value: string): string => value.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nconst termsFor = <T>(item: T, select: (item: T) => string | readonly string[]): readonly string[] => {\n  const selected = select(item);\n\n  return typeof selected === 'string' ? [selected] : selected;\n};\n\nconst prepareQuery = (query: string, normalize: boolean): string => {\n  const trimmed = query.trim().toLowerCase();\n\n  return normalize ? normalizeText(trimmed) : trimmed;\n};\n\nconst score = <T>(\n  item: T,\n  query: string,\n  normalize: boolean,\n  select: (item: T) => string | readonly string[],\n): number => {\n  return termsFor(item, select).reduce((best, term) => {\n    const value = normalize ? normalizeText(term.toLowerCase()) : term.toLowerCase();\n\n    return Math.max(best, similarity(value, query));\n  }, 0);\n};\n\nconst stringSelection = (value: string): string => value;\n\nexport function fuzzyFilter(array: readonly string[], query: string, options?: FuzzyOptions): string[];\nexport function fuzzyFilter<T>(array: readonly T[], query: string, options: FuzzySelection<T>): T[];\nexport function fuzzyFilter<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): T[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return [...array];\n\n  return array.filter((item) => score(item, searchTerm, normalize, select) >= threshold);\n}\n\nexport function fuzzyScore(array: readonly string[], query: string, options?: FuzzyOptions): ScoredResult<string>[];\nexport function fuzzyScore<T>(array: readonly T[], query: string, options: FuzzySelection<T>): ScoredResult<T>[];\nexport function fuzzyScore<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): ScoredResult<T>[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return array.map((item) => ({ item, score: 1 }));\n\n  return array\n    .map((item) => ({ item, score: score(item, searchTerm, normalize, select) }))\n    .filter((result) => result.score >= threshold)\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":";;AAaA,IAAM,KAAiB,MAA0B,EAAM,UAAU,MAAM,CAAC,CAAC,QAAQ,WAAW,EAAE,GAExF,KAAe,GAAS,MAAuE;CACnG,IAAM,IAAW,EAAO,CAAI;CAE5B,OAAO,OAAO,KAAa,WAAW,CAAC,CAAQ,IAAI;AACrD,GAEM,KAAgB,GAAe,MAA+B;CAClE,IAAM,IAAU,EAAM,KAAK,CAAC,CAAC,YAAY;CAEzC,OAAO,IAAY,EAAc,CAAO,IAAI;AAC9C,GAEM,KACJ,GACA,GACA,GACA,MAEO,EAAS,GAAM,CAAM,CAAC,CAAC,QAAQ,GAAM,MAAS;CACnD,IAAM,IAAQ,IAAY,EAAc,EAAK,YAAY,CAAC,IAAI,EAAK,YAAY;CAE/E,OAAO,KAAK,IAAI,GAAM,EAAW,GAAO,CAAK,CAAC;AAChD,GAAG,CAAC,GAGA,KAAmB,MAA0B;AAInD,SAAgB,EACd,GACA,GACA,IAA4C,CAAC,GACxC;CACL,IAAM,EAAE,eAAY,IAAO,eAAY,QAAS,GAC1C,IAAS,YAAY,IAAU,EAAQ,SAAU,GACjD,IAAa,EAAa,GAAO,CAAS;CAIhD,OAFK,IAEE,EAAM,QAAQ,MAAS,EAAM,GAAM,GAAY,GAAW,CAAM,KAAK,CAAS,IAF7D,CAAC,GAAG,CAAK;AAGnC;AAIA,SAAgB,EACd,GACA,GACA,IAA4C,CAAC,GAC1B;CACnB,IAAM,EAAE,eAAY,IAAO,eAAY,QAAS,GAC1C,IAAS,YAAY,IAAU,EAAQ,SAAU,GACjD,IAAa,EAAa,GAAO,CAAS;CAIhD,OAFK,IAEE,EACJ,KAAK,OAAU;EAAE;EAAM,OAAO,EAAM,GAAM,GAAY,GAAW,CAAM;CAAE,EAAE,CAAC,CAC5E,QAAQ,MAAW,EAAO,SAAS,CAAS,CAAC,CAC7C,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,IALX,EAAM,KAAK,OAAU;EAAE;EAAM,OAAO;CAAE,EAAE;AAMlE"}
+{"version":3,"file":"search.js","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { similarity } from '../string/similarity';\n\nexport type ScoredResult<T> = { item: T; score: number };\n\nexport type FuzzyOptions = {\n  normalize?: boolean;\n  threshold?: number;\n};\n\nexport type FuzzySelection<T> = FuzzyOptions & {\n  select: (item: T) => string | readonly string[];\n};\n\nconst normalizeText = (value: string): string => value.normalize('NFKD').replace(/\\p{M}/gu, '');\n\nconst termsFor = <T>(item: T, select: (item: T) => string | readonly string[]): readonly string[] => {\n  const selected = select(item);\n\n  return typeof selected === 'string' ? [selected] : selected;\n};\n\nconst prepareQuery = (query: string, normalize: boolean): string => {\n  const trimmed = query.trim().toLowerCase();\n\n  return normalize ? normalizeText(trimmed) : trimmed;\n};\n\nconst score = <T>(\n  item: T,\n  query: string,\n  normalize: boolean,\n  select: (item: T) => string | readonly string[],\n): number => {\n  return termsFor(item, select).reduce((best, term) => {\n    const value = normalize ? normalizeText(term.toLowerCase()) : term.toLowerCase();\n\n    return Math.max(best, similarity(value, query));\n  }, 0);\n};\n\nconst stringSelection = (value: string): string => value;\n\nexport function fuzzyFilter(array: readonly string[], query: string, options?: FuzzyOptions): string[];\nexport function fuzzyFilter<T>(array: readonly T[], query: string, options: FuzzySelection<T>): T[];\nexport function fuzzyFilter<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): T[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return [...array];\n\n  return array.filter((item) => score(item, searchTerm, normalize, select) >= threshold);\n}\n\nexport function fuzzyScore(array: readonly string[], query: string, options?: FuzzyOptions): ScoredResult<string>[];\nexport function fuzzyScore<T>(array: readonly T[], query: string, options: FuzzySelection<T>): ScoredResult<T>[];\nexport function fuzzyScore<T>(\n  array: readonly T[],\n  query: string,\n  options: FuzzyOptions | FuzzySelection<T> = {},\n): ScoredResult<T>[] {\n  const { normalize = false, threshold = 0.25 } = options;\n  const select = 'select' in options ? options.select : (stringSelection as (item: T) => string);\n  const searchTerm = prepareQuery(query, normalize);\n\n  if (!searchTerm) return array.map((item) => ({ item, score: 1 }));\n\n  return array\n    .map((item) => ({ item, score: score(item, searchTerm, normalize, select) }))\n    .filter((result) => result.score >= threshold)\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":"qDAaA,IAAM,cAAiB,GAA0B,EAAM,UAAU,MAAM,CAAC,CAAC,QAAQ,UAAW,EAAE,EAExF,UAAe,EAAS,IAAuE,CACnG,IAAM,EAAW,EAAO,CAAI,EAE5B,OAAO,OAAO,GAAa,SAAW,CAAC,CAAQ,EAAI,CACrD,EAEM,cAAgB,EAAe,IAA+B,CAClE,IAAM,EAAU,EAAM,KAAK,CAAC,CAAC,YAAY,EAEzC,OAAO,EAAY,cAAc,CAAO,EAAI,CAC9C,EAEM,OACJ,EACA,EACA,EACA,IAEO,SAAS,EAAM,CAAM,CAAC,CAAC,QAAQ,EAAM,IAAS,CACnD,IAAM,EAAQ,EAAY,cAAc,EAAK,YAAY,CAAC,EAAI,EAAK,YAAY,EAE/E,OAAO,KAAK,IAAI,EAAM,EAAW,EAAO,CAAK,CAAC,CAChD,EAAG,CAAC,EAGA,gBAAmB,GAA0B,EAInD,SAAgB,YACd,EACA,EACA,EAA4C,CAAC,EACxC,CACL,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,gBACjD,EAAa,aAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EAAM,OAAQ,GAAS,MAAM,EAAM,EAAY,EAAW,CAAM,GAAK,CAAS,EAF7D,CAAC,GAAG,CAAK,CAGnC,CAIA,SAAgB,WACd,EACA,EACA,EAA4C,CAAC,EAC1B,CACnB,GAAM,CAAE,YAAY,GAAO,YAAY,KAAS,EAC1C,EAAS,WAAY,EAAU,EAAQ,OAAU,gBACjD,EAAa,aAAa,EAAO,CAAS,EAIhD,OAFK,EAEE,EACJ,IAAK,IAAU,CAAE,OAAM,MAAO,MAAM,EAAM,EAAY,EAAW,CAAM,CAAE,EAAE,CAAC,CAC5E,OAAQ,GAAW,EAAO,OAAS,CAAS,CAAC,CAC7C,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,EALX,EAAM,IAAK,IAAU,CAAE,OAAM,MAAO,CAAE,EAAE,CAMlE"}

package/dist/array/sort.cjs

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

package/dist/array/sort.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"sort.cjs","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { 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 {TypeError} If the first argument is not an array.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('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":"8DA6BA,SAAgB,EACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQ,CAAK,EAAG,MAAU,UAAU,uCAAuC,EAEtF,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"}
+{"version":3,"file":"sort.cjs","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { 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 {TypeError} If the first argument is not an array.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('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":"8DA6BA,SAAgB,KACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQ,CAAK,EAAG,MAAU,UAAU,uCAAuC,EAEtF,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.js

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

package/dist/array/sort.js.map

@@ -1 +1 @@
-{"version":3,"file":"sort.js","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { 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 {TypeError} If the first argument is not an array.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('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":";;;AA6BA,SAAgB,EACd,GACA,GACA,IAA2B,OACtB;CACL,IAAI,CAAC,MAAM,QAAQ,CAAK,GAAG,MAAU,UAAU,uCAAuC;CAEtF,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"}
+{"version":3,"file":"sort.js","names":[],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { 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 {TypeError} If the first argument is not an array.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('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":"kFA6BA,SAAgB,KACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQ,CAAK,EAAG,MAAU,UAAU,uCAAuC,EAEtF,GAAI,OAAO,GAAwB,WAAY,CAC7C,IAAM,EAAa,IAAc,OAAS,GAAK,EAE/C,MAAO,CAAC,GAAG,CAAK,CAAC,CAAC,MAAM,EAAG,IAAM,EAAQ,EAAoB,CAAC,EAAG,EAAoB,CAAC,CAAC,EAAI,CAAU,CACvG,CAEA,MAAO,CAAC,GAAG,CAAK,CAAC,CAAC,KAAK,EAAU,CAAmB,CAAC,CACvD"}

package/dist/array/take.cjs

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

package/dist/array/take.cjs.map

@@ -1 +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: readonly 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,EAAqB,EAAI,EAAQ,CACvD,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,CAAC,EAEvC,OAAO,EAAM,MAAM,EAAG,CAAK,CAC7B"}
+{"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: readonly 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,KAAQ,EAAqB,EAAI,EAAQ,CACvD,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,CAAC,EAEvC,OAAO,EAAM,MAAM,EAAG,CAAK,CAC7B"}

package/dist/array/take.js

@@ -1,9 +1,2 @@
-//#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 };
-
+function take(e,t=1){let n=Math.max(0,Math.floor(t));return e.slice(0,n)}export{take};
 //# sourceMappingURL=take.js.map

package/dist/array/take.js.map

@@ -1 +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: readonly 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,GAAqB,IAAI,GAAQ;CACvD,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,CAAC;CAEvC,OAAO,EAAM,MAAM,GAAG,CAAK;AAC7B"}
+{"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: readonly 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,KAAQ,EAAqB,EAAI,EAAQ,CACvD,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,CAAC,EAEvC,OAAO,EAAM,MAAM,EAAG,CAAK,CAC7B"}

package/dist/array/takeLast.cjs

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

package/dist/array/takeLast.cjs.map

@@ -1 +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: readonly 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,EAAqB,EAAI,EAAQ,CAC3D,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"}
+{"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: readonly 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,SAAY,EAAqB,EAAI,EAAQ,CAC3D,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.js

@@ -1,9 +1,2 @@
-//#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 };
-
+function takeLast(e,t=1){let n=Math.max(0,Math.floor(t));return n===0?[]:e.slice(Math.max(0,e.length-n))}export{takeLast};
 //# sourceMappingURL=takeLast.js.map

package/dist/array/takeLast.js.map

@@ -1 +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: readonly 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,GAAqB,IAAI,GAAQ;CAC3D,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"}
+{"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: readonly 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,SAAY,EAAqB,EAAI,EAAQ,CAC3D,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/toggle.cjs

@@ -1,2 +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;
+function toggle(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=toggle;
 //# sourceMappingURL=toggle.cjs.map

package/dist/array/toggle.cjs.map

@@ -1 +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: readonly 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"}
+{"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: readonly 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,OACd,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.js

@@ -1,9 +1,2 @@
-//#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 };
-
+function toggle(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)]}export{toggle};
 //# sourceMappingURL=toggle.js.map

package/dist/array/toggle.js.map

@@ -1 +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: readonly 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"}
+{"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: readonly 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,OACd,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/union.cjs

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