@vielzeug/toolkit 1.1.2 → 2.0.0

package/dist/object/proxy.js

@@ -0,0 +1,21 @@
+import { isObject as e } from "../typed/isObject.js";
+//#region src/object/proxy.ts
+function t(n, r) {
+	let { deep: i = !1, get: a, set: o, watch: s } = r, c = s ? new Set(s) : null;
+	return new Proxy(n, {
+		get(n, o, s) {
+			if (c && !c.has(o)) return Reflect.get(n, o, s);
+			let l = Reflect.get(n, o, s);
+			return a && (l = a(o, l, n)), i && e(l) ? t(l, r) : l;
+		},
+		set(n, a, s, l) {
+			if (c && !c.has(a)) return Reflect.set(n, a, s, l);
+			let u = n[a], d = o ? o(a, s, u, n) : s;
+			return i && e(d) ? Reflect.set(n, a, t(d, r), l) : Reflect.set(n, a, d, l);
+		}
+	});
+}
+//#endregion
+export { t as proxy };
+
+//# sourceMappingURL=proxy.js.map

package/dist/object/proxy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proxy.js","names":[],"sources":["../../src/object/proxy.ts"],"sourcesContent":["import type { Obj } from '../types';\n\nimport { isObject } from '../typed/isObject';\n\n// #region ProxyOptions\ntype ProxyOptions<T> = {\n  deep?: boolean;\n  get?: <K extends PropertyKey>(prop: K, val: unknown, target: T) => unknown;\n  set?: <K extends PropertyKey>(prop: K, curr: unknown, prev: unknown, target: T) => unknown;\n  watch?: (keyof T)[];\n};\n// #endregion ProxyOptions\n\n/**\n * Creates a new Proxy for the given object that invokes functions when properties are accessed or modified.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2 };\n * const log = (prop, curr, prev, target) => console.log(`Property '${prop}' changed from ${prev} to ${curr}`);\n * const proxyObj = proxy(obj, { set: log });\n * proxyObj.a = 3; // logs 'Property 'a' changed from 1 to 3'\n * ```\n *\n * @param item - The object to observe.\n * @param options - Configuration options for the proxy.\n * @param [options.set] - A function to call when a property is set.\n * @param [options.get] - A function to call when a property is accessed.\n * @param [options.deep] - If true, the proxy will also apply to nested objects.\n * @param [options.watch] - An array of property names to watch.\n *\n * @returns A new Proxy for the given object.\n */\nexport function proxy<T extends Obj>(item: T, options: ProxyOptions<T>): T {\n  const { deep = false, get, set, watch } = options;\n  const watchSet = watch ? new Set<PropertyKey>(watch as PropertyKey[]) : null;\n\n  const handler: ProxyHandler<T> = {\n    get(target, prop, receiver) {\n      if (watchSet && !watchSet.has(prop)) {\n        return Reflect.get(target, prop, receiver);\n      }\n\n      let value = Reflect.get(target, prop, receiver);\n\n      if (get) {\n        value = get(prop, value, target) as any;\n      }\n\n      if (deep && isObject(value)) {\n        return proxy(value as unknown as T, options);\n      }\n\n      return value;\n    },\n    set(target, prop, val, receiver) {\n      if (watchSet && !watchSet.has(prop)) {\n        return Reflect.set(target, prop, val, receiver);\n      }\n\n      const prev = target[prop as keyof T];\n      const value = set ? set(prop, val, prev, target) : val;\n\n      if (deep && isObject(value)) {\n        return Reflect.set(target, prop, proxy(value as unknown as T, options), receiver);\n      }\n\n      return Reflect.set(target, prop, value, receiver);\n    },\n  };\n\n  return new Proxy(item, handler);\n}\n"],"mappings":";;AAiCA,SAAgB,EAAqB,GAAS,GAA6B;CACzE,IAAM,EAAE,UAAO,IAAO,QAAK,QAAK,aAAU,GACpC,IAAW,IAAQ,IAAI,IAAiB,EAAuB,GAAG;AAoCxE,QAAO,IAAI,MAAM,GAlCgB;EAC/B,IAAI,GAAQ,GAAM,GAAU;AAC1B,OAAI,KAAY,CAAC,EAAS,IAAI,EAAK,CACjC,QAAO,QAAQ,IAAI,GAAQ,GAAM,EAAS;GAG5C,IAAI,IAAQ,QAAQ,IAAI,GAAQ,GAAM,EAAS;AAU/C,UARI,MACF,IAAQ,EAAI,GAAM,GAAO,EAAO,GAG9B,KAAQ,EAAS,EAAM,GAClB,EAAM,GAAuB,EAAQ,GAGvC;;EAET,IAAI,GAAQ,GAAM,GAAK,GAAU;AAC/B,OAAI,KAAY,CAAC,EAAS,IAAI,EAAK,CACjC,QAAO,QAAQ,IAAI,GAAQ,GAAM,GAAK,EAAS;GAGjD,IAAM,IAAO,EAAO,IACd,IAAQ,IAAM,EAAI,GAAM,GAAK,GAAM,EAAO,GAAG;AAMnD,UAJI,KAAQ,EAAS,EAAM,GAClB,QAAQ,IAAI,GAAQ,GAAM,EAAM,GAAuB,EAAQ,EAAE,EAAS,GAG5E,QAAQ,IAAI,GAAQ,GAAM,GAAO,EAAS;;EAEpD,CAE8B"}

package/dist/object/prune.cjs

@@ -0,0 +1,2 @@
+const e=require(`../typed/isArray.cjs`),t=require(`../typed/isString.cjs`),n=require(`../typed/isNil.cjs`),r=require(`../typed/isObject.cjs`),i=require(`../typed/isEmpty.cjs`);function a(o){if(!n.isNil(o)){if(t.isString(o)){let e=o.trim();return e===``?void 0:e}if(e.isArray(o)){let e=o.map(e=>a(e)).filter(e=>!i.isEmpty(e));return e.length===0?void 0:e}if(r.isObject(o)){let e={};for(let[t,n]of Object.entries(o)){let r=a(n);i.isEmpty(r)||(e[t]=r)}return Object.keys(e).length===0?void 0:e}return o}}exports.prune=a;
+//# sourceMappingURL=prune.cjs.map

package/dist/object/prune.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.cjs","names":[],"sources":["../../src/object/prune.ts"],"sourcesContent":["import { isArray } from '../typed/isArray';\nimport { isEmpty } from '../typed/isEmpty';\nimport { isNil } from '../typed/isNil';\nimport { isObject } from '../typed/isObject';\nimport { isString } from '../typed/isString';\n\n/**\n * Removes all nullable and empty values from strings, arrays, or objects.\n *\n * - For strings: Removes leading/trailing whitespace and returns undefined if empty\n * - For arrays: Recursively removes null, undefined, empty strings, and empty objects/arrays\n * - For objects: Recursively removes properties with null, undefined, empty strings, and empty objects/arrays\n *\n * @example\n * ```ts\n * prune('  hello  '); // 'hello'\n * prune('   '); // undefined\n * prune([1, null, '', 2, undefined, 3]); // [1, 2, 3]\n * prune({ a: 1, b: null, c: '', d: 2 }); // { a: 1, d: 2 }\n * prune({ a: { b: null, c: '' }, d: 1 }); // { d: 1 }\n * ```\n *\n * @param value - The value to prune (can be string, array, object, or any other type)\n * @returns The pruned value, or undefined if the result would be empty\n */\nexport function prune<T>(value: T): T | undefined {\n  if (isNil(value)) return undefined;\n\n  if (isString(value)) {\n    const trimmed = value.trim();\n\n    return (trimmed === '' ? undefined : trimmed) as T | undefined;\n  }\n\n  if (isArray(value)) {\n    const cleaned = value.map((item) => prune(item)).filter((item) => !isEmpty(item));\n\n    return (cleaned.length === 0 ? undefined : cleaned) as T | undefined;\n  }\n\n  if (isObject(value)) {\n    const cleaned: Record<string, unknown> = {};\n\n    for (const [key, val] of Object.entries(value)) {\n      const cleanedValue = prune(val);\n\n      if (!isEmpty(cleanedValue)) {\n        cleaned[key] = cleanedValue;\n      }\n    }\n\n    return (Object.keys(cleaned).length === 0 ? undefined : cleaned) as T | undefined;\n  }\n\n  return value;\n}\n"],"mappings":"gLAyBA,SAAgB,EAAS,EAAyB,CAC5C,MAAA,MAAM,EAAM,CAEhB,IAAI,EAAA,SAAS,EAAM,CAAE,CACnB,IAAM,EAAU,EAAM,MAAM,CAE5B,OAAQ,IAAY,GAAK,IAAA,GAAY,EAGvC,GAAI,EAAA,QAAQ,EAAM,CAAE,CAClB,IAAM,EAAU,EAAM,IAAK,GAAS,EAAM,EAAK,CAAC,CAAC,OAAQ,GAAS,CAAC,EAAA,QAAQ,EAAK,CAAC,CAEjF,OAAQ,EAAQ,SAAW,EAAI,IAAA,GAAY,EAG7C,GAAI,EAAA,SAAS,EAAM,CAAE,CACnB,IAAM,EAAmC,EAAE,CAE3C,IAAK,GAAM,CAAC,EAAK,KAAQ,OAAO,QAAQ,EAAM,CAAE,CAC9C,IAAM,EAAe,EAAM,EAAI,CAE1B,EAAA,QAAQ,EAAa,GACxB,EAAQ,GAAO,GAInB,OAAQ,OAAO,KAAK,EAAQ,CAAC,SAAW,EAAI,IAAA,GAAY,EAG1D,OAAO"}

