@vielzeug/arsenal 1.0.1

package/dist/array/contains.js

@@ -0,0 +1,9 @@
+import { isEqual as e } from "../guards/isEqual.js";
+//#region src/array/contains.ts
+function t(t, n) {
+	return typeof n != "object" || !n ? t.includes(n) : t.some((t) => e(t, n));
+}
+//#endregion
+export { t as contains };
+
+//# sourceMappingURL=contains.js.map

package/dist/array/contains.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contains.js","names":[],"sources":["../../src/array/contains.ts"],"sourcesContent":["import { isEqual } from '../guards/isEqual';\n\n/**\n * Checks if a value is present in an array.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, { a: 1 }, 'hello'];\n * const value = { a: 1 };\n * contains(arr, value) // true;\n * ```\n *\n * @param array - The array to check.\n * @param value - The value to search for.\n *\n * @returns true if the value is present in the array, else false.\n */\n\nexport function contains<T>(array: T[], value: unknown): boolean {\n  // Fast path: reference / primitive equality via Array.includes — avoids\n  // deep-equal traversal for the common case of searching for a scalar.\n  if (value === null || value === undefined || typeof value !== 'object') {\n    return array.includes(value as T);\n  }\n\n  return array.some((val) => isEqual(val, value));\n}\n"],"mappings":";;AAkBA,SAAgB,EAAY,GAAY,GAAyB;CAO/D,OAJ6C,OAAO,KAAU,aAA1D,IACK,EAAM,SAAS,CAAU,IAG3B,EAAM,MAAM,MAAQ,EAAQ,GAAK,CAAK,CAAC;AAChD"}

package/dist/array/countBy.cjs

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

package/dist/array/countBy.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"countBy.cjs","names":[],"sources":["../../src/array/countBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\n\n/**\n * Counts elements in an array by selector output. Selector results of `null`/`undefined` are\n * bucketed under the key `'_'`, matching `groupBy`'s convention. Dangerous keys (`__proto__`,\n * `constructor`, `prototype`) are skipped.\n */\nexport function countBy<T>(array: T[], selector: (item: T) => Primitive): Record<string, number> {\n  const out: Record<string, number> = {};\n\n  for (let index = 0; index < array.length; index++) {\n    const rawKey = selector(array[index]);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    out[key] = (out[key] ?? 0) + 1;\n  }\n\n  return out;\n}\n"],"mappings":"8CASA,SAAgB,EAAW,EAAY,EAA0D,CAC/F,IAAM,EAA8B,CAAC,EAErC,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IAAS,CACjD,IAAM,EAAS,EAAS,EAAM,EAAM,EAC9B,EAAM,GAAmC,KAAO,IAAM,OAAO,CAAM,EAErE,EAAA,YAAY,CAAG,IAEnB,EAAI,IAAQ,EAAI,IAAQ,GAAK,EAC/B,CAEA,OAAO,CACT"}

package/dist/array/countBy.d.ts

@@ -0,0 +1,8 @@
+import type { Primitive } from '../types';
+/**
+ * Counts elements in an array by selector output. Selector results of `null`/`undefined` are
+ * bucketed under the key `'_'`, matching `groupBy`'s convention. Dangerous keys (`__proto__`,
+ * `constructor`, `prototype`) are skipped.
+ */
+export declare function countBy<T>(array: T[], selector: (item: T) => Primitive): Record<string, number>;
+//# sourceMappingURL=countBy.d.ts.map

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

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

package/dist/array/countBy.js

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

