iterable-linq-utility 0.0.9 → 0.0.11

package/dist/functions/collectToArray.d.ts

@@ -0,0 +1 @@
+export declare function collectToArray<T>(iterable: Iterable<T>): T[];

package/dist/functions/empty.d.ts

@@ -0,0 +1 @@
+export declare function empty<T>(): Iterable<T>;

package/dist/functions/filter.d.ts

@@ -1,2 +1,9 @@
 import { Predicate } from "@/types";
+/**
+ *
+ * @operation `Transformation`
+ * @param iterable
+ * @param predicate
+ * @returns
+ */
 export declare function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;

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

@@ -1,8 +1,23 @@
-export * from './filter';
-export * from './map';
-export * from './materialize';
-export * from './max';
-export * from './memoize';
-export * from './min';
-export * from './range';
-export * from './some';
+import { collectToArray } from './collectToArray';
+export { collectToArray };
+import { empty } from './empty';
+export { empty };
+import { filter } from './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';
+import { memoize } from './memoize';
+import { min } from './min';
+export { map, materialize, max, memoize, min };
+import { range } from './range';
+import { reduce } from './reduce';
+import { repeat } from './repeat';
+export { range, reduce, repeat };
+import { some } from './some';
+export { some };
+import { tap } from './tap';
+import { tapChain } from './tapChain';
+export { tap, tapChain };

package/dist/functions/map.d.ts

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

package/dist/functions/materialize.d.ts

@@ -1 +1,7 @@
+/**
+ *
+ * @operation `Action`
+ * @param iterable
+ * @returns
+ */
 export declare function materialize<T>(iterable: Iterable<T>): Iterable<T>;

package/dist/functions/max.d.ts

@@ -1 +1,9 @@
-export declare function max<T>(iterable: Iterable<T>, comparer?: (a: T, b: T, index: number) => boolean): T | null | undefined;
+import type { Comparer } from "@/types";
+/**
+ *
+ * @operation `Action`
+ * @param iterable
+ * @param comparer
+ * @returns
+ */
+export declare function max<T>(iterable: Iterable<T>, comparer?: Comparer<T>): T | null | undefined;

package/dist/functions/memoize.d.ts

@@ -1 +1,7 @@
+/**
+ *
+ * @operation `Transformation`
+ * @param iterable
+ * @returns
+ */
 export declare function memoize<T>(iterable: Iterable<T>): Iterable<T>;

package/dist/functions/min.d.ts

@@ -1,2 +1,9 @@
 import type { Comparer } from "@/types";
+/**
+ *
+ * @operation `Action`
+ * @param iterable
+ * @param comparer
+ * @returns
+ */
 export declare function min<T>(iterable: Iterable<T>, comparer?: Comparer<T>): T | null | undefined;

package/dist/functions/range.d.ts

@@ -4,3 +4,4 @@ export declare function range(start: number, end: number): Iterable<number>;
 export declare function range(start: number, end: number, step: number): Iterable<number>;
 export declare function range(start: number, end: number, reverse: boolean): Iterable<number>;
 export declare function range(start: number, end: number, step: number, reverse: boolean): Iterable<number>;
+export declare function range(start: number, end?: number | boolean, step?: number | boolean, reverse?: boolean): Iterable<number>;

package/dist/functions/reduce.d.ts

@@ -0,0 +1,10 @@
+import { Reducer } from "@/types";
+/**
+ *
+ * @operation `Action`
+ * @param iterable
+ * @param neutralElement
+ * @param reducer
+ * @returns
+ */
+export declare function reduce<T, R>(iterable: Iterable<T>, neutralElement: R, reducer: Reducer<T, R>): R;

package/dist/functions/repeat.d.ts

@@ -0,0 +1 @@
+export declare function repeat<T>(value: T, count: number): Iterable<T>;

package/dist/functions/some.d.ts

@@ -1,2 +1,9 @@
 import { Predicate } from "@/types";
+/**
+ *
+ * @operation `Action`
+ * @param iterable
+ * @param predicate
+ * @returns
+ */
 export declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T>): boolean;

package/dist/functions/tap.d.ts