package/dist/object/prune.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Removes all nullable and empty values from strings, arrays, or objects.
+ *
+ * - For strings: Removes leading/trailing whitespace and returns undefined if empty
+ * - For arrays: Recursively removes null, undefined, empty strings, and empty objects/arrays
+ * - For objects: Recursively removes properties with null, undefined, empty strings, and empty objects/arrays
+ *
+ * @example
+ * ```ts
+ * prune('  hello  '); // 'hello'
+ * prune('   '); // undefined
+ * prune([1, null, '', 2, undefined, 3]); // [1, 2, 3]
+ * prune({ a: 1, b: null, c: '', d: 2 }); // { a: 1, d: 2 }
+ * prune({ a: { b: null, c: '' }, d: 1 }); // { d: 1 }
+ * ```
+ *
+ * @param value - The value to prune (can be string, array, object, or any other type)
+ * @returns The pruned value, or undefined if the result would be empty
+ */
+export declare function prune<T>(value: T): T | undefined;
+//# sourceMappingURL=prune.d.ts.map

package/dist/object/prune.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../../src/object/prune.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CA8BhD"}

package/dist/object/prune.js

@@ -0,0 +1,31 @@
+import { isArray as e } from "../typed/isArray.js";
+import { isString as t } from "../typed/isString.js";
+import { isNil as n } from "../typed/isNil.js";
+import { isObject as r } from "../typed/isObject.js";
+import { isEmpty as i } from "../typed/isEmpty.js";
+//#region src/object/prune.ts
+function a(o) {
+	if (!n(o)) {
+		if (t(o)) {
+			let e = o.trim();
+			return e === "" ? void 0 : e;
+		}
+		if (e(o)) {
+			let e = o.map((e) => a(e)).filter((e) => !i(e));
+			return e.length === 0 ? void 0 : e;
+		}
+		if (r(o)) {
+			let e = {};
+			for (let [t, n] of Object.entries(o)) {
+				let r = a(n);
+				i(r) || (e[t] = r);
+			}
+			return Object.keys(e).length === 0 ? void 0 : e;
+		}
+		return o;
+	}
+}
+//#endregion
+export { a as prune };
+
+//# sourceMappingURL=prune.js.map

package/dist/object/prune.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.js","names":[],"sources":["../../src/object/prune.ts"],"sourcesContent":["import { isArray } from '../typed/isArray';\nimport { isEmpty } from '../typed/isEmpty';\nimport { isNil } from '../typed/isNil';\nimport { isObject } from '../typed/isObject';\nimport { isString } from '../typed/isString';\n\n/**\n * Removes all nullable and empty values from strings, arrays, or objects.\n *\n * - For strings: Removes leading/trailing whitespace and returns undefined if empty\n * - For arrays: Recursively removes null, undefined, empty strings, and empty objects/arrays\n * - For objects: Recursively removes properties with null, undefined, empty strings, and empty objects/arrays\n *\n * @example\n * ```ts\n * prune('  hello  '); // 'hello'\n * prune('   '); // undefined\n * prune([1, null, '', 2, undefined, 3]); // [1, 2, 3]\n * prune({ a: 1, b: null, c: '', d: 2 }); // { a: 1, d: 2 }\n * prune({ a: { b: null, c: '' }, d: 1 }); // { d: 1 }\n * ```\n *\n * @param value - The value to prune (can be string, array, object, or any other type)\n * @returns The pruned value, or undefined if the result would be empty\n */\nexport function prune<T>(value: T): T | undefined {\n  if (isNil(value)) return undefined;\n\n  if (isString(value)) {\n    const trimmed = value.trim();\n\n    return (trimmed === '' ? undefined : trimmed) as T | undefined;\n  }\n\n  if (isArray(value)) {\n    const cleaned = value.map((item) => prune(item)).filter((item) => !isEmpty(item));\n\n    return (cleaned.length === 0 ? undefined : cleaned) as T | undefined;\n  }\n\n  if (isObject(value)) {\n    const cleaned: Record<string, unknown> = {};\n\n    for (const [key, val] of Object.entries(value)) {\n      const cleanedValue = prune(val);\n\n      if (!isEmpty(cleanedValue)) {\n        cleaned[key] = cleanedValue;\n      }\n    }\n\n    return (Object.keys(cleaned).length === 0 ? undefined : cleaned) as T | undefined;\n  }\n\n  return value;\n}\n"],"mappings":";;;;;;AAyBA,SAAgB,EAAS,GAAyB;AAC5C,QAAM,EAAM,EAEhB;MAAI,EAAS,EAAM,EAAE;GACnB,IAAM,IAAU,EAAM,MAAM;AAE5B,UAAQ,MAAY,KAAK,KAAA,IAAY;;AAGvC,MAAI,EAAQ,EAAM,EAAE;GAClB,IAAM,IAAU,EAAM,KAAK,MAAS,EAAM,EAAK,CAAC,CAAC,QAAQ,MAAS,CAAC,EAAQ,EAAK,CAAC;AAEjF,UAAQ,EAAQ,WAAW,IAAI,KAAA,IAAY;;AAG7C,MAAI,EAAS,EAAM,EAAE;GACnB,IAAM,IAAmC,EAAE;AAE3C,QAAK,IAAM,CAAC,GAAK,MAAQ,OAAO,QAAQ,EAAM,EAAE;IAC9C,IAAM,IAAe,EAAM,EAAI;AAE/B,IAAK,EAAQ,EAAa,KACxB,EAAQ,KAAO;;AAInB,UAAQ,OAAO,KAAK,EAAQ,CAAC,WAAW,IAAI,KAAA,IAAY;;AAG1D,SAAO"}

