@vielzeug/arsenal 1.1.1 → 2.0.0

package/dist/random/_index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_index.js","names":[],"sources":["../../src/random/_index.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nexport function randomIndex(exclusiveMax: number, source?: RandomSource): number {\n  const value = source?.next() ?? crypto.getRandomValues(new Uint32Array(1))[0]! / 0x100000000;\n\n  if (!Number.isFinite(value) || value < 0 || value >= 1) {\n    throw new RangeError('random source must return a finite number in [0, 1)');\n  }\n\n  return Math.floor(value * exclusiveMax);\n}\n"],"mappings":";AAEA,SAAgB,EAAY,GAAsB,GAA+B;CAC/E,IAAM,IAAQ,GAAQ,KAAK,KAAK,OAAO,gCAAgB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,KAAM;CAEjF,IAAI,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,KAAK,KAAS,GACnD,MAAU,WAAW,qDAAqD;CAG5E,OAAO,KAAK,MAAM,IAAQ,CAAY;AACxC"}

package/dist/random/draw.cjs

@@ -1,2 +1,2 @@
-const e=require("../_common/_secureRandomIndex.cjs"),t=require("./random.cjs");function n(e){if(e.length!==0)return e[t.random(0,e.length-1)]}function r(t,n){let r=Math.max(0,Math.min(t.length,Math.floor(n)));if(r===0)return[];if(r===t.length)return[...t];let i=[...t];for(let t=i.length-1;t>0;t--){let n=e.secureRandomIndex(t+1),r=i[t];i[t]=i[n],i[n]=r}return i.slice(0,r)}exports.draw=n,exports.drawMany=r;
+const e=require("./_index.cjs"),t=require("./random.cjs");function n(e,n){if(e.length!==0)return e[t.random(0,e.length-1,n)]}function r(t,n,r){let i=Math.max(0,Math.min(t.length,Math.floor(n)));if(i===0)return[];if(i===t.length)return[...t];let a=[...t];for(let t=a.length-1;t>0;t--){let n=e.randomIndex(t+1,r),i=a[t];a[t]=a[n],a[n]=i}return a.slice(0,i)}exports.draw=n,exports.drawMany=r;
 //# sourceMappingURL=draw.cjs.map

package/dist/random/draw.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"draw.cjs","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\nimport { random } from './random';\n\n/**\n * Picks a single random item from an array.\n * Returns `undefined` if the array is empty.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]); // e.g. 2\n * draw([]);         // undefined\n * ```\n */\nexport function draw<T>(array: T[]): T | undefined {\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n}\n\n/**\n * Picks up to `n` unique random items from an array using a cryptographically\n * random shuffle (Fisher-Yates via `crypto.getRandomValues`).\n * Returns a new array; does not mutate the input.\n *\n * @example\n * ```ts\n * drawMany([1, 2, 3, 4, 5], 3); // e.g. [4, 1, 3]\n * drawMany([1, 2], 10);          // [1, 2] (clamped to array length)\n * ```\n */\nexport function drawMany<T>(array: T[], n: number): T[] {\n  const count = Math.max(0, Math.min(array.length, Math.floor(n)));\n\n  if (count === 0) return [];\n\n  if (count === array.length) return [...array];\n\n  const copy = [...array];\n\n  for (let index = copy.length - 1; index > 0; index--) {\n    const randomIndex = secureRandomIndex(index + 1);\n    const temp = copy[index];\n\n    copy[index] = copy[randomIndex]!;\n    copy[randomIndex] = temp!;\n  }\n\n  return copy.slice(0, count);\n}\n"],"mappings":"+EAaA,SAAgB,EAAQ,EAA2B,CAC7C,KAAM,SAAW,EAErB,OAAO,EAAM,EAAA,OAAO,EAAG,EAAM,OAAS,CAAC,EACzC,CAaA,SAAgB,EAAY,EAAY,EAAgB,CACtD,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,IAAI,EAAM,OAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,EAE/D,GAAI,IAAU,EAAG,MAAO,CAAC,EAEzB,GAAI,IAAU,EAAM,OAAQ,MAAO,CAAC,GAAG,CAAK,EAE5C,IAAM,EAAO,CAAC,GAAG,CAAK,EAEtB,IAAK,IAAI,EAAQ,EAAK,OAAS,EAAG,EAAQ,EAAG,IAAS,CACpD,IAAM,EAAc,EAAA,kBAAkB,EAAQ,CAAC,EACzC,EAAO,EAAK,GAElB,EAAK,GAAS,EAAK,GACnB,EAAK,GAAe,CACtB,CAEA,OAAO,EAAK,MAAM,EAAG,CAAK,CAC5B"}
+{"version":3,"file":"draw.cjs","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\nimport { random } from './random';\n\n/**\n * Picks a single random item from an array.\n * Returns `undefined` if the array is empty.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]); // e.g. 2\n * draw([]);         // undefined\n * ```\n */\nexport function draw<T>(array: T[], source?: RandomSource): T | undefined {\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1, source)];\n}\n\n/**\n * Picks up to `n` unique random items from an array using a cryptographically\n * random shuffle (Fisher-Yates via `crypto.getRandomValues`).\n * Returns a new array; does not mutate the input.\n *\n * @example\n * ```ts\n * drawMany([1, 2, 3, 4, 5], 3); // e.g. [4, 1, 3]\n * drawMany([1, 2], 10);          // [1, 2] (clamped to array length)\n * ```\n */\nexport function drawMany<T>(array: T[], n: number, source?: RandomSource): T[] {\n  const count = Math.max(0, Math.min(array.length, Math.floor(n)));\n\n  if (count === 0) return [];\n\n  if (count === array.length) return [...array];\n\n  const copy = [...array];\n\n  for (let index = copy.length - 1; index > 0; index--) {\n    const selectedIndex = randomIndex(index + 1, source);\n    const temp = copy[index];\n\n    copy[index] = copy[selectedIndex]!;\n    copy[selectedIndex] = temp!;\n  }\n\n  return copy.slice(0, count);\n}\n"],"mappings":"0DAeA,SAAgB,EAAQ,EAAY,EAAsC,CACpE,KAAM,SAAW,EAErB,OAAO,EAAM,EAAA,OAAO,EAAG,EAAM,OAAS,EAAG,CAAM,EACjD,CAaA,SAAgB,EAAY,EAAY,EAAW,EAA4B,CAC7E,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,IAAI,EAAM,OAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,EAE/D,GAAI,IAAU,EAAG,MAAO,CAAC,EAEzB,GAAI,IAAU,EAAM,OAAQ,MAAO,CAAC,GAAG,CAAK,EAE5C,IAAM,EAAO,CAAC,GAAG,CAAK,EAEtB,IAAK,IAAI,EAAQ,EAAK,OAAS,EAAG,EAAQ,EAAG,IAAS,CACpD,IAAM,EAAgB,EAAA,YAAY,EAAQ,EAAG,CAAM,EAC7C,EAAO,EAAK,GAElB,EAAK,GAAS,EAAK,GACnB,EAAK,GAAiB,CACxB,CAEA,OAAO,EAAK,MAAM,EAAG,CAAK,CAC5B"}

