iterable-linq-utility 0.0.3 → 0.0.4

package/dist/{filter.d.ts → functions/filter.d.ts}

@@ -1,2 +1,2 @@
-import { Predicate } from "./types";
+import { Predicate } from "@/types";
 export declare function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;

package/dist/functions/index.d.ts

@@ -0,0 +1,8 @@
+export * from './filter';
+export * from './map';
+export * from './materialize';
+export * from './max';
+export * from './memoize';
+export * from './min';
+export * from './range';
+export * from './some';

package/dist/{map.d.ts → functions/map.d.ts}

@@ -1,2 +1,2 @@
-import { Mapper } from "./types";
+import { Mapper } from "@/types";
 export declare function map<T, R>(iterable: Iterable<T>, mapper: Mapper<T, R>): Iterable<R>;

package/dist/functions/min.d.ts

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

package/dist/functions/range.d.ts

@@ -0,0 +1,6 @@
+export declare function range(end: number): Iterable<number>;
+export declare function range(end: number, reverse?: boolean): Iterable<number>;
+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>;

package/dist/genericCollections/index.d.ts

@@ -0,0 +1 @@
+export * from './linkedList';

package/dist/index.d.ts

@@ -1,21 +1,15 @@
+import { Mapper, Predicate } from '@/types';
 export interface ILinqIterable<T> {
     [Symbol.iterator](): Iterator<T, any, undefined>;
     collectToArray(): T[];
-    filter(predicate: (value: T, index: number) => boolean): ILinqIterable<T>;
-    map<R>(mapper: (value: T, index: number) => R): ILinqIterable<R>;
+    filter(predicate: Predicate<T>): ILinqIterable<T>;
+    map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
     materialize(): ILinqIterable<T>;
-    max<T>(comparer?: (a: T, b: T, index: number) => boolean): T | null | undefined;
     memoize(): ILinqIterable<T>;
     some(predicate: (value: T, index: number) => boolean): boolean;
 }
 declare module "./linqIterable" {
-    interface LinqIterable<T> {
-        filter(predicate: (value: T, index: number) => boolean): ILinqIterable<T>;
-        map<R>(mapper: (value: T, index: number) => R): ILinqIterable<R>;
-        materialize(): ILinqIterable<T>;
-        max<T>(comparer?: (a: T, b: T, index: number) => boolean): T | null | undefined;
-        memoize(): ILinqIterable<T>;
-        some(predicate: (value: T, index: number) => boolean): boolean;
+    interface LinqIterable<T> extends ILinqIterable<T> {
     }
 }
 export declare function from<T>(iterable: Iterable<T>): ILinqIterable<T>;

package/dist/interable-linq-utility.js

@@ -1,26 +1,26 @@
-var S = Object.defineProperty;
-var y = (e, t, r) => t in e ? S(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var o = (e, t, r) => (y(e, typeof t != "symbol" ? t + "" : t, r), r);
-class u {
+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) {
-    o(this, "iterable");
+    i(this, "iterable");
     this.iterable = t;
   }
   [Symbol.iterator]() {
     return this.iterable[Symbol.iterator]();
   }
-  source() {
-    return this.iterable;
-  }
   collectToArray() {
-    return [...this.source()];
+    return [...this.source];
+  }
+  get source() {
+    return this.iterable;
   }
 }
-function b(e, t) {
-  return (r, i) => t(e(r, i), i);
+function x(e, t) {
+  return (r, o) => t(e(r, o), o);
 }
-function w(e, t) {
-  return (r, i) => e(r, i) && t(r, i);
+function S(e, t) {
+  return (r, o) => e(r, o) && t(r, o);
 }
 function f(e, t) {
   return {
@@ -31,29 +31,29 @@ function f(e, t) {
 function p() {
   return { done: !0, value: void 0 };
 }
-function L(e, t) {
+function y(e, t) {
   return new l(e, t);
 }
 class l {
   constructor(t, r) {
-    o(this, "predicate");
-    o(this, "source");
-    let i = r, n = t;
-    if (n instanceof l) {
-      const s = n.predicate;
-      n = n.source, i = w(s, i);
+    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);
     }
-    this.source = n, this.predicate = i;
+    this.source = s, this.predicate = o;
   }
   [Symbol.iterator]() {
-    return new M(this.source, this.predicate);
+    return new b(this.source, this.predicate);
   }
 }
-class M {
+class b {
   constructor(t, r) {
-    o(this, "index", 0);
-    o(this, "sourceIterator");
-    o(this, "predicate");
+    i(this, "index", 0);
+    i(this, "sourceIterator");
+    i(this, "predicate");
     this.sourceIterator = t[Symbol.iterator](), this.predicate = r;
   }
   next() {
@@ -64,29 +64,29 @@ class M {
     }
   }
 }
-function k(e, t) {
+function w(e, t) {
   return new h(e, t);
 }
 class h {
   constructor(t, r) {
-    o(this, "mapper");
-    o(this, "source");
-    let i = r, n = t;
-    if (n instanceof h) {
-      const s = n.mapper;
-      n = n.source, i = b(s, i);
+    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);
     }
-    this.source = t, this.mapper = i;
+    this.source = t, this.mapper = o;
   }
   [Symbol.iterator]() {
-    return new v(this.source, this.mapper);
+    return new L(this.source, this.mapper);
   }
 }
-class v {
+class L {
   constructor(t, r) {
-    o(this, "index", 0);
-    o(this, "sourceIterator");
-    o(this, "mapper");
+    i(this, "index", 0);
+    i(this, "sourceIterator");
+    i(this, "mapper");
     this.sourceIterator = t[Symbol.iterator](), this.mapper = r;
   }
   next() {
@@ -94,15 +94,15 @@ class v {
     return t.done !== !0 ? f(!1, this.mapper(t.value, this.index++)) : p();
   }
 }
-function N(e) {
+function M(e) {
   const t = e[Symbol.iterator](), r = new a();
-  for (let i = t.next(); i.done !== !0; i = t.next())
-    r.addLast(i.value);
+  for (let o = t.next(); o.done !== !0; o = t.next())
+    r.addLast(o.value);
   return r;
 }
-class A {
+class k {
   constructor(t = null) {
-    o(this, "current", null);
+    i(this, "current", null);
     this.current = t;
   }
   next() {
@@ -112,12 +112,12 @@ class A {
 }
 class a {
   constructor() {
-    o(this, "internalSize", 0);
-    o(this, "head", null);
-    o(this, "tail", null);
+    i(this, "internalSize", 0);
+    i(this, "head", null);
+    i(this, "tail", null);
   }
   [Symbol.iterator]() {
-    return new A(this.head);
+    return new k(this.head);
   }
   addFirst(t) {
     const r = {
@@ -151,65 +151,54 @@ class a {
     return this.internalSize;
   }
 }
-function F(e) {
+function N(e) {
   return e instanceof d ? e : new d(e);
 }
 class d {
   constructor(t) {
-    o(this, "source");
+    i(this, "source");
     if (t instanceof a) {
       this.source = t;
       return;
     }
-    this.source = N(t);
+    this.source = M(t);
   }
   [Symbol.iterator]() {
-    return new g(this.source);
+    return new v(this.source);
   }
 }
-class g {
+class v {
   constructor(t) {
-    o(this, "sourceIterator");
+    i(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.sourceIterator.next();
   }
 }
-function P(e) {
-  return typeof e == "function";
-}
-function R(e, t) {
-  const r = e[Symbol.iterator]();
-  let i = 0, n = r.next(), s = n.value;
-  const I = P(t) ? t : (x, z) => x > z;
-  for (n = r.next(); n.done !== !0; n = r.next())
-    s = I(s, n.value, i++) ? s : n.value;
-  return s == null ? null : s;
-}
-function q(e) {
+function g(e) {
   return e instanceof m ? e : new m(e);
 }
 class m {
   constructor(t) {
-    o(this, "isMemoized", !1);
-    o(this, "sourceIterator");
-    o(this, "linkedList", new a());
-    o(this, "source");
+    i(this, "isMemoized", !1);
+    i(this, "sourceIterator");
+    i(this, "linkedList", new a());
+    i(this, "source");
     this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof a && (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 F(this.linkedList) : new A(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
   }
 }
-class D {
-  constructor(t, r, i) {
-    o(this, "index", 0);
-    o(this, "linkedList");
-    o(this, "linkedListIterator");
-    o(this, "setAsMemoized");
-    o(this, "sourceIterator");
-    this.linkedList = r, this.linkedListIterator = r[Symbol.iterator](), this.setAsMemoized = i, this.sourceIterator = t;
+class A {
+  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++)
@@ -218,44 +207,41 @@ class D {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class T {
+class F {
   constructor(t) {
-    o(this, "memoizedSourceIterator");
+    i(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.memoizedSourceIterator.next();
   }
 }
-function $(e, t) {
+function P(e, t) {
   const r = e[Symbol.iterator]();
-  let i = 0;
-  for (let n = r.next(); n.done !== !0; n = r.next())
-    if (t(n.value, i++))
+  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 u(e);
+function u(e) {
+  return new n(e);
 }
-u.prototype.filter = function(e) {
-  return c(L(this.source(), e));
-};
-u.prototype.map = function(e) {
-  return c(k(this.source(), e));
+n.prototype.filter = function(e) {
+  return u(y(this.source, e));
 };
-u.prototype.materialize = function() {
-  return c(F(this.source()));
+n.prototype.map = function(e) {
+  return u(w(this.source, e));
 };
-u.prototype.max = function(e) {
-  return R(this.source(), e);
+n.prototype.materialize = function() {
+  return u(N(this.source));
 };
-u.prototype.memoize = function() {
-  return c(q(this.source()));
+n.prototype.memoize = function() {
+  return u(g(this.source));
 };
-u.prototype.some = function(e) {
-  return $(this.source(), e);
+n.prototype.some = function(e) {
+  return P(this.source, e);
 };
 export {
-  c as from
+  u as from
 };

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

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

package/dist/linqIterable.d.ts

@@ -2,6 +2,6 @@ export declare class LinqIterable<T> implements Iterable<T> {
     constructor(iterable: Iterable<T>);
     [Symbol.iterator](): Iterator<T, any, undefined>;
     private iterable;
-    source(): Iterable<T>;
     collectToArray(): T[];
+    get source(): Iterable<T>;
 }

package/dist/utils/index.d.ts

@@ -1 +1,2 @@
+export * from './iteratorResults';
 export * from './utils';

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "iterable-linq-utility",
-  "version": "0.0.3",
+  "version": "0.0.4",
   "description": "An Iterable mutation utility inspired by .net Linq and Javascript Array interface",
   "type": "module",
   "main": "./dist/my-lib.umd.cjs",
@@ -16,7 +16,7 @@
     "dist"
   ],
   "scripts": {
-    "build": "tsc && vite build",
+    "build": "tsc -p tsconfig.build.json && vite build",
     "dev": "vite",
     "lint": "eslint . --ext .js,.jsx,.ts,.tsx --ignore-path .eslintignore",
     "lint-fix": "eslint . --ext .js,.jsx,.ts,.tsx --fix --ignore-path .eslintignore",
@@ -49,6 +49,7 @@
     "typescript": "4.9.3",
     "vite": "3.2.4",
     "vite-plugin-dts": "1.7.1",
+    "vite-tsconfig-paths": "3.6.0",
     "vitest": "0.25.3"
   }
 }