package/dist/object/seek.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("../function/assert.cjs"),l=require("../string/similarity.cjs"),s=require("../typed/is.cjs"),a=require("../typed/isWithin.cjs");function t(r,n,i=1){return u.assert(a.isWithin(i,0,1),a.IS_WITHIN_ERROR_MSG,{args:{max:1,min:0,tone:i},type:TypeError}),s.is("nil",r)?!1:s.is("string",r)||s.is("number",r)?l.similarity(r,n)>=i:s.is("array",r)?r.some(e=>t(e,n,i)):s.is("object",r)?Object.values(r).some(e=>s.is("nil",e)?!1:t(e,n,i)):!1}exports.seek=t;
-//# sourceMappingURL=seek.cjs.map
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`),n=require(`../typed/isString.cjs`),r=require(`../string/similarity.cjs`),i=require(`../typed/isNil.cjs`),a=require(`../typed/isNumber.cjs`),o=require(`../typed/isObject.cjs`),s=require(`../typed/isWithin.cjs`);function c(e,s,l){return i.isNil(e)?!1:n.isString(e)||a.isNumber(e)?r.similarity(String(e),s)>=l:t.isArray(e)?e.some(e=>c(e,s,l)):o.isObject(e)?Object.values(e).some(e=>i.isNil(e)?!1:c(e,s,l)):!1}function l(t,n,r=1){return e.assert(s.isWithin(r,0,1),s.IS_WITHIN_ERROR_MSG,{args:{max:1,min:0,tone:r},type:TypeError}),c(t,n,r)}exports.seek=l;
+//# sourceMappingURL=seek.cjs.map

package/dist/object/seek.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"seek.cjs","sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { is } from '../typed/is';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (is('nil', item)) return false;\n\n  if (is('string', item) || is('number', item)) {\n    // Lowercase both sides for case-insensitive comparison\n    return similarity(item, query) >= tone;\n  }\n\n  // Handle arrays\n  if (is('array', item)) {\n    return (item as unknown[]).some((value) => seek(value, query, tone));\n  }\n\n  // Handle objects but skip dates/regex/etc which are technically objects\n  if (is('object', item)) {\n    return Object.values(item as Record<string, unknown>).some((value) =>\n      is('nil', value) ? false : seek(value, query, tone),\n    );\n  }\n\n  return false;\n}\n"],"names":["seek","item","query","tone","assert","isWithin","IS_WITHIN_ERROR_MSG","is","similarity","value"],"mappings":"gOA6BO,SAASA,EAAQC,EAASC,EAAeC,EAAO,EAAY,CAGjE,OAFAC,EAAAA,OAAOC,EAAAA,SAASF,EAAM,EAAG,CAAC,EAAGG,EAAAA,oBAAqB,CAAE,KAAM,CAAE,IAAK,EAAG,IAAK,EAAG,KAAAH,GAAQ,KAAM,UAAW,EAEjGI,KAAG,MAAON,CAAI,EAAU,GAExBM,EAAAA,GAAG,SAAUN,CAAI,GAAKM,EAAAA,GAAG,SAAUN,CAAI,EAElCO,aAAWP,EAAMC,CAAK,GAAKC,EAIhCI,EAAAA,GAAG,QAASN,CAAI,EACVA,EAAmB,KAAMQ,GAAUT,EAAKS,EAAOP,EAAOC,CAAI,CAAC,EAIjEI,EAAAA,GAAG,SAAUN,CAAI,EACZ,OAAO,OAAOA,CAA+B,EAAE,KAAMQ,GAC1DF,KAAG,MAAOE,CAAK,EAAI,GAAQT,EAAKS,EAAOP,EAAOC,CAAI,CAAA,EAI/C,EACT"}
+{"version":3,"file":"seek.cjs","names":[],"sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\nimport { isNumber } from '../typed/isNumber';\nimport { isObject } from '../typed/isObject';\nimport { isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nfunction _seek<T>(item: T, query: string, tone: number): boolean {\n  if (isNil(item)) return false;\n\n  if (isString(item) || isNumber(item)) {\n    return similarity(String(item), query) >= tone;\n  }\n\n  if (isArray(item)) {\n    return (item as unknown[]).some((value) => _seek(value, query, tone));\n  }\n\n  if (isObject(item)) {\n    return Object.values(item as Record<string, unknown>).some((value) =>\n      isNil(value) ? false : _seek(value, query, tone),\n    );\n  }\n\n  return false;\n}\n\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  return _seek(item, query, tone);\n}\n"],"mappings":"8RAiCA,SAAS,EAAS,EAAS,EAAe,EAAuB,CAiB/D,OAhBI,EAAA,MAAM,EAAK,CAAS,GAEpB,EAAA,SAAS,EAAK,EAAI,EAAA,SAAS,EAAK,CAC3B,EAAA,WAAW,OAAO,EAAK,CAAE,EAAM,EAAI,EAGxC,EAAA,QAAQ,EAAK,CACP,EAAmB,KAAM,GAAU,EAAM,EAAO,EAAO,EAAK,CAAC,CAGnE,EAAA,SAAS,EAAK,CACT,OAAO,OAAO,EAAgC,CAAC,KAAM,GAC1D,EAAA,MAAM,EAAM,CAAG,GAAQ,EAAM,EAAO,EAAO,EAAK,CACjD,CAGI,GAGT,SAAgB,EAAQ,EAAS,EAAe,EAAO,EAAY,CAGjE,OAFA,EAAA,OAAO,EAAA,SAAS,EAAM,EAAG,EAAE,CAAE,EAAA,oBAAqB,CAAE,KAAM,CAAE,IAAK,EAAG,IAAK,EAAG,OAAM,CAAE,KAAM,UAAW,CAAC,CAE/F,EAAM,EAAM,EAAO,EAAK"}

package/dist/object/seek.d.ts

@@ -0,0 +1,2 @@
+export declare function seek<T>(item: T, query: string, tone?: number): boolean;
+//# sourceMappingURL=seek.d.ts.map

package/dist/object/seek.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seek.d.ts","sourceRoot":"","sources":["../../src/object/seek.ts"],"names":[],"mappings":"AAqDA,wBAAgB,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,OAAO,CAIjE"}

package/dist/object/seek.js

@@ -1,13 +1,26 @@
-import { assert as n } from "../function/assert.js";
-import { similarity as m } from "../string/similarity.js";
-import { is as s } from "../typed/is.js";
-import { IS_WITHIN_ERROR_MSG as p, isWithin as t } from "../typed/isWithin.js";
-function a(r, o, i = 1) {
-  return n(t(i, 0, 1), p, { args: { max: 1, min: 0, tone: i }, type: TypeError }), s("nil", r) ? !1 : s("string", r) || s("number", r) ? m(r, o) >= i : s("array", r) ? r.some((f) => a(f, o, i)) : s("object", r) ? Object.values(r).some(
-    (f) => s("nil", f) ? !1 : a(f, o, i)
-  ) : !1;
+import { assert as e } from "../function/assert.js";
+import { isArray as t } from "../typed/isArray.js";
+import { isString as n } from "../typed/isString.js";
+import { similarity as r } from "../string/similarity.js";
+import { isNil as i } from "../typed/isNil.js";
+import { isNumber as a } from "../typed/isNumber.js";
+import { isObject as o } from "../typed/isObject.js";
+import { IS_WITHIN_ERROR_MSG as s, isWithin as c } from "../typed/isWithin.js";
+//#region src/object/seek.ts
+function l(e, s, c) {
+	return i(e) ? !1 : n(e) || a(e) ? r(String(e), s) >= c : t(e) ? e.some((e) => l(e, s, c)) : o(e) ? Object.values(e).some((e) => i(e) ? !1 : l(e, s, c)) : !1;
 }
-export {
-  a as seek
-};
-//# sourceMappingURL=seek.js.map
+function u(t, n, r = 1) {
+	return e(c(r, 0, 1), s, {
+		args: {
+			max: 1,
+			min: 0,
+			tone: r
+		},
+		type: TypeError
+	}), l(t, n, r);
+}
+//#endregion
+export { u as seek };
+
+//# sourceMappingURL=seek.js.map

package/dist/object/seek.js.map

@@ -1 +1 @@
-{"version":3,"file":"seek.js","sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { is } from '../typed/is';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (is('nil', item)) return false;\n\n  if (is('string', item) || is('number', item)) {\n    // Lowercase both sides for case-insensitive comparison\n    return similarity(item, query) >= tone;\n  }\n\n  // Handle arrays\n  if (is('array', item)) {\n    return (item as unknown[]).some((value) => seek(value, query, tone));\n  }\n\n  // Handle objects but skip dates/regex/etc which are technically objects\n  if (is('object', item)) {\n    return Object.values(item as Record<string, unknown>).some((value) =>\n      is('nil', value) ? false : seek(value, query, tone),\n    );\n  }\n\n  return false;\n}\n"],"names":["seek","item","query","tone","assert","isWithin","IS_WITHIN_ERROR_MSG","is","similarity","value"],"mappings":";;;;AA6BO,SAASA,EAAQC,GAASC,GAAeC,IAAO,GAAY;AAGjE,SAFAC,EAAOC,EAASF,GAAM,GAAG,CAAC,GAAGG,GAAqB,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,GAAG,MAAAH,KAAQ,MAAM,WAAW,GAEjGI,EAAG,OAAON,CAAI,IAAU,KAExBM,EAAG,UAAUN,CAAI,KAAKM,EAAG,UAAUN,CAAI,IAElCO,EAAWP,GAAMC,CAAK,KAAKC,IAIhCI,EAAG,SAASN,CAAI,IACVA,EAAmB,KAAK,CAACQ,MAAUT,EAAKS,GAAOP,GAAOC,CAAI,CAAC,IAIjEI,EAAG,UAAUN,CAAI,IACZ,OAAO,OAAOA,CAA+B,EAAE;AAAA,IAAK,CAACQ,MAC1DF,EAAG,OAAOE,CAAK,IAAI,KAAQT,EAAKS,GAAOP,GAAOC,CAAI;AAAA,EAAA,IAI/C;AACT;"}
+{"version":3,"file":"seek.js","names":[],"sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\nimport { isNumber } from '../typed/isNumber';\nimport { isObject } from '../typed/isObject';\nimport { isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nfunction _seek<T>(item: T, query: string, tone: number): boolean {\n  if (isNil(item)) return false;\n\n  if (isString(item) || isNumber(item)) {\n    return similarity(String(item), query) >= tone;\n  }\n\n  if (isArray(item)) {\n    return (item as unknown[]).some((value) => _seek(value, query, tone));\n  }\n\n  if (isObject(item)) {\n    return Object.values(item as Record<string, unknown>).some((value) =>\n      isNil(value) ? false : _seek(value, query, tone),\n    );\n  }\n\n  return false;\n}\n\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  return _seek(item, query, tone);\n}\n"],"mappings":";;;;;;;;;AAiCA,SAAS,EAAS,GAAS,GAAe,GAAuB;AAiB/D,QAhBI,EAAM,EAAK,GAAS,KAEpB,EAAS,EAAK,IAAI,EAAS,EAAK,GAC3B,EAAW,OAAO,EAAK,EAAE,EAAM,IAAI,IAGxC,EAAQ,EAAK,GACP,EAAmB,MAAM,MAAU,EAAM,GAAO,GAAO,EAAK,CAAC,GAGnE,EAAS,EAAK,GACT,OAAO,OAAO,EAAgC,CAAC,MAAM,MAC1D,EAAM,EAAM,GAAG,KAAQ,EAAM,GAAO,GAAO,EAAK,CACjD,GAGI;;AAGT,SAAgB,EAAQ,GAAS,GAAe,IAAO,GAAY;AAGjE,QAFA,EAAO,EAAS,GAAM,GAAG,EAAE,EAAE,GAAqB;EAAE,MAAM;GAAE,KAAK;GAAG,KAAK;GAAG;GAAM;EAAE,MAAM;EAAW,CAAC,EAE/F,EAAM,GAAM,GAAO,EAAK"}

package/dist/object/stash.cjs

@@ -0,0 +1,2 @@
+const e=require(`../async/scheduler.cjs`);function t(t){let n=new Map,r=new Map,i=t.scheduler??new e.Scheduler,a=t.hash,o=0;function s(e){r.get(e)?.controller.abort(),r.delete(e)}function c(e){let t=n.has(e);return s(e),n.delete(e),t}function l(e){return n.get(a(e))?.value}function u(e){let t=n.get(a(e));if(t)return{meta:t.meta,value:t.value}}function d(e,t,r){let i=a(e),o=n.get(i);s(i),n.set(i,{key:e,meta:r&&`meta`in r?r.meta:o?.meta,value:t}),r?.ttlMs!==void 0&&_(e,r.ttlMs)}function f(e,t,n){let r=u(e);if(r)return r.value;let i=t();return d(e,i,n),i}function p(e){return c(a(e))}function m(){for(let e of r.values())e.controller.abort();n.clear(),r.clear()}function h(){return n.size}function g(e,a){if(s(e),a===1/0)return;if(!Number.isFinite(a))throw TypeError(`stash.scheduleGc expects a finite number or Infinity`);if(a<=0){c(e);return}if(!n.has(e))return;let l=new AbortController,u=++o;r.set(e,{controller:l,token:u}),i.postTask(()=>{let t=r.get(e);!t||t.token!==u||(r.delete(e),c(e))},{delay:a,priority:`background`,signal:l.signal}).catch(e=>{e instanceof DOMException&&e.name===`AbortError`||t.onError?.(e)})}function _(e,t){g(a(e),t)}function v(e){s(a(e))}function y(e,t){let r=a(e);return n.has(r)?(g(r,t),!0):!1}function*b(){for(let e of n.values())yield[e.key,e.value]}return{cancelGc:v,clear:m,delete:p,entries:b,get:l,getEntry:u,getOrSet:f,scheduleGc:_,set:d,size:h,touch:y}}exports.stash=t;
+//# sourceMappingURL=stash.cjs.map

package/dist/object/stash.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"stash.cjs","names":[],"sources":["../../src/object/stash.ts"],"sourcesContent":["import { Scheduler, type SchedulerLike } from '../async';\n\ntype CacheKey = readonly unknown[];\n\ntype CacheRecord<K extends CacheKey, T, M> = {\n  key: K;\n  meta: M | undefined;\n  value: T;\n};\n\ntype GcTask = {\n  controller: AbortController;\n  token: number;\n};\n\nexport type CacheOptions<K extends CacheKey = CacheKey> = {\n  hash: (key: K) => string;\n  onError?: (error: unknown) => void;\n  scheduler?: Pick<SchedulerLike, 'postTask'>;\n};\n\nexport type CacheSetOptions<M> = {\n  meta?: M;\n  ttlMs?: number;\n};\n\nexport type Stash<T, K extends CacheKey = CacheKey, M = never> = {\n  cancelGc: (key: K) => void;\n  clear: () => void;\n  delete: (key: K) => boolean;\n  entries: () => IterableIterator<[K, T]>;\n  get: (key: K) => T | undefined;\n  getEntry: (key: K) => Readonly<{ meta: M | undefined; value: T }> | undefined;\n  getOrSet: (key: K, factory: () => T, options?: CacheSetOptions<M>) => T;\n  scheduleGc: (key: K, delayMs: number) => void;\n  set: (key: K, value: T, options?: CacheSetOptions<M>) => void;\n  size: () => number;\n  touch: (key: K, ttlMs: number) => boolean;\n};\n\n/**\n * Creates a generic key-value cache with automatic garbage collection and observer support.\n *\n * @example\n * ```ts\n * const myCache = stash<string>({ hash: (key) => JSON.stringify(key) });\n * myCache.set(['user', 1], 'John Doe');\n * const value = myCache.get(['user', 1]); // 'John Doe'\n * myCache.scheduleGc(['user', 1], 5000); // Auto-delete after 5s\n * ```\n *\n * @template T - The type of values stored in the cache.\n *\n * @returns A cache instance with get, set, delete, clear, and GC methods.\n */\nexport function stash<T, K extends CacheKey = CacheKey, M = never>(options: CacheOptions<K>): Stash<T, K, M> {\n  const store = new Map<string, CacheRecord<K, T, M>>();\n  const gcTasks = new Map<string, GcTask>();\n  const scheduler = options.scheduler ?? new Scheduler();\n  const hash = options.hash;\n  let gcToken = 0;\n\n  function cancelGcByHash(keyHash: string): void {\n    gcTasks.get(keyHash)?.controller.abort();\n    gcTasks.delete(keyHash);\n  }\n\n  function deleteByHash(keyHash: string): boolean {\n    const existed = store.has(keyHash);\n\n    cancelGcByHash(keyHash);\n    store.delete(keyHash);\n\n    return existed;\n  }\n\n  function get(key: K): T | undefined {\n    return store.get(hash(key))?.value;\n  }\n\n  function getEntry(key: K): Readonly<{ meta: M | undefined; value: T }> | undefined {\n    const entry = store.get(hash(key));\n\n    if (!entry) {\n      return undefined;\n    }\n\n    return { meta: entry.meta, value: entry.value };\n  }\n\n  function set(key: K, value: T, options?: CacheSetOptions<M>): void {\n    const keyHash = hash(key);\n    const existing = store.get(keyHash);\n\n    cancelGcByHash(keyHash);\n    store.set(keyHash, {\n      key,\n      meta: options && 'meta' in options ? options.meta : existing?.meta,\n      value,\n    });\n\n    if (options?.ttlMs !== undefined) {\n      scheduleGc(key, options.ttlMs);\n    }\n  }\n\n  function getOrSet(key: K, factory: () => T, options?: CacheSetOptions<M>): T {\n    const existing = getEntry(key);\n\n    if (existing) {\n      return existing.value;\n    }\n\n    const value = factory();\n\n    set(key, value, options);\n\n    return value;\n  }\n\n  function del(key: K): boolean {\n    return deleteByHash(hash(key));\n  }\n\n  function clear(): void {\n    for (const task of gcTasks.values()) task.controller.abort();\n    store.clear();\n    gcTasks.clear();\n  }\n\n  function size(): number {\n    return store.size;\n  }\n\n  function scheduleGcByHash(keyHash: string, delayMs: number): void {\n    cancelGcByHash(keyHash);\n\n    if (delayMs === Number.POSITIVE_INFINITY) {\n      return;\n    }\n\n    if (!Number.isFinite(delayMs)) {\n      throw new TypeError('stash.scheduleGc expects a finite number or Infinity');\n    }\n\n    if (delayMs <= 0) {\n      deleteByHash(keyHash);\n\n      return;\n    }\n\n    if (!store.has(keyHash)) {\n      return;\n    }\n\n    const controller = new AbortController();\n    const token = ++gcToken;\n\n    gcTasks.set(keyHash, { controller, token });\n    void scheduler\n      .postTask(\n        () => {\n          const current = gcTasks.get(keyHash);\n\n          if (!current || current.token !== token) {\n            return;\n          }\n\n          gcTasks.delete(keyHash);\n\n          deleteByHash(keyHash);\n        },\n        {\n          delay: delayMs,\n          priority: 'background',\n          signal: controller.signal,\n        },\n      )\n      .catch((error) => {\n        if (error instanceof DOMException && error.name === 'AbortError') {\n          return;\n        }\n\n        options.onError?.(error);\n      });\n  }\n\n  function scheduleGc(key: K, delayMs: number): void {\n    scheduleGcByHash(hash(key), delayMs);\n  }\n\n  function cancelGc(key: K): void {\n    cancelGcByHash(hash(key));\n  }\n\n  function touch(key: K, ttlMs: number): boolean {\n    const keyHash = hash(key);\n\n    if (!store.has(keyHash)) {\n      return false;\n    }\n\n    scheduleGcByHash(keyHash, ttlMs);\n\n    return true;\n  }\n\n  function* entries(): IterableIterator<[K, T]> {\n    for (const record of store.values()) {\n      yield [record.key, record.value];\n    }\n  }\n\n  return {\n    cancelGc,\n    clear,\n    delete: del,\n    entries,\n    get,\n    getEntry,\n    getOrSet,\n    scheduleGc,\n    set,\n    size,\n    touch,\n  };\n}\n"],"mappings":"0CAuDA,SAAgB,EAAmD,EAA0C,CAC3G,IAAM,EAAQ,IAAI,IACZ,EAAU,IAAI,IACd,EAAY,EAAQ,WAAa,IAAI,EAAA,UACrC,EAAO,EAAQ,KACjB,EAAU,EAEd,SAAS,EAAe,EAAuB,CAC7C,EAAQ,IAAI,EAAQ,EAAE,WAAW,OAAO,CACxC,EAAQ,OAAO,EAAQ,CAGzB,SAAS,EAAa,EAA0B,CAC9C,IAAM,EAAU,EAAM,IAAI,EAAQ,CAKlC,OAHA,EAAe,EAAQ,CACvB,EAAM,OAAO,EAAQ,CAEd,EAGT,SAAS,EAAI,EAAuB,CAClC,OAAO,EAAM,IAAI,EAAK,EAAI,CAAC,EAAE,MAG/B,SAAS,EAAS,EAAiE,CACjF,IAAM,EAAQ,EAAM,IAAI,EAAK,EAAI,CAAC,CAE7B,KAIL,MAAO,CAAE,KAAM,EAAM,KAAM,MAAO,EAAM,MAAO,CAGjD,SAAS,EAAI,EAAQ,EAAU,EAAoC,CACjE,IAAM,EAAU,EAAK,EAAI,CACnB,EAAW,EAAM,IAAI,EAAQ,CAEnC,EAAe,EAAQ,CACvB,EAAM,IAAI,EAAS,CACjB,MACA,KAAM,GAAW,SAAU,EAAU,EAAQ,KAAO,GAAU,KAC9D,QACD,CAAC,CAEE,GAAS,QAAU,IAAA,IACrB,EAAW,EAAK,EAAQ,MAAM,CAIlC,SAAS,EAAS,EAAQ,EAAkB,EAAiC,CAC3E,IAAM,EAAW,EAAS,EAAI,CAE9B,GAAI,EACF,OAAO,EAAS,MAGlB,IAAM,EAAQ,GAAS,CAIvB,OAFA,EAAI,EAAK,EAAO,EAAQ,CAEjB,EAGT,SAAS,EAAI,EAAiB,CAC5B,OAAO,EAAa,EAAK,EAAI,CAAC,CAGhC,SAAS,GAAc,CACrB,IAAK,IAAM,KAAQ,EAAQ,QAAQ,CAAE,EAAK,WAAW,OAAO,CAC5D,EAAM,OAAO,CACb,EAAQ,OAAO,CAGjB,SAAS,GAAe,CACtB,OAAO,EAAM,KAGf,SAAS,EAAiB,EAAiB,EAAuB,CAGhE,GAFA,EAAe,EAAQ,CAEnB,IAAY,IACd,OAGF,GAAI,CAAC,OAAO,SAAS,EAAQ,CAC3B,MAAU,UAAU,uDAAuD,CAG7E,GAAI,GAAW,EAAG,CAChB,EAAa,EAAQ,CAErB,OAGF,GAAI,CAAC,EAAM,IAAI,EAAQ,CACrB,OAGF,IAAM,EAAa,IAAI,gBACjB,EAAQ,EAAE,EAEhB,EAAQ,IAAI,EAAS,CAAE,aAAY,QAAO,CAAC,CACtC,EACF,aACO,CACJ,IAAM,EAAU,EAAQ,IAAI,EAAQ,CAEhC,CAAC,GAAW,EAAQ,QAAU,IAIlC,EAAQ,OAAO,EAAQ,CAEvB,EAAa,EAAQ,GAEvB,CACE,MAAO,EACP,SAAU,aACV,OAAQ,EAAW,OACpB,CACF,CACA,MAAO,GAAU,CACZ,aAAiB,cAAgB,EAAM,OAAS,cAIpD,EAAQ,UAAU,EAAM,EACxB,CAGN,SAAS,EAAW,EAAQ,EAAuB,CACjD,EAAiB,EAAK,EAAI,CAAE,EAAQ,CAGtC,SAAS,EAAS,EAAc,CAC9B,EAAe,EAAK,EAAI,CAAC,CAG3B,SAAS,EAAM,EAAQ,EAAwB,CAC7C,IAAM,EAAU,EAAK,EAAI,CAQzB,OANK,EAAM,IAAI,EAAQ,EAIvB,EAAiB,EAAS,EAAM,CAEzB,IALE,GAQX,SAAU,GAAoC,CAC5C,IAAK,IAAM,KAAU,EAAM,QAAQ,CACjC,KAAM,CAAC,EAAO,IAAK,EAAO,MAAM,CAIpC,MAAO,CACL,WACA,QACA,OAAQ,EACR,UACA,MACA,WACA,WACA,aACA,MACA,OACA,QACD"}