@@ -0,0 +1,9 @@
+import { Tapper } from "@/types";
+/**
+ *
+ * @operation `Tap`
+ * @param iterable
+ * @param tapper
+ * @returns
+ */
+export declare function tap<T>(iterable: Iterable<T>, tapper: Tapper<T>): Iterable<T>;

package/dist/functions/tapChain.d.ts

@@ -0,0 +1,9 @@
+import { Tapper } from "@/types";
+/**
+ *
+ * @operation `Tap`
+ * @param iterable
+ * @param tapper
+ * @returns
+ */
+export declare function tapChain<T>(iterable: Iterable<T>, tapper: Tapper<Iterable<T>>): Iterable<T>;

package/dist/genericCollections/index.d.ts

@@ -1 +1,2 @@
-export * from './linkedList';
+import * as LinkedListCollection from './linkedList';
+export { LinkedListCollection };

package/dist/genericCollections/linkedList.d.ts

@@ -1,18 +1,20 @@
 export declare function from<T>(iterable: Iterable<T>): LinkedList<T>;
-export declare class LinkedListIterator<T> implements Iterator<T> {
-    private current;
-    constructor(current?: IListNode<T> | null);
-    next(): IteratorResult<T, any>;
-}
 export declare class LinkedList<T> implements Iterable<T> {
     private internalSize;
     private head;
     private tail;
     [Symbol.iterator](): Iterator<T>;
+    private internalAddFirst;
     addFirst(value: T): this;
+    private internalAddLast;
     addLast(value: T): this;
     size(): number;
 }
+export declare class LinkedListIterator<T> implements Iterator<T> {
+    private current;
+    constructor(current?: IListNode<T> | null);
+    next(): IteratorResult<T, any>;
+}
 interface IListNode<T> {
     data: T;
     nextNode: IListNode<T> | null;

package/dist/index.d.ts

@@ -1,3 +1,14 @@
-import { LinqIterableWrapper, type ILinqIterable } from "./linqIterable";
-export declare function from<T>(iterable: Iterable<T>): ILinqIterable<T>;
-export { ILinqIterable, LinqIterableWrapper };
+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>;
+export declare function fromRange(end: number, reverse?: boolean): IIterableLinq<number>;
+export declare function fromRange(start: number, end: number): IIterableLinq<number>;
+export declare function fromRange(start: number, end: number, step: number): IIterableLinq<number>;
+export declare function fromRange(start: number, end: number, reverse: boolean): IIterableLinq<number>;
+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, Types };

package/dist/interable-linq-utility.js

