iterable-linq-utility 0.0.10 → 0.0.11

package/dist/functions/flatMap.d.ts

@@ -0,0 +1,8 @@
+import { Mapper } from '@/types';
+/**
+ * @operation `Transformation`
+ * @param iterable
+ * @param mapper
+ * @returns
+ */
+export declare function flatMap<T, R>(iterable: Iterable<T>, mapper: Mapper<T, Iterable<R>>): Iterable<R>;

package/dist/functions/forEach.d.ts

@@ -0,0 +1,3 @@
+import { Action, AsyncAction, Unit } from "@/types";
+export declare function forEach<T>(iterable: Iterable<T>, action: Action<T>): Unit;
+export declare function forEachAsync<T>(iterable: Iterable<T>, action: AsyncAction<T>): Promise<Unit>;

package/dist/functions/index.d.ts

@@ -3,7 +3,9 @@ export { collectToArray };
 import { empty } from './empty';
 export { empty };
 import { filter } from './filter';
-export { filter };
+import { flatMap } from './flatMap';
+import { forEach, forEachAsync } from './forEach';
+export { filter, flatMap, forEach, forEachAsync };
 import { map } from './map';
 import { materialize } from './materialize';
 import { max } from './max';

package/dist/index.d.ts

@@ -1,5 +1,6 @@
 import { IterableLinqWrapper, type IIterableLinq } from "./linqIterable";
 import * as Functions from '@/functions';
+import * as Types from '@/types';
 export declare function empty<T>(): IIterableLinq<T>;
 export declare function from<T>(iterable: Iterable<T>): IIterableLinq<T>;
 export declare function fromRange(end: number): IIterableLinq<number>;
@@ -10,4 +11,4 @@ export declare function fromRange(start: number, end: number, reverse: boolean):
 export declare function fromRange(start: number, end: number, step: number, reverse: boolean): IIterableLinq<number>;
 export declare function fromRange(start: number, end?: number | boolean, step?: number | boolean, reverse?: boolean): Iterable<number>;
 export declare function repeat<T>(value: T, count: number): IIterableLinq<T>;
-export { Functions, IIterableLinq, IterableLinqWrapper };
+export { Functions, IIterableLinq, IterableLinqWrapper, Types };

package/dist/interable-linq-utility.js