package/dist/object/stash.d.ts

@@ -0,0 +1,45 @@
+import { type SchedulerLike } from '../async';
+type CacheKey = readonly unknown[];
+export type CacheOptions<K extends CacheKey = CacheKey> = {
+    hash: (key: K) => string;
+    onError?: (error: unknown) => void;
+    scheduler?: Pick<SchedulerLike, 'postTask'>;
+};
+export type CacheSetOptions<M> = {
+    meta?: M;
+    ttlMs?: number;
+};
+export type Stash<T, K extends CacheKey = CacheKey, M = never> = {
+    cancelGc: (key: K) => void;
+    clear: () => void;
+    delete: (key: K) => boolean;
+    entries: () => IterableIterator<[K, T]>;
+    get: (key: K) => T | undefined;
+    getEntry: (key: K) => Readonly<{
+        meta: M | undefined;
+        value: T;
+    }> | undefined;
+    getOrSet: (key: K, factory: () => T, options?: CacheSetOptions<M>) => T;
+    scheduleGc: (key: K, delayMs: number) => void;
+    set: (key: K, value: T, options?: CacheSetOptions<M>) => void;
+    size: () => number;
+    touch: (key: K, ttlMs: number) => boolean;
+};
+/**
+ * Creates a generic key-value cache with automatic garbage collection and observer support.
+ *
+ * @example
+ * ```ts
+ * const myCache = stash<string>({ hash: (key) => JSON.stringify(key) });
+ * myCache.set(['user', 1], 'John Doe');
+ * const value = myCache.get(['user', 1]); // 'John Doe'
+ * myCache.scheduleGc(['user', 1], 5000); // Auto-delete after 5s
+ * ```
+ *
+ * @template T - The type of values stored in the cache.
+ *
+ * @returns A cache instance with get, set, delete, clear, and GC methods.
+ */
+export declare function stash<T, K extends CacheKey = CacheKey, M = never>(options: CacheOptions<K>): Stash<T, K, M>;
+export {};
+//# sourceMappingURL=stash.d.ts.map

