iterable-linq-utility 0.0.8 → 0.0.10

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";
-export declare function filter<T>(iterable: Iterable<T>, predicate: typeof Predicate<T>): Iterable<T>;
+/**
+ *
+ * @operation `Transformation`
+ * @param iterable
+ * @param predicate
+ * @returns
+ */
+export declare function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;

package/dist/functions/index.d.ts

@@ -1,8 +1,21 @@
-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';
+export { filter };
+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";
-export declare function some<T>(iterable: Iterable<T>, predicate: typeof Predicate<T>): boolean;
+/**
+ *
+ * @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,13 @@
-import { type ILinqIterable } from "./linqIterable";
-export declare function from<T>(iterable: Iterable<T>): ILinqIterable<T>;
-export { ILinqIterable };
+import { IterableLinqWrapper, type IIterableLinq } from "./linqIterable";
+import * as Functions from '@/functions';
+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 };

package/dist/interable-linq-utility.js

@@ -1,47 +1,57 @@
-var b = Object.defineProperty;
-var y = (e, t, r) => t in e ? b(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var i = (e, t, r) => (y(e, typeof t != "symbol" ? t + "" : t, r), r);
-function p(e, t) {
-  return (r, n) => t(e(r, n), n);
+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) {
+  return Array.from(e);
 }
-function k(e, t) {
-  return (r, n) => e(r, n) && t(r, n);
-}
-function S(e, t) {
+function f(e, t) {
   return {
     done: e,
     value: t
   };
 }
-function w() {
-  return { done: !0, value: void 0 };
+function l(e) {
+  return { done: !0, value: e };
 }
-function M(e) {
+function m(e) {
   return typeof e == "function";
 }
-function L(e, t) {
-  return new m(e, t);
+function w() {
+  return new j();
+}
+class j {
+  [Symbol.iterator]() {
+    return new O();
+  }
 }
-class m {
+class O {
+  next() {
+    return l();
+  }
+  return(t) {
+    return l(t);
+  }
+}
+function v(e, t) {
+  if (!m(t))
+    throw '"predicate" function must be provided';
+  return new B(e, t);
+}
+class B {
   constructor(t, r) {
-    i(this, "predicate");
-    i(this, "source");
-    let n = r, s = t;
-    if (s instanceof m) {
-      const u = s.predicate;
-      s = s.source, n = k(u, n);
-    }
-    this.source = s, this.predicate = n;
+    n(this, "predicate");
+    n(this, "source");
+    this.source = t, this.predicate = r;
   }
   [Symbol.iterator]() {
-    return new v(this.source, this.predicate);
+    return new D(this.source, this.predicate);
   }
 }
-class v {
+class D {
   constructor(t, r) {
-    i(this, "index", 0);
-    i(this, "sourceIterator");
-    i(this, "predicate");
+    n(this, "index", 0);
+    n(this, "sourceIterator");
+    n(this, "predicate");
     this.sourceIterator = t[Symbol.iterator](), this.predicate = r;
   }
   next() {
@@ -52,141 +62,153 @@ class v {
     }
   }
 }
-function N(e, t) {
-  return new I(e, t);
+function g(e, t) {
+  if (!m(t))
+    throw '"mapper" function must be provided';
+  return new P(e, t);
 }
-class I {
+class P {
   constructor(t, r) {
-    i(this, "mapper");
-    i(this, "source");
-    let n = r, s = t;
-    if (s instanceof I) {
-      const u = s.mapper;
-      s = s.source, n = p(u, n);
-    }
-    this.source = t, this.mapper = n;
+    n(this, "mapper");
+    n(this, "source");
+    this.source = t, this.mapper = r;
   }
   [Symbol.iterator]() {
-    return new A(this.source, this.mapper);
+    return new G(this.source, this.mapper);
   }
 }
-class A {
+class G {
   constructor(t, r) {
-    i(this, "index", 0);
-    i(this, "sourceIterator");
-    i(this, "mapper");
+    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++)) : w();
+    return t.done !== !0 ? f(!1, this.mapper(t.value, this.index++)) : l();
   }
 }
-function F(e) {
-  const t = e[Symbol.iterator](), r = new d();
-  for (let n = t.next(); n.done !== !0; n = t.next())
-    r.addLast(n.value);
+function H(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 g {
-  constructor(t = null) {
-    i(this, "current", null);
-    this.current = t;
-  }
-  next() {
-    const t = this.current;
-    return t === null ? w() : (this.current = t.nextNode, S(!1, t.data));
-  }
-}
-class d {
+class x {
   constructor() {
-    i(this, "internalSize", 0);
-    i(this, "head", null);
-    i(this, "tail", null);
+    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 g(this.head);
+    return new J(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 P(e) {
-  return e instanceof x ? e : new x(e);
+class J {
+  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));
+  }
+}
+function z(e) {
+  return e instanceof y ? e : new y(e);
 }
-class x {
+class y {
   constructor(t) {
-    i(this, "source");
-    if (t instanceof d) {
-      this.source = t;
-      return;
-    }
-    this.source = F(t);
+    n(this, "source");
+    this.source = H(t);
   }
   [Symbol.iterator]() {
-    return new R(this.source);
+    return new K(this.source);
   }
 }
-class R {
+class K {
   constructor(t) {
-    i(this, "sourceIterator");
+    n(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.sourceIterator.next();
   }
 }
-function D(e) {
-  return e instanceof z ? e : new z(e);
+function N(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 : m(t) ? u = t : Array.isArray(t) ? u = (s, a) => {
+    let c = 0;
+    for (const h of t)
+      if (c = s[h] < a[h] ? -1 : s[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;
+  }
+  return o == null ? null : o;
+}
+function M(e) {
+  return e instanceof S ? e : new S(e);
 }
-class z {
+class S {
   constructor(t) {
-    i(this, "isMemoized", !1);
-    i(this, "sourceIterator");
-    i(this, "linkedList", new d());
-    i(this, "source");
-    this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof d && (this.linkedList = t, this.isMemoized = !0);
+    n(this, "isMemoized", !1);
+    n(this, "sourceIterator");
+    n(this, "linkedList", new x());
+    n(this, "source");
+    this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof x && (this.linkedList = t, this.isMemoized = !0);
   }
   [Symbol.iterator]() {
-    return this.isMemoized ? new $(this.linkedList) : new T(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
+    return this.isMemoized ? new U(this.linkedList) : new Q(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
   }
 }
-class T {
-  constructor(t, r, n) {
-    i(this, "index", 0);
-    i(this, "linkedList");
-    i(this, "linkedListIterator");
-    i(this, "setAsMemoized");
-    i(this, "sourceIterator");
-    this.linkedList = r, this.linkedListIterator = r[Symbol.iterator](), this.setAsMemoized = n, this.sourceIterator = t;
+class Q {
+  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++)
@@ -195,71 +217,272 @@ class T {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class $ {
+class U {
   constructor(t) {
-    i(this, "memoizedSourceIterator");
+    n(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.memoizedSourceIterator.next();
   }
 }
-function j(e, t) {
+function R(e, t) {
   const r = e[Symbol.iterator]();
-  let n = 0, s = r.next(), u = s.value, l = null;
-  for (t == null ? l = (o, a) => o < a ? -1 : o === a ? 0 : 1 : M(t) ? l = t : Array.isArray(t) ? l = (o, a) => {
-    let f = 0;
+  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 c = 0;
     for (const h of t)
-      if (f = o[h] < a[h] ? -1 : o[h] === a[h] ? 0 : 1, f !== 0)
+      if (c = s[h] < a[h] ? -1 : s[h] === a[h] ? 0 : 1, c !== 0)
         break;
-    return f;
-  } : l = (o, a) => o[t] < a[t] ? -1 : o[t] === a[t] ? 0 : 1, s = r.next(); s.done !== !0; s = r.next()) {
-    const o = l(u, s.value, n++);
-    u = o < 0 || o === 0 ? u : s.value;
+    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;
+  }
+  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, 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);
+}
+class X {
+  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 Y(this.initialValue, this.length, this.step);
+  }
+}
+class Y {
+  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-- ? f(!1, t) : l();
+  }
+}
+class Z {
+  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 _(this.initialValue, this.length, this.step);
+  }
+}
+class _ {
+  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-- ? f(!1, t) : l();
+  }
+}
+class q {
+  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 W(this.initialValue, this.length, this.step);
+  }
+}
+class W {
+  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 A(e, t, r) {
+  if (!m(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 L(e, t) {
+  if (t < 0)
+    throw '"count" parameter must be greater or equal then 0';
+  return new tt(e, t);
+}
+class tt {
+  constructor(t, r) {
+    n(this, "value");
+    n(this, "count");
+    this.value = t, this.count = r;
+  }
+  [Symbol.iterator]() {
+    return new et(this.value, this.count);
+  }
+}
+class et {
+  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());
+  }
+  next() {
+    return this.internalNext();
+  }
+  return(t) {
+    return this.internalNext = () => l(), l(t);
   }
-  return u == null ? null : u;
 }
-function B(e, t) {
+function V(e, t) {
   const r = e[Symbol.iterator]();
-  let n = 0;
-  for (let s = r.next(); s.done !== !0; s = r.next())
-    if (t(s.value, n++))
+  let i = 0;
+  for (let o = r.next(); o.done !== !0; o = r.next())
+    if (t(o.value, i++))
       return !0;
   return !1;
 }
-class c {
+function F(e, t) {
+  return new rt(e, t);
+}
+class rt {
+  constructor(t, r) {
+    n(this, "tapper");
+    n(this, "source");
+    this.source = t, this.tapper = r;
+  }
+  [Symbol.iterator]() {
+    return new nt(this.source, this.tapper);
+  }
+}
+class nt {
+  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 = l, l());
+    });
+    this.sourceIterator = t[Symbol.iterator](), this.tapper = r;
+  }
+  next() {
+    return this.innerNext();
+  }
+  return(t) {
+    return this.innerNext = l, l(t);
+  }
+}
+function T(e, t) {
+  return new it(e, t);
+}
+class it {
+  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 ot = /* @__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
+}, Symbol.toStringTag, { value: "Module" }));
+class d {
   constructor(t) {
-    i(this, "iterable");
+    n(this, "iterable");
     this.iterable = t;
   }
   [Symbol.iterator]() {
     return this.iterable[Symbol.iterator]();
   }
   collectToArray() {
-    return [...this.iterable];
+    return Array.from(this.iterable);
   }
   filter(t) {
-    return new c(L(this.iterable, t));
+    return new d(v(this.iterable, t));
   }
   map(t) {
-    return new c(N(this.iterable, t));
+    return new d(g(this.iterable, t));
   }
   materialize() {
-    return new c(P(this.iterable));
+    return new d(z(this.iterable));
+  }
+  max(t) {
+    return N(this.iterable, t);
   }
   memoize() {
-    return new c(D(this.iterable));
+    return new d(M(this.iterable));
   }
   min(t) {
-    return j(this.iterable, t);
+    return R(this.iterable, t);
+  }
+  reduce(t, r) {
+    return A(this.iterable, t, r);
   }
   some(t) {
-    return B(this.iterable, t);
+    return V(this.iterable, t);
+  }
+  tap(t) {
+    return new d(F(this.iterable, t));
+  }
+  tapChain(t) {
+    return new d(T(this.iterable, t));
+  }
+  tapChainCreation(t) {
+    return t(this), this;
   }
 }
-function E(e) {
-  return new c(e);
+function at() {
+  return b(w());
+}
+function b(e) {
+  return new d(e);
+}
+function ut(e, t, r, i) {
+  return b(k(e, t, r, i));
+}
+function lt(e, t) {
+  return b(L(e, t));
 }
 export {
-  E as from
+  ot as Functions,
+  d as IterableLinqWrapper,
+  at as empty,
+  b as from,
+  ut as fromRange,
+  lt as repeat
 };

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

@@ -1 +1 @@
-(function(u,o){typeof exports=="object"&&typeof module<"u"?o(exports):typeof define=="function"&&define.amd?define(["exports"],o):(u=typeof globalThis<"u"?globalThis:u||self,o(u["interable-linq-utility"]={}))})(this,function(u){"use strict";var B=Object.defineProperty;var C=(u,o,d)=>o in u?B(u,o,{enumerable:!0,configurable:!0,writable:!0,value:d}):u[o]=d;var i=(u,o,d)=>(C(u,typeof o!="symbol"?o+"":o,d),d);function o(e,t){return(r,n)=>t(e(r,n),n)}function d(e,t){return(r,n)=>e(r,n)&&t(r,n)}function b(e,t){return{done:e,value:t}}function p(){return{done:!0,value:void 0}}function E(e){return e}function M(e){return typeof e=="function"}function k(e,t){return new x(e,t)}class x{constructor(t,r){i(this,"predicate");i(this,"source");let n=r,s=t;if(s instanceof x){const l=s.predicate;s=s.source,n=d(l,n)}this.source=s,this.predicate=n}[Symbol.iterator](){return new L(this.source,this.predicate)}}class L{constructor(t,r){i(this,"index",0);i(this,"sourceIterator");i(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){return new z(e,t)}class z{constructor(t,r){i(this,"mapper");i(this,"source");let n=r,s=t;if(s instanceof z){const l=s.mapper;s=s.source,n=o(l,n)}this.source=t,this.mapper=n}[Symbol.iterator](){return new N(this.source,this.mapper)}}class N{constructor(t,r){i(this,"index",0);i(this,"sourceIterator");i(this,"mapper");this.sourceIterator=t[Symbol.iterator](),this.mapper=r}next(){const t=this.sourceIterator.next();return t.done!==!0?b(!1,this.mapper(t.value,this.index++)):p()}}function A(e){const t=e[Symbol.iterator](),r=new m;for(let n=t.next();n.done!==!0;n=t.next())r.addLast(n.value);return r}class g{constructor(t=null){i(this,"current",null);this.current=t}next(){const t=this.current;return t===null?p():(this.current=t.nextNode,b(!1,t.data))}}class m{constructor(){i(this,"internalSize",0);i(this,"head",null);i(this,"tail",null)}[Symbol.iterator](){return new g(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 F(e){return e instanceof y?e:new y(e)}class y{constructor(t){i(this,"source");if(t instanceof m){this.source=t;return}this.source=A(t)}[Symbol.iterator](){return new P(this.source)}}class P{constructor(t){i(this,"sourceIterator");this.sourceIterator=t[Symbol.iterator]()}next(){return this.sourceIterator.next()}}function T(e){return e instanceof w?e:new w(e)}class w{constructor(t){i(this,"isMemoized",!1);i(this,"sourceIterator");i(this,"linkedList",new m);i(this,"source");this.source=t,this.sourceIterator=t[Symbol.iterator](),t instanceof m&&(this.linkedList=t,this.isMemoized=!0)}[Symbol.iterator](){return this.isMemoized?new j(this.linkedList):new R(this.sourceIterator,this.linkedList,t=>this.isMemoized=t.done===!0)}}class R{constructor(t,r,n){i(this,"index",0);i(this,"linkedList");i(this,"linkedListIterator");i(this,"setAsMemoized");i(this,"sourceIterator");this.linkedList=r,this.linkedListIterator=r[Symbol.iterator](),this.setAsMemoized=n,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 j{constructor(t){i(this,"memoizedSourceIterator");this.memoizedSourceIterator=t[Symbol.iterator]()}next(){return this.memoizedSourceIterator.next()}}function D(e,t){const r=e[Symbol.iterator]();let n=0,s=r.next(),l=s.value,f=null;for(t==null?f=(a,c)=>a<c?-1:a===c?0:1:M(t)?f=t:Array.isArray(t)?f=(a,c)=>{let S=0;for(const I of t)if(S=a[I]<c[I]?-1:a[I]===c[I]?0:1,S!==0)break;return S}:f=(a,c)=>a[t]<c[t]?-1:a[t]===c[t]?0:1,s=r.next();s.done!==!0;s=r.next()){const a=f(l,s.value,n++);l=a<0||a===0?l:s.value}return l==null?null:l}function O(e,t){const r=e[Symbol.iterator]();let n=0;for(let s=r.next();s.done!==!0;s=r.next())if(t(s.value,n++))return!0;return!1}class h{constructor(t){i(this,"iterable");this.iterable=t}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return[...this.iterable]}filter(t){return new h(k(this.iterable,t))}map(t){return new h(v(this.iterable,t))}materialize(){return new h(F(this.iterable))}memoize(){return new h(T(this.iterable))}min(t){return D(this.iterable,t)}some(t){return O(this.iterable,t)}}function $(e){return new h(e)}u.from=$,Object.defineProperties(u,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})});
+(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"}})});

package/dist/linqIterable.d.ts

@@ -1,23 +1,38 @@
-import { Comparer, Mapper, Predicate } from '@/types';
-export interface ILinqIterable<T> {
+import { Comparer, Mapper, Reducer, Predicate, Tapper } from '@/types';
+export interface IIterableLinq<T> {
     [Symbol.iterator](): Iterator<T, any, undefined>;
     collectToArray(): T[];
-    filter(predicate: typeof Predicate<T>): ILinqIterable<T>;
-    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
-    materialize(): ILinqIterable<T>;
-    memoize(): ILinqIterable<T>;
+    filter(predicate: Predicate<T>): IIterableLinq<T>;
+    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;
-    some(predicate: typeof Predicate<T>): boolean;
+    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: typeof Predicate<T>): ILinqIterable<T>;
-    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
-    materialize(): ILinqIterable<T>;
-    memoize(): ILinqIterable<T>;
+    filter(predicate: Predicate<T>): IIterableLinq<T>;
+    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;
-    some(predicate: typeof Predicate<T>): boolean;
+    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/comparer.d.ts

@@ -1,4 +1,4 @@
-declare type ComparerFunction<T> = (a: T, b: T, index: number) => number;
+declare type ComparerFunction<T> = (a: T, b: T) => number;
 declare type ComparingProps<T> = keyof T | Array<keyof T>;
 export declare type Comparer<T> = ComparerFunction<T> | ComparingProps<T>;
 export {};

package/dist/types/index.d.ts

@@ -1,3 +1,6 @@
 export * from './comparer';
 export * from './mapper';
 export * from './predicate';
+export * from './reducer';
+export * from './tapper';
+export * from './unit';

package/dist/types/predicate.d.ts

@@ -1 +1 @@
-export declare function Predicate<T>(value: T, index: number): boolean;
+export declare type Predicate<T> = (value: T, index: number) => boolean;

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "iterable-linq-utility",
-  "version": "0.0.8",
+  "version": "0.0.10",
   "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: typeof Predicate<T>, p2: typeof Predicate<T>): typeof Predicate<T>;