package/dist/array/countBy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"countBy.js","names":[],"sources":["../../src/array/countBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\n\n/**\n * Counts elements in an array by selector output. Selector results of `null`/`undefined` are\n * bucketed under the key `'_'`, matching `groupBy`'s convention. Dangerous keys (`__proto__`,\n * `constructor`, `prototype`) are skipped.\n */\nexport function countBy<T>(array: T[], selector: (item: T) => Primitive): Record<string, number> {\n  const out: Record<string, number> = {};\n\n  for (let index = 0; index < array.length; index++) {\n    const rawKey = selector(array[index]);\n    const key = rawKey === undefined || rawKey === null ? '_' : String(rawKey);\n\n    if (isUnsafeKey(key)) continue;\n\n    out[key] = (out[key] ?? 0) + 1;\n  }\n\n  return out;\n}\n"],"mappings":";;AASA,SAAgB,EAAW,GAAY,GAA0D;CAC/F,IAAM,IAA8B,CAAC;CAErC,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS;EACjD,IAAM,IAAS,EAAS,EAAM,EAAM,GAC9B,IAAM,KAAmC,OAAO,MAAM,OAAO,CAAM;EAErE,EAAY,CAAG,MAEnB,EAAI,MAAQ,EAAI,MAAQ,KAAK;CAC/B;CAEA,OAAO;AACT"}

package/dist/array/difference.cjs

@@ -0,0 +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.difference=t;
+//# sourceMappingURL=difference.cjs.map

package/dist/array/difference.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.cjs","names":[],"sources":["../../src/array/difference.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { toSelectorSet } from '../_common/_selectorSet';\n\n/**\n * Returns elements that are in source but not in other.\n */\nexport function difference<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const deny = new Set(other);\n\n    return source.filter((item) => !deny.has(item));\n  }\n\n  const deny = toSelectorSet(other, selector);\n\n  return source.filter((item) => !deny.has(selector(item)));\n}\n"],"mappings":"+CAOA,SAAgB,EAAc,EAAa,EAAY,EAAwC,CAC7F,GAAI,CAAC,EAAU,CACb,IAAM,EAAO,IAAI,IAAI,CAAK,EAE1B,OAAO,EAAO,OAAQ,GAAS,CAAC,EAAK,IAAI,CAAI,CAAC,CAChD,CAEA,IAAM,EAAO,EAAA,cAAc,EAAO,CAAQ,EAE1C,OAAO,EAAO,OAAQ,GAAS,CAAC,EAAK,IAAI,EAAS,CAAI,CAAC,CAAC,CAC1D"}

package/dist/array/difference.d.ts

@@ -0,0 +1,6 @@
+import type { Primitive } from '../types';
+/**
+ * Returns elements that are in source but not in other.
+ */
+export declare function difference<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[];
+//# sourceMappingURL=difference.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"difference.d.ts","sourceRoot":"","sources":["../../src/array/difference.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAI1C;;GAEG;AACH,wBAAgB,UAAU,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,CAU7F"}

package/dist/array/difference.js

@@ -0,0 +1,14 @@
+import { toSelectorSet as e } from "../_common/_selectorSet.js";
+//#region src/array/difference.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 difference };
+
+//# sourceMappingURL=difference.js.map

package/dist/array/difference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.js","names":[],"sources":["../../src/array/difference.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { toSelectorSet } from '../_common/_selectorSet';\n\n/**\n * Returns elements that are in source but not in other.\n */\nexport function difference<T>(source: T[], other: T[], selector?: (item: T) => Primitive): T[] {\n  if (!selector) {\n    const deny = new Set(other);\n\n    return source.filter((item) => !deny.has(item));\n  }\n\n  const deny = toSelectorSet(other, selector);\n\n  return source.filter((item) => !deny.has(selector(item)));\n}\n"],"mappings":";;AAOA,SAAgB,EAAc,GAAa,GAAY,GAAwC;CAC7F,IAAI,CAAC,GAAU;EACb,IAAM,IAAO,IAAI,IAAI,CAAK;EAE1B,OAAO,EAAO,QAAQ,MAAS,CAAC,EAAK,IAAI,CAAI,CAAC;CAChD;CAEA,IAAM,IAAO,EAAc,GAAO,CAAQ;CAE1C,OAAO,EAAO,QAAQ,MAAS,CAAC,EAAK,IAAI,EAAS,CAAI,CAAC,CAAC;AAC1D"}

package/dist/array/drop.cjs

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

package/dist/array/drop.cjs.map

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