package/dist/object/stash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stash.d.ts","sourceRoot":"","sources":["../../src/object/stash.ts"],"names":[],"mappings":"AAAA,OAAO,EAAa,KAAK,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzD,KAAK,QAAQ,GAAG,SAAS,OAAO,EAAE,CAAC;AAanC,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAAI;IACxD,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC;IACzB,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IACnC,SAAS,CAAC,EAAE,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;CAC7C,CAAC;AAEF,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI;IAC/B,IAAI,CAAC,EAAE,CAAC,CAAC;IACT,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,IAAI;IAC/D,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,CAAC;IAC3B,KAAK,EAAE,MAAM,IAAI,CAAC;IAClB,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IAC5B,OAAO,EAAE,MAAM,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,QAAQ,CAAC;QAAE,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,GAAG,SAAS,CAAC;IAC9E,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxE,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;IAC9C,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;IAC9D,IAAI,EAAE,MAAM,MAAM,CAAC;IACnB,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;CAC3C,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CA2K3G"}

package/dist/object/stash.js

@@ -0,0 +1,99 @@
+import { Scheduler as e } from "../async/scheduler.js";
+//#region src/object/stash.ts
+function t(t) {
+	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = t.scheduler ?? new e(), a = t.hash, o = 0;
+	function s(e) {
+		r.get(e)?.controller.abort(), r.delete(e);
+	}
+	function c(e) {
+		let t = n.has(e);
+		return s(e), n.delete(e), t;
+	}
+	function l(e) {
+		return n.get(a(e))?.value;
+	}
+	function u(e) {
+		let t = n.get(a(e));
+		if (t) return {
+			meta: t.meta,
+			value: t.value
+		};
+	}
+	function d(e, t, r) {
+		let i = a(e), o = n.get(i);
+		s(i), n.set(i, {
+			key: e,
+			meta: r && "meta" in r ? r.meta : o?.meta,
+			value: t
+		}), r?.ttlMs !== void 0 && _(e, r.ttlMs);
+	}
+	function f(e, t, n) {
+		let r = u(e);
+		if (r) return r.value;
+		let i = t();
+		return d(e, i, n), i;
+	}
+	function p(e) {
+		return c(a(e));
+	}
+	function m() {
+		for (let e of r.values()) e.controller.abort();
+		n.clear(), r.clear();
+	}
+	function h() {
+		return n.size;
+	}
+	function g(e, a) {
+		if (s(e), a === Infinity) return;
+		if (!Number.isFinite(a)) throw TypeError("stash.scheduleGc expects a finite number or Infinity");
+		if (a <= 0) {
+			c(e);
+			return;
+		}
+		if (!n.has(e)) return;
+		let l = new AbortController(), u = ++o;
+		r.set(e, {
+			controller: l,
+			token: u
+		}), i.postTask(() => {
+			let t = r.get(e);
+			!t || t.token !== u || (r.delete(e), c(e));
+		}, {
+			delay: a,
+			priority: "background",
+			signal: l.signal
+		}).catch((e) => {
+			e instanceof DOMException && e.name === "AbortError" || t.onError?.(e);
+		});
+	}
+	function _(e, t) {
+		g(a(e), t);
+	}
+	function v(e) {
+		s(a(e));
+	}
+	function y(e, t) {
+		let r = a(e);
+		return n.has(r) ? (g(r, t), !0) : !1;
+	}
+	function* b() {
+		for (let e of n.values()) yield [e.key, e.value];
+	}
+	return {
+		cancelGc: v,
+		clear: m,
+		delete: p,
+		entries: b,
+		get: l,
+		getEntry: u,
+		getOrSet: f,
+		scheduleGc: _,
+		set: d,
+		size: h,
+		touch: y
+	};
+}
+//#endregion
+export { t as stash };
+
+//# sourceMappingURL=stash.js.map

