iterable-linq-utility 0.0.2 → 0.0.3

package/README.md

@@ -1 +1 @@
-test
+Work in Progress

package/dist/combiners/index.d.ts

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

package/dist/combiners/mapper.d.ts

@@ -0,0 +1,2 @@
+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

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

package/dist/filter.d.ts

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

package/dist/interable-linq-utility.js

@@ -20,10 +20,7 @@ function b(e, t) {
   return (r, i) => t(e(r, i), i);
 }
 function w(e, t) {
-  return (r, i) => t(r, i) && e(r, i);
-}
-function L(e) {
-  return typeof e == "function";
+  return (r, i) => e(r, i) && t(r, i);
 }
 function f(e, t) {
   return {
@@ -34,7 +31,7 @@ function f(e, t) {
 function p() {
   return { done: !0, value: void 0 };
 }
-function M(e, t) {
+function L(e, t) {
   return new l(e, t);
 }
 class l {
@@ -49,10 +46,10 @@ class l {
     this.source = n, this.predicate = i;
   }
   [Symbol.iterator]() {
-    return new k(this.source, this.predicate);
+    return new M(this.source, this.predicate);
   }
 }
-class k {
+class M {
   constructor(t, r) {
     o(this, "index", 0);
     o(this, "sourceIterator");
@@ -67,7 +64,7 @@ class k {
     }
   }
 }
-function v(e, t) {
+function k(e, t) {
   return new h(e, t);
 }
 class h {
@@ -82,10 +79,10 @@ class h {
     this.source = t, this.mapper = i;
   }
   [Symbol.iterator]() {
-    return new N(this.source, this.mapper);
+    return new v(this.source, this.mapper);
   }
 }
-class N {
+class v {
   constructor(t, r) {
     o(this, "index", 0);
     o(this, "sourceIterator");
@@ -97,13 +94,13 @@ class N {
     return t.done !== !0 ? f(!1, this.mapper(t.value, this.index++)) : p();
   }
 }
-function A(e) {
+function N(e) {
   const t = e[Symbol.iterator](), r = new a();
   for (let i = t.next(); i.done !== !0; i = t.next())
     r.addLast(i.value);
   return r;
 }
-class F {
+class A {
   constructor(t = null) {
     o(this, "current", null);
     this.current = t;
@@ -120,7 +117,7 @@ class a {
     o(this, "tail", null);
   }
   [Symbol.iterator]() {
-    return new F(this.head);
+    return new A(this.head);
   }
   addFirst(t) {
     const r = {
@@ -154,7 +151,7 @@ class a {
     return this.internalSize;
   }
 }
-function g(e) {
+function F(e) {
   return e instanceof d ? e : new d(e);
 }
 class d {
@@ -164,13 +161,13 @@ class d {
       this.source = t;
       return;
     }
-    this.source = A(t);
+    this.source = N(t);
   }
   [Symbol.iterator]() {
-    return new P(this.source);
+    return new g(this.source);
   }
 }
-class P {
+class g {
   constructor(t) {
     o(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
@@ -179,10 +176,13 @@ class P {
     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 = L(t) ? t : (x, z) => x > z;
+  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;
@@ -239,13 +239,13 @@ function c(e) {
   return new u(e);
 }
 u.prototype.filter = function(e) {
-  return c(M(this.source(), e));
+  return c(L(this.source(), e));
 };
 u.prototype.map = function(e) {
-  return c(v(this.source(), e));
+  return c(k(this.source(), e));
 };
 u.prototype.materialize = function() {
-  return c(g(this.source()));
+  return c(F(this.source()));
 };
 u.prototype.max = function(e) {
   return R(this.source(), e);

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)=>t(r,n)&&e(r,n)}function z(e){return typeof e=="function"}function m(e,t){return{done:e,value:t}}function p(){return{done:!0,value:void 0}}function $(e){return e}function S(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 b(this.source,this.predicate)}}class b{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 w(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 L(this.source,this.mapper)}}class L{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 M(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 k{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 k(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 v(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=M(t)}[Symbol.iterator](){return new N(this.source)}}class N{constructor(t){i(this,"sourceIterator");this.sourceIterator=t[Symbol.iterator]()}next(){return this.sourceIterator.next()}}function g(e,t){const r=e[Symbol.iterator]();let n=0,o=r.next(),a=o.value;const R=z(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(S(this.source(),e))},s.prototype.map=function(e){return l(w(this.source(),e))},s.prototype.materialize=function(){return l(v(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,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"}})});

package/dist/map.d.ts

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

package/dist/{types.d.ts → types/comparer.d.ts}

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

package/dist/types/index.d.ts

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

package/dist/types/mapper.d.ts

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

package/dist/types/predicate.d.ts

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

package/dist/utils/index.d.ts

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

package/package.json

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

package/dist/min.d.ts

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

package/dist/utils/combiners.d.ts

@@ -1,2 +0,0 @@
-export declare function combineMappers<T, R, RR>(m1: (value: T, index: number) => R, m2: (value: R, index: number) => RR): (value: T, index: number) => RR;
-export declare function combinePredicates<T>(m1: (value: T, index: number) => boolean, m2: (value: T, index: number) => boolean): (value: T, index: number) => boolean;