iterable-linq-utility 0.0.7 → 0.0.9

package/dist/index.d.ts

@@ -1,3 +1,3 @@
-import { type ILinqIterable } from "./linqIterable";
+import { LinqIterableWrapper, type ILinqIterable } from "./linqIterable";
 export declare function from<T>(iterable: Iterable<T>): ILinqIterable<T>;
-export { ILinqIterable };
+export { ILinqIterable, LinqIterableWrapper };

package/dist/interable-linq-utility.js

@@ -1,44 +1,47 @@
-var I = Object.defineProperty;
-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);
+var w = Object.defineProperty;
+var b = (e, t, r) => t in e ? w(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
+var n = (e, t, r) => (b(e, typeof t != "symbol" ? t + "" : t, r), r);
+function y(e, t) {
+  return (r, i) => t(e(r, i), i);
 }
-function x(e, t) {
-  return (r, s) => e(r, s) && t(r, s);
+function p(e, t) {
+  return (r, i) => e(r, i) && t(r, i);
 }
-function m(e, t) {
+function z(e, t) {
   return {
     done: e,
     value: t
   };
 }
-function f() {
+function S() {
   return { done: !0, value: void 0 };
 }
-function w(e, t) {
-  return new c(e, t);
+function k(e) {
+  return typeof e == "function";
 }
-class c {
+function M(e, t) {
+  return new f(e, t);
+}
+class f {
   constructor(t, r) {
-    i(this, "predicate");
-    i(this, "source");
-    let s = r, n = t;
-    if (n instanceof c) {
-      const u = n.predicate;
-      n = n.source, s = x(u, s);
+    n(this, "predicate");
+    n(this, "source");
+    let i = r, s = t;
+    if (s instanceof f) {
+      const u = s.predicate;
+      s = s.source, i = p(u, i);
     }
-    this.source = n, this.predicate = s;
+    this.source = s, this.predicate = i;
   }
   [Symbol.iterator]() {
-    return new S(this.source, this.predicate);
+    return new L(this.source, this.predicate);
   }
 }
-class S {
+class L {
   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() {
@@ -49,60 +52,60 @@ class S {
     }
   }
 }
-function b(e, t) {
-  return new l(e, t);
+function v(e, t) {
+  return new m(e, t);
 }
-class l {
+class m {
   constructor(t, r) {
-    i(this, "mapper");
-    i(this, "source");
-    let s = r, n = t;
-    if (n instanceof l) {
-      const u = n.mapper;
-      n = n.source, s = z(u, s);
+    n(this, "mapper");
+    n(this, "source");
+    let i = r, s = t;
+    if (s instanceof m) {
+      const u = s.mapper;
+      s = s.source, i = y(u, i);
     }
-    this.source = t, this.mapper = s;
+    this.source = t, this.mapper = i;
   }
   [Symbol.iterator]() {
-    return new M(this.source, this.mapper);
+    return new N(this.source, this.mapper);
   }
 }
-class M {
+class N {
   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 ? m(!1, this.mapper(t.value, this.index++)) : f();
+    return t.done !== !0 ? z(!1, this.mapper(t.value, this.index++)) : S();
   }
 }
-function y(e) {
-  const t = e[Symbol.iterator](), r = new a();
-  for (let s = t.next(); s.done !== !0; s = t.next())
-    r.addLast(s.value);
+function A(e) {
+  const t = e[Symbol.iterator](), r = new h();
+  for (let i = t.next(); i.done !== !0; i = t.next())
+    r.addLast(i.value);
   return r;
 }
-class k {
+class F {
   constructor(t = null) {
-    i(this, "current", null);
+    n(this, "current", null);
     this.current = t;
   }
   next() {
     const t = this.current;
-    return t === null ? f() : (this.current = t.nextNode, m(!1, t.data));
+    return t === null ? S() : (this.current = t.nextNode, z(!1, t.data));
   }
 }
-class a {
+class h {
   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);
   }
   [Symbol.iterator]() {
-    return new k(this.head);
+    return new F(this.head);
   }
   addFirst(t) {
     const r = {
@@ -136,54 +139,54 @@ class a {
     return this.internalSize;
   }
 }
-function L(e) {
-  return e instanceof h ? e : new h(e);
+function g(e) {
+  return e instanceof I ? e : new I(e);
 }
-class h {
+class I {
   constructor(t) {
-    i(this, "source");
-    if (t instanceof a) {
+    n(this, "source");
+    if (t instanceof h) {
       this.source = t;
       return;
     }
-    this.source = y(t);
+    this.source = A(t);
   }
   [Symbol.iterator]() {
-    return new N(this.source);
+    return new P(this.source);
   }
 }
-class N {
+class P {
   constructor(t) {
-    i(this, "sourceIterator");
+    n(this, "sourceIterator");
     this.sourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.sourceIterator.next();
   }
 }
-function v(e) {
-  return e instanceof d ? e : new d(e);
+function R(e) {
+  return e instanceof x ? e : new x(e);
 }
-class d {
+class x {
   constructor(t) {
-    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);
+    n(this, "isMemoized", !1);
+    n(this, "sourceIterator");
+    n(this, "linkedList", new h());
+    n(this, "source");
+    this.source = t, this.sourceIterator = t[Symbol.iterator](), t instanceof h && (this.linkedList = t, this.isMemoized = !0);
   }
   [Symbol.iterator]() {
-    return this.isMemoized ? new g(this.linkedList) : new A(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
+    return this.isMemoized ? new T(this.linkedList) : new D(this.sourceIterator, this.linkedList, (t) => this.isMemoized = t.done === !0);
   }
 }
-class A {
-  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 = s, this.sourceIterator = t;
+class D {
+  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++)
@@ -192,26 +195,41 @@ class A {
     return this.setAsMemoized(t) || this.linkedList.addLast(t.value), t;
   }
 }
-class g {
+class T {
   constructor(t) {
-    i(this, "memoizedSourceIterator");
+    n(this, "memoizedSourceIterator");
     this.memoizedSourceIterator = t[Symbol.iterator]();
   }
   next() {
     return this.memoizedSourceIterator.next();
   }
 }
-function F(e, t) {
+function $(e, t) {
+  const r = e[Symbol.iterator]();
+  let i = r.next(), s = i.value, u = null;
+  for (t == null ? u = (o, a) => o < a ? -1 : o === a ? 0 : 1 : k(t) ? u = t : Array.isArray(t) ? u = (o, a) => {
+    let d = 0;
+    for (const l of t)
+      if (d = o[l] < a[l] ? -1 : o[l] === a[l] ? 0 : 1, d !== 0)
+        break;
+    return d;
+  } : u = (o, a) => o[t] < a[t] ? -1 : o[t] === a[t] ? 0 : 1, i = r.next(); i.done !== !0; i = r.next()) {
+    const o = u(s, i.value);
+    s = o < 0 || o === 0 ? s : i.value;
+  }
+  return s == null ? null : s;
+}
+function j(e, t) {
   const r = e[Symbol.iterator]();
-  let s = 0;
-  for (let n = r.next(); n.done !== !0; n = r.next())
-    if (t(n.value, s++))
+  let i = 0;
+  for (let s = r.next(); s.done !== !0; s = r.next())
+    if (t(s.value, i++))
       return !0;
   return !1;
 }
-class o {
+class c {
   constructor(t) {
-    i(this, "iterable");
+    n(this, "iterable");
     this.iterable = t;
   }
   [Symbol.iterator]() {
@@ -221,24 +239,28 @@ class o {
     return [...this.iterable];
   }
   filter(t) {
-    return new o(w(this.iterable, t));
+    return new c(M(this.iterable, t));
   }
   map(t) {
-    return new o(b(this.iterable, t));
+    return new c(v(this.iterable, t));
   }
   materialize() {
-    return new o(L(this.iterable));
+    return new c(g(this.iterable));
   }
   memoize() {
-    return new o(v(this.iterable));
+    return new c(R(this.iterable));
+  }
+  min(t) {
+    return $(this.iterable, t);
   }
   some(t) {
-    return F(this.iterable, t);
+    return j(this.iterable, t);
   }
 }
-function R(e) {
-  return new o(e);
+function C(e) {
+  return new c(e);
 }
 export {
-  R as from
+  c as LinqIterableWrapper,
+  C as from
 };

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

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

package/dist/linqIterable.d.ts

@@ -1,4 +1,4 @@
-import { Mapper, Predicate } from '@/types';
+import { Comparer, Mapper, Predicate } from '@/types';
 export interface ILinqIterable<T> {
     [Symbol.iterator](): Iterator<T, any, undefined>;
     collectToArray(): T[];
@@ -6,9 +6,10 @@ export interface ILinqIterable<T> {
     map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
     materialize(): ILinqIterable<T>;
     memoize(): ILinqIterable<T>;
+    min(comparer?: Comparer<T>): T | null | undefined;
     some(predicate: Predicate<T>): boolean;
 }
-export declare class LinqIterable<T> implements ILinqIterable<T> {
+export declare class LinqIterableWrapper<T> implements ILinqIterable<T> {
     constructor(iterable: Iterable<T>);
     [Symbol.iterator](): Iterator<T, any, undefined>;
     private iterable;
@@ -17,5 +18,6 @@ export declare class LinqIterable<T> implements ILinqIterable<T> {
     map<R>(mapper: Mapper<T, R>): ILinqIterable<R>;
     materialize(): ILinqIterable<T>;
     memoize(): ILinqIterable<T>;
+    min(comparer?: Comparer<T>): T | null | undefined;
     some(predicate: Predicate<T>): boolean;
 }

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/package.json

@@ -1,6 +1,6 @@
 {
   "name": "iterable-linq-utility",
-  "version": "0.0.7",
+  "version": "0.0.9",
   "description": "An Iterable mutation utility inspired by .net Linq and Javascript Array interface",
   "type": "module",
   "main": "./dist/interable-linq-utility.umd.cjs",
@@ -20,7 +20,7 @@
     "dev": "vite",
     "lint": "eslint . --ext .js,.jsx,.ts,.tsx --ignore-path .eslintignore",
     "lint-fix": "eslint . --ext .js,.jsx,.ts,.tsx --fix --ignore-path .eslintignore",
-    "test": "vitest",
+    "test": "vitest run",
     "test:coverage": "vitest run --coverage",
     "test:ui": "vitest --ui"
   },