package/dist/random/draw.d.ts

@@ -1,3 +1,4 @@
+import type { RandomSource } from './source';
 /**
  * Picks a single random item from an array.
  * Returns `undefined` if the array is empty.
@@ -8,7 +9,7 @@
  * draw([]);         // undefined
  * ```
  */
-export declare function draw<T>(array: T[]): T | undefined;
+export declare function draw<T>(array: T[], source?: RandomSource): T | undefined;
 /**
  * Picks up to `n` unique random items from an array using a cryptographically
  * random shuffle (Fisher-Yates via `crypto.getRandomValues`).
@@ -20,5 +21,5 @@ export declare function draw<T>(array: T[]): T | undefined;
  * drawMany([1, 2], 10);          // [1, 2] (clamped to array length)
  * ```
  */
-export declare function drawMany<T>(array: T[], n: number): T[];
+export declare function drawMany<T>(array: T[], n: number, source?: RandomSource): T[];
 //# sourceMappingURL=draw.d.ts.map

package/dist/random/draw.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"draw.d.ts","sourceRoot":"","sources":["../../src/random/draw.ts"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,CAIjD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAkBtD"}
+{"version":3,"file":"draw.d.ts","sourceRoot":"","sources":["../../src/random/draw.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAK7C;;;;;;;;;GASG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,CAAC,GAAG,SAAS,CAIxE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,CAAC,EAAE,CAkB7E"}

package/dist/random/draw.js

@@ -1,19 +1,19 @@
-import { secureRandomIndex as e } from "../_common/_secureRandomIndex.js";
+import { randomIndex as e } from "./_index.js";
 import { random as t } from "./random.js";
 //#region src/random/draw.ts
-function n(e) {
-	if (e.length !== 0) return e[t(0, e.length - 1)];
+function n(e, n) {
+	if (e.length !== 0) return e[t(0, e.length - 1, n)];
 }
-function r(t, n) {
-	let r = Math.max(0, Math.min(t.length, Math.floor(n)));
-	if (r === 0) return [];
-	if (r === t.length) return [...t];
-	let i = [...t];
-	for (let t = i.length - 1; t > 0; t--) {
-		let n = e(t + 1), r = i[t];
-		i[t] = i[n], i[n] = r;
+function r(t, n, r) {
+	let i = Math.max(0, Math.min(t.length, Math.floor(n)));
+	if (i === 0) return [];
+	if (i === t.length) return [...t];
+	let a = [...t];
+	for (let t = a.length - 1; t > 0; t--) {
+		let n = e(t + 1, r), i = a[t];
+		a[t] = a[n], a[n] = i;
 	}
-	return i.slice(0, r);
+	return a.slice(0, i);
 }
 //#endregion
 export { n as draw, r as drawMany };

package/dist/random/draw.js.map

@@ -1 +1 @@
-{"version":3,"file":"draw.js","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\nimport { random } from './random';\n\n/**\n * Picks a single random item from an array.\n * Returns `undefined` if the array is empty.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]); // e.g. 2\n * draw([]);         // undefined\n * ```\n */\nexport function draw<T>(array: T[]): T | undefined {\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n}\n\n/**\n * Picks up to `n` unique random items from an array using a cryptographically\n * random shuffle (Fisher-Yates via `crypto.getRandomValues`).\n * Returns a new array; does not mutate the input.\n *\n * @example\n * ```ts\n * drawMany([1, 2, 3, 4, 5], 3); // e.g. [4, 1, 3]\n * drawMany([1, 2], 10);          // [1, 2] (clamped to array length)\n * ```\n */\nexport function drawMany<T>(array: T[], n: number): T[] {\n  const count = Math.max(0, Math.min(array.length, Math.floor(n)));\n\n  if (count === 0) return [];\n\n  if (count === array.length) return [...array];\n\n  const copy = [...array];\n\n  for (let index = copy.length - 1; index > 0; index--) {\n    const randomIndex = secureRandomIndex(index + 1);\n    const temp = copy[index];\n\n    copy[index] = copy[randomIndex]!;\n    copy[randomIndex] = temp!;\n  }\n\n  return copy.slice(0, count);\n}\n"],"mappings":";;;AAaA,SAAgB,EAAQ,GAA2B;CAC7C,MAAM,WAAW,GAErB,OAAO,EAAM,EAAO,GAAG,EAAM,SAAS,CAAC;AACzC;AAaA,SAAgB,EAAY,GAAY,GAAgB;CACtD,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,EAAM,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC;CAE/D,IAAI,MAAU,GAAG,OAAO,CAAC;CAEzB,IAAI,MAAU,EAAM,QAAQ,OAAO,CAAC,GAAG,CAAK;CAE5C,IAAM,IAAO,CAAC,GAAG,CAAK;CAEtB,KAAK,IAAI,IAAQ,EAAK,SAAS,GAAG,IAAQ,GAAG,KAAS;EACpD,IAAM,IAAc,EAAkB,IAAQ,CAAC,GACzC,IAAO,EAAK;EAGlB,AADA,EAAK,KAAS,EAAK,IACnB,EAAK,KAAe;CACtB;CAEA,OAAO,EAAK,MAAM,GAAG,CAAK;AAC5B"}
+{"version":3,"file":"draw.js","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\nimport { random } from './random';\n\n/**\n * Picks a single random item from an array.\n * Returns `undefined` if the array is empty.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]); // e.g. 2\n * draw([]);         // undefined\n * ```\n */\nexport function draw<T>(array: T[], source?: RandomSource): T | undefined {\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1, source)];\n}\n\n/**\n * Picks up to `n` unique random items from an array using a cryptographically\n * random shuffle (Fisher-Yates via `crypto.getRandomValues`).\n * Returns a new array; does not mutate the input.\n *\n * @example\n * ```ts\n * drawMany([1, 2, 3, 4, 5], 3); // e.g. [4, 1, 3]\n * drawMany([1, 2], 10);          // [1, 2] (clamped to array length)\n * ```\n */\nexport function drawMany<T>(array: T[], n: number, source?: RandomSource): T[] {\n  const count = Math.max(0, Math.min(array.length, Math.floor(n)));\n\n  if (count === 0) return [];\n\n  if (count === array.length) return [...array];\n\n  const copy = [...array];\n\n  for (let index = copy.length - 1; index > 0; index--) {\n    const selectedIndex = randomIndex(index + 1, source);\n    const temp = copy[index];\n\n    copy[index] = copy[selectedIndex]!;\n    copy[selectedIndex] = temp!;\n  }\n\n  return copy.slice(0, count);\n}\n"],"mappings":";;;AAeA,SAAgB,EAAQ,GAAY,GAAsC;CACpE,MAAM,WAAW,GAErB,OAAO,EAAM,EAAO,GAAG,EAAM,SAAS,GAAG,CAAM;AACjD;AAaA,SAAgB,EAAY,GAAY,GAAW,GAA4B;CAC7E,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,EAAM,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC;CAE/D,IAAI,MAAU,GAAG,OAAO,CAAC;CAEzB,IAAI,MAAU,EAAM,QAAQ,OAAO,CAAC,GAAG,CAAK;CAE5C,IAAM,IAAO,CAAC,GAAG,CAAK;CAEtB,KAAK,IAAI,IAAQ,EAAK,SAAS,GAAG,IAAQ,GAAG,KAAS;EACpD,IAAM,IAAgB,EAAY,IAAQ,GAAG,CAAM,GAC7C,IAAO,EAAK;EAGlB,AADA,EAAK,KAAS,EAAK,IACnB,EAAK,KAAiB;CACxB;CAEA,OAAO,EAAK,MAAM,GAAG,CAAK;AAC5B"}

package/dist/random/index.cjs

@@ -0,0 +1 @@
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./uuid.cjs"),t=require("./random.cjs"),n=require("./draw.cjs"),r=require("./shuffle.cjs");exports.draw=n.draw,exports.drawMany=n.drawMany,exports.random=t.random,exports.shuffle=r.shuffle,exports.uuid=e.uuid;

package/dist/random/index.d.ts

@@ -1,5 +1,6 @@
 export * from './draw';
 export * from './random';
 export * from './shuffle';
+export * from './source';
 export * from './uuid';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/random/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,QAAQ,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/random/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC"}

package/dist/random/index.js

@@ -0,0 +1,5 @@
+import { uuid as e } from "./uuid.js";
+import { random as t } from "./random.js";
+import { draw as n, drawMany as r } from "./draw.js";
+import { shuffle as i } from "./shuffle.js";
+export { n as draw, r as drawMany, t as random, i as shuffle, e as uuid };

package/dist/random/random.cjs

@@ -1,2 +1,2 @@
-const e=require("../errors.cjs"),t=require("../_common/_secureRandomIndex.cjs");function n(n,r){if(n>r)throw new e.ArsenalValidationError(`random: minimum value must not be greater than maximum value`);return t.secureRandomIndex(r-n+1)+n}exports.random=n;
+const e=require("./_index.cjs");function t(t,n,r){if(t>n)throw RangeError(`random: minimum value must not be greater than maximum value`);return e.randomIndex(n-t+1,r)+t}exports.random=t;
 //# sourceMappingURL=random.cjs.map

package/dist/random/random.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"random.cjs","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\nimport { ArsenalValidationError } from '../errors';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number): number {\n  if (min > max) throw new ArsenalValidationError('random: minimum value must not be greater than maximum value');\n\n  return secureRandomIndex(max - min + 1) + min;\n}\n"],"mappings":"gFAeA,SAAgB,EAAO,EAAa,EAAqB,CACvD,GAAI,EAAM,EAAK,MAAM,IAAI,EAAA,uBAAuB,8DAA8D,EAE9G,OAAO,EAAA,kBAAkB,EAAM,EAAM,CAAC,EAAI,CAC5C"}
+{"version":3,"file":"random.cjs","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number, source?: RandomSource): number {\n  if (min > max) throw new RangeError('random: minimum value must not be greater than maximum value');\n\n  return randomIndex(max - min + 1, source) + min;\n}\n"],"mappings":"gCAgBA,SAAgB,EAAO,EAAa,EAAa,EAA+B,CAC9E,GAAI,EAAM,EAAK,MAAU,WAAW,8DAA8D,EAElG,OAAO,EAAA,YAAY,EAAM,EAAM,EAAG,CAAM,EAAI,CAC9C"}