@@ -1,30 +1,35 @@
-var E = Object.defineProperty;
-var C = (e, t, r) => t in e ? E(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var n = (e, t, r) => (C(e, typeof t != "symbol" ? t + "" : t, r), r);
-function $(e) {
+var B = Object.defineProperty;
+var D = (e, t, r) => t in e ? B(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
+var n = (e, t, r) => (D(e, typeof t != "symbol" ? t + "" : t, r), r);
+function U(e) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
   return Array.from(e);
 }
-function f(e, t) {
+function m(e, t) {
   return {
     done: e,
     value: t
   };
 }
+function _(e) {
+  return { done: !1, value: e };
+}
 function l(e) {
   return { done: !0, value: e };
 }
-function m(e) {
+function d(e) {
   return typeof e == "function";
 }
-function w() {
-  return new j();
+function S() {
+  return new G();
 }
-class j {
+class G {
   [Symbol.iterator]() {
-    return new O();
+    return new H();
   }
 }
-class O {
+class H {
   next() {
     return l();
   }
@@ -32,64 +37,157 @@ class O {
     return l(t);
   }
 }
-function v(e, t) {
-  if (!m(t))
+function N(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
     throw '"predicate" function must be provided';
-  return new B(e, t);
+  return new J(e, t);
 }
-class B {
+class J {
   constructor(t, r) {
     n(this, "predicate");
     n(this, "source");
     this.source = t, this.predicate = r;
   }
   [Symbol.iterator]() {
-    return new D(this.source, this.predicate);
+    return new K(this.source, this.predicate);
   }
 }
-class D {
+class K {
   constructor(t, r) {
     n(this, "index", 0);
     n(this, "sourceIterator");
     n(this, "predicate");
+    n(this, "internalNext", () => {
+      for (; ; ) {
+        const t = this.sourceIterator.next();
+        if (t.done === !0 || this.predicate(t.value, this.index++))
+          return t;
+      }
+    });
     this.sourceIterator = t[Symbol.iterator](), this.predicate = r;
   }
   next() {
-    for (; ; ) {
-      const t = this.sourceIterator.next();
-      if (t.done === !0 || this.predicate(t.value, this.index++))
-        return t;
-    }
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(t);
   }
 }
 function g(e, t) {
-  if (!m(t))
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
     throw '"mapper" function must be provided';
-  return new P(e, t);
+  return new Q(e, t);
 }
-class P {
+class Q {
   constructor(t, r) {
     n(this, "mapper");
     n(this, "source");
     this.source = t, this.mapper = r;
   }
   [Symbol.iterator]() {
-    return new G(this.source, this.mapper);
+    return new X(this.source, this.mapper);
   }
 }
-class G {
+class X {
+  constructor(t, r) {
+    n(this, "index", 0);
+    n(this, "mapper");
+    n(this, "sourceIterator");
+    n(this, "fmIterator");
+    n(this, "sourceNext", () => {
+      const t = this.sourceIterator.next();
+      if (t.done !== !0) {
+        const r = this.mapper(t.value, this.index++);
+        return this.fmIterator = r[Symbol.iterator](), this.internalNext = this.fmNext, this.internalNext();
+      }
+      return this.internalNext = l, this.internalNext();
+    });
+    n(this, "fmNext", () => {
+      const t = this.fmIterator.next();
+      return t.done !== !0 ? _(t.value) : (this.internalNext = this.sourceNext, this.internalNext());
+    });
+    n(this, "internalNext", this.sourceNext);
+    this.sourceIterator = t[Symbol.iterator](), this.mapper = r;
+  }
+  next() {
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(t);
+  }
+}
+class z {
+}
+const M = new z();
+Object.freeze(M);
+function b() {
+  return M;
+}
+const pt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  Unit: z,
+  unit: b
+}, Symbol.toStringTag, { value: "Module" }));
+function T(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"action" function must be provided';
+  const r = e[Symbol.iterator]();
+  for (let i = r.next(), s = 0; i.done !== !0; i = r.next(), s++)
+    t(i.value, s);
+  return b();
+}
+async function A(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"action" function must be provided';
+  const r = [], i = e[Symbol.iterator]();
+  for (let s = i.next(), u = 0; s.done !== !0; s = i.next(), u++)
+    r.push(t(s.value, u));
+  return await Promise.all(r), b();
+}
+function R(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"mapper" function must be provided';
+  return new Y(e, t);
+}
+class Y {
+  constructor(t, r) {
+    n(this, "mapper");
+    n(this, "source");
+    this.source = t, this.mapper = r;
+  }
+  [Symbol.iterator]() {
+    return new Z(this.source, this.mapper);
+  }
+}
+class Z {
   constructor(t, r) {
     n(this, "index", 0);
     n(this, "sourceIterator");
     n(this, "mapper");
+    n(this, "internalNext", () => {
+      const t = this.sourceIterator.next();
+      return t.done !== !0 ? m(!1, this.mapper(t.value, this.index++)) : (this.internalNext = l, this.internalNext());
+    });
     this.sourceIterator = t[Symbol.iterator](), this.mapper = r;
   }
   next() {
-    const t = this.sourceIterator.next();
-    return t.done !== !0 ? f(!1, this.mapper(t.value, this.index++)) : l();
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(t);
   }
 }
-function H(e) {
+function q(e) {
   const t = e[Symbol.iterator](), r = new x();
   for (let i = t.next(); i.done !== !0; i = t.next())
     r.addLast(i.value);
@@ -106,11 +204,11 @@ class x {
         nextNode: null
       };
       return this.head = r, this.tail = r, this.internalSize++, this.internalAddFirst = (i) => {
-        const o = {
+        const s = {
           data: i,
           nextNode: null
         };
-        return o.nextNode = this.head, this.head = o, this.internalSize++, this;
+        return s.nextNode = this.head, this.head = s, this.internalSize++, this;
       }, this;
     });
     n(this, "internalAddLast", (t) => {
@@ -119,16 +217,16 @@ class x {
         nextNode: null
       };
       return this.head = r, this.tail = r, this.internalSize++, this.internalAddLast = (i) => {
-        const o = {
+        const s = {
           data: i,
           nextNode: null
         };
-        return this.tail.nextNode = o, this.tail = o, this.internalSize++, this;
+        return this.tail.nextNode = s, this.tail = s, this.internalSize++, this;
       }, this;
     });
   }
   [Symbol.iterator]() {
-    return new J(this.head);
+    return new W(this.head);
   }
   addFirst(t) {
     return this.internalAddFirst(t);
@@ -140,29 +238,29 @@ class x {
     return this.internalSize;
   }
 }
-class J {
+class W {
   constructor(t = null) {
     n(this, "current", null);
     this.current = t;
   }
   next() {
     const t = this.current;
-    return t === null ? l() : (this.current = t.nextNode, f(!1, t.data));
+    return t === null ? l() : (this.current = t.nextNode, m(!1, t.data));
   }
 }
-function z(e) {
-  return e instanceof y ? e : new y(e);
+function k(e) {
+  return e instanceof I ? e : new I(e);
 }
-class y {
+class I {
   constructor(t) {
     n(this, "source");
-    this.source = H(t);
+    this.source = q(t);
   }
   [Symbol.iterator]() {
-    return new K(this.source);
+    return new tt(this.source);
   }
 }
-class K {
+class tt {
   constructor(t) {
     n(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
@@ -171,25 +269,27 @@ class K {
     return this.sourceIterator.next();
   }
 }
-function N(e, t) {
+function L(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
   const r = e[Symbol.iterator]();
-  let i = r.next(), o = i.value, u = null;
-  for (t == null ? u = (s, a) => s < a ? -1 : s === a ? 0 : 1 : m(t) ? u = t : Array.isArray(t) ? u = (s, a) => {
+  let i = r.next(), s = i.value, u = null;
+  for (t == null ? u = (o, a) => o < a ? -1 : o === a ? 0 : 1 : d(t) ? u = t : Array.isArray(t) ? u = (o, a) => {
     let c = 0;
     for (const h of t)
-      if (c = s[h] < a[h] ? -1 : s[h] === a[h] ? 0 : 1, c !== 0)
+      if (c = o[h] < a[h] ? -1 : o[h] === a[h] ? 0 : 1, c !== 0)
         break;
     return c;
-  } : u = (s, a) => s[t] < a[t] ? -1 : s[t] === a[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
-    const s = u(o, i.value);
-    o = s > 0 || s === 0 ? o : i.value;
+  } : u = (o, a) => o[t] < a[t] ? -1 : o[t] === a[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
+    const o = u(s, i.value);
+    s = o > 0 || o === 0 ? s : i.value;
   }
-  return o == null ? null : o;
+  return s == null ? null : s;
 }
-function M(e) {
-  return e instanceof S ? e : new S(e);
+function F(e) {
+  return e instanceof y ? e : new y(e);
 }
-class S {
+class y {
   constructor(t) {
     n(this, "isMemoized", !1);
     n(this, "sourceIterator");
@@ -198,10 +298,10 @@ class S {
     this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof x && (this.linkedList = t, this.isMemoized = !0);
   }
   [Symbol.iterator]() {
-    return this.isMemoized ? new U(this.linkedList) : new Q(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
+    return this.isMemoized ? new rt(this.linkedList) : new et(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
   }
 }
-class Q {
+class et {
   constructor(t, r, i) {
     n(this, "index", 0);
     n(this, "linkedList");
@@ -217,7 +317,7 @@ class Q {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class U {
+class rt {
   constructor(t) {
     n(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
@@ -226,26 +326,28 @@ class U {
     return this.memoizedSourceIterator.next();
   }
 }
-function R(e, t) {
+function E(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
   const r = e[Symbol.iterator]();
-  let i = r.next(), o = i.value, u = null;
-  for (t == null ? u = (s, a) => s < a ? -1 : s === a ? 0 : 1 : m(t) ? u = t : Array.isArray(t) ? u = (s, a) => {
+  let i = r.next(), s = i.value, u = null;
+  for (t == null ? u = (o, a) => o < a ? -1 : o === a ? 0 : 1 : d(t) ? u = t : Array.isArray(t) ? u = (o, a) => {
     let c = 0;
     for (const h of t)
-      if (c = s[h] < a[h] ? -1 : s[h] === a[h] ? 0 : 1, c !== 0)
+      if (c = o[h] < a[h] ? -1 : o[h] === a[h] ? 0 : 1, c !== 0)
         break;
     return c;
-  } : u = (s, a) => s[t] < a[t] ? -1 : s[t] === a[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
-    const s = u(o, i.value);
-    o = s < 0 || s === 0 ? o : i.value;
+  } : u = (o, a) => o[t] < a[t] ? -1 : o[t] === a[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
+    const o = u(s, i.value);
+    s = o < 0 || o === 0 ? s : i.value;
   }
-  return o == null ? null : o;
+  return s == null ? null : s;
 }
-function k(e, t, r, i) {
-  const o = t == null || t === !0 || t === !1 ? e : t, u = t == null || t === !0 || t === !1 ? 0 : e, s = u < o, a = r !== !0 && r !== !1 && r != null && r !== 0 ? r : s ? 1 : -1, c = s && a < 0 || !s && a > 0 ? -1 * a : a, h = Math.ceil(Math.abs(o - u) / Math.abs(c)), I = !!(t === !0 || r === !0 || i != null && i), p = I ? h * c + u : u;
-  return u === o ? new q(p, 0, 0) : I ? new Z(p, h, c) : new X(p, h, c);
+function V(e, t, r, i) {
+  const s = t == null || t === !0 || t === !1 ? e : t, u = t == null || t === !0 || t === !1 ? 0 : e, o = u < s, a = r !== !0 && r !== !1 && r != null && r !== 0 ? r : o ? 1 : -1, c = o && a < 0 || !o && a > 0 ? -1 * a : a, h = Math.ceil(Math.abs(s - u) / Math.abs(c)), v = !!(t === !0 || r === !0 || i != null && i), p = v ? h * c + u : u;
+  return u === s ? new ut(p, 0, 0) : v ? new st(p, h, c) : new nt(p, h, c);
 }
-class X {
+class nt {
   constructor(t, r, i) {
     n(this, "initialValue");
     n(this, "length");
@@ -253,10 +355,10 @@ class X {
     this.initialValue = t, this.length = r, this.step = i;
   }
   [Symbol.iterator]() {
-    return new Y(this.initialValue, this.length, this.step);
+    return new it(this.initialValue, this.length, this.step);
   }
 }
-class Y {
+class it {
   constructor(t, r, i) {
     n(this, "value");
     n(this, "length");
@@ -265,10 +367,10 @@ class Y {
   }
   next() {
     const t = this.value;
-    return this.value += this.step, this.length-- ? f(!1, t) : l();
+    return this.value += this.step, this.length-- ? m(!1, t) : l();
   }
 }
-class Z {
+class st {
   constructor(t, r, i) {
     n(this, "initialValue");
     n(this, "length");
@@ -276,10 +378,10 @@ class Z {
     this.initialValue = t - i, this.length = r, this.step = i;
   }
   [Symbol.iterator]() {
-    return new _(this.initialValue, this.length, this.step);
+    return new ot(this.initialValue, this.length, this.step);
   }
 }
-class _ {
+class ot {
   constructor(t, r, i) {
     n(this, "value");
     n(this, "length");
@@ -288,10 +390,10 @@ class _ {
   }
   next() {
     const t = this.value;
-    return this.value -= this.step, this.length-- ? f(!1, t) : l();
+    return this.value -= this.step, this.length-- ? m(!1, t) : l();
   }
 }
-class q {
+class ut {
   constructor(t, r, i) {
     n(this, "initialValue");
     n(this, "length");
@@ -299,10 +401,10 @@ class q {
     this.initialValue = t, this.length = r, this.step = i;
   }
   [Symbol.iterator]() {
-    return new W(this.initialValue, this.length, this.step);
+    return new at(this.initialValue, this.length, this.step);
   }
 }
-class W {
+class at {
   constructor(t, r, i) {
     n(this, "value");
     n(this, "length");
@@ -313,88 +415,102 @@ class W {
     return l();
   }
 }
-function A(e, t, r) {
-  if (!m(r))
+function j(e, t, r) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(r))
     throw '"reducer" function must be provided';
   const i = e[Symbol.iterator]();
-  let o = t, u = 0;
-  for (let s = i.next(); s.done !== !0; s = i.next())
-    o = r(o, s.value, u), u++;
-  return o;
+  let s = t, u = 0;
+  for (let o = i.next(); o.done !== !0; o = i.next())
+    s = r(s, o.value, u), u++;
+  return s;
 }
-function L(e, t) {
+function C(e, t) {
   if (t < 0)
     throw '"count" parameter must be greater or equal then 0';
-  return new tt(e, t);
+  return new lt(e, t);
 }
-class tt {
+class lt {
   constructor(t, r) {
     n(this, "value");
     n(this, "count");
     this.value = t, this.count = r;
   }
   [Symbol.iterator]() {
-    return new et(this.value, this.count);
+    return new ht(this.value, this.count);
   }
 }
-class et {
+class ht {
   constructor(t, r) {
     n(this, "leftToRepeat", 0);
     n(this, "value");
     n(this, "count");
-    n(this, "internalNext", () => this.leftToRepeat-- ? f(!1, this.value) : (this.internalNext = () => l(), l()));
-    this.value = t, this.count = r, this.leftToRepeat = r, r === 0 && (this.internalNext = () => l());
+    n(this, "internalNext", () => this.leftToRepeat-- ? m(!1, this.value) : (this.internalNext = l, l()));
+    this.value = t, this.count = r, this.leftToRepeat = r, r === 0 && (this.internalNext = l);
   }
   next() {
     return this.internalNext();
   }
   return(t) {
-    return this.internalNext = () => l(), l(t);
+    return this.internalNext = l, l(t);
   }
 }
-function V(e, t) {
+function O(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"predicate" function must be provided';
   const r = e[Symbol.iterator]();
   let i = 0;
-  for (let o = r.next(); o.done !== !0; o = r.next())
-    if (t(o.value, i++))
+  for (let s = r.next(); s.done !== !0; s = r.next())
+    if (t(s.value, i++))
       return !0;
   return !1;
 }
-function F(e, t) {
-  return new rt(e, t);
+function P(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"tapper" function must be provided';
+  return new ct(e, t);
 }
-class rt {
+class ct {
   constructor(t, r) {
     n(this, "tapper");
     n(this, "source");
     this.source = t, this.tapper = r;
   }
   [Symbol.iterator]() {
-    return new nt(this.source, this.tapper);
+    return new dt(this.source, this.tapper);
   }
 }
-class nt {
+class dt {
   constructor(t, r) {
     n(this, "index", 0);
     n(this, "sourceIterator");
     n(this, "tapper");
-    n(this, "innerNext", () => {
+    n(this, "internalNext", () => {
       const t = this.sourceIterator.next();
-      return t.done !== !0 ? (this.tapper(t.value, this.index++), t) : (this.innerNext = l, l());
+      return t.done !== !0 ? (this.tapper(t.value, this.index++), t) : (this.internalNext = l, l());
     });
     this.sourceIterator = t[Symbol.iterator](), this.tapper = r;
   }
   next() {
-    return this.innerNext();
+    return this.internalNext();
   }
   return(t) {
-    return this.innerNext = l, l(t);
+    return this.internalNext = l, l(t);
   }
 }
-function T(e, t) {
-  return new it(e, t);
+function $(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"tapper" function must be provided';
+  return new ft(e, t);
 }
-class it {
+class ft {
   constructor(t, r) {
     n(this, "tapper");
     n(this, "source");
@@ -404,24 +520,27 @@ class it {
     return this.tapper(this.source, 0), this.source[Symbol.iterator]();
   }
 }
-const ot = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const xt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  collectToArray: $,
-  empty: w,
-  filter: v,
-  map: g,
-  materialize: z,
-  max: N,
-  memoize: M,
-  min: R,
-  range: k,
-  reduce: A,
-  repeat: L,
-  some: V,
-  tap: F,
-  tapChain: T
+  collectToArray: U,
+  empty: S,
+  filter: N,
+  flatMap: g,
+  forEach: T,
+  forEachAsync: A,
+  map: R,
+  materialize: k,
+  max: L,
+  memoize: F,
+  min: E,
+  range: V,
+  reduce: j,
+  repeat: C,
+  some: O,
+  tap: P,
+  tapChain: $
 }, Symbol.toStringTag, { value: "Module" }));
-class d {
+class f {
   constructor(t) {
     n(this, "iterable");
     this.iterable = t;
@@ -433,56 +552,70 @@ class d {
     return Array.from(this.iterable);
   }
   filter(t) {
-    return new d(v(this.iterable, t));
+    return new f(N(this.iterable, t));
+  }
+  flatMap(t) {
+    return new f(g(this.iterable, t));
+  }
+  forEach(t) {
+    return T(this.iterable, t);
+  }
+  forEachAsync(t) {
+    return A(this.iterable, t);
   }
   map(t) {
-    return new d(g(this.iterable, t));
+    return new f(R(this.iterable, t));
   }
   materialize() {
-    return new d(z(this.iterable));
+    return new f(k(this.iterable));
   }
   max(t) {
-    return N(this.iterable, t);
+    return L(this.iterable, t);
   }
   memoize() {
-    return new d(M(this.iterable));
+    return new f(F(this.iterable));
   }
   min(t) {
-    return R(this.iterable, t);
+    return E(this.iterable, t);
   }
   reduce(t, r) {
-    return A(this.iterable, t, r);
+    return j(this.iterable, t, r);
   }
   some(t) {
-    return V(this.iterable, t);
+    return O(this.iterable, t);
   }
   tap(t) {
-    return new d(F(this.iterable, t));
+    return new f(P(this.iterable, t));
   }
   tapChain(t) {
-    return new d(T(this.iterable, t));
+    return new f($(this.iterable, t));
   }
   tapChainCreation(t) {
+    if (!d(t))
+      throw '"tapper" function must be provided';
     return t(this), this;
   }
 }
-function at() {
-  return b(w());
+function bt() {
+  return w(S());
 }
-function b(e) {
-  return new d(e);
+function w(e) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  return new f(e);
 }
-function ut(e, t, r, i) {
-  return b(k(e, t, r, i));
+function wt(e, t, r, i) {
+  return w(V(e, t, r, i));
 }
-function lt(e, t) {
-  return b(L(e, t));
+function vt(e, t) {
+  return w(C(e, t));
 }
 export {
-  ot as Functions,
-  d as IterableLinqWrapper,
-  at as empty,
-  b as from,
-  ut as fromRange,
-  lt as repeat
+  xt as Functions,
+  f as IterableLinqWrapper,
+  pt as Types,
+  bt as empty,
+  w as from,
+  wt as fromRange,
+  vt as repeat
 };

package/dist/interable-linq-utility.umd.cjs

@@ -1 +1 @@
-(function(l,c){typeof exports=="object"&&typeof module<"u"?c(exports):typeof define=="function"&&define.amd?define(["exports"],c):(l=typeof globalThis<"u"?globalThis:l||self,c(l["interable-linq-utility"]={}))})(this,function(l){"use strict";var ut=Object.defineProperty;var lt=(l,c,m)=>c in l?ut(l,c,{enumerable:!0,configurable:!0,writable:!0,value:m}):l[c]=m;var n=(l,c,m)=>(lt(l,typeof c!="symbol"?c+"":c,m),m);function c(e){return Array.from(e)}function m(e,t){return{done:e,value:t}}function h(e){return{done:!0,value:e}}function ht(e){return e}function b(e){return typeof e=="function"}function S(){return new j}class j{[Symbol.iterator](){return new O}}class O{next(){return h()}return(t){return h(t)}}function w(e,t){if(!b(t))throw'"predicate" function must be provided';return new $(e,t)}class ${constructor(t,r){n(this,"predicate");n(this,"source");this.source=t,this.predicate=r}[Symbol.iterator](){return new P(this.source,this.predicate)}}class P{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"predicate");this.sourceIterator=t[Symbol.iterator](),this.predicate=r}next(){for(;;){const t=this.sourceIterator.next();if(t.done===!0||this.predicate(t.value,this.index++))return t}}}function v(e,t){if(!b(t))throw'"mapper" function must be provided';return new B(e,t)}class B{constructor(t,r){n(this,"mapper");n(this,"source");this.source=t,this.mapper=r}[Symbol.iterator](){return new D(this.source,this.mapper)}}class D{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"mapper");this.sourceIterator=t[Symbol.iterator](),this.mapper=r}next(){const t=this.sourceIterator.next();return t.done!==!0?m(!1,this.mapper(t.value,this.index++)):h()}}function G(e){const t=e[Symbol.iterator](),r=new I;for(let i=t.next();i.done!==!0;i=t.next())r.addLast(i.value);return r}class I{constructor(){n(this,"internalSize",0);n(this,"head",null);n(this,"tail",null);n(this,"internalAddFirst",t=>{const r={data:t,nextNode:null};return this.head=r,this.tail=r,this.internalSize++,this.internalAddFirst=i=>{const o={data:i,nextNode:null};return o.nextNode=this.head,this.head=o,this.internalSize++,this},this});n(this,"internalAddLast",t=>{const r={data:t,nextNode:null};return this.head=r,this.tail=r,this.internalSize++,this.internalAddLast=i=>{const o={data:i,nextNode:null};return this.tail.nextNode=o,this.tail=o,this.internalSize++,this},this})}[Symbol.iterator](){return new H(this.head)}addFirst(t){return this.internalAddFirst(t)}addLast(t){return this.internalAddLast(t)}size(){return this.internalSize}}class H{constructor(t=null){n(this,"current",null);this.current=t}next(){const t=this.current;return t===null?h():(this.current=t.nextNode,m(!1,t.data))}}function g(e){return e instanceof z?e:new z(e)}class z{constructor(t){n(this,"source");this.source=G(t)}[Symbol.iterator](){return new J(this.source)}}class J{constructor(t){n(this,"sourceIterator");this.sourceIterator=t[Symbol.iterator]()}next(){return this.sourceIterator.next()}}function M(e,t){const r=e[Symbol.iterator]();let i=r.next(),o=i.value,u=null;for(t==null?u=(s,a)=>s<a?-1:s===a?0:1:b(t)?u=t:Array.isArray(t)?u=(s,a)=>{let f=0;for(const d of t)if(f=s[d]<a[d]?-1:s[d]===a[d]?0:1,f!==0)break;return f}:u=(s,a)=>s[t]<a[t]?-1:s[t]===a[t]?0:1,i=r.next();i.done!==!0;i=r.next()){const s=u(o,i.value);o=s>0||s===0?o:i.value}return o==null?null:o}function N(e){return e instanceof R?e:new R(e)}class R{constructor(t){n(this,"isMemoized",!1);n(this,"sourceIterator");n(this,"linkedList",new I);n(this,"source");this.source=t,this.sourceIterator=t[Symbol.iterator](),t instanceof I&&(this.linkedList=t,this.isMemoized=!0)}[Symbol.iterator](){return this.isMemoized?new Q(this.linkedList):new K(this.sourceIterator,this.linkedList,t=>this.isMemoized=t.done===!0)}}class K{constructor(t,r,i){n(this,"index",0);n(this,"linkedList");n(this,"linkedListIterator");n(this,"setAsMemoized");n(this,"sourceIterator");this.linkedList=r,this.linkedListIterator=r[Symbol.iterator](),this.setAsMemoized=i,this.sourceIterator=t}next(){if(this.linkedList.size()>this.index++)return this.linkedListIterator.next();const t=this.sourceIterator.next();return this.setAsMemoized(t)||this.linkedList.addLast(t.value),t}}class Q{constructor(t){n(this,"memoizedSourceIterator");this.memoizedSourceIterator=t[Symbol.iterator]()}next(){return this.memoizedSourceIterator.next()}}function L(e,t){const r=e[Symbol.iterator]();let i=r.next(),o=i.value,u=null;for(t==null?u=(s,a)=>s<a?-1:s===a?0:1:b(t)?u=t:Array.isArray(t)?u=(s,a)=>{let f=0;for(const d of t)if(f=s[d]<a[d]?-1:s[d]===a[d]?0:1,f!==0)break;return f}:u=(s,a)=>s[t]<a[t]?-1:s[t]===a[t]?0:1,i=r.next();i.done!==!0;i=r.next()){const s=u(o,i.value);o=s<0||s===0?o:i.value}return o==null?null:o}function k(e,t,r,i){const o=t==null||t===!0||t===!1?e:t,u=t==null||t===!0||t===!1?0:e,s=u<o,a=r!==!0&&r!==!1&&r!=null&&r!==0?r:s?1:-1,f=s&&a<0||!s&&a>0?-1*a:a,d=Math.ceil(Math.abs(o-u)/Math.abs(f)),C=!!(t===!0||r===!0||i!=null&&i),y=C?d*f+u:u;return u===o?new _(y,0,0):C?new Y(y,d,f):new U(y,d,f)}class U{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t,this.length=r,this.step=i}[Symbol.iterator](){return new X(this.initialValue,this.length,this.step)}}class X{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){const t=this.value;return this.value+=this.step,this.length--?m(!1,t):h()}}class Y{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t-i,this.length=r,this.step=i}[Symbol.iterator](){return new Z(this.initialValue,this.length,this.step)}}class Z{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){const t=this.value;return this.value-=this.step,this.length--?m(!1,t):h()}}class _{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t,this.length=r,this.step=i}[Symbol.iterator](){return new q(this.initialValue,this.length,this.step)}}class q{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){return h()}}function A(e,t,r){if(!b(r))throw'"reducer" function must be provided';const i=e[Symbol.iterator]();let o=t,u=0;for(let s=i.next();s.done!==!0;s=i.next())o=r(o,s.value,u),u++;return o}function T(e,t){if(t<0)throw'"count" parameter must be greater or equal then 0';return new W(e,t)}class W{constructor(t,r){n(this,"value");n(this,"count");this.value=t,this.count=r}[Symbol.iterator](){return new tt(this.value,this.count)}}class tt{constructor(t,r){n(this,"leftToRepeat",0);n(this,"value");n(this,"count");n(this,"internalNext",()=>this.leftToRepeat--?m(!1,this.value):(this.internalNext=()=>h(),h()));this.value=t,this.count=r,this.leftToRepeat=r,r===0&&(this.internalNext=()=>h())}next(){return this.internalNext()}return(t){return this.internalNext=()=>h(),h(t)}}function V(e,t){const r=e[Symbol.iterator]();let i=0;for(let o=r.next();o.done!==!0;o=r.next())if(t(o.value,i++))return!0;return!1}function F(e,t){return new et(e,t)}class et{constructor(t,r){n(this,"tapper");n(this,"source");this.source=t,this.tapper=r}[Symbol.iterator](){return new rt(this.source,this.tapper)}}class rt{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"tapper");n(this,"innerNext",()=>{const t=this.sourceIterator.next();return t.done!==!0?(this.tapper(t.value,this.index++),t):(this.innerNext=h,h())});this.sourceIterator=t[Symbol.iterator](),this.tapper=r}next(){return this.innerNext()}return(t){return this.innerNext=h,h(t)}}function E(e,t){return new nt(e,t)}class nt{constructor(t,r){n(this,"tapper");n(this,"source");this.source=t,this.tapper=r}[Symbol.iterator](){return this.tapper(this.source,0),this.source[Symbol.iterator]()}}const it=Object.freeze(Object.defineProperty({__proto__:null,collectToArray:c,empty:S,filter:w,map:v,materialize:g,max:M,memoize:N,min:L,range:k,reduce:A,repeat:T,some:V,tap:F,tapChain:E},Symbol.toStringTag,{value:"Module"}));class p{constructor(t){n(this,"iterable");this.iterable=t}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return Array.from(this.iterable)}filter(t){return new p(w(this.iterable,t))}map(t){return new p(v(this.iterable,t))}materialize(){return new p(g(this.iterable))}max(t){return M(this.iterable,t)}memoize(){return new p(N(this.iterable))}min(t){return L(this.iterable,t)}reduce(t,r){return A(this.iterable,t,r)}some(t){return V(this.iterable,t)}tap(t){return new p(F(this.iterable,t))}tapChain(t){return new p(E(this.iterable,t))}tapChainCreation(t){return t(this),this}}function st(){return x(S())}function x(e){return new p(e)}function ot(e,t,r,i){return x(k(e,t,r,i))}function at(e,t){return x(T(e,t))}l.Functions=it,l.IterableLinqWrapper=p,l.empty=st,l.from=x,l.fromRange=ot,l.repeat=at,Object.defineProperties(l,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})});
+(function(h,c){typeof exports=="object"&&typeof module<"u"?c(exports):typeof define=="function"&&define.amd?define(["exports"],c):(h=typeof globalThis<"u"?globalThis:h||self,c(h["interable-linq-utility"]={}))})(this,function(h){"use strict";var wt=Object.defineProperty;var vt=(h,c,p)=>c in h?wt(h,c,{enumerable:!0,configurable:!0,writable:!0,value:p}):h[c]=p;var n=(h,c,p)=>(vt(h,typeof c!="symbol"?c+"":c,p),p);function c(e){if(e==null)throw'The source "iterable" must be provided';return Array.from(e)}function p(e,t){return{done:e,value:t}}function D(e){return{done:!1,value:e}}function u(e){return{done:!0,value:e}}function yt(e){return e}function f(e){return typeof e=="function"}function I(){return new U}class U{[Symbol.iterator](){return new G}}class G{next(){return u()}return(t){return u(t)}}function S(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"predicate" function must be provided';return new H(e,t)}class H{constructor(t,r){n(this,"predicate");n(this,"source");this.source=t,this.predicate=r}[Symbol.iterator](){return new J(this.source,this.predicate)}}class J{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"predicate");n(this,"internalNext",()=>{for(;;){const t=this.sourceIterator.next();if(t.done===!0||this.predicate(t.value,this.index++))return t}});this.sourceIterator=t[Symbol.iterator](),this.predicate=r}next(){return this.internalNext()}return(t){return this.internalNext=u,u(t)}}function N(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"mapper" function must be provided';return new K(e,t)}class K{constructor(t,r){n(this,"mapper");n(this,"source");this.source=t,this.mapper=r}[Symbol.iterator](){return new Q(this.source,this.mapper)}}class Q{constructor(t,r){n(this,"index",0);n(this,"mapper");n(this,"sourceIterator");n(this,"fmIterator");n(this,"sourceNext",()=>{const t=this.sourceIterator.next();if(t.done!==!0){const r=this.mapper(t.value,this.index++);return this.fmIterator=r[Symbol.iterator](),this.internalNext=this.fmNext,this.internalNext()}return this.internalNext=u,this.internalNext()});n(this,"fmNext",()=>{const t=this.fmIterator.next();return t.done!==!0?D(t.value):(this.internalNext=this.sourceNext,this.internalNext())});n(this,"internalNext",this.sourceNext);this.sourceIterator=t[Symbol.iterator](),this.mapper=r}next(){return this.internalNext()}return(t){return this.internalNext=u,u(t)}}class g{}const z=new g;Object.freeze(z);function w(){return z}const X=Object.freeze(Object.defineProperty({__proto__:null,Unit:g,unit:w},Symbol.toStringTag,{value:"Module"}));function M(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"action" function must be provided';const r=e[Symbol.iterator]();for(let i=r.next(),s=0;i.done!==!0;i=r.next(),s++)t(i.value,s);return w()}async function T(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"action" function must be provided';const r=[],i=e[Symbol.iterator]();for(let s=i.next(),a=0;s.done!==!0;s=i.next(),a++)r.push(t(s.value,a));return await Promise.all(r),w()}function R(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"mapper" function must be provided';return new Y(e,t)}class Y{constructor(t,r){n(this,"mapper");n(this,"source");this.source=t,this.mapper=r}[Symbol.iterator](){return new Z(this.source,this.mapper)}}class Z{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"mapper");n(this,"internalNext",()=>{const t=this.sourceIterator.next();return t.done!==!0?p(!1,this.mapper(t.value,this.index++)):(this.internalNext=u,this.internalNext())});this.sourceIterator=t[Symbol.iterator](),this.mapper=r}next(){return this.internalNext()}return(t){return this.internalNext=u,u(t)}}function q(e){const t=e[Symbol.iterator](),r=new v;for(let i=t.next();i.done!==!0;i=t.next())r.addLast(i.value);return r}class v{constructor(){n(this,"internalSize",0);n(this,"head",null);n(this,"tail",null);n(this,"internalAddFirst",t=>{const r={data:t,nextNode:null};return this.head=r,this.tail=r,this.internalSize++,this.internalAddFirst=i=>{const s={data:i,nextNode:null};return s.nextNode=this.head,this.head=s,this.internalSize++,this},this});n(this,"internalAddLast",t=>{const r={data:t,nextNode:null};return this.head=r,this.tail=r,this.internalSize++,this.internalAddLast=i=>{const s={data:i,nextNode:null};return this.tail.nextNode=s,this.tail=s,this.internalSize++,this},this})}[Symbol.iterator](){return new W(this.head)}addFirst(t){return this.internalAddFirst(t)}addLast(t){return this.internalAddLast(t)}size(){return this.internalSize}}class W{constructor(t=null){n(this,"current",null);this.current=t}next(){const t=this.current;return t===null?u():(this.current=t.nextNode,p(!1,t.data))}}function A(e){return e instanceof k?e:new k(e)}class k{constructor(t){n(this,"source");this.source=q(t)}[Symbol.iterator](){return new tt(this.source)}}class tt{constructor(t){n(this,"sourceIterator");this.sourceIterator=t[Symbol.iterator]()}next(){return this.sourceIterator.next()}}function L(e,t){if(e==null)throw'The source "iterable" must be provided';const r=e[Symbol.iterator]();let i=r.next(),s=i.value,a=null;for(t==null?a=(o,l)=>o<l?-1:o===l?0:1:f(t)?a=t:Array.isArray(t)?a=(o,l)=>{let m=0;for(const d of t)if(m=o[d]<l[d]?-1:o[d]===l[d]?0:1,m!==0)break;return m}:a=(o,l)=>o[t]<l[t]?-1:o[t]===l[t]?0:1,i=r.next();i.done!==!0;i=r.next()){const o=a(s,i.value);s=o>0||o===0?s:i.value}return s==null?null:s}function F(e){return e instanceof E?e:new E(e)}class E{constructor(t){n(this,"isMemoized",!1);n(this,"sourceIterator");n(this,"linkedList",new v);n(this,"source");this.source=t,this.sourceIterator=t[Symbol.iterator](),t instanceof v&&(this.linkedList=t,this.isMemoized=!0)}[Symbol.iterator](){return this.isMemoized?new rt(this.linkedList):new et(this.sourceIterator,this.linkedList,t=>this.isMemoized=t.done===!0)}}class et{constructor(t,r,i){n(this,"index",0);n(this,"linkedList");n(this,"linkedListIterator");n(this,"setAsMemoized");n(this,"sourceIterator");this.linkedList=r,this.linkedListIterator=r[Symbol.iterator](),this.setAsMemoized=i,this.sourceIterator=t}next(){if(this.linkedList.size()>this.index++)return this.linkedListIterator.next();const t=this.sourceIterator.next();return this.setAsMemoized(t)||this.linkedList.addLast(t.value),t}}class rt{constructor(t){n(this,"memoizedSourceIterator");this.memoizedSourceIterator=t[Symbol.iterator]()}next(){return this.memoizedSourceIterator.next()}}function V(e,t){if(e==null)throw'The source "iterable" must be provided';const r=e[Symbol.iterator]();let i=r.next(),s=i.value,a=null;for(t==null?a=(o,l)=>o<l?-1:o===l?0:1:f(t)?a=t:Array.isArray(t)?a=(o,l)=>{let m=0;for(const d of t)if(m=o[d]<l[d]?-1:o[d]===l[d]?0:1,m!==0)break;return m}:a=(o,l)=>o[t]<l[t]?-1:o[t]===l[t]?0:1,i=r.next();i.done!==!0;i=r.next()){const o=a(s,i.value);s=o<0||o===0?s:i.value}return s==null?null:s}function j(e,t,r,i){const s=t==null||t===!0||t===!1?e:t,a=t==null||t===!0||t===!1?0:e,o=a<s,l=r!==!0&&r!==!1&&r!=null&&r!==0?r:o?1:-1,m=o&&l<0||!o&&l>0?-1*l:l,d=Math.ceil(Math.abs(s-a)/Math.abs(m)),B=!!(t===!0||r===!0||i!=null&&i),y=B?d*m+a:a;return a===s?new ut(y,0,0):B?new st(y,d,m):new nt(y,d,m)}class nt{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t,this.length=r,this.step=i}[Symbol.iterator](){return new it(this.initialValue,this.length,this.step)}}class it{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){const t=this.value;return this.value+=this.step,this.length--?p(!1,t):u()}}class st{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t-i,this.length=r,this.step=i}[Symbol.iterator](){return new ot(this.initialValue,this.length,this.step)}}class ot{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){const t=this.value;return this.value-=this.step,this.length--?p(!1,t):u()}}class ut{constructor(t,r,i){n(this,"initialValue");n(this,"length");n(this,"step");this.initialValue=t,this.length=r,this.step=i}[Symbol.iterator](){return new at(this.initialValue,this.length,this.step)}}class at{constructor(t,r,i){n(this,"value");n(this,"length");n(this,"step");this.value=t,this.length=r,this.step=i}next(){return u()}}function O(e,t,r){if(e==null)throw'The source "iterable" must be provided';if(!f(r))throw'"reducer" function must be provided';const i=e[Symbol.iterator]();let s=t,a=0;for(let o=i.next();o.done!==!0;o=i.next())s=r(s,o.value,a),a++;return s}function C(e,t){if(t<0)throw'"count" parameter must be greater or equal then 0';return new lt(e,t)}class lt{constructor(t,r){n(this,"value");n(this,"count");this.value=t,this.count=r}[Symbol.iterator](){return new ht(this.value,this.count)}}class ht{constructor(t,r){n(this,"leftToRepeat",0);n(this,"value");n(this,"count");n(this,"internalNext",()=>this.leftToRepeat--?p(!1,this.value):(this.internalNext=u,u()));this.value=t,this.count=r,this.leftToRepeat=r,r===0&&(this.internalNext=u)}next(){return this.internalNext()}return(t){return this.internalNext=u,u(t)}}function P(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"predicate" function must be provided';const r=e[Symbol.iterator]();let i=0;for(let s=r.next();s.done!==!0;s=r.next())if(t(s.value,i++))return!0;return!1}function $(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"tapper" function must be provided';return new ct(e,t)}class ct{constructor(t,r){n(this,"tapper");n(this,"source");this.source=t,this.tapper=r}[Symbol.iterator](){return new dt(this.source,this.tapper)}}class dt{constructor(t,r){n(this,"index",0);n(this,"sourceIterator");n(this,"tapper");n(this,"internalNext",()=>{const t=this.sourceIterator.next();return t.done!==!0?(this.tapper(t.value,this.index++),t):(this.internalNext=u,u())});this.sourceIterator=t[Symbol.iterator](),this.tapper=r}next(){return this.internalNext()}return(t){return this.internalNext=u,u(t)}}function _(e,t){if(e==null)throw'The source "iterable" must be provided';if(!f(t))throw'"tapper" function must be provided';return new ft(e,t)}class ft{constructor(t,r){n(this,"tapper");n(this,"source");this.source=t,this.tapper=r}[Symbol.iterator](){return this.tapper(this.source,0),this.source[Symbol.iterator]()}}const mt=Object.freeze(Object.defineProperty({__proto__:null,collectToArray:c,empty:I,filter:S,flatMap:N,forEach:M,forEachAsync:T,map:R,materialize:A,max:L,memoize:F,min:V,range:j,reduce:O,repeat:C,some:P,tap:$,tapChain:_},Symbol.toStringTag,{value:"Module"}));class b{constructor(t){n(this,"iterable");this.iterable=t}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return Array.from(this.iterable)}filter(t){return new b(S(this.iterable,t))}flatMap(t){return new b(N(this.iterable,t))}forEach(t){return M(this.iterable,t)}forEachAsync(t){return T(this.iterable,t)}map(t){return new b(R(this.iterable,t))}materialize(){return new b(A(this.iterable))}max(t){return L(this.iterable,t)}memoize(){return new b(F(this.iterable))}min(t){return V(this.iterable,t)}reduce(t,r){return O(this.iterable,t,r)}some(t){return P(this.iterable,t)}tap(t){return new b($(this.iterable,t))}tapChain(t){return new b(_(this.iterable,t))}tapChainCreation(t){if(!f(t))throw'"tapper" function must be provided';return t(this),this}}function pt(){return x(I())}function x(e){if(e==null)throw'The source "iterable" must be provided';return new b(e)}function bt(e,t,r,i){return x(j(e,t,r,i))}function xt(e,t){return x(C(e,t))}h.Functions=mt,h.IterableLinqWrapper=b,h.Types=X,h.empty=pt,h.from=x,h.fromRange=bt,h.repeat=xt,Object.defineProperties(h,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})});

package/dist/linqIterable.d.ts

@@ -1,8 +1,11 @@
-import { Comparer, Mapper, Reducer, Predicate, Tapper } from '@/types';
+import { Action, AsyncAction, Comparer, Mapper, Reducer, Predicate, Tapper, Unit } from '@/types';
 export interface IIterableLinq<T> {
     [Symbol.iterator](): Iterator<T, any, undefined>;
     collectToArray(): T[];
     filter(predicate: Predicate<T>): IIterableLinq<T>;
+    flatMap<R>(mapper: Mapper<T, Iterable<R>>): IIterableLinq<R>;
+    forEach(action: Action<T>): Unit;
+    forEachAsync(action: AsyncAction<T>): Promise<Unit>;
     map<R>(mapper: Mapper<T, R>): IIterableLinq<R>;
     materialize(): IIterableLinq<T>;
     max(comparer?: Comparer<T>): T | null | undefined;
@@ -25,6 +28,9 @@ export declare class IterableLinqWrapper<T> implements IIterableLinq<T> {
     private iterable;
     collectToArray(): T[];
     filter(predicate: Predicate<T>): IIterableLinq<T>;
+    flatMap<R>(mapper: Mapper<T, Iterable<R>>): IIterableLinq<R>;
+    forEach(action: Action<T>): Unit;
+    forEachAsync(action: AsyncAction<T>): Promise<Unit>;
     map<R>(mapper: Mapper<T, R>): IIterableLinq<R>;
     materialize(): IIterableLinq<T>;
     max(comparer?: Comparer<T>): T | null | undefined;

package/dist/types/action.d.ts

@@ -0,0 +1,3 @@
+import { Unit } from "./unit";
+export declare type Action<T> = (value: T, index: number) => Unit;
+export declare type AsyncAction<T> = (value: T, index: number) => Promise<Unit>;

package/dist/types/index.d.ts

@@ -1,3 +1,4 @@
+export * from './action';
 export * from './comparer';
 export * from './mapper';
 export * from './predicate';

package/dist/utils/iteratorResults.d.ts

@@ -1,3 +1,4 @@
 export declare function getIteratorResult<T>(done: boolean, value?: T): IteratorResult<T>;
+export declare function getContinueIteratorResult<T>(value: T): IteratorResult<T>;
 export declare function getDoneIteratorResult<T>(value?: T): IteratorResult<T>;
 export declare function getFlatIteratorResult<T>(result: IteratorResult<T>): IteratorResult<T>;

package/dist/utils/utils.d.ts

@@ -45,4 +45,12 @@ export declare function isFunction(value?: any): value is (...args: any[]) => an
  * isString(1)
  * // => false
  */
-export declare function isString(value?: any): value is string;
+/**
+ * Gets the `toStringTag` of `value`.
+ *
+ * From [LoDash internal getTag](https://github.com/lodash/lodash/blob/master/.internal/getTag.js)
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @returns {string} Returns the `toStringTag`.
+ */

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "iterable-linq-utility",
-  "version": "0.0.10",
+  "version": "0.0.11",
   "description": "An Iterable mutation utility inspired by .net Linq and Javascript Array interface",
   "type": "module",
   "main": "./dist/interable-linq-utility.umd.cjs",