@vielzeug/arsenal 1.0.1

package/README.md

@@ -0,0 +1,104 @@
+# @vielzeug/arsenal
+
+> Tree-shakeable, zero-dependency utility library for arrays, async control flow, objects, strings, functions, math, random, and typed checks.
+
+[![npm version](https://img.shields.io/npm/v/@vielzeug/arsenal)](https://www.npmjs.com/package/@vielzeug/arsenal) [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+<details>
+<summary>Quick Reference</summary>
+
+**Package:** `@vielzeug/arsenal` &nbsp;·&nbsp; **Category:** Utilities
+
+**Key exports:** `chunk`, `debounce`, `throttle`, `allOf`, `clamp`, `isEqual`, `retry`, `sleep`, `stringify`, `fuzzy`, `getPath`, `deepMerge`, `diff`, `stash`, `memo`
+
+**When to use:** Tree-shakeable, zero-dependency utility library for arrays, async control flow, objects, strings, functions, math, random, and typed checks.
+
+**Related:** [`@vielzeug/coins`](https://www.npmjs.com/package/@vielzeug/coins) · [`@vielzeug/tempo`](https://www.npmjs.com/package/@vielzeug/tempo)
+
+</details>
+
+`@vielzeug/arsenal` is part of Vielzeug and ships as a zero-dependency TypeScript package with ESM+CJS output.
+
+## Installation
+
+```sh
+pnpm add @vielzeug/arsenal
+npm install @vielzeug/arsenal
+yarn add @vielzeug/arsenal
+```
+
+## Quick Start
+
+```ts
+import {
+  allOf,
+  chunk,
+  deepMerge,
+  diff,
+  filterMap,
+  fuzzy,
+  groupBy,
+  noneOf,
+  partial,
+  pick,
+  queue,
+  retry,
+  stringify,
+} from '@vielzeug/arsenal';
+
+const users = [
+  { id: 1, name: 'Alice', role: 'admin' },
+  { id: 2, name: 'Bob', role: 'user' },
+];
+const pages = chunk([1, 2, 3, 4, 5], 2);
+const byRole = groupBy(users, (u) => u.role);
+const safe = pick(users[0], ['id', 'name']);
+
+const q = queue({ concurrency: 2 });
+await q.add(() => fetch('/api/a'));
+
+const data = await retry(() => fetch('/api/health').then((r) => r.json()), {
+  times: 3,
+  delay: 200,
+});
+
+const doubleAll = partial((factor: number, values: number[]) => values.map((n) => n * factor), 2);
+const doubled = filterMap(doubleAll([1, 2, 3]), (n) => (n > 2 ? n : undefined));
+
+// Compose predicates — allOf / anyOf / noneOf
+const isWorkingAge = allOf<number>(
+  (age) => age >= 18,
+  (age) => age < 65,
+);
+const evens = [1, 2, 3, 4].filter(noneOf((n: number) => n % 2 !== 0));
+
+// Fuzzy search — filter mode or scored mode
+const filtered = fuzzy(users, 'alice');                      // User[]
+const ranked = fuzzy(users, 'alice', { scored: true });      // ScoredResult<User>[]
+// [{ item: { name: 'Alice', ... }, score: 0.91 }, ...]
+
+// Deep merge with optional array strategy
+deepMerge({ a: { x: 1 } }, { a: { y: 2 } });                // { a: { x: 1, y: 2 } }
+deepMerge({ tags: ['a'] }, { tags: ['b'] }, { arrayStrategy: 'concat' }); // { tags: ['a', 'b'] }
+
+// Structured object diff
+diff({ port: 3000, host: 'localhost' }, { port: 4000 });
+// { added: [], removed: ['host'], changed: { port: { before: 3000, after: 4000 } } }
+
+// Deterministic cache keys
+const key = stringify({ sort: 'asc', filter: { role: 'admin' } });
+```
+
+> **Money utilities** (`currency`, `exchange`) have moved to [`@vielzeug/coins`](https://www.npmjs.com/package/@vielzeug/coins).
+> **Date utilities** (`expires`, `timeDiff`, `dateRange`) are available in [`@vielzeug/tempo`](https://www.npmjs.com/package/@vielzeug/tempo).
+
+## Documentation
+
+- [Overview](https://vielzeug.dev/arsenal/)
+- [Usage Guide](https://vielzeug.dev/arsenal/usage)
+- [API Reference](https://vielzeug.dev/arsenal/api)
+- [Examples](https://vielzeug.dev/arsenal/examples)
+
+## License
+
+MIT © [Helmuth Saatkamp](https://github.com/helmuthdu) — part of the [Vielzeug](https://github.com/helmuthdu/vielzeug) monorepo.

package/dist/_common/_abortable.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Makes any promise abort-aware via AbortSignal.
+ */
+export declare function abortable<T>(promise: Promise<T>, signal: AbortSignal): Promise<T>;
+//# sourceMappingURL=_abortable.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"_abortable.d.ts","sourceRoot":"","sources":["../../src/_common/_abortable.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAejF"}

package/dist/_common/_lruMap.cjs

@@ -0,0 +1,2 @@
+var e=class extends Map{maxSize;constructor(e){super(),this.maxSize=e}set(e,t){return this.has(e)&&this.delete(e),super.set(e,t),this.size>this.maxSize&&this.evictOldest(),this}evictOldest(e=()=>!0){for(let[t,n]of this)if(e(t,n))return this.delete(t),!0;return!1}};exports.LruMap=e;
+//# sourceMappingURL=_lruMap.cjs.map

package/dist/_common/_lruMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_lruMap.cjs","names":[],"sources":["../../src/_common/_lruMap.ts"],"sourcesContent":["/**\n * A Map subclass that evicts the oldest non-excluded entry when the map exceeds\n * `maxSize`. Iteration order (insertion order) determines LRU — the first key\n * returned by `keys()` is the oldest.\n *\n * Calling `set` on an existing key refreshes its position (move-to-end).\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n */\nexport class LruMap<K, V> extends Map<K, V> {\n  readonly maxSize: number;\n\n  constructor(maxSize: number) {\n    super();\n    this.maxSize = maxSize;\n  }\n\n  override set(key: K, value: V): this {\n    // Move existing entry to the end (most-recently-used position)\n    if (this.has(key)) this.delete(key);\n\n    super.set(key, value);\n\n    // Evict oldest entry if we've exceeded maxSize\n    if (this.size > this.maxSize) this.evictOldest();\n\n    return this;\n  }\n\n  /**\n   * Evicts the oldest entry for which `canEvict` returns true.\n   * Returns `true` if an entry was evicted, `false` if all entries are guarded.\n   */\n  evictOldest(canEvict: (key: K, value: V) => boolean = () => true): boolean {\n    for (const [k, v] of this) {\n      if (canEvict(k, v)) {\n        this.delete(k);\n\n        return true;\n      }\n    }\n\n    return false;\n  }\n}\n"],"mappings":"AASA,IAAa,EAAb,cAAkC,GAAU,CAC1C,QAEA,YAAY,EAAiB,CAC3B,MAAM,EACN,KAAK,QAAU,CACjB,CAEA,IAAa,EAAQ,EAAgB,CASnC,OAPI,KAAK,IAAI,CAAG,GAAG,KAAK,OAAO,CAAG,EAElC,MAAM,IAAI,EAAK,CAAK,EAGhB,KAAK,KAAO,KAAK,SAAS,KAAK,YAAY,EAExC,IACT,CAMA,YAAY,MAAgD,GAAe,CACzE,IAAK,GAAM,CAAC,EAAG,KAAM,KACnB,GAAI,EAAS,EAAG,CAAC,EAGf,OAFA,KAAK,OAAO,CAAC,EAEN,GAIX,MAAO,EACT,CACF"}

package/dist/_common/_lruMap.d.ts

@@ -0,0 +1,20 @@
+/**
+ * A Map subclass that evicts the oldest non-excluded entry when the map exceeds
+ * `maxSize`. Iteration order (insertion order) determines LRU — the first key
+ * returned by `keys()` is the oldest.
+ *
+ * Calling `set` on an existing key refreshes its position (move-to-end).
+ *
+ * Module-private: underscore-prefixed file is excluded from barrel exports.
+ */
+export declare class LruMap<K, V> extends Map<K, V> {
+    readonly maxSize: number;
+    constructor(maxSize: number);
+    set(key: K, value: V): this;
+    /**
+     * Evicts the oldest entry for which `canEvict` returns true.
+     * Returns `true` if an entry was evicted, `false` if all entries are guarded.
+     */
+    evictOldest(canEvict?: (key: K, value: V) => boolean): boolean;
+}
+//# sourceMappingURL=_lruMap.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"_lruMap.d.ts","sourceRoot":"","sources":["../../src/_common/_lruMap.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;gBAEb,OAAO,EAAE,MAAM;IAKlB,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAYpC;;;OAGG;IACH,WAAW,CAAC,QAAQ,GAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAoB,GAAG,OAAO;CAW3E"}

package/dist/_common/_lruMap.js

@@ -0,0 +1,18 @@
+//#region src/_common/_lruMap.ts
+var e = class extends Map {
+	maxSize;
+	constructor(e) {
+		super(), this.maxSize = e;
+	}
+	set(e, t) {
+		return this.has(e) && this.delete(e), super.set(e, t), this.size > this.maxSize && this.evictOldest(), this;
+	}
+	evictOldest(e = () => !0) {
+		for (let [t, n] of this) if (e(t, n)) return this.delete(t), !0;
+		return !1;
+	}
+};
+//#endregion
+export { e as LruMap };
+
+//# sourceMappingURL=_lruMap.js.map

package/dist/_common/_lruMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_lruMap.js","names":[],"sources":["../../src/_common/_lruMap.ts"],"sourcesContent":["/**\n * A Map subclass that evicts the oldest non-excluded entry when the map exceeds\n * `maxSize`. Iteration order (insertion order) determines LRU — the first key\n * returned by `keys()` is the oldest.\n *\n * Calling `set` on an existing key refreshes its position (move-to-end).\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n */\nexport class LruMap<K, V> extends Map<K, V> {\n  readonly maxSize: number;\n\n  constructor(maxSize: number) {\n    super();\n    this.maxSize = maxSize;\n  }\n\n  override set(key: K, value: V): this {\n    // Move existing entry to the end (most-recently-used position)\n    if (this.has(key)) this.delete(key);\n\n    super.set(key, value);\n\n    // Evict oldest entry if we've exceeded maxSize\n    if (this.size > this.maxSize) this.evictOldest();\n\n    return this;\n  }\n\n  /**\n   * Evicts the oldest entry for which `canEvict` returns true.\n   * Returns `true` if an entry was evicted, `false` if all entries are guarded.\n   */\n  evictOldest(canEvict: (key: K, value: V) => boolean = () => true): boolean {\n    for (const [k, v] of this) {\n      if (canEvict(k, v)) {\n        this.delete(k);\n\n        return true;\n      }\n    }\n\n    return false;\n  }\n}\n"],"mappings":";AASA,IAAa,IAAb,cAAkC,IAAU;CAC1C;CAEA,YAAY,GAAiB;EAE3B,AADA,MAAM,GACN,KAAK,UAAU;CACjB;CAEA,IAAa,GAAQ,GAAgB;EASnC,OAPI,KAAK,IAAI,CAAG,KAAG,KAAK,OAAO,CAAG,GAElC,MAAM,IAAI,GAAK,CAAK,GAGhB,KAAK,OAAO,KAAK,WAAS,KAAK,YAAY,GAExC;CACT;CAMA,YAAY,UAAgD,IAAe;EACzE,KAAK,IAAM,CAAC,GAAG,MAAM,MACnB,IAAI,EAAS,GAAG,CAAC,GAGf,OAFA,KAAK,OAAO,CAAC,GAEN;EAIX,OAAO;CACT;AACF"}

package/dist/_common/_secureRandomIndex.cjs

@@ -0,0 +1,2 @@
+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

@@ -0,0 +1 @@
+{"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

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

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

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

package/dist/_common/_secureRandomIndex.js

@@ -0,0 +1,9 @@
+//#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

package/dist/_common/_secureRandomIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_secureRandomIndex.js","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,GAA8B;CAE9D,IAAM,IAAc,OAAO,gCAAgB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,KAAM;CAErE,OAAO,KAAK,MAAM,IAAc,CAAY;AAC9C"}

package/dist/_common/_selectorSet.cjs

@@ -0,0 +1,2 @@
+function e(e,t){return new Set(e.map(e=>t(e)))}function t(e,t){let n=new Set,r=[];for(let i of e){let e=t(i);n.has(e)||(n.add(e),r.push(i))}return r}exports.dedupeBySelector=t,exports.toSelectorSet=e;
+//# sourceMappingURL=_selectorSet.cjs.map

package/dist/_common/_selectorSet.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_selectorSet.cjs","names":[],"sources":["../../src/_common/_selectorSet.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\n/**\n * Builds a `Set` of `selector(item)` results for O(1) membership checks — shared by\n * `intersection()` and `difference()`.\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n * @internal\n */\nexport function toSelectorSet<T>(items: readonly T[], selector: (item: T) => Primitive): Set<Primitive> {\n  return new Set(items.map((item) => selector(item)));\n}\n\n/**\n * Returns `items` with duplicate `selector(item)` results removed, preserving the first\n * occurrence of each key — shared by `union()` and `uniq()`.\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n * @internal\n */\nexport function dedupeBySelector<T>(items: readonly T[], selector: (item: T) => Primitive): T[] {\n  const seen = new Set<Primitive>();\n  const out: T[] = [];\n\n  for (const item of items) {\n    const key = selector(item);\n\n    if (seen.has(key)) continue;\n\n    seen.add(key);\n    out.push(item);\n  }\n\n  return out;\n}\n"],"mappings":"AASA,SAAgB,EAAiB,EAAqB,EAAkD,CACtG,OAAO,IAAI,IAAI,EAAM,IAAK,GAAS,EAAS,CAAI,CAAC,CAAC,CACpD,CASA,SAAgB,EAAoB,EAAqB,EAAuC,CAC9F,IAAM,EAAO,IAAI,IACX,EAAW,CAAC,EAElB,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAM,EAAS,CAAI,EAErB,EAAK,IAAI,CAAG,IAEhB,EAAK,IAAI,CAAG,EACZ,EAAI,KAAK,CAAI,EACf,CAEA,OAAO,CACT"}

package/dist/_common/_selectorSet.d.ts

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

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

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

package/dist/_common/_selectorSet.js

@@ -0,0 +1,16 @@
+//#region src/_common/_selectorSet.ts
+function e(e, t) {
+	return new Set(e.map((e) => t(e)));
+}
+function t(e, t) {
+	let n = /* @__PURE__ */ new Set(), r = [];
+	for (let i of e) {
+		let e = t(i);
+		n.has(e) || (n.add(e), r.push(i));
+	}
+	return r;
+}
+//#endregion
+export { t as dedupeBySelector, e as toSelectorSet };
+
+//# sourceMappingURL=_selectorSet.js.map

package/dist/_common/_selectorSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_selectorSet.js","names":[],"sources":["../../src/_common/_selectorSet.ts"],"sourcesContent":["import type { Primitive } from '../types';\n\n/**\n * Builds a `Set` of `selector(item)` results for O(1) membership checks — shared by\n * `intersection()` and `difference()`.\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n * @internal\n */\nexport function toSelectorSet<T>(items: readonly T[], selector: (item: T) => Primitive): Set<Primitive> {\n  return new Set(items.map((item) => selector(item)));\n}\n\n/**\n * Returns `items` with duplicate `selector(item)` results removed, preserving the first\n * occurrence of each key — shared by `union()` and `uniq()`.\n *\n * Module-private: underscore-prefixed file is excluded from barrel exports.\n * @internal\n */\nexport function dedupeBySelector<T>(items: readonly T[], selector: (item: T) => Primitive): T[] {\n  const seen = new Set<Primitive>();\n  const out: T[] = [];\n\n  for (const item of items) {\n    const key = selector(item);\n\n    if (seen.has(key)) continue;\n\n    seen.add(key);\n    out.push(item);\n  }\n\n  return out;\n}\n"],"mappings":";AASA,SAAgB,EAAiB,GAAqB,GAAkD;CACtG,OAAO,IAAI,IAAI,EAAM,KAAK,MAAS,EAAS,CAAI,CAAC,CAAC;AACpD;AASA,SAAgB,EAAoB,GAAqB,GAAuC;CAC9F,IAAM,oBAAO,IAAI,IAAe,GAC1B,IAAW,CAAC;CAElB,KAAK,IAAM,KAAQ,GAAO;EACxB,IAAM,IAAM,EAAS,CAAI;EAErB,EAAK,IAAI,CAAG,MAEhB,EAAK,IAAI,CAAG,GACZ,EAAI,KAAK,CAAI;CACf;CAEA,OAAO;AACT"}

package/dist/_common/unsafePaths.cjs

@@ -0,0 +1,2 @@
+var e=new Set([`__proto__`,`constructor`,`prototype`]);function t(t){return typeof t==`string`&&e.has(t)}exports.UNSAFE_PATH_SEGMENTS=e,exports.isUnsafeKey=t;
+//# sourceMappingURL=unsafePaths.cjs.map

package/dist/_common/unsafePaths.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"unsafePaths.cjs","names":[],"sources":["../../src/_common/unsafePaths.ts"],"sourcesContent":["/**\n * Path segments that must be rejected in any dot-notation traversal or mutation\n * to prevent prototype pollution reads and writes.\n * @internal\n */\nexport const UNSAFE_PATH_SEGMENTS = new Set(['__proto__', 'constructor', 'prototype']);\n\n/**\n * Returns `true` if every dot-notation segment in `key` is safe to use as a\n * plain-object property.\n *\n * @example\n * ```ts\n * isSafePath('user.name')           // true\n * isSafePath('__proto__.polluted')  // false\n * ```\n */\nexport function isSafePath(key: string): boolean {\n  return key.split('.').every((s) => !UNSAFE_PATH_SEGMENTS.has(s));\n}\n\n/**\n * Returns `true` if `key` is one of the dangerous own-property names that can be used to\n * pollute `Object.prototype` (`__proto__`, `constructor`, `prototype`). Use this for plain\n * (non-dotted) property keys — e.g. object keys being copied or reassigned. For dotted paths,\n * use `isSafePath` instead.\n *\n * @example\n * ```ts\n * isUnsafeKey('name')        // false\n * isUnsafeKey('__proto__')   // true\n * ```\n */\nexport function isUnsafeKey(key: PropertyKey): boolean {\n  return typeof key === 'string' && UNSAFE_PATH_SEGMENTS.has(key);\n}\n"],"mappings":"AAKA,IAAa,EAAuB,IAAI,IAAI,CAAC,YAAa,cAAe,WAAW,CAAC,EA4BrF,SAAgB,EAAY,EAA2B,CACrD,OAAO,OAAO,GAAQ,UAAY,EAAqB,IAAI,CAAG,CAChE"}

package/dist/_common/unsafePaths.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Returns `true` if every dot-notation segment in `key` is safe to use as a
+ * plain-object property.
+ *
+ * @example
+ * ```ts
+ * isSafePath('user.name')           // true
+ * isSafePath('__proto__.polluted')  // false
+ * ```
+ */
+export declare function isSafePath(key: string): boolean;
+/**
+ * Returns `true` if `key` is one of the dangerous own-property names that can be used to
+ * pollute `Object.prototype` (`__proto__`, `constructor`, `prototype`). Use this for plain
+ * (non-dotted) property keys — e.g. object keys being copied or reassigned. For dotted paths,
+ * use `isSafePath` instead.
+ *
+ * @example
+ * ```ts
+ * isUnsafeKey('name')        // false
+ * isUnsafeKey('__proto__')   // true
+ * ```
+ */
+export declare function isUnsafeKey(key: PropertyKey): boolean;
+//# sourceMappingURL=unsafePaths.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"unsafePaths.d.ts","sourceRoot":"","sources":["../../src/_common/unsafePaths.ts"],"names":[],"mappings":"AAOA;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAE/C;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAErD"}

package/dist/_common/unsafePaths.js

@@ -0,0 +1,13 @@
+//#region src/_common/unsafePaths.ts
+var e = /* @__PURE__ */ new Set([
+	"__proto__",
+	"constructor",
+	"prototype"
+]);
+function t(t) {
+	return typeof t == "string" && e.has(t);
+}
+//#endregion
+export { e as UNSAFE_PATH_SEGMENTS, t as isUnsafeKey };
+
+//# sourceMappingURL=unsafePaths.js.map

package/dist/_common/unsafePaths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unsafePaths.js","names":[],"sources":["../../src/_common/unsafePaths.ts"],"sourcesContent":["/**\n * Path segments that must be rejected in any dot-notation traversal or mutation\n * to prevent prototype pollution reads and writes.\n * @internal\n */\nexport const UNSAFE_PATH_SEGMENTS = new Set(['__proto__', 'constructor', 'prototype']);\n\n/**\n * Returns `true` if every dot-notation segment in `key` is safe to use as a\n * plain-object property.\n *\n * @example\n * ```ts\n * isSafePath('user.name')           // true\n * isSafePath('__proto__.polluted')  // false\n * ```\n */\nexport function isSafePath(key: string): boolean {\n  return key.split('.').every((s) => !UNSAFE_PATH_SEGMENTS.has(s));\n}\n\n/**\n * Returns `true` if `key` is one of the dangerous own-property names that can be used to\n * pollute `Object.prototype` (`__proto__`, `constructor`, `prototype`). Use this for plain\n * (non-dotted) property keys — e.g. object keys being copied or reassigned. For dotted paths,\n * use `isSafePath` instead.\n *\n * @example\n * ```ts\n * isUnsafeKey('name')        // false\n * isUnsafeKey('__proto__')   // true\n * ```\n */\nexport function isUnsafeKey(key: PropertyKey): boolean {\n  return typeof key === 'string' && UNSAFE_PATH_SEGMENTS.has(key);\n}\n"],"mappings":";AAKA,IAAa,oBAAuB,IAAI,IAAI;CAAC;CAAa;CAAe;AAAW,CAAC;AA4BrF,SAAgB,EAAY,GAA2B;CACrD,OAAO,OAAO,KAAQ,YAAY,EAAqB,IAAI,CAAG;AAChE"}

package/dist/_dev.cjs

@@ -0,0 +1,2 @@
+var e=!globalThis.__ARSENAL_PROD__;function t(t){e&&console.warn(`[@vielzeug/arsenal] ${t}`)}exports.warn=t;
+//# sourceMappingURL=_dev.cjs.map

package/dist/_dev.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_dev.cjs","names":[],"sources":["../src/_dev.ts"],"sourcesContent":["const isDev = !(globalThis as { __ARSENAL_PROD__?: boolean }).__ARSENAL_PROD__;\n\n/** @internal @security Messages may include user data. */\nexport function warn(msg: string): void {\n  if (isDev) console.warn(`[@vielzeug/arsenal] ${msg}`);\n}\n"],"mappings":"AAAA,IAAM,EAAQ,CAAE,WAA8C,iBAG9D,SAAgB,EAAK,EAAmB,CAClC,GAAO,QAAQ,KAAK,uBAAuB,GAAK,CACtD"}

package/dist/_dev.d.ts

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

package/dist/_dev.d.ts.map

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

package/dist/_dev.js

@@ -0,0 +1,9 @@
+//#region src/_dev.ts
+var e = !globalThis.__ARSENAL_PROD__;
+function t(t) {
+	e && console.warn(`[@vielzeug/arsenal] ${t}`);
+}
+//#endregion
+export { t as warn };
+
+//# sourceMappingURL=_dev.js.map

package/dist/_dev.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_dev.js","names":[],"sources":["../src/_dev.ts"],"sourcesContent":["const isDev = !(globalThis as { __ARSENAL_PROD__?: boolean }).__ARSENAL_PROD__;\n\n/** @internal @security Messages may include user data. */\nexport function warn(msg: string): void {\n  if (isDev) console.warn(`[@vielzeug/arsenal] ${msg}`);\n}\n"],"mappings":";AAAA,IAAM,IAAQ,CAAE,WAA8C;AAG9D,SAAgB,EAAK,GAAmB;CACtC,AAAI,KAAO,QAAQ,KAAK,uBAAuB,GAAK;AACtD"}

package/dist/array/chunk.cjs

@@ -0,0 +1,2 @@
+const e=require("../errors.cjs"),t=require("../guards/isString.cjs");function n(n,r=2){if(!Array.isArray(n)&&!t.isString(n))throw new e.ArsenalValidationError(`chunk: argument must be an array or string`);if(r<1)throw new e.ArsenalValidationError(`chunk: size must be at least 1`);return Array.from({length:Math.ceil(n.length/r)},(e,t)=>n.slice(t*r,t*r+r))}exports.chunk=n;
+//# sourceMappingURL=chunk.cjs.map

package/dist/array/chunk.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.cjs","names":[],"sources":["../../src/array/chunk.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { isString } from '../guards/isString';\n\n/**\n * Splits an array or string into chunks of a specified size.\n *\n * @example\n * ```ts\n * chunk([1, 2, 3, 4, 5], 2) // [[1, 2], [3, 4], [5]]\n * chunk('hello', 2) // ['he', 'll', 'o']\n * ```\n *\n * @param input - The input array or string to be chunked.\n * @param size - The size of each chunk (default 2).\n *\n * @returns An array of chunks.\n *\n * @throws {ArsenalValidationError} If the input is not an array or string, or if the chunk size is less than 1.\n */\nexport function chunk(input: string, size?: number): string[];\nexport function chunk<T>(input: T[], size?: number): T[][];\nexport function chunk<T>(input: T[] | string, size = 2): string[] | T[][] {\n  if (!Array.isArray(input) && !isString(input))\n    throw new ArsenalValidationError('chunk: argument must be an array or string');\n\n  if (size < 1) throw new ArsenalValidationError('chunk: size must be at least 1');\n\n  return Array.from({ length: Math.ceil(input.length / size) }, (_, i) => input.slice(i * size, i * size + size)) as\n    string[] | T[][];\n}\n"],"mappings":"qEAqBA,SAAgB,EAAS,EAAqB,EAAO,EAAqB,CACxE,GAAI,CAAC,MAAM,QAAQ,CAAK,GAAK,CAAC,EAAA,SAAS,CAAK,EAC1C,MAAM,IAAI,EAAA,uBAAuB,4CAA4C,EAE/E,GAAI,EAAO,EAAG,MAAM,IAAI,EAAA,uBAAuB,gCAAgC,EAE/E,OAAO,MAAM,KAAK,CAAE,OAAQ,KAAK,KAAK,EAAM,OAAS,CAAI,CAAE,GAAI,EAAG,IAAM,EAAM,MAAM,EAAI,EAAM,EAAI,EAAO,CAAI,CAAC,CAEhH"}

package/dist/array/chunk.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Splits an array or string into chunks of a specified size.
+ *
+ * @example
+ * ```ts
+ * chunk([1, 2, 3, 4, 5], 2) // [[1, 2], [3, 4], [5]]
+ * chunk('hello', 2) // ['he', 'll', 'o']
+ * ```
+ *
+ * @param input - The input array or string to be chunked.
+ * @param size - The size of each chunk (default 2).
+ *
+ * @returns An array of chunks.
+ *
+ * @throws {ArsenalValidationError} If the input is not an array or string, or if the chunk size is less than 1.
+ */
+export declare function chunk(input: string, size?: number): string[];
+export declare function chunk<T>(input: T[], size?: number): T[][];
+//# sourceMappingURL=chunk.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.d.ts","sourceRoot":"","sources":["../../src/array/chunk.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;AAC9D,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC"}

package/dist/array/chunk.js

@@ -0,0 +1,12 @@
+import { ArsenalValidationError as e } from "../errors.js";
+import { isString as t } from "../guards/isString.js";
+//#region src/array/chunk.ts
+function n(n, r = 2) {
+	if (!Array.isArray(n) && !t(n)) throw new e("chunk: argument must be an array or string");
+	if (r < 1) throw new e("chunk: size must be at least 1");
+	return Array.from({ length: Math.ceil(n.length / r) }, (e, t) => n.slice(t * r, t * r + r));
+}
+//#endregion
+export { n as chunk };
+
+//# sourceMappingURL=chunk.js.map

package/dist/array/chunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.js","names":[],"sources":["../../src/array/chunk.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\nimport { isString } from '../guards/isString';\n\n/**\n * Splits an array or string into chunks of a specified size.\n *\n * @example\n * ```ts\n * chunk([1, 2, 3, 4, 5], 2) // [[1, 2], [3, 4], [5]]\n * chunk('hello', 2) // ['he', 'll', 'o']\n * ```\n *\n * @param input - The input array or string to be chunked.\n * @param size - The size of each chunk (default 2).\n *\n * @returns An array of chunks.\n *\n * @throws {ArsenalValidationError} If the input is not an array or string, or if the chunk size is less than 1.\n */\nexport function chunk(input: string, size?: number): string[];\nexport function chunk<T>(input: T[], size?: number): T[][];\nexport function chunk<T>(input: T[] | string, size = 2): string[] | T[][] {\n  if (!Array.isArray(input) && !isString(input))\n    throw new ArsenalValidationError('chunk: argument must be an array or string');\n\n  if (size < 1) throw new ArsenalValidationError('chunk: size must be at least 1');\n\n  return Array.from({ length: Math.ceil(input.length / size) }, (_, i) => input.slice(i * size, i * size + size)) as\n    string[] | T[][];\n}\n"],"mappings":";;;AAqBA,SAAgB,EAAS,GAAqB,IAAO,GAAqB;CACxE,IAAI,CAAC,MAAM,QAAQ,CAAK,KAAK,CAAC,EAAS,CAAK,GAC1C,MAAM,IAAI,EAAuB,4CAA4C;CAE/E,IAAI,IAAO,GAAG,MAAM,IAAI,EAAuB,gCAAgC;CAE/E,OAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,EAAM,SAAS,CAAI,EAAE,IAAI,GAAG,MAAM,EAAM,MAAM,IAAI,GAAM,IAAI,IAAO,CAAI,CAAC;AAEhH"}

package/dist/array/compact.cjs

@@ -0,0 +1,2 @@
+function e(e){return e.filter(Boolean)}exports.compact=e;
+//# sourceMappingURL=compact.cjs.map

package/dist/array/compact.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compact.cjs","names":[],"sources":["../../src/array/compact.ts"],"sourcesContent":["type Falsy = false | '' | 0 | 0n | null | undefined;\n\n/**\n * Creates a new array with all falsy values removed.\n */\nexport function compact<T>(array: T[]): Array<Exclude<T, Falsy>> {\n  return array.filter(Boolean) as Array<Exclude<T, Falsy>>;\n}\n"],"mappings":"AAKA,SAAgB,EAAW,EAAsC,CAC/D,OAAO,EAAM,OAAO,OAAO,CAC7B"}

package/dist/array/compact.d.ts

@@ -0,0 +1,7 @@
+type Falsy = false | '' | 0 | 0n | null | undefined;
+/**
+ * Creates a new array with all falsy values removed.
+ */
+export declare function compact<T>(array: T[]): Array<Exclude<T, Falsy>>;
+export {};
+//# sourceMappingURL=compact.d.ts.map

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

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

package/dist/array/compact.js

@@ -0,0 +1,8 @@
+//#region src/array/compact.ts
+function e(e) {
+	return e.filter(Boolean);
+}
+//#endregion
+export { e as compact };
+
+//# sourceMappingURL=compact.js.map

package/dist/array/compact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compact.js","names":[],"sources":["../../src/array/compact.ts"],"sourcesContent":["type Falsy = false | '' | 0 | 0n | null | undefined;\n\n/**\n * Creates a new array with all falsy values removed.\n */\nexport function compact<T>(array: T[]): Array<Exclude<T, Falsy>> {\n  return array.filter(Boolean) as Array<Exclude<T, Falsy>>;\n}\n"],"mappings":";AAKA,SAAgB,EAAW,GAAsC;CAC/D,OAAO,EAAM,OAAO,OAAO;AAC7B"}

package/dist/array/compare.cjs

@@ -0,0 +1,2 @@
+const e=require("../errors.cjs");var t=(t,n)=>{if(t===n)return 0;if(t===void 0)return 1;if(n===void 0)return-1;if(t===null)return n===null?0:-1;if(n===null)return 1;if(typeof t==`string`&&typeof n==`string`)return t.localeCompare(n);if(typeof t==`number`&&typeof n==`number`)return t===n?0:t>n?1:-1;if(t instanceof Date&&n instanceof Date){let e=t.getTime(),r=n.getTime();return e===r?0:e>r?1:-1}throw new e.ArsenalValidationError(`compare: unsupported types "${typeof t}" and "${typeof n}". Supported: number, string, Date, null, undefined.`)};exports.compare=t;
+//# sourceMappingURL=compare.cjs.map

package/dist/array/compare.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.cjs","names":[],"sources":["../../src/array/compare.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\n/**\n * Compares two values and returns a number suitable for use as a sort comparator.\n *\n * - Numbers and Dates: returns `0`, `1`, or `-1`.\n * - Strings: delegates to `String.prototype.localeCompare`, which may return any integer\n *   (not just `0`, `1`, `-1`) depending on locale and engine.\n * - `null` sorts before all non-null values; `undefined` sorts last.\n *\n * @example\n * ```ts\n * compare('a', 'b'); // negative (locale-dependent)\n * compare(1, 2); // -1\n * compare(new Date('2023-01-01'), new Date('2023-01-02')); // -1\n * compare('a', 'a'); // 0\n * compare(1, 1); // 0\n * compare(new Date('2023-01-01'), new Date('2023-01-01')); // 0\n * ```\n *\n * @param a - The first value to compare.\n * @param b - The second value to compare.\n *\n * @returns A negative number, zero, or a positive number.\n *\n * Pass directly as an `Array.sort` comparator:\n * ```ts\n * [3, 1, 2].sort(compare); // [1, 2, 3]\n * ['banana', 'apple', 'cherry'].sort(compare); // ['apple', 'banana', 'cherry']\n * ```\n */\nexport const compare = (a: unknown, b: unknown): number => {\n  if (a === b) return 0;\n\n  if (a === undefined) return 1;\n\n  if (b === undefined) return -1;\n\n  if (a === null) return b === null ? 0 : -1;\n\n  if (b === null) return 1;\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a.localeCompare(b);\n  }\n\n  if (typeof a === 'number' && typeof b === 'number') {\n    return a === b ? 0 : a > b ? 1 : -1;\n  }\n\n  if (a instanceof Date && b instanceof Date) {\n    const at = a.getTime();\n    const bt = b.getTime();\n\n    return at === bt ? 0 : at > bt ? 1 : -1;\n  }\n\n  throw new ArsenalValidationError(\n    `compare: unsupported types \"${typeof a}\" and \"${typeof b}\". Supported: number, string, Date, null, undefined.`,\n  );\n};\n"],"mappings":"iCA+BA,IAAa,GAAW,EAAY,IAAuB,CACzD,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,IAAM,IAAA,GAAW,MAAO,GAE5B,GAAI,IAAM,IAAA,GAAW,MAAO,GAE5B,GAAI,IAAM,KAAM,OAAO,IAAM,KAAO,EAAI,GAExC,GAAI,IAAM,KAAM,MAAO,GAEvB,GAAI,OAAO,GAAM,UAAY,OAAO,GAAM,SACxC,OAAO,EAAE,cAAc,CAAC,EAG1B,GAAI,OAAO,GAAM,UAAY,OAAO,GAAM,SACxC,OAAO,IAAM,EAAI,EAAI,EAAI,EAAI,EAAI,GAGnC,GAAI,aAAa,MAAQ,aAAa,KAAM,CAC1C,IAAM,EAAK,EAAE,QAAQ,EACf,EAAK,EAAE,QAAQ,EAErB,OAAO,IAAO,EAAK,EAAI,EAAK,EAAK,EAAI,EACvC,CAEA,MAAM,IAAI,EAAA,uBACR,+BAA+B,OAAO,EAAE,SAAS,OAAO,EAAE,qDAC5D,CACF"}

package/dist/array/compare.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Compares two values and returns a number suitable for use as a sort comparator.
+ *
+ * - Numbers and Dates: returns `0`, `1`, or `-1`.
+ * - Strings: delegates to `String.prototype.localeCompare`, which may return any integer
+ *   (not just `0`, `1`, `-1`) depending on locale and engine.
+ * - `null` sorts before all non-null values; `undefined` sorts last.
+ *
+ * @example
+ * ```ts
+ * compare('a', 'b'); // negative (locale-dependent)
+ * compare(1, 2); // -1
+ * compare(new Date('2023-01-01'), new Date('2023-01-02')); // -1
+ * compare('a', 'a'); // 0
+ * compare(1, 1); // 0
+ * compare(new Date('2023-01-01'), new Date('2023-01-01')); // 0
+ * ```
+ *
+ * @param a - The first value to compare.
+ * @param b - The second value to compare.
+ *
+ * @returns A negative number, zero, or a positive number.
+ *
+ * Pass directly as an `Array.sort` comparator:
+ * ```ts
+ * [3, 1, 2].sort(compare); // [1, 2, 3]
+ * ['banana', 'apple', 'cherry'].sort(compare); // ['apple', 'banana', 'cherry']
+ * ```
+ */
+export declare const compare: (a: unknown, b: unknown) => number;
+//# sourceMappingURL=compare.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compare.d.ts","sourceRoot":"","sources":["../../src/array/compare.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,MA6BhD,CAAC"}

package/dist/array/compare.js

@@ -0,0 +1,20 @@
+import { ArsenalValidationError as e } from "../errors.js";
+//#region src/array/compare.ts
+var t = (t, n) => {
+	if (t === n) return 0;
+	if (t === void 0) return 1;
+	if (n === void 0) return -1;
+	if (t === null) return n === null ? 0 : -1;
+	if (n === null) return 1;
+	if (typeof t == "string" && typeof n == "string") return t.localeCompare(n);
+	if (typeof t == "number" && typeof n == "number") return t === n ? 0 : t > n ? 1 : -1;
+	if (t instanceof Date && n instanceof Date) {
+		let e = t.getTime(), r = n.getTime();
+		return e === r ? 0 : e > r ? 1 : -1;
+	}
+	throw new e(`compare: unsupported types "${typeof t}" and "${typeof n}". Supported: number, string, Date, null, undefined.`);
+};
+//#endregion
+export { t as compare };
+
+//# sourceMappingURL=compare.js.map

package/dist/array/compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.js","names":[],"sources":["../../src/array/compare.ts"],"sourcesContent":["import { ArsenalValidationError } from '../errors';\n\n/**\n * Compares two values and returns a number suitable for use as a sort comparator.\n *\n * - Numbers and Dates: returns `0`, `1`, or `-1`.\n * - Strings: delegates to `String.prototype.localeCompare`, which may return any integer\n *   (not just `0`, `1`, `-1`) depending on locale and engine.\n * - `null` sorts before all non-null values; `undefined` sorts last.\n *\n * @example\n * ```ts\n * compare('a', 'b'); // negative (locale-dependent)\n * compare(1, 2); // -1\n * compare(new Date('2023-01-01'), new Date('2023-01-02')); // -1\n * compare('a', 'a'); // 0\n * compare(1, 1); // 0\n * compare(new Date('2023-01-01'), new Date('2023-01-01')); // 0\n * ```\n *\n * @param a - The first value to compare.\n * @param b - The second value to compare.\n *\n * @returns A negative number, zero, or a positive number.\n *\n * Pass directly as an `Array.sort` comparator:\n * ```ts\n * [3, 1, 2].sort(compare); // [1, 2, 3]\n * ['banana', 'apple', 'cherry'].sort(compare); // ['apple', 'banana', 'cherry']\n * ```\n */\nexport const compare = (a: unknown, b: unknown): number => {\n  if (a === b) return 0;\n\n  if (a === undefined) return 1;\n\n  if (b === undefined) return -1;\n\n  if (a === null) return b === null ? 0 : -1;\n\n  if (b === null) return 1;\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a.localeCompare(b);\n  }\n\n  if (typeof a === 'number' && typeof b === 'number') {\n    return a === b ? 0 : a > b ? 1 : -1;\n  }\n\n  if (a instanceof Date && b instanceof Date) {\n    const at = a.getTime();\n    const bt = b.getTime();\n\n    return at === bt ? 0 : at > bt ? 1 : -1;\n  }\n\n  throw new ArsenalValidationError(\n    `compare: unsupported types \"${typeof a}\" and \"${typeof b}\". Supported: number, string, Date, null, undefined.`,\n  );\n};\n"],"mappings":";;AA+BA,IAAa,KAAW,GAAY,MAAuB;CACzD,IAAI,MAAM,GAAG,OAAO;CAEpB,IAAI,MAAM,KAAA,GAAW,OAAO;CAE5B,IAAI,MAAM,KAAA,GAAW,OAAO;CAE5B,IAAI,MAAM,MAAM,OAAO,MAAM,OAAO,IAAI;CAExC,IAAI,MAAM,MAAM,OAAO;CAEvB,IAAI,OAAO,KAAM,YAAY,OAAO,KAAM,UACxC,OAAO,EAAE,cAAc,CAAC;CAG1B,IAAI,OAAO,KAAM,YAAY,OAAO,KAAM,UACxC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI;CAGnC,IAAI,aAAa,QAAQ,aAAa,MAAM;EAC1C,IAAM,IAAK,EAAE,QAAQ,GACf,IAAK,EAAE,QAAQ;EAErB,OAAO,MAAO,IAAK,IAAI,IAAK,IAAK,IAAI;CACvC;CAEA,MAAM,IAAI,EACR,+BAA+B,OAAO,EAAE,SAAS,OAAO,EAAE,qDAC5D;AACF"}

package/dist/array/compareBy.cjs

@@ -0,0 +1,2 @@
+const e=require("./compare.cjs");var t=t=>{let n=Object.entries(t);return(t,r)=>{for(let[i,a]of n){let n=t[i],o=r[i],s=a===`desc`?-1:1,c=e.compare(n,o);if(c!==0)return c*s}return 0}};exports.compareBy=t;
+//# sourceMappingURL=compareBy.cjs.map

package/dist/array/compareBy.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compareBy.cjs","names":[],"sources":["../../src/array/compareBy.ts"],"sourcesContent":["import { compare } from './compare';\n\n/**\n * Compares two objects based on multiple selectors.\n * The comparison is done in the order of the selectors provided.\n * Each selector can be 'asc' for ascending or 'desc' for descending order.\n *\n * @example\n * ```ts\n * const compareByNameAndAge = compareBy<{ name: string; age: number }>({\n *   name: 'asc',\n *   age: 'desc',\n * });\n *\n * const a = { name: 'Alice', age: 30 };\n * const b = { name: 'Bob', age: 25 };\n *\n * console.log(compareByNameAndAge(a, b)); // -1 (Alice < Bob)\n * ```\n *\n * @param selectors - An object where keys are properties to compare and values are 'asc' or 'desc'.\n *\n * @returns A comparator for use with `Array.sort` or `sort()`.\n */\nexport const compareBy = <T>(selectors: Partial<Record<keyof T, 'asc' | 'desc'>>) => {\n  const entries = Object.entries(selectors) as [keyof T, 'asc' | 'desc'][];\n\n  return (a: T, b: T) => {\n    for (const [key, direction] of entries) {\n      const v1 = a[key];\n      const v2 = b[key];\n      const dir = direction === 'desc' ? -1 : 1;\n\n      const cmp = compare(v1, v2);\n\n      if (cmp !== 0) return cmp * dir;\n    }\n\n    return 0;\n  };\n};\n"],"mappings":"iCAwBA,IAAa,EAAgB,GAAwD,CACnF,IAAM,EAAU,OAAO,QAAQ,CAAS,EAExC,OAAQ,EAAM,IAAS,CACrB,IAAK,GAAM,CAAC,EAAK,KAAc,EAAS,CACtC,IAAM,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAM,IAAc,OAAS,GAAK,EAElC,EAAM,EAAA,QAAQ,EAAI,CAAE,EAE1B,GAAI,IAAQ,EAAG,OAAO,EAAM,CAC9B,CAEA,MAAO,EACT,CACF"}

package/dist/array/compareBy.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Compares two objects based on multiple selectors.
+ * The comparison is done in the order of the selectors provided.
+ * Each selector can be 'asc' for ascending or 'desc' for descending order.
+ *
+ * @example
+ * ```ts
+ * const compareByNameAndAge = compareBy<{ name: string; age: number }>({
+ *   name: 'asc',
+ *   age: 'desc',
+ * });
+ *
+ * const a = { name: 'Alice', age: 30 };
+ * const b = { name: 'Bob', age: 25 };
+ *
+ * console.log(compareByNameAndAge(a, b)); // -1 (Alice < Bob)
+ * ```
+ *
+ * @param selectors - An object where keys are properties to compare and values are 'asc' or 'desc'.
+ *
+ * @returns A comparator for use with `Array.sort` or `sort()`.
+ */
+export declare const compareBy: <T>(selectors: Partial<Record<keyof T, "asc" | "desc">>) => (a: T, b: T) => number;
+//# sourceMappingURL=compareBy.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compareBy.d.ts","sourceRoot":"","sources":["../../src/array/compareBy.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,WAAW,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,MAGtE,GAAG,CAAC,EAAE,GAAG,CAAC,WAanB,CAAC"}

package/dist/array/compareBy.js

@@ -0,0 +1,16 @@
+import { compare as e } from "./compare.js";
+//#region src/array/compareBy.ts
+var t = (t) => {
+	let n = Object.entries(t);
+	return (t, r) => {
+		for (let [i, a] of n) {
+			let n = t[i], o = r[i], s = a === "desc" ? -1 : 1, c = e(n, o);
+			if (c !== 0) return c * s;
+		}
+		return 0;
+	};
+};
+//#endregion
+export { t as compareBy };
+
+//# sourceMappingURL=compareBy.js.map

package/dist/array/compareBy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compareBy.js","names":[],"sources":["../../src/array/compareBy.ts"],"sourcesContent":["import { compare } from './compare';\n\n/**\n * Compares two objects based on multiple selectors.\n * The comparison is done in the order of the selectors provided.\n * Each selector can be 'asc' for ascending or 'desc' for descending order.\n *\n * @example\n * ```ts\n * const compareByNameAndAge = compareBy<{ name: string; age: number }>({\n *   name: 'asc',\n *   age: 'desc',\n * });\n *\n * const a = { name: 'Alice', age: 30 };\n * const b = { name: 'Bob', age: 25 };\n *\n * console.log(compareByNameAndAge(a, b)); // -1 (Alice < Bob)\n * ```\n *\n * @param selectors - An object where keys are properties to compare and values are 'asc' or 'desc'.\n *\n * @returns A comparator for use with `Array.sort` or `sort()`.\n */\nexport const compareBy = <T>(selectors: Partial<Record<keyof T, 'asc' | 'desc'>>) => {\n  const entries = Object.entries(selectors) as [keyof T, 'asc' | 'desc'][];\n\n  return (a: T, b: T) => {\n    for (const [key, direction] of entries) {\n      const v1 = a[key];\n      const v2 = b[key];\n      const dir = direction === 'desc' ? -1 : 1;\n\n      const cmp = compare(v1, v2);\n\n      if (cmp !== 0) return cmp * dir;\n    }\n\n    return 0;\n  };\n};\n"],"mappings":";;AAwBA,IAAa,KAAgB,MAAwD;CACnF,IAAM,IAAU,OAAO,QAAQ,CAAS;CAExC,QAAQ,GAAM,MAAS;EACrB,KAAK,IAAM,CAAC,GAAK,MAAc,GAAS;GACtC,IAAM,IAAK,EAAE,IACP,IAAK,EAAE,IACP,IAAM,MAAc,SAAS,KAAK,GAElC,IAAM,EAAQ,GAAI,CAAE;GAE1B,IAAI,MAAQ,GAAG,OAAO,IAAM;EAC9B;EAEA,OAAO;CACT;AACF"}

package/dist/array/contains.cjs

@@ -0,0 +1,2 @@
+const e=require("../guards/isEqual.cjs");function t(t,n){return typeof n!=`object`||!n?t.includes(n):t.some(t=>e.isEqual(t,n))}exports.contains=t;
+//# sourceMappingURL=contains.cjs.map

package/dist/array/contains.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"contains.cjs","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":"yCAkBA,SAAgB,EAAY,EAAY,EAAyB,CAO/D,OAJ6C,OAAO,GAAU,WAA1D,EACK,EAAM,SAAS,CAAU,EAG3B,EAAM,KAAM,GAAQ,EAAA,QAAQ,EAAK,CAAK,CAAC,CAChD"}

package/dist/array/contains.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Checks if a value is present in an array.
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, { a: 1 }, 'hello'];
+ * const value = { a: 1 };
+ * contains(arr, value) // true;
+ * ```
+ *
+ * @param array - The array to check.
+ * @param value - The value to search for.
+ *
+ * @returns true if the value is present in the array, else false.
+ */
+export declare function contains<T>(array: T[], value: unknown): boolean;
+//# sourceMappingURL=contains.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"contains.d.ts","sourceRoot":"","sources":["../../src/array/contains.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AAEH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAQ/D"}