iterable-linq-utility 0.0.16 → 0.2.0

package/dist/interable-linq-utility.js

@@ -1,708 +0,0 @@
-var G = Object.defineProperty;
-var H = (e, t, r) => t in e ? G(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var n = (e, t, r) => (H(e, typeof t != "symbol" ? t + "" : t, r), r);
-function m(e) {
-  return { done: !1, value: e };
-}
-function s(e) {
-  return { done: !0, value: e };
-}
-function h(e) {
-  return typeof e == "function";
-}
-function I(e) {
-  if (e == null)
-    throw new Error('The "sourceIterable" must be provided');
-  if (!h(e[Symbol.iterator]))
-    throw new Error('The provided "soureIterable" does not conform to the iterator protocol https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#the_iterable_protocol. It must implement the "[Symbol.iterator]" function.');
-}
-function K(e) {
-  if (!h(e))
-    throw new Error('The "predicate" function must be provided');
-}
-function Q(e) {
-  if (!h(e))
-    throw new Error('The "mapper" function must be provided');
-}
-function X(e) {
-  return I(e), Array.from(e);
-}
-function z() {
-  return new Y();
-}
-class Y {
-  [Symbol.iterator]() {
-    return new Z();
-  }
-}
-class Z {
-  next() {
-    return s();
-  }
-  return(t) {
-    return s(t);
-  }
-  throw() {
-    return s();
-  }
-}
-function M(e, t) {
-  return I(e), K(t), new _(e, t);
-}
-class _ {
-  constructor(t, r) {
-    n(this, "predicate");
-    n(this, "source");
-    this.source = t, this.predicate = r;
-  }
-  [Symbol.iterator]() {
-    return new q(this.source, this.predicate);
-  }
-}
-class q {
-  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 = s, s(t);
-  }
-}
-function g(e, t) {
-  return I(e), Q(t), new W(e, t);
-}
-class W {
-  constructor(t, r) {
-    n(this, "mapper");
-    n(this, "source");
-    this.source = t, this.mapper = r;
-  }
-  [Symbol.iterator]() {
-    return new tt(this.source, this.mapper);
-  }
-}
-class tt {
-  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 = s, this.internalNext();
-    });
-    n(this, "fmNext", () => {
-      const t = this.fmIterator.next();
-      return t.done !== !0 ? m(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 = s, s(t);
-  }
-}
-class et {
-}
-const A = new et();
-Object.freeze(A);
-function w() {
-  return A;
-}
-function k(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"action" function must be provided';
-  const r = e[Symbol.iterator]();
-  for (let i = r.next(), o = 0; i.done !== !0; i = r.next(), o++)
-    t(i.value, o);
-  return w();
-}
-async function T(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"action" function must be provided';
-  const r = [], i = e[Symbol.iterator]();
-  for (let o = i.next(), a = 0; o.done !== !0; o = i.next(), a++)
-    r.push(t(o.value, a));
-  return await Promise.all(r), w();
-}
-function L(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"mapper" function must be provided';
-  return new rt(e, t);
-}
-class rt {
-  constructor(t, r) {
-    n(this, "mapper");
-    n(this, "source");
-    this.source = t, this.mapper = r;
-  }
-  [Symbol.iterator]() {
-    return new nt(this.source, this.mapper);
-  }
-}
-class nt {
-  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(this.mapper(t.value, this.index++)) : (this.internalNext = s, this.internalNext());
-    });
-    this.sourceIterator = t[Symbol.iterator](), this.mapper = r;
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, h(this.sourceIterator.return) && this.sourceIterator.return(t), s(t);
-  }
-}
-function R(e) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  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 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 it(this.head || null);
-  }
-  addFirst(t) {
-    return this.internalAddFirst(t);
-  }
-  addLast(t) {
-    return this.internalAddLast(t);
-  }
-  size() {
-    return this.internalSize;
-  }
-}
-class it {
-  constructor(t) {
-    n(this, "current");
-    n(this, "innerNext", () => {
-      const t = this.current;
-      return t === null ? s() : (this.current = t.nextNode, m(t.data));
-    });
-    this.current = t;
-  }
-  next() {
-    return this.innerNext();
-  }
-  return(t) {
-    return this.innerNext = s, s(t);
-  }
-}
-function E(e) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  return e instanceof S ? e : new S(e);
-}
-class S {
-  constructor(t) {
-    n(this, "source");
-    this.source = R(t);
-  }
-  [Symbol.iterator]() {
-    return new ot(this.source);
-  }
-}
-class ot {
-  constructor(t) {
-    n(this, "sourceIterator");
-    this.sourceIterator = t[Symbol.iterator]();
-  }
-  next() {
-    return this.sourceIterator.next();
-  }
-}
-function F(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  const r = e[Symbol.iterator]();
-  let i = r.next(), o = i.value, a = null;
-  for (t == null ? a = (u, l) => u < l ? -1 : u === l ? 0 : 1 : h(t) ? a = t : Array.isArray(t) ? a = (u, l) => {
-    let d = 0;
-    for (const c of t)
-      if (d = u[c] < l[c] ? -1 : u[c] === l[c] ? 0 : 1, d !== 0)
-        break;
-    return d;
-  } : a = (u, l) => u[t] < l[t] ? -1 : u[t] === l[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
-    const u = a(o, i.value);
-    o = u > 0 || u === 0 ? o : i.value;
-  }
-  return o ?? null;
-}
-function P() {
-  return {
-    allowPartialMemoization: !0
-  };
-}
-function V(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  const i = {
-    ...P(),
-    ...t
-  }.allowPartialMemoization;
-  return e instanceof p ? i ? e.changePartialMemoizationBehaviour() : e : e instanceof b ? i ? e : e.changePartialMemoizationBehaviour() : i ? new b(e) : new p(e);
-}
-class p {
-  constructor(t) {
-    n(this, "source");
-    n(this, "isMemoized", !1);
-    n(this, "memoized", new v());
-    this.source = t;
-  }
-  [Symbol.iterator]() {
-    return this.isMemoized ? new B(this.memoized) : new st(this.source, (t) => (this.memoized = t, this.isMemoized = !0, w()));
-  }
-  changePartialMemoizationBehaviour() {
-    return new b(this.source);
-  }
-}
-class b {
-  constructor(t) {
-    n(this, "isMemoized", !1);
-    n(this, "isMemoizationStarted", !1);
-    n(this, "sourceIterator");
-    n(this, "linkedList", new v());
-    n(this, "source");
-    this.source = t;
-  }
-  [Symbol.iterator]() {
-    return this.isMemoizationStarted || (this.sourceIterator = this.source[Symbol.iterator](), this.isMemoizationStarted = !0), this.isMemoized ? new B(this.linkedList) : new ut(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
-  }
-  changePartialMemoizationBehaviour() {
-    return new p(this.source);
-  }
-}
-class st {
-  constructor(t, r) {
-    n(this, "linkedListIterator");
-    n(this, "setAsMemoized");
-    n(this, "sourceIterable");
-    n(this, "internalNext", () => {
-      const t = R(this.sourceIterable);
-      return this.setAsMemoized(t), this.linkedListIterator = t[Symbol.iterator](), this.internalNext = () => this.linkedListIterator.next(), this.internalNext();
-    });
-    this.sourceIterable = t, this.setAsMemoized = r;
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    this.internalNext = s;
-    const r = this.linkedListIterator;
-    if (r == null)
-      return s(t);
-    if (h(r.return)) {
-      const i = r.return(t);
-      return this.linkedListIterator = null, i;
-    }
-    return s(t);
-  }
-}
-class ut {
-  constructor(t, r, i) {
-    n(this, "index", 0);
-    n(this, "linkedList");
-    n(this, "linkedListIterator");
-    n(this, "setAsMemoized");
-    n(this, "sourceIterator");
-    n(this, "internalNext");
-    this.linkedList = r, this.linkedListIterator = r[Symbol.iterator](), this.setAsMemoized = i, this.sourceIterator = t, this.internalNext = () => {
-      if (this.linkedList.size() > this.index++)
-        return this.linkedListIterator.next();
-      const o = this.sourceIterator.next();
-      return this.setAsMemoized(o) || this.linkedList.addLast(o.value), o;
-    };
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, this.linkedList = null, this.linkedListIterator = null, this.internalNext = s, h(this.sourceIterator.return) ? this.sourceIterator.return(t) : s(t);
-  }
-}
-class B {
-  constructor(t) {
-    n(this, "memoizedSourceIterator");
-    this.memoizedSourceIterator = t[Symbol.iterator]();
-  }
-  next() {
-    return this.memoizedSourceIterator.next();
-  }
-  return(t) {
-    return this.memoizedSourceIterator.return(t);
-  }
-}
-function C(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  const r = e[Symbol.iterator]();
-  let i = r.next(), o = i.value, a = null;
-  for (t == null ? a = (u, l) => u < l ? -1 : u === l ? 0 : 1 : h(t) ? a = t : Array.isArray(t) ? a = (u, l) => {
-    let d = 0;
-    for (const c of t)
-      if (d = u[c] < l[c] ? -1 : u[c] === l[c] ? 0 : 1, d !== 0)
-        break;
-    return d;
-  } : a = (u, l) => u[t] < l[t] ? -1 : u[t] === l[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
-    const u = a(o, i.value);
-    o = u < 0 || u === 0 ? o : i.value;
-  }
-  return o ?? null;
-}
-function O(e, t, r, i) {
-  const o = t == null || t === !0 || t === !1 ? e : t, a = t == null || t === !0 || t === !1 ? 0 : e, u = a < o, l = r !== !0 && r !== !1 && r != null && r !== 0 ? r : u ? 1 : -1, d = u && l < 0 || !u && l > 0 ? -1 * l : l, c = Math.ceil(Math.abs(o - a) / Math.abs(d)), y = !!(t === !0 || r === !0 || i != null && i), x = y ? c * d + a : a;
-  return a === o ? new dt(x, 0, 0) : y ? new ht(x, c, d) : new at(x, c, d);
-}
-class at {
-  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 lt(this.initialValue, this.length, this.step);
-  }
-}
-class lt {
-  constructor(t, r, i) {
-    n(this, "value");
-    n(this, "length");
-    n(this, "step");
-    n(this, "internalNext", () => {
-      const t = this.value;
-      return this.value += this.step, this.length-- ? m(t) : s();
-    });
-    this.value = t, this.length = r, this.step = i;
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, s(t);
-  }
-}
-class ht {
-  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 ct(this.initialValue, this.length, this.step);
-  }
-}
-class ct {
-  constructor(t, r, i) {
-    n(this, "value");
-    n(this, "length");
-    n(this, "step");
-    n(this, "internalNext", () => {
-      const t = this.value;
-      return this.value -= this.step, this.length-- ? m(t) : s();
-    });
-    this.value = t, this.length = r, this.step = i;
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, s(t);
-  }
-}
-class dt {
-  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 ft(this.initialValue, this.length, this.step);
-  }
-}
-class ft {
-  constructor(t, r, i) {
-    n(this, "value");
-    n(this, "length");
-    n(this, "step");
-    this.value = t, this.length = r, this.step = i;
-  }
-  next() {
-    return s();
-  }
-  return(t) {
-    return s(t);
-  }
-}
-function j(e, t, r) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(r))
-    throw '"reducer" function must be provided';
-  const i = e[Symbol.iterator]();
-  let o = t, a = 0;
-  for (let u = i.next(); u.done !== !0; u = i.next())
-    o = r(o, u.value, a), a++;
-  return o;
-}
-function $(e, t) {
-  if (t < 0)
-    throw '"count" parameter must be greater or equal then 0';
-  return new mt(e, t);
-}
-class mt {
-  constructor(t, r) {
-    n(this, "value");
-    n(this, "count");
-    this.value = t, this.count = r;
-  }
-  [Symbol.iterator]() {
-    return new xt(this.value, this.count);
-  }
-}
-class xt {
-  constructor(t, r) {
-    n(this, "leftToRepeat", 0);
-    n(this, "value");
-    n(this, "count");
-    n(this, "internalNext", () => this.leftToRepeat-- ? m(this.value) : (this.internalNext = s, s()));
-    this.value = t, this.count = r, this.leftToRepeat = r, r === 0 && (this.internalNext = s);
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, s(t);
-  }
-}
-function D(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"predicate" function must be provided';
-  const r = e[Symbol.iterator]();
-  let i = 0;
-  for (let o = r.next(); o.done !== !0; o = r.next())
-    if (t(o.value, i++))
-      return !0;
-  return !1;
-}
-function U(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"tapper" function must be provided';
-  return new pt(e, t);
-}
-class pt {
-  constructor(t, r) {
-    n(this, "tapper");
-    n(this, "source");
-    this.source = t, this.tapper = r;
-  }
-  [Symbol.iterator]() {
-    return new bt(this.source, this.tapper);
-  }
-}
-class bt {
-  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 = s, s());
-    });
-    this.sourceIterator = t[Symbol.iterator](), this.tapper = r;
-  }
-  next() {
-    return this.internalNext();
-  }
-  return(t) {
-    return this.internalNext = s, s(t);
-  }
-}
-function J(e, t) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  if (!h(t))
-    throw '"tapper" function must be provided';
-  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 vt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  collectToArray: X,
-  empty: z,
-  filter: M,
-  flatMap: g,
-  forEach: k,
-  forEachAsync: T,
-  getMemoizeDefaultOptions: P,
-  map: L,
-  materialize: E,
-  max: F,
-  memoize: V,
-  min: C,
-  range: O,
-  reduce: j,
-  repeat: $,
-  some: D,
-  tap: U,
-  tapChain: J
-}, Symbol.toStringTag, { value: "Module" }));
-class f {
-  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 f(M(this.iterable, t));
-  }
-  flatMap(t) {
-    return new f(g(this.iterable, t));
-  }
-  forEach(t) {
-    return k(this.iterable, t);
-  }
-  forEachAsync(t) {
-    return T(this.iterable, t);
-  }
-  map(t) {
-    return new f(L(this.iterable, t));
-  }
-  materialize() {
-    return new f(E(this.iterable));
-  }
-  max(t) {
-    return F(this.iterable, t);
-  }
-  memoize(t) {
-    return new f(V(this.iterable, t));
-  }
-  min(t) {
-    return C(this.iterable, t);
-  }
-  reduce(t, r) {
-    return j(this.iterable, t, r);
-  }
-  some(t) {
-    return D(this.iterable, t);
-  }
-  tap(t) {
-    return new f(U(this.iterable, t));
-  }
-  tapChain(t) {
-    return new f(J(this.iterable, t));
-  }
-  tapChainCreation(t) {
-    if (!h(t))
-      throw '"tapper" function must be provided';
-    return t(this), this;
-  }
-}
-function Nt() {
-  return N(z());
-}
-function N(e) {
-  if (e == null)
-    throw 'The source "iterable" must be provided';
-  return new f(e);
-}
-function yt(e, t, r, i) {
-  return N(O(e, t, r, i));
-}
-function St(e, t) {
-  return N($(e, t));
-}
-export {
-  vt as Functions,
-  f as IterableLinqWrapper,
-  et as Unit,
-  Nt as empty,
-  N as from,
-  yt as fromRange,
-  St as repeat,
-  w as unit
-};