iterable-linq-utility 0.0.4 → 0.0.6

package/dist/functions/some.d.ts

@@ -1 +1,2 @@
-export declare function some<T>(iterable: Iterable<T>, predicate: (value: T, index: number) => boolean): boolean;
+import { Predicate } from "@/types";
+export declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T>): boolean;

package/dist/index.d.ts

@@ -1,15 +1,3 @@
-import { Mapper, Predicate } from '@/types';
-export interface ILinqIterable<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>;
-    some(predicate: (value: T, index: number) => boolean): boolean;
-}
-declare module "./linqIterable" {
-    interface LinqIterable<T> extends ILinqIterable<T> {
-    }
-}
+import { type ILinqIterable } from "./linqIterable";
 export declare function from<T>(iterable: Iterable<T>): ILinqIterable<T>;
+export { ILinqIterable };

package/dist/interable-linq-utility.js

@@ -1,55 +1,40 @@
 var I = Object.defineProperty;
-var z = (e, t, r) => t in e ? I(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var i = (e, t, r) => (z(e, typeof t != "symbol" ? t + "" : t, r), r);
-class n {
-  constructor(t) {
-    i(this, "iterable");
-    this.iterable = t;
-  }
-  [Symbol.iterator]() {
-    return this.iterable[Symbol.iterator]();
-  }
-  collectToArray() {
-    return [...this.source];
-  }
-  get source() {
-    return this.iterable;
-  }
+var p = (e, t, r) => t in e ? I(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
+var i = (e, t, r) => (p(e, typeof t != "symbol" ? t + "" : t, r), r);
+function z(e, t) {
+  return (r, s) => t(e(r, s), s);
 }
 function x(e, t) {
-  return (r, o) => t(e(r, o), o);
-}
-function S(e, t) {
-  return (r, o) => e(r, o) && t(r, o);
+  return (r, s) => e(r, s) && t(r, s);
 }
-function f(e, t) {
+function m(e, t) {
   return {
     done: e,
     value: t
   };
 }
-function p() {
+function f() {
   return { done: !0, value: void 0 };
 }
-function y(e, t) {
-  return new l(e, t);
+function w(e, t) {
+  return new c(e, t);
 }
-class l {
+class c {
   constructor(t, r) {
     i(this, "predicate");
     i(this, "source");
-    let o = r, s = t;
-    if (s instanceof l) {
-      const c = s.predicate;
-      s = s.source, o = S(c, o);
+    let s = r, n = t;
+    if (n instanceof c) {
+      const u = n.predicate;
+      n = n.source, s = x(u, s);
     }
-    this.source = s, this.predicate = o;
+    this.source = n, this.predicate = s;
   }
   [Symbol.iterator]() {
-    return new b(this.source, this.predicate);
+    return new S(this.source, this.predicate);
   }
 }
-class b {
+class S {
   constructor(t, r) {
     i(this, "index", 0);
     i(this, "sourceIterator");
@@ -64,25 +49,25 @@ class b {
     }
   }
 }
-function w(e, t) {
-  return new h(e, t);
+function b(e, t) {
+  return new l(e, t);
 }
-class h {
+class l {
   constructor(t, r) {
     i(this, "mapper");
     i(this, "source");
-    let o = r, s = t;
-    if (s instanceof h) {
-      const c = s.mapper;
-      s = s.source, o = x(c, o);
+    let s = r, n = t;
+    if (n instanceof l) {
+      const u = n.mapper;
+      n = n.source, s = z(u, s);
     }
-    this.source = t, this.mapper = o;
+    this.source = t, this.mapper = s;
   }
   [Symbol.iterator]() {
-    return new L(this.source, this.mapper);
+    return new M(this.source, this.mapper);
   }
 }
-class L {
+class M {
   constructor(t, r) {
     i(this, "index", 0);
     i(this, "sourceIterator");
@@ -91,13 +76,13 @@ class L {
   }
   next() {
     const t = this.sourceIterator.next();
-    return t.done !== !0 ? f(!1, this.mapper(t.value, this.index++)) : p();
+    return t.done !== !0 ? m(!1, this.mapper(t.value, this.index++)) : f();
   }
 }
-function M(e) {
+function y(e) {
   const t = e[Symbol.iterator](), r = new a();
-  for (let o = t.next(); o.done !== !0; o = t.next())
-    r.addLast(o.value);
+  for (let s = t.next(); s.done !== !0; s = t.next())
+    r.addLast(s.value);
   return r;
 }
 class k {
@@ -107,7 +92,7 @@ class k {
   }
   next() {
     const t = this.current;
-    return t === null ? p() : (this.current = t.nextNode, f(!1, t.data));
+    return t === null ? f() : (this.current = t.nextNode, m(!1, t.data));
   }
 }
 class a {
@@ -151,23 +136,23 @@ class a {
     return this.internalSize;
   }
 }
-function N(e) {
-  return e instanceof d ? e : new d(e);
+function L(e) {
+  return e instanceof h ? e : new h(e);
 }
-class d {
+class h {
   constructor(t) {
     i(this, "source");
     if (t instanceof a) {
       this.source = t;
       return;
     }
-    this.source = M(t);
+    this.source = y(t);
   }
   [Symbol.iterator]() {
-    return new v(this.source);
+    return new N(this.source);
   }
 }
-class v {
+class N {
   constructor(t) {
     i(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
@@ -176,10 +161,10 @@ class v {
     return this.sourceIterator.next();
   }
 }
-function g(e) {
-  return e instanceof m ? e : new m(e);
+function v(e) {
+  return e instanceof d ? e : new d(e);
 }
-class m {
+class d {
   constructor(t) {
     i(this, "isMemoized", !1);
     i(this, "sourceIterator");
@@ -188,17 +173,17 @@ class m {
     this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof a && (this.linkedList = t, this.isMemoized = !0);
   }
   [Symbol.iterator]() {
-    return this.isMemoized ? new F(this.linkedList) : new A(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
+    return this.isMemoized ? new g(this.linkedList) : new A(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
   }
 }
 class A {
-  constructor(t, r, o) {
+  constructor(t, r, s) {
     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 = o, this.sourceIterator = t;
+    this.linkedList = r, this.linkedListIterator = r[Symbol.iterator](), this.setAsMemoized = s, this.sourceIterator = t;
   }
   next() {
     if (this.linkedList.size() > this.index++)
@@ -207,7 +192,7 @@ class A {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class F {
+class g {
   constructor(t) {
     i(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
@@ -216,32 +201,44 @@ class F {
     return this.memoizedSourceIterator.next();
   }
 }
-function P(e, t) {
+function F(e, t) {
   const r = e[Symbol.iterator]();
-  let o = 0;
-  for (let s = r.next(); s.done !== !0; s = r.next())
-    if (t(s.value, o++))
+  let s = 0;
+  for (let n = r.next(); n.done !== !0; n = r.next())
+    if (t(n.value, s++))
       return !0;
   return !1;
 }
-function u(e) {
-  return new n(e);
+class o {
+  constructor(t) {
+    i(this, "iterable");
+    this.iterable = t;
+  }
+  [Symbol.iterator]() {
+    return this.iterable[Symbol.iterator]();
+  }
+  collectToArray() {
+    return [...this.iterable];
+  }
+  filter(t) {
+    return new o(w(this.iterable, t));
+  }
+  map(t) {
+    return new o(b(this.iterable, t));
+  }
+  materialize() {
+    return new o(L(this.iterable));
+  }
+  memoize() {
+    return new o(v(this.iterable));
+  }
+  some(t) {
+    return F(this.iterable, t);
+  }
+}
+function R(e) {
+  return new o(e);
 }
-n.prototype.filter = function(e) {
-  return u(y(this.source, e));
-};
-n.prototype.map = function(e) {
-  return u(w(this.source, e));
-};
-n.prototype.materialize = function() {
-  return u(N(this.source));
-};
-n.prototype.memoize = function() {
-  return u(g(this.source));
-};
-n.prototype.some = function(e) {
-  return P(this.source, e);
-};
 export {
-  u as from
+  R as from
 };

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

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

package/dist/linqIterable.d.ts

@@ -1,7 +1,21 @@
-export declare class LinqIterable<T> implements Iterable<T> {
+import { Mapper, Predicate } from '@/types';
+export interface ILinqIterable<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>;
+    some(predicate: Predicate<T>): boolean;
+}
+export declare class LinqIterable<T> implements ILinqIterable<T> {
     constructor(iterable: Iterable<T>);
     [Symbol.iterator](): Iterator<T, any, undefined>;
     private iterable;
     collectToArray(): T[];
-    get source(): Iterable<T>;
+    filter(predicate: Predicate<T>): ILinqIterable<T>;
+    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
+    materialize(): ILinqIterable<T>;
+    memoize(): ILinqIterable<T>;
+    some(predicate: Predicate<T>): boolean;
 }

package/package.json

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