iterable-linq-utility 0.8.0 → 0.9.0

package/dist/iterable-linq-utility.js

@@ -121,10 +121,10 @@ var p = class {
 };
 //#endregion
 //#region src/iterators/unfold.ts
-function g(e, t) {
-	return new m(() => new re(e, t));
+function re(e, t) {
+	return new m(() => new ie(e, t));
 }
-var re = class extends p {
+var ie = class extends p {
 	state;
 	step;
 	constructor(e, t) {
@@ -137,10 +137,10 @@ var re = class extends p {
 };
 //#endregion
 //#region src/functions/append.ts
-function ie(e, t) {
-	return l(e, "append"), new m(() => new ae(e, t));
+function ae(e, t) {
+	return l(e, "append"), new m(() => new oe(e, t));
 }
-var ae = class extends h {
+var oe = class extends h {
 	value;
 	sourceDone = !1;
 	constructor(e, t) {
@@ -154,21 +154,21 @@ var ae = class extends h {
 };
 //#endregion
 //#region src/functions/at.ts
-function oe(e, t) {
-	return l(e, "at"), d(t, "index", "at"), t >= 0 ? se(e, t) : ce(e, -t);
-}
 function se(e, t) {
+	return l(e, "at"), d(t, "index", "at"), t >= 0 ? ce(e, t) : le(e, -t);
+}
+function ce(e, t) {
 	let n = 0;
 	for (let r of e) if (n++ === t) return r;
 }
-function ce(e, t) {
+function le(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 le(e, t) {
+function ue(e, t) {
 	l(e, "average");
 	let n = 0, r = 0;
 	if (t === void 0) for (let t of e) n += t, r++;
@@ -180,7 +180,7 @@ function le(e, t) {
 }
 //#endregion
 //#region src/functions/collectToArray.ts
-function ue(e) {
+function g(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);
@@ -188,13 +188,13 @@ function ue(e) {
 }
 //#endregion
 //#region src/functions/concat.ts
-function _(e, ...t) {
+function de(e, ...t) {
 	l(e, "concat");
 	for (let e of t) l(e, "concat");
 	let n = [e, ...t];
-	return new m(() => new de(n));
+	return new m(() => new fe(n));
 }
-var de = class extends p {
+var fe = class extends p {
 	sources;
 	position = 0;
 	current;
@@ -214,7 +214,7 @@ var de = class extends p {
 };
 //#endregion
 //#region src/functions/count.ts
-function v(e, t) {
+function _(e, t) {
 	l(e, "count");
 	let n = 0;
 	if (t === void 0) {
@@ -228,10 +228,10 @@ function v(e, t) {
 }
 //#endregion
 //#region src/functions/distinct.ts
-function y(e, t) {
-	return l(e, "distinct"), t !== void 0 && u(t, "keySelector", "distinct"), new m(() => new fe(e, t));
+function v(e, t) {
+	return l(e, "distinct"), t !== void 0 && u(t, "keySelector", "distinct"), new m(() => new pe(e, t));
 }
-var fe = class extends h {
+var pe = class extends h {
 	keySelector;
 	seen = /* @__PURE__ */ new Set();
 	constructor(e, t) {
@@ -252,12 +252,12 @@ var fe = class extends h {
 };
 //#endregion
 //#region src/functions/empty.ts
-function b() {
-	return g(void 0, () => void 0);
+function y() {
+	return re(void 0, () => void 0);
 }
 //#endregion
 //#region src/functions/every.ts
-function x(e, t) {
+function b(e, t) {
 	l(e, "every"), u(t, "predicate", "every");
 	let n = 0;
 	for (let r of e) if (!t(r, n++)) return !1;
@@ -265,10 +265,10 @@ function x(e, t) {
 }
 //#endregion
 //#region src/functions/filter.ts
-function S(e, t) {
-	return l(e, "filter"), u(t, "predicate", "filter"), new m(() => new pe(e, t));
+function x(e, t) {
+	return l(e, "filter"), u(t, "predicate", "filter"), new m(() => new me(e, t));
 }
-var pe = class extends h {
+var me = class extends h {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -288,14 +288,14 @@ var pe = class extends h {
 };
 //#endregion
 //#region src/functions/find.ts
-function C(e, t) {
+function S(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 w(e, t) {
+function C(e, t) {
 	l(e, "findIndex"), u(t, "predicate", "findIndex");
 	let n = 0;
 	for (let r of e) {
@@ -306,7 +306,7 @@ function w(e, t) {
 }
 //#endregion
 //#region src/functions/findLast.ts
-function T(e, t) {
+function w(e, t) {
 	l(e, "findLast"), u(t, "predicate", "findLast");
 	let n, r = 0;
 	for (let i of e) t(i, r++) && (n = i);
@@ -314,7 +314,7 @@ function T(e, t) {
 }
 //#endregion
 //#region src/functions/findLastIndex.ts
-function E(e, t) {
+function T(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++;
@@ -322,10 +322,10 @@ function E(e, t) {
 }
 //#endregion
 //#region src/functions/flatMap.ts
-function D(e, t) {
-	return l(e, "flatMap"), u(t, "mapper", "flatMap"), new m(() => new me(e, t));
+function E(e, t) {
+	return l(e, "flatMap"), u(t, "mapper", "flatMap"), new m(() => new he(e, t));
 }
-var me = class e extends h {
+var he = class e extends h {
 	mapper;
 	static steps = {
 		outer: (t) => {
@@ -386,7 +386,7 @@ var me = class e extends h {
 			throw e.inner = void 0, e.closeAfterCallbackError(), t;
 		}
 	}
-}, O = class e {
+}, D = class e {
 	static instance = e.createFrozen();
 	constructor() {}
 	static createFrozen() {
@@ -394,26 +394,26 @@ var me = class e extends h {
 		return Object.freeze(t), t;
 	}
 };
-function k() {
-	return O.instance;
+function O() {
+	return D.instance;
 }
 //#endregion
 //#region src/functions/forEach.ts
-function A(e, t) {
+function k(e, t) {
 	l(e, "forEach"), u(t, "action", "forEach");
 	let n = 0;
 	for (let r of e) t(r, n++);
-	return k();
+	return O();
 }
-async function j(e, t) {
+async function A(e, t) {
 	l(e, "forEachAsync"), u(t, "action", "forEachAsync");
 	let n = 0;
 	for (let r of e) await t(r, n++);
-	return k();
+	return O();
 }
 //#endregion
 //#region src/functions/includes.ts
-function M(e, t) {
+function j(e, t) {
 	l(e, "includes");
 	let n = t !== t;
 	for (let r of e) if (r === t || n && r !== r) return !0;
@@ -421,7 +421,7 @@ function M(e, t) {
 }
 //#endregion
 //#region src/functions/indexOf.ts
-function N(e, t) {
+function M(e, t) {
 	l(e, "indexOf");
 	let n = 0;
 	for (let r of e) {
@@ -432,12 +432,12 @@ function N(e, t) {
 }
 //#endregion
 //#region src/functions/join.ts
-function P(e, t) {
+function N(e, t) {
 	return l(e, "join"), Array.from(e).join(t);
 }
 //#endregion
 //#region src/functions/lastIndexOf.ts
-function F(e, t) {
+function P(e, t) {
 	l(e, "lastIndexOf");
 	let n = -1, r = 0;
 	for (let i of e) i === t && (n = r), r++;
@@ -445,10 +445,10 @@ function F(e, t) {
 }
 //#endregion
 //#region src/functions/map.ts
-function I(e, t) {
-	return l(e, "map"), u(t, "mapper", "map"), new m(() => new he(e, t));
+function F(e, t) {
+	return l(e, "map"), u(t, "mapper", "map"), new m(() => new ge(e, t));
 }
-var he = class extends h {
+var ge = class extends h {
 	mapper;
 	constructor(e, t) {
 		super(e), this.mapper = t;
@@ -467,13 +467,13 @@ var he = class extends h {
 };
 //#endregion
 //#region src/collections/linkedList.ts
-function ge(e) {
+function _e(e) {
 	l(e, "LinkedList.from");
-	let t = new _e();
+	let t = new I();
 	for (let n of e) t.addLast(n);
 	return t;
 }
-var _e = class {
+var I = class {
 	internalSize = 0;
 	head = null;
 	tail = null;
@@ -515,7 +515,7 @@ function L(e) {
 var R = class {
 	source;
 	constructor(e) {
-		this.source = ge(e);
+		this.source = _e(e);
 	}
 	[Symbol.iterator]() {
 		return this.source[Symbol.iterator]();
@@ -564,7 +564,7 @@ var W = class {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new K(this.source, this.cache, !0);
+		return new ye(this.source, this.cache, !0);
 	}
 	changePartialMemoizationBehaviour() {
 		return new G(this.source);
@@ -576,12 +576,12 @@ var W = class {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new K(this.source, this.cache, !1);
+		return new ye(this.source, this.cache, !1);
 	}
 	changePartialMemoizationBehaviour() {
 		return new W(this.source);
 	}
-}, K = class extends p {
+}, ye = class extends p {
 	source;
 	cache;
 	drainFirst;
@@ -596,15 +596,15 @@ var W = class {
 };
 //#endregion
 //#region src/functions/min.ts
-function q(e, t) {
+function be(e, t) {
 	return l(e, "min"), a(e, i(t), -1);
 }
 //#endregion
 //#region src/functions/prepend.ts
-function ye(e, t) {
-	return l(e, "prepend"), new m(() => new be(e, t));
+function xe(e, t) {
+	return l(e, "prepend"), new m(() => new Se(e, t));
 }
-var be = class extends h {
+var Se = class extends h {
 	value;
 	valueYielded = !1;
 	constructor(e, t) {
@@ -616,17 +616,17 @@ var be = class extends h {
 };
 //#endregion
 //#region src/functions/range.ts
-function J(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 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", "range");
 	let { step: s = 1, reverse: l = !1 } = o ?? {};
 	ee(s, "step", "range");
-	let u = xe(i, a, Math.abs(s), l);
-	return u.length > 0 ? new m(() => new Se(u.first, u.step, u.length)) : b();
+	let u = Ce(i, a, Math.abs(s), l);
+	return u.length > 0 ? new m(() => new we(u.first, u.step, u.length)) : y();
 }
-function xe(e, t, n, r) {
+function Ce(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,
@@ -638,7 +638,7 @@ function xe(e, t, n, r) {
 		length: a
 	};
 }
-var Se = class extends p {
+var we = class extends p {
 	first;
 	step;
 	length;
@@ -652,15 +652,15 @@ var Se = class extends p {
 };
 //#endregion
 //#region src/functions/reduce.ts
-function Y(e, ...t) {
-	if (l(e, "reduce"), t.length === 1) return Ce(e, t[0]);
+function q(e, ...t) {
+	if (l(e, "reduce"), t.length === 1) return Te(e, t[0]);
 	let [n, r] = t;
 	u(r, "reducer", "reduce");
 	let i = n, a = 0;
 	for (let t of e) i = r(i, t, a++);
 	return i;
 }
-function Ce(e, t) {
+function Te(e, t) {
 	u(t, "reducer", "reduce");
 	let n, r = 0;
 	for (let i of e) n = r === 0 ? i : t(n, i, r), r++;
@@ -669,17 +669,36 @@ function Ce(e, t) {
 }
 //#endregion
 //#region src/functions/repeat.ts
-function we(e, t) {
-	return f(t, "count", "repeat"), g(t, (t) => t > 0 ? [e, t - 1] : void 0);
+function Ee(e, t) {
+	return f(t, "count", "repeat"), re(t, (t) => t > 0 ? [e, t - 1] : void 0);
+}
+//#endregion
+//#region src/functions/reverse.ts
+function De(e) {
+	return l(e, "reverse"), new m(() => new Oe(e));
 }
+var Oe = class extends h {
+	reversed;
+	advance() {
+		return this.reversed ??= this.fill(), this.reversed.next();
+	}
+	onReturn(e) {
+		this.reversed = void 0, super.onReturn(e);
+	}
+	fill() {
+		let e = new I();
+		for (let t = this.source.next(); t.done !== !0; t = this.source.next()) e.addFirst(t.value);
+		return e[Symbol.iterator]();
+	}
+};
 //#endregion
 //#region src/functions/sequenceEqual.ts
-function Te(e, t) {
+function ke(e, t) {
 	return e === t;
 }
-function Ee(e, t, n) {
+function Ae(e, t, n) {
 	l(e, "sequenceEqual"), l(t, "sequenceEqual"), n !== void 0 && u(n, "equals", "sequenceEqual");
-	let r = n ?? Te, i = t[Symbol.iterator](), a = !0;
+	let r = n ?? ke, i = t[Symbol.iterator](), a = !0;
 	try {
 		for (let t of e) {
 			a = !1;
@@ -693,7 +712,7 @@ function Ee(e, t, n) {
 }
 //#endregion
 //#region src/functions/single.ts
-function De(e, t) {
+function je(e, t) {
 	l(e, "single");
 	let n = !1, r;
 	if (t === void 0) {
@@ -713,10 +732,10 @@ function De(e, t) {
 }
 //#endregion
 //#region src/functions/skip.ts
-function Oe(e, t) {
-	return l(e, "skip"), f(t, "count", "skip"), new m(() => new ke(e, t));
+function Me(e, t) {
+	return l(e, "skip"), f(t, "count", "skip"), new m(() => new Ne(e, t));
 }
-var ke = class extends h {
+var Ne = class extends h {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -731,41 +750,16 @@ var ke = class extends h {
 	}
 };
 //#endregion
-//#region src/functions/skipWhile.ts
-function Ae(e, t) {
-	return l(e, "skipWhile"), u(t, "predicate", "skipWhile"), new m(() => new je(e, t));
-}
-var je = class extends h {
-	predicate;
-	skipping = !0;
-	constructor(e, t) {
-		super(e), this.predicate = t;
-	}
-	advance() {
-		if (!this.skipping) return this.source.next();
-		for (let e = this.source.next();; e = this.source.next()) {
-			if (e.done === !0) return e;
-			let t;
-			try {
-				t = this.predicate(e.value, this.index++);
-			} catch (e) {
-				throw this.closeAfterCallbackError(), e;
-			}
-			if (!t) return this.skipping = !1, e;
-		}
-	}
-};
-//#endregion
 //#region src/functions/slice.ts
-function Me(e, t, n) {
+function J(e, t, n) {
 	l(e, "slice"), t !== void 0 && d(t, "start", "slice"), n !== void 0 && d(n, "end", "slice");
 	let r = t ?? 0;
-	if (r < 0) return new m(() => new Fe(e, -r, n));
-	if (n !== void 0 && n < 0) return new m(() => new Pe(e, r, -n));
+	if (r < 0) return new m(() => new Ie(e, -r, n));
+	if (n !== void 0 && n < 0) return new m(() => new Fe(e, r, -n));
 	let i = n === void 0 ? Infinity : n > r ? n : 0;
-	return new m(() => new Ne(e, r, i));
+	return new m(() => new Pe(e, r, i));
 }
-var Ne = class extends h {
+var Pe = class extends h {
 	start;
 	end;
 	constructor(e, t, n) {
@@ -781,7 +775,7 @@ var Ne = class extends h {
 		let e = this.source.next();
 		return e.done !== !0 && this.index++, e;
 	}
-}, Pe = class extends h {
+}, Fe = class extends h {
 	start;
 	size;
 	buffer = [];
@@ -808,7 +802,7 @@ var Ne = class extends h {
 	store(e) {
 		this.buffer[this.position] = e, ++this.position === this.size && (this.position = 0, this.full = !0);
 	}
-}, Fe = class extends h {
+}, Ie = class extends h {
 	size;
 	end;
 	buffer;
@@ -831,8 +825,38 @@ var Ne = class extends h {
 	}
 };
 //#endregion
+//#region src/functions/skipLast.ts
+function Le(e, t) {
+	return l(e, "skipLast"), f(t, "count", "skipLast"), t === 0 ? J(e) : J(e, 0, -t);
+}
+//#endregion
+//#region src/functions/skipWhile.ts
+function Re(e, t) {
+	return l(e, "skipWhile"), u(t, "predicate", "skipWhile"), new m(() => new ze(e, t));
+}
+var ze = class extends h {
+	predicate;
+	skipping = !0;
+	constructor(e, t) {
+		super(e), this.predicate = t;
+	}
+	advance() {
+		if (!this.skipping) return this.source.next();
+		for (let e = this.source.next();; e = this.source.next()) {
+			if (e.done === !0) return e;
+			let t;
+			try {
+				t = this.predicate(e.value, this.index++);
+			} catch (e) {
+				throw this.closeAfterCallbackError(), e;
+			}
+			if (!t) return this.skipping = !1, e;
+		}
+	}
+};
+//#endregion
 //#region src/functions/some.ts
-function Ie(e, t) {
+function Be(e, t) {
 	if (l(e, "some"), t === void 0) {
 		for (let t of e) return !0;
 		return !1;
@@ -844,7 +868,7 @@ function Ie(e, t) {
 }
 //#endregion
 //#region src/functions/sum.ts
-function Le(e, t) {
+function Ve(e, t) {
 	l(e, "sum");
 	let n = 0;
 	if (t === void 0) {
@@ -858,10 +882,10 @@ function Le(e, t) {
 }
 //#endregion
 //#region src/functions/take.ts
-function Re(e, t) {
-	return l(e, "take"), f(t, "count", "take"), new m(() => new ze(e, t));
+function He(e, t) {
+	return l(e, "take"), f(t, "count", "take"), new m(() => new Ue(e, t));
 }
-var ze = class extends h {
+var Ue = class extends h {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -873,11 +897,16 @@ var ze = class extends h {
 	}
 };
 //#endregion
+//#region src/functions/takeLast.ts
+function We(e, t) {
+	return l(e, "takeLast"), f(t, "count", "takeLast"), t === 0 ? J(e, 0, 0) : J(e, -t);
+}
+//#endregion
 //#region src/functions/takeWhile.ts
-function Be(e, t) {
-	return l(e, "takeWhile"), u(t, "predicate", "takeWhile"), new m(() => new Ve(e, t));
+function Ge(e, t) {
+	return l(e, "takeWhile"), u(t, "predicate", "takeWhile"), new m(() => new Ke(e, t));
 }
-var Ve = class extends h {
+var Ke = class extends h {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -896,10 +925,10 @@ var Ve = class extends h {
 };
 //#endregion
 //#region src/functions/tap.ts
-function He(e, t) {
-	return l(e, "tap"), u(t, "tapper", "tap"), new m(() => new Ue(e, t));
+function qe(e, t) {
+	return l(e, "tap"), u(t, "tapper", "tap"), new m(() => new Je(e, t));
 }
-var Ue = class extends h {
+var Je = class extends h {
 	tapper;
 	constructor(e, t) {
 		super(e), this.tapper = t;
@@ -917,61 +946,64 @@ var Ue = class extends h {
 };
 //#endregion
 //#region src/functions/tapChain.ts
-function We(e, t) {
+function Ye(e, t) {
 	return l(e, "tapChain"), u(t, "tapper", "tapChain"), new m(() => (t(e, 0), e[Symbol.iterator]()));
 }
 //#endregion
 //#region src/functions/index.ts
-var Ge = /* @__PURE__ */ t({
-	append: () => ie,
-	at: () => oe,
-	average: () => le,
-	collectToArray: () => ue,
-	concat: () => _,
-	count: () => v,
-	distinct: () => y,
-	empty: () => b,
-	every: () => x,
-	filter: () => S,
-	find: () => C,
-	findIndex: () => w,
-	findLast: () => T,
-	findLastIndex: () => E,
-	flatMap: () => D,
-	forEach: () => A,
-	forEachAsync: () => j,
+var Xe = /* @__PURE__ */ t({
+	append: () => ae,
+	at: () => se,
+	average: () => ue,
+	collectToArray: () => g,
+	concat: () => de,
+	count: () => _,
+	distinct: () => v,
+	empty: () => y,
+	every: () => b,
+	filter: () => x,
+	find: () => S,
+	findIndex: () => C,
+	findLast: () => w,
+	findLastIndex: () => T,
+	flatMap: () => E,
+	forEach: () => k,
+	forEachAsync: () => A,
 	getMemoizeDefaultOptions: () => B,
-	includes: () => M,
-	indexOf: () => N,
-	join: () => P,
-	lastIndexOf: () => F,
-	map: () => I,
+	includes: () => j,
+	indexOf: () => M,
+	join: () => N,
+	lastIndexOf: () => P,
+	map: () => F,
 	materialize: () => L,
 	max: () => z,
 	memoize: () => V,
-	min: () => q,
-	prepend: () => ye,
-	range: () => J,
-	reduce: () => Y,
-	repeat: () => we,
-	sequenceEqual: () => Ee,
-	single: () => De,
-	skip: () => Oe,
-	skipWhile: () => Ae,
-	slice: () => Me,
-	some: () => Ie,
-	sum: () => Le,
-	take: () => Re,
-	takeWhile: () => Be,
-	tap: () => He,
-	tapChain: () => We
-}), Ke = Symbol.for("iterable-linq-utility.IIterableLinq");
+	min: () => be,
+	prepend: () => xe,
+	range: () => K,
+	reduce: () => q,
+	repeat: () => Ee,
+	reverse: () => De,
+	sequenceEqual: () => Ae,
+	single: () => je,
+	skip: () => Me,
+	skipLast: () => Le,
+	skipWhile: () => Re,
+	slice: () => J,
+	some: () => Be,
+	sum: () => Ve,
+	take: () => He,
+	takeLast: () => We,
+	takeWhile: () => Ge,
+	tap: () => qe,
+	tapChain: () => Ye
+}), Ze = Symbol.for("iterable-linq-utility.IIterableLinq");
 //#endregion
 //#region src/linqIterable.ts
-function X(e) {
-	return new Z(e);
+function Y(e) {
+	return new X(e);
 }
-var Z = class {
+var X = class {
 	iterable;
 	constructor(e) {
 		this.iterable = e;
@@ -980,118 +1012,127 @@ var Z = class {
 		return this.iterable[Symbol.iterator]();
 	}
 	append(e) {
-		return X(ie(this.iterable, e));
+		return Y(ae(this.iterable, e));
 	}
 	at(e) {
-		return oe(this.iterable, e);
+		return se(this.iterable, e);
 	}
 	average(e) {
-		return le(this.iterable, e);
+		return ue(this.iterable, e);
 	}
 	collectToArray() {
-		return ue(this.iterable);
+		return g(this.iterable);
 	}
 	concat(...e) {
-		return X(_(this.iterable, ...e));
+		return Y(de(this.iterable, ...e));
 	}
 	count(e) {
-		return v(this.iterable, e);
+		return _(this.iterable, e);
 	}
 	distinct(e) {
-		return X(y(this.iterable, e));
+		return Y(v(this.iterable, e));
 	}
 	every(e) {
-		return x(this.iterable, e);
+		return b(this.iterable, e);
 	}
 	filter(e) {
-		return X(S(this.iterable, e));
+		return Y(x(this.iterable, e));
 	}
 	find(e) {
-		return C(this.iterable, e);
+		return S(this.iterable, e);
 	}
 	findIndex(e) {
-		return w(this.iterable, e);
+		return C(this.iterable, e);
 	}
 	findLast(e) {
-		return T(this.iterable, e);
+		return w(this.iterable, e);
 	}
 	findLastIndex(e) {
-		return E(this.iterable, e);
+		return T(this.iterable, e);
 	}
 	flatMap(e) {
-		return X(D(this.iterable, e));
+		return Y(E(this.iterable, e));
 	}
 	forEach(e) {
-		return A(this.iterable, e);
+		return k(this.iterable, e);
 	}
 	forEachAsync(e) {
-		return j(this.iterable, e);
+		return A(this.iterable, e);
 	}
 	includes(e) {
-		return M(this.iterable, e);
+		return j(this.iterable, e);
 	}
 	indexOf(e) {
-		return N(this.iterable, e);
+		return M(this.iterable, e);
 	}
 	join(e) {
-		return P(this.iterable, e);
+		return N(this.iterable, e);
 	}
 	lastIndexOf(e) {
-		return F(this.iterable, e);
+		return P(this.iterable, e);
 	}
 	map(e) {
-		return X(I(this.iterable, e));
+		return Y(F(this.iterable, e));
 	}
 	materialize() {
-		return X(L(this.iterable));
+		return Y(L(this.iterable));
 	}
 	max(e) {
 		return z(this.iterable, e);
 	}
 	memoize(e) {
-		return X(V(this.iterable, e));
+		return Y(V(this.iterable, e));
 	}
 	min(e) {
-		return q(this.iterable, e);
+		return be(this.iterable, e);
 	}
 	prepend(e) {
-		return X(ye(this.iterable, e));
+		return Y(xe(this.iterable, e));
 	}
 	reduce(...e) {
-		return e.length === 1 ? Y(this.iterable, e[0]) : Y(this.iterable, e[0], e[1]);
+		return e.length === 1 ? q(this.iterable, e[0]) : q(this.iterable, e[0], e[1]);
+	}
+	reverse() {
+		return Y(De(this.iterable));
 	}
 	sequenceEqual(e, t) {
-		return Ee(this.iterable, e, t);
+		return Ae(this.iterable, e, t);
 	}
 	single(e) {
-		return De(this.iterable, e);
+		return je(this.iterable, e);
 	}
 	skip(e) {
-		return X(Oe(this.iterable, e));
+		return Y(Me(this.iterable, e));
+	}
+	skipLast(e) {
+		return Y(Le(this.iterable, e));
 	}
 	skipWhile(e) {
-		return X(Ae(this.iterable, e));
+		return Y(Re(this.iterable, e));
 	}
 	slice(e, t) {
-		return X(Me(this.iterable, e, t));
+		return Y(J(this.iterable, e, t));
 	}
 	some(e) {
-		return Ie(this.iterable, e);
+		return Be(this.iterable, e);
 	}
 	sum(e) {
-		return Le(this.iterable, e);
+		return Ve(this.iterable, e);
 	}
 	take(e) {
-		return X(Re(this.iterable, e));
+		return Y(He(this.iterable, e));
+	}
+	takeLast(e) {
+		return Y(We(this.iterable, e));
 	}
 	takeWhile(e) {
-		return X(Be(this.iterable, e));
+		return Y(Ge(this.iterable, e));
 	}
 	tap(e) {
-		return X(He(this.iterable, e));
+		return Y(qe(this.iterable, e));
 	}
 	tapChain(e) {
-		return X(We(this.iterable, e));
+		return Y(Ye(this.iterable, e));
 	}
 	tapChainCreation(e) {
 		u(e, "chainCreationTapper", "tapChainCreation");
@@ -1099,7 +1140,7 @@ var Z = class {
 		return e(t), t;
 	}
 };
-Object.defineProperty(Z.prototype, Ke, {
+Object.defineProperty(X.prototype, Ze, {
 	value: !0,
 	enumerable: !1,
 	writable: !1,
@@ -1107,49 +1148,49 @@ Object.defineProperty(Z.prototype, Ke, {
 });
 //#endregion
 //#region src/extension.ts
-function Q() {
-	return Z.prototype;
+function Z() {
+	return X.prototype;
 }
-function qe(e) {
-	return typeof e == "object" && !!e && e[Ke] === !0;
+function Qe(e) {
+	return typeof e == "object" && !!e && e[Ze] === !0;
 }
-function Je(e, t) {
-	let n = Object.getOwnPropertyDescriptor(Q(), e);
-	Object.defineProperty(Q(), e, {
+function Q(e, t) {
+	let n = Object.getOwnPropertyDescriptor(Z(), e);
+	Object.defineProperty(Z(), e, {
 		value: t,
 		enumerable: !1,
 		writable: n?.writable ?? !1,
 		configurable: !0
 	});
 }
-function Ye(e, t, n) {
+function $e(e, t, n) {
 	ne(t, "name", e), u(n, "implementation", e);
 }
-function Xe(e, t) {
-	if (Ye("extend", e, t), e in X([])) throw c("extend", `"${e}" already exists on IIterableLinq: use override() to replace it`);
-	Je(e, t);
+function et(e, t) {
+	if ($e("extend", e, t), e in Y([])) throw c("extend", `"${e}" already exists on IIterableLinq: use override() to replace it`);
+	Q(e, t);
 }
-function Ze(e, t) {
-	Ye("override", e, t);
+function tt(e, t) {
+	$e("override", e, t);
 	let n = e;
-	if (!(n !== "constructor" && Object.prototype.hasOwnProperty.call(Q(), n))) throw c("override", `"${n}" is not a method of IIterableLinq: use extend() to add it`);
-	Je(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 Qe() {
-	return $(b());
+function nt() {
+	return $(y());
 }
 function $(e) {
-	return l(e, "from"), X(e);
+	return l(e, "from"), Y(e);
 }
-function $e(e, t, n) {
-	if (typeof t == "number") return $(J(e, t, n));
+function rt(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 $(J(e, t));
+	return $(K(e, t));
 }
-function et(e, t) {
-	return $(we(e, t));
+function it(e, t) {
+	return $(Ee(e, t));
 }
 //#endregion
-export { Ge as Functions, O as Unit, Qe as empty, Xe as extend, $ as from, $e as fromRange, qe as isIterableLinq, Ze as override, et as repeat, k as unit };
+export { Xe as Functions, D as Unit, nt as empty, et as extend, $ as from, rt as fromRange, Qe as isIterableLinq, tt as override, it as repeat, O as unit };