iterable-linq-utility 0.3.0 → 0.5.0

package/dist/iterable-linq-utility.js

@@ -71,13 +71,27 @@ function ne(e, t) {
 }
 //#endregion
 //#region src/functions/collectToArray.ts
-function d(e) {
+function re(e) {
 	if (c(e), 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);
+	let n = 0;
+	if (t === void 0) {
+		for (let t of e) n++;
+		return n;
+	}
+	l(t, "predicate");
+	let r = 0;
+	for (let i of e) t(i, r++) && n++;
+	return n;
+}
+//#endregion
 //#region src/iterators/baseIterator.ts
 var f = class {
 	done = !1;
@@ -122,9 +136,9 @@ var f = class {
 //#endregion
 //#region src/iterators/unfold.ts
 function h(e, t) {
-	return new p(() => new g(e, t));
+	return new p(() => new ie(e, t));
 }
-var g = class extends f {
+var ie = class extends f {
 	state;
 	step;
 	constructor(e, t) {
@@ -136,16 +150,48 @@ var g = 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));
+}
+var ae = class extends m {
+	keySelector;
+	seen = /* @__PURE__ */ new Set();
+	constructor(e, t) {
+		super(e), this.keySelector = t;
+	}
+	advance() {
+		for (let e = this.source.next();; e = this.source.next()) {
+			if (e.done === !0) return e;
+			let t = e.value;
+			if (this.keySelector !== void 0) try {
+				t = this.keySelector(e.value, this.index++);
+			} catch (e) {
+				throw this.closeAfterCallbackError(), e;
+			}
+			if (!this.seen.has(t)) return this.seen.add(t), e;
+		}
+	}
+};
+//#endregion
 //#region src/functions/empty.ts
 function _() {
 	return h(void 0, () => void 0);
 }
 //#endregion
-//#region src/functions/filter.ts
+//#region src/functions/every.ts
 function v(e, t) {
-	return c(e), l(t, "predicate"), new p(() => new re(e, t));
+	c(e), l(t, "predicate");
+	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));
 }
-var re = class extends m {
+var se = class extends m {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -164,11 +210,29 @@ var re = class extends m {
 	}
 };
 //#endregion
-//#region src/functions/flatMap.ts
+//#region src/functions/find.ts
 function y(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new ie(e, t));
+	c(e), l(t, "predicate");
+	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");
+	let n = 0;
+	for (let r of e) {
+		if (t(r, n)) return n;
+		n++;
+	}
+	return -1;
+}
+//#endregion
+//#region src/functions/flatMap.ts
+function x(e, t) {
+	return c(e), l(t, "mapper"), new p(() => new ce(e, t));
 }
-var ie = class e extends m {
+var ce = class e extends m {
 	mapper;
 	static steps = {
 		outer: (t) => {
@@ -229,7 +293,7 @@ var ie = class e extends m {
 			throw e.inner = void 0, e.closeAfterCallbackError(), t;
 		}
 	}
-}, b = class e {
+}, S = class e {
 	static instance = e.createFrozen();
 	constructor() {}
 	static createFrozen() {
@@ -237,29 +301,37 @@ var ie = class e extends m {
 		return Object.freeze(t), t;
 	}
 };
-function x() {
-	return b.instance;
+function C() {
+	return S.instance;
 }
 //#endregion
 //#region src/functions/forEach.ts
-function S(e, t) {
+function w(e, t) {
 	c(e), l(t, "action");
 	let n = 0;
 	for (let r of e) t(r, n++);
-	return x();
+	return C();
 }
-async function C(e, t) {
+async function T(e, t) {
 	c(e), l(t, "action");
 	let n = 0;
 	for (let r of e) await t(r, n++);
-	return x();
+	return C();
+}
+//#endregion
+//#region src/functions/includes.ts
+function E(e, t) {
+	c(e);
+	let n = t !== t;
+	for (let r of e) if (r === t || n && r !== r) return !0;
+	return !1;
 }
 //#endregion
 //#region src/functions/map.ts
-function w(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new ae(e, t));
+function D(e, t) {
+	return c(e), l(t, "mapper"), new p(() => new le(e, t));
 }
-var ae = class extends m {
+var le = class extends m {
 	mapper;
 	constructor(e, t) {
 		super(e), this.mapper = t;
@@ -278,18 +350,18 @@ var ae = class extends m {
 };
 //#endregion
 //#region src/collections/linkedList.ts
-function T(e) {
+function ue(e) {
 	c(e);
-	let t = new oe();
+	let t = new de();
 	for (let n of e) t.addLast(n);
 	return t;
 }
-var oe = class {
+var de = class {
 	internalSize = 0;
 	head = null;
 	tail = null;
 	[Symbol.iterator]() {
-		return new se(this.head);
+		return new fe(this.head);
 	}
 	addFirst(e) {
 		let t = {
@@ -308,7 +380,7 @@ var oe = class {
 	size() {
 		return this.internalSize;
 	}
-}, se = class extends f {
+}, fe = class extends f {
 	current;
 	constructor(e) {
 		super(), this.current = e;
@@ -320,13 +392,13 @@ var oe = class {
 };
 //#endregion
 //#region src/functions/materialize.ts
-function E(e) {
-	return c(e), e instanceof D ? e : new D(e);
+function O(e) {
+	return c(e), e instanceof k ? e : new k(e);
 }
-var D = class {
+var k = class {
 	source;
 	constructor(e) {
-		this.source = T(e);
+		this.source = ue(e);
 	}
 	[Symbol.iterator]() {
 		return this.source[Symbol.iterator]();
@@ -334,29 +406,29 @@ var D = class {
 };
 //#endregion
 //#region src/functions/max.ts
-function O(e, t) {
+function A(e, t) {
 	return c(e), a(e, i(t), 1);
 }
 //#endregion
 //#region src/functions/memoize.ts
-function k() {
+function j() {
 	return { allowPartialMemoization: !0 };
 }
-function A(e, t) {
+function M(e, t) {
 	c(e);
 	let n = {
-		...k(),
+		...j(),
 		...t
 	}.allowPartialMemoization;
-	return e instanceof N ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof P ? n ? e : e.changePartialMemoizationBehaviour() : n ? new P(e) : new N(e);
+	return e instanceof P ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof F ? n ? e : e.changePartialMemoizationBehaviour() : n ? new F(e) : new P(e);
 }
-function j() {
+function N() {
 	return {
 		values: [],
 		finished: !1
 	};
 }
-function M(e, t) {
+function pe(e, t) {
 	if (t.error) throw t.error.value;
 	if (t.finished) return !1;
 	t.source ??= e[Symbol.iterator]();
@@ -368,31 +440,31 @@ function M(e, t) {
 	}
 	return n.done === !0 ? (t.finished = !0, t.source = void 0, !1) : (t.values.push(n.value), !0);
 }
-var N = class {
+var P = class {
 	source;
-	cache = j();
+	cache = N();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new F(this.source, this.cache, !0);
+		return new I(this.source, this.cache, !0);
 	}
 	changePartialMemoizationBehaviour() {
-		return new P(this.source);
+		return new F(this.source);
 	}
-}, P = class {
+}, F = class {
 	source;
-	cache = j();
+	cache = N();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new F(this.source, this.cache, !1);
+		return new I(this.source, this.cache, !1);
 	}
 	changePartialMemoizationBehaviour() {
-		return new N(this.source);
+		return new P(this.source);
 	}
-}, F = class extends f {
+}, I = class extends f {
 	source;
 	cache;
 	drainFirst;
@@ -401,28 +473,28 @@ var N = class {
 		super(), this.source = e, this.cache = t, this.drainFirst = n;
 	}
 	advance() {
-		if (this.drainFirst) for (; M(this.source, this.cache););
-		return this.index < this.cache.values.length || M(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
+		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();
 	}
 };
 //#endregion
 //#region src/functions/min.ts
-function I(e, t) {
+function L(e, t) {
 	return c(e), a(e, i(t), -1);
 }
 //#endregion
 //#region src/functions/range.ts
-function L(e, t, n) {
+function R(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");
 	let o = r ? n : t;
 	o !== void 0 && te(o, "options");
 	let { step: s = 1, reverse: c = !1 } = o ?? {};
 	ee(s, "step");
-	let l = ce(i, a, Math.abs(s), c);
-	return l.length > 0 ? new p(() => new le(l.first, l.step, l.length)) : _();
+	let l = me(i, a, Math.abs(s), c);
+	return l.length > 0 ? new p(() => new he(l.first, l.step, l.length)) : _();
 }
-function ce(e, t, n, r) {
+function me(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,
@@ -434,7 +506,7 @@ function ce(e, t, n, r) {
 		length: a
 	};
 }
-var le = class extends f {
+var he = class extends f {
 	first;
 	step;
 	length;
@@ -448,15 +520,15 @@ var le = class extends f {
 };
 //#endregion
 //#region src/functions/reduce.ts
-function R(e, ...t) {
-	if (c(e), t.length === 1) return z(e, t[0]);
+function z(e, ...t) {
+	if (c(e), t.length === 1) return ge(e, t[0]);
 	let [n, r] = t;
 	l(r, "reducer");
 	let i = n, a = 0;
 	for (let t of e) i = r(i, t, a++);
 	return i;
 }
-function z(e, t) {
+function ge(e, t) {
 	l(t, "reducer");
 	let n, r = 0;
 	for (let i of e) n = r === 0 ? i : t(n, i, r), r++;
@@ -471,9 +543,9 @@ function B(e, t) {
 //#endregion
 //#region src/functions/skip.ts
 function V(e, t) {
-	return c(e), u(t, "count"), new p(() => new H(e, t));
+	return c(e), u(t, "count"), new p(() => new _e(e, t));
 }
-var H = class extends m {
+var _e = class extends m {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -488,6 +560,31 @@ var H = 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));
+}
+var ve = class extends m {
+	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 U(e, t) {
 	if (c(e), t === void 0) {
@@ -502,9 +599,9 @@ function U(e, t) {
 //#endregion
 //#region src/functions/take.ts
 function W(e, t) {
-	return c(e), u(t, "count"), new p(() => new ue(e, t));
+	return c(e), u(t, "count"), new p(() => new ye(e, t));
 }
-var ue = class extends m {
+var ye = class extends m {
 	count;
 	constructor(e, t) {
 		super(e), this.count = t;
@@ -516,11 +613,33 @@ var ue = class extends m {
 	}
 };
 //#endregion
-//#region src/functions/tap.ts
+//#region src/functions/takeWhile.ts
 function G(e, t) {
-	return c(e), l(t, "tapper"), new p(() => new de(e, t));
+	return c(e), l(t, "predicate"), new p(() => new be(e, t));
+}
+var be = class extends m {
+	predicate;
+	constructor(e, t) {
+		super(e), this.predicate = t;
+	}
+	advance() {
+		let 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;
+		}
+		return t ? e : (this.source.return?.(), s());
+	}
+};
+//#endregion
+//#region src/functions/tap.ts
+function K(e, t) {
+	return c(e), l(t, "tapper"), new p(() => new xe(e, t));
 }
-var de = class extends m {
+var xe = class extends m {
 	tapper;
 	constructor(e, t) {
 		super(e), this.tapper = t;
@@ -538,39 +657,47 @@ var de = class extends m {
 };
 //#endregion
 //#region src/functions/tapChain.ts
-function K(e, t) {
+function q(e, t) {
 	return c(e), l(t, "tapper"), new p(() => (t(e, 0), e[Symbol.iterator]()));
 }
 //#endregion
 //#region src/functions/index.ts
-var fe = /* @__PURE__ */ t({
-	collectToArray: () => d,
+var Se = /* @__PURE__ */ t({
+	collectToArray: () => re,
+	count: () => d,
+	distinct: () => g,
 	empty: () => _,
-	filter: () => v,
-	flatMap: () => y,
-	forEach: () => S,
-	forEachAsync: () => C,
-	getMemoizeDefaultOptions: () => k,
-	map: () => w,
-	materialize: () => E,
-	max: () => O,
-	memoize: () => A,
-	min: () => I,
-	range: () => L,
-	reduce: () => R,
+	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,
-	tap: () => G,
-	tapChain: () => K
-}), q = Symbol.for("iterable-linq-utility.IIterableLinq");
+	takeWhile: () => G,
+	tap: () => K,
+	tapChain: () => q
+}), J = Symbol.for("iterable-linq-utility.IIterableLinq");
 //#endregion
 //#region src/linqIterable.ts
-function J(e) {
-	return new Y(e);
+function Y(e) {
+	return new X(e);
 }
-var Y = class {
+var X = class {
 	iterable;
 	constructor(e) {
 		this.iterable = e;
@@ -579,52 +706,76 @@ var Y = class {
 		return this.iterable[Symbol.iterator]();
 	}
 	collectToArray() {
-		return d(this.iterable);
+		return re(this.iterable);
+	}
+	count(e) {
+		return d(this.iterable, e);
+	}
+	distinct(e) {
+		return Y(g(this.iterable, e));
+	}
+	every(e) {
+		return v(this.iterable, e);
 	}
 	filter(e) {
-		return J(v(this.iterable, e));
+		return Y(oe(this.iterable, e));
+	}
+	find(e) {
+		return y(this.iterable, e);
+	}
+	findIndex(e) {
+		return b(this.iterable, e);
 	}
 	flatMap(e) {
-		return J(y(this.iterable, e));
+		return Y(x(this.iterable, e));
 	}
 	forEach(e) {
-		return S(this.iterable, e);
+		return w(this.iterable, e);
 	}
 	forEachAsync(e) {
-		return C(this.iterable, e);
+		return T(this.iterable, e);
+	}
+	includes(e) {
+		return E(this.iterable, e);
 	}
 	map(e) {
-		return J(w(this.iterable, e));
+		return Y(D(this.iterable, e));
 	}
 	materialize() {
-		return J(E(this.iterable));
+		return Y(O(this.iterable));
 	}
 	max(e) {
-		return O(this.iterable, e);
+		return A(this.iterable, e);
 	}
 	memoize(e) {
-		return J(A(this.iterable, e));
+		return Y(M(this.iterable, e));
 	}
 	min(e) {
-		return I(this.iterable, e);
+		return L(this.iterable, e);
 	}
 	reduce(...e) {
-		return e.length === 1 ? R(this.iterable, e[0]) : R(this.iterable, e[0], e[1]);
+		return e.length === 1 ? z(this.iterable, e[0]) : z(this.iterable, e[0], e[1]);
 	}
 	skip(e) {
-		return J(V(this.iterable, e));
+		return Y(V(this.iterable, e));
+	}
+	skipWhile(e) {
+		return Y(H(this.iterable, e));
 	}
 	some(e) {
 		return U(this.iterable, e);
 	}
 	take(e) {
-		return J(W(this.iterable, e));
+		return Y(W(this.iterable, e));
+	}
+	takeWhile(e) {
+		return Y(G(this.iterable, e));
 	}
 	tap(e) {
-		return J(G(this.iterable, e));
+		return Y(K(this.iterable, e));
 	}
 	tapChain(e) {
-		return J(K(this.iterable, e));
+		return Y(q(this.iterable, e));
 	}
 	tapChainCreation(e) {
 		l(e, "chainCreationTapper");
@@ -632,7 +783,7 @@ var Y = class {
 		return e(t), t;
 	}
 };
-Object.defineProperty(Y.prototype, q, {
+Object.defineProperty(X.prototype, J, {
 	value: !0,
 	enumerable: !1,
 	writable: !1,
@@ -640,15 +791,15 @@ Object.defineProperty(Y.prototype, q, {
 });
 //#endregion
 //#region src/extension.ts
-function X() {
-	return Y.prototype;
+function Z() {
+	return X.prototype;
 }
-function pe(e) {
-	return typeof e == "object" && !!e && e[q] === !0;
+function Ce(e) {
+	return typeof e == "object" && !!e && e[J] === !0;
 }
-function Z(e, t) {
-	let n = Object.getOwnPropertyDescriptor(X(), e);
-	Object.defineProperty(X(), e, {
+function we(e, t) {
+	let n = Object.getOwnPropertyDescriptor(Z(), e);
+	Object.defineProperty(Z(), e, {
 		value: t,
 		enumerable: !1,
 		writable: n?.writable ?? !1,
@@ -658,31 +809,31 @@ function Z(e, t) {
 function Q(e, t) {
 	ne(e, "name"), l(t, "implementation");
 }
-function me(e, t) {
-	if (Q(e, t), e in J([])) throw Error(`"${e}" already exists on IIterableLinq: use override() to replace it`);
-	Z(e, t);
+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 he(e, t) {
+function Ee(e, t) {
 	Q(e, t);
 	let n = e;
-	if (!(n !== "constructor" && Object.prototype.hasOwnProperty.call(X(), n))) throw Error(`"${n}" is not a method of IIterableLinq: use extend() to add it`);
-	Z(n, t);
+	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);
 }
 //#endregion
 //#region src/index.ts
-function ge() {
+function De() {
 	return $(_());
 }
 function $(e) {
-	return c(e), J(e);
+	return c(e), Y(e);
 }
-function _e(e, t, n) {
-	if (typeof t == "number") return $(L(e, t, n));
+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 $(L(e, t));
+	return $(R(e, t));
 }
-function ve(e, t) {
+function ke(e, t) {
 	return $(B(e, t));
 }
 //#endregion
-export { fe as Functions, b as Unit, ge as empty, me as extend, $ as from, _e as fromRange, pe as isIterableLinq, he as override, ve as repeat, x as unit };
+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 };