iterable-linq-utility 0.5.0 → 0.7.0

package/dist/iterable-linq-utility.js

@@ -49,51 +49,85 @@ function s(e) {
 	};
 }
 //#endregion
-//#region src/utils/validations.ts
-function c(e) {
-	if (e == null) throw Error("The \"sourceIterable\" must be provided");
-	if (!n(e[Symbol.iterator])) throw Error("The provided \"sourceIterable\" does not conform to the iterator protocol https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#the_iterable_protocol. It must implement the \"[Symbol.iterator]\" function.");
+//#region src/utils/libraryError.ts
+function c(e, t) {
+	return /* @__PURE__ */ Error(`[iterable-linq-utility/${e}] ${t}`);
 }
+//#endregion
+//#region src/utils/validations.ts
 function l(e, t) {
-	if (!n(e)) throw Error(`The "${t}" function must be provided`);
+	if (e == null) throw c(t, "The \"sourceIterable\" must be provided");
+	if (!n(e[Symbol.iterator])) throw c(t, "The provided \"sourceIterable\" does not conform to the iterator protocol https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#the_iterable_protocol. It must implement the \"[Symbol.iterator]\" function.");
+}
+function u(e, t, r) {
+	if (!n(e)) throw c(r, `The "${t}" function must be provided`);
 }
-function u(e, t) {
-	if (!Number.isInteger(e) || e < 0) throw Error(`The "${t}" parameter must be a non-negative integer`);
+function ee(e, t, n) {
+	if (!Number.isInteger(e)) throw c(n, `The "${t}" parameter must be an integer`);
 }
-function ee(e, t) {
-	if (!Number.isFinite(e) || e === 0) throw Error(`The "${t}" parameter must be a finite number other than 0`);
+function d(e, t, n) {
+	if (!Number.isInteger(e) || e < 0) throw c(n, `The "${t}" parameter must be a non-negative integer`);
 }
-function te(e, t) {
-	if (typeof e != "object" || !e) throw Error(`The "${t}" parameter must be an object`);
+function te(e, t, n) {
+	if (!Number.isFinite(e) || e === 0) throw c(n, `The "${t}" parameter must be a finite number other than 0`);
 }
-function ne(e, t) {
-	if (typeof e != "string" || e.length === 0) throw Error(`The "${t}" parameter must be a non-empty string`);
+function ne(e, t, n) {
+	if (typeof e != "object" || !e) throw c(n, `The "${t}" parameter must be an object`);
+}
+function re(e, t, n) {
+	if (typeof e != "string" || e.length === 0) throw c(n, `The "${t}" parameter must be a non-empty string`);
+}
+//#endregion
+//#region src/functions/at.ts
+function f(e, t) {
+	return l(e, "at"), ee(t, "index", "at"), t >= 0 ? ie(e, t) : ae(e, -t);
+}
+function ie(e, t) {
+	let n = 0;
+	for (let r of e) if (n++ === t) return r;
+}
+function ae(e, t) {
+	let n = [], r = 0, i = !1;
+	for (let a of e) n[r] = a, ++r === t && (r = 0, i = !0);
+	return i ? n[r] : void 0;
+}
+//#endregion
+//#region src/functions/average.ts
+function p(e, t) {
+	l(e, "average");
+	let n = 0, r = 0;
+	if (t === void 0) for (let t of e) n += t, r++;
+	else {
+		u(t, "selector", "average");
+		for (let i of e) n += t(i, r++);
+	}
+	return r === 0 ? void 0 : n / r;
 }
 //#endregion
 //#region src/functions/collectToArray.ts
-function re(e) {
-	if (c(e), Array.isArray(e) || e instanceof Set) return Array.from(e);
+function m(e) {
+	if (l(e, "collectToArray"), Array.isArray(e) || e instanceof Set) return Array.from(e);
 	let t = [];
 	for (let n of e) t.push(n);
 	return t;
 }
 //#endregion
 //#region src/functions/count.ts
-function d(e, t) {
-	c(e);
+function oe(e, t) {
+	l(e, "count");
 	let n = 0;
 	if (t === void 0) {
 		for (let t of e) n++;
 		return n;
 	}
-	l(t, "predicate");
+	u(t, "predicate", "count");
 	let r = 0;
 	for (let i of e) t(i, r++) && n++;
 	return n;
 }
 //#endregion
 //#region src/iterators/baseIterator.ts
-var f = class {
+var h = class {
 	done = !1;
 	next() {
 		if (this.done) return s();
@@ -115,7 +149,7 @@ var f = class {
 			} catch {}
 		}
 	}
-}, p = class {
+}, g = class {
 	createIterator;
 	constructor(e) {
 		this.createIterator = e;
@@ -123,7 +157,7 @@ var f = class {
 	[Symbol.iterator]() {
 		return this.createIterator();
 	}
-}, m = class extends f {
+}, _ = class extends h {
 	source;
 	index = 0;
 	constructor(e) {
@@ -135,10 +169,10 @@ var f = class {
 };
 //#endregion
 //#region src/iterators/unfold.ts
-function h(e, t) {
-	return new p(() => new ie(e, t));
+function se(e, t) {
+	return new g(() => new ce(e, t));
 }
-var ie = class extends f {
+var ce = class extends h {
 	state;
 	step;
 	constructor(e, t) {
@@ -151,10 +185,10 @@ var ie = class extends f {
 };
 //#endregion
 //#region src/functions/distinct.ts
-function g(e, t) {
-	return c(e), t !== void 0 && l(t, "keySelector"), new p(() => new ae(e, t));
+function v(e, t) {
+	return l(e, "distinct"), t !== void 0 && u(t, "keySelector", "distinct"), new g(() => new le(e, t));
 }
-var ae = class extends m {
+var le = class extends _ {
 	keySelector;
 	seen = /* @__PURE__ */ new Set();
 	constructor(e, t) {
@@ -175,23 +209,23 @@ var ae = class extends m {
 };
 //#endregion
 //#region src/functions/empty.ts
-function _() {
-	return h(void 0, () => void 0);
+function y() {
+	return se(void 0, () => void 0);
 }
 //#endregion
 //#region src/functions/every.ts
-function v(e, t) {
-	c(e), l(t, "predicate");
+function ue(e, t) {
+	l(e, "every"), u(t, "predicate", "every");
 	let n = 0;
 	for (let r of e) if (!t(r, n++)) return !1;
 	return !0;
 }
 //#endregion
 //#region src/functions/filter.ts
-function oe(e, t) {
-	return c(e), l(t, "predicate"), new p(() => new se(e, t));
+function b(e, t) {
+	return l(e, "filter"), u(t, "predicate", "filter"), new g(() => new de(e, t));
 }
-var se = class extends m {
+var de = class extends _ {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -211,15 +245,15 @@ var se = class extends m {
 };
 //#endregion
 //#region src/functions/find.ts
-function y(e, t) {
-	c(e), l(t, "predicate");
+function x(e, t) {
+	l(e, "find"), u(t, "predicate", "find");
 	let n = 0;
 	for (let r of e) if (t(r, n++)) return r;
 }
 //#endregion
 //#region src/functions/findIndex.ts
-function b(e, t) {
-	c(e), l(t, "predicate");
+function S(e, t) {
+	l(e, "findIndex"), u(t, "predicate", "findIndex");
 	let n = 0;
 	for (let r of e) {
 		if (t(r, n)) return n;
@@ -228,11 +262,27 @@ function b(e, t) {
 	return -1;
 }
 //#endregion
+//#region src/functions/findLast.ts
+function C(e, t) {
+	l(e, "findLast"), u(t, "predicate", "findLast");
+	let n, r = 0;
+	for (let i of e) t(i, r++) && (n = i);
+	return n;
+}
+//#endregion
+//#region src/functions/findLastIndex.ts
+function w(e, t) {
+	l(e, "findLastIndex"), u(t, "predicate", "findLastIndex");
+	let n = -1, r = 0;
+	for (let i of e) t(i, r) && (n = r), r++;
+	return n;
+}
+//#endregion
 //#region src/functions/flatMap.ts
-function x(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new ce(e, t));
+function T(e, t) {
+	return l(e, "flatMap"), u(t, "mapper", "flatMap"), new g(() => new fe(e, t));
 }
-var ce = class e extends m {
+var fe = class e extends _ {
 	mapper;
 	static steps = {
 		outer: (t) => {
@@ -293,7 +343,7 @@ var ce = class e extends m {
 			throw e.inner = void 0, e.closeAfterCallbackError(), t;
 		}
 	}
-}, S = class e {
+}, E = class e {
 	static instance = e.createFrozen();
 	constructor() {}
 	static createFrozen() {
@@ -301,37 +351,61 @@ var ce = class e extends m {
 		return Object.freeze(t), t;
 	}
 };
-function C() {
-	return S.instance;
+function D() {
+	return E.instance;
 }
 //#endregion
 //#region src/functions/forEach.ts
-function w(e, t) {
-	c(e), l(t, "action");
+function O(e, t) {
+	l(e, "forEach"), u(t, "action", "forEach");
 	let n = 0;
 	for (let r of e) t(r, n++);
-	return C();
+	return D();
 }
-async function T(e, t) {
-	c(e), l(t, "action");
+async function k(e, t) {
+	l(e, "forEachAsync"), u(t, "action", "forEachAsync");
 	let n = 0;
 	for (let r of e) await t(r, n++);
-	return C();
+	return D();
 }
 //#endregion
 //#region src/functions/includes.ts
-function E(e, t) {
-	c(e);
+function A(e, t) {
+	l(e, "includes");
 	let n = t !== t;
 	for (let r of e) if (r === t || n && r !== r) return !0;
 	return !1;
 }
 //#endregion
+//#region src/functions/indexOf.ts
+function j(e, t) {
+	l(e, "indexOf");
+	let n = 0;
+	for (let r of e) {
+		if (r === t) return n;
+		n++;
+	}
+	return -1;
+}
+//#endregion
+//#region src/functions/join.ts
+function M(e, t) {
+	return l(e, "join"), Array.from(e).join(t);
+}
+//#endregion
+//#region src/functions/lastIndexOf.ts
+function N(e, t) {
+	l(e, "lastIndexOf");
+	let n = -1, r = 0;
+	for (let i of e) i === t && (n = r), r++;
+	return n;
+}
+//#endregion
 //#region src/functions/map.ts
-function D(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new le(e, t));
+function P(e, t) {
+	return l(e, "map"), u(t, "mapper", "map"), new g(() => new pe(e, t));
 }
-var le = class extends m {
+var pe = class extends _ {
 	mapper;
 	constructor(e, t) {
 		super(e), this.mapper = t;
@@ -350,18 +424,18 @@ var le = class extends m {
 };
 //#endregion
 //#region src/collections/linkedList.ts
-function ue(e) {
-	c(e);
-	let t = new de();
+function me(e) {
+	l(e, "LinkedList.from");
+	let t = new he();
 	for (let n of e) t.addLast(n);
 	return t;
 }
-var de = class {
+var he = class {
 	internalSize = 0;
 	head = null;
 	tail = null;
 	[Symbol.iterator]() {
-		return new fe(this.head);
+		return new ge(this.head);
 	}
 	addFirst(e) {
 		let t = {
@@ -380,7 +454,7 @@ var de = class {
 	size() {
 		return this.internalSize;
 	}
-}, fe = class extends f {
+}, ge = class extends h {
 	current;
 	constructor(e) {
 		super(), this.current = e;
@@ -392,13 +466,13 @@ var de = class {
 };
 //#endregion
 //#region src/functions/materialize.ts
-function O(e) {
-	return c(e), e instanceof k ? e : new k(e);
+function F(e) {
+	return l(e, "materialize"), e instanceof I ? e : new I(e);
 }
-var k = class {
+var I = class {
 	source;
 	constructor(e) {
-		this.source = ue(e);
+		this.source = me(e);
 	}
 	[Symbol.iterator]() {
 		return this.source[Symbol.iterator]();
@@ -406,29 +480,29 @@ var k = class {
 };
 //#endregion
 //#region src/functions/max.ts
-function A(e, t) {
-	return c(e), a(e, i(t), 1);
+function L(e, t) {
+	return l(e, "max"), a(e, i(t), 1);
 }
 //#endregion
 //#region src/functions/memoize.ts
-function j() {
+function R() {
 	return { allowPartialMemoization: !0 };
 }
-function M(e, t) {
-	c(e);
+function z(e, t) {
+	l(e, "memoize");
 	let n = {
-		...j(),
+		...R(),
 		...t
 	}.allowPartialMemoization;
-	return e instanceof P ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof F ? n ? e : e.changePartialMemoizationBehaviour() : n ? new F(e) : new P(e);
+	return e instanceof H ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof U ? n ? e : e.changePartialMemoizationBehaviour() : n ? new U(e) : new H(e);
 }
-function N() {
+function B() {
 	return {
 		values: [],
 		finished: !1
 	};
 }
-function pe(e, t) {
+function V(e, t) {
 	if (t.error) throw t.error.value;
 	if (t.finished) return !1;
 	t.source ??= e[Symbol.iterator]();
@@ -440,31 +514,31 @@ function pe(e, t) {
 	}
 	return n.done === !0 ? (t.finished = !0, t.source = void 0, !1) : (t.values.push(n.value), !0);
 }
-var P = class {
+var H = class {
 	source;
-	cache = N();
+	cache = B();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new I(this.source, this.cache, !0);
+		return new W(this.source, this.cache, !0);
 	}
 	changePartialMemoizationBehaviour() {
-		return new F(this.source);
+		return new U(this.source);
 	}
-}, F = class {
+}, U = class {
 	source;
-	cache = N();
+	cache = B();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new I(this.source, this.cache, !1);
+		return new W(this.source, this.cache, !1);
 	}
 	changePartialMemoizationBehaviour() {
-		return new P(this.source);
+		return new H(this.source);
 	}
-}, I = class extends f {
+}, W = class extends h {
 	source;
 	cache;
 	drainFirst;
@@ -473,28 +547,28 @@ var P = class {
 		super(), this.source = e, this.cache = t, this.drainFirst = n;
 	}
 	advance() {
-		if (this.drainFirst) for (; pe(this.source, this.cache););
-		return this.index < this.cache.values.length || pe(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
+		if (this.drainFirst) for (; V(this.source, this.cache););
+		return this.index < this.cache.values.length || V(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
 	}
 };
 //#endregion
 //#region src/functions/min.ts
-function L(e, t) {
-	return c(e), a(e, i(t), -1);
+function G(e, t) {
+	return l(e, "min"), a(e, i(t), -1);
 }
 //#endregion
 //#region src/functions/range.ts
-function R(e, t, n) {
+function K(e, t, n) {
 	let r = typeof t == "number", i = r ? e : 0, a = r ? t : e;
-	if (!r && n !== void 0) throw Error("The \"options\" parameter must be the second argument when \"start\" is omitted");
+	if (!r && n !== void 0) throw c("range", "The \"options\" parameter must be the second argument when \"start\" is omitted");
 	let o = r ? n : t;
-	o !== void 0 && te(o, "options");
-	let { step: s = 1, reverse: c = !1 } = o ?? {};
-	ee(s, "step");
-	let l = me(i, a, Math.abs(s), c);
-	return l.length > 0 ? new p(() => new he(l.first, l.step, l.length)) : _();
+	o !== void 0 && ne(o, "options", "range");
+	let { step: s = 1, reverse: l = !1 } = o ?? {};
+	te(s, "step", "range");
+	let u = _e(i, a, Math.abs(s), l);
+	return u.length > 0 ? new g(() => new ve(u.first, u.step, u.length)) : y();
 }
-function me(e, t, n, r) {
+function _e(e, t, n, r) {
 	let i = t < e ? -n : n, a = Math.ceil(Math.abs(t - e) / n);
 	return r ? {
 		first: e + (a - 1) * i,
@@ -506,7 +580,7 @@ function me(e, t, n, r) {
 		length: a
 	};
 }
-var he = class extends f {
+var ve = class extends h {
 	first;
 	step;
 	length;
@@ -520,32 +594,71 @@ var he = class extends f {
 };
 //#endregion
 //#region src/functions/reduce.ts
-function z(e, ...t) {
-	if (c(e), t.length === 1) return ge(e, t[0]);
+function q(e, ...t) {
+	if (l(e, "reduce"), t.length === 1) return ye(e, t[0]);
 	let [n, r] = t;
-	l(r, "reducer");
+	u(r, "reducer", "reduce");
 	let i = n, a = 0;
 	for (let t of e) i = r(i, t, a++);
 	return i;
 }
-function ge(e, t) {
-	l(t, "reducer");
+function ye(e, t) {
+	u(t, "reducer", "reduce");
 	let n, r = 0;
 	for (let i of e) n = r === 0 ? i : t(n, i, r), r++;
-	if (r === 0) throw Error("The \"sourceIterable\" must not be empty when \"reduce\" has no seed");
+	if (r === 0) throw c("reduce", "The \"sourceIterable\" must not be empty when \"reduce\" has no seed");
 	return n;
 }
 //#endregion
 //#region src/functions/repeat.ts
-function B(e, t) {
-	return u(t, "count"), h(t, (t) => t > 0 ? [e, t - 1] : void 0);
+function J(e, t) {
+	return d(t, "count", "repeat"), se(t, (t) => t > 0 ? [e, t - 1] : void 0);
+}
+//#endregion
+//#region src/functions/sequenceEqual.ts
+function be(e, t) {
+	return e === t;
+}
+function xe(e, t, n) {
+	l(e, "sequenceEqual"), l(t, "sequenceEqual"), n !== void 0 && u(n, "equals", "sequenceEqual");
+	let r = n ?? be, i = t[Symbol.iterator](), a = !0;
+	try {
+		for (let t of e) {
+			a = !1;
+			let e = i.next();
+			if (e.done === !0 || (a = !0, !r(t, e.value))) return !1;
+		}
+		return a = !1, i.next().done === !0 || (a = !0, !1);
+	} finally {
+		a && i.return?.();
+	}
+}
+//#endregion
+//#region src/functions/single.ts
+function Se(e, t) {
+	l(e, "single");
+	let n = !1, r;
+	if (t === void 0) {
+		for (let t of e) {
+			if (n) throw c("single", "The iterable contains more than one value");
+			n = !0, r = t;
+		}
+		return r;
+	}
+	u(t, "predicate", "single");
+	let i = 0;
+	for (let a of e) if (t(a, i++)) {
+		if (n) throw c("single", "More than one value satisfies the predicate");
+		n = !0, r = a;
+	}
+	return r;
 }
 //#endregion
 //#region src/functions/skip.ts
-function V(e, t) {
-	return c(e), u(t, "count"), new p(() => new _e(e, t));
+function Ce(e, t) {
+	return l(e, "skip"), d(t, "count", "skip"), new g(() => new we(e, t));
 }
-var _e = class extends m {
+var we = class extends _ {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -561,10 +674,10 @@ var _e = class extends m {
 };
 //#endregion
 //#region src/functions/skipWhile.ts
-function H(e, t) {
-	return c(e), l(t, "predicate"), new p(() => new ve(e, t));
+function Te(e, t) {
+	return l(e, "skipWhile"), u(t, "predicate", "skipWhile"), new g(() => new Ee(e, t));
 }
-var ve = class extends m {
+var Ee = class extends _ {
 	predicate;
 	skipping = !0;
 	constructor(e, t) {
@@ -586,22 +699,36 @@ var ve = class extends m {
 };
 //#endregion
 //#region src/functions/some.ts
-function U(e, t) {
-	if (c(e), t === void 0) {
+function De(e, t) {
+	if (l(e, "some"), t === void 0) {
 		for (let t of e) return !0;
 		return !1;
 	}
-	l(t, "predicate");
+	u(t, "predicate", "some");
 	let n = 0;
 	for (let r of e) if (t(r, n++)) return !0;
 	return !1;
 }
 //#endregion
+//#region src/functions/sum.ts
+function Oe(e, t) {
+	l(e, "sum");
+	let n = 0;
+	if (t === void 0) {
+		for (let t of e) n += t;
+		return n;
+	}
+	u(t, "selector", "sum");
+	let r = 0;
+	for (let i of e) n += t(i, r++);
+	return n;
+}
+//#endregion
 //#region src/functions/take.ts
-function W(e, t) {
-	return c(e), u(t, "count"), new p(() => new ye(e, t));
+function ke(e, t) {
+	return l(e, "take"), d(t, "count", "take"), new g(() => new Ae(e, t));
 }
-var ye = class extends m {
+var Ae = class extends _ {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -614,10 +741,10 @@ var ye = class extends m {
 };
 //#endregion
 //#region src/functions/takeWhile.ts
-function G(e, t) {
-	return c(e), l(t, "predicate"), new p(() => new be(e, t));
+function je(e, t) {
+	return l(e, "takeWhile"), u(t, "predicate", "takeWhile"), new g(() => new Me(e, t));
 }
-var be = class extends m {
+var Me = class extends _ {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -636,10 +763,10 @@ var be = class extends m {
 };
 //#endregion
 //#region src/functions/tap.ts
-function K(e, t) {
-	return c(e), l(t, "tapper"), new p(() => new xe(e, t));
+function Ne(e, t) {
+	return l(e, "tap"), u(t, "tapper", "tap"), new g(() => new Pe(e, t));
 }
-var xe = class extends m {
+var Pe = class extends _ {
 	tapper;
 	constructor(e, t) {
 		super(e), this.tapper = t;
@@ -657,41 +784,51 @@ var xe = class extends m {
 };
 //#endregion
 //#region src/functions/tapChain.ts
-function q(e, t) {
-	return c(e), l(t, "tapper"), new p(() => (t(e, 0), e[Symbol.iterator]()));
+function Fe(e, t) {
+	return l(e, "tapChain"), u(t, "tapper", "tapChain"), new g(() => (t(e, 0), e[Symbol.iterator]()));
 }
 //#endregion
 //#region src/functions/index.ts
-var Se = /* @__PURE__ */ t({
-	collectToArray: () => re,
-	count: () => d,
-	distinct: () => g,
-	empty: () => _,
-	every: () => v,
-	filter: () => oe,
-	find: () => y,
-	findIndex: () => b,
-	flatMap: () => x,
-	forEach: () => w,
-	forEachAsync: () => T,
-	getMemoizeDefaultOptions: () => j,
-	includes: () => E,
-	map: () => D,
-	materialize: () => O,
-	max: () => A,
-	memoize: () => M,
-	min: () => L,
-	range: () => R,
-	reduce: () => z,
-	repeat: () => B,
-	skip: () => V,
-	skipWhile: () => H,
-	some: () => U,
-	take: () => W,
-	takeWhile: () => G,
-	tap: () => K,
-	tapChain: () => q
-}), J = Symbol.for("iterable-linq-utility.IIterableLinq");
+var Ie = /* @__PURE__ */ t({
+	at: () => f,
+	average: () => p,
+	collectToArray: () => m,
+	count: () => oe,
+	distinct: () => v,
+	empty: () => y,
+	every: () => ue,
+	filter: () => b,
+	find: () => x,
+	findIndex: () => S,
+	findLast: () => C,
+	findLastIndex: () => w,
+	flatMap: () => T,
+	forEach: () => O,
+	forEachAsync: () => k,
+	getMemoizeDefaultOptions: () => R,
+	includes: () => A,
+	indexOf: () => j,
+	join: () => M,
+	lastIndexOf: () => N,
+	map: () => P,
+	materialize: () => F,
+	max: () => L,
+	memoize: () => z,
+	min: () => G,
+	range: () => K,
+	reduce: () => q,
+	repeat: () => J,
+	sequenceEqual: () => xe,
+	single: () => Se,
+	skip: () => Ce,
+	skipWhile: () => Te,
+	some: () => De,
+	sum: () => Oe,
+	take: () => ke,
+	takeWhile: () => je,
+	tap: () => Ne,
+	tapChain: () => Fe
+}), Le = Symbol.for("iterable-linq-utility.IIterableLinq");
 //#endregion
 //#region src/linqIterable.ts
 function Y(e) {
@@ -705,85 +842,115 @@ var X = class {
 	[Symbol.iterator]() {
 		return this.iterable[Symbol.iterator]();
 	}
+	at(e) {
+		return f(this.iterable, e);
+	}
+	average(e) {
+		return p(this.iterable, e);
+	}
 	collectToArray() {
-		return re(this.iterable);
+		return m(this.iterable);
 	}
 	count(e) {
-		return d(this.iterable, e);
+		return oe(this.iterable, e);
 	}
 	distinct(e) {
-		return Y(g(this.iterable, e));
+		return Y(v(this.iterable, e));
 	}
 	every(e) {
-		return v(this.iterable, e);
+		return ue(this.iterable, e);
 	}
 	filter(e) {
-		return Y(oe(this.iterable, e));
+		return Y(b(this.iterable, e));
 	}
 	find(e) {
-		return y(this.iterable, e);
+		return x(this.iterable, e);
 	}
 	findIndex(e) {
-		return b(this.iterable, e);
+		return S(this.iterable, e);
+	}
+	findLast(e) {
+		return C(this.iterable, e);
+	}
+	findLastIndex(e) {
+		return w(this.iterable, e);
 	}
 	flatMap(e) {
-		return Y(x(this.iterable, e));
+		return Y(T(this.iterable, e));
 	}
 	forEach(e) {
-		return w(this.iterable, e);
+		return O(this.iterable, e);
 	}
 	forEachAsync(e) {
-		return T(this.iterable, e);
+		return k(this.iterable, e);
 	}
 	includes(e) {
-		return E(this.iterable, e);
+		return A(this.iterable, e);
+	}
+	indexOf(e) {
+		return j(this.iterable, e);
+	}
+	join(e) {
+		return M(this.iterable, e);
+	}
+	lastIndexOf(e) {
+		return N(this.iterable, e);
 	}
 	map(e) {
-		return Y(D(this.iterable, e));
+		return Y(P(this.iterable, e));
 	}
 	materialize() {
-		return Y(O(this.iterable));
+		return Y(F(this.iterable));
 	}
 	max(e) {
-		return A(this.iterable, e);
+		return L(this.iterable, e);
 	}
 	memoize(e) {
-		return Y(M(this.iterable, e));
+		return Y(z(this.iterable, e));
 	}
 	min(e) {
-		return L(this.iterable, e);
+		return G(this.iterable, e);
 	}
 	reduce(...e) {
-		return e.length === 1 ? z(this.iterable, e[0]) : z(this.iterable, e[0], e[1]);
+		return e.length === 1 ? q(this.iterable, e[0]) : q(this.iterable, e[0], e[1]);
+	}
+	sequenceEqual(e, t) {
+		return xe(this.iterable, e, t);
+	}
+	single(e) {
+		return Se(this.iterable, e);
 	}
 	skip(e) {
-		return Y(V(this.iterable, e));
+		return Y(Ce(this.iterable, e));
 	}
 	skipWhile(e) {
-		return Y(H(this.iterable, e));
+		return Y(Te(this.iterable, e));
 	}
 	some(e) {
-		return U(this.iterable, e);
+		return De(this.iterable, e);
+	}
+	sum(e) {
+		return Oe(this.iterable, e);
 	}
 	take(e) {
-		return Y(W(this.iterable, e));
+		return Y(ke(this.iterable, e));
 	}
 	takeWhile(e) {
-		return Y(G(this.iterable, e));
+		return Y(je(this.iterable, e));
 	}
 	tap(e) {
-		return Y(K(this.iterable, e));
+		return Y(Ne(this.iterable, e));
 	}
 	tapChain(e) {
-		return Y(q(this.iterable, e));
+		return Y(Fe(this.iterable, e));
 	}
 	tapChainCreation(e) {
-		l(e, "chainCreationTapper");
+		u(e, "chainCreationTapper", "tapChainCreation");
 		let t = this;
 		return e(t), t;
 	}
 };
-Object.defineProperty(X.prototype, J, {
+Object.defineProperty(X.prototype, Le, {
 	value: !0,
 	enumerable: !1,
 	writable: !1,
@@ -794,10 +961,10 @@ Object.defineProperty(X.prototype, J, {
 function Z() {
 	return X.prototype;
 }
-function Ce(e) {
-	return typeof e == "object" && !!e && e[J] === !0;
+function Re(e) {
+	return typeof e == "object" && !!e && e[Le] === !0;
 }
-function we(e, t) {
+function Q(e, t) {
 	let n = Object.getOwnPropertyDescriptor(Z(), e);
 	Object.defineProperty(Z(), e, {
 		value: t,
@@ -806,34 +973,34 @@ function we(e, t) {
 		configurable: !0
 	});
 }
-function Q(e, t) {
-	ne(e, "name"), l(t, "implementation");
-}
-function Te(e, t) {
-	if (Q(e, t), e in Y([])) throw Error(`"${e}" already exists on IIterableLinq: use override() to replace it`);
-	we(e, t);
+function ze(e, t, n) {
+	re(t, "name", e), u(n, "implementation", e);
 }
-function Ee(e, t) {
+function Be(e, t) {
+	if (ze("extend", e, t), e in Y([])) throw c("extend", `"${e}" already exists on IIterableLinq: use override() to replace it`);
 	Q(e, t);
+}
+function Ve(e, t) {
+	ze("override", e, t);
 	let n = e;
-	if (!(n !== "constructor" && Object.prototype.hasOwnProperty.call(Z(), n))) throw Error(`"${n}" is not a method of IIterableLinq: use extend() to add it`);
-	we(n, t);
+	if (!(n !== "constructor" && Object.prototype.hasOwnProperty.call(Z(), n))) throw c("override", `"${n}" is not a method of IIterableLinq: use extend() to add it`);
+	Q(n, t);
 }
 //#endregion
 //#region src/index.ts
-function De() {
-	return $(_());
+function He() {
+	return $(y());
 }
 function $(e) {
-	return c(e), Y(e);
+	return l(e, "from"), Y(e);
 }
-function Oe(e, t, n) {
-	if (typeof t == "number") return $(R(e, t, n));
-	if (n !== void 0) throw Error("The \"options\" parameter must be the second argument when \"start\" is omitted");
-	return $(R(e, t));
+function Ue(e, t, n) {
+	if (typeof t == "number") return $(K(e, t, n));
+	if (n !== void 0) throw c("fromRange", "The \"options\" parameter must be the second argument when \"start\" is omitted");
+	return $(K(e, t));
 }
-function ke(e, t) {
-	return $(B(e, t));
+function We(e, t) {
+	return $(J(e, t));
 }
 //#endregion
-export { Se as Functions, S as Unit, De as empty, Te as extend, $ as from, Oe as fromRange, Ce as isIterableLinq, Ee as override, ke as repeat, C as unit };
+export { Ie as Functions, E as Unit, He as empty, Be as extend, $ as from, Ue as fromRange, Re as isIterableLinq, Ve as override, We as repeat, D as unit };