package/dist/array/drop.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"drop.d.ts","sourceRoot":"","sources":["../../src/array/drop.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/drop.js

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

package/dist/array/drop.js.map

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

package/dist/array/dropLast.cjs

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

package/dist/array/dropLast.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dropLast.cjs","names":[],"sources":["../../src/array/dropLast.ts"],"sourcesContent":["/**\n * Drops the last n elements from an array.\n */\nexport function dropLast<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  if (count === 0) return [...array];\n\n  return array.slice(0, 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,GAAG,CAAK,EAE1B,EAAM,MAAM,EAAG,KAAK,IAAI,EAAG,EAAM,OAAS,CAAK,CAAC,CACzD"}

package/dist/array/dropLast.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"dropLast.d.ts","sourceRoot":"","sources":["../../src/array/dropLast.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/dropLast.js

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

package/dist/array/dropLast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dropLast.js","names":[],"sources":["../../src/array/dropLast.ts"],"sourcesContent":["/**\n * Drops the last n elements from an array.\n */\nexport function dropLast<T>(array: T[], n = 1): T[] {\n  const count = Math.max(0, Math.floor(n));\n\n  if (count === 0) return [...array];\n\n  return array.slice(0, 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,GAAG,CAAK,IAE1B,EAAM,MAAM,GAAG,KAAK,IAAI,GAAG,EAAM,SAAS,CAAK,CAAC;AACzD"}

package/dist/array/filterMap.cjs

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

package/dist/array/filterMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterMap.cjs","names":[],"sources":["../../src/array/filterMap.ts"],"sourcesContent":["/**\n * Maps and filters in one pass. Returning `undefined` drops an item.\n */\nexport function filterMap<T, R>(array: T[], callback: (item: T, index: number, array: T[]) => R | undefined): R[] {\n  const result: R[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    const value = callback(array[index], index, array);\n\n    if (value !== undefined) {\n      result.push(value);\n    }\n  }\n\n  return result;\n}\n"],"mappings":"AAGA,SAAgB,EAAgB,EAAY,EAAsE,CAChH,IAAM,EAAc,CAAC,EAErB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IAAS,CACjD,IAAM,EAAQ,EAAS,EAAM,GAAQ,EAAO,CAAK,EAE7C,IAAU,IAAA,IACZ,EAAO,KAAK,CAAK,CAErB,CAEA,OAAO,CACT"}

package/dist/array/filterMap.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Maps and filters in one pass. Returning `undefined` drops an item.
+ */
+export declare function filterMap<T, R>(array: T[], callback: (item: T, index: number, array: T[]) => R | undefined): R[];
+//# sourceMappingURL=filterMap.d.ts.map

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

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

package/dist/array/filterMap.js

@@ -0,0 +1,13 @@
+//#region src/array/filterMap.ts
+function e(e, t) {
+	let n = [];
+	for (let r = 0; r < e.length; r++) {
+		let i = t(e[r], r, e);
+		i !== void 0 && n.push(i);
+	}
+	return n;
+}
+//#endregion
+export { e as filterMap };
+
+//# sourceMappingURL=filterMap.js.map

package/dist/array/filterMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterMap.js","names":[],"sources":["../../src/array/filterMap.ts"],"sourcesContent":["/**\n * Maps and filters in one pass. Returning `undefined` drops an item.\n */\nexport function filterMap<T, R>(array: T[], callback: (item: T, index: number, array: T[]) => R | undefined): R[] {\n  const result: R[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    const value = callback(array[index], index, array);\n\n    if (value !== undefined) {\n      result.push(value);\n    }\n  }\n\n  return result;\n}\n"],"mappings":";AAGA,SAAgB,EAAgB,GAAY,GAAsE;CAChH,IAAM,IAAc,CAAC;CAErB,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS;EACjD,IAAM,IAAQ,EAAS,EAAM,IAAQ,GAAO,CAAK;EAEjD,AAAI,MAAU,KAAA,KACZ,EAAO,KAAK,CAAK;CAErB;CAEA,OAAO;AACT"}

package/dist/array/first.cjs

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

package/dist/array/first.cjs.map

@@ -0,0 +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: T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,EAAS,EAAY,EAA6B,CAChE,OAAO,EAAM,OAAS,EAAI,EAAM,GAAK,CACvC"}

package/dist/array/first.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Returns the first element or fallback when array is empty.
+ */
+export declare function first<T>(array: T[], fallback?: T): T | undefined;
+//# sourceMappingURL=first.d.ts.map

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

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

package/dist/array/first.js

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

package/dist/array/first.js.map

@@ -0,0 +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: T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[0] : fallback;\n}\n"],"mappings":";AAGA,SAAgB,EAAS,GAAY,GAA6B;CAChE,OAAO,EAAM,SAAS,IAAI,EAAM,KAAK;AACvC"}

package/dist/array/flatten.cjs

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

package/dist/array/flatten.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.cjs","names":[],"sources":["../../src/array/flatten.ts"],"sourcesContent":["/**\n * Flattens nested arrays up to the provided depth.\n */\nexport function flatten<T>(array: unknown[], depth = 1): T[] {\n  if (depth < 1) return [...array] as T[];\n\n  const out: unknown[] = [];\n\n  for (const item of array) {\n    if (Array.isArray(item)) {\n      out.push(...flatten(item, depth - 1));\n    } else {\n      out.push(item);\n    }\n  }\n\n  return out as T[];\n}\n"],"mappings":"AAGA,SAAgB,EAAW,EAAkB,EAAQ,EAAQ,CAC3D,GAAI,EAAQ,EAAG,MAAO,CAAC,GAAG,CAAK,EAE/B,IAAM,EAAiB,CAAC,EAExB,IAAK,IAAM,KAAQ,EACb,MAAM,QAAQ,CAAI,EACpB,EAAI,KAAK,GAAG,EAAQ,EAAM,EAAQ,CAAC,CAAC,EAEpC,EAAI,KAAK,CAAI,EAIjB,OAAO,CACT"}

package/dist/array/flatten.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Flattens nested arrays up to the provided depth.
+ */
+export declare function flatten<T>(array: unknown[], depth?: number): T[];
+//# sourceMappingURL=flatten.d.ts.map

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

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

package/dist/array/flatten.js

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

package/dist/array/flatten.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.js","names":[],"sources":["../../src/array/flatten.ts"],"sourcesContent":["/**\n * Flattens nested arrays up to the provided depth.\n */\nexport function flatten<T>(array: unknown[], depth = 1): T[] {\n  if (depth < 1) return [...array] as T[];\n\n  const out: unknown[] = [];\n\n  for (const item of array) {\n    if (Array.isArray(item)) {\n      out.push(...flatten(item, depth - 1));\n    } else {\n      out.push(item);\n    }\n  }\n\n  return out as T[];\n}\n"],"mappings":";AAGA,SAAgB,EAAW,GAAkB,IAAQ,GAAQ;CAC3D,IAAI,IAAQ,GAAG,OAAO,CAAC,GAAG,CAAK;CAE/B,IAAM,IAAiB,CAAC;CAExB,KAAK,IAAM,KAAQ,GACjB,AAAI,MAAM,QAAQ,CAAI,IACpB,EAAI,KAAK,GAAG,EAAQ,GAAM,IAAQ,CAAC,CAAC,IAEpC,EAAI,KAAK,CAAI;CAIjB,OAAO;AACT"}

package/dist/array/groupBy.cjs

@@ -0,0 +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;
+//# sourceMappingURL=groupBy.cjs.map

package/dist/array/groupBy.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupBy.cjs","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: 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":"8CAQA,SAAgB,EAAW,EAAY,EAAuD,CAC5F,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.d.ts

@@ -0,0 +1,7 @@
+import type { Primitive } from '../types';
+/**
+ * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,
+ * `prototype`) are skipped.
+ */
+export declare function groupBy<T>(array: T[], selector: (item: T) => Primitive): Record<string, T[]>;
+//# sourceMappingURL=groupBy.d.ts.map

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

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

package/dist/array/groupBy.js

@@ -0,0 +1,14 @@
+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 };
+
+//# sourceMappingURL=groupBy.js.map

package/dist/array/groupBy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupBy.js","names":[],"sources":["../../src/array/groupBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\n\n/**\n * Groups elements by a selector function. Dangerous keys (`__proto__`, `constructor`,\n * `prototype`) are skipped.\n */\nexport function groupBy<T>(array: 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":";;AAQA,SAAgB,EAAW,GAAY,GAAuD;CAC5F,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"}

package/dist/array/index.d.ts

@@ -0,0 +1,29 @@
+export * from './chunk';
+export * from './compact';
+export * from './compare';
+export * from './compareBy';
+export * from './contains';
+export * from './countBy';
+export * from './difference';
+export * from './drop';
+export * from './dropLast';
+export * from './filterMap';
+export * from './first';
+export * from './flatten';
+export * from './groupBy';
+export * from './indexBy';
+export * from './intersection';
+export * from './last';
+export * from './partition';
+export * from './replace';
+export * from './rotate';
+export * from './search';
+export * from './sort';
+export * from './take';
+export * from './takeLast';
+export * from './toggle';
+export * from './union';
+export * from './uniq';
+export * from './unzip';
+export * from './zip';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/array/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,cAAc,CAAC;AAC7B,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,QAAQ,CAAC;AACvB,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC;AACvB,cAAc,SAAS,CAAC;AACxB,cAAc,OAAO,CAAC"}

package/dist/array/indexBy.cjs

@@ -0,0 +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;
+//# sourceMappingURL=indexBy.cjs.map

package/dist/array/indexBy.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexBy.cjs","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\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: 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":"8CAQA,SAAgB,EAAW,EAAY,EAAqD,CAC1F,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.d.ts

@@ -0,0 +1,7 @@
+import type { Primitive } from '../types';
+/**
+ * Creates an object keyed by selector result. Last item wins on collisions. Dangerous keys
+ * (`__proto__`, `constructor`, `prototype`) are skipped.
+ */
+export declare function indexBy<T>(array: T[], selector: (item: T) => Primitive): Record<string, T>;
+//# sourceMappingURL=indexBy.d.ts.map

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

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

package/dist/array/indexBy.js

@@ -0,0 +1,14 @@
+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 };
+
+//# sourceMappingURL=indexBy.js.map

package/dist/array/indexBy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexBy.js","names":[],"sources":["../../src/array/indexBy.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { isUnsafeKey } from '../_common/unsafePaths';\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: 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":";;AAQA,SAAgB,EAAW,GAAY,GAAqD;CAC1F,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"}

package/dist/array/intersection.cjs

@@ -0,0 +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;
+//# sourceMappingURL=intersection.cjs.map

package/dist/array/intersection.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.cjs","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { toSelectorSet } from '../_common/_selectorSet';\n\n/**\n * Returns elements that are present in both arrays.\n */\nexport function intersection<T>(source: T[], other: 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":"+CAOA,SAAgB,EAAgB,EAAa,EAAY,EAAwC,CAC/F,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.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.d.ts","sourceRoot":"","sources":["../../src/array/intersection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAI1C;;GAEG;AACH,wBAAgB,YAAY,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,CAU/F"}

package/dist/array/intersection.js

@@ -0,0 +1,14 @@
+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 };
+
+//# sourceMappingURL=intersection.js.map

package/dist/array/intersection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.js","names":[],"sources":["../../src/array/intersection.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\nimport { toSelectorSet } from '../_common/_selectorSet';\n\n/**\n * Returns elements that are present in both arrays.\n */\nexport function intersection<T>(source: T[], other: 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":";;AAOA,SAAgB,EAAgB,GAAa,GAAY,GAAwC;CAC/F,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"}

package/dist/array/last.cjs

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

package/dist/array/last.cjs.map

@@ -0,0 +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: T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":"AAGA,SAAgB,EAAQ,EAAY,EAA6B,CAC/D,OAAO,EAAM,OAAS,EAAI,EAAM,EAAM,OAAS,GAAK,CACtD"}

package/dist/array/last.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Returns the last element or fallback when array is empty.
+ */
+export declare function last<T>(array: T[], fallback?: T): T | undefined;
+//# sourceMappingURL=last.d.ts.map

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

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

package/dist/array/last.js

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

package/dist/array/last.js.map

@@ -0,0 +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: T[], fallback?: T): T | undefined {\n  return array.length > 0 ? array[array.length - 1] : fallback;\n}\n"],"mappings":";AAGA,SAAgB,EAAQ,GAAY,GAA6B;CAC/D,OAAO,EAAM,SAAS,IAAI,EAAM,EAAM,SAAS,KAAK;AACtD"}

package/dist/array/partition.cjs

@@ -0,0 +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;
+//# sourceMappingURL=partition.cjs.map

package/dist/array/partition.cjs.map

@@ -0,0 +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 */\nexport function partition<T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean): [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":"AAGA,SAAgB,EAAa,EAAY,EAAwE,CAC/G,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.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Splits an array into values that match and do not match the predicate.
+ */
+export declare function partition<T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean): [T[], T[]];
+//# sourceMappingURL=partition.d.ts.map

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

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

package/dist/array/partition.js

@@ -0,0 +1,10 @@
+//#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 };
+
+//# sourceMappingURL=partition.js.map

package/dist/array/partition.js.map

@@ -0,0 +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 */\nexport function partition<T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean): [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":";AAGA,SAAgB,EAAa,GAAY,GAAwE;CAC/G,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"}

package/dist/array/replace.cjs

@@ -0,0 +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;
+//# sourceMappingURL=replace.cjs.map

package/dist/array/replace.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.cjs","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/**\n * Replaces the first element in an array that satisfies the provided predicate\n * function with a new value.\n *\n * @example\n * ```ts\n * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]\n * ```\n *\n * @param array - The array to search.\n * @param predicate - A function to test each element of the array.\n * @param value - The new value to replace the found element.\n *\n * @return A new array with the replaced value.\n */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): 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":"AAiBA,SAAgB,EAAW,EAAY,EAAyB,EAAe,CAC7E,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.d.ts

@@ -0,0 +1,18 @@
+import type { Predicate } from '../types';
+/**
+ * Replaces the first element in an array that satisfies the provided predicate
+ * function with a new value.
+ *
+ * @example
+ * ```ts
+ * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]
+ * ```
+ *
+ * @param array - The array to search.
+ * @param predicate - A function to test each element of the array.
+ * @param value - The new value to replace the found element.
+ *
+ * @return A new array with the replaced value.
+ */
+export declare function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];
+//# sourceMappingURL=replace.d.ts.map

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

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

package/dist/array/replace.js

@@ -0,0 +1,13 @@
+//#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 };
+
+//# sourceMappingURL=replace.js.map

package/dist/array/replace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.js","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\n/**\n * Replaces the first element in an array that satisfies the provided predicate\n * function with a new value.\n *\n * @example\n * ```ts\n * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]\n * ```\n *\n * @param array - The array to search.\n * @param predicate - A function to test each element of the array.\n * @param value - The new value to replace the found element.\n *\n * @return A new array with the replaced value.\n */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): 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":";AAiBA,SAAgB,EAAW,GAAY,GAAyB,GAAe;CAC7E,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"}

package/dist/array/rotate.cjs

@@ -0,0 +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;
+//# sourceMappingURL=rotate.cjs.map

package/dist/array/rotate.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.cjs","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,EAAY,EAAmB,CAAE,OAAO,IAA8B,CAAC,EAAQ,CACvG,GAAI,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,GAAkB,EAAY,EAAM,OAAU,EAAM,QAAU,EAAM,OACpE,EAAU,EAAM,MAAM,CAAa,EAEzC,OAAO,EAAO,CAAC,GAAG,EAAS,GAAG,EAAM,MAAM,EAAG,CAAa,CAAC,EAAI,CACjE"}