@@ -1,161 +1,266 @@
-var w = Object.defineProperty;
-var b = (e, t, r) => t in e ? w(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var n = (e, t, r) => (b(e, typeof t != "symbol" ? t + "" : t, r), r);
-function y(e, t) {
-  return (r, i) => t(e(r, i), i);
+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 p(e, t) {
-  return (r, i) => e(r, i) && t(r, i);
-}
-function z(e, t) {
+function m(e, t) {
   return {
     done: e,
     value: t
   };
 }
-function S() {
-  return { done: !0, value: void 0 };
+function _(e) {
+  return { done: !1, value: e };
 }
-function k(e) {
+function l(e) {
+  return { done: !0, value: e };
+}
+function d(e) {
   return typeof e == "function";
 }
-function M(e, t) {
-  return new f(e, t);
+function S() {
+  return new G();
+}
+class G {
+  [Symbol.iterator]() {
+    return new H();
+  }
 }
-class f {
+class H {
+  next() {
+    return l();
+  }
+  return(t) {
+    return l(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 J(e, t);
+}
+class J {
   constructor(t, r) {
     n(this, "predicate");
     n(this, "source");
-    let i = r, s = t;
-    if (s instanceof f) {
-      const u = s.predicate;
-      s = s.source, i = p(u, i);
-    }
-    this.source = s, this.predicate = i;
+    this.source = t, this.predicate = r;
   }
   [Symbol.iterator]() {
-    return new L(this.source, this.predicate);
+    return new K(this.source, this.predicate);
   }
 }
-class L {
+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 (; ; ) {
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(t);
+  }
+}
+function g(e, t) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  if (!d(t))
+    throw '"mapper" function must be provided';
+  return new Q(e, t);
+}
+class Q {
+  constructor(t, r) {
+    n(this, "mapper");
+    n(this, "source");
+    this.source = t, this.mapper = r;
+  }
+  [Symbol.iterator]() {
+    return new X(this.source, this.mapper);
+  }
+}
+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 || this.predicate(t.value, this.index++))
-        return t;
-    }
+      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 v(e, t) {
-  return new m(e, t);
+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 m {
+class Y {
   constructor(t, r) {
     n(this, "mapper");
     n(this, "source");
-    let i = r, s = t;
-    if (s instanceof m) {
-      const u = s.mapper;
-      s = s.source, i = y(u, i);
-    }
-    this.source = t, this.mapper = i;
+    this.source = t, this.mapper = r;
   }
   [Symbol.iterator]() {
-    return new N(this.source, this.mapper);
+    return new Z(this.source, this.mapper);
   }
 }
-class N {
+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 ? z(!1, this.mapper(t.value, this.index++)) : S();
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(t);
   }
 }
-function A(e) {
-  const t = e[Symbol.iterator](), r = new h();
+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);
   return r;
 }
-class F {
-  constructor(t = null) {
-    n(this, "current", null);
-    this.current = t;
-  }
-  next() {
-    const t = this.current;
-    return t === null ? S() : (this.current = t.nextNode, z(!1, t.data));
-  }
-}
-class h {
+class x {
   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 F(this.head);
+    return new W(this.head);
   }
   addFirst(t) {
-    const r = {
-      data: t,
-      nextNode: null
-    };
-    switch (this.internalSize) {
-      case 0:
-        this.head = r, this.tail = r;
-        break;
-      default:
-        r.nextNode = this.head, this.head = r;
-    }
-    return this.internalSize++, this;
+    return this.internalAddFirst(t);
   }
   addLast(t) {
-    const r = {
-      data: t,
-      nextNode: null
-    };
-    switch (this.internalSize) {
-      case 0:
-        this.head = r, this.tail = r;
-        break;
-      default:
-        this.tail.nextNode = r, this.tail = r;
-    }
-    return this.internalSize++, this;
+    return this.internalAddLast(t);
   }
   size() {
     return this.internalSize;
   }
 }
-function g(e) {
+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, m(!1, t.data));
+  }
+}
+function k(e) {
   return e instanceof I ? e : new I(e);
 }
 class I {
   constructor(t) {
     n(this, "source");
-    if (t instanceof h) {
-      this.source = t;
-      return;
-    }
-    this.source = A(t);
+    this.source = q(t);
   }
   [Symbol.iterator]() {
-    return new P(this.source);
+    return new tt(this.source);
   }
 }
-class P {
+class tt {
   constructor(t) {
     n(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
@@ -164,22 +269,39 @@ class P {
     return this.sourceIterator.next();
   }
 }
-function R(e) {
-  return e instanceof x ? e : new x(e);
+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, 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 = o[h] < a[h] ? -1 : o[h] === a[h] ? 0 : 1, c !== 0)
+        break;
+    return c;
+  } : 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 s == null ? null : s;
 }
-class x {
+function F(e) {
+  return e instanceof y ? e : new y(e);
+}
+class y {
   constructor(t) {
     n(this, "isMemoized", !1);
     n(this, "sourceIterator");
-    n(this, "linkedList", new h());
+    n(this, "linkedList", new x());
     n(this, "source");
-    this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof h && (this.linkedList = t, this.isMemoized = !0);
+    this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof x && (this.linkedList = t, this.isMemoized = !0);
   }
   [Symbol.iterator]() {
-    return this.isMemoized ? new T(this.linkedList) : new D(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 D {
+class et {
   constructor(t, r, i) {
     n(this, "index", 0);
     n(this, "linkedList");
@@ -195,7 +317,7 @@ class D {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class T {
+class rt {
   constructor(t) {
     n(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
@@ -204,22 +326,141 @@ class T {
     return this.memoizedSourceIterator.next();
   }
 }
-function $(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(), s = i.value, u = null;
-  for (t == null ? u = (o, a) => o < a ? -1 : o === a ? 0 : 1 : k(t) ? u = t : Array.isArray(t) ? u = (o, a) => {
-    let d = 0;
-    for (const l of t)
-      if (d = o[l] < a[l] ? -1 : o[l] === a[l] ? 0 : 1, d !== 0)
+  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 = o[h] < a[h] ? -1 : o[h] === a[h] ? 0 : 1, c !== 0)
         break;
-    return d;
+    return c;
   } : 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 s == null ? null : s;
 }
-function j(e, t) {
+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 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-- ? m(!1, t) : l();
+  }
+}
+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-- ? m(!1, t) : l();
+  }
+}
+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 l();
+  }
+}
+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 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 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-- ? 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);
+  }
+}
+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 s = r.next(); s.done !== !0; s = r.next())
@@ -227,7 +468,79 @@ function j(e, t) {
       return !0;
   return !1;
 }
-class c {
+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 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 = l, l());
+    });
+    this.sourceIterator = t[Symbol.iterator](), this.tapper = r;
+  }
+  next() {
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = l, l(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 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 xt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  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 f {
   constructor(t) {
     n(this, "iterable");
     this.iterable = t;
@@ -236,31 +549,73 @@ class c {
     return this.iterable[Symbol.iterator]();
   }
   collectToArray() {
-    return [...this.iterable];
+    return Array.from(this.iterable);
   }
   filter(t) {
-    return new c(M(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 c(v(this.iterable, t));
+    return new f(R(this.iterable, t));
   }
   materialize() {
-    return new c(g(this.iterable));
+    return new f(k(this.iterable));
+  }
+  max(t) {
+    return L(this.iterable, t);
   }
   memoize() {
-    return new c(R(this.iterable));
+    return new f(F(this.iterable));
   }
   min(t) {
-    return $(this.iterable, t);
+    return E(this.iterable, t);
+  }
+  reduce(t, r) {
+    return j(this.iterable, t, r);
   }
   some(t) {
-    return j(this.iterable, t);
+    return O(this.iterable, t);
+  }
+  tap(t) {
+    return new f(P(this.iterable, t));
+  }
+  tapChain(t) {
+    return new f($(this.iterable, t));
   }
+  tapChainCreation(t) {
+    if (!d(t))
+      throw '"tapper" function must be provided';
+    return t(this), this;
+  }
+}
+function bt() {
+  return w(S());
+}
+function w(e) {
+  if (e == null)
+    throw 'The source "iterable" must be provided';
+  return new f(e);
+}
+function wt(e, t, r, i) {
+  return w(V(e, t, r, i));
 }
-function C(e) {
-  return new c(e);
+function vt(e, t) {
+  return w(C(e, t));
 }
 export {
-  c as LinqIterableWrapper,
-  C as from
+  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(o,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(o=typeof globalThis<"u"?globalThis:o||self,u(o["interable-linq-utility"]={}))})(this,function(o){"use strict";var $=Object.defineProperty;var B=(o,u,d)=>u in o?$(o,u,{enumerable:!0,configurable:!0,writable:!0,value:d}):o[u]=d;var n=(o,u,d)=>(B(o,typeof u!="symbol"?u+"":u,d),d);function u(e,t){return(r,i)=>t(e(r,i),i)}function d(e,t){return(r,i)=>e(r,i)&&t(r,i)}function S(e,t){return{done:e,value:t}}function b(){return{done:!0,value:void 0}}function C(e){return e}function w(e){return typeof e=="function"}function M(e,t){return new I(e,t)}class I{constructor(t,r){n(this,"predicate");n(this,"source");let i=r,s=t;if(s instanceof I){const l=s.predicate;s=s.source,i=d(l,i)}this.source=s,this.predicate=i}[Symbol.iterator](){return new k(this.source,this.predicate)}}class k{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 L(e,t){return new x(e,t)}class x{constructor(t,r){n(this,"mapper");n(this,"source");let i=r,s=t;if(s instanceof x){const l=s.mapper;s=s.source,i=u(l,i)}this.source=t,this.mapper=i}[Symbol.iterator](){return new v(this.source,this.mapper)}}class v{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?S(!1,this.mapper(t.value,this.index++)):b()}}function N(e){const t=e[Symbol.iterator](),r=new f;for(let i=t.next();i.done!==!0;i=t.next())r.addLast(i.value);return r}class A{constructor(t=null){n(this,"current",null);this.current=t}next(){const t=this.current;return t===null?b():(this.current=t.nextNode,S(!1,t.data))}}class f{constructor(){n(this,"internalSize",0);n(this,"head",null);n(this,"tail",null)}[Symbol.iterator](){return new A(this.head)}addFirst(t){const r={data:t,nextNode:null};switch(this.internalSize){case 0:this.head=r,this.tail=r;break;default:r.nextNode=this.head,this.head=r}return this.internalSize++,this}addLast(t){const r={data:t,nextNode:null};switch(this.internalSize){case 0:this.head=r,this.tail=r;break;default:this.tail.nextNode=r,this.tail=r}return this.internalSize++,this}size(){return this.internalSize}}function g(e){return e instanceof p?e:new p(e)}class p{constructor(t){n(this,"source");if(t instanceof f){this.source=t;return}this.source=N(t)}[Symbol.iterator](){return new F(this.source)}}class F{constructor(t){n(this,"sourceIterator");this.sourceIterator=t[Symbol.iterator]()}next(){return this.sourceIterator.next()}}function P(e){return e instanceof y?e:new y(e)}class y{constructor(t){n(this,"isMemoized",!1);n(this,"sourceIterator");n(this,"linkedList",new f);n(this,"source");this.source=t,this.sourceIterator=t[Symbol.iterator](),t instanceof f&&(this.linkedList=t,this.isMemoized=!0)}[Symbol.iterator](){return this.isMemoized?new R(this.linkedList):new T(this.sourceIterator,this.linkedList,t=>this.isMemoized=t.done===!0)}}class T{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 R{constructor(t){n(this,"memoizedSourceIterator");this.memoizedSourceIterator=t[Symbol.iterator]()}next(){return this.memoizedSourceIterator.next()}}function j(e,t){const r=e[Symbol.iterator]();let i=r.next(),s=i.value,l=null;for(t==null?l=(a,c)=>a<c?-1:a===c?0:1:w(t)?l=t:Array.isArray(t)?l=(a,c)=>{let z=0;for(const m of t)if(z=a[m]<c[m]?-1:a[m]===c[m]?0:1,z!==0)break;return z}:l=(a,c)=>a[t]<c[t]?-1:a[t]===c[t]?0:1,i=r.next();i.done!==!0;i=r.next()){const a=l(s,i.value);s=a<0||a===0?s:i.value}return s==null?null:s}function D(e,t){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}class h{constructor(t){n(this,"iterable");this.iterable=t}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return[...this.iterable]}filter(t){return new h(M(this.iterable,t))}map(t){return new h(L(this.iterable,t))}materialize(){return new h(g(this.iterable))}memoize(){return new h(P(this.iterable))}min(t){return j(this.iterable,t)}some(t){return D(this.iterable,t)}}function O(e){return new h(e)}o.LinqIterableWrapper=h,o.from=O,Object.defineProperties(o,{__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,23 +1,44 @@
-import { Comparer, Mapper, Predicate } from '@/types';
-export interface ILinqIterable<T> {
+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>): ILinqIterable<T>;
-    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
-    materialize(): ILinqIterable<T>;
-    memoize(): ILinqIterable<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;
+    memoize(): IIterableLinq<T>;
     min(comparer?: Comparer<T>): T | null | undefined;
+    reduce<R>(neutralElement: R, reducer: Reducer<T, R>): R;
     some(predicate: Predicate<T>): boolean;
+    tap(tapper: Tapper<T>): IIterableLinq<T>;
+    tapChain(tapper: Tapper<Iterable<T>>): IIterableLinq<T>;
+    /**
+     *
+     * @operation `Tap`
+     * @param chainCreationTapper
+     */
+    tapChainCreation(chainCreationTapper: (iterableLinqWrapper: IIterableLinq<T>) => void): IIterableLinq<T>;
 }
-export declare class LinqIterableWrapper<T> implements ILinqIterable<T> {
+export declare class IterableLinqWrapper<T> implements IIterableLinq<T> {
     constructor(iterable: Iterable<T>);
     [Symbol.iterator](): Iterator<T, any, undefined>;
     private iterable;
     collectToArray(): T[];
-    filter(predicate: Predicate<T>): ILinqIterable<T>;
-    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
-    materialize(): ILinqIterable<T>;
-    memoize(): ILinqIterable<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;
+    memoize(): IIterableLinq<T>;
     min(comparer?: Comparer<T>): T | null | undefined;
+    reduce<R>(neutralElement: R, reducer: Reducer<T, R>): R;
     some(predicate: Predicate<T>): boolean;
+    tap(tapper: Tapper<T>): IIterableLinq<T>;
+    tapChain(tapper: Tapper<Iterable<T>>): IIterableLinq<T>;
+    tapChainCreation(chainCreationTapper: (iterableLinqWrapper: IIterableLinq<T>) => void): IIterableLinq<T>;
 }

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,7 @@
+export * from './action';
 export * from './comparer';
 export * from './mapper';
 export * from './predicate';
+export * from './reducer';
+export * from './tapper';
+export * from './unit';

package/dist/types/reducer.d.ts

@@ -0,0 +1 @@
+export declare type Reducer<T, R> = (acc: R, value: T, index: number) => R;

package/dist/types/tapper.d.ts

@@ -0,0 +1 @@
+export declare type Tapper<T> = (value: T, index: number) => void;

package/dist/types/unit.d.ts

@@ -0,0 +1,3 @@
+export declare class Unit {
+}
+export declare function unit(): Unit;

package/dist/utils/iteratorResults.d.ts

@@ -1,3 +1,4 @@
 export declare function getIteratorResult<T>(done: boolean, value?: T): IteratorResult<T>;
-export declare function getDoneIteratorResult<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

@@ -1,29 +1,3 @@
-export declare type BooleanComparePredicate<T> = (current: T, other: T) => boolean;
-/**
- *
- * @since 1.0.0
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is `null`, `undefined` or `NaN`, else false.
- * @example
- *
- * isNullOrUndefined(null)
- * // => true
- *
- * isNullOrUndefined(undefined)
- * // => true
- *
- * isNullOrUndefined()
- * // => true
- *
- * const myVariable = undefined
- * isNullOrUndefined(myVariable)
- * // => true
- *
- * isNullOrUndefined('')
- * // => false
- *
- */
-export declare function isNullOrUndefined(value?: any): value is null | undefined;
 /**
  * Checks if `value` is classified as a `Function` object.
  *
@@ -71,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.9",
+  "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",
@@ -29,17 +29,22 @@
     "url": "git+https://github.com/Amebus/iterable-linq-utility.git"
   },
   "author": "Amebus",
-  "license": "ISC",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/Amebus/iterable-linq-utility/issues"
   },
   "homepage": "https://github.com/Amebus/iterable-linq-utility#readme",
-  "keywords": ["linq", "itearable", "utility"],
+  "keywords": [
+    "linq",
+    "itearable",
+    "utility"
+  ],
   "devDependencies": {
-    "@rushstack/eslint-patch": "^1.1.4",
+    "@rushstack/eslint-patch": "1.1.4",
     "@types/node": "18.11.10",
     "@typescript-eslint/eslint-plugin": "5.36.2",
     "@typescript-eslint/parser": "5.36.2",
+    "@vitest/coverage-c8": "0.25.8",
     "@vitest/ui": "0.25.2",
     "eslint": "8.22.0",
     "eslint-plugin-import": "2.26.0",

package/dist/combiners/index.d.ts

@@ -1,2 +0,0 @@
-export * from './mapper';
-export * from './predicate';

package/dist/combiners/mapper.d.ts

@@ -1,2 +0,0 @@
-import { Mapper } from "../types";
-export declare function combineMappers<T, R, RR>(m1: Mapper<T, R>, m2: Mapper<R, RR>): Mapper<T, RR>;

package/dist/combiners/predicate.d.ts

@@ -1,2 +0,0 @@
-import { Predicate } from "../types";
-export declare function combinePredicates<T>(p1: Predicate<T>, p2: Predicate<T>): Predicate<T>;