package/dist/random/random.d.ts

@@ -1,3 +1,4 @@
+import type { RandomSource } from './source';
 /**
  * Generates a random integer between two values, inclusive.
  *
@@ -10,5 +11,5 @@
  * @param max - The maximum value.
  * @returns A random integer between min and max.
  */
-export declare function random(min: number, max: number): number;
+export declare function random(min: number, max: number, source?: RandomSource): number;
 //# sourceMappingURL=random.d.ts.map

package/dist/random/random.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../../src/random/random.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAIvD"}
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../../src/random/random.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAI7C;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,MAAM,CAI9E"}

package/dist/random/random.js

@@ -1,11 +1,10 @@
-import { ArsenalValidationError as e } from "../errors.js";
-import { secureRandomIndex as t } from "../_common/_secureRandomIndex.js";
+import { randomIndex as e } from "./_index.js";
 //#region src/random/random.ts
-function n(n, r) {
-	if (n > r) throw new e("random: minimum value must not be greater than maximum value");
-	return t(r - n + 1) + n;
+function t(t, n, r) {
+	if (t > n) throw RangeError("random: minimum value must not be greater than maximum value");
+	return e(n - t + 1, r) + t;
 }
 //#endregion
-export { n as random };
+export { t as random };
 
 //# sourceMappingURL=random.js.map

package/dist/random/random.js.map

@@ -1 +1 @@
-{"version":3,"file":"random.js","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\nimport { ArsenalValidationError } from '../errors';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number): number {\n  if (min > max) throw new ArsenalValidationError('random: minimum value must not be greater than maximum value');\n\n  return secureRandomIndex(max - min + 1) + min;\n}\n"],"mappings":";;;AAeA,SAAgB,EAAO,GAAa,GAAqB;CACvD,IAAI,IAAM,GAAK,MAAM,IAAI,EAAuB,8DAA8D;CAE9G,OAAO,EAAkB,IAAM,IAAM,CAAC,IAAI;AAC5C"}
+{"version":3,"file":"random.js","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number, source?: RandomSource): number {\n  if (min > max) throw new RangeError('random: minimum value must not be greater than maximum value');\n\n  return randomIndex(max - min + 1, source) + min;\n}\n"],"mappings":";;AAgBA,SAAgB,EAAO,GAAa,GAAa,GAA+B;CAC9E,IAAI,IAAM,GAAK,MAAU,WAAW,8DAA8D;CAElG,OAAO,EAAY,IAAM,IAAM,GAAG,CAAM,IAAI;AAC9C"}

