@anil-labs/collection-js 0.1.0

package/dist/index.es.js

@@ -0,0 +1,3211 @@
+//#region \0rolldown/runtime.js
+var e = Object.defineProperty, t = (t, n) => {
+	let r = {};
+	for (var i in t) e(r, i, {
+		get: t[i],
+		enumerable: !0
+	});
+	return n || e(r, Symbol.toStringTag, { value: "Module" }), r;
+}, n = class extends Error {
+	constructor(e) {
+		super(e), this.name = "CollectionException", Object.setPrototypeOf(this, new.target.prototype);
+	}
+}, r = class extends n {
+	constructor(e = "Item not found.") {
+		super(e), this.name = "ItemNotFoundException", Object.setPrototypeOf(this, new.target.prototype);
+	}
+}, i = class extends n {
+	constructor(e = "Unexpected value encountered.") {
+		super(e), this.name = "UnexpectedValueException", Object.setPrototypeOf(this, new.target.prototype);
+	}
+}, a = /* @__PURE__ */ new WeakMap();
+function o(e) {
+	let t = a.get(e);
+	return t || (t = /* @__PURE__ */ new Map(), a.set(e, t)), t;
+}
+function s(e, t) {
+	let n = e;
+	for (; n;) {
+		let e = a.get(n)?.get(t);
+		if (e) return e;
+		n = Object.getPrototypeOf(n);
+	}
+}
+function c(e, t, n) {
+	o(e).set(t, n), Object.defineProperty(e.prototype, t, {
+		value: function(...e) {
+			return n.call(this, ...e);
+		},
+		configurable: !0,
+		writable: !0,
+		enumerable: !1
+	});
+}
+function l(e, t) {
+	return s(e, t) !== void 0;
+}
+function u(e, t) {
+	return s(e, t);
+}
+function d(e) {
+	let t = a.get(e);
+	if (t) {
+		for (let n of t.keys()) delete e.prototype[n];
+		t.clear();
+	}
+}
+function f(e) {
+	let t = e;
+	t.macro = (t, n) => c(e, t, n), t.hasMacro = (t) => l(e, t), t.flushMacros = () => d(e);
+}
+//#endregion
+//#region src/exceptions/MultipleItemsFoundException.ts
+var p = class extends n {
+	count;
+	constructor(e = 0, t) {
+		super(t ?? `${e} items were found.`), this.name = "MultipleItemsFoundException", this.count = e, Object.setPrototypeOf(this, new.target.prototype);
+	}
+};
+//#endregion
+//#region src/support/isObject.ts
+function m(e) {
+	if (typeof e != "object" || !e || Array.isArray(e)) return !1;
+	let t = Object.getPrototypeOf(e);
+	return t === Object.prototype || t === null;
+}
+function h(e) {
+	return typeof e == "object" && !!e;
+}
+function ee(e) {
+	return typeof e == "function";
+}
+//#endregion
+//#region src/support/dataGet.ts
+function g(e, t, n) {
+	if (e == null) return n;
+	let r = Array.isArray(t) ? [...t] : String(t).split("."), i = e;
+	for (let e = 0; e < r.length; e++) {
+		let t = r[e];
+		if (t === "*") {
+			if (!Array.isArray(i)) return n;
+			let t = r.slice(e + 1), a = [];
+			for (let e of i) {
+				let n = t.length === 0 ? e : g(e, t, void 0);
+				Array.isArray(n) ? a.push(...n) : a.push(n);
+			}
+			return a;
+		}
+		if (i == null) return n;
+		if (Array.isArray(i)) {
+			let e = Number(t);
+			if (Number.isInteger(e) && e >= 0 && e < i.length) {
+				i = i[e];
+				continue;
+			}
+			return n;
+		}
+		if (h(i) && t in i) {
+			i = i[t];
+			continue;
+		}
+		return n;
+	}
+	return i;
+}
+function te(e, t, n) {
+	let r = t.split("."), i = e;
+	for (let e = 0; e < r.length - 1; e++) {
+		let t = r[e];
+		h(i[t]) || (i[t] = {}), i = i[t];
+	}
+	return i[r[r.length - 1]] = n, e;
+}
+//#endregion
+//#region src/support/deepEqual.ts
+function _(e, t) {
+	if (Object.is(e, t)) return !0;
+	if (!h(e) || !h(t)) return !1;
+	if (e instanceof Date || t instanceof Date) return e instanceof Date && t instanceof Date && e.getTime() === t.getTime();
+	if (e instanceof RegExp || t instanceof RegExp) return e instanceof RegExp && t instanceof RegExp && e.source === t.source && e.flags === t.flags;
+	let n = Array.isArray(e), r = Array.isArray(t);
+	if (n !== r) return !1;
+	if (n && r) {
+		if (e.length !== t.length) return !1;
+		for (let n = 0; n < e.length; n++) if (!_(e[n], t[n])) return !1;
+		return !0;
+	}
+	let i = Object.keys(e), a = Object.keys(t);
+	if (i.length !== a.length) return !1;
+	for (let n of i) if (!Object.prototype.hasOwnProperty.call(t, n) || !_(e[n], t[n])) return !1;
+	return !0;
+}
+function v(e, t) {
+	return e === t ? !0 : e == null || t == null ? e == t : typeof e == typeof t ? _(e, t) : (typeof e == "string" || typeof e == "number" || typeof e == "boolean") && (typeof t == "string" || typeof t == "number" || typeof t == "boolean") ? e == t : !1;
+}
+//#endregion
+//#region src/support/operatorForWhere.ts
+function y(e, t, n) {
+	switch (t) {
+		case "=":
+		case "==": return v(e, n);
+		case "===": return e === n || _(e, n);
+		case "!=":
+		case "<>": return !v(e, n);
+		case "!==": return e !== n && !_(e, n);
+		case "<": return e < n;
+		case "<=": return e <= n;
+		case ">": return e > n;
+		case ">=": return e >= n;
+		default: throw Error(`Unsupported operator: ${String(t)}`);
+	}
+}
+function b(e) {
+	return e === "=" || e === "==" || e === "===" || e === "!=" || e === "!==" || e === "<>" || e === "<" || e === "<=" || e === ">" || e === ">=";
+}
+//#endregion
+//#region src/operations/accessors.ts
+function x(e, t) {
+	if (t === void 0) return e.length > 0 ? e[0] : void 0;
+	for (let n = 0; n < e.length; n++) if (t(e[n], n)) return e[n];
+}
+function ne(e, t) {
+	let n = x(e, t);
+	if (n === void 0) throw new r();
+	return n;
+}
+function S(e, t, n) {
+	return n <= 1 ? {
+		truthy: !0,
+		operator: "=",
+		value: void 0
+	} : n >= 3 && b(e) ? {
+		truthy: !1,
+		operator: e,
+		value: t
+	} : {
+		truthy: !1,
+		operator: "=",
+		value: e
+	};
+}
+function re(e, t, n) {
+	return n.truthy ? e.find((e) => !!g(e, String(t))) : e.find((e) => y(g(e, String(t)), n.operator, n.value));
+}
+function ie(e, t) {
+	if (t === void 0) return e.length > 0 ? e[e.length - 1] : void 0;
+	for (let n = e.length - 1; n >= 0; n--) if (t(e[n], n)) return e[n];
+}
+function ae(e, t, n) {
+	return t < 0 && Math.abs(t) <= e.length ? e[e.length + t] : t >= 0 && t < e.length ? e[t] : n;
+}
+function oe(e, t) {
+	if (e.length !== 0) return g(e[0], t);
+}
+function se(e, t, n) {
+	let i;
+	if (t === void 0) i = () => !0;
+	else if (typeof t == "function") i = t;
+	else {
+		let e = String(t);
+		i = (t) => v(g(t, e), n);
+	}
+	let a = [];
+	for (let t = 0; t < e.length; t++) if (i(e[t], t) && a.push(e[t]), a.length > 1) throw new p(a.length);
+	if (a.length === 0) throw new r();
+	return a[0];
+}
+function ce(e, t, n) {
+	return typeof t == "function" ? e.findIndex(t) : n ? e.findIndex((e) => e === t) : e.findIndex((e) => v(e, t));
+}
+function le(e, t, n = !1) {
+	let r = ce(e, t, n);
+	if (!(r === -1 || r === e.length - 1)) return e[r + 1];
+}
+function ue(e, t, n = !1) {
+	let r = ce(e, t, n);
+	if (!(r <= 0)) return e[r - 1];
+}
+function de(e, t) {
+	return t.every((t) => e.some((e) => h(e) && Object.prototype.hasOwnProperty.call(e, String(t))));
+}
+function fe(e, t) {
+	return t.some((t) => e.some((e) => h(e) && Object.prototype.hasOwnProperty.call(e, String(t))));
+}
+//#endregion
+//#region src/support/valueRetriever.ts
+function C(e) {
+	if (e === void 0) return (e) => e;
+	if (typeof e == "function") return e;
+	let t = String(e);
+	return t.includes(".") || t.includes("*") ? (e) => g(e, t) : (e) => {
+		if (typeof e == "object" && e) return e[t];
+	};
+}
+//#endregion
+//#region src/operations/aggregations.ts
+function pe(e) {
+	if (typeof e == "number") return e;
+	if (typeof e == "string") {
+		let t = Number(e);
+		return Number.isNaN(t) ? 0 : t;
+	}
+	return typeof e == "boolean" ? +!!e : 0;
+}
+function me(e, t) {
+	if (typeof e == "number" && typeof t == "number") return e - t;
+	if (e instanceof Date && t instanceof Date) return e.getTime() - t.getTime();
+	if (typeof e == "bigint" && typeof t == "bigint" || typeof e == "string" && typeof t == "string") return e < t ? -1 : +(e > t);
+	let n = Number(e), r = Number(t);
+	if (!Number.isNaN(n) && !Number.isNaN(r)) return n - r;
+	let i = String(e), a = String(t);
+	return i < a ? -1 : +(i > a);
+}
+function w(e, t) {
+	let n = C(t), r = 0;
+	for (let t = 0; t < e.length; t++) r += pe(n(e[t], t));
+	return r;
+}
+function T(e, t) {
+	return e.length === 0 ? 0 : w(e, t) / e.length;
+}
+function E(e, t) {
+	let n = C(t), r, i = !1;
+	for (let t = 0; t < e.length; t++) {
+		let a = n(e[t], t);
+		a != null && (!i || me(a, r) > 0) && (r = a, i = !0);
+	}
+	return r;
+}
+function D(e, t) {
+	let n = C(t), r, i = !1;
+	for (let t = 0; t < e.length; t++) {
+		let a = n(e[t], t);
+		a != null && (!i || me(a, r) < 0) && (r = a, i = !0);
+	}
+	return r;
+}
+function he(e, t) {
+	if (e.length === 0) return;
+	let n = C(t), r = e.map((e, t) => pe(n(e, t))).sort((e, t) => e - t), i = Math.floor(r.length / 2);
+	return r.length % 2 == 0 ? (r[i - 1] + r[i]) / 2 : r[i];
+}
+function ge(e, t) {
+	if (e.length === 0) return;
+	let n = C(t), r = /* @__PURE__ */ new Map(), i = 0;
+	for (let t = 0; t < e.length; t++) {
+		let a = n(e[t], t), o = (r.get(a) ?? 0) + 1;
+		r.set(a, o), o > i && (i = o);
+	}
+	let a = [];
+	for (let [e, t] of r) t === i && a.push(e);
+	return a;
+}
+function _e(e, t, n = 2) {
+	if (e.length === 0) return 0;
+	let r = 0;
+	for (let n = 0; n < e.length; n++) t(e[n], n) && r++;
+	let i = 10 ** n;
+	return Math.round(r / e.length * 100 * i) / i;
+}
+function ve(e, t) {
+	let n = C(t), r = /* @__PURE__ */ new Map();
+	for (let t = 0; t < e.length; t++) {
+		let i = n(e[t], t);
+		r.set(i, (r.get(i) ?? 0) + 1);
+	}
+	return r;
+}
+//#endregion
+//#region src/operations/chunking.ts
+function ye(e, t) {
+	if (t <= 0) return [];
+	let n = [];
+	for (let r = 0; r < e.length; r += t) n.push(e.slice(r, r + t));
+	return n;
+}
+function be(e, t) {
+	if (e.length === 0) return [];
+	let n = [], r = [e[0]];
+	for (let i = 1; i < e.length; i++) t(e[i], i, r) ? r.push(e[i]) : (n.push(r), r = [e[i]]);
+	return n.push(r), n;
+}
+function xe(e, t, n = 1) {
+	if (t <= 0 || n <= 0) return [];
+	let r = [];
+	for (let i = 0; i + t <= e.length; i += n) r.push(e.slice(i, i + t));
+	return r;
+}
+function Se(e, t) {
+	if (t <= 0 || e.length === 0) return [];
+	let n = [], r = Math.floor(e.length / t), i = e.length % t, a = 0;
+	for (let o = 0; o < t; o++) {
+		let t = +(i > 0);
+		n.push(e.slice(a, a + r + t)), a += r + t, i > 0 && i--;
+	}
+	return n.filter((e) => e.length > 0);
+}
+function Ce(e, t) {
+	if (t <= 0 || e.length === 0) return [];
+	let n = Math.ceil(e.length / t), r = [];
+	for (let t = 0; t < e.length; t += n) r.push(e.slice(t, t + n));
+	return r;
+}
+function O(e, t) {
+	let n = [], r = [];
+	for (let i = 0; i < e.length; i++) t(e[i], i) ? n.push(e[i]) : r.push(e[i]);
+	return [n, r];
+}
+function we(e, t, n) {
+	if (t < 1 || n <= 0) return [];
+	let r = (t - 1) * n;
+	return e.slice(r, r + n);
+}
+function Te(e, t, n = 0) {
+	if (t <= 0) return [];
+	let r = [];
+	for (let i = n; i < e.length; i += t) r.push(e[i]);
+	return r;
+}
+//#endregion
+//#region src/operations/compare.ts
+function Ee(e, t) {
+	if (!h(e)) return !1;
+	let n = e;
+	for (let e of Object.keys(t)) if (!v(n[e], t[e])) return !1;
+	return !0;
+}
+function k(e, t, n = !1) {
+	switch (t.kind) {
+		case "predicate":
+			for (let n = 0; n < e.length; n++) if (t.predicate(e[n], n)) return !0;
+			return !1;
+		case "keyValue": return e.some((e) => {
+			let r = g(e, t.key);
+			return n ? r === t.value || _(r, t.value) : v(r, t.value);
+		});
+		case "shape": return e.some((e) => Ee(e, t.shape));
+		case "value": return e.some((e) => n ? e === t.value : v(e, t.value));
+	}
+}
+function De(e, t, n = !1) {
+	return !k(e, t, n);
+}
+function A(e, t, n) {
+	return typeof e == "function" ? {
+		kind: "predicate",
+		predicate: e
+	} : n && (typeof e == "string" || typeof e == "number" || typeof e == "symbol") ? {
+		kind: "keyValue",
+		key: String(e),
+		value: t
+	} : h(e) && !Array.isArray(e) ? {
+		kind: "shape",
+		shape: e
+	} : {
+		kind: "value",
+		value: e
+	};
+}
+function Oe(e, t) {
+	for (let n = 0; n < e.length; n++) if (!t(e[n], n)) return !1;
+	return !0;
+}
+function ke(e, t) {
+	for (let n = 0; n < e.length; n++) if (t(e[n], n)) return !0;
+	return !1;
+}
+function Ae(e, t, n = !1) {
+	if (typeof t == "function") {
+		let n = e.findIndex(t);
+		return n === -1 ? !1 : n;
+	}
+	let r = e.findIndex((e) => n ? e === t : v(e, t));
+	return r === -1 ? !1 : r;
+}
+//#endregion
+//#region src/operations/combine.ts
+function je(e, t) {
+	let n = {}, r = Math.min(e.length, t.length);
+	for (let i = 0; i < r; i++) n[e[i]] = t[i];
+	return n;
+}
+function Me(e, t) {
+	let n = [];
+	for (let r = 0; r < e.length; r++) n.push([e[r], t[r]]);
+	return n;
+}
+function Ne(...e) {
+	if (e.length === 0) return [];
+	let t = Math.min(...e.map((e) => e.length)), n = [];
+	for (let r = 0; r < t; r++) n.push(e.map((e) => e[r]));
+	return n;
+}
+//#endregion
+//#region src/operations/conditionals.ts
+function Pe(e, t) {
+	return typeof t == "function" ? !!t(e) : !!t;
+}
+function j(e, t, n, r) {
+	let i = Pe(e, t), a = i ? n : r;
+	if (!a) return e;
+	let o = a(e, i);
+	return o === void 0 ? e : o;
+}
+//#endregion
+//#region src/operations/filters.ts
+function Fe(e, t) {
+	return t === void 0 ? e.filter((e) => !!e) : e.filter((e, n) => t(e, n));
+}
+function Ie(e, t) {
+	return e.filter((e, n) => !t(e, n));
+}
+function M(e, t) {
+	return e.length <= 1 ? {
+		truthy: !0,
+		operator: "=",
+		value: void 0,
+		strict: t
+	} : e.length >= 3 && b(e[1]) ? {
+		truthy: !1,
+		operator: e[1],
+		value: e[2],
+		strict: t
+	} : {
+		truthy: !1,
+		operator: t ? "===" : "=",
+		value: e[1],
+		strict: t
+	};
+}
+function Le(e, t, n) {
+	return n.truthy ? e.filter((e) => !!g(e, t)) : e.filter((e) => y(g(e, t), n.operator, n.value));
+}
+function Re(e, t, n, r = !1) {
+	return e.filter((e) => {
+		let i = g(e, t);
+		return n.some((e) => r ? e === i || _(e, i) : v(e, i));
+	});
+}
+function N(e, t, n, r = !1) {
+	return e.filter((e) => {
+		let i = g(e, t);
+		return !n.some((e) => r ? e === i || _(e, i) : v(e, i));
+	});
+}
+function ze(e, t, n) {
+	let [r, i] = n;
+	return e.filter((e) => {
+		let n = g(e, t);
+		return n >= r && n <= i;
+	});
+}
+function Be(e, t, n) {
+	let [r, i] = n;
+	return e.filter((e) => {
+		let n = g(e, t);
+		return n < r || n > i;
+	});
+}
+function Ve(e, t) {
+	return e.filter((e) => g(e, t) == null);
+}
+function He(e, t) {
+	return e.filter((e) => g(e, t) != null);
+}
+function Ue(e, t) {
+	let n = t;
+	return e.filter((e) => e instanceof n);
+}
+function P(e, t = !1) {
+	let n = "";
+	for (let t of e) t === "%" ? n += ".*" : t === "_" ? n += "." : n += t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+	return RegExp(`^${n}$`, t ? "" : "i");
+}
+function F(e, t, n, r = !1, i = !1) {
+	let a = P(n, r);
+	return e.filter((e) => {
+		let n = g(e, t), r = n != null && a.test(String(n));
+		return i ? !r : r;
+	});
+}
+//#endregion
+//#region src/operations/grouping.ts
+function I(e, t) {
+	let n = C(t), r = {};
+	for (let t = 0; t < e.length; t++) {
+		let i = e[t], a = n(i, t), o = Array.isArray(a) ? a : [a];
+		for (let e of o) r[e] === void 0 && (r[e] = []), r[e].push(i);
+	}
+	return r;
+}
+function L(e, t) {
+	if (t.length === 0) return e;
+	let [n, ...r] = t, i = I(e, n);
+	if (r.length === 0) return i;
+	let a = {};
+	for (let e of Object.keys(i)) a[e] = L(i[e], r);
+	return a;
+}
+function R(e, t) {
+	let n = C(t), r = {};
+	for (let t = 0; t < e.length; t++) r[n(e[t], t)] = e[t];
+	return r;
+}
+//#endregion
+//#region src/operations/itertools.ts
+function We(e, t, n) {
+	let r = [], i = n;
+	for (let n = 0; n < e.length; n++) i = t(i, e[n], n), r.push(i);
+	return r;
+}
+function Ge(e) {
+	if (e.length < 2) return [];
+	let t = [];
+	for (let n = 0; n < e.length - 1; n++) t.push([e[n], e[n + 1]]);
+	return t;
+}
+function Ke(e, t = 0) {
+	return e.map((e, n) => [t + n, e]);
+}
+function* qe(e, t = Infinity) {
+	if (e.length !== 0) for (let n = 0; n < t; n++) for (let t of e) yield t;
+}
+function Je(...e) {
+	if (e.length === 0) return [];
+	let t = Math.min(...e.map((e) => e.length)), n = [];
+	for (let r = 0; r < t; r++) for (let t of e) n.push(t[r]);
+	return n;
+}
+function Ye(e, t) {
+	let n = e[Symbol.iterator](), r = Array.from({ length: t }, () => []), i = !1;
+	function* a(e) {
+		for (;;) {
+			if (r[e].length > 0) {
+				yield r[e].shift();
+				continue;
+			}
+			if (i) return;
+			let a = n.next();
+			if (a.done) {
+				i = !0;
+				return;
+			}
+			for (let n = 0; n < t; n++) n !== e && r[n].push(a.value);
+			yield a.value;
+		}
+	}
+	return r.map((e, t) => a(t));
+}
+function* Xe(e, t) {
+	let n = e.length, r = t === void 0 ? n : t;
+	if (r > n) return;
+	let i = Array.from({ length: n }, (e, t) => t), a = Array.from({ length: r }, (e, t) => n - t);
+	for (yield i.slice(0, r).map((t) => e[t]); n > 0;) {
+		let t = !0;
+		for (let o = r - 1; o >= 0; o--) if (--a[o], a[o] === 0) {
+			let e = i.splice(o, 1)[0];
+			i.push(e), a[o] = n - o;
+		} else {
+			let n = a[o];
+			[i[o], i[i.length - n]] = [i[i.length - n], i[o]], yield i.slice(0, r).map((t) => e[t]), t = !1;
+			break;
+		}
+		if (t) return;
+	}
+}
+function* z(e, t) {
+	let n = e.length;
+	if (t > n || t < 0) return;
+	let r = Array.from({ length: t }, (e, t) => t);
+	for (yield r.map((t) => e[t]);;) {
+		let i = t - 1;
+		for (; i >= 0 && r[i] === i + n - t;) i--;
+		if (i < 0) return;
+		r[i] += 1;
+		for (let e = i + 1; e < t; e++) r[e] = r[e - 1] + 1;
+		yield r.map((t) => e[t]);
+	}
+}
+function* Ze(e) {
+	for (let t = 0; t <= e.length; t++) yield* z(e, t);
+}
+//#endregion
+//#region src/operations/joins.ts
+function B(e, t) {
+	let n = C(t), r = /* @__PURE__ */ new Map();
+	for (let t = 0; t < e.length; t++) {
+		let i = n(e[t], t), a = r.get(i);
+		a ? a.push(e[t]) : r.set(i, [e[t]]);
+	}
+	return r;
+}
+function Qe(e, t, n, r, i) {
+	let a = B(t, r), o = C(n), s = [];
+	for (let t = 0; t < e.length; t++) {
+		let n = o(e[t], t), r = a.get(n);
+		if (r) for (let n of r) s.push(i ? i(e[t], n) : [e[t], n]);
+	}
+	return s;
+}
+function $e(e, t, n, r, i) {
+	let a = B(t, r), o = C(n), s = [];
+	for (let t = 0; t < e.length; t++) {
+		let n = o(e[t], t), r = a.get(n);
+		if (r && r.length > 0) for (let n of r) s.push(i ? i(e[t], n) : [e[t], n]);
+		else s.push(i ? i(e[t], void 0) : [e[t], void 0]);
+	}
+	return s;
+}
+function et(e, t, n, r, i) {
+	let a = B(e, n), o = C(r), s = [];
+	for (let e = 0; e < t.length; e++) {
+		let n = o(t[e], e), r = a.get(n);
+		if (r && r.length > 0) for (let n of r) s.push(i ? i(n, t[e]) : [n, t[e]]);
+		else s.push(i ? i(void 0, t[e]) : [void 0, t[e]]);
+	}
+	return s;
+}
+function tt(e, t, n, r, i) {
+	let a = B(t, r), o = C(n), s = /* @__PURE__ */ new Set(), c = [];
+	for (let t = 0; t < e.length; t++) {
+		let n = o(e[t], t), r = a.get(n);
+		if (r && r.length > 0) {
+			s.add(n);
+			for (let n of r) c.push(i ? i(e[t], n) : [e[t], n]);
+		} else c.push(i ? i(e[t], void 0) : [e[t], void 0]);
+	}
+	for (let [e, t] of a) if (!s.has(e)) for (let e of t) c.push(i ? i(void 0, e) : [void 0, e]);
+	return c;
+}
+//#endregion
+//#region src/operations/mutations.ts
+function nt(e, t) {
+	return [...e, ...t];
+}
+function rt(e, t) {
+	return [t, ...e];
+}
+function it(e, t) {
+	return [...e, ...t];
+}
+function at(e, t = 1) {
+	if (t <= 0 || e.length === 0) return {
+		remaining: [...e],
+		removed: []
+	};
+	let n = Math.max(0, e.length - t);
+	return {
+		remaining: e.slice(0, n),
+		removed: e.slice(n).reverse()
+	};
+}
+function ot(e, t = 1) {
+	if (t <= 0 || e.length === 0) return {
+		remaining: [...e],
+		removed: []
+	};
+	let n = Math.min(e.length, t);
+	return {
+		remaining: e.slice(n),
+		removed: e.slice(0, n)
+	};
+}
+function st(e, t, n, r = []) {
+	let i = [...e];
+	return {
+		remaining: i,
+		removed: n === void 0 ? i.splice(t) : i.splice(t, n, ...r)
+	};
+}
+function ct(e, t) {
+	let n = e.indexOf(t);
+	if (n === -1) return {
+		remaining: [...e],
+		removed: void 0
+	};
+	let r = [...e], [i] = r.splice(n, 1);
+	return {
+		remaining: r,
+		removed: i
+	};
+}
+function lt(e, t) {
+	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set();
+	for (let e of t) typeof e == "number" ? n.add(e) : r.add(e);
+	let i = e.filter((e, t) => !n.has(t));
+	return r.size > 0 && (i = i.map((e) => {
+		if (!m(e)) return e;
+		let t = {};
+		for (let [n, i] of Object.entries(e)) r.has(n) || (t[n] = i);
+		return t;
+	})), i;
+}
+function ut(e, t, n) {
+	return e.map((e) => ({
+		...e,
+		[t]: n
+	}));
+}
+function dt(e, ...t) {
+	let n = (e, t) => {
+		if (Array.isArray(e) && Array.isArray(t)) return [...e, ...t];
+		if (m(e) && m(t)) {
+			let r = { ...e };
+			for (let [e, i] of Object.entries(t)) r[e] = e in r ? n(r[e], i) : i;
+			return r;
+		}
+		return e !== void 0 && t !== void 0 ? [e, t] : t ?? e;
+	}, r = [...e];
+	for (let e of t) {
+		let t = Math.max(r.length, e.length), i = [];
+		for (let a = 0; a < t; a++) a >= r.length ? i.push(e[a]) : a >= e.length ? i.push(r[a]) : i.push(n(r[a], e[a]));
+		r = i;
+	}
+	return r;
+}
+function V(e, t) {
+	return e.length === 1 && t.length === 1 && m(e[0]) && m(t[0]) ? [{
+		...e[0],
+		...t[0]
+	}] : [...e, ...t];
+}
+//#endregion
+//#region src/support/deepClone.ts
+function H(e) {
+	if (typeof e != "object" || !e) return e;
+	if (e instanceof Date) return new Date(e.getTime());
+	if (e instanceof RegExp) return new RegExp(e.source, e.flags);
+	if (Array.isArray(e)) return e.map(H);
+	if (m(e)) {
+		let t = {};
+		for (let n of Object.keys(e)) t[n] = H(e[n]);
+		return t;
+	}
+	return e;
+}
+//#endregion
+//#region src/operations/objectOps.ts
+function ft(e, t, n) {
+	if (n === void 0) return e.map((e) => g(e, t));
+	let r = {};
+	for (let i of e) {
+		let e = g(i, n);
+		r[String(e)] = g(i, t);
+	}
+	return r;
+}
+function pt(e, t) {
+	let n = new Set(t.map(String));
+	return e.map((e) => {
+		if (!h(e)) return {};
+		let t = {};
+		for (let r of n) r in e && (t[r] = e[r]);
+		return t;
+	});
+}
+function mt(e, t) {
+	let n = new Set(t.map(String));
+	return e.map((e) => {
+		if (!h(e)) return e;
+		let t = {};
+		for (let [r, i] of Object.entries(e)) n.has(r) || (t[r] = i);
+		return t;
+	});
+}
+function ht(e, t) {
+	let n = Array.isArray(t) ? t : [t];
+	return e.map((e) => {
+		let t = {};
+		for (let r of n) t[r] = e[r];
+		return t;
+	});
+}
+function gt(e) {
+	let t = {};
+	for (let n = 0; n < e.length; n++) t[String(e[n])] = n;
+	return t;
+}
+function _t(e) {
+	if (e.length === 0) return [];
+	if (e.every((e) => m(e))) {
+		let t = /* @__PURE__ */ new Set();
+		for (let n of e) for (let e of Object.keys(n)) t.add(e);
+		return [...t];
+	}
+	return e.map((e, t) => String(t));
+}
+function vt(e) {
+	if (e.length === 0) return {};
+	let t = {}, n = (e, r) => {
+		if (m(e)) {
+			let i = Object.entries(e);
+			if (i.length === 0) {
+				r !== "" && (t[r] = e);
+				return;
+			}
+			for (let [e, t] of i) n(t, r === "" ? e : `${r}.${e}`);
+		} else if (Array.isArray(e)) {
+			if (e.length === 0) {
+				r !== "" && (t[r] = e);
+				return;
+			}
+			for (let t = 0; t < e.length; t++) n(e[t], r === "" ? String(t) : `${r}.${t}`);
+		} else r !== "" && (t[r] = e);
+	};
+	return e.length === 1 && m(e[0]) ? n(e[0], "") : n(e, ""), t;
+}
+function yt(e) {
+	let t = e.length === 1 && m(e[0]) ? e[0] : e.reduce((e, t, n) => {
+		if (m(t)) for (let [n, r] of Object.entries(t)) e[n] = r;
+		else e[String(n)] = t;
+		return e;
+	}, {}), n = {};
+	for (let [e, r] of Object.entries(t)) te(n, e, r);
+	return n;
+}
+function bt(e, t) {
+	let n = [...e];
+	for (let [e, r] of Object.entries(t)) {
+		let t = Number(e);
+		Number.isInteger(t) && t >= 0 && (n[t] = r);
+	}
+	return n;
+}
+function xt(e, t) {
+	let n = (e, t) => {
+		if (Array.isArray(e) && Array.isArray(t)) {
+			let r = [...e];
+			for (let e = 0; e < t.length; e++) r[e] = n(r[e], t[e]);
+			return r;
+		}
+		if (m(e) && m(t)) {
+			let r = { ...e };
+			for (let [i, a] of Object.entries(t)) r[i] = n(e[i], a);
+			return r;
+		}
+		return t === void 0 ? e : t;
+	};
+	return n(H([...e]), [...t]);
+}
+//#endregion
+//#region src/operations/sorting.ts
+var St = (e, t) => e === t ? 0 : e == null ? 1 : t == null ? -1 : typeof e == "number" && typeof t == "number" ? e - t : String(e).localeCompare(String(t));
+function Ct(e, t = St) {
+	return [...e].sort(t);
+}
+function wt(e) {
+	return [...e].sort((e, t) => -St(e, t));
+}
+function U(e, t, n = !1) {
+	let r = (Array.isArray(t) && !Tt(t) ? t : [t]).map((e) => Et(e, n));
+	return [...e].sort((e, t) => {
+		for (let n of r) {
+			let r = n(e, t);
+			if (r !== 0) return r;
+		}
+		return 0;
+	});
+}
+function Tt(e) {
+	return Array.isArray(e) && e.length === 2 && (e[1] === "asc" || e[1] === "desc");
+}
+function Et(e, t) {
+	if (typeof e == "function" && e.length === 2) return e;
+	if (Tt(e)) {
+		let [t, n] = e;
+		return Dt(t, n === "desc");
+	}
+	return Dt(e, t);
+}
+function Dt(e, t) {
+	let n = C(e);
+	return (e, r) => {
+		let i = St(n(e, 0), n(r, 0));
+		return t ? -i : i;
+	};
+}
+function Ot(e, t) {
+	return U(e, t, !0);
+}
+function W(e, t = !1) {
+	return e.map((e) => {
+		if (typeof e != "object" || !e) return e;
+		let n = Object.keys(e).sort();
+		t && n.reverse();
+		let r = {};
+		for (let t of n) r[t] = e[t];
+		return r;
+	});
+}
+function kt(e, t) {
+	return e.map((e) => {
+		if (typeof e != "object" || !e) return e;
+		let n = Object.keys(e).sort(t), r = {};
+		for (let t of n) r[t] = e[t];
+		return r;
+	});
+}
+function G(e, t = Math.random) {
+	let n = [...e];
+	for (let e = n.length - 1; e > 0; e--) {
+		let r = Math.floor(t() * (e + 1));
+		[n[e], n[r]] = [n[r], n[e]];
+	}
+	return n;
+}
+function At(e) {
+	return [...e].reverse();
+}
+//#endregion
+//#region src/operations/random.ts
+function K(e, t = Math.random) {
+	if (e.length !== 0) return e[Math.floor(t() * e.length)];
+}
+function jt(e, t, r = Math.random) {
+	if (t > e.length) throw new n(`You requested ${t} items, but the collection only contains ${e.length} items.`);
+	return t <= 0 ? [] : G(e, r).slice(0, t);
+}
+//#endregion
+//#region src/operations/reducers.ts
+function Mt(e, t, n) {
+	let r = n;
+	for (let n = 0; n < e.length; n++) r = t(r, e[n], n);
+	return r;
+}
+function Nt(e, t, ...n) {
+	let r = n;
+	for (let n = 0; n < e.length; n++) r = t(...r, e[n], n);
+	return r;
+}
+//#endregion
+//#region src/operations/sequence.ts
+function Pt(e, t, n = 1) {
+	if (n === 0) throw RangeError("range step must not be zero");
+	let r = n > 0, i = [];
+	if (r) for (let r = e; r <= t; r += n) i.push(r);
+	else for (let r = e; r >= t; r += n) i.push(r);
+	return i;
+}
+function Ft(e, t) {
+	let n = Array(e);
+	for (let r = 0; r < e; r++) n[r] = t(r + 1);
+	return n;
+}
+function It(e, t) {
+	if (t <= 0) return [];
+	let n = [];
+	for (let r = 0; r < t; r++) n.push(...e);
+	return n;
+}
+function Lt(e, t, n) {
+	let r = Math.abs(t);
+	if (e.length >= r) return [...e];
+	let i = Array(r - e.length).fill(n);
+	return t < 0 ? [...i, ...e] : [...e, ...i];
+}
+//#endregion
+//#region src/operations/setOps.ts
+function Rt(e, t) {
+	return e.filter((e) => !t.some((t) => v(e, t)));
+}
+function zt(e, t) {
+	if (e.length === 0) return [];
+	let n = t[0] && h(t[0]) ? Object.entries(t[0]) : [];
+	return e.filter((e) => h(e) ? Object.entries(e).some(([e, t]) => {
+		let r = n.find(([t]) => t === e);
+		return !r || !v(r[1], t);
+	}) : !0);
+}
+function Bt(e, t, n) {
+	return e.filter((e) => !t.some((t) => n(e, t) === 0));
+}
+function Vt(e, t) {
+	let n = new Set(t.map(String));
+	return e.map((e) => {
+		if (!h(e)) return e;
+		let t = {};
+		for (let [r, i] of Object.entries(e)) n.has(r) || (t[r] = i);
+		return t;
+	});
+}
+function Ht(e, t) {
+	return e.filter((e) => t.some((t) => v(e, t)));
+}
+function Ut(e, t, n) {
+	return e.filter((e) => t.some((t) => n(e, t) === 0));
+}
+function Wt(e, t) {
+	if (e.length === 0) return [];
+	let n = t[0] && h(t[0]) ? t[0] : {};
+	return e.map((e) => {
+		if (!h(e)) return e;
+		let t = {};
+		for (let [r, i] of Object.entries(e)) Object.prototype.hasOwnProperty.call(n, r) && v(n[r], i) && (t[r] = i);
+		return t;
+	});
+}
+function Gt(e, t, n) {
+	return e.length === 0 ? [] : e.map((e) => {
+		if (!h(e)) return e;
+		let r = e, i = {};
+		for (let [e, a] of Object.entries(r)) Object.entries(t).find(([t, r]) => n(t, e) === 0 && n(String(r), String(a)) === 0) && (i[e] = a);
+		return i;
+	});
+}
+function Kt(e, t) {
+	let n = new Set(t.map(String));
+	return e.map((e) => {
+		if (!h(e)) return e;
+		let t = {};
+		for (let [r, i] of Object.entries(e)) n.has(r) && (t[r] = i);
+		return t;
+	});
+}
+function qt(e, t) {
+	let n = [...e];
+	for (let e of t) n.some((t) => v(t, e)) || n.push(e);
+	return n;
+}
+function Jt(e, t) {
+	if (e.length === 0) return [...t];
+	let n = { ...e[0] };
+	for (let e of t) if (h(e)) for (let [t, r] of Object.entries(e)) t in n || (n[t] = r);
+	return [n];
+}
+function Yt(...e) {
+	return e.length === 0 ? [] : e.reduce((e, t) => {
+		let n = [];
+		for (let r of e) for (let e of t) n.push([...r, e]);
+		return n;
+	}, [[]]);
+}
+function Xt(e, t, n = !1) {
+	let r = [], i = /* @__PURE__ */ new Map();
+	for (let a = 0; a < e.length; a++) {
+		let o = t ? t(e[a]) : e[a];
+		(n ? r.some((e) => e === o || _(e, o)) : r.some((e) => v(e, o))) ? i.set(a, e[a]) : r.push(o);
+	}
+	return i;
+}
+//#endregion
+//#region src/operations/sliceOps.ts
+function Zt(e, t) {
+	return t < 0 ? e.slice(t) : e.slice(0, t);
+}
+function Qt(e, t) {
+	let n = typeof t == "function" ? e.findIndex(t) : e.findIndex((e) => v(e, t));
+	return n === -1 ? [...e] : e.slice(0, n);
+}
+function $t(e, t) {
+	let n = e.findIndex((e, n) => !t(e, n));
+	return n === -1 ? [...e] : e.slice(0, n);
+}
+function en(e, t) {
+	return e.slice(t);
+}
+function tn(e, t) {
+	let n = typeof t == "function" ? e.findIndex(t) : e.findIndex((e) => v(e, t));
+	return n === -1 ? [] : e.slice(n);
+}
+function nn(e, t) {
+	let n = e.findIndex((e, n) => !t(e, n));
+	return n === -1 ? [] : e.slice(n);
+}
+function rn(e, t, n) {
+	return n === void 0 ? e.slice(t) : n < 0 ? e.slice(t, e.length + n) : e.slice(t, t + n);
+}
+//#endregion
+//#region src/operations/stats.ts
+function q(e, t) {
+	let n = C(t), r = [];
+	for (let t = 0; t < e.length; t++) {
+		let i = n(e[t], t), a = typeof i == "number" ? i : Number(i);
+		Number.isFinite(a) && r.push(a);
+	}
+	return r;
+}
+function an(e, t) {
+	let n = q(e, t);
+	if (n.length === 0) return;
+	let r = n.reduce((e, t) => e + t, 0) / n.length, i = 0;
+	for (let e of n) i += (e - r) ** 2;
+	return i / n.length;
+}
+function on(e, t) {
+	let n = q(e, t);
+	if (n.length < 2) return;
+	let r = n.reduce((e, t) => e + t, 0) / n.length, i = 0;
+	for (let e of n) i += (e - r) ** 2;
+	return i / (n.length - 1);
+}
+function sn(e, t) {
+	let n = an(e, t);
+	return n === void 0 ? void 0 : Math.sqrt(n);
+}
+function cn(e, t) {
+	let n = on(e, t);
+	return n === void 0 ? void 0 : Math.sqrt(n);
+}
+function ln(e, t, n) {
+	if (t < 0 || t > 1) throw RangeError(`quantile q must be in [0,1] (got ${t})`);
+	let r = q(e, n).sort((e, t) => e - t);
+	if (r.length === 0) return;
+	if (r.length === 1) return r[0];
+	let i = t * (r.length - 1), a = Math.floor(i), o = Math.ceil(i);
+	return a === o ? r[a] : r[a] + (r[o] - r[a]) * (i - a);
+}
+function un(e, t, n) {
+	return ln(e, t / 100, n);
+}
+function dn(e, t, n = {}) {
+	if (t <= 0 || !Number.isInteger(t)) throw RangeError(`bins must be a positive integer (got ${t})`);
+	let r = q(e, n.by);
+	if (r.length === 0) return [];
+	let [i, a] = n.range ?? [Math.min(...r), Math.max(...r)];
+	if (i === a) return [{
+		from: i,
+		to: a,
+		count: r.length
+	}];
+	let o = (a - i) / t, s = Array.from({ length: t }, (e, t) => ({
+		from: i + t * o,
+		to: i + (t + 1) * o,
+		count: 0
+	}));
+	for (let e of r) {
+		if (e < i || e > a) continue;
+		let n = e === a ? t - 1 : Math.floor((e - i) / o);
+		s[n].count++;
+	}
+	return s;
+}
+function fn(e, t, n) {
+	if (e.length < 2) return;
+	let r = q(e, t), i = q(e, n), a = Math.min(r.length, i.length);
+	if (a < 2) return;
+	let o = 0, s = 0;
+	for (let e = 0; e < a; e++) o += r[e], s += i[e];
+	let c = o / a, l = s / a, u = 0, d = 0, f = 0;
+	for (let e = 0; e < a; e++) {
+		let t = r[e] - c, n = i[e] - l;
+		u += t * n, d += t * t, f += n * n;
+	}
+	let p = Math.sqrt(d * f);
+	return p === 0 ? void 0 : u / p;
+}
+//#endregion
+//#region src/operations/strings.ts
+function J(e, t, n, r) {
+	if (typeof t == "function") {
+		let r = n ?? "";
+		return e.map((e, n) => t(e, n)).join(r);
+	}
+	return r === void 0 ? e.map((e) => String(e ?? "")).join(t) : e.map((e) => String(g(e, r) ?? "")).join(t);
+}
+function pn(e, t, n) {
+	let r = e.map((e) => String(e ?? ""));
+	return n === void 0 || r.length <= 1 ? r.join(t) : `${r.slice(0, -1).join(t)}${n}${r[r.length - 1]}`;
+}
+//#endregion
+//#region src/operations/transformations.ts
+function mn(e, t) {
+	let n = Array(e.length);
+	for (let r = 0; r < e.length; r++) n[r] = t(e[r], r);
+	return n;
+}
+function hn(e, t) {
+	return e.map((e) => new t(e));
+}
+function gn(e, t) {
+	return e.map((e) => t(...e));
+}
+function _n(e, t) {
+	let n = {};
+	for (let r = 0; r < e.length; r++) {
+		let [i, a] = t(e[r], r);
+		n[i] === void 0 && (n[i] = []), n[i].push(a);
+	}
+	return n;
+}
+function vn(e, t) {
+	let n = {};
+	for (let r = 0; r < e.length; r++) {
+		let [i, a] = t(e[r], r);
+		n[i] = a;
+	}
+	return n;
+}
+function yn(e, t) {
+	let n = [];
+	for (let r = 0; r < e.length; r++) {
+		let i = t(e[r], r);
+		Array.isArray(i) ? n.push(...i) : n.push(i);
+	}
+	return n;
+}
+function bn(e, t = Infinity) {
+	let n = [], r = (e, t) => {
+		for (let i of e) Array.isArray(i) && t > 0 ? r(i, t - 1) : typeof i == "object" && i && Object.getPrototypeOf(i) === Object.prototype && t > 0 ? r(Object.values(i), t - 1) : n.push(i);
+	};
+	return r(e, t), n;
+}
+function xn(e) {
+	let t = [];
+	for (let n of e) Array.isArray(n) ? t.push(...n) : t.push(n);
+	return t;
+}
+//#endregion
+//#region src/operations/uniqueness.ts
+function Y(e, t, n = !1) {
+	let r = t === void 0 ? (e) => e : C(t), i = [], a = [];
+	for (let t = 0; t < e.length; t++) {
+		let o = r(e[t], t);
+		(n ? i.some((e) => e === o || _(e, o)) : i.some((e) => v(e, o))) || (i.push(o), a.push(e[t]));
+	}
+	return a;
+}
+function Sn(e, t) {
+	return Y(e, t, !0);
+}
+//#endregion
+//#region src/operations/index.ts
+var Cn = /* @__PURE__ */ t({
+	afterOf: () => le,
+	averageOf: () => T,
+	beforeOf: () => ue,
+	buildFirstWhereSpec: () => S,
+	buildWhereSpec: () => M,
+	chunkOf: () => ye,
+	chunkWhileOf: () => be,
+	collapseOf: () => xn,
+	combinationsOf: () => z,
+	combineOf: () => je,
+	concatOf: () => it,
+	containsOf: () => k,
+	correlationOf: () => fn,
+	countByOf: () => ve,
+	crossJoinOf: () => Yt,
+	cycleOf: () => qe,
+	diffAssocOf: () => zt,
+	diffAssocUsingOf: () => Bt,
+	diffKeysOf: () => Vt,
+	diffOf: () => Rt,
+	doesntContainOf: () => De,
+	dotOf: () => vt,
+	duplicatesOf: () => Xt,
+	enumerateOf: () => Ke,
+	everyOf: () => Oe,
+	exceptOf: () => mt,
+	filterOf: () => Fe,
+	firstOf: () => x,
+	firstOrFailOf: () => ne,
+	firstWhereOf: () => re,
+	flatMapOf: () => yn,
+	flattenOf: () => bn,
+	flipOf: () => gt,
+	forPageOf: () => we,
+	forgetOf: () => lt,
+	getAt: () => ae,
+	groupByManyOf: () => L,
+	groupByOf: () => I,
+	hasAnyKey: () => fe,
+	hasKey: () => de,
+	histogramOf: () => dn,
+	implodeOf: () => J,
+	interleaveOf: () => Je,
+	intersectAssocOf: () => Wt,
+	intersectAssocUsingOf: () => Gt,
+	intersectByKeysOf: () => Kt,
+	intersectOf: () => Ht,
+	intersectUsingOf: () => Ut,
+	joinOf: () => pn,
+	joinOnOf: () => Qe,
+	keyByOf: () => R,
+	keysOf: () => _t,
+	lastOf: () => ie,
+	leftJoinOf: () => $e,
+	likeToRegExp: () => P,
+	mapIntoOf: () => hn,
+	mapOf: () => mn,
+	mapSpreadOf: () => gn,
+	mapToGroupsOf: () => _n,
+	mapWithKeysOf: () => vn,
+	maxOf: () => E,
+	medianOf: () => he,
+	mergeOf: () => V,
+	mergeRecursiveOf: () => dt,
+	minOf: () => D,
+	modeOf: () => ge,
+	multiplyOf: () => It,
+	nthOf: () => Te,
+	onlyOf: () => pt,
+	outerJoinOf: () => tt,
+	padOf: () => Lt,
+	pairwiseOf: () => Ge,
+	partitionOf: () => O,
+	percentageOf: () => _e,
+	percentileOf: () => un,
+	permutationsOf: () => Xe,
+	pluckOf: () => ft,
+	popOf: () => at,
+	powerSetOf: () => Ze,
+	prependOf: () => rt,
+	pullOf: () => ct,
+	pushOf: () => nt,
+	putOf: () => ut,
+	quantileOf: () => ln,
+	randomMany: () => jt,
+	randomOne: () => K,
+	rangeOf: () => Pt,
+	reduceOf: () => Mt,
+	reduceSpreadOf: () => Nt,
+	rejectOf: () => Ie,
+	replaceRecursiveOf: () => xt,
+	replaceShallow: () => bt,
+	resolveCondition: () => Pe,
+	resolveContainsSpec: () => A,
+	reverseOf: () => At,
+	rightJoinOf: () => et,
+	sampleStddevOf: () => cn,
+	sampleVarianceOf: () => on,
+	scanOf: () => We,
+	searchOf: () => Ae,
+	selectOf: () => ht,
+	shiftOf: () => ot,
+	shuffleOf: () => G,
+	skipOf: () => en,
+	skipUntilOf: () => tn,
+	skipWhileOf: () => nn,
+	sliceOf: () => rn,
+	slidingOf: () => xe,
+	soleOf: () => se,
+	someOf: () => ke,
+	sortByDescOf: () => Ot,
+	sortByOf: () => U,
+	sortDescOf: () => wt,
+	sortKeysOf: () => W,
+	sortKeysUsingOf: () => kt,
+	sortOf: () => Ct,
+	spliceOf: () => st,
+	splitInOf: () => Ce,
+	splitOf: () => Se,
+	stddevOf: () => sn,
+	sumOf: () => w,
+	takeOf: () => Zt,
+	takeUntilOf: () => Qt,
+	takeWhileOf: () => $t,
+	teeOf: () => Ye,
+	timesOf: () => Ft,
+	undotOf: () => yt,
+	unionObjectsOf: () => Jt,
+	unionOf: () => qt,
+	uniqueOf: () => Y,
+	uniqueStrictOf: () => Sn,
+	valueOfFirst: () => oe,
+	varianceOf: () => an,
+	whenOf: () => j,
+	whereBetweenOf: () => ze,
+	whereInOf: () => Re,
+	whereInstanceOfOf: () => Ue,
+	whereLikeOf: () => F,
+	whereNotBetweenOf: () => Be,
+	whereNotInOf: () => N,
+	whereNotNullOf: () => He,
+	whereNullOf: () => Ve,
+	whereOf: () => Le,
+	zipManyOf: () => Ne,
+	zipOf: () => Me
+});
+//#endregion
+//#region src/contracts/Arrayable.ts
+function wn(e) {
+	return typeof e == "object" && !!e && typeof e.toArray == "function";
+}
+//#endregion
+//#region src/support/arrayWrap.ts
+function Tn(e) {
+	return Array.isArray(e) ? e : wn(e) ? e.toArray() : typeof e == "object" && e && Symbol.iterator in e || typeof e == "object" && e && "length" in e ? Array.from(e) : [e];
+}
+function En(e) {
+	return e == null ? [] : Array.isArray(e) ? e : [e];
+}
+function Dn(e) {
+	return Array.isArray(e) ? e : Array.from(e);
+}
+//#endregion
+//#region src/collection/Collection.ts
+function X(e) {
+	let t = function(t) {
+		return typeof t == "function" || typeof t == "string" ? e(t) : e();
+	};
+	return new Proxy(t, {
+		get(n, r) {
+			return typeof r == "symbol" ? t[r] : e((e) => g(e, r));
+		},
+		apply(t, n, r) {
+			let i = r[0];
+			return typeof i == "function" || typeof i == "string" ? e(i) : e();
+		}
+	});
+}
+var Z = class e {
+	items;
+	constructor(e = []) {
+		this.items = e == null ? [] : Dn(Tn(e));
+	}
+	[Symbol.iterator]() {
+		return this.items[Symbol.iterator]();
+	}
+	get [Symbol.toStringTag]() {
+		return "Collection";
+	}
+	get length() {
+		return this.items.length;
+	}
+	static make(t = []) {
+		return new e(t);
+	}
+	static fromJson(t) {
+		return new e(En(JSON.parse(t)));
+	}
+	static times(t, n) {
+		return new e(Ft(t, n));
+	}
+	static range(t, n, r = 1) {
+		return new e(Pt(t, n, r));
+	}
+	static wrap(t) {
+		return t instanceof e ? new e(t.toArray()) : new e(En(t));
+	}
+	static unwrap(t) {
+		return t instanceof e ? t.toArray() : t;
+	}
+	static empty() {
+		return new e([]);
+	}
+	static fromEntries(t) {
+		return new e([Object.fromEntries(t)]);
+	}
+	static fromMap(t) {
+		return new e([...t.entries()]);
+	}
+	static fromSet(t) {
+		return new e([...t]);
+	}
+	get sum() {
+		let e = this.items;
+		return X((t) => w(e, t));
+	}
+	get average() {
+		let e = this.items;
+		return X((t) => T(e, t));
+	}
+	get avg() {
+		return this.average;
+	}
+	get max() {
+		let e = this.items;
+		return X((t) => E(e, t));
+	}
+	get min() {
+		let e = this.items;
+		return X((t) => D(e, t));
+	}
+	all() {
+		return this.items;
+	}
+	first(e) {
+		return x(this.items, e);
+	}
+	firstOrFail(e) {
+		return ne(this.items, e);
+	}
+	firstWhere(e, ...t) {
+		let n = S(t[0], t[1], t.length + 1);
+		return re(this.items, e, n);
+	}
+	last(e) {
+		return ie(this.items, e);
+	}
+	get(e, t) {
+		let n = ae(this.items, e);
+		if (n !== void 0) return n;
+		if (t !== void 0) return typeof t == "function" ? t() : t;
+	}
+	value(e) {
+		return oe(this.items, e);
+	}
+	sole(e, t) {
+		return se(this.items, e, t);
+	}
+	after(e, t = !1) {
+		return le(this.items, e, t);
+	}
+	before(e, t = !1) {
+		return ue(this.items, e, t);
+	}
+	random(t) {
+		if (t === void 0) return K(this.items);
+		let n = typeof t == "function" ? t(this) : t;
+		return new e(jt(this.items, n));
+	}
+	contains(e, ...t) {
+		let n = A(e, t[0], t.length >= 1);
+		return k(this.items, n, !1);
+	}
+	containsStrict(e, ...t) {
+		let n = A(e, t[0], t.length >= 1);
+		return k(this.items, n, !0);
+	}
+	doesntContain(e, ...t) {
+		return !this.contains(e, ...t);
+	}
+	doesntContainStrict(e, ...t) {
+		return !this.containsStrict(e, ...t);
+	}
+	containsOneItem(e) {
+		return this.hasSole(e);
+	}
+	every(e) {
+		return Oe(this.items, e);
+	}
+	some(e) {
+		return ke(this.items, e);
+	}
+	search(e, t = !1) {
+		return Ae(this.items, e, t);
+	}
+	has(e) {
+		return de(this.items, Array.isArray(e) ? e : [e]);
+	}
+	hasAny(e) {
+		return fe(this.items, e);
+	}
+	hasMany(e) {
+		return e ? this.items.filter((t, n) => e(t, n)).length > 1 : this.items.length > 1;
+	}
+	hasSole(e) {
+		return e ? this.items.filter((t, n) => e(t, n)).length === 1 : this.items.length === 1;
+	}
+	isEmpty() {
+		return this.items.length === 0;
+	}
+	isNotEmpty() {
+		return this.items.length > 0;
+	}
+	count() {
+		return this.items.length;
+	}
+	countBy(e) {
+		let t = ve(this.items, e), n = {};
+		for (let [e, r] of t) n[String(e)] = r;
+		return n;
+	}
+	filter(t) {
+		return new e(Fe(this.items, t));
+	}
+	reject(t) {
+		return new e(Ie(this.items, t));
+	}
+	where(t, ...n) {
+		let r = M([t, ...n], !1);
+		return new e(Le(this.items, t, r));
+	}
+	whereStrict(t, n) {
+		let r = M([t, n], !0);
+		return new e(Le(this.items, t, r));
+	}
+	whereIn(t, n) {
+		return new e(Re(this.items, t, n, !1));
+	}
+	whereInStrict(t, n) {
+		return new e(Re(this.items, t, n, !0));
+	}
+	whereNotIn(t, n) {
+		return new e(N(this.items, t, n, !1));
+	}
+	whereNotInStrict(t, n) {
+		return new e(N(this.items, t, n, !0));
+	}
+	whereBetween(t, n) {
+		return new e(ze(this.items, t, n));
+	}
+	whereNotBetween(t, n) {
+		return new e(Be(this.items, t, n));
+	}
+	whereNull(t) {
+		return new e(Ve(this.items, t));
+	}
+	whereNotNull(t) {
+		return new e(He(this.items, t));
+	}
+	whereLike(t, n, r = !1) {
+		return new e(F(this.items, t, n, r, !1));
+	}
+	whereNotLike(t, n, r = !1) {
+		return new e(F(this.items, t, n, r, !0));
+	}
+	compact() {
+		return new e(this.items.filter((e) => e != null));
+	}
+	whereInstanceOf(t) {
+		return new e(Ue(this.items, t));
+	}
+	map(t) {
+		return new e(mn(this.items, t));
+	}
+	mapInto(t) {
+		return new e(hn(this.items, t));
+	}
+	mapSpread(t) {
+		return new e(gn(this.items, t));
+	}
+	mapToGroups(e) {
+		return _n(this.items, e);
+	}
+	mapWithKeys(e) {
+		return vn(this.items, e);
+	}
+	flatMap(t) {
+		return new e(yn(this.items, t));
+	}
+	flatten(t = Infinity) {
+		return new e(bn(this.items, t));
+	}
+	collapse() {
+		return new e(xn(this.items));
+	}
+	collapseWithKeys() {
+		if (this.items.length === 0) return new e([]);
+		let t = {};
+		for (let n of this.items) if (!(typeof n != "object" || !n)) for (let [r, i] of Object.entries(n)) t[r] = i instanceof e ? i.toArray() : i;
+		return new e([t]);
+	}
+	flip() {
+		return new e([gt(this.items)]);
+	}
+	pluck(t, n) {
+		let r = ft(this.items, t, n);
+		return Array.isArray(r) ? new e(r) : r;
+	}
+	transform(e) {
+		return this.items = mn(this.items, e), this;
+	}
+	replace(t) {
+		return new e(bt(this.items, t));
+	}
+	replaceRecursive(t) {
+		return new e(xt(this.items, t));
+	}
+	sort(t) {
+		return new e(Ct(this.items, t));
+	}
+	sortDesc() {
+		return new e(wt(this.items));
+	}
+	sortBy(t) {
+		return new e(U(this.items, t));
+	}
+	sortByDesc(t) {
+		return new e(Ot(this.items, t));
+	}
+	sortKeys() {
+		return new e(W(this.items));
+	}
+	sortKeysDesc() {
+		return new e(W(this.items, !0));
+	}
+	sortKeysUsing(t) {
+		return new e(kt(this.items, t));
+	}
+	reverse() {
+		return new e(At(this.items));
+	}
+	shuffle(t) {
+		return new e(G(this.items, t));
+	}
+	sumBy(e) {
+		return w(this.items, e);
+	}
+	averageBy(e) {
+		return T(this.items, e);
+	}
+	avgBy(e) {
+		return T(this.items, e);
+	}
+	maxBy(e) {
+		return E(this.items, e);
+	}
+	minBy(e) {
+		return D(this.items, e);
+	}
+	median(e) {
+		return he(this.items, e);
+	}
+	mode(e) {
+		return ge(this.items, e);
+	}
+	percentage(e, t = 2) {
+		return _e(this.items, e, t);
+	}
+	chunk(t) {
+		return new e(ye(this.items, t).map((t) => new e(t)));
+	}
+	chunkWhile(t) {
+		return new e(be(this.items, t).map((t) => new e(t)));
+	}
+	sliding(t, n = 1) {
+		return new e(xe(this.items, t, n).map((t) => new e(t)));
+	}
+	split(t) {
+		return new e(Se(this.items, t).map((t) => new e(t)));
+	}
+	splitIn(t) {
+		return new e(Ce(this.items, t).map((t) => new e(t)));
+	}
+	partition(t) {
+		let [n, r] = O(this.items, t);
+		return [new e(n), new e(r)];
+	}
+	forPage(t, n) {
+		return new e(we(this.items, t, n));
+	}
+	nth(t, n = 0) {
+		return new e(Te(this.items, t, n));
+	}
+	groupBy(e) {
+		return I(this.items, e);
+	}
+	groupByMany(e) {
+		return L(this.items, e);
+	}
+	keyBy(e) {
+		return R(this.items, e);
+	}
+	take(t) {
+		return new e(Zt(this.items, t));
+	}
+	takeUntil(t) {
+		return new e(Qt(this.items, t));
+	}
+	takeWhile(t) {
+		return new e($t(this.items, t));
+	}
+	skip(t) {
+		return new e(en(this.items, t));
+	}
+	skipUntil(t) {
+		return new e(tn(this.items, t));
+	}
+	skipWhile(t) {
+		return new e(nn(this.items, t));
+	}
+	slice(t, n) {
+		return new e(rn(this.items, t, n));
+	}
+	push(...e) {
+		return this.items.push(...e), this;
+	}
+	prepend(e) {
+		return this.items.unshift(e), this;
+	}
+	pop(t) {
+		if (t === void 0) return this.items.pop();
+		let { remaining: n, removed: r } = at(this.items, t);
+		return this.items = n, new e(r);
+	}
+	shift(t) {
+		if (t === void 0) return this.items.shift();
+		let { remaining: n, removed: r } = ot(this.items, t);
+		return this.items = n, new e(r);
+	}
+	pull(e) {
+		let { remaining: t, removed: n } = ct(this.items, e);
+		return this.items = t, n;
+	}
+	forget(e) {
+		let t = Array.isArray(e) ? e : [e];
+		return this.items = lt(this.items, t), this;
+	}
+	splice(t, n, ...r) {
+		let { remaining: i, removed: a } = st(this.items, t, n, r);
+		return this.items = i, new e(a);
+	}
+	put(t, n) {
+		let r = this.items;
+		return new e(ut(r, t, n));
+	}
+	concat(t) {
+		let n = t instanceof e ? t.toArray() : t;
+		return new e(it(this.items, n));
+	}
+	merge(...t) {
+		let n = [...this.items];
+		for (let r of t) {
+			let t = r instanceof e ? r.toArray() : r;
+			n = V(n, t);
+		}
+		return new e(n);
+	}
+	mergeRecursive(...t) {
+		let n = t.map((t) => t instanceof e ? t.toArray() : t);
+		return new e(dt(this.items, ...n));
+	}
+	union(t) {
+		let n = t instanceof e ? t.toArray() : t;
+		return new e(qt(this.items, n));
+	}
+	diff(t) {
+		return new e(Rt(this.items, t instanceof e ? t.toArray() : t));
+	}
+	diffAssoc(t) {
+		return new e(zt(this.items, t instanceof e ? t.toArray() : t));
+	}
+	diffAssocUsing(t, n) {
+		return new e(Bt(this.items, t instanceof e ? t.toArray() : t, n));
+	}
+	diffKeys(t) {
+		return new e(Vt(this.items, t));
+	}
+	intersect(t) {
+		return new e(Ht(this.items, t instanceof e ? t.toArray() : t));
+	}
+	intersectUsing(t, n) {
+		return new e(Ut(this.items, t instanceof e ? t.toArray() : t, n));
+	}
+	intersectAssoc(t) {
+		return new e(Wt(this.items, t instanceof e ? t.toArray() : t));
+	}
+	intersectAssocUsing(t, n) {
+		return new e(Gt(this.items, t, n));
+	}
+	intersectByKeys(t) {
+		return new e(Kt(this.items, t));
+	}
+	crossJoin(...t) {
+		return new e(Yt(this.items.slice(), ...t.map((e) => [...e])));
+	}
+	unique(t) {
+		return new e(Y(this.items, t, !1));
+	}
+	uniqueStrict(t) {
+		return new e(Sn(this.items, t));
+	}
+	duplicates(e) {
+		let t = e === void 0 ? void 0 : C(e), n = Xt(this.items, t ? (e) => t(e, 0) : void 0, !1), r = {};
+		for (let [e, t] of n) r[e] = t;
+		return r;
+	}
+	duplicatesStrict(e) {
+		let t = e === void 0 ? void 0 : C(e), n = Xt(this.items, t ? (e) => t(e, 0) : void 0, !0), r = {};
+		for (let [e, t] of n) r[e] = t;
+		return r;
+	}
+	keys() {
+		return new e(_t(this.items));
+	}
+	values() {
+		return new e([...this.items]);
+	}
+	only(t) {
+		return new e(pt(this.items, t));
+	}
+	except(t) {
+		return new e(mt(this.items, t));
+	}
+	select(t) {
+		return new e(ht(this.items, t));
+	}
+	dot() {
+		return vt(this.items);
+	}
+	undot() {
+		return new e([yt(this.items)]);
+	}
+	each(e) {
+		for (let t = 0; t < this.items.length && e(this.items[t], t) !== !1; t++);
+		return this;
+	}
+	eachSpread(e) {
+		for (let t = 0; t < this.items.length && e(...this.items[t]) !== !1; t++);
+		return this;
+	}
+	tapEach(e) {
+		return this.items.forEach(e), this;
+	}
+	reduce(e, t) {
+		if (t === void 0) {
+			if (this.items.length === 0) throw TypeError("Reduce of empty collection with no initial value");
+			let t = this.items[0];
+			for (let n = 1; n < this.items.length; n++) t = e(t, this.items[n], n);
+			return t;
+		}
+		return Mt(this.items, e, t);
+	}
+	reduceSpread(e, ...t) {
+		return Nt(this.items, e, ...t);
+	}
+	pipe(e) {
+		return e(this);
+	}
+	pipeInto(e) {
+		return new e(this);
+	}
+	pipeThrough(e) {
+		return e.reduce((e, t) => t(e), this);
+	}
+	tap(e) {
+		return e(this), this;
+	}
+	implode(e, t) {
+		return typeof e == "function" ? J(this.items, e, t ?? "") : J(this.items, e, void 0, t);
+	}
+	join(e, t) {
+		return pn(this.items, e, t);
+	}
+	when(e, t, n) {
+		return j(this, e, t, n);
+	}
+	unless(e, t, n) {
+		let r = typeof e == "function" ? (t) => !e(t) : !e;
+		return j(this, r, t, n);
+	}
+	whenEmpty(e, t) {
+		return this.when(this.isEmpty(), e, t);
+	}
+	whenNotEmpty(e, t) {
+		return this.when(this.isNotEmpty(), e, t);
+	}
+	unlessEmpty(e) {
+		return this.whenNotEmpty(e);
+	}
+	unlessNotEmpty(e) {
+		return this.whenEmpty(e);
+	}
+	ensure(...e) {
+		let t = (e) => e.name ?? "object";
+		for (let n of this.items) if (!e.some((e) => typeof e == "string" ? typeof n === e || e === "array" && Array.isArray(n) : n instanceof e)) throw new i(`Collection should only include "${e.map((e) => typeof e == "string" ? e : t(e)).join("|")}" items, but ${typeof n} found.`);
+		return this;
+	}
+	pad(t, n) {
+		return new e(Lt(this.items, t, n));
+	}
+	multiply(t) {
+		return new e(It(this.items, t));
+	}
+	repeat(e) {
+		return this.multiply(e);
+	}
+	times(e) {
+		return this.multiply(e);
+	}
+	combine(t) {
+		let n = t instanceof e ? t.toArray() : t;
+		return je(this.items.map(String), n);
+	}
+	zip(t) {
+		let n = t instanceof e ? t.toArray() : t;
+		return new e(Me(this.items, n));
+	}
+	wrap() {
+		return new e([this.items]);
+	}
+	unwrap() {
+		return this.items.length === 1 ? this.items[0] : [...this.items];
+	}
+	range(t, n, r = 1) {
+		return e.range(t, n, r);
+	}
+	toArray() {
+		return [...this.items];
+	}
+	toJson() {
+		return JSON.stringify(this.items);
+	}
+	toPrettyJson(e = 2) {
+		return JSON.stringify(this.items, null, e);
+	}
+	toMap(e, t) {
+		let n = /* @__PURE__ */ new Map();
+		for (let r = 0; r < this.items.length; r++) n.set(e(this.items[r], r), t(this.items[r], r));
+		return n;
+	}
+	toSet() {
+		return new Set(this.items);
+	}
+	toJSON() {
+		return this.items;
+	}
+	toString() {
+		return this.toJson();
+	}
+	valueOf() {
+		return this.items;
+	}
+	[Symbol.toPrimitive](e) {
+		return e === "number" ? this.items.length : e === "string" ? this.toJson() : this.items;
+	}
+	collect() {
+		return new e([...this.items]);
+	}
+	clone() {
+		return new e(H(this.items));
+	}
+	lazy() {
+		if (On === null) throw Error("LazyCollection not registered yet — internal wiring error.");
+		return new On(this.items);
+	}
+	dump() {
+		return console.log(this.items), this;
+	}
+	dd() {
+		throw this.dump(), new r("Dump-and-die: Collection inspection terminated.");
+	}
+	variance(e) {
+		return an(this.items, e);
+	}
+	sampleVariance(e) {
+		return on(this.items, e);
+	}
+	stddev(e) {
+		return sn(this.items, e);
+	}
+	sampleStddev(e) {
+		return cn(this.items, e);
+	}
+	quantile(e, t) {
+		return ln(this.items, e, t);
+	}
+	percentileAt(e, t) {
+		return un(this.items, e, t);
+	}
+	histogram(e, t) {
+		return dn(this.items, e, t);
+	}
+	correlation(e, t) {
+		return fn(this.items, e, t);
+	}
+	joinOn(t, n, r, i) {
+		let a = t instanceof e ? t.toArray() : t;
+		return new e(Qe(this.items, a, n, r, i));
+	}
+	leftJoin(t, n, r, i) {
+		let a = t instanceof e ? t.toArray() : t;
+		return new e($e(this.items, a, n, r, i));
+	}
+	rightJoin(t, n, r, i) {
+		let a = t instanceof e ? t.toArray() : t;
+		return new e(et(this.items, a, n, r, i));
+	}
+	outerJoin(t, n, r, i) {
+		let a = t instanceof e ? t.toArray() : t;
+		return new e(tt(this.items, a, n, r, i));
+	}
+	scan(t, n) {
+		return new e(We(this.items, t, n));
+	}
+	pairwise() {
+		return new e(Ge(this.items));
+	}
+	enumerate(t = 0) {
+		return new e(Ke(this.items, t));
+	}
+	cycle(t = Infinity) {
+		if (t === Infinity) throw Error("cycle(Infinity) on Collection materialises — use lazy().cycle() for infinite cycles");
+		return new e([...qe(this.items, t)]);
+	}
+	interleave(...t) {
+		return new e(Je(this.items.slice(), ...t.map((t) => t instanceof e ? t.toArray() : [...t])));
+	}
+	permutations(t) {
+		return new e([...Xe(this.items, t)]);
+	}
+	combinations(t) {
+		return new e([...z(this.items, t)]);
+	}
+	powerSet() {
+		return new e([...Ze(this.items)]);
+	}
+	static macro = () => {
+		throw Error("Collection.macro is not yet wired — internal initialisation error.");
+	};
+	static hasMacro = () => !1;
+	static flushMacros = () => void 0;
+};
+f(Z);
+var On = null;
+function kn(e) {
+	On = e;
+}
+//#endregion
+//#region src/helpers/collect.ts
+function An(e = []) {
+	return new Z(e);
+}
+//#endregion
+//#region src/collection/LazyCollection.ts
+function jn(e) {
+	if (typeof e == "function") return e;
+	if (Array.isArray(e) || e instanceof Set || e instanceof Map) return () => e;
+	let t = Array.from(e);
+	return () => t;
+}
+var Q = class e {
+	source;
+	constructor(e = []) {
+		this.source = jn(e);
+	}
+	[Symbol.iterator]() {
+		return this.source()[Symbol.iterator]();
+	}
+	get [Symbol.toStringTag]() {
+		return "LazyCollection";
+	}
+	static make(t = []) {
+		return new e(t);
+	}
+	static empty() {
+		return new e([]);
+	}
+	static range(t, n, r = 1) {
+		return new e(function* () {
+			if (r === 0) throw RangeError("range step must not be zero");
+			if (r > 0) for (let e = t; e <= n; e += r) yield e;
+			else for (let e = t; e >= n; e += r) yield e;
+		});
+	}
+	static times(t, n) {
+		return new e(function* () {
+			for (let e = 1; e <= t; e++) yield n(e);
+		});
+	}
+	static wrap(t) {
+		return t instanceof e ? t : t == null ? e.empty() : typeof t == "object" && t && Symbol.iterator in t ? new e(t) : new e([t]);
+	}
+	static unwrap(t) {
+		return t instanceof e ? t.toArray() : t;
+	}
+	all() {
+		return [...this.source()];
+	}
+	toArray() {
+		return this.all();
+	}
+	toJson() {
+		return JSON.stringify(this.all());
+	}
+	toJSON() {
+		return this.all();
+	}
+	toMap(e, t) {
+		let n = /* @__PURE__ */ new Map(), r = 0;
+		for (let i of this.source()) n.set(e(i, r), t(i, r)), r++;
+		return n;
+	}
+	toSet() {
+		return new Set(this.source());
+	}
+	collect() {
+		return new Z(this.all());
+	}
+	count() {
+		let e = 0, t = this.source()[Symbol.iterator]();
+		for (let n = t.next(); !n.done; n = t.next()) e++;
+		return e;
+	}
+	isEmpty() {
+		return this.source()[Symbol.iterator]().next().done === !0;
+	}
+	isNotEmpty() {
+		return !this.isEmpty();
+	}
+	countBy(e) {
+		let t = C(e), n = {}, r = 0;
+		for (let e of this.source()) {
+			let i = String(t(e, r));
+			n[i] = (n[i] ?? 0) + 1, r++;
+		}
+		return n;
+	}
+	first(e) {
+		let t = 0;
+		for (let n of this.source()) {
+			if (e === void 0 || e(n, t)) return n;
+			t++;
+		}
+	}
+	firstOrFail(e) {
+		let t = this.first(e);
+		if (t === void 0) throw new r();
+		return t;
+	}
+	firstWhere(e, ...t) {
+		let n = S(t[0], t[1], t.length + 1);
+		for (let t of this.source()) {
+			let r = g(t, e);
+			if (n.truthy ? r : y(r, n.operator, n.value)) return t;
+		}
+	}
+	last(e) {
+		let t, n = 0;
+		for (let r of this.source()) (e === void 0 || e(r, n)) && (t = r), n++;
+		return t;
+	}
+	sole(e, t) {
+		return se(this.all(), e, t);
+	}
+	random() {
+		return K(this.all());
+	}
+	contains(e, ...t) {
+		let n = A(e, t[0], t.length >= 1);
+		return k(this.all(), n, !1);
+	}
+	containsStrict(e, ...t) {
+		let n = A(e, t[0], t.length >= 1);
+		return k(this.all(), n, !0);
+	}
+	doesntContain(e, ...t) {
+		return !this.contains(e, ...t);
+	}
+	every(e) {
+		let t = 0;
+		for (let n of this.source()) {
+			if (!e(n, t)) return !1;
+			t++;
+		}
+		return !0;
+	}
+	some(e) {
+		let t = 0;
+		for (let n of this.source()) {
+			if (e(n, t)) return !0;
+			t++;
+		}
+		return !1;
+	}
+	search(e, t = !1) {
+		return Ae(this.all(), e, t);
+	}
+	has(e) {
+		return de(this.all(), Array.isArray(e) ? e : [e]);
+	}
+	sum(e) {
+		return w(this.all(), e);
+	}
+	average(e) {
+		return T(this.all(), e);
+	}
+	avg(e) {
+		return T(this.all(), e);
+	}
+	max(e) {
+		return E(this.all(), e);
+	}
+	min(e) {
+		return D(this.all(), e);
+	}
+	median(e) {
+		return he(this.all(), e);
+	}
+	mode(e) {
+		return ge(this.all(), e);
+	}
+	percentage(e, t = 2) {
+		return _e(this.all(), e, t);
+	}
+	filter(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) (t === void 0 ? r : t(r, e)) && (yield r), e++;
+		});
+	}
+	reject(e) {
+		return this.filter((t, n) => !e(t, n));
+	}
+	where(e, ...t) {
+		let n = M([e, ...t], !1);
+		return this.filter((t) => n.truthy ? !!g(t, e) : y(g(t, e), n.operator, n.value));
+	}
+	whereStrict(e, t) {
+		let n = M([e, t], !0);
+		return this.filter((t) => y(g(t, e), n.operator, n.value));
+	}
+	whereIn(e, t) {
+		return this.whereInFilter(e, t, !1, !1);
+	}
+	whereInStrict(e, t) {
+		return this.whereInFilter(e, t, !0, !1);
+	}
+	whereNotIn(e, t) {
+		return this.whereInFilter(e, t, !1, !0);
+	}
+	whereNotInStrict(e, t) {
+		return this.whereInFilter(e, t, !0, !0);
+	}
+	whereInFilter(e, t, n, r) {
+		return this.filter((i) => {
+			let a = g(i, e), o = t.some((e) => n ? e === a || _(e, a) : v(e, a));
+			return r ? !o : o;
+		});
+	}
+	whereBetween(e, t) {
+		return this.filter((n) => {
+			let r = g(n, e);
+			return r >= t[0] && r <= t[1];
+		});
+	}
+	whereNotBetween(e, t) {
+		return this.filter((n) => {
+			let r = g(n, e);
+			return r < t[0] || r > t[1];
+		});
+	}
+	whereNull(e) {
+		return this.filter((t) => g(t, e) == null);
+	}
+	whereNotNull(e) {
+		return this.filter((t) => g(t, e) != null);
+	}
+	whereLike(e, t, n = !1) {
+		let r = P(t, n);
+		return this.filter((t) => {
+			let n = g(t, e);
+			return n != null && r.test(String(n));
+		});
+	}
+	whereNotLike(e, t, n = !1) {
+		let r = P(t, n);
+		return this.filter((t) => {
+			let n = g(t, e);
+			return !(n != null && r.test(String(n)));
+		});
+	}
+	whereInstanceOf(t) {
+		let n = t, r = this.source;
+		return new e(function* () {
+			for (let e of r()) e instanceof n && (yield e);
+		});
+	}
+	map(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) yield t(r, e), e++;
+		});
+	}
+	mapInto(e) {
+		return this.map((t) => new e(t));
+	}
+	mapSpread(e) {
+		return this.map((t) => e(...t));
+	}
+	mapWithKeys(e) {
+		return vn(this.all(), e);
+	}
+	mapToGroups(e) {
+		return _n(this.all(), e);
+	}
+	flatMap(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) {
+				let n = t(r, e);
+				Array.isArray(n) ? yield* n : yield n, e++;
+			}
+		});
+	}
+	flatten(t = Infinity) {
+		let n = this.source;
+		function* r(e, t) {
+			for (let n of e) Array.isArray(n) && t > 0 ? yield* r(n, t - 1) : m(n) && t > 0 ? yield* r(Object.values(n), t - 1) : yield n;
+		}
+		return new e(() => r(n(), t));
+	}
+	collapse() {
+		let t = this.source;
+		return new e(function* () {
+			for (let e of t()) Array.isArray(e) ? yield* e : yield e;
+		});
+	}
+	pluck(t, n) {
+		if (n === void 0) {
+			let n = this.source;
+			return new e(function* () {
+				for (let e of n()) yield g(e, t);
+			});
+		}
+		let r = {};
+		for (let e of this.source()) r[String(g(e, n))] = g(e, t);
+		return r;
+	}
+	take(t) {
+		if (t < 0) return new e(this.all().slice(t));
+		let n = this.source;
+		return new e(function* () {
+			if (t <= 0) return;
+			let e = n()[Symbol.iterator](), r = 0;
+			for (; r < t;) {
+				let t = e.next();
+				if (t.done) return;
+				yield t.value, r++;
+			}
+		});
+	}
+	takeUntil(t) {
+		let n = this.source, r = typeof t == "function";
+		return new e(function* () {
+			let e = 0;
+			for (let i of n()) {
+				if (r ? t(i, e) : v(i, t)) return;
+				yield i, e++;
+			}
+		});
+	}
+	takeWhile(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) {
+				if (!t(r, e)) return;
+				yield r, e++;
+			}
+		});
+	}
+	skip(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) e >= t && (yield r), e++;
+		});
+	}
+	skipUntil(t) {
+		let n = this.source, r = typeof t == "function";
+		return new e(function* () {
+			let e = !1, i = 0;
+			for (let a of n()) {
+				if (!e) if (r ? t(a, i) : v(a, t)) e = !0;
+				else {
+					i++;
+					continue;
+				}
+				yield a, i++;
+			}
+		});
+	}
+	skipWhile(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = !1, r = 0;
+			for (let i of n()) {
+				if (!e && t(i, r)) {
+					r++;
+					continue;
+				}
+				e = !0, yield i, r++;
+			}
+		});
+	}
+	slice(t, n) {
+		return t < 0 || n !== void 0 && n < 0 ? new e(rn(this.all(), t, n)) : this.skip(t).take(n === void 0 ? Infinity : n);
+	}
+	forPage(e, t) {
+		return this.skip((e - 1) * t).take(t);
+	}
+	nth(t, n = 0) {
+		let r = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let i of r()) e >= n && (e - n) % t === 0 && (yield i), e++;
+		});
+	}
+	chunk(t) {
+		let n = this.source;
+		return new e(function* () {
+			let r = [];
+			for (let i of n()) r.push(i), r.length === t && (yield new e([...r]), r = []);
+			r.length > 0 && (yield new e(r));
+		});
+	}
+	chunkWhile(t) {
+		return new e(be(this.all(), t).map((t) => new e(t)));
+	}
+	partition(t) {
+		let [n, r] = O(this.all(), t);
+		return [new e(n), new e(r)];
+	}
+	groupBy(e) {
+		return I(this.all(), e);
+	}
+	keyBy(e) {
+		return R(this.all(), e);
+	}
+	split(t) {
+		return new e(Se(this.all(), t).map((t) => new e(t)));
+	}
+	splitIn(t) {
+		return new e(Ce(this.all(), t).map((t) => new e(t)));
+	}
+	sort(t) {
+		return new e(Ct(this.all(), t));
+	}
+	sortDesc() {
+		return new e(wt(this.all()));
+	}
+	sortBy(t) {
+		return new e(U(this.all(), t));
+	}
+	sortByDesc(t) {
+		return new e(Ot(this.all(), t));
+	}
+	sortKeys() {
+		return new e(W(this.all()));
+	}
+	sortKeysDesc() {
+		return new e(W(this.all(), !0));
+	}
+	reverse() {
+		return new e(At(this.all()));
+	}
+	shuffle(t) {
+		return new e(G(this.all(), t));
+	}
+	values() {
+		return new e(this.all());
+	}
+	keys() {
+		return new e(_t(this.all()));
+	}
+	diff(t) {
+		return new e(Rt(this.all(), this.materialise(t)));
+	}
+	diffAssoc(t) {
+		return new e(zt(this.all(), this.materialise(t)));
+	}
+	diffKeys(t) {
+		return new e(Vt(this.all(), t));
+	}
+	intersect(t) {
+		return new e(Ht(this.all(), this.materialise(t)));
+	}
+	intersectAssoc(t) {
+		return new e(Wt(this.all(), this.materialise(t)));
+	}
+	intersectByKeys(t) {
+		return new e(Kt(this.all(), t));
+	}
+	union(t) {
+		return new e(qt(this.all(), this.materialise(t)));
+	}
+	crossJoin(...t) {
+		return new e(Yt(this.all(), ...t));
+	}
+	unique(t) {
+		return new e(Y(this.all(), t, !1));
+	}
+	uniqueStrict(t) {
+		return new e(Sn(this.all(), t));
+	}
+	duplicates(e) {
+		return new Z(this.all()).duplicates(e);
+	}
+	duplicatesStrict(e) {
+		return new Z(this.all()).duplicatesStrict(e);
+	}
+	only(t) {
+		return new e(pt(this.all(), t));
+	}
+	except(t) {
+		return new e(mt(this.all(), t));
+	}
+	flip() {
+		return new e([gt(this.all())]);
+	}
+	pad(t, n) {
+		return new e(Lt(this.all(), t, n));
+	}
+	multiply(t) {
+		return new e(It(this.all(), t));
+	}
+	combine(e) {
+		let t = this.materialise(e);
+		return je(this.all().map(String), t);
+	}
+	zip(t) {
+		return new e(Me(this.all(), this.materialise(t)));
+	}
+	concat(t) {
+		let n = this.materialise(t), r = this.source;
+		return new e(function* () {
+			for (let e of r()) yield e;
+			for (let e of n) yield e;
+		});
+	}
+	merge(...t) {
+		let n = [...this.all()];
+		for (let e of t) n = V(n, this.materialise(e));
+		return new e(n);
+	}
+	each(e) {
+		let t = 0;
+		for (let n of this.source()) {
+			if (e(n, t) === !1) break;
+			t++;
+		}
+		return this;
+	}
+	tapEach(t) {
+		let n = this.source;
+		return new e(function* () {
+			let e = 0;
+			for (let r of n()) t(r, e), yield r, e++;
+		});
+	}
+	reduce(e, t) {
+		return Mt(this.all(), e, t);
+	}
+	pipe(e) {
+		return e(this);
+	}
+	pipeInto(e) {
+		return new e(this);
+	}
+	pipeThrough(e) {
+		return e.reduce((e, t) => t(e), this);
+	}
+	tap(e) {
+		return e(this), this;
+	}
+	implode(e, t) {
+		return typeof e == "function" ? J(this.all(), e, t ?? "") : J(this.all(), e, void 0, t);
+	}
+	join(e, t) {
+		return pn(this.all(), e, t);
+	}
+	when(e, t, n) {
+		return j(this, e, t, n);
+	}
+	unless(e, t, n) {
+		let r = typeof e == "function" ? (t) => !e(t) : !e;
+		return j(this, r, t, n);
+	}
+	whenEmpty(e, t) {
+		return this.when(this.isEmpty(), e, t);
+	}
+	whenNotEmpty(e, t) {
+		return this.when(this.isNotEmpty(), e, t);
+	}
+	unlessEmpty(e) {
+		return this.whenNotEmpty(e);
+	}
+	unlessNotEmpty(e) {
+		return this.whenEmpty(e);
+	}
+	takeUntilTimeout(t) {
+		let n = t instanceof Date ? t.getTime() : t, r = this.source;
+		return new e(function* () {
+			for (let e of r()) {
+				if (Date.now() >= n) return;
+				yield e;
+			}
+		});
+	}
+	throttle(e) {
+		let t = this.source, n = Math.max(0, e * 1e3);
+		return { [Symbol.asyncIterator]() {
+			let e = t()[Symbol.iterator](), r = !0;
+			return { async next() {
+				return r || await new Promise((e) => setTimeout(e, n)), r = !1, e.next();
+			} };
+		} };
+	}
+	remember() {
+		let t = [], n = this.source()[Symbol.iterator](), r = !1;
+		return new e(function* () {
+			let e = 0;
+			for (;;) {
+				if (e < t.length) {
+					yield t[e], e++;
+					continue;
+				}
+				if (r) return;
+				let i = n.next();
+				if (i.done) {
+					r = !0;
+					return;
+				}
+				t.push(i.value), yield i.value, e++;
+			}
+		});
+	}
+	withHeartbeat(t, n) {
+		let r = this.source;
+		return new e(function* () {
+			let e = Date.now();
+			for (let i of r()) {
+				let r = Date.now();
+				r - e >= t && (n(), e = r), yield i;
+			}
+		});
+	}
+	static macro = () => {
+		throw Error("LazyCollection.macro is not yet wired — internal initialisation error.");
+	};
+	static hasMacro = () => !1;
+	static flushMacros = () => void 0;
+	materialise(t) {
+		return t instanceof e ? t.all() : t instanceof Z ? t.toArray() : [...t];
+	}
+};
+f(Q), kn(Q);
+//#endregion
+//#region src/async/concurrent.ts
+async function Mn(e, t, n) {
+	if (t <= 0 || !Number.isFinite(t)) throw RangeError(`concurrency must be a positive finite number (got ${t})`);
+	let r = Nn(e) ? e[Symbol.asyncIterator]() : Pn(e), i = [], a = /* @__PURE__ */ new Set(), o = 0, s, c = !1, l = async () => {
+		if (c || s !== void 0) return;
+		let e = await r.next();
+		if (e.done) {
+			c = !0;
+			return;
+		}
+		let t = o++, l = Promise.resolve(n(e.value, t)).then((e) => {
+			i[t] = e;
+		}).catch((e) => {
+			s === void 0 && (s = e);
+		}).finally(() => {
+			a.delete(l);
+		});
+		a.add(l);
+	};
+	for (; a.size < t && !c && s === void 0;) await l();
+	for (; a.size > 0 && (await Promise.race(a), s === void 0);) for (; a.size < t && !c;) await l();
+	if (await Promise.allSettled(a), s !== void 0) throw s;
+	return i;
+}
+function Nn(e) {
+	return typeof e == "object" && !!e && Symbol.asyncIterator in e;
+}
+async function* Pn(e) {
+	for (let t of e) yield t;
+}
+//#endregion
+//#region src/async/AsyncCollection.ts
+function Fn(e) {
+	return typeof e == "function" ? () => In(e()) : () => In(e);
+}
+function In(e) {
+	return Symbol.asyncIterator in e ? e : (async function* () {
+		for (let t of e) yield t;
+	})();
+}
+var Ln = class e {
+	source;
+	constructor(e = []) {
+		this.source = Fn(e);
+	}
+	[Symbol.asyncIterator]() {
+		return this.source()[Symbol.asyncIterator]();
+	}
+	static from(t) {
+		return new e(t);
+	}
+	static fromAsyncIterable(t) {
+		return new e(t);
+	}
+	static range(t, n, r = 1) {
+		if (r === 0) throw RangeError("range step must not be zero");
+		return new e(async function* () {
+			if (r > 0) for (let e = t; e <= n; e += r) yield e;
+			else for (let e = t; e >= n; e += r) yield e;
+		});
+	}
+	static empty() {
+		return new e([]);
+	}
+	async toArray() {
+		let e = [];
+		for await (let t of this.source()) e.push(t);
+		return e;
+	}
+	async collect() {
+		return new Z(await this.toArray());
+	}
+	async toJson() {
+		return JSON.stringify(await this.toArray());
+	}
+	async count() {
+		let e = 0, t = this.source()[Symbol.asyncIterator]();
+		for (let n = await t.next(); !n.done; n = await t.next()) e++;
+		return e;
+	}
+	async first(e) {
+		let t = 0;
+		for await (let n of this.source()) {
+			if (e === void 0 || await e(n, t)) return n;
+			t++;
+		}
+	}
+	async last(e) {
+		let t, n = 0;
+		for await (let r of this.source()) (e === void 0 || await e(r, n)) && (t = r), n++;
+		return t;
+	}
+	async every(e) {
+		let t = 0;
+		for await (let n of this.source()) {
+			if (!await e(n, t)) return !1;
+			t++;
+		}
+		return !0;
+	}
+	async some(e) {
+		let t = 0;
+		for await (let n of this.source()) {
+			if (await e(n, t)) return !0;
+			t++;
+		}
+		return !1;
+	}
+	async reduce(e, t) {
+		let n = t, r = 0;
+		for await (let t of this.source()) n = await e(n, t, r), r++;
+		return n;
+	}
+	async forEach(e) {
+		let t = 0;
+		for await (let n of this.source()) await e(n, t), t++;
+	}
+	async eachAsync(e, t = {}) {
+		let n = t.concurrency ?? 1;
+		await Mn(this.source(), n, async (t, n) => {
+			await e(t, n);
+		});
+	}
+	map(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) yield await t(r, e), e++;
+		});
+	}
+	mapAsync(t, n = {}) {
+		let r = n.concurrency ?? 4, i = this.source;
+		return new e(async function* () {
+			let e = i()[Symbol.asyncIterator](), n = /* @__PURE__ */ new Map(), a = 0, o = 0, s = !1, c = async () => {
+				if (s) return;
+				let r = await e.next();
+				if (r.done) {
+					s = !0;
+					return;
+				}
+				let i = a++;
+				n.set(i, Promise.resolve(t(r.value, i)).then((e) => ({
+					index: i,
+					value: e
+				})));
+			};
+			for (; n.size < r && !s;) await c();
+			for (; n.size > 0;) {
+				let e = n.get(o);
+				if (e) {
+					let { value: t } = await e;
+					n.delete(o), yield t, o++, s || await c();
+				} else await Promise.race(n.values());
+			}
+		});
+	}
+	filter(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) await t(r, e) && (yield r), e++;
+		});
+	}
+	filterAsync(e, t = {}) {
+		return this.mapAsync(async (t, n) => ({
+			item: t,
+			keep: await e(t, n)
+		}), t).filter((e) => e.keep).map((e) => e.item);
+	}
+	flatMap(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) {
+				let n = await t(r, e);
+				if (Symbol.asyncIterator in n) for await (let e of n) yield e;
+				else for (let e of n) yield e;
+				e++;
+			}
+		});
+	}
+	take(t) {
+		let n = this.source;
+		return new e(async function* () {
+			if (t <= 0) return;
+			let e = 0;
+			for await (let r of n()) {
+				if (e >= t) return;
+				yield r, e++;
+			}
+		});
+	}
+	skip(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) e >= t && (yield r), e++;
+		});
+	}
+	takeWhile(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) {
+				if (!await t(r, e)) return;
+				yield r, e++;
+			}
+		});
+	}
+	skipWhile(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = !1, r = 0;
+			for await (let i of n()) {
+				if (!e && await t(i, r)) {
+					r++;
+					continue;
+				}
+				e = !0, yield i, r++;
+			}
+		});
+	}
+	chunk(t) {
+		if (t <= 0) throw RangeError("chunk size must be positive");
+		let n = this.source;
+		return new e(async function* () {
+			let e = [];
+			for await (let r of n()) e.push(r), e.length === t && (yield e, e = []);
+			e.length > 0 && (yield e);
+		});
+	}
+	tap(t) {
+		let n = this.source;
+		return new e(async function* () {
+			let e = 0;
+			for await (let r of n()) await t(r, e), yield r, e++;
+		});
+	}
+};
+//#endregion
+//#region src/helpers/lazy.ts
+function Rn(e = []) {
+	return new Q(e);
+}
+//#endregion
+//#region src/io/csv.ts
+function zn(e, t = {}) {
+	let n = t.delimiter ?? ",", r = t.quote ?? "\"", i = r.length > 0, a = [], o = [], s = "", c = !1, l = 0;
+	for (; l < e.length;) {
+		let t = e[l];
+		if (c) {
+			if (i && t === r) {
+				if (e[l + 1] === r) {
+					s += r, l += 2;
+					continue;
+				}
+				c = !1, l++;
+				continue;
+			}
+			s += t, l++;
+			continue;
+		}
+		if (i && t === r && s === "") {
+			c = !0, l++;
+			continue;
+		}
+		if (t === n) {
+			o.push(s), s = "", l++;
+			continue;
+		}
+		if (t === "\r") {
+			e[l + 1] === "\n" && l++, o.push(s), a.push(o), o = [], s = "", l++;
+			continue;
+		}
+		if (t === "\n") {
+			o.push(s), a.push(o), o = [], s = "", l++;
+			continue;
+		}
+		s += t, l++;
+	}
+	if ((s !== "" || o.length > 0) && (o.push(s), a.push(o)), !t.header) return a;
+	if (a.length === 0) return [];
+	let [u, ...d] = a;
+	return d.map((e) => {
+		let n = {};
+		for (let r = 0; r < u.length; r++) n[u[r]] = t.raw ? e[r] ?? "" : Bn(e[r] ?? "");
+		return n;
+	});
+}
+function Bn(e) {
+	if (e === "") return "";
+	if (e === "true") return !0;
+	if (e === "false") return !1;
+	if (e === "null") return null;
+	if (/^-?\d+(\.\d+)?$/.test(e)) {
+		let t = Number(e);
+		if (Number.isFinite(t)) return t;
+	}
+	return e;
+}
+function Vn(e, t = {}) {
+	let n = t.delimiter ?? ",", r = t.eol ?? "\n";
+	if (e.length === 0) return "";
+	let i = !Array.isArray(e[0]), a = [];
+	if (i) {
+		let r = e, i = t.columns ?? Hn(r);
+		t.header !== !1 && a.push(i.map((e) => $(e, n)).join(n));
+		for (let e of r) a.push(i.map((t) => $(Un(e[t]), n)).join(n));
+	} else {
+		let r = e;
+		t.columns && t.header !== !1 && a.push(t.columns.map((e) => $(e, n)).join(n));
+		for (let e of r) a.push(e.map((e) => $(Un(e), n)).join(n));
+	}
+	return a.join(r);
+}
+function Hn(e) {
+	let t = /* @__PURE__ */ new Set();
+	for (let n of e) for (let e of Object.keys(n)) t.add(e);
+	return [...t];
+}
+function Un(e) {
+	return e == null ? "" : typeof e == "string" ? e : typeof e == "number" || typeof e == "boolean" ? String(e) : JSON.stringify(e);
+}
+function $(e, t) {
+	return e.includes(t) || e.includes("\"") || e.includes("\n") || e.includes("\r") ? `"${e.replace(/"/g, "\"\"")}"` : e;
+}
+//#endregion
+//#region src/io/jsonl.ts
+function Wn(e) {
+	let t = [], n = e.split(/\r?\n/);
+	for (let e = 0; e < n.length; e++) {
+		let r = n[e];
+		if (r.trim() !== "") try {
+			t.push(JSON.parse(r));
+		} catch (t) {
+			throw SyntaxError(`parseJsonl: invalid JSON on line ${e + 1}: ${t.message}`, { cause: t });
+		}
+	}
+	return t;
+}
+function Gn(e, t = "\n") {
+	return e.map((e) => JSON.stringify(e)).join(t);
+}
+async function* Kn(e) {
+	let t = "", n = 0;
+	for await (let r of e) {
+		t += r;
+		let e;
+		for (; (e = t.indexOf("\n")) >= 0;) {
+			n++;
+			let r = t.slice(0, e).replace(/\r$/, "");
+			if (t = t.slice(e + 1), r.trim() !== "") try {
+				yield JSON.parse(r);
+			} catch (e) {
+				throw SyntaxError(`parseJsonlStream: invalid JSON on line ${n}: ${e.message}`, { cause: e });
+			}
+		}
+	}
+	if (t.trim() !== "") {
+		n++;
+		try {
+			yield JSON.parse(t);
+		} catch (e) {
+			throw SyntaxError(`parseJsonlStream: invalid JSON on line ${n}: ${e.message}`, { cause: e });
+		}
+	}
+}
+//#endregion
+//#region src/io/streams.ts
+function qn(e, t = {}) {
+	let n = t.decodeAs === !1 ? null : t.decodeAs ?? "utf-8", r = n ? new TextDecoder(n) : null;
+	return new Ln(async function* () {
+		for await (let t of e) typeof t == "string" ? yield t : r ? yield r.decode(t, { stream: !0 }) : yield String(t);
+		if (r) {
+			let e = r.decode();
+			e.length > 0 && (yield e);
+		}
+	});
+}
+function Jn(e) {
+	return new Ln(async function* () {
+		let t = "", n = new TextDecoder("utf-8");
+		for await (let r of e) {
+			t += typeof r == "string" ? r : n.decode(r, { stream: !0 });
+			let e;
+			for (; (e = t.indexOf("\n")) >= 0;) yield t.slice(0, e).replace(/\r$/, ""), t = t.slice(e + 1);
+		}
+		let r = t + n.decode();
+		r.length > 0 && (yield r);
+	});
+}
+//#endregion
+//#region src/collection/HigherOrderProxy.ts
+var Yn = [
+	"average",
+	"avg",
+	"contains",
+	"doesntContain",
+	"each",
+	"every",
+	"filter",
+	"first",
+	"flatMap",
+	"groupBy",
+	"keyBy",
+	"map",
+	"max",
+	"min",
+	"partition",
+	"reject",
+	"skipUntil",
+	"skipWhile",
+	"some",
+	"sortBy",
+	"sortByDesc",
+	"sum",
+	"takeUntil",
+	"takeWhile",
+	"unique"
+];
+function Xn(e, t) {
+	let n = e[t];
+	if (typeof n != "function") throw TypeError(`Higher-order proxy: method "${t}" not found on host.`);
+	let r = n;
+	return new Proxy({}, { get(t, n) {
+		let i = (e) => {
+			if (e == null) return;
+			let t = e[n];
+			return typeof t == "function" ? t.bind(e) : typeof n == "string" ? g(e, n) : t;
+		};
+		return new Proxy(i, {
+			apply(t, n, a) {
+				return r.call(e, (e) => {
+					let t = i(e);
+					return typeof t == "function" ? t(...a) : t;
+				});
+			},
+			get(t, n) {
+				return r.call(e, i);
+			}
+		});
+	} });
+}
+//#endregion
+//#region src/index.ts
+var Zn = An;
+//#endregion
+export { Ln as AsyncCollection, Z as Collection, n as CollectionException, Yn as HIGHER_ORDER_TARGETS, r as ItemNotFoundException, Q as LazyCollection, p as MultipleItemsFoundException, i as UnexpectedValueException, f as applyMacroable, An as collect, Xn as createHigherOrderProxy, g as dataGet, te as dataSet, H as deepClone, _ as deepEqual, Zn as default, d as flushMacros, qn as fromReadable, u as getMacro, l as hasMacro, wn as isArrayable, ee as isFunction, h as isObjectLike, b as isOperator, m as isPlainObject, Rn as lazy, Jn as lines, v as looseEqual, Mn as mapWithConcurrency, Cn as operations, y as operatorForWhere, zn as parseCsv, Wn as parseJsonl, Kn as parseJsonlStream, c as registerMacro, Vn as toCsv, Gn as toJsonl, C as valueRetriever };