@tempots/std 0.24.0 → 0.25.1

package/README.md

@@ -4,6 +4,8 @@ A comprehensive standard library for TypeScript that provides utility functions
 
 [![npm version](https://img.shields.io/npm/v/@tempots/std.svg)](https://www.npmjs.com/package/@tempots/std)
 [![license](https://img.shields.io/npm/l/@tempots/std.svg)](https://github.com/fponticelli/tempots/blob/main/LICENSE)
+[![codecov](https://codecov.io/gh/fponticelli/tempots/branch/main/graph/badge.svg)](https://codecov.io/gh/fponticelli/tempots)
+[![CI](https://github.com/fponticelli/tempots/workflows/CI/badge.svg)](https://github.com/fponticelli/tempots/actions)
 
 ## Installation
 

package/array.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./object.cjs"),B=r=>r.length>0?r[0]:void 0,k=r=>r.slice(1),E=(r,n,t)=>{if(r.length!==n.length)return!1;for(let e=0;e<r.length;e++)if(!t(r[e],n[e]))return!1;return!0},x=r=>r.length===0,F=r=>r.length>0,b=(r,n)=>{const t=[];for(let e=0;e<r.length;e++){const o=n(r[e],e);o!=null&&t.push(o)}return t},j=r=>r.filter(n=>n!=null),q=(r,n,t,e=!0)=>{if(r.length<n.length)return-1*(e?1:-1);if(r.length>n.length)return 1*(e?1:-1);for(let o=0;o<r.length;o++){const a=t(r[o],n[o]);if(a!==0)return a}return 0},g=(r,n)=>Array.from({length:r},(t,e)=>n(e)),P=(r,n=0)=>Array.from({length:r},(t,e)=>n+e),D=(r,n)=>g(r,()=>n),M=(r,n)=>{const t={};return r.forEach(e=>{t[n(e)]=e}),w.objectKeys(t).map(e=>t[e])},d=(r,n)=>{const t=r.indexOf(n);return t<0?!1:(r.splice(t,1),!0)},_=(r,n)=>{let t=!1;for(;d(r,n);)t=!0;return t},v=(r,n)=>{const t=r.findIndex(n);return t<0?!1:(r.splice(t,1),!0)},T=(r,n)=>{let t=!1;for(;v(r,n);)t=!0;return t},H=(r,n,t)=>{const e={removals:[],swaps:[],inserts:[]},{removals:o,inserts:a,swaps:f}=e,i=new Map;n.forEach((s,l)=>i.set(t(s),l));const c=r.map((s,l)=>[s,l]).filter(([s])=>!i.has(t(s))).map(([s,l])=>l);for(let s=c.length-1;s>=0;s--){const l=c[s],u=o.length>0?o[o.length-1]:void 0;u!=null&&u.at===l+1?(u.at--,u.qt++):o.push({at:l,qt:1})}const h=new Map;r.forEach((s,l)=>h.set(t(s),l));const m=n.map((s,l)=>[s,l]).filter(([s])=>!h.has(t(s))).map(([s,l])=>l);for(const s of m){const l=a.length>0?a[a.length-1]:void 0;l!=null&&l.at+l.values.length===s?l.values.push(n[s]):a.push({at:s,values:[n[s]]})}const p=r.filter((s,l)=>!c.includes(l)),y=new Map;for(let s=0;s<p.length;s++)y.set(t(p[s]),s);const A=n.filter((s,l)=>!m.includes(l));for(let s=0;s<A.length;s++){const l=t(A[s]),u=y.get(l);if(u==null||s===u)continue;const O=t(p[s]);y.delete(O),f.push({from:s,to:u})}return e},N=(r,n)=>{const t=[...n];for(const{at:e,qt:o}of r.removals)t.splice(e,o);for(const{from:e,to:o}of r.swaps){const a=t[o];t[o]=t[e],t[e]=a}for(const e of r.inserts)t.splice(e.at,0,...e.values);return t},S=(r,n=" and ",t=", ")=>r.length===0?"":r.length===1?String(r[0]):`${r.slice(0,-1).join(t)}${n}${String(r[r.length-1])}`,C=(r,n,t=!0)=>{const e=r.map((i,c)=>[i,c]);e.sort((i,c)=>n(i[0],c[0]));const o=new Array(e.length);let a=0,f=e[0][0];for(let i=0;i<e.length;i++){const[c,h]=e[i];n(c,f)!==0&&(a=i,f=c),o[h]=a,t&&a++}return o},I=(r,n)=>{if(n<=0)throw new Error("Chunk size must be positive");const t=[];for(let e=0;e<r.length;e+=n)t.push(r.slice(e,e+n));return t},$=(r,n)=>{const t=[],e=[];for(const o of r)n(o)?t.push(o):e.push(o);return[t,e]},V=(r,n)=>{const t={};for(const e of r){const o=n(e);t[o]?t[o].push(e):t[o]=[e]}return t};exports.applyArrayDiffOperations=N;exports.areArraysEqual=E;exports.arrayDiffOperations=H;exports.arrayHasValues=F;exports.arrayHead=B;exports.arrayTail=k;exports.buildArray=g;exports.chunk=I;exports.compareArrays=q;exports.fillArray=D;exports.filterMapArray=b;exports.filterNullsFromArray=j;exports.groupBy=V;exports.isArrayEmpty=x;exports.joinArrayWithConjunction=S;exports.partition=$;exports.range=P;exports.rankArray=C;exports.removeAllFromArray=_;exports.removeAllFromArrayByPredicate=T;exports.removeOneFromArray=d;exports.removeOneFromArrayByPredicate=v;exports.uniqueByPrimitive=M;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./object.cjs"),B=e=>e.length>0?e[0]:void 0,O=e=>e.slice(1),k=(e,n,t)=>{if(e.length!==n.length)return!1;for(let r=0;r<e.length;r++)if(!t(e[r],n[r]))return!1;return!0},E=e=>e.length===0,F=e=>e.length>0,b=(e,n)=>{const t=[];for(let r=0;r<e.length;r++){const s=n(e[r],r);s!=null&&t.push(s)}return t},j=e=>e.filter(n=>n!=null),q=(e,n,t,r=!0)=>{if(e.length<n.length)return-1*(r?1:-1);if(e.length>n.length)return 1*(r?1:-1);for(let s=0;s<e.length;s++){const a=t(e[s],n[s]);if(a!==0)return a}return 0},d=(e,n)=>Array.from({length:e},(t,r)=>n(r)),S=(e,n=0)=>Array.from({length:e},(t,r)=>n+r),I=(e,n)=>d(e,()=>n),P=(e,n)=>{const t={};return e.forEach(r=>{t[n(r)]=r}),w.objectKeys(t).map(r=>t[r])},D=(e,n)=>{const t=e.indexOf(n);return t<0?!1:(e.splice(t,1),!0)},M=(e,n)=>{let t=0,r=!1;for(let s=0;s<e.length;s++)e[s]!==n?(e[t]=e[s],t++):r=!0;return e.length=t,r},_=(e,n)=>{const t=e.findIndex(n);return t<0?!1:(e.splice(t,1),!0)},T=(e,n)=>{let t=0,r=!1;for(let s=0;s<e.length;s++)n(e[s])?r=!0:(e[t]=e[s],t++);return e.length=t,r},H=(e,n,t)=>{const r={removals:[],swaps:[],inserts:[]},{removals:s,inserts:a,swaps:u}=r,i=new Map;n.forEach((o,l)=>i.set(t(o),l));const c=e.map((o,l)=>[o,l]).filter(([o])=>!i.has(t(o))).map(([o,l])=>l);for(let o=c.length-1;o>=0;o--){const l=c[o],f=s.length>0?s[s.length-1]:void 0;f!=null&&f.at===l+1?(f.at--,f.qt++):s.push({at:l,qt:1})}const h=new Map;e.forEach((o,l)=>h.set(t(o),l));const m=n.map((o,l)=>[o,l]).filter(([o])=>!h.has(t(o))).map(([o,l])=>l);for(const o of m){const l=a.length>0?a[a.length-1]:void 0;l!=null&&l.at+l.values.length===o?l.values.push(n[o]):a.push({at:o,values:[n[o]]})}const g=new Set(c),v=new Set(m),p=e.filter((o,l)=>!g.has(l)),y=new Map;for(let o=0;o<p.length;o++)y.set(t(p[o]),o);const A=n.filter((o,l)=>!v.has(l));for(let o=0;o<A.length;o++){const l=t(A[o]),f=y.get(l);if(f==null||o===f)continue;const x=t(p[o]);y.delete(x),u.push({from:o,to:f})}return r},N=(e,n)=>{const t=[...n];for(const{at:r,qt:s}of e.removals)t.splice(r,s);for(const{from:r,to:s}of e.swaps){const a=t[s];t[s]=t[r],t[r]=a}for(const r of e.inserts)t.splice(r.at,0,...r.values);return t},C=(e,n=" and ",t=", ")=>e.length===0?"":e.length===1?String(e[0]):`${e.slice(0,-1).join(t)}${n}${String(e[e.length-1])}`,$=(e,n,t=!0)=>{const r=e.map((i,c)=>[i,c]);r.sort((i,c)=>n(i[0],c[0]));const s=new Array(r.length);let a=0,u=r[0][0];for(let i=0;i<r.length;i++){const[c,h]=r[i];n(c,u)!==0&&(a=i,u=c),s[h]=a,t&&a++}return s},V=(e,n)=>{if(n<=0)throw new Error("Chunk size must be positive");const t=[];for(let r=0;r<e.length;r+=n)t.push(e.slice(r,r+n));return t},W=(e,n)=>{const t=[],r=[];for(const s of e)n(s)?t.push(s):r.push(s);return[t,r]},R=(e,n)=>{const t={};for(const r of e){const s=n(r);t[s]?t[s].push(r):t[s]=[r]}return t};exports.applyArrayDiffOperations=N;exports.areArraysEqual=k;exports.arrayDiffOperations=H;exports.arrayHasValues=F;exports.arrayHead=B;exports.arrayTail=O;exports.buildArray=d;exports.chunk=V;exports.compareArrays=q;exports.fillArray=I;exports.filterMapArray=b;exports.filterNullsFromArray=j;exports.groupBy=R;exports.isArrayEmpty=E;exports.joinArrayWithConjunction=C;exports.partition=W;exports.range=S;exports.rankArray=$;exports.removeAllFromArray=M;exports.removeAllFromArrayByPredicate=T;exports.removeOneFromArray=D;exports.removeOneFromArrayByPredicate=_;exports.uniqueByPrimitive=P;

package/array.js

@@ -1,140 +1,140 @@
-import { objectKeys as d } from "./object.js";
-const E = (t) => t.length > 0 ? t[0] : void 0, B = (t) => t.slice(1), O = (t, r, e) => {
-  if (t.length !== r.length) return !1;
+import { objectKeys as x } from "./object.js";
+const B = (t) => t.length > 0 ? t[0] : void 0, E = (t) => t.slice(1), I = (t, s, e) => {
+  if (t.length !== s.length) return !1;
   for (let n = 0; n < t.length; n++)
-    if (!e(t[n], r[n])) return !1;
+    if (!e(t[n], s[n])) return !1;
   return !0;
-}, _ = (t) => t.length === 0, q = (t) => t.length > 0, b = (t, r) => {
+}, O = (t) => t.length === 0, S = (t) => t.length > 0, _ = (t, s) => {
   const e = [];
   for (let n = 0; n < t.length; n++) {
-    const o = r(t[n], n);
-    o != null && e.push(o);
+    const r = s(t[n], n);
+    r != null && e.push(r);
   }
   return e;
-}, j = (t) => t.filter((r) => r != null), D = (t, r, e, n = !0) => {
-  if (t.length < r.length)
+}, q = (t) => t.filter((s) => s != null), b = (t, s, e, n = !0) => {
+  if (t.length < s.length)
     return -1 * (n ? 1 : -1);
-  if (t.length > r.length)
+  if (t.length > s.length)
     return 1 * (n ? 1 : -1);
-  for (let o = 0; o < t.length; o++) {
-    const i = e(t[o], r[o]);
+  for (let r = 0; r < t.length; r++) {
+    const i = e(t[r], s[r]);
     if (i !== 0) return i;
   }
   return 0;
-}, v = (t, r) => Array.from({ length: t }, (e, n) => r(n)), F = (t, r = 0) => Array.from({ length: t }, (e, n) => r + n), M = (t, r) => v(t, () => r), I = (t, r) => {
+}, w = (t, s) => Array.from({ length: t }, (e, n) => s(n)), j = (t, s = 0) => Array.from({ length: t }, (e, n) => s + n), D = (t, s) => w(t, () => s), F = (t, s) => {
   const e = {};
   return t.forEach((n) => {
-    e[r(n)] = n;
-  }), d(e).map((n) => e[n]);
-}, w = (t, r) => {
-  const e = t.indexOf(r);
+    e[s(n)] = n;
+  }), x(e).map((n) => e[n]);
+}, M = (t, s) => {
+  const e = t.indexOf(s);
   return e < 0 ? !1 : (t.splice(e, 1), !0);
-}, N = (t, r) => {
-  let e = !1;
-  for (; w(t, r); )
-    e = !0;
-  return e;
-}, x = (t, r) => {
-  const e = t.findIndex(r);
+}, N = (t, s) => {
+  let e = 0, n = !1;
+  for (let r = 0; r < t.length; r++)
+    t[r] !== s ? (t[e] = t[r], e++) : n = !0;
+  return t.length = e, n;
+}, P = (t, s) => {
+  const e = t.findIndex(s);
   return e < 0 ? !1 : (t.splice(e, 1), !0);
-}, P = (t, r) => {
-  let e = !1;
-  for (; x(t, r); )
-    e = !0;
-  return e;
-}, T = (t, r, e) => {
+}, T = (t, s) => {
+  let e = 0, n = !1;
+  for (let r = 0; r < t.length; r++)
+    s(t[r]) ? n = !0 : (t[e] = t[r], e++);
+  return t.length = e, n;
+}, $ = (t, s, e) => {
   const n = {
     removals: [],
     swaps: [],
     inserts: []
-  }, { removals: o, inserts: i, swaps: u } = n, c = /* @__PURE__ */ new Map();
-  r.forEach((s, l) => c.set(e(s), l));
-  const a = t.map((s, l) => [s, l]).filter(([s]) => !c.has(e(s))).map(([s, l]) => l);
-  for (let s = a.length - 1; s >= 0; s--) {
-    const l = a[s], f = o.length > 0 ? o[o.length - 1] : void 0;
-    f != null && f.at === l + 1 ? (f.at--, f.qt++) : o.push({ at: l, qt: 1 });
+  }, { removals: r, inserts: i, swaps: u } = n, c = /* @__PURE__ */ new Map();
+  s.forEach((o, l) => c.set(e(o), l));
+  const f = t.map((o, l) => [o, l]).filter(([o]) => !c.has(e(o))).map(([o, l]) => l);
+  for (let o = f.length - 1; o >= 0; o--) {
+    const l = f[o], a = r.length > 0 ? r[r.length - 1] : void 0;
+    a != null && a.at === l + 1 ? (a.at--, a.qt++) : r.push({ at: l, qt: 1 });
   }
   const h = /* @__PURE__ */ new Map();
-  t.forEach((s, l) => h.set(e(s), l));
-  const g = r.map((s, l) => [s, l]).filter(([s]) => !h.has(e(s))).map(([s, l]) => l);
-  for (const s of g) {
+  t.forEach((o, l) => h.set(e(o), l));
+  const g = s.map((o, l) => [o, l]).filter(([o]) => !h.has(e(o))).map(([o, l]) => l);
+  for (const o of g) {
     const l = i.length > 0 ? i[i.length - 1] : void 0;
-    l != null && l.at + l.values.length === s ? l.values.push(r[s]) : i.push({ at: s, values: [r[s]] });
+    l != null && l.at + l.values.length === o ? l.values.push(s[o]) : i.push({ at: o, values: [s[o]] });
   }
-  const p = t.filter((s, l) => !a.includes(l)), m = /* @__PURE__ */ new Map();
-  for (let s = 0; s < p.length; s++)
-    m.set(e(p[s]), s);
-  const y = r.filter((s, l) => !g.includes(l));
-  for (let s = 0; s < y.length; s++) {
-    const l = e(y[s]), f = m.get(l);
-    if (f == null || s === f) continue;
-    const A = e(p[s]);
-    m.delete(A), u.push({ from: s, to: f });
+  const y = new Set(f), A = new Set(g), p = t.filter((o, l) => !y.has(l)), m = /* @__PURE__ */ new Map();
+  for (let o = 0; o < p.length; o++)
+    m.set(e(p[o]), o);
+  const d = s.filter((o, l) => !A.has(l));
+  for (let o = 0; o < d.length; o++) {
+    const l = e(d[o]), a = m.get(l);
+    if (a == null || o === a) continue;
+    const v = e(p[o]);
+    m.delete(v), u.push({ from: o, to: a });
   }
   return n;
-}, $ = (t, r) => {
-  const e = [...r];
-  for (const { at: n, qt: o } of t.removals)
-    e.splice(n, o);
-  for (const { from: n, to: o } of t.swaps) {
-    const i = e[o];
-    e[o] = e[n], e[n] = i;
+}, C = (t, s) => {
+  const e = [...s];
+  for (const { at: n, qt: r } of t.removals)
+    e.splice(n, r);
+  for (const { from: n, to: r } of t.swaps) {
+    const i = e[r];
+    e[r] = e[n], e[n] = i;
   }
   for (const n of t.inserts)
     e.splice(n.at, 0, ...n.values);
   return e;
-}, C = (t, r = " and ", e = ", ") => t.length === 0 ? "" : t.length === 1 ? String(t[0]) : `${t.slice(0, -1).join(e)}${r}${String(t[t.length - 1])}`, H = (t, r, e = !0) => {
-  const n = t.map((c, a) => [c, a]);
-  n.sort((c, a) => r(c[0], a[0]));
-  const o = new Array(n.length);
+}, H = (t, s = " and ", e = ", ") => t.length === 0 ? "" : t.length === 1 ? String(t[0]) : `${t.slice(0, -1).join(e)}${s}${String(t[t.length - 1])}`, R = (t, s, e = !0) => {
+  const n = t.map((c, f) => [c, f]);
+  n.sort((c, f) => s(c[0], f[0]));
+  const r = new Array(n.length);
   let i = 0, u = n[0][0];
   for (let c = 0; c < n.length; c++) {
-    const [a, h] = n[c];
-    r(a, u) !== 0 && (i = c, u = a), o[h] = i, e && i++;
+    const [f, h] = n[c];
+    s(f, u) !== 0 && (i = c, u = f), r[h] = i, e && i++;
   }
-  return o;
-}, S = (t, r) => {
-  if (r <= 0)
+  return r;
+}, V = (t, s) => {
+  if (s <= 0)
     throw new Error("Chunk size must be positive");
   const e = [];
-  for (let n = 0; n < t.length; n += r)
-    e.push(t.slice(n, n + r));
+  for (let n = 0; n < t.length; n += s)
+    e.push(t.slice(n, n + s));
   return e;
-}, R = (t, r) => {
+}, W = (t, s) => {
   const e = [], n = [];
-  for (const o of t)
-    r(o) ? e.push(o) : n.push(o);
+  for (const r of t)
+    s(r) ? e.push(r) : n.push(r);
   return [e, n];
-}, V = (t, r) => {
+}, G = (t, s) => {
   const e = {};
   for (const n of t) {
-    const o = r(n);
-    e[o] ? e[o].push(n) : e[o] = [n];
+    const r = s(n);
+    e[r] ? e[r].push(n) : e[r] = [n];
   }
   return e;
 };
 export {
-  $ as applyArrayDiffOperations,
-  O as areArraysEqual,
-  T as arrayDiffOperations,
-  q as arrayHasValues,
-  E as arrayHead,
-  B as arrayTail,
-  v as buildArray,
-  S as chunk,
-  D as compareArrays,
-  M as fillArray,
-  b as filterMapArray,
-  j as filterNullsFromArray,
-  V as groupBy,
-  _ as isArrayEmpty,
-  C as joinArrayWithConjunction,
-  R as partition,
-  F as range,
-  H as rankArray,
+  C as applyArrayDiffOperations,
+  I as areArraysEqual,
+  $ as arrayDiffOperations,
+  S as arrayHasValues,
+  B as arrayHead,
+  E as arrayTail,
+  w as buildArray,
+  V as chunk,
+  b as compareArrays,
+  D as fillArray,
+  _ as filterMapArray,
+  q as filterNullsFromArray,
+  G as groupBy,
+  O as isArrayEmpty,
+  H as joinArrayWithConjunction,
+  W as partition,
+  j as range,
+  R as rankArray,
   N as removeAllFromArray,
-  P as removeAllFromArrayByPredicate,
-  w as removeOneFromArray,
-  x as removeOneFromArrayByPredicate,
-  I as uniqueByPrimitive
+  T as removeAllFromArrayByPredicate,
+  M as removeOneFromArray,
+  P as removeOneFromArrayByPredicate,
+  F as uniqueByPrimitive
 };

package/async-result.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u={notAsked:{type:"NotAsked"},loading(e=void 0){return{type:"Loading",previousValue:e}},success(e){return{type:"AsyncSuccess",value:e}},failure(e){return{type:"AsyncFailure",error:e}},isSuccess(e){return e.type==="AsyncSuccess"},isFailure(e){return e.type==="AsyncFailure"},isNotAsked(e){return e.type==="NotAsked"},isLoading(e){return e.type==="Loading"},getOrElse(e,s){return u.isSuccess(e)?e.value:s},getOrElseLazy(e,s){return u.isSuccess(e)?e.value:s()},getOrNull(e){return u.isSuccess(e)?e.value:null},getOrUndefined(e){return u.isSuccess(e)?e.value:void 0},getUnsafe:e=>{if(u.isSuccess(e))return e.value;throw u.isFailure(e)?e.error:new Error("Cannot get value from a not-asked or loading result")},match:(e,{success:s,failure:r,loading:t,notAsked:n=t})=>u.isSuccess(e)?s(e.value):u.isFailure(e)?r(e.error):u.isNotAsked(e)?n():t(e.previousValue),whenSuccess:(e,s)=>(u.isSuccess(e)&&s(e.value),e),whenFailure:(e,s)=>(u.isFailure(e)&&s(e.error),e),equals:(e,s,r={valueEquals:(t,n)=>t===n,errorEquals:(t,n)=>t===n})=>e.type==="AsyncSuccess"&&s.type==="AsyncSuccess"?r.valueEquals(e.value,s.value):e.type==="AsyncFailure"&&s.type==="AsyncFailure"?r.errorEquals(e.error,s.error):e.type==="Loading"&&s.type==="Loading"?r.valueEquals(e.previousValue,s.previousValue):e.type==="NotAsked"&&s.type==="NotAsked",all:e=>{const s=[];for(const r of e)if(u.isSuccess(r))s.push(r.value);else return r;return u.success(s)},ofPromise:async e=>{try{const s=await e;return u.success(s)}catch(s){return u.failure(s instanceof Error?s:new Error(String(s)))}}};exports.AsyncResult=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s={notAsked:{type:"NotAsked"},loading(e=void 0){return{type:"Loading",previousValue:e}},success(e){return{type:"AsyncSuccess",value:e}},failure(e){return{type:"AsyncFailure",error:e}},isSuccess(e){return e.type==="AsyncSuccess"},isFailure(e){return e.type==="AsyncFailure"},isNotAsked(e){return e.type==="NotAsked"},isLoading(e){return e.type==="Loading"},getOrElse(e,r){return s.isSuccess(e)?e.value:r},getOrElseLazy(e,r){return s.isSuccess(e)?e.value:r()},getOrNull(e){return s.isSuccess(e)?e.value:null},getOrUndefined(e){return s.isSuccess(e)?e.value:void 0},getUnsafe:e=>{if(s.isSuccess(e))return e.value;throw s.isFailure(e)?e.error:new Error("Cannot get value from a not-asked or loading result")},match:(e,{success:r,failure:u,loading:a,notAsked:c=a})=>s.isSuccess(e)?r(e.value):s.isFailure(e)?u(e.error):s.isNotAsked(e)?c():a(e.previousValue),effect:(e,r)=>{switch(e.type){case"AsyncSuccess":r.success?.(e.value);break;case"AsyncFailure":r.failure?.(e.error);break;case"Loading":r.loading?.(e.previousValue);break;case"NotAsked":r.notAsked?.();break}return e},whenSuccess:(e,r)=>(s.isSuccess(e)&&r(e.value),e),whenFailure:(e,r)=>(s.isFailure(e)&&r(e.error),e),equals:(e,r,u={valueEquals:(a,c)=>a===c,errorEquals:(a,c)=>a===c})=>e.type==="AsyncSuccess"&&r.type==="AsyncSuccess"?u.valueEquals(e.value,r.value):e.type==="AsyncFailure"&&r.type==="AsyncFailure"?u.errorEquals(e.error,r.error):e.type==="Loading"&&r.type==="Loading"?u.valueEquals(e.previousValue,r.previousValue):e.type==="NotAsked"&&r.type==="NotAsked",all:e=>{const r=[];for(const u of e)if(s.isSuccess(u))r.push(u.value);else return u;return s.success(r)},ofPromise:async e=>{try{const r=await e;return s.success(r)}catch(r){return s.failure(r instanceof Error?r:new Error(String(r)))}},map:(e,r)=>{switch(e.type){case"AsyncSuccess":return s.success(r(e.value));case"NotAsked":return s.notAsked;case"AsyncFailure":return s.failure(e.error);case"Loading":return s.loading(e.previousValue!=null?r(e.previousValue):void 0)}},flatMap:(e,r)=>{switch(e.type){case"AsyncSuccess":return r(e.value);case"NotAsked":return s.notAsked;case"AsyncFailure":return s.failure(e.error);case"Loading":return s.loading()}},mapError:(e,r)=>{switch(e.type){case"AsyncSuccess":return s.success(e.value);case"NotAsked":return s.notAsked;case"AsyncFailure":return s.failure(r(e.error));case"Loading":return s.loading(e.previousValue)}},flatMapError:(e,r)=>{switch(e.type){case"AsyncSuccess":return s.success(e.value);case"NotAsked":return s.notAsked;case"AsyncFailure":return r(e.error);case"Loading":return s.loading(e.previousValue)}},toResult:e=>{switch(e.type){case"AsyncSuccess":return{type:"Success",value:e.value};case"AsyncFailure":return{type:"Failure",error:e.error};case"NotAsked":case"Loading":return}},isSettled(e){return e.type==="AsyncSuccess"||e.type==="AsyncFailure"},recover:(e,r)=>{switch(e.type){case"AsyncSuccess":return s.success(e.value);case"NotAsked":return s.notAsked;case"AsyncFailure":return s.success(r(e.error));case"Loading":return s.loading(e.previousValue)}},ap:(e,r)=>s.isSuccess(e)&&s.isSuccess(r)?s.success(e.value(r.value)):s.isFailure(e)?s.failure(e.error):s.isFailure(r)?s.failure(r.error):s.isLoading(e)||s.isLoading(r)?s.loading():s.notAsked,map2:(e,r,u)=>s.isSuccess(e)&&s.isSuccess(r)?s.success(u(e.value,r.value)):s.isFailure(e)?s.failure(e.error):s.isFailure(r)?s.failure(r.error):s.isLoading(e)||s.isLoading(r)?s.loading():s.notAsked,map3:(e,r,u,a)=>s.isSuccess(e)&&s.isSuccess(r)&&s.isSuccess(u)?s.success(a(e.value,r.value,u.value)):s.isFailure(e)?s.failure(e.error):s.isFailure(r)?s.failure(r.error):s.isFailure(u)?s.failure(u.error):s.isLoading(e)||s.isLoading(r)||s.isLoading(u)?s.loading():s.notAsked};exports.AsyncResult=s;

package/async-result.d.ts

@@ -169,6 +169,20 @@ export declare const AsyncResult: {
         loading: (previousValue?: V1) => V2;
         notAsked: () => V2;
     }) => V2;
+    /**
+     * Executes side effects based on the state of the result.
+     * Unlike `match`, all handlers are optional, allowing you to react only to specific states.
+     * @param r - The result.
+     * @param handlers - An object with optional handlers for each state.
+     * @returns The result that was passed in, allowing for chaining.
+     * @public
+     */
+    effect: <V, E>(r: AsyncResult<V, E>, handlers: {
+        success?: (value: V) => void;
+        failure?: (error: E) => void;
+        loading?: (previousValue?: V) => void;
+        notAsked?: () => void;
+    }) => AsyncResult<V, E>;
     /**
      * When the result is a success, it applies the function to the value.
      *
@@ -210,4 +224,92 @@ export declare const AsyncResult: {
      * @returns A Promise that resolves to an AsyncResult.
      */
     ofPromise: <V>(p: Promise<V>) => Promise<AsyncResult<V, Error>>;
+    /**
+     * Maps the value of a successful `AsyncResult` to a new value using the provided function.
+     * For other states (NotAsked, Loading, Failure), the state is preserved.
+     * When mapping a Loading state with a previous value, the previous value is also mapped.
+     * @param result - The `AsyncResult` to map.
+     * @param fn - The mapping function to apply to the success value.
+     * @returns A new `AsyncResult` with the mapped value if successful, otherwise the original state.
+     * @public
+     */
+    map: <V, U, E>(result: AsyncResult<V, E>, fn: (value: V) => U) => AsyncResult<U, E>;
+    /**
+     * Maps the value of a successful `AsyncResult` to a new `AsyncResult` using the provided function.
+     * This is useful for chaining operations that may also fail.
+     * @param result - The `AsyncResult` to flat map.
+     * @param fn - The mapping function that returns a new `AsyncResult`.
+     * @returns The result of the mapping function if successful, otherwise the original state.
+     * @public
+     */
+    flatMap: <V, U, E>(result: AsyncResult<V, E>, fn: (value: V) => AsyncResult<U, E>) => AsyncResult<U, E>;
+    /**
+     * Maps the error of a failed `AsyncResult` to a new error using the provided function.
+     * For other states, the state is preserved.
+     * @param result - The `AsyncResult` to map the error of.
+     * @param fn - The mapping function to apply to the error.
+     * @returns A new `AsyncResult` with the mapped error if failed, otherwise the original state.
+     * @public
+     */
+    mapError: <V, E, F>(result: AsyncResult<V, E>, fn: (error: E) => F) => AsyncResult<V, F>;
+    /**
+     * Maps the error of a failed `AsyncResult` to a new `AsyncResult` using the provided function.
+     * This allows recovery from errors by returning a new successful result.
+     * @param result - The `AsyncResult` to recover from.
+     * @param fn - The recovery function that returns a new `AsyncResult`.
+     * @returns The result of the recovery function if failed, otherwise the original state.
+     * @public
+     */
+    flatMapError: <V, E, F>(result: AsyncResult<V, E>, fn: (error: E) => AsyncResult<V, F>) => AsyncResult<V, F>;
+    /**
+     * Converts an `AsyncResult` to a `Result`, discarding the loading and not-asked states.
+     * Returns `undefined` if the result is not settled (i.e., NotAsked or Loading).
+     * @param result - The `AsyncResult` to convert.
+     * @returns A `Result` if the `AsyncResult` is settled, otherwise `undefined`.
+     * @public
+     */
+    toResult: <V, E>(result: AsyncResult<V, E>) => import('./result').Result<V, E> | undefined;
+    /**
+     * Checks if the result is settled (either success or failure).
+     * @param r - The result.
+     * @returns `true` if the result is settled; otherwise, `false`.
+     * @public
+     */
+    isSettled<V, E>(r: AsyncResult<V, E>): r is Settled<V, E>;
+    /**
+     * Recovers from a failure by providing an alternative value.
+     * @param result - The `AsyncResult` to recover from.
+     * @param fn - The function that provides an alternative value given the error.
+     * @returns A successful `AsyncResult` with the alternative value if failed, otherwise the original state.
+     * @public
+     */
+    recover: <V, E>(result: AsyncResult<V, E>, fn: (error: E) => V) => AsyncResult<V, never>;
+    /**
+     * Applies a function wrapped in an `AsyncResult` to a value wrapped in an `AsyncResult`.
+     * Useful for applying multiple arguments to a function in a safe way.
+     * @param resultFn - The `AsyncResult` containing the function.
+     * @param resultVal - The `AsyncResult` containing the value.
+     * @returns A new `AsyncResult` with the result of applying the function to the value.
+     * @public
+     */
+    ap: <V, U, E>(resultFn: AsyncResult<(v: V) => U, E>, resultVal: AsyncResult<V, E>) => AsyncResult<U, E>;
+    /**
+     * Maps two `AsyncResult` values using a function.
+     * @param r1 - The first `AsyncResult`.
+     * @param r2 - The second `AsyncResult`.
+     * @param fn - The function to apply to both values.
+     * @returns A new `AsyncResult` with the result of applying the function to both values.
+     * @public
+     */
+    map2: <V1, V2, U, E>(r1: AsyncResult<V1, E>, r2: AsyncResult<V2, E>, fn: (v1: V1, v2: V2) => U) => AsyncResult<U, E>;
+    /**
+     * Maps three `AsyncResult` values using a function.
+     * @param r1 - The first `AsyncResult`.
+     * @param r2 - The second `AsyncResult`.
+     * @param r3 - The third `AsyncResult`.
+     * @param fn - The function to apply to all three values.
+     * @returns A new `AsyncResult` with the result of applying the function to all three values.
+     * @public
+     */
+    map3: <V1, V2, V3, U, E>(r1: AsyncResult<V1, E>, r2: AsyncResult<V2, E>, r3: AsyncResult<V3, E>, fn: (v1: V1, v2: V2, v3: V3) => U) => AsyncResult<U, E>;
 };