package/dist/object/stash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stash.js","names":[],"sources":["../../src/object/stash.ts"],"sourcesContent":["import { Scheduler, type SchedulerLike } from '../async';\n\ntype CacheKey = readonly unknown[];\n\ntype CacheRecord<K extends CacheKey, T, M> = {\n  key: K;\n  meta: M | undefined;\n  value: T;\n};\n\ntype GcTask = {\n  controller: AbortController;\n  token: number;\n};\n\nexport type CacheOptions<K extends CacheKey = CacheKey> = {\n  hash: (key: K) => string;\n  onError?: (error: unknown) => void;\n  scheduler?: Pick<SchedulerLike, 'postTask'>;\n};\n\nexport type CacheSetOptions<M> = {\n  meta?: M;\n  ttlMs?: number;\n};\n\nexport type Stash<T, K extends CacheKey = CacheKey, M = never> = {\n  cancelGc: (key: K) => void;\n  clear: () => void;\n  delete: (key: K) => boolean;\n  entries: () => IterableIterator<[K, T]>;\n  get: (key: K) => T | undefined;\n  getEntry: (key: K) => Readonly<{ meta: M | undefined; value: T }> | undefined;\n  getOrSet: (key: K, factory: () => T, options?: CacheSetOptions<M>) => T;\n  scheduleGc: (key: K, delayMs: number) => void;\n  set: (key: K, value: T, options?: CacheSetOptions<M>) => void;\n  size: () => number;\n  touch: (key: K, ttlMs: number) => boolean;\n};\n\n/**\n * Creates a generic key-value cache with automatic garbage collection and observer support.\n *\n * @example\n * ```ts\n * const myCache = stash<string>({ hash: (key) => JSON.stringify(key) });\n * myCache.set(['user', 1], 'John Doe');\n * const value = myCache.get(['user', 1]); // 'John Doe'\n * myCache.scheduleGc(['user', 1], 5000); // Auto-delete after 5s\n * ```\n *\n * @template T - The type of values stored in the cache.\n *\n * @returns A cache instance with get, set, delete, clear, and GC methods.\n */\nexport function stash<T, K extends CacheKey = CacheKey, M = never>(options: CacheOptions<K>): Stash<T, K, M> {\n  const store = new Map<string, CacheRecord<K, T, M>>();\n  const gcTasks = new Map<string, GcTask>();\n  const scheduler = options.scheduler ?? new Scheduler();\n  const hash = options.hash;\n  let gcToken = 0;\n\n  function cancelGcByHash(keyHash: string): void {\n    gcTasks.get(keyHash)?.controller.abort();\n    gcTasks.delete(keyHash);\n  }\n\n  function deleteByHash(keyHash: string): boolean {\n    const existed = store.has(keyHash);\n\n    cancelGcByHash(keyHash);\n    store.delete(keyHash);\n\n    return existed;\n  }\n\n  function get(key: K): T | undefined {\n    return store.get(hash(key))?.value;\n  }\n\n  function getEntry(key: K): Readonly<{ meta: M | undefined; value: T }> | undefined {\n    const entry = store.get(hash(key));\n\n    if (!entry) {\n      return undefined;\n    }\n\n    return { meta: entry.meta, value: entry.value };\n  }\n\n  function set(key: K, value: T, options?: CacheSetOptions<M>): void {\n    const keyHash = hash(key);\n    const existing = store.get(keyHash);\n\n    cancelGcByHash(keyHash);\n    store.set(keyHash, {\n      key,\n      meta: options && 'meta' in options ? options.meta : existing?.meta,\n      value,\n    });\n\n    if (options?.ttlMs !== undefined) {\n      scheduleGc(key, options.ttlMs);\n    }\n  }\n\n  function getOrSet(key: K, factory: () => T, options?: CacheSetOptions<M>): T {\n    const existing = getEntry(key);\n\n    if (existing) {\n      return existing.value;\n    }\n\n    const value = factory();\n\n    set(key, value, options);\n\n    return value;\n  }\n\n  function del(key: K): boolean {\n    return deleteByHash(hash(key));\n  }\n\n  function clear(): void {\n    for (const task of gcTasks.values()) task.controller.abort();\n    store.clear();\n    gcTasks.clear();\n  }\n\n  function size(): number {\n    return store.size;\n  }\n\n  function scheduleGcByHash(keyHash: string, delayMs: number): void {\n    cancelGcByHash(keyHash);\n\n    if (delayMs === Number.POSITIVE_INFINITY) {\n      return;\n    }\n\n    if (!Number.isFinite(delayMs)) {\n      throw new TypeError('stash.scheduleGc expects a finite number or Infinity');\n    }\n\n    if (delayMs <= 0) {\n      deleteByHash(keyHash);\n\n      return;\n    }\n\n    if (!store.has(keyHash)) {\n      return;\n    }\n\n    const controller = new AbortController();\n    const token = ++gcToken;\n\n    gcTasks.set(keyHash, { controller, token });\n    void scheduler\n      .postTask(\n        () => {\n          const current = gcTasks.get(keyHash);\n\n          if (!current || current.token !== token) {\n            return;\n          }\n\n          gcTasks.delete(keyHash);\n\n          deleteByHash(keyHash);\n        },\n        {\n          delay: delayMs,\n          priority: 'background',\n          signal: controller.signal,\n        },\n      )\n      .catch((error) => {\n        if (error instanceof DOMException && error.name === 'AbortError') {\n          return;\n        }\n\n        options.onError?.(error);\n      });\n  }\n\n  function scheduleGc(key: K, delayMs: number): void {\n    scheduleGcByHash(hash(key), delayMs);\n  }\n\n  function cancelGc(key: K): void {\n    cancelGcByHash(hash(key));\n  }\n\n  function touch(key: K, ttlMs: number): boolean {\n    const keyHash = hash(key);\n\n    if (!store.has(keyHash)) {\n      return false;\n    }\n\n    scheduleGcByHash(keyHash, ttlMs);\n\n    return true;\n  }\n\n  function* entries(): IterableIterator<[K, T]> {\n    for (const record of store.values()) {\n      yield [record.key, record.value];\n    }\n  }\n\n  return {\n    cancelGc,\n    clear,\n    delete: del,\n    entries,\n    get,\n    getEntry,\n    getOrSet,\n    scheduleGc,\n    set,\n    size,\n    touch,\n  };\n}\n"],"mappings":";;AAuDA,SAAgB,EAAmD,GAA0C;CAC3G,IAAM,oBAAQ,IAAI,KAAmC,EAC/C,oBAAU,IAAI,KAAqB,EACnC,IAAY,EAAQ,aAAa,IAAI,GAAW,EAChD,IAAO,EAAQ,MACjB,IAAU;CAEd,SAAS,EAAe,GAAuB;AAE7C,EADA,EAAQ,IAAI,EAAQ,EAAE,WAAW,OAAO,EACxC,EAAQ,OAAO,EAAQ;;CAGzB,SAAS,EAAa,GAA0B;EAC9C,IAAM,IAAU,EAAM,IAAI,EAAQ;AAKlC,SAHA,EAAe,EAAQ,EACvB,EAAM,OAAO,EAAQ,EAEd;;CAGT,SAAS,EAAI,GAAuB;AAClC,SAAO,EAAM,IAAI,EAAK,EAAI,CAAC,EAAE;;CAG/B,SAAS,EAAS,GAAiE;EACjF,IAAM,IAAQ,EAAM,IAAI,EAAK,EAAI,CAAC;AAE7B,QAIL,QAAO;GAAE,MAAM,EAAM;GAAM,OAAO,EAAM;GAAO;;CAGjD,SAAS,EAAI,GAAQ,GAAU,GAAoC;EACjE,IAAM,IAAU,EAAK,EAAI,EACnB,IAAW,EAAM,IAAI,EAAQ;AASnC,EAPA,EAAe,EAAQ,EACvB,EAAM,IAAI,GAAS;GACjB;GACA,MAAM,KAAW,UAAU,IAAU,EAAQ,OAAO,GAAU;GAC9D;GACD,CAAC,EAEE,GAAS,UAAU,KAAA,KACrB,EAAW,GAAK,EAAQ,MAAM;;CAIlC,SAAS,EAAS,GAAQ,GAAkB,GAAiC;EAC3E,IAAM,IAAW,EAAS,EAAI;AAE9B,MAAI,EACF,QAAO,EAAS;EAGlB,IAAM,IAAQ,GAAS;AAIvB,SAFA,EAAI,GAAK,GAAO,EAAQ,EAEjB;;CAGT,SAAS,EAAI,GAAiB;AAC5B,SAAO,EAAa,EAAK,EAAI,CAAC;;CAGhC,SAAS,IAAc;AACrB,OAAK,IAAM,KAAQ,EAAQ,QAAQ,CAAE,GAAK,WAAW,OAAO;AAE5D,EADA,EAAM,OAAO,EACb,EAAQ,OAAO;;CAGjB,SAAS,IAAe;AACtB,SAAO,EAAM;;CAGf,SAAS,EAAiB,GAAiB,GAAuB;AAGhE,MAFA,EAAe,EAAQ,EAEnB,MAAY,SACd;AAGF,MAAI,CAAC,OAAO,SAAS,EAAQ,CAC3B,OAAU,UAAU,uDAAuD;AAG7E,MAAI,KAAW,GAAG;AAChB,KAAa,EAAQ;AAErB;;AAGF,MAAI,CAAC,EAAM,IAAI,EAAQ,CACrB;EAGF,IAAM,IAAa,IAAI,iBAAiB,EAClC,IAAQ,EAAE;AAGX,EADL,EAAQ,IAAI,GAAS;GAAE;GAAY;GAAO,CAAC,EACtC,EACF,eACO;GACJ,IAAM,IAAU,EAAQ,IAAI,EAAQ;AAEhC,IAAC,KAAW,EAAQ,UAAU,MAIlC,EAAQ,OAAO,EAAQ,EAEvB,EAAa,EAAQ;KAEvB;GACE,OAAO;GACP,UAAU;GACV,QAAQ,EAAW;GACpB,CACF,CACA,OAAO,MAAU;AACZ,gBAAiB,gBAAgB,EAAM,SAAS,gBAIpD,EAAQ,UAAU,EAAM;IACxB;;CAGN,SAAS,EAAW,GAAQ,GAAuB;AACjD,IAAiB,EAAK,EAAI,EAAE,EAAQ;;CAGtC,SAAS,EAAS,GAAc;AAC9B,IAAe,EAAK,EAAI,CAAC;;CAG3B,SAAS,EAAM,GAAQ,GAAwB;EAC7C,IAAM,IAAU,EAAK,EAAI;AAQzB,SANK,EAAM,IAAI,EAAQ,IAIvB,EAAiB,GAAS,EAAM,EAEzB,MALE;;CAQX,UAAU,IAAoC;AAC5C,OAAK,IAAM,KAAU,EAAM,QAAQ,CACjC,OAAM,CAAC,EAAO,KAAK,EAAO,MAAM;;AAIpC,QAAO;EACL;EACA;EACA,QAAQ;EACR;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD"}

