linqx 0.2.0 → 0.3.2

package/dist/src-D_Mk3oMP.js

@@ -0,0 +1,1597 @@
+//#region src/core/enumerator.ts
+var e = class {
+	constructor(e) {
+		this.iterator = e, this.done = !1;
+	}
+	current() {
+		return this.value;
+	}
+	moveNext() {
+		if (this.done) return !1;
+		let e = this.iterator.next();
+		return this.done = !!e.done, this.done || (this.value = e.value), !this.done;
+	}
+	dispose() {
+		this.done = !0, this.iterator.return?.();
+	}
+}, t = class {
+	constructor(e) {
+		this.iteratorFactory = e;
+	}
+	[Symbol.iterator]() {
+		return this.iteratorFactory();
+	}
+	getEnumerator() {
+		return new e(this.iteratorFactory());
+	}
+}, n = class extends t {
+	constructor(e, t) {
+		super(() => {
+			let n = Array.from(e, (e, t) => ({
+				value: e,
+				index: t
+			}));
+			return n.sort((e, n) => {
+				for (let r of t) {
+					let t = r.comparer(r.keySelector(e.value), r.keySelector(n.value));
+					if (t !== 0) return r.descending ? -t : t;
+				}
+				return e.index - n.index;
+			}), n.map((e) => e.value)[Symbol.iterator]();
+		}), this.source = e, this.criteria = t;
+	}
+};
+//#endregion
+//#region src/internal/create-enumerable.ts
+function r(e) {
+	return new t(e);
+}
+function i(e) {
+	return r(e);
+}
+//#endregion
+//#region src/factories/choice.ts
+function a(...e) {
+	return i(function* () {
+		for (; e.length > 0;) yield e[Math.floor(Math.random() * e.length)];
+	});
+}
+//#endregion
+//#region src/factories/cycle.ts
+function o(...e) {
+	return i(function* () {
+		for (; e.length > 0;) yield* e;
+	});
+}
+//#endregion
+//#region src/factories/defer.ts
+function s(e) {
+	return r(() => e()[Symbol.iterator]());
+}
+//#endregion
+//#region src/factories/empty.ts
+function c() {
+	return i(function* () {});
+}
+//#endregion
+//#region src/internal/functions.ts
+var l = (e) => e;
+function u(e, t) {
+	return e === t ? 0 : e == null ? -1 : t == null ? 1 : e < t ? -1 : 1;
+}
+function d(e) {
+	return e != null && typeof e[Symbol.iterator] == "function";
+}
+function f(e) {
+	return e != null && typeof e.length == "number";
+}
+//#endregion
+//#region src/factories/from.ts
+function ee(e) {
+	return e == null ? i(function* () {}) : typeof e == "function" ? r(() => {
+		let t = e();
+		return d(t) ? t[Symbol.iterator]() : t;
+	}) : d(e) ? r(() => e[Symbol.iterator]()) : typeof e.next == "function" ? r(() => e) : f(e) ? i(function* () {
+		for (let t = 0; t < e.length; t++) yield e[t];
+	}) : i(typeof e == "object" ? function* () {
+		for (let t of Object.keys(e)) {
+			let n = e[t];
+			typeof n != "function" && (yield {
+				key: t,
+				value: n
+			});
+		}
+	} : function* () {
+		yield e;
+	});
+}
+//#endregion
+//#region src/factories/generate.ts
+function p(e, t) {
+	return i(function* () {
+		for (let n = 0; t == null || n < t; n++) yield e();
+	});
+}
+//#endregion
+//#region src/factories/make.ts
+function m(e) {
+	return i(function* () {
+		yield e;
+	});
+}
+//#endregion
+//#region src/factories/matches.ts
+function te(e, t, n) {
+	return i(function* () {
+		let r;
+		if (t instanceof RegExp) {
+			let e = t.flags.includes("g") ? t.flags : `${t.flags}g`;
+			r = new RegExp(t.source, e);
+		} else {
+			let e = n ?? "", i = e.includes("g") ? e : `${e}g`;
+			r = new RegExp(t, i);
+		}
+		let i;
+		for (; (i = r.exec(e)) !== null;) yield i, i[0] === "" && r.lastIndex++;
+	});
+}
+//#endregion
+//#region src/factories/range.ts
+function h(e, t, n = 1) {
+	return i(function* () {
+		for (let r = 0; r < t; r++) yield e + r * n;
+	});
+}
+//#endregion
+//#region src/factories/range-down.ts
+function ne(e, t, n = 1) {
+	return h(e, t, -Math.abs(n));
+}
+//#endregion
+//#region src/factories/range-to.ts
+function re(e, t, n = 1) {
+	let r = Math.abs(n);
+	return i(function* () {
+		if (e <= t) for (let n = e; n <= t; n += r) yield n;
+		else for (let n = e; n >= t; n -= r) yield n;
+	});
+}
+//#endregion
+//#region src/factories/repeat.ts
+function ie(e, t) {
+	return i(function* () {
+		for (let n = 0; t == null || n < t; n++) yield e;
+	});
+}
+//#endregion
+//#region src/factories/repeat-with-finalize.ts
+function ae(e, t) {
+	return i(function* () {
+		let n = e();
+		try {
+			for (;;) yield n;
+		} finally {
+			t(n);
+		}
+	});
+}
+//#endregion
+//#region src/factories/to-infinity.ts
+function oe(e = 0, t = 1) {
+	return i(function* () {
+		for (let n = e;; n += t) yield n;
+	});
+}
+//#endregion
+//#region src/factories/to-negative-infinity.ts
+function se(e = 0, t = 1) {
+	return i(function* () {
+		for (let n = e;; n -= t) yield n;
+	});
+}
+//#endregion
+//#region src/factories/unfold.ts
+function ce(e, t) {
+	return i(function* () {
+		let n = e;
+		for (;;) yield n, n = t(n);
+	});
+}
+//#endregion
+//#region src/operators/aggregate.ts
+function g(e, t, n) {
+	if (typeof e == "function" && t === void 0) {
+		let t = this[Symbol.iterator](), n = t.next();
+		if (n.done) throw Error("Sequence contains no elements.");
+		let r = n.value;
+		for (let n = t.next(); !n.done; n = t.next()) r = e(r, n.value);
+		return r;
+	}
+	let r = e;
+	for (let e of this) r = t(r, e);
+	return n ? n(r) : r;
+}
+//#endregion
+//#region src/operators/aggregate-by.ts
+function _(e, t, n, r = l) {
+	let a = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Map();
+		for (let o of a) {
+			let a = e(o), s = r(a), c = i.get(s);
+			c ? c.value = n(c.value, o) : i.set(s, {
+				key: a,
+				value: n(t, o)
+			});
+		}
+		yield* i.values();
+	});
+}
+//#endregion
+//#region src/operators/all.ts
+function v(e) {
+	for (let t of this) if (!e(t)) return !1;
+	return !0;
+}
+//#endregion
+//#region src/internal/to-iterable.ts
+function y(e) {
+	if (d(e)) return e;
+	if (f(e)) return (function* () {
+		for (let t = 0; t < e.length; t++) yield e[t];
+	})();
+	throw TypeError("Value is not enumerable.");
+}
+//#endregion
+//#region src/operators/alternate.ts
+function b(e) {
+	let t = this, n = d(e) || f(e) ? () => y(e) : () => [e];
+	return i(function* () {
+		let e = !0;
+		for (let r of t) e || (yield* n()), e = !1, yield r;
+	});
+}
+//#endregion
+//#region src/operators/any.ts
+function x(e) {
+	for (let t of this) if (!e || e(t)) return !0;
+	return !1;
+}
+//#endregion
+//#region src/operators/append.ts
+function S(e) {
+	let t = this;
+	return i(function* () {
+		yield* t, yield e;
+	});
+}
+//#endregion
+//#region src/operators/as-enumerable.ts
+function C() {
+	let e = this;
+	return i(function* () {
+		yield* e;
+	});
+}
+//#endregion
+//#region src/operators/average.ts
+function w(e = Number) {
+	let t = 0, n = 0;
+	for (let r of this) t += e(r), n++;
+	return t / n;
+}
+//#endregion
+//#region src/operators/buffer.ts
+function T(e) {
+	if (e <= 0) throw RangeError("count must be greater than zero.");
+	let t = this;
+	return i(function* () {
+		let n = [];
+		for (let r of t) n.push(r), n.length === e && (yield n, n = []);
+		n.length > 0 && (yield n);
+	});
+}
+//#endregion
+//#region src/operators/cast.ts
+function E() {
+	return this;
+}
+//#endregion
+//#region src/operators/catch-error.ts
+function D(e) {
+	let t = this;
+	return i(function* () {
+		try {
+			yield* t;
+		} catch (t) {
+			e(t);
+		}
+	});
+}
+//#endregion
+//#region src/operators/choose.ts
+function O(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) {
+			let t = e(r, n++);
+			t != null && (yield t);
+		}
+	});
+}
+//#endregion
+//#region src/operators/chunk.ts
+function k(e) {
+	if (!Number.isInteger(e) || e <= 0) throw RangeError("Chunk size must be a positive integer.");
+	return this.buffer(e);
+}
+//#endregion
+//#region src/operators/concat.ts
+function A(...e) {
+	let t = this;
+	return i(function* () {
+		yield* t;
+		for (let t of e) yield* y(t);
+	});
+}
+//#endregion
+//#region src/operators/contains.ts
+function j(e, t = l) {
+	let n = t(e);
+	for (let e of this) if (t(e) === n) return !0;
+	return !1;
+}
+//#endregion
+//#region src/operators/count.ts
+function M(e) {
+	let t = 0, n = 0;
+	for (let r of this) (!e || e(r, n++)) && t++;
+	return t;
+}
+//#endregion
+//#region src/operators/count-by.ts
+function N(e, t = l) {
+	let n = this;
+	return i(function* () {
+		let r = /* @__PURE__ */ new Map();
+		for (let i of n) {
+			let n = e(i), a = t(n), o = r.get(a);
+			o ? o.value++ : r.set(a, {
+				key: n,
+				value: 1
+			});
+		}
+		yield* r.values();
+	});
+}
+//#endregion
+//#region src/operators/create-ordered-enumerable.ts
+function P(e, t = u, r = !1) {
+	if (!(this instanceof n)) throw TypeError("Source is not an ordered enumerable.");
+	return new n(this.source, [...this.criteria, {
+		keySelector: e,
+		comparer: t,
+		descending: r
+	}]);
+}
+//#endregion
+//#region src/operators/default-if-empty.ts
+function F(e) {
+	let t = this;
+	return i(function* () {
+		let n = !0;
+		for (let e of t) n = !1, yield e;
+		n && (yield e);
+	});
+}
+//#endregion
+//#region src/operators/distinct.ts
+function I(e = l) {
+	let t = this;
+	return i(function* () {
+		let n = /* @__PURE__ */ new Set();
+		for (let r of t) {
+			let t = e(r);
+			n.has(t) || (n.add(t), yield r);
+		}
+	});
+}
+//#endregion
+//#region src/operators/distinct-by.ts
+function L(e, t = l) {
+	return I.call(this, (n) => t(e(n)));
+}
+//#endregion
+//#region src/operators/distinct-until-changed.ts
+function R(e = l) {
+	let t = this;
+	return i(function* () {
+		let n = !1, r;
+		for (let i of t) {
+			let t = e(i);
+			(!n || t !== r) && (n = !0, r = t, yield i);
+		}
+	});
+}
+//#endregion
+//#region src/operators/do-action.ts
+function z(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) {
+			if (e(r, n++) === !1) return;
+			yield r;
+		}
+	});
+}
+//#endregion
+//#region src/operators/element-at.ts
+function B(e) {
+	let t = 0;
+	for (let n of this) if (t++ === e) return n;
+	throw Error("Index is out of range.");
+}
+//#endregion
+//#region src/operators/element-at-or-default.ts
+function V(e, t) {
+	if (e < 0) return t;
+	let n = 0;
+	for (let t of this) if (n++ === e) return t;
+	return t;
+}
+//#endregion
+//#region src/operators/except.ts
+function H(e, t = l) {
+	let n = this;
+	return i(function* () {
+		let r = new Set([...y(e)].map(t)), i = /* @__PURE__ */ new Set();
+		for (let e of n) {
+			let n = t(e);
+			!r.has(n) && !i.has(n) && (i.add(n), yield e);
+		}
+	});
+}
+//#endregion
+//#region src/operators/except-by.ts
+function U(e, t, n = l) {
+	let r = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Set();
+		for (let t of y(e)) i.add(n(t));
+		let a = /* @__PURE__ */ new Set();
+		for (let e of r) {
+			let r = n(t(e));
+			!i.has(r) && !a.has(r) && (a.add(r), yield e);
+		}
+	});
+}
+//#endregion
+//#region src/operators/finally-action.ts
+function W(e) {
+	let t = this;
+	return i(function* () {
+		try {
+			yield* t;
+		} finally {
+			e();
+		}
+	});
+}
+//#endregion
+//#region src/operators/first.ts
+function G(e) {
+	let t = 0;
+	for (let n of this) if (!e || e(n, t++)) return n;
+	throw Error("Sequence contains no matching element.");
+}
+//#endregion
+//#region src/operators/first-or-default.ts
+function le(e, t) {
+	let n = typeof e == "function" ? e : void 0, r = n ? t : e, i = 0;
+	for (let e of this) if (!n || n(e, i++)) return e;
+	return r;
+}
+//#endregion
+//#region src/operators/flatten.ts
+function ue() {
+	let e = this;
+	return i(function* () {
+		function* t(e) {
+			if (typeof e != "string" && d(e)) for (let n of e) yield* t(n);
+			else yield e;
+		}
+		for (let n of e) yield* t(n);
+	});
+}
+//#endregion
+//#region src/operators/force.ts
+function de() {
+	for (let e of this);
+}
+//#endregion
+//#region src/operators/for-each.ts
+function fe(e) {
+	let t = 0;
+	for (let n of this) if (e(n, t++) === !1) return;
+}
+//#endregion
+//#region src/operators/group-by.ts
+function pe(e, t = l, n = void 0, r = l) {
+	return this.toLookup(e, t, r).toEnumerable().select((e) => n ? n(e.key(), e) : e);
+}
+//#endregion
+//#region src/core/grouping.ts
+var K = class extends t {
+	constructor(e, t) {
+		super(() => t[Symbol.iterator]()), this.groupKey = e, this.source = t;
+	}
+	key() {
+		return this.groupKey;
+	}
+	getSource() {
+		return this.source;
+	}
+};
+//#endregion
+//#region src/operators/group-join.ts
+function me(e, t, n, r, a = l) {
+	let o = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Map();
+		for (let t of y(e)) {
+			let e = a(n(t)), r = i.get(e);
+			r ? r.push(t) : i.set(e, [t]);
+		}
+		for (let e of o) {
+			let n = t(e);
+			yield r(e, new K(n, i.get(a(n)) ?? []));
+		}
+	});
+}
+//#endregion
+//#region src/operators/index.ts
+function he() {
+	return this.select((e, t) => ({
+		index: t,
+		item: e
+	}));
+}
+//#endregion
+//#region src/operators/index-of.ts
+function ge(e) {
+	let t = typeof e == "function" ? e : (t) => t === e, n = 0;
+	for (let e of this) {
+		if (t(e, n)) return n;
+		n++;
+	}
+	return -1;
+}
+//#endregion
+//#region src/operators/insert.ts
+function _e(e, t) {
+	let n = this;
+	return i(function* () {
+		let r = 0, i = !1;
+		for (let a of n) !i && r++ === e && (yield* y(t), i = !0), yield a;
+		i || (yield* y(t));
+	});
+}
+//#endregion
+//#region src/operators/intersect.ts
+function ve(e, t = l) {
+	let n = this;
+	return i(function* () {
+		let r = new Set([...y(e)].map(t)), i = /* @__PURE__ */ new Set();
+		for (let e of n) {
+			let n = t(e);
+			r.has(n) && !i.has(n) && (i.add(n), yield e);
+		}
+	});
+}
+//#endregion
+//#region src/operators/intersect-by.ts
+function ye(e, t, n = l) {
+	let r = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Set();
+		for (let t of y(e)) i.add(n(t));
+		for (let e of r) {
+			let r = n(t(e));
+			i.delete(r) && (yield e);
+		}
+	});
+}
+//#endregion
+//#region src/operators/is-empty.ts
+function be() {
+	let e = this[Symbol.iterator](), t = e.next();
+	return t.done || e.return?.(), !!t.done;
+}
+//#endregion
+//#region src/operators/join.ts
+function xe(e, t, n, r, a = l) {
+	let o = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Map();
+		for (let t of y(e)) {
+			let e = a(n(t)), r = i.get(e);
+			r ? r.push(t) : i.set(e, [t]);
+		}
+		for (let e of o) {
+			let n = a(t(e)), o = i.get(n) ?? [];
+			for (let t of o) yield r(e, t);
+		}
+	});
+}
+//#endregion
+//#region src/operators/join-with.ts
+function Se(e) {
+	if (typeof e == "string") return this.toJoinedString(e);
+	let t = this;
+	return i(function* () {
+		let n = t[Symbol.iterator](), r = n.next();
+		for (; !r.done;) {
+			yield r.value;
+			let t = n.next();
+			if (t.done) return;
+			yield e(r.value), r = t;
+		}
+	});
+}
+//#endregion
+//#region src/operators/last.ts
+function Ce(e) {
+	let t = !1, n, r = 0;
+	for (let i of this) (!e || e(i, r++)) && (t = !0, n = i);
+	if (!t) throw Error("Sequence contains no matching element.");
+	return n;
+}
+//#endregion
+//#region src/operators/last-index-of.ts
+function we(e) {
+	let t = typeof e == "function" ? e : (t) => t === e, n = 0, r = -1;
+	for (let e of this) t(e, n) && (r = n), n++;
+	return r;
+}
+//#endregion
+//#region src/operators/last-or-default.ts
+function Te(e, t) {
+	let n = typeof e == "function" ? e : void 0, r = n ? t : e, i = !1, a, o = 0;
+	for (let e of this) (!n || n(e, o++)) && (i = !0, a = e);
+	return i ? a : r;
+}
+//#endregion
+//#region src/operators/left-join.ts
+function Ee(e, t, n, r, a = l) {
+	let o = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Map();
+		for (let t of y(e)) {
+			let e = a(n(t)), r = i.get(e);
+			r ? r.push(t) : i.set(e, [t]);
+		}
+		for (let e of o) {
+			let n = i.get(a(t(e)));
+			if (n) for (let t of n) yield r(e, t);
+			else yield r(e, null);
+		}
+	});
+}
+//#endregion
+//#region src/operators/let-bind.ts
+function De(e) {
+	let t = this;
+	return r(() => y(e(t))[Symbol.iterator]());
+}
+//#endregion
+//#region src/operators/log.ts
+function Oe(e = l) {
+	return this.doAction((t) => {
+		console.log(e(t));
+	});
+}
+//#endregion
+//#region src/operators/map.ts
+function ke(e) {
+	return this.select(e).toArray();
+}
+//#endregion
+//#region src/operators/max.ts
+function Ae(e = Number) {
+	let t = -Infinity;
+	for (let n of this) t = Math.max(t, e(n));
+	return t;
+}
+//#endregion
+//#region src/operators/max-by.ts
+function je(e) {
+	let t = this[Symbol.iterator](), n = t.next();
+	if (n.done) throw Error("Sequence contains no elements.");
+	let r = n.value, i = e(r);
+	for (let n = t.next(); !n.done; n = t.next()) {
+		let t = e(n.value);
+		u(t, i) > 0 && (r = n.value, i = t);
+	}
+	return r;
+}
+//#endregion
+//#region src/core/memoized-enumerable.ts
+var Me = class extends t {
+	constructor(e) {
+		let t = { iterator: () => ({
+			done: !0,
+			value: void 0
+		}) };
+		super(() => {
+			let e = 0;
+			return { next: () => t.iterator(e++) };
+		}), this.cache = [], this.completed = !1, this.sourceIterator = e[Symbol.iterator](), t.iterator = (e) => this.nextAt(e);
+	}
+	nextAt(e) {
+		if (e < this.cache.length) return {
+			done: !1,
+			value: this.cache[e]
+		};
+		if (this.completed) return {
+			done: !0,
+			value: void 0
+		};
+		let t = this.sourceIterator.next();
+		return t.done ? (this.completed = !0, {
+			done: !0,
+			value: void 0
+		}) : (this.cache.push(t.value), {
+			done: !1,
+			value: t.value
+		});
+	}
+	dispose() {
+		this.completed || (this.completed = !0, this.sourceIterator.return?.());
+	}
+};
+//#endregion
+//#region src/operators/memoize.ts
+function Ne() {
+	return new Me(this);
+}
+//#endregion
+//#region src/operators/merge.ts
+function Pe(...e) {
+	let t = [this, ...e];
+	return i(function* () {
+		let e = t.map((e) => y(e)[Symbol.iterator]());
+		for (; e.length > 0;) {
+			let t = [];
+			for (let n of e) {
+				let e = n.next();
+				e.done || (yield e.value, t.push(n));
+			}
+			e = t;
+		}
+	});
+}
+//#endregion
+//#region src/operators/min.ts
+function Fe(e = Number) {
+	let t = Infinity;
+	for (let n of this) t = Math.min(t, e(n));
+	return t;
+}
+//#endregion
+//#region src/operators/min-by.ts
+function Ie(e) {
+	let t = this[Symbol.iterator](), n = t.next();
+	if (n.done) throw Error("Sequence contains no elements.");
+	let r = n.value, i = e(r);
+	for (let n = t.next(); !n.done; n = t.next()) {
+		let t = e(n.value);
+		u(t, i) < 0 && (r = n.value, i = t);
+	}
+	return r;
+}
+//#endregion
+//#region src/operators/of-type.ts
+function Le(e) {
+	let t = this;
+	return i(function* () {
+		for (let n of t) {
+			let t;
+			t = e === Number ? typeof n == "number" : e === String ? typeof n == "string" : e === Boolean ? typeof n == "boolean" : typeof e == "function" && n instanceof e, t && (yield n);
+		}
+	});
+}
+//#endregion
+//#region src/operators/order-by.ts
+function Re(e, t = u) {
+	return new n(this, [{
+		keySelector: e,
+		comparer: t,
+		descending: !1
+	}]);
+}
+//#endregion
+//#region src/operators/order-by-descending.ts
+function ze(e, t = u) {
+	return new n(this, [{
+		keySelector: e,
+		comparer: t,
+		descending: !0
+	}]);
+}
+//#endregion
+//#region src/operators/page.ts
+function Be(e, t) {
+	let n = typeof e == "number" ? e : e.pageNumber, r = typeof e == "number" ? t : e.pageSize;
+	return this.skip(Math.max(0, n - 1) * r).take(r);
+}
+//#endregion
+//#region src/operators/pairwise.ts
+function Ve(e) {
+	let t = this;
+	return i(function* () {
+		let n = !1, r;
+		for (let i of t) n && (yield e(r, i)), r = i, n = !0;
+	});
+}
+//#endregion
+//#region src/operators/partition-by.ts
+function He(e, t = l, n = void 0, r = l) {
+	let a = this;
+	return i(function* () {
+		let i = !1, o, s, c = [], l = () => {
+			let e = new K(o, c);
+			return n ? n(o, e) : e;
+		};
+		for (let n of a) {
+			let a = e(n), u = r(a);
+			i && u !== s && (yield l(), c = []), (!i || u !== s) && (o = a, s = u, i = !0), c.push(t(n));
+		}
+		i && (yield l());
+	});
+}
+//#endregion
+//#region src/operators/position.ts
+function Ue() {
+	let e = this;
+	return i(function* () {
+		let t = e[Symbol.iterator](), n = t.next();
+		if (n.done) return;
+		let r = 0;
+		for (;;) {
+			let e = t.next();
+			if (yield {
+				index: r,
+				item: n.value,
+				isFirst: r === 0,
+				isLast: !!e.done
+			}, e.done) return;
+			n = e, r++;
+		}
+	});
+}
+//#endregion
+//#region src/operators/prepend.ts
+function We(e) {
+	let t = this;
+	return i(function* () {
+		yield e, yield* t;
+	});
+}
+//#endregion
+//#region src/operators/reverse.ts
+function Ge() {
+	let e = this;
+	return i(function* () {
+		let t = [...e];
+		for (let e = t.length - 1; e >= 0; e--) yield t[e];
+	});
+}
+//#endregion
+//#region src/operators/right-join.ts
+function Ke(e, t, n, r, a = l) {
+	let o = this;
+	return i(function* () {
+		let i = /* @__PURE__ */ new Map();
+		for (let e of o) {
+			let n = a(t(e)), r = i.get(n);
+			r ? r.push(e) : i.set(n, [e]);
+		}
+		for (let t of y(e)) {
+			let e = i.get(a(n(t)));
+			if (e) for (let n of e) yield r(n, t);
+			else yield r(null, t);
+		}
+	});
+}
+//#endregion
+//#region src/operators/scan.ts
+function qe(e, t) {
+	let n = this;
+	return i(function* () {
+		if (t) {
+			let r = e;
+			yield r;
+			for (let e of n) r = t(r, e), yield r;
+			return;
+		}
+		let r = e, i = !1, a;
+		for (let e of n) a = i ? r(a, e) : e, i = !0, yield a;
+	});
+}
+//#endregion
+//#region src/operators/select.ts
+function Je(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) yield e(r, n++);
+	});
+}
+//#endregion
+//#region src/operators/select-many.ts
+function Ye(e, t) {
+	let n = this;
+	return i(function* () {
+		let r = 0;
+		for (let i of n) for (let n of y(e(i, r++))) yield t ? t(i, n) : n;
+	});
+}
+//#endregion
+//#region src/operators/sequence-equal.ts
+function Xe(e, t = l) {
+	let n = this[Symbol.iterator](), r = y(e)[Symbol.iterator]();
+	for (;;) {
+		let e = n.next(), i = r.next();
+		if (e.done || i.done) return !!e.done == !!i.done;
+		if (t(e.value) !== t(i.value)) return !1;
+	}
+}
+//#endregion
+//#region src/core/shared-enumerable.ts
+var Ze = class extends t {
+	constructor(e) {
+		let t = { next: () => ({
+			done: !0,
+			value: void 0
+		}) };
+		super(() => ({ next: () => t.next() })), this.disposed = !1, this.sourceIterator = e[Symbol.iterator](), t.next = () => this.disposed ? {
+			done: !0,
+			value: void 0
+		} : this.sourceIterator.next();
+	}
+	dispose() {
+		this.disposed || (this.disposed = !0, this.sourceIterator.return?.());
+	}
+};
+//#endregion
+//#region src/operators/share.ts
+function Qe() {
+	return new Ze(this);
+}
+//#endregion
+//#region src/operators/shuffle.ts
+function $e() {
+	let e = this;
+	return i(function* () {
+		let t = [...e];
+		for (let e = t.length - 1; e > 0; e--) {
+			let n = Math.floor(Math.random() * (e + 1));
+			[t[e], t[n]] = [t[n], t[e]];
+		}
+		yield* t;
+	});
+}
+//#endregion
+//#region src/operators/single.ts
+function et(e) {
+	let t = !1, n, r = 0;
+	for (let i of this) if (!(e && !e(i, r++))) {
+		if (t) throw Error("Sequence contains more than one matching element.");
+		t = !0, n = i;
+	}
+	if (!t) throw Error("Sequence contains no matching element.");
+	return n;
+}
+//#endregion
+//#region src/operators/single-or-default.ts
+function tt(e, t) {
+	let n = typeof e == "function" ? e : void 0, r = n ? t : e, i = !1, a, o = 0;
+	for (let e of this) if (!(n && !n(e, o++))) {
+		if (i) throw Error("Sequence contains more than one matching element.");
+		i = !0, a = e;
+	}
+	return i ? a : r;
+}
+//#endregion
+//#region src/operators/skip.ts
+function nt(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) n++ >= e && (yield r);
+	});
+}
+//#endregion
+//#region src/operators/take-except-last.ts
+function q(e = 1) {
+	let t = this;
+	return i(function* () {
+		if (e <= 0) {
+			yield* t;
+			return;
+		}
+		let n = [];
+		for (let r of t) n.push(r), n.length > e && (yield n.shift());
+	});
+}
+//#endregion
+//#region src/operators/skip-last.ts
+function rt(e) {
+	return q.call(this, e);
+}
+//#endregion
+//#region src/operators/skip-while.ts
+function it(e) {
+	let t = this;
+	return i(function* () {
+		let n = !1, r = 0;
+		for (let i of t) !n && !e(i, r++) && (n = !0), n && (yield i);
+	});
+}
+//#endregion
+//#region src/operators/sum.ts
+function at(e = Number) {
+	let t = 0;
+	for (let n of this) t += e(n);
+	return t;
+}
+//#endregion
+//#region src/operators/take.ts
+function ot(e) {
+	let t = this;
+	return i(function* () {
+		if (e <= 0) return;
+		let n = 0;
+		for (let r of t) if (yield r, ++n >= e) return;
+	});
+}
+//#endregion
+//#region src/operators/take-from-last.ts
+function J(e) {
+	let t = this;
+	return i(function* () {
+		if (e <= 0) return;
+		let n = [];
+		for (let r of t) n.push(r), n.length > e && n.shift();
+		yield* n;
+	});
+}
+//#endregion
+//#region src/operators/take-last.ts
+function st(e) {
+	return J.call(this, e);
+}
+//#endregion
+//#region src/operators/take-while.ts
+function ct(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) {
+			if (!e(r, n++)) return;
+			yield r;
+		}
+	});
+}
+//#endregion
+//#region src/operators/then-by.ts
+function lt(e, t) {
+	return this.createOrderedEnumerable(e, t, !1);
+}
+//#endregion
+//#region src/operators/then-by-descending.ts
+function ut(e, t) {
+	return this.createOrderedEnumerable(e, t, !0);
+}
+//#endregion
+//#region src/operators/to-array.ts
+function dt() {
+	return [...this];
+}
+//#endregion
+//#region src/core/dictionary.ts
+var ft = class {
+	constructor(e = l) {
+		this.compareSelector = e, this.entries = /* @__PURE__ */ new Map();
+	}
+	add(e, t) {
+		this.entries.set(this.compareSelector(e), {
+			key: e,
+			value: t
+		});
+	}
+	get(e) {
+		return this.entries.get(this.compareSelector(e))?.value;
+	}
+	set(e, t) {
+		let n = this.compareSelector(e), r = this.entries.has(n);
+		return this.entries.set(n, {
+			key: e,
+			value: t
+		}), r;
+	}
+	contains(e) {
+		return this.entries.has(this.compareSelector(e));
+	}
+	clear() {
+		this.entries.clear();
+	}
+	remove(e) {
+		this.entries.delete(this.compareSelector(e));
+	}
+	count() {
+		return this.entries.size;
+	}
+	toEnumerable() {
+		let e = this.entries;
+		return i(function* () {
+			for (let t of e.values()) yield {
+				key: t.key,
+				value: t.value
+			};
+		});
+	}
+};
+//#endregion
+//#region src/operators/to-dictionary.ts
+function pt(e, t = l, n = l) {
+	let r = new ft(n);
+	for (let n of this) r.add(e(n), t(n));
+	return r;
+}
+//#endregion
+//#region src/operators/to-joined-string.ts
+function mt(e = "", t) {
+	return Array.from(this, (e, n) => t ? t(e, n) : e).join(e);
+}
+//#endregion
+//#region src/operators/to-json-string.ts
+function ht(e, t) {
+	let n = Array.from(this);
+	return JSON.stringify(n, e, t);
+}
+//#endregion
+//#region src/core/lookup.ts
+var gt = class {
+	constructor(e = l) {
+		this.compareSelector = e, this.entries = /* @__PURE__ */ new Map();
+	}
+	add(e, t) {
+		let n = this.compareSelector(e), r = this.entries.get(n);
+		r ? r.elements.push(t) : this.entries.set(n, {
+			key: e,
+			elements: [t]
+		});
+	}
+	count() {
+		return this.entries.size;
+	}
+	get(e) {
+		return new K(e, this.entries.get(this.compareSelector(e))?.elements ?? []);
+	}
+	contains(e) {
+		return this.entries.has(this.compareSelector(e));
+	}
+	toEnumerable() {
+		let e = this.entries;
+		return i(function* () {
+			for (let t of e.values()) yield new K(t.key, t.elements);
+		});
+	}
+};
+//#endregion
+//#region src/operators/to-lookup.ts
+function _t(e, t = l, n = l) {
+	let r = new gt(n);
+	for (let n of this) r.add(e(n), t(n));
+	return r;
+}
+//#endregion
+//#region src/operators/to-map.ts
+function vt(e, t) {
+	let n = /* @__PURE__ */ new Map();
+	for (let r of this) n.set(e(r), t(r));
+	return n;
+}
+//#endregion
+//#region src/operators/to-object.ts
+function yt(e, t = l) {
+	let n = {};
+	for (let r of this) n[e(r)] = t(r);
+	return n;
+}
+//#endregion
+//#region src/operators/to-set.ts
+function bt() {
+	return new Set(this);
+}
+//#endregion
+//#region src/operators/trace.ts
+function xt(e = "Trace", t = l) {
+	return this.doAction((n) => {
+		console.log(`${e}:`, t(n));
+	});
+}
+//#endregion
+//#region src/operators/traverse-breadth-first.ts
+function St(e, t = ((e) => e)) {
+	let n = this;
+	return i(function* () {
+		let r = 0, i = n;
+		for (;;) {
+			let n = [], a = !1;
+			for (let o of i) a = !0, yield t(o, r), n.push(...e(o));
+			if (!a) return;
+			i = n, r++;
+		}
+	});
+}
+//#endregion
+//#region src/operators/traverse-depth-first.ts
+function Ct(e, t = ((e) => e)) {
+	let n = this;
+	return i(function* () {
+		function* r(n, i) {
+			for (let a of n) yield t(a, i), yield* r(e(a), i + 1);
+		}
+		yield* r(n, 0);
+	});
+}
+//#endregion
+//#region src/operators/union.ts
+function Y(e, t = l) {
+	let n = this;
+	return i(function* () {
+		let r = /* @__PURE__ */ new Set();
+		for (let i of [...n, ...y(e)]) {
+			let e = t(i);
+			r.has(e) || (r.add(e), yield i);
+		}
+	});
+}
+//#endregion
+//#region src/operators/union-by.ts
+function wt(e, t, n = l) {
+	return Y.call(this, e, (e) => n(t(e)));
+}
+//#endregion
+//#region src/operators/weighted-sample.ts
+function Tt(e) {
+	let t = this;
+	return i(function* () {
+		let n = Array.from(t), r = n.map((t) => Math.max(0, e(t))), i = r.reduce((e, t) => e + t, 0);
+		if (!(i <= 0)) for (;;) {
+			let e = Math.random() * i;
+			for (let t = 0; t < n.length; t++) if (e -= r[t], e < 0) {
+				yield n[t];
+				break;
+			}
+		}
+	});
+}
+//#endregion
+//#region src/operators/where.ts
+function Et(e) {
+	let t = this;
+	return i(function* () {
+		let n = 0;
+		for (let r of t) e(r, n++) && (yield r);
+	});
+}
+//#endregion
+//#region src/operators/where-if.ts
+function Dt(e, t) {
+	return e ? this.where(t) : this;
+}
+//#endregion
+//#region src/operators/with-neighbors.ts
+function Ot() {
+	let e = this;
+	return i(function* () {
+		let t = e[Symbol.iterator](), n = t.next();
+		if (n.done) return;
+		let r = null;
+		for (;;) {
+			let e = t.next();
+			if (yield {
+				prev: r,
+				item: n.value,
+				next: e.done ? null : e.value
+			}, e.done) return;
+			r = n.value, n = e;
+		}
+	});
+}
+//#endregion
+//#region src/operators/zip.ts
+function kt(...e) {
+	if (e.length < 2) throw TypeError("zip requires at least one sequence and a result selector.");
+	let t = e[e.length - 1];
+	if (typeof t != "function") throw TypeError("The final zip argument must be a function.");
+	let n = [this, ...e.slice(0, -1)];
+	return i(function* () {
+		let e = n.map((e) => y(e)[Symbol.iterator]()), r = 0;
+		for (;;) {
+			let n = e.map((e) => e.next());
+			if (n.some((e) => e.done)) return;
+			let i = n.map((e) => e.value);
+			yield t(...i, r++);
+		}
+	});
+}
+//#endregion
+//#region src/operators/operators.ts
+var X = {
+	aggregate: g,
+	aggregateBy: _,
+	all: v,
+	alternate: b,
+	any: x,
+	append: S,
+	asEnumerable: C,
+	average: w,
+	buffer: T,
+	cast: E,
+	catchError: D,
+	choose: O,
+	chunk: k,
+	concat: A,
+	contains: j,
+	count: M,
+	countBy: N,
+	createOrderedEnumerable: P,
+	defaultIfEmpty: F,
+	distinct: I,
+	distinctBy: L,
+	distinctUntilChanged: R,
+	doAction: z,
+	elementAt: B,
+	elementAtOrDefault: V,
+	except: H,
+	exceptBy: U,
+	finallyAction: W,
+	first: G,
+	firstOrDefault: le,
+	flatten: ue,
+	force: de,
+	forEach: fe,
+	groupBy: pe,
+	groupJoin: me,
+	index: he,
+	indexOf: ge,
+	insert: _e,
+	intersect: ve,
+	intersectBy: ye,
+	isEmpty: be,
+	join: xe,
+	joinWith: Se,
+	last: Ce,
+	lastIndexOf: we,
+	lastOrDefault: Te,
+	leftJoin: Ee,
+	letBind: De,
+	log: Oe,
+	map: ke,
+	max: Ae,
+	maxBy: je,
+	memoize: Ne,
+	merge: Pe,
+	min: Fe,
+	minBy: Ie,
+	ofType: Le,
+	orderBy: Re,
+	orderByDescending: ze,
+	page: Be,
+	pairwise: Ve,
+	partitionBy: He,
+	position: Ue,
+	prepend: We,
+	reverse: Ge,
+	rightJoin: Ke,
+	scan: qe,
+	select: Je,
+	selectMany: Ye,
+	sequenceEqual: Xe,
+	share: Qe,
+	shuffle: $e,
+	single: et,
+	singleOrDefault: tt,
+	skip: nt,
+	skipLast: rt,
+	skipWhile: it,
+	sum: at,
+	take: ot,
+	takeExceptLast: q,
+	takeFromLast: J,
+	takeLast: st,
+	takeWhile: ct,
+	thenBy: lt,
+	thenByDescending: ut,
+	toArray: dt,
+	toDictionary: pt,
+	toJoinedString: mt,
+	toJSONString: ht,
+	toLookup: _t,
+	toMap: vt,
+	toObject: yt,
+	toSet: bt,
+	trace: xt,
+	traverseBreadthFirst: St,
+	traverseDepthFirst: Ct,
+	union: Y,
+	unionBy: wt,
+	weightedSample: Tt,
+	where: Et,
+	whereIf: Dt,
+	withNeighbors: Ot,
+	zip: kt
+};
+//#endregion
+//#region src/utils.ts
+function At(e) {
+	if (e == null) return ((e) => e);
+	if (typeof e != "function") throw TypeError("Lambda expressions must be functions.");
+	return e;
+}
+function jt(e) {
+	return r(() => {
+		let t = e();
+		return {
+			next: () => t.moveNext() ? {
+				done: !1,
+				value: t.current()
+			} : {
+				done: !0,
+				value: void 0
+			},
+			return: () => (t.dispose(), {
+				done: !0,
+				value: void 0
+			})
+		};
+	});
+}
+function Mt(e, t, n) {
+	let r = !1, i, a = !1, o = {
+		yieldReturn(e) {
+			return i = e, !0;
+		},
+		yieldBreak() {
+			return a = !0, !1;
+		}
+	};
+	return {
+		current: () => i,
+		moveNext: () => {
+			if (a) return !1;
+			r ||= (e(), !0);
+			try {
+				let e = t.call(o);
+				return e || (n(), a = !0), e;
+			} catch (e) {
+				throw n(), a = !0, e;
+			}
+		},
+		dispose: () => {
+			a || n(), a = !0;
+		}
+	};
+}
+function Z(e) {
+	if (typeof e != "function" || !e.prototype) throw TypeError("Expected a constructor function.");
+	return e.prototype;
+}
+function Nt(t) {
+	let n = Z(t);
+	Object.prototype.hasOwnProperty.call(n, "getEnumerator") || Object.defineProperty(n, "getEnumerator", {
+		configurable: !0,
+		writable: !0,
+		value() {
+			return new e(this[Symbol.iterator]());
+		}
+	}), t === Array && !Object.prototype.hasOwnProperty.call(n, "getSource") && Object.defineProperty(n, "getSource", {
+		configurable: !0,
+		writable: !0,
+		value() {
+			return this;
+		}
+	});
+	for (let [e, t] of Object.entries(X)) {
+		let r = n[e] == null ? e : `${e}ByLinq`;
+		n[r] !== t && Object.defineProperty(n, r, {
+			configurable: !0,
+			writable: !0,
+			value: t
+		});
+	}
+}
+function Q(e) {
+	let t = Z(e);
+	Object.prototype.hasOwnProperty.call(t, "getEnumerator") && delete t.getEnumerator, e === Array && Object.prototype.hasOwnProperty.call(t, "getSource") && delete t.getSource;
+	for (let [e, n] of Object.entries(X)) t[`${e}ByLinq`] === n ? delete t[`${e}ByLinq`] : t[e] === n && delete t[e];
+}
+var Pt = {
+	createLambda: At,
+	createEnumerable: jt,
+	createEnumerator: Mt,
+	extendTo: Nt,
+	recallFrom: Q,
+	hasNativeIteratorSupport: () => typeof Symbol == "function" && typeof Symbol.iterator == "symbol"
+};
+function Ft(e, t, n, r = !0, i = !0, a = !1) {
+	return e == null || t == null || Object.prototype.hasOwnProperty.call(e, t) ? !1 : (Object.defineProperty(e, t, {
+		value: n,
+		writable: r,
+		configurable: i,
+		enumerable: a
+	}), !0);
+}
+Object.assign(t.prototype, X), Object.assign(n.prototype, X);
+var $ = class {
+	static {
+		this.Utils = Pt;
+	}
+	static {
+		this.choice = a;
+	}
+	static {
+		this.cycle = o;
+	}
+	static {
+		this.defer = s;
+	}
+	static {
+		this.empty = c;
+	}
+	static {
+		this.from = ee;
+	}
+	static {
+		this.generate = p;
+	}
+	static {
+		this.make = m;
+	}
+	static {
+		this.matches = te;
+	}
+	static {
+		this.range = h;
+	}
+	static {
+		this.rangeDown = ne;
+	}
+	static {
+		this.rangeTo = re;
+	}
+	static {
+		this.repeat = ie;
+	}
+	static {
+		this.repeatWithFinalize = ae;
+	}
+	static {
+		this.toInfinity = oe;
+	}
+	static {
+		this.toNegativeInfinity = se;
+	}
+	static {
+		this.unfold = ce;
+	}
+};
+Object.assign($.prototype, X);
+//#endregion
+export { Ft as n, $ as t };