iterable-linq-utility 0.7.0 → 0.9.0

package/dist/iterable-linq-utility.js

@@ -62,72 +62,24 @@ function l(e, t) {
 function u(e, t, r) {
 	if (!n(e)) throw c(r, `The "${t}" function must be provided`);
 }
-function ee(e, t, n) {
+function d(e, t, n) {
 	if (!Number.isInteger(e)) throw c(n, `The "${t}" parameter must be an integer`);
 }
-function d(e, t, n) {
+function f(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, n) {
+function ee(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, n) {
+function te(e, t, n) {
 	if (typeof e != "object" || !e) throw c(n, `The "${t}" parameter must be an object`);
 }
-function re(e, t, n) {
+function ne(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 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 oe(e, t) {
-	l(e, "count");
-	let n = 0;
-	if (t === void 0) {
-		for (let t of e) n++;
-		return n;
-	}
-	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 h = class {
+var p = class {
 	done = !1;
 	next() {
 		if (this.done) return s();
@@ -149,7 +101,7 @@ var h = class {
 			} catch {}
 		}
 	}
-}, g = class {
+}, m = class {
 	createIterator;
 	constructor(e) {
 		this.createIterator = e;
@@ -157,7 +109,7 @@ var h = class {
 	[Symbol.iterator]() {
 		return this.createIterator();
 	}
-}, _ = class extends h {
+}, h = class extends p {
 	source;
 	index = 0;
 	constructor(e) {
@@ -169,10 +121,10 @@ var h = class {
 };
 //#endregion
 //#region src/iterators/unfold.ts
-function se(e, t) {
-	return new g(() => new ce(e, t));
+function re(e, t) {
+	return new m(() => new ie(e, t));
 }
-var ce = class extends h {
+var ie = class extends p {
 	state;
 	step;
 	constructor(e, t) {
@@ -184,11 +136,102 @@ var ce = class extends h {
 	}
 };
 //#endregion
+//#region src/functions/append.ts
+function ae(e, t) {
+	return l(e, "append"), new m(() => new oe(e, t));
+}
+var oe = class extends h {
+	value;
+	sourceDone = !1;
+	constructor(e, t) {
+		super(e), this.value = t;
+	}
+	advance() {
+		if (this.sourceDone) return s();
+		let e = this.source.next();
+		return e.done === !0 ? (this.sourceDone = !0, o(this.value)) : e;
+	}
+};
+//#endregion
+//#region src/functions/at.ts
+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 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 ue(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 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);
+	return t;
+}
+//#endregion
+//#region src/functions/concat.ts
+function de(e, ...t) {
+	l(e, "concat");
+	for (let e of t) l(e, "concat");
+	let n = [e, ...t];
+	return new m(() => new fe(n));
+}
+var fe = class extends p {
+	sources;
+	position = 0;
+	current;
+	constructor(e) {
+		super(), this.sources = e, this.current = e[0][Symbol.iterator]();
+	}
+	advance() {
+		for (;;) {
+			let e = this.current.next();
+			if (e.done !== !0 || ++this.position === this.sources.length) return e;
+			this.current = void 0, this.current = this.sources[this.position][Symbol.iterator]();
+		}
+	}
+	onReturn(e) {
+		this.current?.return?.(e);
+	}
+};
+//#endregion
+//#region src/functions/count.ts
+function _(e, t) {
+	l(e, "count");
+	let n = 0;
+	if (t === void 0) {
+		for (let t of e) n++;
+		return n;
+	}
+	u(t, "predicate", "count");
+	let r = 0;
+	for (let i of e) t(i, r++) && n++;
+	return n;
+}
+//#endregion
 //#region src/functions/distinct.ts
 function v(e, t) {
-	return l(e, "distinct"), t !== void 0 && u(t, "keySelector", "distinct"), new g(() => new le(e, t));
+	return l(e, "distinct"), t !== void 0 && u(t, "keySelector", "distinct"), new m(() => new pe(e, t));
 }
-var le = class extends _ {
+var pe = class extends h {
 	keySelector;
 	seen = /* @__PURE__ */ new Set();
 	constructor(e, t) {
@@ -210,11 +253,11 @@ var le = class extends _ {
 //#endregion
 //#region src/functions/empty.ts
 function y() {
-	return se(void 0, () => void 0);
+	return re(void 0, () => void 0);
 }
 //#endregion
 //#region src/functions/every.ts
-function ue(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;
@@ -222,10 +265,10 @@ function ue(e, t) {
 }
 //#endregion
 //#region src/functions/filter.ts
-function b(e, t) {
-	return l(e, "filter"), u(t, "predicate", "filter"), new g(() => new de(e, t));
+function x(e, t) {
+	return l(e, "filter"), u(t, "predicate", "filter"), new m(() => new me(e, t));
 }
-var de = class extends _ {
+var me = class extends h {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -245,14 +288,14 @@ var de = class extends _ {
 };
 //#endregion
 //#region src/functions/find.ts
-function x(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 S(e, t) {
+function C(e, t) {
 	l(e, "findIndex"), u(t, "predicate", "findIndex");
 	let n = 0;
 	for (let r of e) {
@@ -263,7 +306,7 @@ function S(e, t) {
 }
 //#endregion
 //#region src/functions/findLast.ts
-function C(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);
@@ -271,7 +314,7 @@ function C(e, t) {
 }
 //#endregion
 //#region src/functions/findLastIndex.ts
-function w(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++;
@@ -279,10 +322,10 @@ function w(e, t) {
 }
 //#endregion
 //#region src/functions/flatMap.ts
-function T(e, t) {
-	return l(e, "flatMap"), u(t, "mapper", "flatMap"), new g(() => new fe(e, t));
+function E(e, t) {
+	return l(e, "flatMap"), u(t, "mapper", "flatMap"), new m(() => new he(e, t));
 }
-var fe = class e extends _ {
+var he = class e extends h {
 	mapper;
 	static steps = {
 		outer: (t) => {
@@ -343,7 +386,7 @@ var fe = class e extends _ {
 			throw e.inner = void 0, e.closeAfterCallbackError(), t;
 		}
 	}
-}, E = class e {
+}, D = class e {
 	static instance = e.createFrozen();
 	constructor() {}
 	static createFrozen() {
@@ -351,26 +394,26 @@ var fe = class e extends _ {
 		return Object.freeze(t), t;
 	}
 };
-function D() {
-	return E.instance;
+function O() {
+	return D.instance;
 }
 //#endregion
 //#region src/functions/forEach.ts
-function O(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 D();
+	return O();
 }
-async function k(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 D();
+	return O();
 }
 //#endregion
 //#region src/functions/includes.ts
-function A(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;
@@ -378,7 +421,7 @@ function A(e, t) {
 }
 //#endregion
 //#region src/functions/indexOf.ts
-function j(e, t) {
+function M(e, t) {
 	l(e, "indexOf");
 	let n = 0;
 	for (let r of e) {
@@ -389,12 +432,12 @@ function j(e, t) {
 }
 //#endregion
 //#region src/functions/join.ts
-function M(e, t) {
+function N(e, t) {
 	return l(e, "join"), Array.from(e).join(t);
 }
 //#endregion
 //#region src/functions/lastIndexOf.ts
-function N(e, t) {
+function P(e, t) {
 	l(e, "lastIndexOf");
 	let n = -1, r = 0;
 	for (let i of e) i === t && (n = r), r++;
@@ -402,10 +445,10 @@ function N(e, t) {
 }
 //#endregion
 //#region src/functions/map.ts
-function P(e, t) {
-	return l(e, "map"), u(t, "mapper", "map"), new g(() => new pe(e, t));
+function F(e, t) {
+	return l(e, "map"), u(t, "mapper", "map"), new m(() => new ge(e, t));
 }
-var pe = class extends _ {
+var ge = class extends h {
 	mapper;
 	constructor(e, t) {
 		super(e), this.mapper = t;
@@ -424,18 +467,18 @@ var pe = class extends _ {
 };
 //#endregion
 //#region src/collections/linkedList.ts
-function me(e) {
+function _e(e) {
 	l(e, "LinkedList.from");
-	let t = new he();
+	let t = new I();
 	for (let n of e) t.addLast(n);
 	return t;
 }
-var he = class {
+var I = class {
 	internalSize = 0;
 	head = null;
 	tail = null;
 	[Symbol.iterator]() {
-		return new ge(this.head);
+		return new ve(this.head);
 	}
 	addFirst(e) {
 		let t = {
@@ -454,7 +497,7 @@ var he = class {
 	size() {
 		return this.internalSize;
 	}
-}, ge = class extends h {
+}, ve = class extends p {
 	current;
 	constructor(e) {
 		super(), this.current = e;
@@ -466,13 +509,13 @@ var he = class {
 };
 //#endregion
 //#region src/functions/materialize.ts
-function F(e) {
-	return l(e, "materialize"), e instanceof I ? e : new I(e);
+function L(e) {
+	return l(e, "materialize"), e instanceof R ? e : new R(e);
 }
-var I = class {
+var R = class {
 	source;
 	constructor(e) {
-		this.source = me(e);
+		this.source = _e(e);
 	}
 	[Symbol.iterator]() {
 		return this.source[Symbol.iterator]();
@@ -480,29 +523,29 @@ var I = class {
 };
 //#endregion
 //#region src/functions/max.ts
-function L(e, t) {
+function z(e, t) {
 	return l(e, "max"), a(e, i(t), 1);
 }
 //#endregion
 //#region src/functions/memoize.ts
-function R() {
+function B() {
 	return { allowPartialMemoization: !0 };
 }
-function z(e, t) {
+function V(e, t) {
 	l(e, "memoize");
 	let n = {
-		...R(),
+		...B(),
 		...t
 	}.allowPartialMemoization;
-	return e instanceof H ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof U ? n ? e : e.changePartialMemoizationBehaviour() : n ? new U(e) : new H(e);
+	return e instanceof W ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof G ? n ? e : e.changePartialMemoizationBehaviour() : n ? new G(e) : new W(e);
 }
-function B() {
+function H() {
 	return {
 		values: [],
 		finished: !1
 	};
 }
-function V(e, t) {
+function U(e, t) {
 	if (t.error) throw t.error.value;
 	if (t.finished) return !1;
 	t.source ??= e[Symbol.iterator]();
@@ -514,31 +557,31 @@ function V(e, t) {
 	}
 	return n.done === !0 ? (t.finished = !0, t.source = void 0, !1) : (t.values.push(n.value), !0);
 }
-var H = class {
+var W = class {
 	source;
-	cache = B();
+	cache = H();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new W(this.source, this.cache, !0);
+		return new ye(this.source, this.cache, !0);
 	}
 	changePartialMemoizationBehaviour() {
-		return new U(this.source);
+		return new G(this.source);
 	}
-}, U = class {
+}, G = class {
 	source;
-	cache = B();
+	cache = H();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new W(this.source, this.cache, !1);
+		return new ye(this.source, this.cache, !1);
 	}
 	changePartialMemoizationBehaviour() {
-		return new H(this.source);
+		return new W(this.source);
 	}
-}, W = class extends h {
+}, ye = class extends p {
 	source;
 	cache;
 	drainFirst;
@@ -547,28 +590,43 @@ var H = class {
 		super(), this.source = e, this.cache = t, this.drainFirst = n;
 	}
 	advance() {
-		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();
+		if (this.drainFirst) for (; U(this.source, this.cache););
+		return this.index < this.cache.values.length || U(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
 	}
 };
 //#endregion
 //#region src/functions/min.ts
-function G(e, t) {
+function be(e, t) {
 	return l(e, "min"), a(e, i(t), -1);
 }
 //#endregion
+//#region src/functions/prepend.ts
+function xe(e, t) {
+	return l(e, "prepend"), new m(() => new Se(e, t));
+}
+var Se = class extends h {
+	value;
+	valueYielded = !1;
+	constructor(e, t) {
+		super(e), this.value = t;
+	}
+	advance() {
+		return this.valueYielded ? this.source.next() : (this.valueYielded = !0, o(this.value));
+	}
+};
+//#endregion
 //#region src/functions/range.ts
 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 && ne(o, "options", "range");
+	o !== void 0 && te(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();
+	ee(s, "step", "range");
+	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 _e(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,
@@ -580,7 +638,7 @@ function _e(e, t, n, r) {
 		length: a
 	};
 }
-var ve = class extends h {
+var we = class extends p {
 	first;
 	step;
 	length;
@@ -595,14 +653,14 @@ var ve = class extends h {
 //#endregion
 //#region src/functions/reduce.ts
 function q(e, ...t) {
-	if (l(e, "reduce"), t.length === 1) return ye(e, t[0]);
+	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 ye(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++;
@@ -611,17 +669,36 @@ function ye(e, t) {
 }
 //#endregion
 //#region src/functions/repeat.ts
-function J(e, t) {
-	return d(t, "count", "repeat"), se(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 be(e, t) {
+function ke(e, t) {
 	return e === t;
 }
-function xe(e, t, n) {
+function Ae(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;
+	let r = n ?? ke, i = t[Symbol.iterator](), a = !0;
 	try {
 		for (let t of e) {
 			a = !1;
@@ -635,7 +712,7 @@ function xe(e, t, n) {
 }
 //#endregion
 //#region src/functions/single.ts
-function Se(e, t) {
+function je(e, t) {
 	l(e, "single");
 	let n = !1, r;
 	if (t === void 0) {
@@ -655,10 +732,10 @@ function Se(e, t) {
 }
 //#endregion
 //#region src/functions/skip.ts
-function Ce(e, t) {
-	return l(e, "skip"), d(t, "count", "skip"), new g(() => new we(e, t));
+function Me(e, t) {
+	return l(e, "skip"), f(t, "count", "skip"), new m(() => new Ne(e, t));
 }
-var we = class extends _ {
+var Ne = class extends h {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -673,11 +750,91 @@ var we = class extends _ {
 	}
 };
 //#endregion
+//#region src/functions/slice.ts
+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 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 Pe(e, r, i));
+}
+var Pe = class extends h {
+	start;
+	end;
+	constructor(e, t, n) {
+		super(e), this.start = t, this.end = n;
+	}
+	advance() {
+		if (this.index >= this.end) return this.source.return?.(), s();
+		for (; this.index < this.start;) {
+			let e = this.source.next();
+			if (e.done === !0) return e;
+			this.index++;
+		}
+		let e = this.source.next();
+		return e.done !== !0 && this.index++, e;
+	}
+}, Fe = class extends h {
+	start;
+	size;
+	buffer = [];
+	position = 0;
+	full = !1;
+	constructor(e, t, n) {
+		super(e), this.start = t, this.size = n;
+	}
+	advance() {
+		for (; this.index < this.start;) {
+			let e = this.source.next();
+			if (e.done === !0) return e;
+			this.index++;
+		}
+		for (let e = this.source.next(); e.done !== !0; e = this.source.next()) {
+			if (this.full) {
+				let t = this.buffer[this.position];
+				return this.store(e.value), o(t);
+			}
+			this.store(e.value);
+		}
+		return s();
+	}
+	store(e) {
+		this.buffer[this.position] = e, ++this.position === this.size && (this.position = 0, this.full = !0);
+	}
+}, Ie = class extends h {
+	size;
+	end;
+	buffer;
+	position = 0;
+	remaining = 0;
+	constructor(e, t, n) {
+		super(e), this.size = t, this.end = n;
+	}
+	advance() {
+		if (this.buffer ??= this.fill(), this.remaining === 0) return this.buffer = [], s();
+		this.remaining--;
+		let e = this.buffer[this.position];
+		return ++this.position === this.buffer.length && (this.position = 0), o(e);
+	}
+	fill() {
+		let e = [], t = 0, n = 0;
+		for (let r = this.source.next(); r.done !== !0; r = this.source.next()) e[n] = r.value, t++, ++n === this.size && (n = 0);
+		let r = this.end === void 0 ? t : this.end < 0 ? Math.max(t + this.end, 0) : Math.min(this.end, t);
+		return this.position = t > this.size ? n : 0, this.remaining = Math.max(r - (t - e.length), 0), e;
+	}
+};
+//#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 Te(e, t) {
-	return l(e, "skipWhile"), u(t, "predicate", "skipWhile"), new g(() => new Ee(e, t));
+function Re(e, t) {
+	return l(e, "skipWhile"), u(t, "predicate", "skipWhile"), new m(() => new ze(e, t));
 }
-var Ee = class extends _ {
+var ze = class extends h {
 	predicate;
 	skipping = !0;
 	constructor(e, t) {
@@ -699,7 +856,7 @@ var Ee = class extends _ {
 };
 //#endregion
 //#region src/functions/some.ts
-function De(e, t) {
+function Be(e, t) {
 	if (l(e, "some"), t === void 0) {
 		for (let t of e) return !0;
 		return !1;
@@ -711,7 +868,7 @@ function De(e, t) {
 }
 //#endregion
 //#region src/functions/sum.ts
-function Oe(e, t) {
+function Ve(e, t) {
 	l(e, "sum");
 	let n = 0;
 	if (t === void 0) {
@@ -725,10 +882,10 @@ function Oe(e, t) {
 }
 //#endregion
 //#region src/functions/take.ts
-function ke(e, t) {
-	return l(e, "take"), d(t, "count", "take"), new g(() => new Ae(e, t));
+function He(e, t) {
+	return l(e, "take"), f(t, "count", "take"), new m(() => new Ue(e, t));
 }
-var Ae = class extends _ {
+var Ue = class extends h {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -740,11 +897,16 @@ var Ae = class extends _ {
 	}
 };
 //#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 je(e, t) {
-	return l(e, "takeWhile"), u(t, "predicate", "takeWhile"), new g(() => new Me(e, t));
+function Ge(e, t) {
+	return l(e, "takeWhile"), u(t, "predicate", "takeWhile"), new m(() => new Ke(e, t));
 }
-var Me = class extends _ {
+var Ke = class extends h {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -763,10 +925,10 @@ var Me = class extends _ {
 };
 //#endregion
 //#region src/functions/tap.ts
-function Ne(e, t) {
-	return l(e, "tap"), u(t, "tapper", "tap"), new g(() => new Pe(e, t));
+function qe(e, t) {
+	return l(e, "tap"), u(t, "tapper", "tap"), new m(() => new Je(e, t));
 }
-var Pe = class extends _ {
+var Je = class extends h {
 	tapper;
 	constructor(e, t) {
 		super(e), this.tapper = t;
@@ -784,51 +946,58 @@ var Pe = class extends _ {
 };
 //#endregion
 //#region src/functions/tapChain.ts
-function Fe(e, t) {
-	return l(e, "tapChain"), u(t, "tapper", "tapChain"), new g(() => (t(e, 0), e[Symbol.iterator]()));
+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 Ie = /* @__PURE__ */ t({
-	at: () => f,
-	average: () => p,
-	collectToArray: () => m,
-	count: () => oe,
+var Xe = /* @__PURE__ */ t({
+	append: () => ae,
+	at: () => se,
+	average: () => ue,
+	collectToArray: () => g,
+	concat: () => de,
+	count: () => _,
 	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,
+	every: () => b,
+	filter: () => x,
+	find: () => S,
+	findIndex: () => C,
+	findLast: () => w,
+	findLastIndex: () => T,
+	flatMap: () => E,
+	forEach: () => k,
+	forEachAsync: () => A,
+	getMemoizeDefaultOptions: () => B,
+	includes: () => j,
+	indexOf: () => M,
+	join: () => N,
+	lastIndexOf: () => P,
+	map: () => F,
+	materialize: () => L,
+	max: () => z,
+	memoize: () => V,
+	min: () => be,
+	prepend: () => xe,
 	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");
+	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 Y(e) {
@@ -842,107 +1011,128 @@ var X = class {
 	[Symbol.iterator]() {
 		return this.iterable[Symbol.iterator]();
 	}
+	append(e) {
+		return Y(ae(this.iterable, e));
+	}
 	at(e) {
-		return f(this.iterable, e);
+		return se(this.iterable, e);
 	}
 	average(e) {
-		return p(this.iterable, e);
+		return ue(this.iterable, e);
 	}
 	collectToArray() {
-		return m(this.iterable);
+		return g(this.iterable);
+	}
+	concat(...e) {
+		return Y(de(this.iterable, ...e));
 	}
 	count(e) {
-		return oe(this.iterable, e);
+		return _(this.iterable, e);
 	}
 	distinct(e) {
 		return Y(v(this.iterable, e));
 	}
 	every(e) {
-		return ue(this.iterable, e);
+		return b(this.iterable, e);
 	}
 	filter(e) {
-		return Y(b(this.iterable, e));
+		return Y(x(this.iterable, e));
 	}
 	find(e) {
-		return x(this.iterable, e);
+		return S(this.iterable, e);
 	}
 	findIndex(e) {
-		return S(this.iterable, e);
+		return C(this.iterable, e);
 	}
 	findLast(e) {
-		return C(this.iterable, e);
+		return w(this.iterable, e);
 	}
 	findLastIndex(e) {
-		return w(this.iterable, e);
+		return T(this.iterable, e);
 	}
 	flatMap(e) {
-		return Y(T(this.iterable, e));
+		return Y(E(this.iterable, e));
 	}
 	forEach(e) {
-		return O(this.iterable, e);
+		return k(this.iterable, e);
 	}
 	forEachAsync(e) {
-		return k(this.iterable, e);
+		return A(this.iterable, e);
 	}
 	includes(e) {
-		return A(this.iterable, e);
+		return j(this.iterable, e);
 	}
 	indexOf(e) {
-		return j(this.iterable, e);
+		return M(this.iterable, e);
 	}
 	join(e) {
-		return M(this.iterable, e);
+		return N(this.iterable, e);
 	}
 	lastIndexOf(e) {
-		return N(this.iterable, e);
+		return P(this.iterable, e);
 	}
 	map(e) {
-		return Y(P(this.iterable, e));
+		return Y(F(this.iterable, e));
 	}
 	materialize() {
-		return Y(F(this.iterable));
+		return Y(L(this.iterable));
 	}
 	max(e) {
-		return L(this.iterable, e);
+		return z(this.iterable, e);
 	}
 	memoize(e) {
-		return Y(z(this.iterable, e));
+		return Y(V(this.iterable, e));
 	}
 	min(e) {
-		return G(this.iterable, e);
+		return be(this.iterable, e);
+	}
+	prepend(e) {
+		return Y(xe(this.iterable, e));
 	}
 	reduce(...e) {
 		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 xe(this.iterable, e, t);
+		return Ae(this.iterable, e, t);
 	}
 	single(e) {
-		return Se(this.iterable, e);
+		return je(this.iterable, e);
 	}
 	skip(e) {
-		return Y(Ce(this.iterable, e));
+		return Y(Me(this.iterable, e));
+	}
+	skipLast(e) {
+		return Y(Le(this.iterable, e));
 	}
 	skipWhile(e) {
-		return Y(Te(this.iterable, e));
+		return Y(Re(this.iterable, e));
+	}
+	slice(e, t) {
+		return Y(J(this.iterable, e, t));
 	}
 	some(e) {
-		return De(this.iterable, e);
+		return Be(this.iterable, e);
 	}
 	sum(e) {
-		return Oe(this.iterable, e);
+		return Ve(this.iterable, e);
 	}
 	take(e) {
-		return Y(ke(this.iterable, e));
+		return Y(He(this.iterable, e));
+	}
+	takeLast(e) {
+		return Y(We(this.iterable, e));
 	}
 	takeWhile(e) {
-		return Y(je(this.iterable, e));
+		return Y(Ge(this.iterable, e));
 	}
 	tap(e) {
-		return Y(Ne(this.iterable, e));
+		return Y(qe(this.iterable, e));
 	}
 	tapChain(e) {
-		return Y(Fe(this.iterable, e));
+		return Y(Ye(this.iterable, e));
 	}
 	tapChainCreation(e) {
 		u(e, "chainCreationTapper", "tapChainCreation");
@@ -950,7 +1140,7 @@ var X = class {
 		return e(t), t;
 	}
 };
-Object.defineProperty(X.prototype, Le, {
+Object.defineProperty(X.prototype, Ze, {
 	value: !0,
 	enumerable: !1,
 	writable: !1,
@@ -961,8 +1151,8 @@ Object.defineProperty(X.prototype, Le, {
 function Z() {
 	return X.prototype;
 }
-function Re(e) {
-	return typeof e == "object" && !!e && e[Le] === !0;
+function Qe(e) {
+	return typeof e == "object" && !!e && e[Ze] === !0;
 }
 function Q(e, t) {
 	let n = Object.getOwnPropertyDescriptor(Z(), e);
@@ -973,34 +1163,34 @@ function Q(e, t) {
 		configurable: !0
 	});
 }
-function ze(e, t, n) {
-	re(t, "name", e), u(n, "implementation", e);
+function $e(e, t, n) {
+	ne(t, "name", e), u(n, "implementation", e);
 }
-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`);
+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 Ve(e, t) {
-	ze("override", e, t);
+function tt(e, t) {
+	$e("override", e, t);
 	let n = e;
 	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 He() {
+function nt() {
 	return $(y());
 }
 function $(e) {
 	return l(e, "from"), Y(e);
 }
-function Ue(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 $(K(e, t));
 }
-function We(e, t) {
-	return $(J(e, t));
+function it(e, t) {
+	return $(Ee(e, t));
 }
 //#endregion
-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 };
+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 };