package/dist/random/draw.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("../function/assert.cjs"),r=require("../typed/isArray.cjs"),s=require("./random.cjs"),n=e=>{if(t.assert(r.isArray(e),r.IS_ARRAY_ERROR_MSG,{args:{array:e},type:TypeError}),e.length!==0)return e[s.random(0,e.length-1)]};exports.draw=n;
-//# sourceMappingURL=draw.cjs.map
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`),n=require(`./random.cjs`);var r=r=>{if(e.assert(t.isArray(r),t.IS_ARRAY_ERROR_MSG,{args:{array:r},type:TypeError}),r.length!==0)return r[n.random(0,r.length-1)]};exports.draw=r;
+//# sourceMappingURL=draw.cjs.map

package/dist/random/draw.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"draw.cjs","sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"names":["draw","array","assert","isArray","IS_ARRAY_ERROR_MSG","random"],"mappings":"sLAkBaA,EAAWC,GAA8B,CAGpD,GAFAC,EAAAA,OAAOC,EAAAA,QAAQF,CAAK,EAAGG,qBAAoB,CAAE,KAAM,CAAE,MAAAH,CAAA,EAAS,KAAM,UAAW,EAE3EA,EAAM,SAAW,EAErB,OAAOA,EAAMI,EAAAA,OAAO,EAAGJ,EAAM,OAAS,CAAC,CAAC,CAC1C"}
+{"version":3,"file":"draw.cjs","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"mappings":"sGAkBA,IAAa,EAAW,GAA8B,CACpD,KAAA,OAAO,EAAA,QAAQ,EAAM,CAAE,EAAA,mBAAoB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAE5E,EAAM,SAAW,EAErB,OAAO,EAAM,EAAA,OAAO,EAAG,EAAM,OAAS,EAAE"}

package/dist/random/draw.d.ts

@@ -0,0 +1,16 @@
+/**
+ * “Draw” a random item from an array.
+ *
+ * @example
+ * ```ts
+ * draw([1, 2, 3]) // 3
+ * ```
+ *
+ * @param array - The array to draw from.
+ *
+ * @returns A random item from the array or `undefined` if the array is empty.
+ *
+ * @throws {TypeError} If the provided array is not an array.
+ */
+export declare const draw: <T>(array: T[]) => T | undefined;
+//# sourceMappingURL=draw.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"draw.d.ts","sourceRoot":"","sources":["../../src/random/draw.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,OAAO,CAAC,EAAE,KAAG,CAAC,GAAG,SAMxC,CAAC"}

package/dist/random/draw.js

@@ -1,11 +1,14 @@
-import { assert as o } from "../function/assert.js";
-import { IS_ARRAY_ERROR_MSG as t, isArray as e } from "../typed/isArray.js";
-import { random as m } from "./random.js";
-const s = (r) => {
-  if (o(e(r), t, { args: { array: r }, type: TypeError }), r.length !== 0)
-    return r[m(0, r.length - 1)];
+import { assert as e } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as n } from "../typed/isArray.js";
+import { random as r } from "./random.js";
+//#region src/random/draw.ts
+var i = (i) => {
+	if (e(n(i), t, {
+		args: { array: i },
+		type: TypeError
+	}), i.length !== 0) return i[r(0, i.length - 1)];
 };
-export {
-  s as draw
-};
-//# sourceMappingURL=draw.js.map
+//#endregion
+export { i as draw };
+
+//# sourceMappingURL=draw.js.map

package/dist/random/draw.js.map

@@ -1 +1 @@
-{"version":3,"file":"draw.js","sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"names":["draw","array","assert","isArray","IS_ARRAY_ERROR_MSG","random"],"mappings":";;;AAkBO,MAAMA,IAAO,CAAIC,MAA8B;AAGpD,MAFAC,EAAOC,EAAQF,CAAK,GAAGG,GAAoB,EAAE,MAAM,EAAE,OAAAH,EAAA,GAAS,MAAM,WAAW,GAE3EA,EAAM,WAAW;AAErB,WAAOA,EAAMI,EAAO,GAAGJ,EAAM,SAAS,CAAC,CAAC;AAC1C;"}
+{"version":3,"file":"draw.js","names":[],"sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"mappings":";;;;AAkBA,IAAa,KAAW,MAA8B;AACpD,OAAO,EAAQ,EAAM,EAAE,GAAoB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC,EAE5E,EAAM,WAAW,EAErB,QAAO,EAAM,EAAO,GAAG,EAAM,SAAS,EAAE"}

package/dist/random/index.d.ts

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

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

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

package/dist/random/random.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../function/assert.cjs");function o(r,e){a.assert(r<=e,"Minimum value must be less than maximum value",{args:{max:e,min:r},type:RangeError});const t=crypto?crypto.getRandomValues(new Uint32Array(1))[0]/4294967295:Math.random();return Math.floor(t*(e-r+1))+r}exports.random=o;
-//# sourceMappingURL=random.cjs.map
+const e=require(`../function/assert.cjs`);function t(t,n){e.assert(t<=n,`Minimum value must be less than maximum value`,{args:{max:n,min:t},type:RangeError});let r=crypto.getRandomValues(new Uint32Array(1))[0]/4294967295;return Math.floor(r*(n-t+1))+t}exports.random=t;
+//# sourceMappingURL=random.cjs.map

package/dist/random/random.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"random.cjs","sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\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  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff : Math.random();\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"names":["random","min","max","assert","randomValue"],"mappings":"0HAcO,SAASA,EAAOC,EAAaC,EAAqB,CACvDC,EAAAA,OAAOF,GAAOC,EAAK,gDAAiD,CAAE,KAAM,CAAE,IAAAA,EAAK,IAAAD,CAAA,EAAO,KAAM,UAAA,CAAY,EAE5G,MAAMG,EAAc,OAAS,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,EAAI,WAAa,KAAK,OAAA,EAE/F,OAAO,KAAK,MAAMA,GAAeF,EAAMD,EAAM,EAAE,EAAIA,CACrD"}
+{"version":3,"file":"random.cjs","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\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  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff;\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"mappings":"0CAcA,SAAgB,EAAO,EAAa,EAAqB,CACvD,EAAA,OAAO,GAAO,EAAK,gDAAiD,CAAE,KAAM,CAAE,MAAK,MAAK,CAAE,KAAM,WAAY,CAAC,CAE7G,IAAM,EAAc,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC,CAAC,GAAK,WAEpE,OAAO,KAAK,MAAM,GAAe,EAAM,EAAM,GAAG,CAAG"}

package/dist/random/random.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Generates a random integer between two values, inclusive.
+ *
+ * @example
+ * ```ts
+ * random(1, 10); // a random integer between 1 and 10
+ * ```
+ *
+ * @param min - The minimum value.
+ * @param max - The maximum value.
+ * @returns A random integer between min and max.
+ */
+export declare function random(min: number, max: number): number;
+//# sourceMappingURL=random.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../../src/random/random.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAMvD"}

package/dist/random/random.js

@@ -1,10 +1,17 @@
-import { assert as o } from "../function/assert.js";
-function n(r, t) {
-  o(r <= t, "Minimum value must be less than maximum value", { args: { max: t, min: r }, type: RangeError });
-  const a = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 4294967295 : Math.random();
-  return Math.floor(a * (t - r + 1)) + r;
+import { assert as e } from "../function/assert.js";
+//#region src/random/random.ts
+function t(t, n) {
+	e(t <= n, "Minimum value must be less than maximum value", {
+		args: {
+			max: n,
+			min: t
+		},
+		type: RangeError
+	});
+	let r = crypto.getRandomValues(new Uint32Array(1))[0] / 4294967295;
+	return Math.floor(r * (n - t + 1)) + t;
 }
-export {
-  n as random
-};
-//# sourceMappingURL=random.js.map
+//#endregion
+export { t as random };
+
+//# sourceMappingURL=random.js.map

package/dist/random/random.js.map

@@ -1 +1 @@
-{"version":3,"file":"random.js","sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\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  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff : Math.random();\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"names":["random","min","max","assert","randomValue"],"mappings":";AAcO,SAASA,EAAOC,GAAaC,GAAqB;AACvD,EAAAC,EAAOF,KAAOC,GAAK,iDAAiD,EAAE,MAAM,EAAE,KAAAA,GAAK,KAAAD,EAAA,GAAO,MAAM,WAAA,CAAY;AAE5G,QAAMG,IAAc,SAAS,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,aAAa,KAAK,OAAA;AAE/F,SAAO,KAAK,MAAMA,KAAeF,IAAMD,IAAM,EAAE,IAAIA;AACrD;"}
+{"version":3,"file":"random.js","names":[],"sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\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  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff;\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"mappings":";;AAcA,SAAgB,EAAO,GAAa,GAAqB;AACvD,GAAO,KAAO,GAAK,iDAAiD;EAAE,MAAM;GAAE;GAAK;GAAK;EAAE,MAAM;EAAY,CAAC;CAE7G,IAAM,IAAc,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC,CAAC,KAAK;AAEpE,QAAO,KAAK,MAAM,KAAe,IAAM,IAAM,GAAG,GAAG"}

package/dist/random/shuffle.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("../function/assert.cjs"),o=require("../typed/isArray.cjs");function u(t){n.assert(o.isArray(t),o.IS_ARRAY_ERROR_MSG,{args:{array:t},type:TypeError});const e=[...t];for(let r=e.length-1;r>0;r--){const s=Math.floor(Math.random()*(r+1));[e[r],e[s]]=[e[s],e[r]]}return e}exports.shuffle=u;
-//# sourceMappingURL=shuffle.cjs.map
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`);function n(n){e.assert(t.isArray(n),t.IS_ARRAY_ERROR_MSG,{args:{array:n},type:TypeError});let r=[...n];for(let e=r.length-1;e>0;e--){let t=Math.floor(crypto.getRandomValues(new Uint32Array(1))[0]/4294967295*(e+1));[r[e],r[t]]=[r[t],r[e]]}return r}exports.shuffle=n;
+//# sourceMappingURL=shuffle.cjs.map

