@vielzeug/toolkit 1.1.2 → 2.0.0

package/dist/toolkit.js

@@ -0,0 +1,1523 @@
+//#region src/function/assert.ts
+function e(e, t = "Assertion failed", { args: n, bypass: r = !1, type: i = Error } = {}) {
+	if (e) return;
+	let a = `${t}${n ? `\nArguments: ${JSON.stringify(n, null, 2)}` : ""}`;
+	if (r) console.warn(a);
+	else throw new i(a);
+}
+function t(t, n = "Assertion failed", r = {}) {
+	e(t.every(Boolean), n, r);
+}
+//#endregion
+//#region src/typed/isArray.ts
+function n(e) {
+	return Array.isArray(e);
+}
+var r = "Expected an array";
+//#endregion
+//#region src/typed/isString.ts
+function i(e) {
+	return typeof e == "string";
+}
+var a = "Expected a string";
+//#endregion
+//#region src/array/chunk.ts
+function o(t, r = 2, a = {}) {
+	e(n(t) || i(t), "Argument must be an array or string.", {
+		args: { input: t },
+		type: TypeError
+	}), e(r >= 1, "Chunk size must be at least 1.", {
+		args: { size: r },
+		type: RangeError
+	});
+	let { overlap: o = !1, pad: s = " " } = a;
+	if (i(t) && o) {
+		let e = s + t + s, n = e.length - r + 1;
+		return Array.from({ length: n }, (t, n) => e.slice(n, n + r));
+	}
+	return Array.from({ length: Math.ceil(t.length / r) }, (e, n) => t.slice(n * r, n * r + r));
+}
+//#endregion
+//#region src/typed/isEqual.ts
+function s(e, t) {
+	return c(e, t, /* @__PURE__ */ new WeakMap());
+}
+function c(e, t, n) {
+	if (e === t) return !0;
+	if (e == null || t == null || typeof e != typeof t || typeof e != "object" || typeof t != "object") return !1;
+	if (n.has(e)) return n.get(e) === t;
+	if (n.set(e, t), Array.isArray(e) || Array.isArray(t)) return !Array.isArray(e) || !Array.isArray(t) || e.length !== t.length ? !1 : e.every((e, r) => c(e, t[r], n));
+	if (e instanceof Date && t instanceof Date) return e.getTime() === t.getTime();
+	if (e instanceof Map && t instanceof Map) {
+		if (e.size !== t.size) return !1;
+		for (let [r, i] of e) if (!t.has(r) || !c(i, t.get(r), n)) return !1;
+		return !0;
+	}
+	if (e instanceof Set && t instanceof Set) {
+		if (e.size !== t.size) return !1;
+		for (let r of e) if (![...t].some((e) => c(r, e, n))) return !1;
+		return !0;
+	}
+	let r = Object.keys(e), i = Object.keys(t);
+	if (r.length !== i.length) return !1;
+	for (let i of r) if (!Object.hasOwn(t, i) || !c(e[i], t[i], n)) return !1;
+	return !0;
+}
+//#endregion
+//#region src/array/contains.ts
+function l(t, i) {
+	return e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	}), t.some((e) => s(e, i));
+}
+//#endregion
+//#region src/array/fold.ts
+function u(t, i) {
+	e(n(t), r, {
+		args: {
+			array: t,
+			callback: i
+		},
+		type: TypeError
+	});
+	let a = t[0];
+	for (let e = 1; e < t.length; e++) a = i(a, t[e]);
+	return a;
+}
+//#endregion
+//#region src/array/group.ts
+function d(t, i) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let a = {}, o = typeof i == "function" ? i : (e) => e[i];
+	for (let e of t) {
+		let t = o(e), n = t == null ? "_" : String(t);
+		a[n] || (a[n] = []), a[n].push(e);
+	}
+	return a;
+}
+//#endregion
+//#region src/array/keyBy.ts
+function f(t, i) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let a = {}, o = typeof i == "function" ? i : (e) => e[i];
+	for (let e of t) {
+		let t = String(o(e));
+		a[t] = e;
+	}
+	return a;
+}
+//#endregion
+//#region src/string/similarity.ts
+function p(e, t) {
+	let n = e.toLowerCase(), r = t.toLowerCase();
+	if (n === r) return 1;
+	if (n.length === 0) return r.length === 0 ? 1 : 0;
+	if (r.length === 0) return 0;
+	let [i, a] = n.length < r.length ? [n, r] : [r, n], o = i.length, s = a.length, c = Array.from({ length: o + 1 }, (e, t) => t), l = Array(o + 1);
+	for (let e = 1; e <= s; e++) {
+		l[0] = e;
+		for (let t = 1; t <= o; t++) {
+			let n = a[e - 1] === i[t - 1] ? 0 : 1;
+			l[t] = Math.min(l[t - 1] + 1, c[t] + 1, c[t - 1] + n);
+		}
+		[c, l] = [l, c];
+	}
+	return 1 - c[o] / Math.max(n.length, r.length);
+}
+//#endregion
+//#region src/typed/isNil.ts
+function m(e) {
+	return e == null;
+}
+//#endregion
+//#region src/typed/isNumber.ts
+function h(e) {
+	return typeof e == "number" && !Number.isNaN(e);
+}
+var g = "Expected a number";
+//#endregion
+//#region src/typed/isObject.ts
+function _(e) {
+	return typeof e == "object" && !!e && !Array.isArray(e);
+}
+var v = "Expected an object";
+//#endregion
+//#region src/typed/isWithin.ts
+function y(e, t, n, r = !0) {
+	return !h(e) || !h(t) || !h(n) ? !1 : r ? e >= t && e <= n : e > t && e < n;
+}
+var b = "Expected a number within a specified range";
+//#endregion
+//#region src/object/seek.ts
+function x(e, t, r) {
+	return m(e) ? !1 : i(e) || h(e) ? p(String(e), t) >= r : n(e) ? e.some((e) => x(e, t, r)) : _(e) ? Object.values(e).some((e) => m(e) ? !1 : x(e, t, r)) : !1;
+}
+function S(t, n, r = 1) {
+	return e(y(r, 0, 1), b, {
+		args: {
+			max: 1,
+			min: 0,
+			tone: r
+		},
+		type: TypeError
+	}), x(t, n, r);
+}
+//#endregion
+//#region src/array/search.ts
+function C(t, n, r = .25) {
+	if (e(i(n), a, {
+		args: { query: n },
+		type: TypeError
+	}), e(y(r, 0, 1), b, {
+		args: {
+			max: 1,
+			min: 0,
+			tone: r
+		},
+		type: TypeError
+	}), !n) return [...t];
+	let o = n.toLowerCase();
+	return t.filter((e) => S(e, o, r));
+}
+//#endregion
+//#region src/array/list.ts
+function w(e, t = {}) {
+	let n = /* @__PURE__ */ new Set(), r = {
+		debounceMs: 300,
+		limit: 10,
+		searchTone: .5
+	}, i = [...e], a = Math.max(1, t.limit ?? r.limit), o = t.filterFn ?? (() => !0), s = t.sortFn, c = t.searchFn ?? ((e, t, n) => C([...e], t, n)), l = t.searchTone ?? r.searchTone, u = "", d = 0, f = [], p = () => {
+		for (let e of n) e();
+	}, m = () => {
+		let e = i;
+		u && (e = c(e, u, l)), o && (e = e.filter(o)), e = s ? [...e].sort(s) : [...e];
+		let t = Math.max(1, Math.ceil(e.length / a));
+		d = Math.min(d, t - 1), f = e;
+	}, h = () => {
+		if (!f.length) return [];
+		let e = d * a;
+		return f.slice(e, e + a);
+	}, g = () => {
+		m(), p();
+	}, _, v = (e, t) => {
+		_ && clearTimeout(_), _ = setTimeout(() => {
+			u = e, _ = void 0, g();
+		}, t);
+	};
+	return m(), {
+		batch(e) {
+			let t = a, n = o, r = s, c = u, l = i, p = d, m = (e, t, n) => Math.max(0, Math.min(e, Math.max(0, Math.ceil(t / n) - 1)));
+			e({
+				goTo: (e) => {
+					p = m(e - 1, f.length, t);
+				},
+				setData: (e) => {
+					l = [...e], p = 0;
+				},
+				setFilter: (e) => {
+					n = e;
+				},
+				setLimit: (e) => {
+					t = Math.max(1, e);
+				},
+				setQuery: (e) => {
+					c = e, p = 0;
+				},
+				setSort: (e) => {
+					r = e;
+				}
+			}), a = t, o = n, s = r, u = c, i = l, d = p, g();
+		},
+		get current() {
+			return h();
+		},
+		goTo(e) {
+			let t = Math.max(1, Math.ceil(f.length / a));
+			d = Math.max(0, Math.min(e - 1, t - 1)), p();
+		},
+		get meta() {
+			let e = f.length, t = Math.max(1, Math.ceil(e / a)), n = e === 0, r = Math.min(d + 1, t), i = n ? 0 : (r - 1) * a + 1;
+			return {
+				end: n ? 0 : Math.min(r * a, e),
+				isEmpty: n,
+				isFirst: r <= 1,
+				isLast: r >= t,
+				limit: a,
+				page: r,
+				pages: t,
+				start: i,
+				total: e
+			};
+		},
+		next() {
+			let e = Math.max(1, Math.ceil(f.length / a));
+			d < e - 1 && (d++, p());
+		},
+		prev() {
+			d > 0 && (d--, p());
+		},
+		reset() {
+			a = Math.max(1, t.limit ?? r.limit), o = t.filterFn ?? (() => !0), s = t.sortFn, u = "", d = 0, g();
+		},
+		search(e, n) {
+			n?.immediate ? (u = e, d = 0, g()) : v(e, t.debounceMs ?? r.debounceMs);
+		},
+		setData(e) {
+			i = [...e], d = 0, g();
+		},
+		setFilter(e) {
+			o = e, d = 0, g();
+		},
+		setLimit(e) {
+			a = Math.max(1, e), d = 0, g();
+		},
+		setSort(e) {
+			s = e, g();
+		},
+		subscribe(e) {
+			return n.add(e), () => n.delete(e);
+		}
+	};
+}
+//#endregion
+//#region src/array/pick.ts
+function T(t, i, a) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let o = a ?? ((e) => !m(e));
+	for (let e = 0; e < t.length; e++) if (o(t[e], e, t)) return i(t[e], e, t);
+}
+//#endregion
+//#region src/array/remoteList.ts
+function ee(e) {
+	let t = /* @__PURE__ */ new Set(), n = Math.max(1, e.limit ?? 10), r = e.debounceMs ?? 300, i = 1, a = n, o = "", s = e.initialFilter, c = e.initialSort, l = [], u = 0, d = !1, f = null, p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map(), h = (e) => JSON.stringify(e), g = () => ({
+		filter: s,
+		limit: a,
+		page: i,
+		search: o || void 0,
+		sort: c
+	}), _ = (e) => {
+		l = e.items, u = e.total ?? 0;
+		let t = Math.max(1, Math.ceil(u / a));
+		i = Math.min(Math.max(1, i), t);
+	}, v = () => {
+		for (let e of t) e();
+	}, y = async (t) => {
+		let n = h(t), r = p.get(n), i = e.cacheTtl;
+		if (r && (!i || Date.now() - r.ts < i)) {
+			_(r.result);
+			return;
+		}
+		if (m.has(n)) {
+			await m.get(n), _(p.get(n).result);
+			return;
+		}
+		d = !0, f = null, v();
+		let a = e.fetch(t).then((e) => {
+			p.set(n, {
+				result: e,
+				ts: Date.now()
+			}), _(e);
+		}).catch((e) => {
+			f = e?.message ?? "Request failed", l = [], u = 0;
+		}).finally(() => {
+			m.delete(n), d = !1, v();
+		});
+		m.set(n, a), await a;
+	}, b = async () => {
+		await y(g());
+	}, x, S = () => {
+		x && clearTimeout(x), x = setTimeout(() => {
+			x = void 0, b();
+		}, r);
+	};
+	return {
+		async batch(e) {
+			let t = i, n = a, r = o, l = s, u = c;
+			e({
+				goTo: (e) => {
+					t = Math.max(1, e | 0);
+				},
+				setFilter: (e) => {
+					l = e, t = 1;
+				},
+				setLimit: (e) => {
+					n = Math.max(1, e), t = 1;
+				},
+				setQuery: (e) => {
+					r = e, t = 1;
+				},
+				setSort: (e) => {
+					u = e, t = 1;
+				}
+			}), i = t, a = n, o = r, s = l, c = u, await b();
+		},
+		get current() {
+			return l;
+		},
+		async goTo(e) {
+			i = Math.max(1, e | 0), await b();
+		},
+		invalidate() {
+			p.clear();
+		},
+		get meta() {
+			let e = u === 0, t = Math.max(1, Math.ceil(u / a)), n = Math.min(i, t), r = e ? 0 : (n - 1) * a + 1;
+			return {
+				end: e ? 0 : Math.min(n * a, u),
+				error: f,
+				isEmpty: e,
+				isFirst: n <= 1,
+				isLast: n >= t,
+				limit: a,
+				loading: d,
+				page: n,
+				pages: t,
+				start: r,
+				total: u
+			};
+		},
+		async next() {
+			i += 1, await b();
+		},
+		async prev() {
+			i = Math.max(1, i - 1), await b();
+		},
+		async refresh() {
+			p.delete(h(g())), await b();
+		},
+		async reset() {
+			i = 1, a = n, o = "", s = e.initialFilter, c = e.initialSort, p.clear(), await b();
+		},
+		async search(e, t) {
+			o = e, i = 1, t?.immediate ? await b() : S();
+		},
+		async setFilter(e) {
+			s = e, i = 1, await b();
+		},
+		async setLimit(e) {
+			a = Math.max(1, e), i = 1, await b();
+		},
+		async setSort(e) {
+			c = e, i = 1, await b();
+		},
+		subscribe(e) {
+			return t.add(e), t.size === 1 && l.length === 0 && !d && b(), () => t.delete(e);
+		}
+	};
+}
+//#endregion
+//#region src/array/replace.ts
+function te(t, i, a) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let o = t.findIndex(i);
+	return o === -1 ? t : [
+		...t.slice(0, o),
+		a,
+		...t.slice(o + 1)
+	];
+}
+//#endregion
+//#region src/array/rotate.ts
+function ne(t, i, { wrap: a = !1 } = {}) {
+	if (e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	}), e(h(i), g, {
+		args: { positions: i },
+		type: TypeError
+	}), t.length === 0) return t;
+	let o = (i % t.length + t.length) % t.length, s = t.slice(o);
+	return a ? [...s, ...t.slice(0, o)] : s;
+}
+//#endregion
+//#region src/array/select.ts
+function re(t, i, a) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let o = a ?? ((e) => !m(e)), s = [];
+	for (let e = 0; e < t.length; e++) o(t[e], e, t) && s.push(i(t[e], e, t));
+	return s;
+}
+//#endregion
+//#region src/function/compare.ts
+var E = (e, t) => {
+	if (e === t) return 0;
+	if (e === void 0) return 1;
+	if (t === void 0) return -1;
+	if (e === null) return t === null ? 0 : -1;
+	if (t === null) return 1;
+	if (typeof e == "string" && typeof t == "string") return e.localeCompare(t);
+	if (typeof e == "number" && typeof t == "number") return e === t ? 0 : e > t ? 1 : -1;
+	if (e instanceof Date && t instanceof Date) {
+		let n = e.getTime(), r = t.getTime();
+		return n === r ? 0 : n > r ? 1 : -1;
+	}
+	if (typeof e == "object" && typeof t == "object") {
+		let n = JSON.stringify(e), r = JSON.stringify(t);
+		return n.localeCompare(r);
+	}
+	return String(e).localeCompare(String(t));
+}, D = (e) => {
+	let t = Object.entries(e);
+	return (e, n) => {
+		for (let [r, i] of t) {
+			let t = e[r], a = n[r], o = i === "desc" ? -1 : 1, s = E(t, a);
+			if (s !== 0) return s * o;
+		}
+		return 0;
+	};
+};
+//#endregion
+//#region src/array/sort.ts
+function O(t, i, a = "asc") {
+	if (e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	}), typeof i == "function") {
+		let e = a === "desc" ? -1 : 1;
+		return [...t].sort((t, n) => E(i(t), i(n)) * e);
+	}
+	return [...t].sort(D(i));
+}
+//#endregion
+//#region src/array/toggle.ts
+function k(e, t, n, r = {}) {
+	let { strategy: i = "append" } = r, a = n ? (e) => n(e) === n(t) : (e) => e === t, o = e.findIndex(a);
+	return o === -1 ? i === "prepend" ? [t, ...e] : [...e, t] : [...e.slice(0, o), ...e.slice(o + 1)];
+}
+//#endregion
+//#region src/array/uniq.ts
+function ie(t, i) {
+	if (e(n(t), r, { type: TypeError }), t.length <= 1) return [...t];
+	if (!i) return [...new Set(t)];
+	let a = /* @__PURE__ */ new Set(), o = typeof i == "function" ? i : (e) => e[i];
+	return t.filter((e) => {
+		let t = o(e);
+		return a.has(t) ? !1 : (a.add(t), !0);
+	});
+}
+//#endregion
+//#region src/async/predict.ts
+function ae(e, t = {}) {
+	let { signal: n, timeout: r = 7e3 } = t, i = n ? AbortSignal.any([AbortSignal.timeout(r), n]) : AbortSignal.timeout(r);
+	return Promise.race([e(i), new Promise((e, t) => {
+		i.addEventListener("abort", () => t(i.reason), { once: !0 });
+	})]);
+}
+//#endregion
+//#region src/async/sleep.ts
+async function A(t) {
+	return e(typeof t == "number" && t >= 0 && Number.isFinite(t), "Timeout must be a non-negative finite number", {
+		args: { timeout: t },
+		type: TypeError
+	}), new Promise((e) => setTimeout(e, t));
+}
+//#endregion
+//#region src/async/retry.ts
+async function j(e, { backoff: t = 1, delay: n = 250, retryDelay: r, shouldRetry: i, signal: a, times: o = 3 } = {}) {
+	let s = n;
+	for (let n = 1; n <= o; n++) {
+		if (a?.aborted) throw a.reason ?? new DOMException("Retry aborted", "AbortError");
+		try {
+			return await e();
+		} catch (e) {
+			if (n === o || i && !i(e, n - 1)) throw e;
+			let a = r ? r(n - 1) : s;
+			a > 0 && await A(a), r || (s = typeof t == "function" ? t(n, s) : s * t);
+		}
+	}
+	throw Error("Retry failed unexpectedly");
+}
+//#endregion
+//#region src/async/attempt.ts
+async function oe(e, { onError: t, timeout: n = 7e3, times: r = 3 } = {}) {
+	try {
+		return {
+			ok: !0,
+			value: await j(() => ae(() => e(), { timeout: n }), { times: r })
+		};
+	} catch (e) {
+		return t?.(e), {
+			error: e,
+			ok: !1
+		};
+	}
+}
+//#endregion
+//#region src/async/defer.ts
+function se() {
+	let { promise: e, reject: t, resolve: n } = Promise.withResolvers();
+	return {
+		promise: e,
+		reject: t,
+		resolve: n
+	};
+}
+//#endregion
+//#region src/async/parallel.ts
+async function ce(e, t, n, r) {
+	if (e < 1) throw Error("Limit must be at least 1");
+	if (r?.aborted) throw new DOMException("Aborted", "AbortError");
+	let i = Array(t.length), a = 0, o = !1, s, c = async () => {
+		for (; a < t.length && !o;) {
+			if (r?.aborted) {
+				o = !0, s = new DOMException("Aborted", "AbortError");
+				break;
+			}
+			let e = a++;
+			try {
+				i[e] = await n(t[e], e, t);
+			} catch (e) {
+				o = !0, s = e;
+				break;
+			}
+		}
+	}, l = [], u = Math.min(e, t.length);
+	for (let e = 0; e < u; e++) l.push(c());
+	if (await Promise.all(l), o) throw s;
+	return i;
+}
+//#endregion
+//#region src/async/scheduler.ts
+function le() {
+	return { postTask: (e, t) => {
+		let n = t?.delay ?? 0, r = t?.signal;
+		return new Promise((t, i) => {
+			if (r?.aborted) {
+				i(r.reason);
+				return;
+			}
+			let a = setTimeout(() => {
+				r?.removeEventListener("abort", o);
+				try {
+					t(e());
+				} catch (e) {
+					i(e);
+				}
+			}, n), o = () => {
+				clearTimeout(a), i(r.reason);
+			};
+			r?.addEventListener("abort", o, { once: !0 });
+		});
+	} };
+}
+function M() {
+	"scheduler" in globalThis || Object.defineProperty(globalThis, "scheduler", {
+		configurable: !0,
+		value: le(),
+		writable: !0
+	});
+}
+var N = class {
+	#e;
+	constructor() {
+		globalThis.scheduler === void 0 && M(), this.#e = globalThis.scheduler;
+	}
+	postTask(e, t) {
+		return this.#e.postTask(e, t);
+	}
+};
+//#endregion
+//#region src/async/pool.ts
+function ue(t) {
+	e(t >= 1, "Pool limit must be at least 1", {
+		args: { limit: t },
+		type: RangeError
+	});
+	let n = 0, r = [], i = () => {
+		r.length > 0 && n < t && r.shift()?.();
+	};
+	return async (e) => {
+		for (; n >= t;) await new Promise((e) => r.push(e));
+		n++;
+		try {
+			return await e();
+		} finally {
+			n--, i();
+		}
+	};
+}
+//#endregion
+//#region src/async/queue.ts
+function de(t = {}) {
+	let { concurrency: n = 1 } = t;
+	e(n >= 1, "Concurrency must be at least 1", {
+		args: { concurrency: n },
+		type: RangeError
+	});
+	let r = 0, i = null, a = null, o = [], s = !1, c = () => {
+		s || (s = !0, new N().postTask(() => {
+			s = !1, l();
+		}, { priority: "user-visible" }));
+	}, l = () => {
+		if (r < n && o.length > 0) {
+			let e = o.shift();
+			r++, e.fn().then(e.resolve).catch(e.reject).finally(() => {
+				r--, c(), r === 0 && o.length === 0 && a && (a(), i = null, a = null);
+			});
+		}
+	};
+	return {
+		add: (e) => {
+			let { promise: t, reject: n, resolve: r } = Promise.withResolvers();
+			return o.push({
+				fn: e,
+				reject: n,
+				resolve: r
+			}), c(), t;
+		},
+		clear: () => {
+			o.length = 0;
+		},
+		onIdle: () => {
+			if (r === 0 && o.length === 0) return Promise.resolve();
+			if (!i) {
+				let e = Promise.withResolvers();
+				i = e.promise, a = e.resolve;
+			}
+			return i;
+		},
+		get pending() {
+			return r;
+		},
+		get size() {
+			return o.length;
+		}
+	};
+}
+//#endregion
+//#region src/async/race.ts
+async function fe(e, t) {
+	let n = new Promise((e) => setTimeout(e, t)), r = await e;
+	return await n, r;
+}
+//#endregion
+//#region src/async/waitFor.ts
+async function pe(e, t = {}) {
+	let { interval: n = 100, signal: r, timeout: i = 5e3 } = t, a = AbortSignal.timeout(i), o = r ? AbortSignal.any([r, a]) : a;
+	return o.throwIfAborted(), new Promise((t, r) => {
+		let i = null, a = () => {
+			i !== null && (clearTimeout(i), i = null), o.removeEventListener("abort", s);
+		}, s = () => {
+			a(), r(o.reason);
+		}, c = async () => {
+			try {
+				if (o.aborted) {
+					a(), r(o.reason);
+					return;
+				}
+				if (await e()) {
+					a(), t();
+					return;
+				}
+				i = setTimeout(c, n);
+			} catch (e) {
+				a(), r(e);
+			}
+		};
+		o.addEventListener("abort", s, { once: !0 }), c();
+	});
+}
+//#endregion
+//#region src/date/expires.ts
+function me(e, t = 7) {
+	let n = typeof e == "string" ? new Date(e) : e, r = n.getTime();
+	if (Number.isNaN(r)) return "UNKNOWN";
+	if (n.getFullYear() >= 9999) return "NEVER";
+	let i = r - Date.now();
+	return i <= 0 ? "EXPIRED" : i <= t * 24 * 60 * 60 * 1e3 ? "SOON" : "LATER";
+}
+//#endregion
+//#region src/typed/isDate.ts
+function P(e) {
+	return e instanceof Date && !Number.isNaN(e.getTime());
+}
+//#endregion
+//#region src/date/interval.ts
+function F(e, n, { interval: r = "day", latest: i = !1, steps: a = 1 } = {}) {
+	let o = new Date(e), s = new Date(n);
+	t([P(o), P(s)], "Invalid date format. Use a valid Date object or ISO string.", {
+		args: {
+			end: n,
+			start: e
+		},
+		type: TypeError
+	});
+	let c = [], l = new Date(I(o, r, 0));
+	for (; l <= s;) c.push(l), l = new Date(I(l, r, a));
+	return i && c.length > 0 && c[c.length - 1] < s && c.push(s), c;
+}
+function I(e, t, n) {
+	let r = e.getFullYear(), i = e.getMonth(), a = e.getDate();
+	switch (t) {
+		case "day": return new Date(Date.UTC(r, i, a + n));
+		case "month": return new Date(Date.UTC(r, i + n, a));
+		case "monthEnd": return new Date(Date.UTC(r, i + n + 1, 0));
+		case "monthStart": return new Date(Date.UTC(r, i + n, 1));
+		case "week": return new Date(Date.UTC(r, i, a + 7 * n));
+		case "year": return new Date(Date.UTC(r + n, i, a));
+		case "yearEnd": return new Date(Date.UTC(r + n, 11, 31));
+		case "yearStart": return new Date(Date.UTC(r + n, 0, 1));
+	}
+}
+//#endregion
+//#region src/date/timeDiff.ts
+var L = [
+	"year",
+	"month",
+	"week",
+	"day",
+	"hour",
+	"minute",
+	"second"
+], R = 1e3, z = 60 * R, B = 60 * z, V = 24 * B, he = 7 * V, ge = 30 * V, _e = [
+	{
+		ms: 365 * V,
+		unit: "year"
+	},
+	{
+		ms: ge,
+		unit: "month"
+	},
+	{
+		ms: he,
+		unit: "week"
+	},
+	{
+		ms: V,
+		unit: "day"
+	},
+	{
+		ms: B,
+		unit: "hour"
+	},
+	{
+		ms: z,
+		unit: "minute"
+	},
+	{
+		ms: R,
+		unit: "second"
+	}
+];
+function ve(e, t = /* @__PURE__ */ new Date(), n = L) {
+	let r = typeof e == "string" ? Date.parse(e) : e.getTime(), i = typeof t == "string" ? Date.parse(t) : t.getTime();
+	if (Number.isNaN(r) || Number.isNaN(i)) return;
+	let a = _e.filter((e) => n.includes(e.unit)), o = Math.abs(r - i), s = a[a.length - 1]?.unit ?? "second";
+	if (o <= 0) return {
+		unit: s,
+		value: 0
+	};
+	let c = a.find((e) => o >= e.ms);
+	return c ? {
+		unit: c.unit,
+		value: Math.floor(o / c.ms)
+	} : {
+		unit: s,
+		value: 0
+	};
+}
+//#endregion
+//#region src/function/assertParams.ts
+function ye(t, n, r, i = {}) {
+	e(!!t, "Missing parameters object", i);
+	let a = n.filter((e) => t[e] === void 0 || t[e] === null);
+	if (a.length > 0) {
+		let t = r ? ` in "${r}"` : "", n = a.map((e) => `"${String(e)}"`).join(", ");
+		e(!1, `Missing required parameter${a.length > 1 ? "s" : ""}: ${n}${t}`, i);
+	}
+}
+//#endregion
+//#region src/function/compose.ts
+function be(...t) {
+	e(t.length > 0, "compose requires at least one function", { args: { fns: t } });
+	let n = t[t.length - 1], r = t.slice(0, -1);
+	return ((...e) => r.reduceRight((e, t) => t(e), n(...e)));
+}
+//#endregion
+//#region src/function/curry.ts
+function xe(e, t = e.length) {
+	let n = (...r) => r.length >= t ? e(...r) : (...e) => n(...r, ...e);
+	return n;
+}
+//#endregion
+//#region src/function/debounce.ts
+function Se(t, n = 300) {
+	e(typeof t == "function", "First argument must be a function", {
+		args: { fn: t },
+		type: TypeError
+	}), e(typeof n == "number" && n >= 0, "Delay must be a non-negative number", {
+		args: { delay: n },
+		type: TypeError
+	});
+	let r, i, a, o = () => {
+		r !== void 0 && (r.abort(), r = void 0);
+	}, s = () => {
+		let e = new AbortController(), t = new N();
+		r = e, t.postTask(c, {
+			delay: n,
+			priority: "user-visible",
+			signal: e.signal
+		}).catch(() => {});
+	}, c = () => {
+		if (o(), !i) return;
+		let e = i, n = a;
+		return i = void 0, a = void 0, t.apply(n, e);
+	}, l = function(...e) {
+		i = e, a = this, o(), s();
+	};
+	return l.cancel = () => {
+		o(), i = void 0, a = void 0;
+	}, l.flush = () => c(), l.pending = () => r !== void 0, l;
+}
+//#endregion
+//#region src/function/fp.ts
+var Ce = (e, ...t) => (n) => e(n, ...t);
+//#endregion
+//#region src/function/memo.ts
+function we(e, { maxSize: t, resolver: n, ttl: r } = {}) {
+	let i = /* @__PURE__ */ new Map(), a = (e) => n ? n(...e) : JSON.stringify(e, (e, t) => t === void 0 ? "__undefined__" : t);
+	return (...n) => {
+		let o = a(n), s = Date.now(), c = i.get(o);
+		if (c && (!r || s - c.timestamp < r)) return i.delete(o), i.set(o, c), c.value;
+		let l = e(...n);
+		return i.set(o, {
+			timestamp: s,
+			value: l
+		}), l instanceof Promise && l.catch(() => i.delete(o)), t && i.size > t && i.delete(i.keys().next().value), l;
+	};
+}
+//#endregion
+//#region src/function/once.ts
+var Te = (e) => {
+	let t, n = !1, r = ((...r) => (n ||= (t = e(...r), !0), t));
+	return r.reset = () => {
+		t = void 0, n = !1;
+	}, r;
+};
+//#endregion
+//#region src/function/pipe.ts
+function Ee(...t) {
+	e(t.length > 0, "pipe requires at least one function", { args: { fns: t } });
+	let [n, ...r] = t;
+	return ((...e) => r.reduce((e, t) => t(e), n(...e)));
+}
+//#endregion
+//#region src/function/throttle.ts
+function De(t, n = 700, r = {
+	leading: !0,
+	trailing: !1
+}) {
+	e(typeof t == "function", "First argument must be a function", {
+		args: { fn: t },
+		type: TypeError
+	}), e(typeof n == "number" && n >= 0, "Delay must be a non-negative number", {
+		args: { delay: n },
+		type: TypeError
+	});
+	let i = r.leading ?? !0, a = r.trailing ?? !1, o, s = 0, c, l, u, d = () => {
+		o !== void 0 && (o.abort(), o = void 0);
+	}, f = (e) => {
+		let t = new AbortController(), n = new N();
+		o = t, n.postTask(h, {
+			delay: e,
+			priority: "user-visible",
+			signal: t.signal
+		}).catch(() => {});
+	}, p = (e) => {
+		if (s = e, d(), !c) return;
+		let n = c, r = l;
+		return c = void 0, l = void 0, u = t.apply(r, n), u;
+	}, m = (e) => n - (e - s), h = () => {
+		let e = Date.now();
+		c && m(e) <= 0 ? p(e) : c ? f(m(e)) : d();
+	}, g = function(...e) {
+		let t = Date.now();
+		s === 0 && !i && (s = t), c = e, l = this;
+		let n = m(t);
+		n <= 0 ? p(t) : a && !o && f(n);
+	};
+	return g.cancel = () => {
+		d(), c = void 0, l = void 0, s = 0;
+	}, g.flush = () => {
+		if (c) return p(Date.now());
+	}, g.pending = () => c !== void 0 || o !== void 0, g;
+}
+//#endregion
+//#region src/math/abs.ts
+function Oe(e) {
+	return typeof e == "bigint" ? e < 0n ? -e : e : Math.abs(e);
+}
+//#endregion
+//#region src/math/allocate.ts
+function ke(e, t) {
+	if (t.length === 0) throw Error("Ratios array cannot be empty");
+	if (t.some((e) => e < 0)) throw Error("Ratios must be non-negative");
+	let n = t.reduce((e, t) => e + t, 0);
+	if (n === 0) throw Error("Total ratio cannot be zero");
+	if (typeof e == "bigint") {
+		let r = [], i = e;
+		for (let a = 0; a < t.length - 1; a++) {
+			let o = e * BigInt(Math.floor(t[a] * 1e6)) / BigInt(Math.floor(n * 1e6));
+			r.push(o), i -= o;
+		}
+		return r.push(i), r;
+	}
+	let r = Array.from({ length: t.length - 1 }, (r, i) => Math.floor(e * t[i] / n));
+	return r.push(e - r.reduce((e, t) => e + t, 0)), r;
+}
+//#endregion
+//#region src/math/sum.ts
+function H(e, t) {
+	return e.length === 0 ? 0 : e.reduce((e, n) => {
+		let r = t ? t(n) : n;
+		if (Number.isNaN(r)) throw TypeError("Cannot sum NaN values");
+		return e + r;
+	}, 0);
+}
+//#endregion
+//#region src/math/average.ts
+function Ae(e, t) {
+	if (e.length !== 0) try {
+		let n = H(e, t) / e.length;
+		return Number.isNaN(n) ? void 0 : n;
+	} catch {
+		return;
+	}
+}
+//#endregion
+//#region src/math/clamp.ts
+function je(e, t, n) {
+	return Math.min(Math.max(e, t), n);
+}
+//#endregion
+//#region src/math/distribute.ts
+function Me(e, t) {
+	if (t < 1) throw Error("Parts must be at least 1");
+	if (typeof e == "bigint") {
+		let n = e / BigInt(t), r = e % BigInt(t), i = [];
+		for (let e = 0; e < t; e++) i.push(BigInt(e) < r ? n + 1n : n);
+		return i;
+	}
+	let n = Math.floor(e / t), r = e - n * t;
+	return Array.from({ length: t }, (e, t) => t < r ? n + 1 : n);
+}
+//#endregion
+//#region src/math/linspace.ts
+function Ne(e, t, n = 5) {
+	if (n <= 0) return [];
+	if (n === 1) return [e];
+	let r = (t - e) / (n - 1);
+	return Array.from({ length: n }, (t, n) => e + n * r);
+}
+//#endregion
+//#region src/math/max.ts
+function Pe(e, t) {
+	let n = t ?? ((e) => e);
+	return u(e, (e, t) => E(n(e), n(t)) > 0 ? e : t);
+}
+//#endregion
+//#region src/math/median.ts
+function Fe(e, t) {
+	if (e.length === 0) return;
+	let n = t ? e.map(t) : [...e];
+	n.sort((e, t) => e - t);
+	let r = Math.floor(n.length / 2);
+	return n.length % 2 == 0 ? (n[r - 1] + n[r]) / 2 : n[r];
+}
+//#endregion
+//#region src/math/min.ts
+function Ie(e, t) {
+	let n = t ?? ((e) => e);
+	return u(e, (e, t) => E(n(e), n(t)) < 0 ? e : t);
+}
+//#endregion
+//#region src/math/percent.ts
+function Le(e, t) {
+	return t === 0 ? 0 : e / t * 100;
+}
+//#endregion
+//#region src/math/range.ts
+function Re(t, n, r) {
+	if (e(Number.isFinite(t) && Number.isFinite(n) && Number.isFinite(r), "start, stop, and step must be finite numbers", {
+		args: {
+			start: t,
+			step: r,
+			stop: n
+		},
+		type: TypeError
+	}), e(r !== 0, "Step cannot be 0", {
+		args: { step: r },
+		type: Error
+	}), t === n) return [];
+	let i = Math.max(0, Math.ceil((n - t) / r + 2 ** -52));
+	return e(i <= 1e7, "Range exceeds maximum allowed size of 10,000,000", {
+		args: {
+			length: i,
+			start: t,
+			step: r,
+			stop: n
+		},
+		type: Error
+	}), Array.from({ length: i }, (e, n) => t + n * r);
+}
+//#endregion
+//#region src/math/round.ts
+function ze(e, t = 0, n = Math.round) {
+	if (t === 0) return n(e);
+	let r = 10 ** Math.max(-323, Math.min(t, 292));
+	return n(e * r) / r;
+}
+//#endregion
+//#region src/money/currency.ts
+function Be(e, t = {}) {
+	let { locale: n = "en-US", maximumFractionDigits: r, minimumFractionDigits: i, style: a = "symbol" } = t, o = Ve(e.currency), s = 10 ** o, c = Number(e.amount) / s;
+	return new Intl.NumberFormat(n, {
+		currency: e.currency,
+		currencyDisplay: a,
+		maximumFractionDigits: r ?? o,
+		minimumFractionDigits: i ?? o,
+		style: "currency"
+	}).format(c);
+}
+function Ve(e) {
+	return new Intl.NumberFormat("en", {
+		currency: e,
+		style: "currency"
+	}).resolvedOptions().maximumFractionDigits ?? 2;
+}
+//#endregion
+//#region src/money/exchange.ts
+function He(e, t) {
+	if (e.currency !== t.from) throw Error(`Currency mismatch: expected ${t.from}, got ${e.currency}`);
+	let n = BigInt(Math.round(t.rate * 1e6));
+	return {
+		amount: e.amount * n / 1000000n,
+		currency: t.to
+	};
+}
+//#endregion
+//#region src/object/stash.ts
+function Ue(e) {
+	let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = e.scheduler ?? new N(), i = e.hash, a = 0;
+	function o(e) {
+		n.get(e)?.controller.abort(), n.delete(e);
+	}
+	function s(e) {
+		let n = t.has(e);
+		return o(e), t.delete(e), n;
+	}
+	function c(e) {
+		return t.get(i(e))?.value;
+	}
+	function l(e) {
+		let n = t.get(i(e));
+		if (n) return {
+			meta: n.meta,
+			value: n.value
+		};
+	}
+	function u(e, n, r) {
+		let a = i(e), s = t.get(a);
+		o(a), t.set(a, {
+			key: e,
+			meta: r && "meta" in r ? r.meta : s?.meta,
+			value: n
+		}), r?.ttlMs !== void 0 && g(e, r.ttlMs);
+	}
+	function d(e, t, n) {
+		let r = l(e);
+		if (r) return r.value;
+		let i = t();
+		return u(e, i, n), i;
+	}
+	function f(e) {
+		return s(i(e));
+	}
+	function p() {
+		for (let e of n.values()) e.controller.abort();
+		t.clear(), n.clear();
+	}
+	function m() {
+		return t.size;
+	}
+	function h(i, c) {
+		if (o(i), c === Infinity) return;
+		if (!Number.isFinite(c)) throw TypeError("stash.scheduleGc expects a finite number or Infinity");
+		if (c <= 0) {
+			s(i);
+			return;
+		}
+		if (!t.has(i)) return;
+		let l = new AbortController(), u = ++a;
+		n.set(i, {
+			controller: l,
+			token: u
+		}), r.postTask(() => {
+			let e = n.get(i);
+			!e || e.token !== u || (n.delete(i), s(i));
+		}, {
+			delay: c,
+			priority: "background",
+			signal: l.signal
+		}).catch((t) => {
+			t instanceof DOMException && t.name === "AbortError" || e.onError?.(t);
+		});
+	}
+	function g(e, t) {
+		h(i(e), t);
+	}
+	function _(e) {
+		o(i(e));
+	}
+	function v(e, n) {
+		let r = i(e);
+		return t.has(r) ? (h(r, n), !0) : !1;
+	}
+	function* y() {
+		for (let e of t.values()) yield [e.key, e.value];
+	}
+	return {
+		cancelGc: _,
+		clear: p,
+		delete: f,
+		entries: y,
+		get: c,
+		getEntry: l,
+		getOrSet: d,
+		scheduleGc: g,
+		set: u,
+		size: m,
+		touch: v
+	};
+}
+//#endregion
+//#region src/object/diff.ts
+var U = Symbol("deleted");
+function W(e, t, n = s) {
+	if (!e && !t) return {};
+	let r = {};
+	for (let i of new Set([...Object.keys(e ?? {}), ...Object.keys(t ?? {})])) {
+		let a = e?.[i], o = t?.[i];
+		if (_(a) && _(o)) {
+			let e = W(a, o, n);
+			Object.keys(e).length > 0 && (r[i] = e);
+		} else n(a, o) || (r[i] = t != null && i in t && (e == null || !(i in e)) ? U : a);
+	}
+	return r;
+}
+//#endregion
+//#region src/object/merge.ts
+function G(e = "deep", ...t) {
+	return t.length === 0 ? {} : e === "shallow" ? Object.assign({}, ...t) : t.reduce((t, n) => K(t, n, e), {});
+}
+function We(...e) {
+	return G("deep", ...e);
+}
+function Ge(...e) {
+	return G("shallow", ...e);
+}
+function K(e, t, r) {
+	if (!_(t)) return t;
+	let i = { ...e };
+	for (let e of Object.keys(t)) {
+		let a = t[e], o = i[e];
+		i[e] = n(a) && n(o) ? Ke(o, a, r) : _(a) && _(o) ? K(o, a, r) : qe(o, a, r);
+	}
+	return i;
+}
+function Ke(e, t, n) {
+	return e ? n === "arrayConcat" ? e.concat(t) : n === "arrayReplace" ? t : [...e, ...t] : t;
+}
+function qe(e, t, n) {
+	return typeof n == "function" ? n(e, t) : n === "lastWins" || t !== void 0 ? t : e;
+}
+//#endregion
+//#region src/object/parseJSON.ts
+function Je(e, t = {}) {
+	let { defaultValue: n, onError: r, reviver: a, validator: o } = t;
+	if (!i(e)) return m(e) ? n : e;
+	try {
+		let t = JSON.parse(e, a);
+		if (o && !o(t)) throw TypeError("Parsed JSON does not match the expected structure");
+		return t ?? n;
+	} catch (e) {
+		return r?.(e), n;
+	}
+}
+//#endregion
+//#region src/object/path.ts
+function Ye(t, n, r, i = {}) {
+	e(_(t), v, {
+		args: { item: t },
+		type: TypeError
+	});
+	let { throwOnMissing: a = !1 } = i, o = n.split(/[.[\]]+/).filter(Boolean), s = t;
+	for (let e of o) {
+		if (m(s) || typeof s != "object") {
+			if (a) throw Error(`Cannot read property '${e}' of ${s}`);
+			return r;
+		}
+		if (s = s[e], s === void 0) {
+			if (a) throw Error(`Property '${e}' does not exist`);
+			return r;
+		}
+	}
+	return s;
+}
+//#endregion
+//#region src/object/proxy.ts
+function q(e, t) {
+	let { deep: n = !1, get: r, set: i, watch: a } = t, o = a ? new Set(a) : null;
+	return new Proxy(e, {
+		get(e, i, a) {
+			if (o && !o.has(i)) return Reflect.get(e, i, a);
+			let s = Reflect.get(e, i, a);
+			return r && (s = r(i, s, e)), n && _(s) ? q(s, t) : s;
+		},
+		set(e, r, a, s) {
+			if (o && !o.has(r)) return Reflect.set(e, r, a, s);
+			let c = e[r], l = i ? i(r, a, c, e) : a;
+			return n && _(l) ? Reflect.set(e, r, q(l, t), s) : Reflect.set(e, r, l, s);
+		}
+	});
+}
+//#endregion
+//#region src/typed/isEmpty.ts
+function J(e) {
+	return m(e) || e === "" ? !0 : n(e) ? e.length === 0 : e instanceof Map || e instanceof Set ? e.size === 0 : _(e) ? Object.keys(e).length === 0 : !1;
+}
+//#endregion
+//#region src/object/prune.ts
+function Y(e) {
+	if (!m(e)) {
+		if (i(e)) {
+			let t = e.trim();
+			return t === "" ? void 0 : t;
+		}
+		if (n(e)) {
+			let t = e.map((e) => Y(e)).filter((e) => !J(e));
+			return t.length === 0 ? void 0 : t;
+		}
+		if (_(e)) {
+			let t = {};
+			for (let [n, r] of Object.entries(e)) {
+				let e = Y(r);
+				J(e) || (t[n] = e);
+			}
+			return Object.keys(t).length === 0 ? void 0 : t;
+		}
+		return e;
+	}
+}
+//#endregion
+//#region src/random/random.ts
+function X(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;
+}
+//#endregion
+//#region src/random/draw.ts
+var Xe = (t) => {
+	if (e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	}), t.length !== 0) return t[X(0, t.length - 1)];
+};
+//#endregion
+//#region src/random/shuffle.ts
+function Ze(t) {
+	e(n(t), r, {
+		args: { array: t },
+		type: TypeError
+	});
+	let i = [...t];
+	for (let e = i.length - 1; e > 0; e--) {
+		let t = Math.floor(crypto.getRandomValues(new Uint32Array(1))[0] / 4294967295 * (e + 1));
+		[i[e], i[t]] = [i[t], i[e]];
+	}
+	return i;
+}
+//#endregion
+//#region src/random/uuid.ts
+function Qe() {
+	return crypto.randomUUID();
+}
+//#endregion
+//#region src/string/_caseUtils.ts
+var $e = /([a-z])([A-Z\d])|([A-Z\d])([A-Z][a-z])|(\d)([a-zA-Z])/g;
+function Z(e, t = " ") {
+	return e.trim().replace($e, `$1$3$5${t}$2$4$6`).replace(/[^a-z\d]+/gi, t).replace(RegExp(`^${t}+|${t}+$`, "g"), "");
+}
+//#endregion
+//#region src/string/camelCase.ts
+function et(e) {
+	return Z(e, " ").replace(/[^a-zA-Z0-9]+(.)/g, (e, t) => t.toUpperCase()).replace(/^./, (e) => e.toLowerCase());
+}
+//#endregion
+//#region src/string/kebabCase.ts
+function tt(e) {
+	return Z(e, "-").toLowerCase();
+}
+//#endregion
+//#region src/string/pascalCase.ts
+function nt(e) {
+	return Z(e, " ").replace(/(?:^|\s)(\w)/g, (e, t) => t.toUpperCase()).replace(/\s+/g, "");
+}
+//#endregion
+//#region src/string/snakeCase.ts
+function rt(e) {
+	return Z(e, "_").toLowerCase();
+}
+//#endregion
+//#region src/string/truncate.ts
+function it(t, n = 25, { completeWords: r = !1, ellipsis: i = "…" } = {}) {
+	if (e(typeof t == "string", "First argument must be a string", {
+		args: { str: t },
+		type: TypeError
+	}), e(typeof n == "number" && n >= 0 && Number.isFinite(n), "Limit must be a non-negative finite number", {
+		args: { limit: n },
+		type: TypeError
+	}), t.length <= n) return t;
+	let a = n;
+	if (r) {
+		let e = t.substring(0, n).lastIndexOf(" ");
+		e > 0 && (a = e);
+	}
+	return `${t.substring(0, a).trim()}${i}`;
+}
+//#endregion
+//#region src/typed/isBoolean.ts
+function at(e) {
+	return typeof e == "boolean";
+}
+//#endregion
+//#region src/typed/isDefined.ts
+function Q(e) {
+	return e !== void 0;
+}
+//#endregion
+//#region src/typed/isEven.ts
+function ot(e) {
+	return typeof e == "number" && Number.isInteger(e) && e % 2 == 0;
+}
+//#endregion
+//#region src/typed/isFunction.ts
+function st(e) {
+	return typeof e == "function";
+}
+//#endregion
+//#region src/typed/isMatch.ts
+function $(e, t) {
+	if (e === t) return !0;
+	if (e == null || t == null) return !1;
+	let n = Array.isArray(e), r = Array.isArray(t);
+	if (n !== r) return !1;
+	if (n && r) return t.length > e.length ? !1 : t.every((t, n) => $(e[n], t));
+	if (typeof t == "object") {
+		for (let n of Object.keys(t)) if (!$(e?.[n], t[n])) return !1;
+		return !0;
+	}
+	return e === t;
+}
+//#endregion
+//#region src/typed/isNegative.ts
+function ct(e) {
+	return typeof e == "number" && e < 0;
+}
+//#endregion
+//#region src/typed/isOdd.ts
+function lt(e) {
+	return typeof e == "number" && Number.isInteger(e) && e % 2 != 0;
+}
+//#endregion
+//#region src/typed/isPositive.ts
+function ut(e) {
+	return typeof e == "number" && e > 0;
+}
+//#endregion
+//#region src/typed/isPrimitive.ts
+function dt(e) {
+	let t = typeof e;
+	return t === "string" || t === "boolean" || t === "number" && !Number.isNaN(e);
+}
+//#endregion
+//#region src/typed/isPromise.ts
+function ft(e) {
+	return typeof e == "object" && !!e && typeof e.then == "function";
+}
+//#endregion
+//#region src/typed/isRegex.ts
+function pt(e) {
+	return e instanceof RegExp;
+}
+//#endregion
+//#region src/typed/isZero.ts
+function mt(e) {
+	return typeof e == "number" && e === 0;
+}
+//#endregion
+//#region src/typed/typeOf.ts
+function ht(e) {
+	if (e === null) return "null";
+	if (e === void 0) return "undefined";
+	if (typeof e == "number" && Number.isNaN(e)) return "nan";
+	let t = Object.prototype.toString.call(e).slice(8, -1);
+	return t === "AsyncFunction" ? "function" : t.toLowerCase();
+}
+//#endregion
+//#region src/typed/is.ts
+var gt = {
+	array: n,
+	boolean: at,
+	date: P,
+	defined: Q,
+	empty: J,
+	equal: s,
+	even: ot,
+	fn: st,
+	ge: (e, t) => e >= t,
+	gt: (e, t) => e > t,
+	le: (e, t) => e <= t,
+	lt: (e, t) => e < t,
+	match: $,
+	negative: ct,
+	nil: m,
+	number: h,
+	object: _,
+	odd: lt,
+	positive: ut,
+	primitive: dt,
+	promise: ft,
+	regex: pt,
+	string: i,
+	typeOf: ht,
+	within: y,
+	zero: mt
+};
+//#endregion
+export { U as DELETED, N as Scheduler, Oe as abs, ke as allocate, e as assert, t as assertAll, ye as assertParams, oe as attempt, Ae as average, et as camelCase, o as chunk, je as clamp, E as compare, D as compareBy, be as compose, l as contains, Be as currency, xe as curry, Se as debounce, We as deepMerge, se as defer, W as diff, Me as distribute, Xe as draw, He as exchange, me as expires, u as fold, Ye as get, d as group, F as interval, gt as is, tt as kebabCase, f as keyBy, Ne as linspace, w as list, Pe as max, Fe as median, we as memo, G as merge, Ie as min, Te as once, ce as parallel, Je as parseJSON, Ce as partial, nt as pascalCase, Le as percent, T as pick, Ee as pipe, M as polyfillScheduler, ue as pool, q as proxy, Y as prune, de as queue, fe as race, X as random, Re as range, ee as remoteList, te as replace, j as retry, ne as rotate, ze as round, C as search, S as seek, re as select, Ge as shallowMerge, Ze as shuffle, p as similarity, A as sleep, rt as snakeCase, O as sort, Ue as stash, H as sum, De as throttle, ve as timeDiff, k as toggle, it as truncate, ie as uniq, Qe as uuid, pe as waitFor };
+
+//# sourceMappingURL=toolkit.js.map