package/dist/random/shuffle.cjs

@@ -1,2 +1,2 @@
-const e=require("../_common/_secureRandomIndex.cjs");function t(t){let n=[...t];for(let t=n.length-1;t>0;t--){let r=e.secureRandomIndex(t+1);[n[t],n[r]]=[n[r],n[t]]}return n}exports.shuffle=t;
+const e=require("./_index.cjs");function t(t,n){let r=[...t];for(let t=r.length-1;t>0;t--){let i=e.randomIndex(t+1,n);[r[t],r[i]]=[r[i],r[t]]}return r}exports.shuffle=t;
 //# sourceMappingURL=shuffle.cjs.map

package/dist/random/shuffle.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle.cjs","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\n\n/**\n * Returns a new randomly-shuffled copy of the array using Fisher-Yates\n * with `crypto.getRandomValues`. Does not mutate the input.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // e.g. [3, 1, 4, 2]\n * ```\n */\nexport function shuffle<T>(array: T[]): T[] {\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = secureRandomIndex(i + 1);\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":"qDAYA,SAAgB,EAAW,EAAiB,CAC1C,IAAM,EAAS,CAAC,GAAG,CAAK,EAExB,IAAK,IAAI,EAAI,EAAO,OAAS,EAAG,EAAI,EAAG,IAAK,CAC1C,IAAM,EAAI,EAAA,kBAAkB,EAAI,CAAC,EAEjC,CAAC,EAAO,GAAI,EAAO,IAAM,CAAC,EAAO,GAAI,EAAO,EAAE,CAChD,CAEA,OAAO,CACT"}
+{"version":3,"file":"shuffle.cjs","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\n\n/**\n * Returns a new randomly-shuffled copy of the array using Fisher-Yates\n * with `crypto.getRandomValues`. Does not mutate the input.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // e.g. [3, 1, 4, 2]\n * ```\n */\nexport function shuffle<T>(array: T[], source?: RandomSource): T[] {\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = randomIndex(i + 1, source);\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":"gCAcA,SAAgB,EAAW,EAAY,EAA4B,CACjE,IAAM,EAAS,CAAC,GAAG,CAAK,EAExB,IAAK,IAAI,EAAI,EAAO,OAAS,EAAG,EAAI,EAAG,IAAK,CAC1C,IAAM,EAAI,EAAA,YAAY,EAAI,EAAG,CAAM,EAEnC,CAAC,EAAO,GAAI,EAAO,IAAM,CAAC,EAAO,GAAI,EAAO,EAAE,CAChD,CAEA,OAAO,CACT"}

package/dist/random/shuffle.d.ts

@@ -1,3 +1,4 @@
+import type { RandomSource } from './source';
 /**
  * Returns a new randomly-shuffled copy of the array using Fisher-Yates
  * with `crypto.getRandomValues`. Does not mutate the input.
@@ -8,5 +9,5 @@
  * shuffle(arr); // e.g. [3, 1, 4, 2]
  * ```
  */
-export declare function shuffle<T>(array: T[]): T[];
+export declare function shuffle<T>(array: T[], source?: RandomSource): T[];
 //# sourceMappingURL=shuffle.d.ts.map

package/dist/random/shuffle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle.d.ts","sourceRoot":"","sources":["../../src/random/shuffle.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAU1C"}
+{"version":3,"file":"shuffle.d.ts","sourceRoot":"","sources":["../../src/random/shuffle.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAI7C;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,CAAC,EAAE,CAUjE"}

package/dist/random/shuffle.js

@@ -1,12 +1,12 @@
-import { secureRandomIndex as e } from "../_common/_secureRandomIndex.js";
+import { randomIndex as e } from "./_index.js";
 //#region src/random/shuffle.ts
-function t(t) {
-	let n = [...t];
-	for (let t = n.length - 1; t > 0; t--) {
-		let r = e(t + 1);
-		[n[t], n[r]] = [n[r], n[t]];
+function t(t, n) {
+	let r = [...t];
+	for (let t = r.length - 1; t > 0; t--) {
+		let i = e(t + 1, n);
+		[r[t], r[i]] = [r[i], r[t]];
 	}
-	return n;
+	return r;
 }
 //#endregion
 export { t as shuffle };

package/dist/random/shuffle.js.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle.js","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { secureRandomIndex } from '../_common/_secureRandomIndex';\n\n/**\n * Returns a new randomly-shuffled copy of the array using Fisher-Yates\n * with `crypto.getRandomValues`. Does not mutate the input.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // e.g. [3, 1, 4, 2]\n * ```\n */\nexport function shuffle<T>(array: T[]): T[] {\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = secureRandomIndex(i + 1);\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":";;AAYA,SAAgB,EAAW,GAAiB;CAC1C,IAAM,IAAS,CAAC,GAAG,CAAK;CAExB,KAAK,IAAI,IAAI,EAAO,SAAS,GAAG,IAAI,GAAG,KAAK;EAC1C,IAAM,IAAI,EAAkB,IAAI,CAAC;EAEjC,CAAC,EAAO,IAAI,EAAO,MAAM,CAAC,EAAO,IAAI,EAAO,EAAE;CAChD;CAEA,OAAO;AACT"}
+{"version":3,"file":"shuffle.js","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import type { RandomSource } from './source';\n\nimport { randomIndex } from './_index';\n\n/**\n * Returns a new randomly-shuffled copy of the array using Fisher-Yates\n * with `crypto.getRandomValues`. Does not mutate the input.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // e.g. [3, 1, 4, 2]\n * ```\n */\nexport function shuffle<T>(array: T[], source?: RandomSource): T[] {\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = randomIndex(i + 1, source);\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":";;AAcA,SAAgB,EAAW,GAAY,GAA4B;CACjE,IAAM,IAAS,CAAC,GAAG,CAAK;CAExB,KAAK,IAAI,IAAI,EAAO,SAAS,GAAG,IAAI,GAAG,KAAK;EAC1C,IAAM,IAAI,EAAY,IAAI,GAAG,CAAM;EAEnC,CAAC,EAAO,IAAI,EAAO,MAAM,CAAC,EAAO,IAAI,EAAO,EAAE;CAChD;CAEA,OAAO;AACT"}

package/dist/random/source.d.ts

@@ -0,0 +1,4 @@
+export type RandomSource = {
+    next(): number;
+};
+//# sourceMappingURL=source.d.ts.map

package/dist/random/source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"source.d.ts","sourceRoot":"","sources":["../../src/random/source.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,YAAY,GAAG;IACzB,IAAI,IAAI,MAAM,CAAC;CAChB,CAAC"}

package/dist/string/index.cjs

@@ -0,0 +1 @@
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./similarity.cjs"),t=require("./camelCase.cjs"),n=require("./escape.cjs"),r=require("./kebabCase.cjs"),i=require("./pad.cjs"),a=require("./pascalCase.cjs"),o=require("./snakeCase.cjs"),s=require("./words.cjs"),c=require("./titleCase.cjs"),l=require("./truncate.cjs"),u=require("./unescape.cjs");exports.camelCase=t.camelCase,exports.escape=n.escape,exports.kebabCase=r.kebabCase,exports.pad=i.pad,exports.pascalCase=a.pascalCase,exports.similarity=e.similarity,exports.snakeCase=o.snakeCase,exports.titleCase=c.titleCase,exports.truncate=l.truncate,exports.unescape=u.unescape,exports.words=s.words;

package/dist/string/index.d.ts

@@ -1,12 +1,10 @@
 export * from './camelCase';
-export * from './endsWith';
 export * from './escape';
 export * from './kebabCase';
 export * from './pad';
 export * from './pascalCase';
 export * from './similarity';
 export * from './snakeCase';
-export * from './startsWith';
 export * from './titleCase';
 export * from './truncate';
 export * from './unescape';

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,SAAS,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,SAAS,CAAC"}

package/dist/string/index.js

@@ -0,0 +1,12 @@
+import { similarity as e } from "./similarity.js";
+import { camelCase as t } from "./camelCase.js";
+import { escape as n } from "./escape.js";
+import { kebabCase as r } from "./kebabCase.js";
+import { pad as i } from "./pad.js";
+import { pascalCase as a } from "./pascalCase.js";
+import { snakeCase as o } from "./snakeCase.js";
+import { words as s } from "./words.js";
+import { titleCase as c } from "./titleCase.js";
+import { truncate as l } from "./truncate.js";
+import { unescape as u } from "./unescape.js";
+export { t as camelCase, n as escape, r as kebabCase, i as pad, a as pascalCase, e as similarity, o as snakeCase, c as titleCase, l as truncate, u as unescape, s as words };

package/dist/string/similarity.cjs

@@ -1,2 +1,2 @@
-const e=require("../errors.cjs");var t=1e4;function n(n,r){if(n.length>t||r.length>t)throw new e.ArsenalValidationError(`similarity: input strings must not exceed ${t} characters to prevent excessive memory usage`);let i=n.toLowerCase(),a=r.toLowerCase();if(i===a)return 1;if(i.length===0)return+(a.length===0);if(a.length===0)return 0;let[o,s]=i.length<a.length?[i,a]:[a,i],c=o.length,l=s.length,u=Array.from({length:c+1},(e,t)=>t),d=Array(c+1);for(let e=1;e<=l;e++){d[0]=e;for(let t=1;t<=c;t++){let n=s[e-1]===o[t-1]?0:1;d[t]=Math.min(d[t-1]+1,u[t]+1,u[t-1]+n)}[u,d]=[d,u]}return 1-u[c]/Math.max(i.length,a.length)}exports.similarity=n;
+var e=1e4;function t(t,n){if(t.length>e||n.length>e)throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);let r=t.toLowerCase(),i=n.toLowerCase();if(r===i)return 1;if(r.length===0)return+(i.length===0);if(i.length===0)return 0;let[a,o]=r.length<i.length?[r,i]:[i,r],s=a.length,c=o.length,l=Array.from({length:s+1},(e,t)=>t),u=Array(s+1);for(let e=1;e<=c;e++){u[0]=e;for(let t=1;t<=s;t++){let n=o[e-1]===a[t-1]?0:1;u[t]=Math.min(u[t-1]+1,l[t]+1,l[t-1]+n)}[l,u]=[u,l]}return 1-l[s]/Math.max(r.length,i.length)}exports.similarity=t;
 //# sourceMappingURL=similarity.cjs.map

package/dist/string/similarity.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"similarity.cjs","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\n/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n *\n * @throws {ArsenalValidationError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new ArsenalValidationError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":"iCAsBA,IAAM,EAAwB,IAE9B,SAAgB,EAAW,EAAc,EAAsB,CAC7D,GAAI,EAAK,OAAS,GAAyB,EAAK,OAAS,EACvD,MAAM,IAAI,EAAA,uBACR,6CAA6C,EAAsB,8CACrE,EAGF,IAAM,EAAI,EAAK,YAAY,EACrB,EAAI,EAAK,YAAY,EAE3B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,MAAO,IAAE,SAAW,GAExC,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,CAAC,EAAI,CAAC,EAAG,CAAC,EACxD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,CAAE,GAAI,EAAG,IAAM,CAAC,EAC/D,EAAc,MAAM,EAAgB,CAAC,EAEzC,IAAK,IAAI,EAAI,EAAG,GAAK,EAAc,IAAK,CACtC,EAAQ,GAAK,EACb,IAAK,IAAI,EAAI,EAAG,GAAK,EAAe,IAAK,CACvC,IAAM,EAAO,EAAO,EAAI,KAAO,EAAQ,EAAI,GAAK,EAAI,EAEpD,EAAQ,GAAK,KAAK,IAChB,EAAQ,EAAI,GAAK,EACjB,EAAQ,GAAK,EACb,EAAQ,EAAI,GAAK,CACnB,CACF,CAEA,CAAC,EAAS,GAAW,CAAC,EAAS,CAAO,CACxC,CAKA,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,EAAE,MAAM,CACnD"}
+{"version":3,"file":"similarity.cjs","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":"AAoBA,IAAM,EAAwB,IAE9B,SAAgB,EAAW,EAAc,EAAsB,CAC7D,GAAI,EAAK,OAAS,GAAyB,EAAK,OAAS,EACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE,EAGF,IAAM,EAAI,EAAK,YAAY,EACrB,EAAI,EAAK,YAAY,EAE3B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,MAAO,IAAE,SAAW,GAExC,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,CAAC,EAAI,CAAC,EAAG,CAAC,EACxD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,CAAE,GAAI,EAAG,IAAM,CAAC,EAC/D,EAAc,MAAM,EAAgB,CAAC,EAEzC,IAAK,IAAI,EAAI,EAAG,GAAK,EAAc,IAAK,CACtC,EAAQ,GAAK,EACb,IAAK,IAAI,EAAI,EAAG,GAAK,EAAe,IAAK,CACvC,IAAM,EAAO,EAAO,EAAI,KAAO,EAAQ,EAAI,GAAK,EAAI,EAEpD,EAAQ,GAAK,KAAK,IAChB,EAAQ,EAAI,GAAK,EACjB,EAAQ,GAAK,EACb,EAAQ,EAAI,GAAK,CACnB,CACF,CAEA,CAAC,EAAS,GAAW,CAAC,EAAS,CAAO,CACxC,CAKA,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,EAAE,MAAM,CACnD"}

package/dist/string/similarity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../src/string/similarity.ts"],"names":[],"mappings":"AAwBA,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CA2C7D"}
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../src/string/similarity.ts"],"names":[],"mappings":"AAsBA,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CA2C7D"}

package/dist/string/similarity.js

@@ -1,24 +1,23 @@
-import { ArsenalValidationError as e } from "../errors.js";
 //#region src/string/similarity.ts
-var t = 1e4;
-function n(n, r) {
-	if (n.length > t || r.length > t) throw new e(`similarity: input strings must not exceed ${t} characters to prevent excessive memory usage`);
-	let i = n.toLowerCase(), a = r.toLowerCase();
-	if (i === a) return 1;
-	if (i.length === 0) return +(a.length === 0);
-	if (a.length === 0) return 0;
-	let [o, s] = i.length < a.length ? [i, a] : [a, i], c = o.length, l = s.length, u = Array.from({ length: c + 1 }, (e, t) => t), d = Array(c + 1);
-	for (let e = 1; e <= l; e++) {
-		d[0] = e;
-		for (let t = 1; t <= c; t++) {
-			let n = s[e - 1] === o[t - 1] ? 0 : 1;
-			d[t] = Math.min(d[t - 1] + 1, u[t] + 1, u[t - 1] + n);
+var e = 1e4;
+function t(t, n) {
+	if (t.length > e || n.length > e) throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);
+	let r = t.toLowerCase(), i = n.toLowerCase();
+	if (r === i) return 1;
+	if (r.length === 0) return +(i.length === 0);
+	if (i.length === 0) return 0;
+	let [a, o] = r.length < i.length ? [r, i] : [i, r], s = a.length, c = o.length, l = Array.from({ length: s + 1 }, (e, t) => t), u = Array(s + 1);
+	for (let e = 1; e <= c; e++) {
+		u[0] = e;
+		for (let t = 1; t <= s; t++) {
+			let n = o[e - 1] === a[t - 1] ? 0 : 1;
+			u[t] = Math.min(u[t - 1] + 1, l[t] + 1, l[t - 1] + n);
 		}
-		[u, d] = [d, u];
+		[l, u] = [u, l];
 	}
-	return 1 - u[c] / Math.max(i.length, a.length);
+	return 1 - l[s] / Math.max(r.length, i.length);
 }
 //#endregion
-export { n as similarity };
+export { t as similarity };
 
 //# sourceMappingURL=similarity.js.map

package/dist/string/similarity.js.map

@@ -1 +1 @@
-{"version":3,"file":"similarity.js","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\n/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n *\n * @throws {ArsenalValidationError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new ArsenalValidationError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":";;AAsBA,IAAM,IAAwB;AAE9B,SAAgB,EAAW,GAAc,GAAsB;CAC7D,IAAI,EAAK,SAAS,KAAyB,EAAK,SAAS,GACvD,MAAM,IAAI,EACR,6CAA6C,EAAsB,8CACrE;CAGF,IAAM,IAAI,EAAK,YAAY,GACrB,IAAI,EAAK,YAAY;CAE3B,IAAI,MAAM,GAAG,OAAO;CAEpB,IAAI,EAAE,WAAW,GAAG,OAAO,IAAE,WAAW;CAExC,IAAI,EAAE,WAAW,GAAG,OAAO;CAG3B,IAAM,CAAC,GAAS,KAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GACxD,IAAgB,EAAQ,QACxB,IAAe,EAAO,QAExB,IAAU,MAAM,KAAK,EAAE,QAAQ,IAAgB,EAAE,IAAI,GAAG,MAAM,CAAC,GAC/D,IAAc,MAAM,IAAgB,CAAC;CAEzC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAc,KAAK;EACtC,EAAQ,KAAK;EACb,KAAK,IAAI,IAAI,GAAG,KAAK,GAAe,KAAK;GACvC,IAAM,IAAO,EAAO,IAAI,OAAO,EAAQ,IAAI,KAAK,IAAI;GAEpD,EAAQ,KAAK,KAAK,IAChB,EAAQ,IAAI,KAAK,GACjB,EAAQ,KAAK,GACb,EAAQ,IAAI,KAAK,CACnB;EACF;EAEA,CAAC,GAAS,KAAW,CAAC,GAAS,CAAO;CACxC;CAKA,OAAO,IAFU,EAAQ,KAEH,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACnD"}
+{"version":3,"file":"similarity.js","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":";AAoBA,IAAM,IAAwB;AAE9B,SAAgB,EAAW,GAAc,GAAsB;CAC7D,IAAI,EAAK,SAAS,KAAyB,EAAK,SAAS,GACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE;CAGF,IAAM,IAAI,EAAK,YAAY,GACrB,IAAI,EAAK,YAAY;CAE3B,IAAI,MAAM,GAAG,OAAO;CAEpB,IAAI,EAAE,WAAW,GAAG,OAAO,IAAE,WAAW;CAExC,IAAI,EAAE,WAAW,GAAG,OAAO;CAG3B,IAAM,CAAC,GAAS,KAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GACxD,IAAgB,EAAQ,QACxB,IAAe,EAAO,QAExB,IAAU,MAAM,KAAK,EAAE,QAAQ,IAAgB,EAAE,IAAI,GAAG,MAAM,CAAC,GAC/D,IAAc,MAAM,IAAgB,CAAC;CAEzC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAc,KAAK;EACtC,EAAQ,KAAK;EACb,KAAK,IAAI,IAAI,GAAG,KAAK,GAAe,KAAK;GACvC,IAAM,IAAO,EAAO,IAAI,OAAO,EAAQ,IAAI,KAAK,IAAI;GAEpD,EAAQ,KAAK,KAAK,IAChB,EAAQ,IAAI,KAAK,GACjB,EAAQ,KAAK,GACb,EAAQ,IAAI,KAAK,CACnB;EACF;EAEA,CAAC,GAAS,KAAW,CAAC,GAAS,CAAO;CACxC;CAKA,OAAO,IAFU,EAAQ,KAEH,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACnD"}

package/dist/string/truncate.cjs

@@ -1,2 +1,2 @@
-const e=require("../errors.cjs");function t(t,n=25,{completeWords:r=!1,ellipsis:i=`…`}={}){if(typeof t!=`string`)throw new e.ArsenalValidationError(`truncate: str must be a string`);if(typeof n!=`number`||!Number.isFinite(n)||n<0)throw new e.ArsenalValidationError(`truncate: limit must be a non-negative finite number`);if(t.length<=n)return t;let a=n;if(r){let e=t.substring(0,n).lastIndexOf(` `);e>0&&(a=e)}return`${t.substring(0,a).trim()}${i}`}exports.truncate=t;
+function e(e,t=25,{completeWords:n=!1,ellipsis:r=`…`}={}){if(typeof e!=`string`)throw TypeError(`truncate: str must be a string`);if(typeof t!=`number`||!Number.isFinite(t)||t<0)throw RangeError(`truncate: limit must be a non-negative finite number`);if(e.length<=t)return e;let i=t;if(n){let n=e.substring(0,t).lastIndexOf(` `);n>0&&(i=n)}return`${e.substring(0,i).trim()}${r}`}exports.truncate=e;
 //# sourceMappingURL=truncate.cjs.map

package/dist/string/truncate.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"truncate.cjs","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\nexport type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {ArsenalValidationError} If str is not a string or limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new ArsenalValidationError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new ArsenalValidationError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":"iCA4BA,SAAgB,EACd,EACA,EAAQ,GACR,CAAE,gBAAgB,GAAO,WAAW,KAAyB,CAAC,EACtD,CACR,GAAI,OAAO,GAAQ,SACjB,MAAM,IAAI,EAAA,uBAAuB,gCAAgC,EAGnE,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,EAClE,MAAM,IAAI,EAAA,uBAAuB,sDAAsD,EAGzF,GAAI,EAAI,QAAU,EAChB,OAAO,EAGT,IAAI,EAAM,EAEV,GAAI,EAAe,CACjB,IAAM,EAAU,EAAI,UAAU,EAAG,CAAK,CAAC,CAAC,YAAY,GAAG,EAEnD,EAAU,IAAG,EAAM,EACzB,CAEA,MAAO,GAAG,EAAI,UAAU,EAAG,CAAG,CAAC,CAAC,KAAK,IAAI,GAC3C"}
+{"version":3,"file":"truncate.cjs","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":"AA2BA,SAAgB,EACd,EACA,EAAQ,GACR,CAAE,gBAAgB,GAAO,WAAW,KAAyB,CAAC,EACtD,CACR,GAAI,OAAO,GAAQ,SACjB,MAAU,UAAU,gCAAgC,EAGtD,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,EAClE,MAAU,WAAW,sDAAsD,EAG7E,GAAI,EAAI,QAAU,EAChB,OAAO,EAGT,IAAI,EAAM,EAEV,GAAI,EAAe,CACjB,IAAM,EAAU,EAAI,UAAU,EAAG,CAAK,CAAC,CAAC,YAAY,GAAG,EAEnD,EAAU,IAAG,EAAM,EACzB,CAEA,MAAO,GAAG,EAAI,UAAU,EAAG,CAAG,CAAC,CAAC,KAAK,IAAI,GAC3C"}

package/dist/string/truncate.d.ts

@@ -21,7 +21,8 @@ export type TruncateOptions = {
  *
  * @returns The truncated string.
  *
- * @throws {ArsenalValidationError} If str is not a string or limit is not a non-negative finite number.
+ * @throws {TypeError} If str is not a string.
+ * @throws {RangeError} If limit is not a non-negative finite number.
  */
 export declare function truncate(str: string, limit?: number, { completeWords, ellipsis }?: TruncateOptions): string;
 //# sourceMappingURL=truncate.d.ts.map

package/dist/string/truncate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"truncate.d.ts","sourceRoot":"","sources":["../../src/string/truncate.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,eAAe,GAAG;IAC5B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CACtB,GAAG,EAAE,MAAM,EACX,KAAK,SAAK,EACV,EAAE,aAAqB,EAAE,QAAc,EAAE,GAAE,eAAoB,GAC9D,MAAM,CAsBR"}
+{"version":3,"file":"truncate.d.ts","sourceRoot":"","sources":["../../src/string/truncate.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,eAAe,GAAG;IAC5B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,QAAQ,CACtB,GAAG,EAAE,MAAM,EACX,KAAK,SAAK,EACV,EAAE,aAAqB,EAAE,QAAc,EAAE,GAAE,eAAoB,GAC9D,MAAM,CAsBR"}

package/dist/string/truncate.js

@@ -1,17 +1,16 @@
-import { ArsenalValidationError as e } from "../errors.js";
 //#region src/string/truncate.ts
-function t(t, n = 25, { completeWords: r = !1, ellipsis: i = "…" } = {}) {
-	if (typeof t != "string") throw new e("truncate: str must be a string");
-	if (typeof n != "number" || !Number.isFinite(n) || n < 0) throw new e("truncate: limit must be a non-negative finite number");
-	if (t.length <= n) return t;
-	let a = n;
-	if (r) {
-		let e = t.substring(0, n).lastIndexOf(" ");
-		e > 0 && (a = e);
+function e(e, t = 25, { completeWords: n = !1, ellipsis: r = "…" } = {}) {
+	if (typeof e != "string") throw TypeError("truncate: str must be a string");
+	if (typeof t != "number" || !Number.isFinite(t) || t < 0) throw RangeError("truncate: limit must be a non-negative finite number");
+	if (e.length <= t) return e;
+	let i = t;
+	if (n) {
+		let n = e.substring(0, t).lastIndexOf(" ");
+		n > 0 && (i = n);
 	}
-	return `${t.substring(0, a).trim()}${i}`;
+	return `${e.substring(0, i).trim()}${r}`;
 }
 //#endregion
-export { t as truncate };
+export { e as truncate };
 
 //# sourceMappingURL=truncate.js.map

package/dist/string/truncate.js.map

@@ -1 +1 @@
-{"version":3,"file":"truncate.js","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\nexport type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {ArsenalValidationError} If str is not a string or limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new ArsenalValidationError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new ArsenalValidationError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":";;AA4BA,SAAgB,EACd,GACA,IAAQ,IACR,EAAE,mBAAgB,IAAO,cAAW,QAAyB,CAAC,GACtD;CACR,IAAI,OAAO,KAAQ,UACjB,MAAM,IAAI,EAAuB,gCAAgC;CAGnE,IAAI,OAAO,KAAU,YAAY,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,GAClE,MAAM,IAAI,EAAuB,sDAAsD;CAGzF,IAAI,EAAI,UAAU,GAChB,OAAO;CAGT,IAAI,IAAM;CAEV,IAAI,GAAe;EACjB,IAAM,IAAU,EAAI,UAAU,GAAG,CAAK,CAAC,CAAC,YAAY,GAAG;EAEvD,AAAI,IAAU,MAAG,IAAM;CACzB;CAEA,OAAO,GAAG,EAAI,UAAU,GAAG,CAAG,CAAC,CAAC,KAAK,IAAI;AAC3C"}
+{"version":3,"file":"truncate.js","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":";AA2BA,SAAgB,EACd,GACA,IAAQ,IACR,EAAE,mBAAgB,IAAO,cAAW,QAAyB,CAAC,GACtD;CACR,IAAI,OAAO,KAAQ,UACjB,MAAU,UAAU,gCAAgC;CAGtD,IAAI,OAAO,KAAU,YAAY,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,GAClE,MAAU,WAAW,sDAAsD;CAG7E,IAAI,EAAI,UAAU,GAChB,OAAO;CAGT,IAAI,IAAM;CAEV,IAAI,GAAe;EACjB,IAAM,IAAU,EAAI,UAAU,GAAG,CAAK,CAAC,CAAC,YAAY,GAAG;EAEvD,AAAI,IAAU,MAAG,IAAM;CACzB;CAEA,OAAO,GAAG,EAAI,UAAU,GAAG,CAAG,CAAC,CAAC,KAAK,IAAI;AAC3C"}

package/dist/types.d.ts

@@ -1,6 +1,6 @@
 /** A function that tears down a subscription or listener registration. */
 export type Unsubscribe = () => void;
-export type Fn<Args extends unknown[] = unknown[], Result = unknown> = (...args: Args) => Result;
+export type Fn<Args extends unknown[] = never[], Result = unknown> = (...args: Args) => Result;
 export type Obj = Record<string, unknown>;
 /**
  * A predicate that takes a single value and returns a boolean.

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAErC,MAAM,MAAM,EAAE,CAAC,IAAI,SAAS,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE,MAAM,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC;AAEjG,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1C;;;;GAIG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;AAEjD,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE/C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAErC,MAAM,MAAM,EAAE,CAAC,IAAI,SAAS,OAAO,EAAE,GAAG,KAAK,EAAE,EAAE,MAAM,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC;AAE/F,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1C;;;;GAIG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;AAEjD,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE/C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vielzeug/arsenal",
-  "version": "1.1.1",
+  "version": "2.0.0",
   "description": "Tree-shakeable TypeScript utility library — array, object, string, async, cache, math, and more",
   "type": "module",
   "files": [
@@ -41,18 +41,18 @@
       "import": "./dist/function/index.js",
       "require": "./dist/function/index.cjs"
     },
-    "./math": {
-      "source": "./src/math/index.ts",
-      "types": "./dist/math/index.d.ts",
-      "import": "./dist/math/index.js",
-      "require": "./dist/math/index.cjs"
-    },
     "./guards": {
       "source": "./src/guards/index.ts",
       "types": "./dist/guards/index.d.ts",
       "import": "./dist/guards/index.js",
       "require": "./dist/guards/index.cjs"
     },
+    "./math": {
+      "source": "./src/math/index.ts",
+      "types": "./dist/math/index.d.ts",
+      "import": "./dist/math/index.js",
+      "require": "./dist/math/index.cjs"
+    },
     "./object": {
       "source": "./src/object/index.ts",
       "types": "./dist/object/index.d.ts",
@@ -70,12 +70,6 @@
       "types": "./dist/string/index.d.ts",
       "import": "./dist/string/index.js",
       "require": "./dist/string/index.cjs"
-    },
-    "./typed": {
-      "source": "./src/typed/index.ts",
-      "types": "./dist/typed/index.d.ts",
-      "import": "./dist/typed/index.js",
-      "require": "./dist/typed/index.cjs"
     }
   },
   "scripts": {
@@ -86,7 +80,8 @@
     "prepublishOnly": "pnpm run build",
     "preview": "vite preview",
     "test": "pnpm run verify:exports && vitest",
-    "verify:exports": "node ./scripts/generate-barrels.mjs --check",
+    "sync:exports": "node ./scripts/sync-exports.mjs",
+    "verify:exports": "node ./scripts/sync-exports.mjs --check",
     "build:bundle": "vite build --config vite.bundle.config.ts"
   },
   "publishConfig": {
@@ -94,12 +89,12 @@
     "registry": "https://registry.npmjs.org/"
   },
   "engines": {
-    "node": ">=18"
+    "node": ">=22"
   },
   "devDependencies": {
-    "@types/node": "^26.1.0",
-    "typescript": "~6.0.3",
-    "vite": "^8.1.3",
-    "vitest": "^4.1.9"
+    "@types/node": "^26.1.2",
+    "typescript": "^6.0.3",
+    "vite": "^8.2.0",
+    "vitest": "^4.1.10"
   }
 }

package/dist/_common/_secureRandomIndex.cjs

@@ -1,2 +0,0 @@
-function e(e){let t=crypto.getRandomValues(new Uint32Array(1))[0]/4294967296;return Math.floor(t*e)}exports.secureRandomIndex=e;
-//# sourceMappingURL=_secureRandomIndex.cjs.map

package/dist/_common/_secureRandomIndex.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"_secureRandomIndex.cjs","names":[],"sources":["../../src/_common/_secureRandomIndex.ts"],"sourcesContent":["/**\n * Returns a cryptographically random integer in `[0, exclusiveMax)` via `crypto.getRandomValues`.\n * Shared by `random()`, `shuffle()`, and `drawMany()` — the single source of truth for converting\n * a random `Uint32` into a bounded index.\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n * @internal\n */\nexport function secureRandomIndex(exclusiveMax: number): number {\n  // Divide by 0x100000000 (not 0xffffffff) to produce [0, 1) instead of [0, 1]\n  const randomValue = crypto.getRandomValues(new Uint32Array(1))[0]! / 0x100000000;\n\n  return Math.floor(randomValue * exclusiveMax);\n}\n"],"mappings":"AAQA,SAAgB,EAAkB,EAA8B,CAE9D,IAAM,EAAc,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,GAAM,WAErE,OAAO,KAAK,MAAM,EAAc,CAAY,CAC9C"}

package/dist/_common/_secureRandomIndex.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=_secureRandomIndex.d.ts.map

package/dist/_common/_secureRandomIndex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"_secureRandomIndex.d.ts","sourceRoot":"","sources":["../../src/_common/_secureRandomIndex.ts"],"names":[],"mappings":""}

package/dist/_common/_secureRandomIndex.js

@@ -1,9 +0,0 @@
-//#region src/_common/_secureRandomIndex.ts
-function e(e) {
-	let t = crypto.getRandomValues(/* @__PURE__ */ new Uint32Array(1))[0] / 4294967296;
-	return Math.floor(t * e);
-}
-//#endregion
-export { e as secureRandomIndex };
-
-//# sourceMappingURL=_secureRandomIndex.js.map