package/dist/random/shuffle.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle.cjs","sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"names":["shuffle","array","assert","isArray","IS_ARRAY_ERROR_MSG","result","i","j"],"mappings":"4JAkBO,SAASA,EAAWC,EAAiB,CAC1CC,EAAAA,OAAOC,EAAAA,QAAQF,CAAK,EAAGG,qBAAoB,CAAE,KAAM,CAAE,MAAAH,CAAA,EAAS,KAAM,UAAW,EAE/E,MAAMI,EAAS,CAAC,GAAGJ,CAAK,EAExB,QAASK,EAAID,EAAO,OAAS,EAAGC,EAAI,EAAGA,IAAK,CAC1C,MAAMC,EAAI,KAAK,MAAM,KAAK,UAAYD,EAAI,EAAE,EAC5C,CAACD,EAAOC,CAAC,EAAGD,EAAOE,CAAC,CAAC,EAAI,CAACF,EAAOE,CAAC,EAAGF,EAAOC,CAAC,CAAC,CAChD,CAEA,OAAOD,CACT"}
+{"version":3,"file":"shuffle.cjs","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor((crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff) * (i + 1));\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":"4EAkBA,SAAgB,EAAW,EAAiB,CAC1C,EAAA,OAAO,EAAA,QAAQ,EAAM,CAAE,EAAA,mBAAoB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAEhF,IAAM,EAAS,CAAC,GAAG,EAAM,CAEzB,IAAK,IAAI,EAAI,EAAO,OAAS,EAAG,EAAI,EAAG,IAAK,CAC1C,IAAM,EAAI,KAAK,MAAO,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC,CAAC,GAAK,YAAe,EAAI,GAAG,CAE5F,CAAC,EAAO,GAAI,EAAO,IAAM,CAAC,EAAO,GAAI,EAAO,GAAG,CAGjD,OAAO"}

package/dist/random/shuffle.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Shuffles an array randomly.
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, 4];
+ * shuffle(arr); // a shuffled version of the array
+ * ```
+ *
+ * @param array - The array to shuffle.
+ *
+ * @returns A new shuffled array.
+ *
+ * @throws {TypeError} If the provided array is not an array.
+ */
+export declare function shuffle<T>(array: T[]): T[];
+//# sourceMappingURL=shuffle.d.ts.map