npm - @backendkit-labs/result - Versions diffs - 0.1.0 → 0.1.1 - Mend

@backendkit-labs/result 0.1.0 → 0.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (8) hide show

package/README.md CHANGED Viewed

@@ -587,7 +587,7 @@ const result = await retry(
 ### `retryWithBackoff(fn, options)`
-Exponential backoff: delay doubles on each retry, capped at `maxDelayMs`.
+Exponential backoff: delay doubles on each retry, capped at `maxDelayMs`. Supports **jitter** to prevent thundering herd when multiple instances retry simultaneously.
 ```typescript
 import { retryWithBackoff, run } from '@backendkit-labs/result';
@@ -616,6 +616,37 @@ const result = await retryWithBackoff(
 );
 ```
+#### Jitter
+When many instances of your service fail at the same time (e.g. a downstream goes down), they all retry on the same schedule — creating a synchronized spike that can overwhelm the recovering service. Jitter spreads those retries across time.
+```typescript
+// Full jitter — delay = random(0, computedDelay)
+// Maximum spread. Best for high-concurrency scenarios (many parallel clients).
+await retryWithBackoff(() => run(() => callApi()), {
+  attempts:   4,
+  delayMs:    500,
+  maxDelayMs: 10_000,
+  jitter:     true,
+});
+// Partial jitter — delay ± (computedDelay × factor)
+// Keeps delays close to the backoff curve while adding noise.
+// 0.25 = ±25%: a computed 1000ms delay becomes 750ms–1250ms.
+await retryWithBackoff(() => run(() => callApi()), {
+  attempts:   4,
+  delayMs:    500,
+  maxDelayMs: 10_000,
+  jitter:     0.25,
+});
+```
+| `jitter` value | Behaviour | Use when |
+|---|---|---|
+| `false` / omitted | No randomness — deterministic delays | Tests, single-instance services |
+| `true` | Full jitter: `random(0, delay)` | Many parallel clients retrying the same service |
+| `0.0–1.0` | Partial jitter: `delay ± (delay × factor)` | You want backoff shape preserved with light noise |
 ### `withTimeout(fn, ms, timeoutError)`
 Races a Result-returning function against a deadline.

package/dist/index.cjs CHANGED Viewed

@@ -150,11 +150,7 @@ async function retryWithBackoff(fn, options) {
     if (attempt === options.attempts) break;
     if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;
     options.onRetry?.(last.error, attempt);
-    const delay = Math.min(
-      (options.delayMs ?? 100) * Math.pow(2, attempt - 1),
-      options.maxDelayMs ?? 3e4
-    );
-    await sleep(delay);
+    await sleep(computeBackoffDelay(attempt, options));
   }
   return last;
 }
@@ -164,6 +160,17 @@ async function withTimeout(fn, ms, timeoutError) {
   );
   return Promise.race([fn(), timer]);
 }
+function computeBackoffDelay(attempt, options) {
+  const base = (options.delayMs ?? 100) * Math.pow(2, attempt - 1);
+  const capped = Math.min(base, options.maxDelayMs ?? 3e4);
+  const { jitter } = options;
+  if (!jitter) return capped;
+  if (jitter === true) {
+    return Math.random() * capped;
+  }
+  const noise = (Math.random() * 2 - 1) * capped * jitter;
+  return Math.max(0, Math.min(capped + noise, options.maxDelayMs ?? 3e4));
+}
 var sleep = (ms) => new Promise((r) => setTimeout(r, ms));
 // src/result/combinators.ts

package/dist/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/result/constructors.ts","../src/result/guards.ts","../src/result/operations.ts","../src/result/run.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";;;AAGO,IAAM,KAAK,CAAe,KAAA,MAC9B,EAAE,EAAA,EAAI,MAAM,KAAA,EAAM;AAGd,IAAM,OAAO,CAAuB,KAAA,MACxC,EAAE,EAAA,EAAI,OAAO,KAAA,EAAM;AASf,SAAS,aAAA,CACd,IACA,cAAA,EACc;AACd,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,IAAI,CAAA;AAAA,EAChB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,WAAA,CACpB,SACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AAAA,EACzB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AASO,SAAS,YAAA,CACd,OACA,KAAA,EACc;AACd,EAAA,OAAO,SAAS,IAAA,GAAO,EAAA,CAAG,KAAK,CAAA,GAAI,KAAK,KAAK,CAAA;AAC/C;;;ACnDO,SAAS,KAAW,MAAA,EAAgD;AACzE,EAAA,OAAO,OAAO,EAAA,KAAO,IAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,OAAO,EAAA,KAAO,KAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,YAAA,IAAgB,MAAA;AACzB;;;ACZO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAK,EAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAAS,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AACnD;AAGO,SAAS,OAAA,CACd,QACA,EAAA,EACc;AACd,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,MAAA;AACxC;AAGA,eAAsB,YAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,OAAO,MAAA,CAAO,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC9D;AAGA,eAAsB,QAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC7C,EAAA,OAAO,EAAA,CAAG,MAAM,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAClC;AAaO,SAAS,KAAA,CACd,QACA,QAAA,EACG;AACH,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,QAAA,CAAS,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC3E;AAGO,IAAM,IAAA,GAAO;AAKb,SAAS,GAAA,CAAU,QAAsB,EAAA,EAAsC;AACpF,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA;AAC9B,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,QAAA,CAAe,QAAsB,EAAA,EAAsC;AACzF,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,OAAO,KAAK,CAAA;AAC/B,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,OAAa,MAAA,EAAyB;AACpD,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,MAAA,CAAO,KAAA,YAAiB,KAAA,GAAQ,MAAA,CAAO,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AACrF;AAGO,SAAS,YAAkB,MAAA,EAAyB;AACzD,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC9B,EAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AACtD;AAGO,SAAS,QAAA,CAAe,QAAsB,YAAA,EAAoB;AACvE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,YAAA;AACpC;AAGO,SAAS,YAAA,CAAmB,QAAsB,EAAA,EAAwB;AAC/E,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,EAAA,CAAG,OAAO,KAAK,CAAA;AACnD;AAGO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAAoB;AACrE,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AACzB;AAKO,SAAS,UAAgB,MAAA,EAAkC;AAChE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAChF;AAGO,SAAS,WAAiB,MAAA,EAAgC;AAC/D,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,IAAA;AACpC;AAGO,SAAS,YAAkB,MAAA,EAAqC;AACrE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,MAAA;AACpC;;;AC7GA,eAAsB,GAAA,CACpB,IACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,EAAA,EAAI,CAAA;AAAA,EACtB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,KAAA,CACpB,IACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAY,YAAY,GAAA,EAAI;AAClC,EAAA,MAAM,SAAA,GAAA,iBAAY,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AACzC,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,UAAA,EAAe,CAAA;AAAA,IACf,SAAA;AAAA,IACA,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,EAAG;AACvB,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACvF,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,QAAQ,OAAA,EAAS,cAAA,GAAiB,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA,GAAK,MAAA;AAC1E,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACxF;AACF;AAMO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAA0C;AAC3F,EAAA,OAAO;AAAA,IACL,GAAG,MAAA;AAAA,IACH,UAAA,EAAe,CAAA;AAAA,IACf,SAAA,EAAA,iBAAe,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AAAA,IACtC,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AACF;AAKO,SAAS,SAAe,IAAA,EAAsC;AACnE,EAAA,OAAO,IAAA,CAAK,EAAA,GACR,EAAE,EAAA,EAAI,MAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAC/B,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AACrC;;;AC3CA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,IAAI,OAAA,CAAQ,OAAA,EAAS,MAAM,KAAA,CAAM,QAAQ,OAAO,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,gBAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA;AAAA,MAAA,CAChB,QAAQ,OAAA,IAAW,GAAA,IAAO,KAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAC,CAAA;AAAA,MAClD,QAAQ,UAAA,IAAc;AAAA,KACxB;AACA,IAAA,MAAM,MAAM,KAAK,CAAA;AAAA,EACnB;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,WAAA,CACpB,EAAA,EACA,EAAA,EACA,YAAA,EACuB;AACvB,EAAA,MAAM,QAAQ,IAAI,OAAA;AAAA,IAAsB,CAAA,OAAA,KACtC,WAAW,MAAM,OAAA,CAAQ,KAAW,YAAY,CAAC,GAAG,EAAE;AAAA,GACxD;AACA,EAAA,OAAO,QAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AACnC;AAEA,IAAM,KAAA,GAAQ,CAAC,EAAA,KAA8B,IAAI,QAAQ,CAAA,CAAA,KAAK,UAAA,CAAW,CAAA,EAAG,EAAE,CAAC,CAAA;;;AC7FxE,SAAS,IAAU,OAAA,EAAyC;AACjE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA;AAClB,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAG,MAAM,CAAA;AAClB;AAYA,eAAsB,IACpB,UAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AACJ,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC3B,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AAAA,EACtB;AACA,EAAA,OAAO,IAAA;AACT;AAiBA,eAAsB,QAAA,CACpB,YACA,OAAA,EACyB;AACzB,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,IAAe,UAAA,CAAW,MAAA;AACvD,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,EAAQ,KAAK,WAAA,EAAa;AACvD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,WAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,WAAW,CAAA,CAAE,GAAA,CAAI,CAAA,EAAA,KAAM,EAAA,EAAI,CAAC,CAAA;AACpF,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACvB;AAEA,EAAA,OAAO,IAAI,OAAO,CAAA;AACpB;AAQO,SAAS,UAAgB,OAAA,EAAqC;AACnE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAA,CAAE,EAAA,EAAI,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,SACxB,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAK,CAAA;AAAA,EAC1B;AACA,EAAA,OAAO,CAAC,QAAQ,MAAM,CAAA;AACxB;AAQO,SAAS,QAAc,OAAA,EAA8B;AAC1D,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,CAAA,KAAgD,CAAA,CAAE,EAAE,CAAA,CAC5D,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,KAAK,CAAA;AACrB;AASO,SAAS,QAAA,CACd,OACA,EAAA,EACgB;AAChB,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA;AAC1B;AAKO,SAAS,QAAA,CACd,IACA,EAAA,EACmB;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,GAAG,CAAC,EAAA,CAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAChC;AAGO,SAAS,QAAA,CACd,EAAA,EACA,EAAA,EACA,EAAA,EACsB;AACtB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,EAAA,CAAG,CAAC,EAAA,CAAG,KAAA,EAAO,GAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAC1C;;;ACvHO,IAAM,IAAA,GAAN,MAAM,KAAA,CAAmB;AAAA,EACtB,YAA6B,OAAA,EAAuB;AAAvB,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAAwB;AAAA,EAAxB,OAAA;AAAA;AAAA,EAGrC,OAAO,KAAW,MAAA,EAAkC;AAClD,IAAA,OAAO,IAAI,MAAK,MAAM,CAAA;AAAA,EACxB;AAAA;AAAA,EAGA,OAAO,KAAA,GAA2B;AAChC,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,MAAS,CAAC,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAO,EAAA,EAAiC;AACtC,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,SAAY,EAAA,EAAiC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AAClF,IAAA,OAAO,IAAI,MAAK,IAAA,CAAK,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC9C;AAAA;AAAA,EAGA,QAAW,EAAA,EAA4C;AACrD,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACxC;AAAA;AAAA,EAGA,MAAA,CAAO,MAA6B,KAAA,EAAsB;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,IAAA;AAC7B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAO,IAAI,KAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,IAAI,EAAA,EAA8B;AAChC,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,EAAA,EAA8B;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC3C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,EAAA,EAAqC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAe,KAAK,OAAsC,CAAA;AAC1F,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,MAAS,QAAA,EAA6D;AACpE,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,EAAA,GAChB,QAAA,CAAS,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAC9B,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,SAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAkC;AAChC,IAAA,IAAI,CAAC,OAAO,IAAA,CAAK,OAAO,GAAG,MAAM,IAAI,MAAM,4BAA4B,CAAA;AACvE,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEA,IAAA,GAAkB;AAAE,IAAA,OAAO,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAAA,EAC5C,MAAA,GAAkB;AAAE,IAAA,OAAO,CAAC,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAC/C","file":"index.cjs","sourcesContent":["import type { Result } from './types.js';\n\n/** Creates a successful Result. /\nexport const ok = <T, E = never>(value: T): Result<T, E> =>\n ({ ok: true, value });\n\n/* Creates a failed Result. /\nexport const fail = <T = never, E = Error>(error: E): Result<T, E> =>\n ({ ok: false, error });\n\n/\n Wraps a synchronous throwable function. Catches any thrown value and\n * passes it through `errorTransform` (defaults to identity cast).\n \n @example\n * const result = fromThrowable(() => JSON.parse(raw), (e) => new ParseError(e));\n /\nexport function fromThrowable<T, E = Error>(\n fn: () => T,\n errorTransform?: (caught: unknown) => E,\n): Result<T, E> {\n try {\n return ok(fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a Promise to a `Promise<Result<T, E>>`, catching rejections.\n \n @example\n * const result = await fromPromise(fetch(url), (e) => new NetworkError(e));\n /\nexport async function fromPromise<T, E = Error>(\n promise: Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await promise);\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a nullable value to a Result.\n * Returns `ok(value)` if non-null/undefined, `fail(error)` otherwise.\n \n @example\n * const result = fromNullable(user, new NotFoundError('user'));\n /\nexport function fromNullable<T, E>(\n value: T \| null \| undefined,\n error: E,\n): Result<T, E> {\n return value != null ? ok(value) : fail(error);\n}\n","import type { Result, RichResult } from './types.js';\n\ntype OkResult<T, E> = Extract<Result<T, E>, { ok: true }>;\ntype FailResult<T, E> = Extract<Result<T, E>, { ok: false }>;\n\n/* Narrows a `Result<T, E>` to its success branch. /\nexport function isOk<T, E>(result: Result<T, E>): result is OkResult<T, E> {\n return result.ok === true;\n}\n\n/* Narrows a `Result<T, E>` to its failure branch. /\nexport function isFail<T, E>(result: Result<T, E>): result is FailResult<T, E> {\n return result.ok === false;\n}\n\n/* Returns `true` if the result carries observability metadata (`track()` output). /\nexport function isRich<T, E>(result: Result<T, E>): result is RichResult<T, E> {\n return 'durationMs' in result;\n}\n","import type { Result } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n// ── Transformations ────────────────────────────────────────────────────────\n\n/* Maps the success value. Passes failures through unchanged. /\nexport function map<T, U, E>(result: Result<T, E>, fn: (value: T) => U): Result<U, E> {\n return result.ok ? ok(fn(result.value)) : result;\n}\n\n/* Maps the error value. Passes successes through unchanged. /\nexport function mapError<T, E, F>(result: Result<T, E>, fn: (error: E) => F): Result<T, F> {\n return result.ok ? result : fail(fn(result.error));\n}\n\n/* Monadic bind — chains a Result-returning function on success. /\nexport function flatMap<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Result<U, E>,\n): Result<U, E> {\n return result.ok ? fn(result.value) : result;\n}\n\n/* Async variant of `flatMap`. /\nexport async function flatMapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<Result<U, E>>,\n): Promise<Result<U, E>> {\n return result.ok ? fn(result.value) : Promise.resolve(result);\n}\n\n/* Async variant of `map`. /\nexport async function mapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<U>,\n): Promise<Result<U, E>> {\n if (!result.ok) return Promise.resolve(result);\n return ok(await fn(result.value));\n}\n\n// ── Pattern matching ───────────────────────────────────────────────────────\n\n/\n Exhaustive pattern match over both branches.\n \n @example\n * const msg = match(result, {\n * ok: (user) => `Welcome, ${user.name}`,\n * fail: (error) => `Error: ${error.message}`,\n * });\n /\nexport function match<T, E, R>(\n result: Result<T, E>,\n handlers: { ok: (value: T) => R; fail: (error: E) => R },\n): R {\n return result.ok ? handlers.ok(result.value) : handlers.fail(result.error);\n}\n\n/* Alias for `match` — familiar to fp-ts / Scala users. /\nexport const fold = match;\n\n// ── Side effects ───────────────────────────────────────────────────────────\n\n/* Runs a side effect on the success value; returns the result unchanged. /\nexport function tap<T, E>(result: Result<T, E>, fn: (value: T) => void): Result<T, E> {\n if (result.ok) fn(result.value);\n return result;\n}\n\n/* Runs a side effect on the error value; returns the result unchanged. /\nexport function tapError<T, E>(result: Result<T, E>, fn: (error: E) => void): Result<T, E> {\n if (!result.ok) fn(result.error);\n return result;\n}\n\n// ── Unwrapping ─────────────────────────────────────────────────────────────\n\n/* Extracts the value or throws the error (re-thrown as-is if it's an Error, wrapped otherwise). /\nexport function unwrap<T, E>(result: Result<T, E>): T {\n if (result.ok) return result.value;\n throw result.error instanceof Error ? result.error : new Error(String(result.error));\n}\n\n/* Extracts the error or throws if the result is Ok. /\nexport function unwrapError<T, E>(result: Result<T, E>): E {\n if (!result.ok) return result.error;\n throw new Error('Called unwrapError on an Ok result');\n}\n\n/* Extracts the value or returns `defaultValue` on failure. /\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n return result.ok ? result.value : defaultValue;\n}\n\n/* Extracts the value or computes a fallback from the error. /\nexport function unwrapOrElse<T, E>(result: Result<T, E>, fn: (error: E) => T): T {\n return result.ok ? result.value : fn(result.error);\n}\n\n/* Extracts the value or throws with a custom `message`. /\nexport function expect<T, E>(result: Result<T, E>, message: string): T {\n if (result.ok) return result.value;\n throw new Error(message);\n}\n\n// ── Conversion ─────────────────────────────────────────────────────────────\n\n/* Converts to a Promise — resolves on Ok, rejects on Fail. /\nexport function toPromise<T, E>(result: Result<T, E>): Promise<T> {\n return result.ok ? Promise.resolve(result.value) : Promise.reject(result.error);\n}\n\n/* Returns the value or `null` on failure. /\nexport function toNullable<T, E>(result: Result<T, E>): T \| null {\n return result.ok ? result.value : null;\n}\n\n/* Returns the value or `undefined` on failure. /\nexport function toUndefined<T, E>(result: Result<T, E>): T \| undefined {\n return result.ok ? result.value : undefined;\n}\n","import type { Result, RichResult, TrackOptions } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n/\n Executes an async (or sync) function and captures any thrown exception,\n * returning a `Result<T, E>` instead of propagating the error.\n \n @example\n * const result = await run(() => fetchUser(id));\n * const result = await run(() => fetchUser(id), (e) => new UserError(e));\n /\nexport async function run<T, E = Error>(\n fn: () => T \| Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Like `run()` but also captures timing and metadata, returning a `RichResult<T, E>`.\n \n @example\n * const result = await track(() => fetchUser(id), { operation: 'user.fetch', tags: ['db'] });\n /\nexport async function track<T, E = Error>(\n fn: () => T \| Promise<T>,\n options?: TrackOptions & { errorTransform?: (caught: unknown) => E },\n): Promise<RichResult<T, E>> {\n const start = performance.now();\n const timestamp = new Date().toISOString();\n const meta = {\n durationMs: 0,\n timestamp,\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n\n try {\n const value = await fn();\n return { ok: true, value, ...meta, durationMs: Math.round(performance.now() - start) };\n } catch (caught) {\n const error = options?.errorTransform ? options.errorTransform(caught) : (caught as E);\n return { ok: false, error, ...meta, durationMs: Math.round(performance.now() - start) };\n }\n}\n\n/\n Promotes a plain `Result<T, E>` to a `RichResult<T, E>` with a zero-duration snapshot.\n * Useful when you already have a Result and want to attach metadata.\n /\nexport function enrich<T, E>(result: Result<T, E>, options?: TrackOptions): RichResult<T, E> {\n return {\n ...result,\n durationMs: 0,\n timestamp: new Date().toISOString(),\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n}\n\n/\n Strips observability metadata from a `RichResult`, returning a plain `Result<T, E>`.\n /\nexport function simplify<T, E>(rich: RichResult<T, E>): Result<T, E> {\n return rich.ok\n ? { ok: true, value: rich.value }\n : { ok: false, error: rich.error };\n}\n","import type { Result } from './types.js';\nimport { fail } from './constructors.js';\n\nexport interface RetryOptions<E> {\n /* Maximum number of attempts (including the first). /\n attempts: number;\n /* Fixed delay in ms between attempts. Default: 0 /\n delayMs?: number;\n /* Return false to stop retrying early based on the error. /\n shouldRetry?: (error: E, attempt: number) => boolean;\n /* Called before each retry with the previous error and attempt number. /\n onRetry?: (error: E, attempt: number) => void;\n}\n\nexport interface BackoffOptions<E> extends RetryOptions<E> {\n /* Cap for the computed backoff delay. Default: 30_000 /\n maxDelayMs?: number;\n}\n\n/\n Retries a Result-returning function up to `options.attempts` times with\n * an optional fixed delay between attempts.\n \n @example\n * const result = await retry(() => run(() => callApi()), {\n * attempts: 3,\n * delayMs: 500,\n * shouldRetry: (err) => err.code === 'ECONNRESET',\n * });\n /\nexport async function retry<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: RetryOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n if (options.delayMs) await sleep(options.delayMs);\n }\n\n return last;\n}\n\n/\n Like `retry()` but uses exponential backoff: delay doubles on each attempt,\n * capped at `maxDelayMs`.\n \n @example\n * const result = await retryWithBackoff(() => run(() => callApi()), {\n * attempts: 4,\n * delayMs: 100, // 100ms → 200ms → 400ms\n * maxDelayMs: 1_000,\n * });\n /\nexport async function retryWithBackoff<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: BackoffOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n const delay = Math.min(\n (options.delayMs ?? 100) Math.pow(2, attempt - 1),\n options.maxDelayMs ?? 30_000,\n );\n await sleep(delay);\n }\n\n return last;\n}\n\n/*\n Races a Result-returning function against a timeout.\n * Returns `fail(timeoutError)` if `ms` elapses before the function resolves.\n \n @example\n * const result = await withTimeout(\n * () => run(() => fetchData()),\n * 5_000,\n * new TimeoutError('fetchData timed out'),\n * );\n /\nexport async function withTimeout<T, E>(\n fn: () => Promise<Result<T, E>>,\n ms: number,\n timeoutError: E,\n): Promise<Result<T, E>> {\n const timer = new Promise<Result<T, E>>(resolve =>\n setTimeout(() => resolve(fail<T, E>(timeoutError)), ms),\n );\n return Promise.race([fn(), timer]);\n}\n\nconst sleep = (ms: number): Promise<void> => new Promise(r => setTimeout(r, ms));\n","import type { Result } from './types.js';\nimport { ok } from './constructors.js';\n\n/\n Returns `ok([...values])` if every result succeeds, or the first `fail` encountered.\n \n @example\n * const result = all([findUser(id), findAccount(id)]);\n * // Result<[User, Account], Error>\n /\nexport function all<T, E>(results: Result<T, E>[]): Result<T[], E> {\n const values: T[] = [];\n for (const r of results) {\n if (!r.ok) return r;\n values.push(r.value);\n }\n return ok(values);\n}\n\n/\n Returns the first successful result from a list of async operations,\n * tried sequentially. Returns the last failure if all fail.\n \n @example\n * const result = await any([\n * () => run(() => primaryCache.get(key)),\n * () => run(() => database.find(key)),\n * ]);\n /\nexport async function any<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n for (const op of operations) {\n last = await op();\n if (last.ok) return last;\n }\n return last;\n}\n\nexport interface ParallelOptions {\n /* Max number of operations running concurrently. Default: all at once. /\n concurrency?: number;\n}\n\n/\n Runs operations concurrently (optionally throttled by `concurrency`).\n * Returns `ok([...values])` if all succeed, or the first failure.\n \n @example\n * const result = await parallel(\n * userIds.map(id => () => run(() => fetchUser(id))),\n * { concurrency: 5 },\n * );\n /\nexport async function parallel<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n options?: ParallelOptions,\n): Promise<Result<T[], E>> {\n const concurrency = options?.concurrency ?? operations.length;\n const results: Result<T, E>[] = [];\n\n for (let i = 0; i < operations.length; i += concurrency) {\n const batch = await Promise.all(operations.slice(i, i + concurrency).map(op => op()));\n results.push(...batch);\n }\n\n return all(results);\n}\n\n/\n Splits an array of Results into `[successValues, errorValues]`.\n \n @example\n * const [users, errors] = partition(results);\n /\nexport function partition<T, E>(results: Result<T, E>[]): [T[], E[]] {\n const values: T[] = [];\n const errors: E[] = [];\n for (const r of results) {\n if (r.ok) values.push(r.value);\n else errors.push(r.error);\n }\n return [values, errors];\n}\n\n/\n Extracts only the success values, silently discarding failures.\n \n @example\n * const users = collect(results); // User[]\n /\nexport function collect<T, E>(results: Result<T, E>[]): T[] {\n return results\n .filter((r): r is Extract<Result<T, E>, { ok: true }> => r.ok)\n .map(r => r.value);\n}\n\n/\n Maps each item through a Result-returning function, collecting all successes\n * into an array or short-circuiting on the first failure.\n \n @example\n * const result = traverse(ids, id => fromNullable(cache.get(id), 'not-found'));\n /\nexport function traverse<T, U, E>(\n items: T[],\n fn: (item: T) => Result<U, E>,\n): Result<U[], E> {\n return all(items.map(fn));\n}\n\n// ── Typed tuple combinators ────────────────────────────────────────────────\n\n/* Combines two Results into a tuple. Short-circuits on first failure. /\nexport function combine2<A, B, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n): Result<[A, B], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n return ok([r1.value, r2.value]);\n}\n\n/* Combines three Results into a typed tuple. Short-circuits on first failure. /\nexport function combine3<A, B, C, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n r3: Result<C, E>,\n): Result<[A, B, C], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n if (!r3.ok) return r3;\n return ok([r1.value, r2.value, r3.value]);\n}\n","import type { Result, RichResult } from './types.js';\nimport { ok, fail } from './constructors.js';\nimport { isRich } from './guards.js';\n\n/\n Fluent pipeline wrapper around `Result<T, E>`.\n * Operations short-circuit on failure — subsequent transforms are skipped.\n \n @example\n * const price = Flow.from(findProduct(id))\n * .map(p => p.price)\n * .filter(price => price > 0, new Error('Price must be positive'))\n * .map(price => price * taxRate)\n * .getResult();\n /\nexport class Flow<T, E = Error> {\n private constructor(private readonly _result: Result<T, E>) {}\n\n /* Start a pipeline from an existing Result. /\n static from<T, E>(result: Result<T, E>): Flow<T, E> {\n return new Flow(result);\n }\n\n /* Start an empty pipeline (value is `undefined`). /\n static start(): Flow<void, never> {\n return new Flow(ok(undefined));\n }\n\n /* Maps the success value. Skipped on failure. /\n map<U>(fn: (value: T) => U): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(ok(fn(this._result.value)));\n }\n\n /* Maps the error value. Skipped on success. /\n mapError<F>(fn: (error: E) => F): Flow<T, F> {\n if (this._result.ok) return new Flow<T, F>(this._result as unknown as Result<T, F>);\n return new Flow(fail(fn(this._result.error)));\n }\n\n /* Chains a Result-returning function. Skipped on failure. /\n flatMap<U>(fn: (value: T) => Result<U, E>): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(fn(this._result.value));\n }\n\n /* Filters the success value. Becomes `fail(error)` if predicate is false. /\n filter(pred: (value: T) => boolean, error: E): Flow<T, E> {\n if (!this._result.ok) return this;\n return pred(this._result.value) ? this : new Flow(fail(error));\n }\n\n /* Runs a side effect on success; returns `this` unchanged. /\n tap(fn: (value: T) => void): this {\n if (this._result.ok) fn(this._result.value);\n return this;\n }\n\n /* Runs a side effect on failure; returns `this` unchanged. /\n tapError(fn: (error: E) => void): this {\n if (!this._result.ok) fn(this._result.error);\n return this;\n }\n\n /\n Recovers from a failure by computing a new success value.\n * Skipped if already Ok.\n /\n recover(fn: (error: E) => T): Flow<T, never> {\n if (this._result.ok) return new Flow<T, never>(this._result as unknown as Result<T, never>);\n return new Flow(ok(fn(this._result.error)));\n }\n\n /* Exhaustive pattern match — always produces a value. /\n match<R>(handlers: { ok: (value: T) => R; fail: (error: E) => R }): R {\n return this._result.ok\n ? handlers.ok(this._result.value)\n : handlers.fail(this._result.error);\n }\n\n /* Returns the underlying `Result<T, E>`. /\n getResult(): Result<T, E> {\n return this._result;\n }\n\n /\n Returns the underlying result as `RichResult<T, E>` if it was created by `track()`.\n * Throws if the result has no observability metadata.\n */\n getRichResult(): RichResult<T, E> {\n if (!isRich(this._result)) throw new Error('Result is not a RichResult');\n return this._result;\n }\n\n isOk(): boolean { return this._result.ok; }\n isFail(): boolean { return !this._result.ok; }\n}\n"]}
1	+ {"version":3,"sources":["../src/result/constructors.ts","../src/result/guards.ts","../src/result/operations.ts","../src/result/run.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";;;AAGO,IAAM,KAAK,CAAe,KAAA,MAC9B,EAAE,EAAA,EAAI,MAAM,KAAA,EAAM;AAGd,IAAM,OAAO,CAAuB,KAAA,MACxC,EAAE,EAAA,EAAI,OAAO,KAAA,EAAM;AASf,SAAS,aAAA,CACd,IACA,cAAA,EACc;AACd,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,IAAI,CAAA;AAAA,EAChB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,WAAA,CACpB,SACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AAAA,EACzB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AASO,SAAS,YAAA,CACd,OACA,KAAA,EACc;AACd,EAAA,OAAO,SAAS,IAAA,GAAO,EAAA,CAAG,KAAK,CAAA,GAAI,KAAK,KAAK,CAAA;AAC/C;;;ACnDO,SAAS,KAAW,MAAA,EAAgD;AACzE,EAAA,OAAO,OAAO,EAAA,KAAO,IAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,OAAO,EAAA,KAAO,KAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,YAAA,IAAgB,MAAA;AACzB;;;ACZO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAK,EAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAAS,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AACnD;AAGO,SAAS,OAAA,CACd,QACA,EAAA,EACc;AACd,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,MAAA;AACxC;AAGA,eAAsB,YAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,OAAO,MAAA,CAAO,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC9D;AAGA,eAAsB,QAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC7C,EAAA,OAAO,EAAA,CAAG,MAAM,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAClC;AAaO,SAAS,KAAA,CACd,QACA,QAAA,EACG;AACH,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,QAAA,CAAS,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC3E;AAGO,IAAM,IAAA,GAAO;AAKb,SAAS,GAAA,CAAU,QAAsB,EAAA,EAAsC;AACpF,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA;AAC9B,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,QAAA,CAAe,QAAsB,EAAA,EAAsC;AACzF,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,OAAO,KAAK,CAAA;AAC/B,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,OAAa,MAAA,EAAyB;AACpD,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,MAAA,CAAO,KAAA,YAAiB,KAAA,GAAQ,MAAA,CAAO,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AACrF;AAGO,SAAS,YAAkB,MAAA,EAAyB;AACzD,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC9B,EAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AACtD;AAGO,SAAS,QAAA,CAAe,QAAsB,YAAA,EAAoB;AACvE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,YAAA;AACpC;AAGO,SAAS,YAAA,CAAmB,QAAsB,EAAA,EAAwB;AAC/E,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,EAAA,CAAG,OAAO,KAAK,CAAA;AACnD;AAGO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAAoB;AACrE,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AACzB;AAKO,SAAS,UAAgB,MAAA,EAAkC;AAChE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAChF;AAGO,SAAS,WAAiB,MAAA,EAAgC;AAC/D,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,IAAA;AACpC;AAGO,SAAS,YAAkB,MAAA,EAAqC;AACrE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,MAAA;AACpC;;;AC7GA,eAAsB,GAAA,CACpB,IACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,EAAA,EAAI,CAAA;AAAA,EACtB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,KAAA,CACpB,IACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAY,YAAY,GAAA,EAAI;AAClC,EAAA,MAAM,SAAA,GAAA,iBAAY,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AACzC,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,UAAA,EAAe,CAAA;AAAA,IACf,SAAA;AAAA,IACA,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,EAAG;AACvB,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACvF,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,QAAQ,OAAA,EAAS,cAAA,GAAiB,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA,GAAK,MAAA;AAC1E,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACxF;AACF;AAMO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAA0C;AAC3F,EAAA,OAAO;AAAA,IACL,GAAG,MAAA;AAAA,IACH,UAAA,EAAe,CAAA;AAAA,IACf,SAAA,EAAA,iBAAe,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AAAA,IACtC,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AACF;AAKO,SAAS,SAAe,IAAA,EAAsC;AACnE,EAAA,OAAO,IAAA,CAAK,EAAA,GACR,EAAE,EAAA,EAAI,MAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAC/B,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AACrC;;;ACjCA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,IAAI,OAAA,CAAQ,OAAA,EAAS,MAAM,KAAA,CAAM,QAAQ,OAAO,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,gBAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,MAAM,KAAA,CAAM,mBAAA,CAAoB,OAAA,EAAS,OAAO,CAAC,CAAA;AAAA,EACnD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,WAAA,CACpB,EAAA,EACA,EAAA,EACA,YAAA,EACuB;AACvB,EAAA,MAAM,QAAQ,IAAI,OAAA;AAAA,IAAsB,CAAA,OAAA,KACtC,WAAW,MAAM,OAAA,CAAQ,KAAW,YAAY,CAAC,GAAG,EAAE;AAAA,GACxD;AACA,EAAA,OAAO,QAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AACnC;AAEA,SAAS,mBAAA,CAAuB,SAAiB,OAAA,EAAoC;AACnF,EAAA,MAAM,IAAA,GAAA,CAAW,QAAQ,OAAA,IAAW,GAAA,IAAO,KAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAC,CAAA;AAClE,EAAA,MAAM,SAAU,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,OAAA,CAAQ,cAAc,GAAM,CAAA;AAC3D,EAAA,MAAM,EAAE,QAAO,GAAI,OAAA;AAEnB,EAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AAEpB,EAAA,IAAI,WAAW,IAAA,EAAM;AAEnB,IAAA,OAAO,IAAA,CAAK,QAAO,GAAI,MAAA;AAAA,EACzB;AAGA,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,EAAO,GAAI,CAAA,GAAI,KAAK,MAAA,GAAS,MAAA;AACjD,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,SAAS,KAAA,EAAO,OAAA,CAAQ,UAAA,IAAc,GAAM,CAAC,CAAA;AAC3E;AAEA,IAAM,KAAA,GAAQ,CAAC,EAAA,KAA8B,IAAI,QAAQ,CAAA,CAAA,KAAK,UAAA,CAAW,CAAA,EAAG,EAAE,CAAC,CAAA;;;ACpHxE,SAAS,IAAU,OAAA,EAAyC;AACjE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA;AAClB,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAG,MAAM,CAAA;AAClB;AAYA,eAAsB,IACpB,UAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AACJ,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC3B,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AAAA,EACtB;AACA,EAAA,OAAO,IAAA;AACT;AAiBA,eAAsB,QAAA,CACpB,YACA,OAAA,EACyB;AACzB,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,IAAe,UAAA,CAAW,MAAA;AACvD,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,EAAQ,KAAK,WAAA,EAAa;AACvD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,WAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,WAAW,CAAA,CAAE,GAAA,CAAI,CAAA,EAAA,KAAM,EAAA,EAAI,CAAC,CAAA;AACpF,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACvB;AAEA,EAAA,OAAO,IAAI,OAAO,CAAA;AACpB;AAQO,SAAS,UAAgB,OAAA,EAAqC;AACnE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAA,CAAE,EAAA,EAAI,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,SACxB,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAK,CAAA;AAAA,EAC1B;AACA,EAAA,OAAO,CAAC,QAAQ,MAAM,CAAA;AACxB;AAQO,SAAS,QAAc,OAAA,EAA8B;AAC1D,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,CAAA,KAAgD,CAAA,CAAE,EAAE,CAAA,CAC5D,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,KAAK,CAAA;AACrB;AASO,SAAS,QAAA,CACd,OACA,EAAA,EACgB;AAChB,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA;AAC1B;AAKO,SAAS,QAAA,CACd,IACA,EAAA,EACmB;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,GAAG,CAAC,EAAA,CAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAChC;AAGO,SAAS,QAAA,CACd,EAAA,EACA,EAAA,EACA,EAAA,EACsB;AACtB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,EAAA,CAAG,CAAC,EAAA,CAAG,KAAA,EAAO,GAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAC1C;;;ACvHO,IAAM,IAAA,GAAN,MAAM,KAAA,CAAmB;AAAA,EACtB,YAA6B,OAAA,EAAuB;AAAvB,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAAwB;AAAA,EAAxB,OAAA;AAAA;AAAA,EAGrC,OAAO,KAAW,MAAA,EAAkC;AAClD,IAAA,OAAO,IAAI,MAAK,MAAM,CAAA;AAAA,EACxB;AAAA;AAAA,EAGA,OAAO,KAAA,GAA2B;AAChC,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,MAAS,CAAC,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAO,EAAA,EAAiC;AACtC,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,SAAY,EAAA,EAAiC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AAClF,IAAA,OAAO,IAAI,MAAK,IAAA,CAAK,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC9C;AAAA;AAAA,EAGA,QAAW,EAAA,EAA4C;AACrD,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACxC;AAAA;AAAA,EAGA,MAAA,CAAO,MAA6B,KAAA,EAAsB;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,IAAA;AAC7B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAO,IAAI,KAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,IAAI,EAAA,EAA8B;AAChC,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,EAAA,EAA8B;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC3C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,EAAA,EAAqC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAe,KAAK,OAAsC,CAAA;AAC1F,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,MAAS,QAAA,EAA6D;AACpE,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,EAAA,GAChB,QAAA,CAAS,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAC9B,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,SAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAkC;AAChC,IAAA,IAAI,CAAC,OAAO,IAAA,CAAK,OAAO,GAAG,MAAM,IAAI,MAAM,4BAA4B,CAAA;AACvE,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEA,IAAA,GAAkB;AAAE,IAAA,OAAO,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAAA,EAC5C,MAAA,GAAkB;AAAE,IAAA,OAAO,CAAC,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAC/C","file":"index.cjs","sourcesContent":["import type { Result } from './types.js';\n\n/** Creates a successful Result. /\nexport const ok = <T, E = never>(value: T): Result<T, E> =>\n ({ ok: true, value });\n\n/* Creates a failed Result. /\nexport const fail = <T = never, E = Error>(error: E): Result<T, E> =>\n ({ ok: false, error });\n\n/\n Wraps a synchronous throwable function. Catches any thrown value and\n * passes it through `errorTransform` (defaults to identity cast).\n \n @example\n * const result = fromThrowable(() => JSON.parse(raw), (e) => new ParseError(e));\n /\nexport function fromThrowable<T, E = Error>(\n fn: () => T,\n errorTransform?: (caught: unknown) => E,\n): Result<T, E> {\n try {\n return ok(fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a Promise to a `Promise<Result<T, E>>`, catching rejections.\n \n @example\n * const result = await fromPromise(fetch(url), (e) => new NetworkError(e));\n /\nexport async function fromPromise<T, E = Error>(\n promise: Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await promise);\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a nullable value to a Result.\n * Returns `ok(value)` if non-null/undefined, `fail(error)` otherwise.\n \n @example\n * const result = fromNullable(user, new NotFoundError('user'));\n /\nexport function fromNullable<T, E>(\n value: T \| null \| undefined,\n error: E,\n): Result<T, E> {\n return value != null ? ok(value) : fail(error);\n}\n","import type { Result, RichResult } from './types.js';\n\ntype OkResult<T, E> = Extract<Result<T, E>, { ok: true }>;\ntype FailResult<T, E> = Extract<Result<T, E>, { ok: false }>;\n\n/* Narrows a `Result<T, E>` to its success branch. /\nexport function isOk<T, E>(result: Result<T, E>): result is OkResult<T, E> {\n return result.ok === true;\n}\n\n/* Narrows a `Result<T, E>` to its failure branch. /\nexport function isFail<T, E>(result: Result<T, E>): result is FailResult<T, E> {\n return result.ok === false;\n}\n\n/* Returns `true` if the result carries observability metadata (`track()` output). /\nexport function isRich<T, E>(result: Result<T, E>): result is RichResult<T, E> {\n return 'durationMs' in result;\n}\n","import type { Result } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n// ── Transformations ────────────────────────────────────────────────────────\n\n/* Maps the success value. Passes failures through unchanged. /\nexport function map<T, U, E>(result: Result<T, E>, fn: (value: T) => U): Result<U, E> {\n return result.ok ? ok(fn(result.value)) : result;\n}\n\n/* Maps the error value. Passes successes through unchanged. /\nexport function mapError<T, E, F>(result: Result<T, E>, fn: (error: E) => F): Result<T, F> {\n return result.ok ? result : fail(fn(result.error));\n}\n\n/* Monadic bind — chains a Result-returning function on success. /\nexport function flatMap<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Result<U, E>,\n): Result<U, E> {\n return result.ok ? fn(result.value) : result;\n}\n\n/* Async variant of `flatMap`. /\nexport async function flatMapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<Result<U, E>>,\n): Promise<Result<U, E>> {\n return result.ok ? fn(result.value) : Promise.resolve(result);\n}\n\n/* Async variant of `map`. /\nexport async function mapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<U>,\n): Promise<Result<U, E>> {\n if (!result.ok) return Promise.resolve(result);\n return ok(await fn(result.value));\n}\n\n// ── Pattern matching ───────────────────────────────────────────────────────\n\n/\n Exhaustive pattern match over both branches.\n \n @example\n * const msg = match(result, {\n * ok: (user) => `Welcome, ${user.name}`,\n * fail: (error) => `Error: ${error.message}`,\n * });\n /\nexport function match<T, E, R>(\n result: Result<T, E>,\n handlers: { ok: (value: T) => R; fail: (error: E) => R },\n): R {\n return result.ok ? handlers.ok(result.value) : handlers.fail(result.error);\n}\n\n/* Alias for `match` — familiar to fp-ts / Scala users. /\nexport const fold = match;\n\n// ── Side effects ───────────────────────────────────────────────────────────\n\n/* Runs a side effect on the success value; returns the result unchanged. /\nexport function tap<T, E>(result: Result<T, E>, fn: (value: T) => void): Result<T, E> {\n if (result.ok) fn(result.value);\n return result;\n}\n\n/* Runs a side effect on the error value; returns the result unchanged. /\nexport function tapError<T, E>(result: Result<T, E>, fn: (error: E) => void): Result<T, E> {\n if (!result.ok) fn(result.error);\n return result;\n}\n\n// ── Unwrapping ─────────────────────────────────────────────────────────────\n\n/* Extracts the value or throws the error (re-thrown as-is if it's an Error, wrapped otherwise). /\nexport function unwrap<T, E>(result: Result<T, E>): T {\n if (result.ok) return result.value;\n throw result.error instanceof Error ? result.error : new Error(String(result.error));\n}\n\n/* Extracts the error or throws if the result is Ok. /\nexport function unwrapError<T, E>(result: Result<T, E>): E {\n if (!result.ok) return result.error;\n throw new Error('Called unwrapError on an Ok result');\n}\n\n/* Extracts the value or returns `defaultValue` on failure. /\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n return result.ok ? result.value : defaultValue;\n}\n\n/* Extracts the value or computes a fallback from the error. /\nexport function unwrapOrElse<T, E>(result: Result<T, E>, fn: (error: E) => T): T {\n return result.ok ? result.value : fn(result.error);\n}\n\n/* Extracts the value or throws with a custom `message`. /\nexport function expect<T, E>(result: Result<T, E>, message: string): T {\n if (result.ok) return result.value;\n throw new Error(message);\n}\n\n// ── Conversion ─────────────────────────────────────────────────────────────\n\n/* Converts to a Promise — resolves on Ok, rejects on Fail. /\nexport function toPromise<T, E>(result: Result<T, E>): Promise<T> {\n return result.ok ? Promise.resolve(result.value) : Promise.reject(result.error);\n}\n\n/* Returns the value or `null` on failure. /\nexport function toNullable<T, E>(result: Result<T, E>): T \| null {\n return result.ok ? result.value : null;\n}\n\n/* Returns the value or `undefined` on failure. /\nexport function toUndefined<T, E>(result: Result<T, E>): T \| undefined {\n return result.ok ? result.value : undefined;\n}\n","import type { Result, RichResult, TrackOptions } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n/\n Executes an async (or sync) function and captures any thrown exception,\n * returning a `Result<T, E>` instead of propagating the error.\n \n @example\n * const result = await run(() => fetchUser(id));\n * const result = await run(() => fetchUser(id), (e) => new UserError(e));\n /\nexport async function run<T, E = Error>(\n fn: () => T \| Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Like `run()` but also captures timing and metadata, returning a `RichResult<T, E>`.\n \n @example\n * const result = await track(() => fetchUser(id), { operation: 'user.fetch', tags: ['db'] });\n /\nexport async function track<T, E = Error>(\n fn: () => T \| Promise<T>,\n options?: TrackOptions & { errorTransform?: (caught: unknown) => E },\n): Promise<RichResult<T, E>> {\n const start = performance.now();\n const timestamp = new Date().toISOString();\n const meta = {\n durationMs: 0,\n timestamp,\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n\n try {\n const value = await fn();\n return { ok: true, value, ...meta, durationMs: Math.round(performance.now() - start) };\n } catch (caught) {\n const error = options?.errorTransform ? options.errorTransform(caught) : (caught as E);\n return { ok: false, error, ...meta, durationMs: Math.round(performance.now() - start) };\n }\n}\n\n/\n Promotes a plain `Result<T, E>` to a `RichResult<T, E>` with a zero-duration snapshot.\n * Useful when you already have a Result and want to attach metadata.\n /\nexport function enrich<T, E>(result: Result<T, E>, options?: TrackOptions): RichResult<T, E> {\n return {\n ...result,\n durationMs: 0,\n timestamp: new Date().toISOString(),\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n}\n\n/\n Strips observability metadata from a `RichResult`, returning a plain `Result<T, E>`.\n /\nexport function simplify<T, E>(rich: RichResult<T, E>): Result<T, E> {\n return rich.ok\n ? { ok: true, value: rich.value }\n : { ok: false, error: rich.error };\n}\n","import type { Result } from './types.js';\nimport { fail } from './constructors.js';\n\nexport interface RetryOptions<E> {\n /* Maximum number of attempts (including the first). /\n attempts: number;\n /* Fixed delay in ms between attempts. Default: 0 /\n delayMs?: number;\n /* Return false to stop retrying early based on the error. /\n shouldRetry?: (error: E, attempt: number) => boolean;\n /* Called before each retry with the previous error and attempt number. /\n onRetry?: (error: E, attempt: number) => void;\n}\n\nexport interface BackoffOptions<E> extends RetryOptions<E> {\n /* Cap for the computed backoff delay. Default: 30_000 /\n maxDelayMs?: number;\n /\n Adds random noise to the backoff delay to avoid thundering herd when\n * multiple instances retry simultaneously.\n \n - `true` → full jitter: delay = random(0, computedDelay)\n * - `number` → partial jitter: delay ± (computedDelay * factor), clamped to [0, maxDelayMs]\n * e.g. 0.25 adds ±25% noise\n * - `false` → no jitter (default)\n /\n jitter?: boolean \| number;\n}\n\n/\n Retries a Result-returning function up to `options.attempts` times with\n * an optional fixed delay between attempts.\n \n @example\n * const result = await retry(() => run(() => callApi()), {\n * attempts: 3,\n * delayMs: 500,\n * shouldRetry: (err) => err.code === 'ECONNRESET',\n * });\n /\nexport async function retry<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: RetryOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n if (options.delayMs) await sleep(options.delayMs);\n }\n\n return last;\n}\n\n/\n Like `retry()` but uses exponential backoff: delay doubles on each attempt,\n * capped at `maxDelayMs`.\n \n @example\n * const result = await retryWithBackoff(() => run(() => callApi()), {\n * attempts: 4,\n * delayMs: 100, // 100ms → 200ms → 400ms\n * maxDelayMs: 1_000,\n * });\n /\nexport async function retryWithBackoff<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: BackoffOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n await sleep(computeBackoffDelay(attempt, options));\n }\n\n return last;\n}\n\n/\n Races a Result-returning function against a timeout.\n * Returns `fail(timeoutError)` if `ms` elapses before the function resolves.\n \n @example\n * const result = await withTimeout(\n * () => run(() => fetchData()),\n * 5_000,\n * new TimeoutError('fetchData timed out'),\n * );\n /\nexport async function withTimeout<T, E>(\n fn: () => Promise<Result<T, E>>,\n ms: number,\n timeoutError: E,\n): Promise<Result<T, E>> {\n const timer = new Promise<Result<T, E>>(resolve =>\n setTimeout(() => resolve(fail<T, E>(timeoutError)), ms),\n );\n return Promise.race([fn(), timer]);\n}\n\nfunction computeBackoffDelay<E>(attempt: number, options: BackoffOptions<E>): number {\n const base = (options.delayMs ?? 100) Math.pow(2, attempt - 1);\n const capped = Math.min(base, options.maxDelayMs ?? 30_000);\n const { jitter } = options;\n\n if (!jitter) return capped;\n\n if (jitter === true) {\n // Full jitter: uniform random in [0, capped] — maximises spread across instances\n return Math.random() * capped;\n }\n\n // Partial jitter: ± (capped * factor), stays within [0, maxDelayMs]\n const noise = (Math.random() * 2 - 1) * capped * jitter;\n return Math.max(0, Math.min(capped + noise, options.maxDelayMs ?? 30_000));\n}\n\nconst sleep = (ms: number): Promise<void> => new Promise(r => setTimeout(r, ms));\n","import type { Result } from './types.js';\nimport { ok } from './constructors.js';\n\n/*\n Returns `ok([...values])` if every result succeeds, or the first `fail` encountered.\n \n @example\n * const result = all([findUser(id), findAccount(id)]);\n * // Result<[User, Account], Error>\n /\nexport function all<T, E>(results: Result<T, E>[]): Result<T[], E> {\n const values: T[] = [];\n for (const r of results) {\n if (!r.ok) return r;\n values.push(r.value);\n }\n return ok(values);\n}\n\n/\n Returns the first successful result from a list of async operations,\n * tried sequentially. Returns the last failure if all fail.\n \n @example\n * const result = await any([\n * () => run(() => primaryCache.get(key)),\n * () => run(() => database.find(key)),\n * ]);\n /\nexport async function any<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n for (const op of operations) {\n last = await op();\n if (last.ok) return last;\n }\n return last;\n}\n\nexport interface ParallelOptions {\n /* Max number of operations running concurrently. Default: all at once. /\n concurrency?: number;\n}\n\n/\n Runs operations concurrently (optionally throttled by `concurrency`).\n * Returns `ok([...values])` if all succeed, or the first failure.\n \n @example\n * const result = await parallel(\n * userIds.map(id => () => run(() => fetchUser(id))),\n * { concurrency: 5 },\n * );\n /\nexport async function parallel<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n options?: ParallelOptions,\n): Promise<Result<T[], E>> {\n const concurrency = options?.concurrency ?? operations.length;\n const results: Result<T, E>[] = [];\n\n for (let i = 0; i < operations.length; i += concurrency) {\n const batch = await Promise.all(operations.slice(i, i + concurrency).map(op => op()));\n results.push(...batch);\n }\n\n return all(results);\n}\n\n/\n Splits an array of Results into `[successValues, errorValues]`.\n \n @example\n * const [users, errors] = partition(results);\n /\nexport function partition<T, E>(results: Result<T, E>[]): [T[], E[]] {\n const values: T[] = [];\n const errors: E[] = [];\n for (const r of results) {\n if (r.ok) values.push(r.value);\n else errors.push(r.error);\n }\n return [values, errors];\n}\n\n/\n Extracts only the success values, silently discarding failures.\n \n @example\n * const users = collect(results); // User[]\n /\nexport function collect<T, E>(results: Result<T, E>[]): T[] {\n return results\n .filter((r): r is Extract<Result<T, E>, { ok: true }> => r.ok)\n .map(r => r.value);\n}\n\n/\n Maps each item through a Result-returning function, collecting all successes\n * into an array or short-circuiting on the first failure.\n \n @example\n * const result = traverse(ids, id => fromNullable(cache.get(id), 'not-found'));\n /\nexport function traverse<T, U, E>(\n items: T[],\n fn: (item: T) => Result<U, E>,\n): Result<U[], E> {\n return all(items.map(fn));\n}\n\n// ── Typed tuple combinators ────────────────────────────────────────────────\n\n/* Combines two Results into a tuple. Short-circuits on first failure. /\nexport function combine2<A, B, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n): Result<[A, B], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n return ok([r1.value, r2.value]);\n}\n\n/* Combines three Results into a typed tuple. Short-circuits on first failure. /\nexport function combine3<A, B, C, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n r3: Result<C, E>,\n): Result<[A, B, C], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n if (!r3.ok) return r3;\n return ok([r1.value, r2.value, r3.value]);\n}\n","import type { Result, RichResult } from './types.js';\nimport { ok, fail } from './constructors.js';\nimport { isRich } from './guards.js';\n\n/\n Fluent pipeline wrapper around `Result<T, E>`.\n * Operations short-circuit on failure — subsequent transforms are skipped.\n \n @example\n * const price = Flow.from(findProduct(id))\n * .map(p => p.price)\n * .filter(price => price > 0, new Error('Price must be positive'))\n * .map(price => price * taxRate)\n * .getResult();\n /\nexport class Flow<T, E = Error> {\n private constructor(private readonly _result: Result<T, E>) {}\n\n /* Start a pipeline from an existing Result. /\n static from<T, E>(result: Result<T, E>): Flow<T, E> {\n return new Flow(result);\n }\n\n /* Start an empty pipeline (value is `undefined`). /\n static start(): Flow<void, never> {\n return new Flow(ok(undefined));\n }\n\n /* Maps the success value. Skipped on failure. /\n map<U>(fn: (value: T) => U): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(ok(fn(this._result.value)));\n }\n\n /* Maps the error value. Skipped on success. /\n mapError<F>(fn: (error: E) => F): Flow<T, F> {\n if (this._result.ok) return new Flow<T, F>(this._result as unknown as Result<T, F>);\n return new Flow(fail(fn(this._result.error)));\n }\n\n /* Chains a Result-returning function. Skipped on failure. /\n flatMap<U>(fn: (value: T) => Result<U, E>): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(fn(this._result.value));\n }\n\n /* Filters the success value. Becomes `fail(error)` if predicate is false. /\n filter(pred: (value: T) => boolean, error: E): Flow<T, E> {\n if (!this._result.ok) return this;\n return pred(this._result.value) ? this : new Flow(fail(error));\n }\n\n /* Runs a side effect on success; returns `this` unchanged. /\n tap(fn: (value: T) => void): this {\n if (this._result.ok) fn(this._result.value);\n return this;\n }\n\n /* Runs a side effect on failure; returns `this` unchanged. /\n tapError(fn: (error: E) => void): this {\n if (!this._result.ok) fn(this._result.error);\n return this;\n }\n\n /\n Recovers from a failure by computing a new success value.\n * Skipped if already Ok.\n /\n recover(fn: (error: E) => T): Flow<T, never> {\n if (this._result.ok) return new Flow<T, never>(this._result as unknown as Result<T, never>);\n return new Flow(ok(fn(this._result.error)));\n }\n\n /* Exhaustive pattern match — always produces a value. /\n match<R>(handlers: { ok: (value: T) => R; fail: (error: E) => R }): R {\n return this._result.ok\n ? handlers.ok(this._result.value)\n : handlers.fail(this._result.error);\n }\n\n /* Returns the underlying `Result<T, E>`. /\n getResult(): Result<T, E> {\n return this._result;\n }\n\n /\n Returns the underlying result as `RichResult<T, E>` if it was created by `track()`.\n * Throws if the result has no observability metadata.\n */\n getRichResult(): RichResult<T, E> {\n if (!isRich(this._result)) throw new Error('Result is not a RichResult');\n return this._result;\n }\n\n isOk(): boolean { return this._result.ok; }\n isFail(): boolean { return !this._result.ok; }\n}\n"]}

package/dist/index.d.cts CHANGED Viewed

@@ -128,6 +128,16 @@ interface RetryOptions<E> {
 interface BackoffOptions<E> extends RetryOptions<E> {
     /** Cap for the computed backoff delay. Default: 30_000 */
     maxDelayMs?: number;
+    /**
+     * Adds random noise to the backoff delay to avoid thundering herd when
+     * multiple instances retry simultaneously.
+     *
+     * - `true`   → full jitter: delay = random(0, computedDelay)
+     * - `number` → partial jitter: delay ± (computedDelay * factor), clamped to [0, maxDelayMs]
+     *              e.g. 0.25 adds ±25% noise
+     * - `false`  → no jitter (default)
+     */
+    jitter?: boolean | number;
 }
 /**
  * Retries a Result-returning function up to `options.attempts` times with

package/dist/index.d.ts CHANGED Viewed

@@ -128,6 +128,16 @@ interface RetryOptions<E> {
 interface BackoffOptions<E> extends RetryOptions<E> {
     /** Cap for the computed backoff delay. Default: 30_000 */
     maxDelayMs?: number;
+    /**
+     * Adds random noise to the backoff delay to avoid thundering herd when
+     * multiple instances retry simultaneously.
+     *
+     * - `true`   → full jitter: delay = random(0, computedDelay)
+     * - `number` → partial jitter: delay ± (computedDelay * factor), clamped to [0, maxDelayMs]
+     *              e.g. 0.25 adds ±25% noise
+     * - `false`  → no jitter (default)
+     */
+    jitter?: boolean | number;
 }
 /**
  * Retries a Result-returning function up to `options.attempts` times with

package/dist/index.js CHANGED Viewed

@@ -148,11 +148,7 @@ async function retryWithBackoff(fn, options) {
     if (attempt === options.attempts) break;
     if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;
     options.onRetry?.(last.error, attempt);
-    const delay = Math.min(
-      (options.delayMs ?? 100) * Math.pow(2, attempt - 1),
-      options.maxDelayMs ?? 3e4
-    );
-    await sleep(delay);
+    await sleep(computeBackoffDelay(attempt, options));
   }
   return last;
 }
@@ -162,6 +158,17 @@ async function withTimeout(fn, ms, timeoutError) {
   );
   return Promise.race([fn(), timer]);
 }
+function computeBackoffDelay(attempt, options) {
+  const base = (options.delayMs ?? 100) * Math.pow(2, attempt - 1);
+  const capped = Math.min(base, options.maxDelayMs ?? 3e4);
+  const { jitter } = options;
+  if (!jitter) return capped;
+  if (jitter === true) {
+    return Math.random() * capped;
+  }
+  const noise = (Math.random() * 2 - 1) * capped * jitter;
+  return Math.max(0, Math.min(capped + noise, options.maxDelayMs ?? 3e4));
+}
 var sleep = (ms) => new Promise((r) => setTimeout(r, ms));
 // src/result/combinators.ts

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/result/constructors.ts","../src/result/guards.ts","../src/result/operations.ts","../src/result/run.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";AAGO,IAAM,KAAK,CAAe,KAAA,MAC9B,EAAE,EAAA,EAAI,MAAM,KAAA,EAAM;AAGd,IAAM,OAAO,CAAuB,KAAA,MACxC,EAAE,EAAA,EAAI,OAAO,KAAA,EAAM;AASf,SAAS,aAAA,CACd,IACA,cAAA,EACc;AACd,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,IAAI,CAAA;AAAA,EAChB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,WAAA,CACpB,SACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AAAA,EACzB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AASO,SAAS,YAAA,CACd,OACA,KAAA,EACc;AACd,EAAA,OAAO,SAAS,IAAA,GAAO,EAAA,CAAG,KAAK,CAAA,GAAI,KAAK,KAAK,CAAA;AAC/C;;;ACnDO,SAAS,KAAW,MAAA,EAAgD;AACzE,EAAA,OAAO,OAAO,EAAA,KAAO,IAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,OAAO,EAAA,KAAO,KAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,YAAA,IAAgB,MAAA;AACzB;;;ACZO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAK,EAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAAS,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AACnD;AAGO,SAAS,OAAA,CACd,QACA,EAAA,EACc;AACd,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,MAAA;AACxC;AAGA,eAAsB,YAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,OAAO,MAAA,CAAO,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC9D;AAGA,eAAsB,QAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC7C,EAAA,OAAO,EAAA,CAAG,MAAM,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAClC;AAaO,SAAS,KAAA,CACd,QACA,QAAA,EACG;AACH,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,QAAA,CAAS,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC3E;AAGO,IAAM,IAAA,GAAO;AAKb,SAAS,GAAA,CAAU,QAAsB,EAAA,EAAsC;AACpF,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA;AAC9B,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,QAAA,CAAe,QAAsB,EAAA,EAAsC;AACzF,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,OAAO,KAAK,CAAA;AAC/B,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,OAAa,MAAA,EAAyB;AACpD,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,MAAA,CAAO,KAAA,YAAiB,KAAA,GAAQ,MAAA,CAAO,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AACrF;AAGO,SAAS,YAAkB,MAAA,EAAyB;AACzD,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC9B,EAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AACtD;AAGO,SAAS,QAAA,CAAe,QAAsB,YAAA,EAAoB;AACvE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,YAAA;AACpC;AAGO,SAAS,YAAA,CAAmB,QAAsB,EAAA,EAAwB;AAC/E,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,EAAA,CAAG,OAAO,KAAK,CAAA;AACnD;AAGO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAAoB;AACrE,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AACzB;AAKO,SAAS,UAAgB,MAAA,EAAkC;AAChE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAChF;AAGO,SAAS,WAAiB,MAAA,EAAgC;AAC/D,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,IAAA;AACpC;AAGO,SAAS,YAAkB,MAAA,EAAqC;AACrE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,MAAA;AACpC;;;AC7GA,eAAsB,GAAA,CACpB,IACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,EAAA,EAAI,CAAA;AAAA,EACtB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,KAAA,CACpB,IACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAY,YAAY,GAAA,EAAI;AAClC,EAAA,MAAM,SAAA,GAAA,iBAAY,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AACzC,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,UAAA,EAAe,CAAA;AAAA,IACf,SAAA;AAAA,IACA,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,EAAG;AACvB,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACvF,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,QAAQ,OAAA,EAAS,cAAA,GAAiB,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA,GAAK,MAAA;AAC1E,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACxF;AACF;AAMO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAA0C;AAC3F,EAAA,OAAO;AAAA,IACL,GAAG,MAAA;AAAA,IACH,UAAA,EAAe,CAAA;AAAA,IACf,SAAA,EAAA,iBAAe,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AAAA,IACtC,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AACF;AAKO,SAAS,SAAe,IAAA,EAAsC;AACnE,EAAA,OAAO,IAAA,CAAK,EAAA,GACR,EAAE,EAAA,EAAI,MAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAC/B,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AACrC;;;AC3CA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,IAAI,OAAA,CAAQ,OAAA,EAAS,MAAM,KAAA,CAAM,QAAQ,OAAO,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,gBAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA;AAAA,MAAA,CAChB,QAAQ,OAAA,IAAW,GAAA,IAAO,KAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAC,CAAA;AAAA,MAClD,QAAQ,UAAA,IAAc;AAAA,KACxB;AACA,IAAA,MAAM,MAAM,KAAK,CAAA;AAAA,EACnB;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,WAAA,CACpB,EAAA,EACA,EAAA,EACA,YAAA,EACuB;AACvB,EAAA,MAAM,QAAQ,IAAI,OAAA;AAAA,IAAsB,CAAA,OAAA,KACtC,WAAW,MAAM,OAAA,CAAQ,KAAW,YAAY,CAAC,GAAG,EAAE;AAAA,GACxD;AACA,EAAA,OAAO,QAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AACnC;AAEA,IAAM,KAAA,GAAQ,CAAC,EAAA,KAA8B,IAAI,QAAQ,CAAA,CAAA,KAAK,UAAA,CAAW,CAAA,EAAG,EAAE,CAAC,CAAA;;;AC7FxE,SAAS,IAAU,OAAA,EAAyC;AACjE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA;AAClB,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAG,MAAM,CAAA;AAClB;AAYA,eAAsB,IACpB,UAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AACJ,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC3B,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AAAA,EACtB;AACA,EAAA,OAAO,IAAA;AACT;AAiBA,eAAsB,QAAA,CACpB,YACA,OAAA,EACyB;AACzB,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,IAAe,UAAA,CAAW,MAAA;AACvD,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,EAAQ,KAAK,WAAA,EAAa;AACvD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,WAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,WAAW,CAAA,CAAE,GAAA,CAAI,CAAA,EAAA,KAAM,EAAA,EAAI,CAAC,CAAA;AACpF,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACvB;AAEA,EAAA,OAAO,IAAI,OAAO,CAAA;AACpB;AAQO,SAAS,UAAgB,OAAA,EAAqC;AACnE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAA,CAAE,EAAA,EAAI,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,SACxB,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAK,CAAA;AAAA,EAC1B;AACA,EAAA,OAAO,CAAC,QAAQ,MAAM,CAAA;AACxB;AAQO,SAAS,QAAc,OAAA,EAA8B;AAC1D,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,CAAA,KAAgD,CAAA,CAAE,EAAE,CAAA,CAC5D,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,KAAK,CAAA;AACrB;AASO,SAAS,QAAA,CACd,OACA,EAAA,EACgB;AAChB,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA;AAC1B;AAKO,SAAS,QAAA,CACd,IACA,EAAA,EACmB;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,GAAG,CAAC,EAAA,CAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAChC;AAGO,SAAS,QAAA,CACd,EAAA,EACA,EAAA,EACA,EAAA,EACsB;AACtB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,EAAA,CAAG,CAAC,EAAA,CAAG,KAAA,EAAO,GAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAC1C;;;ACvHO,IAAM,IAAA,GAAN,MAAM,KAAA,CAAmB;AAAA,EACtB,YAA6B,OAAA,EAAuB;AAAvB,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAAwB;AAAA,EAAxB,OAAA;AAAA;AAAA,EAGrC,OAAO,KAAW,MAAA,EAAkC;AAClD,IAAA,OAAO,IAAI,MAAK,MAAM,CAAA;AAAA,EACxB;AAAA;AAAA,EAGA,OAAO,KAAA,GAA2B;AAChC,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,MAAS,CAAC,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAO,EAAA,EAAiC;AACtC,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,SAAY,EAAA,EAAiC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AAClF,IAAA,OAAO,IAAI,MAAK,IAAA,CAAK,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC9C;AAAA;AAAA,EAGA,QAAW,EAAA,EAA4C;AACrD,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACxC;AAAA;AAAA,EAGA,MAAA,CAAO,MAA6B,KAAA,EAAsB;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,IAAA;AAC7B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAO,IAAI,KAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,IAAI,EAAA,EAA8B;AAChC,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,EAAA,EAA8B;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC3C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,EAAA,EAAqC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAe,KAAK,OAAsC,CAAA;AAC1F,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,MAAS,QAAA,EAA6D;AACpE,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,EAAA,GAChB,QAAA,CAAS,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAC9B,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,SAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAkC;AAChC,IAAA,IAAI,CAAC,OAAO,IAAA,CAAK,OAAO,GAAG,MAAM,IAAI,MAAM,4BAA4B,CAAA;AACvE,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEA,IAAA,GAAkB;AAAE,IAAA,OAAO,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAAA,EAC5C,MAAA,GAAkB;AAAE,IAAA,OAAO,CAAC,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAC/C","file":"index.js","sourcesContent":["import type { Result } from './types.js';\n\n/** Creates a successful Result. /\nexport const ok = <T, E = never>(value: T): Result<T, E> =>\n ({ ok: true, value });\n\n/* Creates a failed Result. /\nexport const fail = <T = never, E = Error>(error: E): Result<T, E> =>\n ({ ok: false, error });\n\n/\n Wraps a synchronous throwable function. Catches any thrown value and\n * passes it through `errorTransform` (defaults to identity cast).\n \n @example\n * const result = fromThrowable(() => JSON.parse(raw), (e) => new ParseError(e));\n /\nexport function fromThrowable<T, E = Error>(\n fn: () => T,\n errorTransform?: (caught: unknown) => E,\n): Result<T, E> {\n try {\n return ok(fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a Promise to a `Promise<Result<T, E>>`, catching rejections.\n \n @example\n * const result = await fromPromise(fetch(url), (e) => new NetworkError(e));\n /\nexport async function fromPromise<T, E = Error>(\n promise: Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await promise);\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a nullable value to a Result.\n * Returns `ok(value)` if non-null/undefined, `fail(error)` otherwise.\n \n @example\n * const result = fromNullable(user, new NotFoundError('user'));\n /\nexport function fromNullable<T, E>(\n value: T \| null \| undefined,\n error: E,\n): Result<T, E> {\n return value != null ? ok(value) : fail(error);\n}\n","import type { Result, RichResult } from './types.js';\n\ntype OkResult<T, E> = Extract<Result<T, E>, { ok: true }>;\ntype FailResult<T, E> = Extract<Result<T, E>, { ok: false }>;\n\n/* Narrows a `Result<T, E>` to its success branch. /\nexport function isOk<T, E>(result: Result<T, E>): result is OkResult<T, E> {\n return result.ok === true;\n}\n\n/* Narrows a `Result<T, E>` to its failure branch. /\nexport function isFail<T, E>(result: Result<T, E>): result is FailResult<T, E> {\n return result.ok === false;\n}\n\n/* Returns `true` if the result carries observability metadata (`track()` output). /\nexport function isRich<T, E>(result: Result<T, E>): result is RichResult<T, E> {\n return 'durationMs' in result;\n}\n","import type { Result } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n// ── Transformations ────────────────────────────────────────────────────────\n\n/* Maps the success value. Passes failures through unchanged. /\nexport function map<T, U, E>(result: Result<T, E>, fn: (value: T) => U): Result<U, E> {\n return result.ok ? ok(fn(result.value)) : result;\n}\n\n/* Maps the error value. Passes successes through unchanged. /\nexport function mapError<T, E, F>(result: Result<T, E>, fn: (error: E) => F): Result<T, F> {\n return result.ok ? result : fail(fn(result.error));\n}\n\n/* Monadic bind — chains a Result-returning function on success. /\nexport function flatMap<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Result<U, E>,\n): Result<U, E> {\n return result.ok ? fn(result.value) : result;\n}\n\n/* Async variant of `flatMap`. /\nexport async function flatMapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<Result<U, E>>,\n): Promise<Result<U, E>> {\n return result.ok ? fn(result.value) : Promise.resolve(result);\n}\n\n/* Async variant of `map`. /\nexport async function mapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<U>,\n): Promise<Result<U, E>> {\n if (!result.ok) return Promise.resolve(result);\n return ok(await fn(result.value));\n}\n\n// ── Pattern matching ───────────────────────────────────────────────────────\n\n/\n Exhaustive pattern match over both branches.\n \n @example\n * const msg = match(result, {\n * ok: (user) => `Welcome, ${user.name}`,\n * fail: (error) => `Error: ${error.message}`,\n * });\n /\nexport function match<T, E, R>(\n result: Result<T, E>,\n handlers: { ok: (value: T) => R; fail: (error: E) => R },\n): R {\n return result.ok ? handlers.ok(result.value) : handlers.fail(result.error);\n}\n\n/* Alias for `match` — familiar to fp-ts / Scala users. /\nexport const fold = match;\n\n// ── Side effects ───────────────────────────────────────────────────────────\n\n/* Runs a side effect on the success value; returns the result unchanged. /\nexport function tap<T, E>(result: Result<T, E>, fn: (value: T) => void): Result<T, E> {\n if (result.ok) fn(result.value);\n return result;\n}\n\n/* Runs a side effect on the error value; returns the result unchanged. /\nexport function tapError<T, E>(result: Result<T, E>, fn: (error: E) => void): Result<T, E> {\n if (!result.ok) fn(result.error);\n return result;\n}\n\n// ── Unwrapping ─────────────────────────────────────────────────────────────\n\n/* Extracts the value or throws the error (re-thrown as-is if it's an Error, wrapped otherwise). /\nexport function unwrap<T, E>(result: Result<T, E>): T {\n if (result.ok) return result.value;\n throw result.error instanceof Error ? result.error : new Error(String(result.error));\n}\n\n/* Extracts the error or throws if the result is Ok. /\nexport function unwrapError<T, E>(result: Result<T, E>): E {\n if (!result.ok) return result.error;\n throw new Error('Called unwrapError on an Ok result');\n}\n\n/* Extracts the value or returns `defaultValue` on failure. /\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n return result.ok ? result.value : defaultValue;\n}\n\n/* Extracts the value or computes a fallback from the error. /\nexport function unwrapOrElse<T, E>(result: Result<T, E>, fn: (error: E) => T): T {\n return result.ok ? result.value : fn(result.error);\n}\n\n/* Extracts the value or throws with a custom `message`. /\nexport function expect<T, E>(result: Result<T, E>, message: string): T {\n if (result.ok) return result.value;\n throw new Error(message);\n}\n\n// ── Conversion ─────────────────────────────────────────────────────────────\n\n/* Converts to a Promise — resolves on Ok, rejects on Fail. /\nexport function toPromise<T, E>(result: Result<T, E>): Promise<T> {\n return result.ok ? Promise.resolve(result.value) : Promise.reject(result.error);\n}\n\n/* Returns the value or `null` on failure. /\nexport function toNullable<T, E>(result: Result<T, E>): T \| null {\n return result.ok ? result.value : null;\n}\n\n/* Returns the value or `undefined` on failure. /\nexport function toUndefined<T, E>(result: Result<T, E>): T \| undefined {\n return result.ok ? result.value : undefined;\n}\n","import type { Result, RichResult, TrackOptions } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n/\n Executes an async (or sync) function and captures any thrown exception,\n * returning a `Result<T, E>` instead of propagating the error.\n \n @example\n * const result = await run(() => fetchUser(id));\n * const result = await run(() => fetchUser(id), (e) => new UserError(e));\n /\nexport async function run<T, E = Error>(\n fn: () => T \| Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Like `run()` but also captures timing and metadata, returning a `RichResult<T, E>`.\n \n @example\n * const result = await track(() => fetchUser(id), { operation: 'user.fetch', tags: ['db'] });\n /\nexport async function track<T, E = Error>(\n fn: () => T \| Promise<T>,\n options?: TrackOptions & { errorTransform?: (caught: unknown) => E },\n): Promise<RichResult<T, E>> {\n const start = performance.now();\n const timestamp = new Date().toISOString();\n const meta = {\n durationMs: 0,\n timestamp,\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n\n try {\n const value = await fn();\n return { ok: true, value, ...meta, durationMs: Math.round(performance.now() - start) };\n } catch (caught) {\n const error = options?.errorTransform ? options.errorTransform(caught) : (caught as E);\n return { ok: false, error, ...meta, durationMs: Math.round(performance.now() - start) };\n }\n}\n\n/\n Promotes a plain `Result<T, E>` to a `RichResult<T, E>` with a zero-duration snapshot.\n * Useful when you already have a Result and want to attach metadata.\n /\nexport function enrich<T, E>(result: Result<T, E>, options?: TrackOptions): RichResult<T, E> {\n return {\n ...result,\n durationMs: 0,\n timestamp: new Date().toISOString(),\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n}\n\n/\n Strips observability metadata from a `RichResult`, returning a plain `Result<T, E>`.\n /\nexport function simplify<T, E>(rich: RichResult<T, E>): Result<T, E> {\n return rich.ok\n ? { ok: true, value: rich.value }\n : { ok: false, error: rich.error };\n}\n","import type { Result } from './types.js';\nimport { fail } from './constructors.js';\n\nexport interface RetryOptions<E> {\n /* Maximum number of attempts (including the first). /\n attempts: number;\n /* Fixed delay in ms between attempts. Default: 0 /\n delayMs?: number;\n /* Return false to stop retrying early based on the error. /\n shouldRetry?: (error: E, attempt: number) => boolean;\n /* Called before each retry with the previous error and attempt number. /\n onRetry?: (error: E, attempt: number) => void;\n}\n\nexport interface BackoffOptions<E> extends RetryOptions<E> {\n /* Cap for the computed backoff delay. Default: 30_000 /\n maxDelayMs?: number;\n}\n\n/\n Retries a Result-returning function up to `options.attempts` times with\n * an optional fixed delay between attempts.\n \n @example\n * const result = await retry(() => run(() => callApi()), {\n * attempts: 3,\n * delayMs: 500,\n * shouldRetry: (err) => err.code === 'ECONNRESET',\n * });\n /\nexport async function retry<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: RetryOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n if (options.delayMs) await sleep(options.delayMs);\n }\n\n return last;\n}\n\n/\n Like `retry()` but uses exponential backoff: delay doubles on each attempt,\n * capped at `maxDelayMs`.\n \n @example\n * const result = await retryWithBackoff(() => run(() => callApi()), {\n * attempts: 4,\n * delayMs: 100, // 100ms → 200ms → 400ms\n * maxDelayMs: 1_000,\n * });\n /\nexport async function retryWithBackoff<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: BackoffOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n const delay = Math.min(\n (options.delayMs ?? 100) Math.pow(2, attempt - 1),\n options.maxDelayMs ?? 30_000,\n );\n await sleep(delay);\n }\n\n return last;\n}\n\n/*\n Races a Result-returning function against a timeout.\n * Returns `fail(timeoutError)` if `ms` elapses before the function resolves.\n \n @example\n * const result = await withTimeout(\n * () => run(() => fetchData()),\n * 5_000,\n * new TimeoutError('fetchData timed out'),\n * );\n /\nexport async function withTimeout<T, E>(\n fn: () => Promise<Result<T, E>>,\n ms: number,\n timeoutError: E,\n): Promise<Result<T, E>> {\n const timer = new Promise<Result<T, E>>(resolve =>\n setTimeout(() => resolve(fail<T, E>(timeoutError)), ms),\n );\n return Promise.race([fn(), timer]);\n}\n\nconst sleep = (ms: number): Promise<void> => new Promise(r => setTimeout(r, ms));\n","import type { Result } from './types.js';\nimport { ok } from './constructors.js';\n\n/\n Returns `ok([...values])` if every result succeeds, or the first `fail` encountered.\n \n @example\n * const result = all([findUser(id), findAccount(id)]);\n * // Result<[User, Account], Error>\n /\nexport function all<T, E>(results: Result<T, E>[]): Result<T[], E> {\n const values: T[] = [];\n for (const r of results) {\n if (!r.ok) return r;\n values.push(r.value);\n }\n return ok(values);\n}\n\n/\n Returns the first successful result from a list of async operations,\n * tried sequentially. Returns the last failure if all fail.\n \n @example\n * const result = await any([\n * () => run(() => primaryCache.get(key)),\n * () => run(() => database.find(key)),\n * ]);\n /\nexport async function any<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n for (const op of operations) {\n last = await op();\n if (last.ok) return last;\n }\n return last;\n}\n\nexport interface ParallelOptions {\n /* Max number of operations running concurrently. Default: all at once. /\n concurrency?: number;\n}\n\n/\n Runs operations concurrently (optionally throttled by `concurrency`).\n * Returns `ok([...values])` if all succeed, or the first failure.\n \n @example\n * const result = await parallel(\n * userIds.map(id => () => run(() => fetchUser(id))),\n * { concurrency: 5 },\n * );\n /\nexport async function parallel<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n options?: ParallelOptions,\n): Promise<Result<T[], E>> {\n const concurrency = options?.concurrency ?? operations.length;\n const results: Result<T, E>[] = [];\n\n for (let i = 0; i < operations.length; i += concurrency) {\n const batch = await Promise.all(operations.slice(i, i + concurrency).map(op => op()));\n results.push(...batch);\n }\n\n return all(results);\n}\n\n/\n Splits an array of Results into `[successValues, errorValues]`.\n \n @example\n * const [users, errors] = partition(results);\n /\nexport function partition<T, E>(results: Result<T, E>[]): [T[], E[]] {\n const values: T[] = [];\n const errors: E[] = [];\n for (const r of results) {\n if (r.ok) values.push(r.value);\n else errors.push(r.error);\n }\n return [values, errors];\n}\n\n/\n Extracts only the success values, silently discarding failures.\n \n @example\n * const users = collect(results); // User[]\n /\nexport function collect<T, E>(results: Result<T, E>[]): T[] {\n return results\n .filter((r): r is Extract<Result<T, E>, { ok: true }> => r.ok)\n .map(r => r.value);\n}\n\n/\n Maps each item through a Result-returning function, collecting all successes\n * into an array or short-circuiting on the first failure.\n \n @example\n * const result = traverse(ids, id => fromNullable(cache.get(id), 'not-found'));\n /\nexport function traverse<T, U, E>(\n items: T[],\n fn: (item: T) => Result<U, E>,\n): Result<U[], E> {\n return all(items.map(fn));\n}\n\n// ── Typed tuple combinators ────────────────────────────────────────────────\n\n/* Combines two Results into a tuple. Short-circuits on first failure. /\nexport function combine2<A, B, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n): Result<[A, B], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n return ok([r1.value, r2.value]);\n}\n\n/* Combines three Results into a typed tuple. Short-circuits on first failure. /\nexport function combine3<A, B, C, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n r3: Result<C, E>,\n): Result<[A, B, C], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n if (!r3.ok) return r3;\n return ok([r1.value, r2.value, r3.value]);\n}\n","import type { Result, RichResult } from './types.js';\nimport { ok, fail } from './constructors.js';\nimport { isRich } from './guards.js';\n\n/\n Fluent pipeline wrapper around `Result<T, E>`.\n * Operations short-circuit on failure — subsequent transforms are skipped.\n \n @example\n * const price = Flow.from(findProduct(id))\n * .map(p => p.price)\n * .filter(price => price > 0, new Error('Price must be positive'))\n * .map(price => price * taxRate)\n * .getResult();\n /\nexport class Flow<T, E = Error> {\n private constructor(private readonly _result: Result<T, E>) {}\n\n /* Start a pipeline from an existing Result. /\n static from<T, E>(result: Result<T, E>): Flow<T, E> {\n return new Flow(result);\n }\n\n /* Start an empty pipeline (value is `undefined`). /\n static start(): Flow<void, never> {\n return new Flow(ok(undefined));\n }\n\n /* Maps the success value. Skipped on failure. /\n map<U>(fn: (value: T) => U): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(ok(fn(this._result.value)));\n }\n\n /* Maps the error value. Skipped on success. /\n mapError<F>(fn: (error: E) => F): Flow<T, F> {\n if (this._result.ok) return new Flow<T, F>(this._result as unknown as Result<T, F>);\n return new Flow(fail(fn(this._result.error)));\n }\n\n /* Chains a Result-returning function. Skipped on failure. /\n flatMap<U>(fn: (value: T) => Result<U, E>): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(fn(this._result.value));\n }\n\n /* Filters the success value. Becomes `fail(error)` if predicate is false. /\n filter(pred: (value: T) => boolean, error: E): Flow<T, E> {\n if (!this._result.ok) return this;\n return pred(this._result.value) ? this : new Flow(fail(error));\n }\n\n /* Runs a side effect on success; returns `this` unchanged. /\n tap(fn: (value: T) => void): this {\n if (this._result.ok) fn(this._result.value);\n return this;\n }\n\n /* Runs a side effect on failure; returns `this` unchanged. /\n tapError(fn: (error: E) => void): this {\n if (!this._result.ok) fn(this._result.error);\n return this;\n }\n\n /\n Recovers from a failure by computing a new success value.\n * Skipped if already Ok.\n /\n recover(fn: (error: E) => T): Flow<T, never> {\n if (this._result.ok) return new Flow<T, never>(this._result as unknown as Result<T, never>);\n return new Flow(ok(fn(this._result.error)));\n }\n\n /* Exhaustive pattern match — always produces a value. /\n match<R>(handlers: { ok: (value: T) => R; fail: (error: E) => R }): R {\n return this._result.ok\n ? handlers.ok(this._result.value)\n : handlers.fail(this._result.error);\n }\n\n /* Returns the underlying `Result<T, E>`. /\n getResult(): Result<T, E> {\n return this._result;\n }\n\n /\n Returns the underlying result as `RichResult<T, E>` if it was created by `track()`.\n * Throws if the result has no observability metadata.\n */\n getRichResult(): RichResult<T, E> {\n if (!isRich(this._result)) throw new Error('Result is not a RichResult');\n return this._result;\n }\n\n isOk(): boolean { return this._result.ok; }\n isFail(): boolean { return !this._result.ok; }\n}\n"]}
1	+ {"version":3,"sources":["../src/result/constructors.ts","../src/result/guards.ts","../src/result/operations.ts","../src/result/run.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";AAGO,IAAM,KAAK,CAAe,KAAA,MAC9B,EAAE,EAAA,EAAI,MAAM,KAAA,EAAM;AAGd,IAAM,OAAO,CAAuB,KAAA,MACxC,EAAE,EAAA,EAAI,OAAO,KAAA,EAAM;AASf,SAAS,aAAA,CACd,IACA,cAAA,EACc;AACd,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,IAAI,CAAA;AAAA,EAChB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,WAAA,CACpB,SACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AAAA,EACzB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AASO,SAAS,YAAA,CACd,OACA,KAAA,EACc;AACd,EAAA,OAAO,SAAS,IAAA,GAAO,EAAA,CAAG,KAAK,CAAA,GAAI,KAAK,KAAK,CAAA;AAC/C;;;ACnDO,SAAS,KAAW,MAAA,EAAgD;AACzE,EAAA,OAAO,OAAO,EAAA,KAAO,IAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,OAAO,EAAA,KAAO,KAAA;AACvB;AAGO,SAAS,OAAa,MAAA,EAAkD;AAC7E,EAAA,OAAO,YAAA,IAAgB,MAAA;AACzB;;;ACZO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAK,EAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAAS,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AACnD;AAGO,SAAS,OAAA,CACd,QACA,EAAA,EACc;AACd,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,MAAA;AACxC;AAGA,eAAsB,YAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,OAAO,MAAA,CAAO,KAAK,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC9D;AAGA,eAAsB,QAAA,CACpB,QACA,EAAA,EACuB;AACvB,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAC7C,EAAA,OAAO,EAAA,CAAG,MAAM,EAAA,CAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAClC;AAaO,SAAS,KAAA,CACd,QACA,QAAA,EACG;AACH,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,QAAA,CAAS,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC3E;AAGO,IAAM,IAAA,GAAO;AAKb,SAAS,GAAA,CAAU,QAAsB,EAAA,EAAsC;AACpF,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,MAAA,CAAO,KAAK,CAAA;AAC9B,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,QAAA,CAAe,QAAsB,EAAA,EAAsC;AACzF,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,EAAA,CAAG,OAAO,KAAK,CAAA;AAC/B,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,OAAa,MAAA,EAAyB;AACpD,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,MAAA,CAAO,KAAA,YAAiB,KAAA,GAAQ,MAAA,CAAO,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AACrF;AAGO,SAAS,YAAkB,MAAA,EAAyB;AACzD,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC9B,EAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AACtD;AAGO,SAAS,QAAA,CAAe,QAAsB,YAAA,EAAoB;AACvE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,YAAA;AACpC;AAGO,SAAS,YAAA,CAAmB,QAAsB,EAAA,EAAwB;AAC/E,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,EAAA,CAAG,OAAO,KAAK,CAAA;AACnD;AAGO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAAoB;AACrE,EAAA,IAAI,MAAA,CAAO,EAAA,EAAI,OAAO,MAAA,CAAO,KAAA;AAC7B,EAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AACzB;AAKO,SAAS,UAAgB,MAAA,EAAkC;AAChE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAChF;AAGO,SAAS,WAAiB,MAAA,EAAgC;AAC/D,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,IAAA;AACpC;AAGO,SAAS,YAAkB,MAAA,EAAqC;AACrE,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,MAAA;AACpC;;;AC7GA,eAAsB,GAAA,CACpB,IACA,cAAA,EACuB;AACvB,EAAA,IAAI;AACF,IAAA,OAAO,EAAA,CAAG,MAAM,EAAA,EAAI,CAAA;AAAA,EACtB,SAAS,MAAA,EAAQ;AACf,IAAA,OAAO,IAAA,CAAK,cAAA,GAAiB,cAAA,CAAe,MAAM,IAAK,MAAY,CAAA;AAAA,EACrE;AACF;AAQA,eAAsB,KAAA,CACpB,IACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAY,YAAY,GAAA,EAAI;AAClC,EAAA,MAAM,SAAA,GAAA,iBAAY,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AACzC,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,UAAA,EAAe,CAAA;AAAA,IACf,SAAA;AAAA,IACA,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,EAAG;AACvB,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACvF,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,QAAQ,OAAA,EAAS,cAAA,GAAiB,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA,GAAK,MAAA;AAC1E,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAG,IAAA,EAAM,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,KAAK,CAAA,EAAE;AAAA,EACxF;AACF;AAMO,SAAS,MAAA,CAAa,QAAsB,OAAA,EAA0C;AAC3F,EAAA,OAAO;AAAA,IACL,GAAG,MAAA;AAAA,IACH,UAAA,EAAe,CAAA;AAAA,IACf,SAAA,EAAA,iBAAe,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AAAA,IACtC,WAAe,OAAA,EAAS,SAAA;AAAA,IACxB,eAAe,OAAA,EAAS,aAAA;AAAA,IACxB,MAAe,OAAA,EAAS;AAAA,GAC1B;AACF;AAKO,SAAS,SAAe,IAAA,EAAsC;AACnE,EAAA,OAAO,IAAA,CAAK,EAAA,GACR,EAAE,EAAA,EAAI,MAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAC/B,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AACrC;;;ACjCA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,IAAI,OAAA,CAAQ,OAAA,EAAS,MAAM,KAAA,CAAM,QAAQ,OAAO,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,gBAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AAEJ,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,OAAA,CAAQ,UAAU,OAAA,EAAA,EAAW;AAC5D,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AACpB,IAAA,IAAI,OAAA,KAAY,QAAQ,QAAA,EAAU;AAClC,IAAA,IAAI,OAAA,CAAQ,eAAe,CAAC,OAAA,CAAQ,YAAY,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACtE,IAAA,OAAA,CAAQ,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACrC,IAAA,MAAM,KAAA,CAAM,mBAAA,CAAoB,OAAA,EAAS,OAAO,CAAC,CAAA;AAAA,EACnD;AAEA,EAAA,OAAO,IAAA;AACT;AAaA,eAAsB,WAAA,CACpB,EAAA,EACA,EAAA,EACA,YAAA,EACuB;AACvB,EAAA,MAAM,QAAQ,IAAI,OAAA;AAAA,IAAsB,CAAA,OAAA,KACtC,WAAW,MAAM,OAAA,CAAQ,KAAW,YAAY,CAAC,GAAG,EAAE;AAAA,GACxD;AACA,EAAA,OAAO,QAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AACnC;AAEA,SAAS,mBAAA,CAAuB,SAAiB,OAAA,EAAoC;AACnF,EAAA,MAAM,IAAA,GAAA,CAAW,QAAQ,OAAA,IAAW,GAAA,IAAO,KAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAC,CAAA;AAClE,EAAA,MAAM,SAAU,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,OAAA,CAAQ,cAAc,GAAM,CAAA;AAC3D,EAAA,MAAM,EAAE,QAAO,GAAI,OAAA;AAEnB,EAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AAEpB,EAAA,IAAI,WAAW,IAAA,EAAM;AAEnB,IAAA,OAAO,IAAA,CAAK,QAAO,GAAI,MAAA;AAAA,EACzB;AAGA,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,EAAO,GAAI,CAAA,GAAI,KAAK,MAAA,GAAS,MAAA;AACjD,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,SAAS,KAAA,EAAO,OAAA,CAAQ,UAAA,IAAc,GAAM,CAAC,CAAA;AAC3E;AAEA,IAAM,KAAA,GAAQ,CAAC,EAAA,KAA8B,IAAI,QAAQ,CAAA,CAAA,KAAK,UAAA,CAAW,CAAA,EAAG,EAAE,CAAC,CAAA;;;ACpHxE,SAAS,IAAU,OAAA,EAAyC;AACjE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA;AAClB,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAG,MAAM,CAAA;AAClB;AAYA,eAAsB,IACpB,UAAA,EACuB;AACvB,EAAA,IAAI,IAAA;AACJ,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC3B,IAAA,IAAA,GAAO,MAAM,EAAA,EAAG;AAChB,IAAA,IAAI,IAAA,CAAK,IAAI,OAAO,IAAA;AAAA,EACtB;AACA,EAAA,OAAO,IAAA;AACT;AAiBA,eAAsB,QAAA,CACpB,YACA,OAAA,EACyB;AACzB,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,IAAe,UAAA,CAAW,MAAA;AACvD,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,EAAQ,KAAK,WAAA,EAAa;AACvD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,WAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,WAAW,CAAA,CAAE,GAAA,CAAI,CAAA,EAAA,KAAM,EAAA,EAAI,CAAC,CAAA;AACpF,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACvB;AAEA,EAAA,OAAO,IAAI,OAAO,CAAA;AACpB;AAQO,SAAS,UAAgB,OAAA,EAAqC;AACnE,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,CAAA,CAAE,EAAA,EAAI,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,SACxB,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAK,CAAA;AAAA,EAC1B;AACA,EAAA,OAAO,CAAC,QAAQ,MAAM,CAAA;AACxB;AAQO,SAAS,QAAc,OAAA,EAA8B;AAC1D,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,CAAA,KAAgD,CAAA,CAAE,EAAE,CAAA,CAC5D,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,KAAK,CAAA;AACrB;AASO,SAAS,QAAA,CACd,OACA,EAAA,EACgB;AAChB,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA;AAC1B;AAKO,SAAS,QAAA,CACd,IACA,EAAA,EACmB;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,GAAG,CAAC,EAAA,CAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAChC;AAGO,SAAS,QAAA,CACd,EAAA,EACA,EAAA,EACA,EAAA,EACsB;AACtB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,IAAI,CAAC,EAAA,CAAG,EAAA,EAAI,OAAO,EAAA;AACnB,EAAA,OAAO,EAAA,CAAG,CAAC,EAAA,CAAG,KAAA,EAAO,GAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAC1C;;;ACvHO,IAAM,IAAA,GAAN,MAAM,KAAA,CAAmB;AAAA,EACtB,YAA6B,OAAA,EAAuB;AAAvB,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAAwB;AAAA,EAAxB,OAAA;AAAA;AAAA,EAGrC,OAAO,KAAW,MAAA,EAAkC;AAClD,IAAA,OAAO,IAAI,MAAK,MAAM,CAAA;AAAA,EACxB;AAAA;AAAA,EAGA,OAAO,KAAA,GAA2B;AAChC,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,MAAS,CAAC,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAO,EAAA,EAAiC;AACtC,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,SAAY,EAAA,EAAiC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AAClF,IAAA,OAAO,IAAI,MAAK,IAAA,CAAK,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC9C;AAAA;AAAA,EAGA,QAAW,EAAA,EAA4C;AACrD,IAAA,IAAI,CAAC,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAW,KAAK,OAAkC,CAAA;AACnF,IAAA,OAAO,IAAI,KAAA,CAAK,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACxC;AAAA;AAAA,EAGA,MAAA,CAAO,MAA6B,KAAA,EAAsB;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,IAAA;AAC7B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAO,IAAI,KAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,IAAI,EAAA,EAA8B;AAChC,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,EAAA,EAA8B;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,EAAA,CAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAC3C,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,EAAA,EAAqC;AAC3C,IAAA,IAAI,KAAK,OAAA,CAAQ,EAAA,SAAW,IAAI,KAAA,CAAe,KAAK,OAAsC,CAAA;AAC1F,IAAA,OAAO,IAAI,MAAK,EAAA,CAAG,EAAA,CAAG,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,MAAS,QAAA,EAA6D;AACpE,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,EAAA,GAChB,QAAA,CAAS,EAAA,CAAG,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,GAC9B,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,SAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAkC;AAChC,IAAA,IAAI,CAAC,OAAO,IAAA,CAAK,OAAO,GAAG,MAAM,IAAI,MAAM,4BAA4B,CAAA;AACvE,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEA,IAAA,GAAkB;AAAE,IAAA,OAAO,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAAA,EAC5C,MAAA,GAAkB;AAAE,IAAA,OAAO,CAAC,KAAK,OAAA,CAAQ,EAAA;AAAA,EAAI;AAC/C","file":"index.js","sourcesContent":["import type { Result } from './types.js';\n\n/** Creates a successful Result. /\nexport const ok = <T, E = never>(value: T): Result<T, E> =>\n ({ ok: true, value });\n\n/* Creates a failed Result. /\nexport const fail = <T = never, E = Error>(error: E): Result<T, E> =>\n ({ ok: false, error });\n\n/\n Wraps a synchronous throwable function. Catches any thrown value and\n * passes it through `errorTransform` (defaults to identity cast).\n \n @example\n * const result = fromThrowable(() => JSON.parse(raw), (e) => new ParseError(e));\n /\nexport function fromThrowable<T, E = Error>(\n fn: () => T,\n errorTransform?: (caught: unknown) => E,\n): Result<T, E> {\n try {\n return ok(fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a Promise to a `Promise<Result<T, E>>`, catching rejections.\n \n @example\n * const result = await fromPromise(fetch(url), (e) => new NetworkError(e));\n /\nexport async function fromPromise<T, E = Error>(\n promise: Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await promise);\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Converts a nullable value to a Result.\n * Returns `ok(value)` if non-null/undefined, `fail(error)` otherwise.\n \n @example\n * const result = fromNullable(user, new NotFoundError('user'));\n /\nexport function fromNullable<T, E>(\n value: T \| null \| undefined,\n error: E,\n): Result<T, E> {\n return value != null ? ok(value) : fail(error);\n}\n","import type { Result, RichResult } from './types.js';\n\ntype OkResult<T, E> = Extract<Result<T, E>, { ok: true }>;\ntype FailResult<T, E> = Extract<Result<T, E>, { ok: false }>;\n\n/* Narrows a `Result<T, E>` to its success branch. /\nexport function isOk<T, E>(result: Result<T, E>): result is OkResult<T, E> {\n return result.ok === true;\n}\n\n/* Narrows a `Result<T, E>` to its failure branch. /\nexport function isFail<T, E>(result: Result<T, E>): result is FailResult<T, E> {\n return result.ok === false;\n}\n\n/* Returns `true` if the result carries observability metadata (`track()` output). /\nexport function isRich<T, E>(result: Result<T, E>): result is RichResult<T, E> {\n return 'durationMs' in result;\n}\n","import type { Result } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n// ── Transformations ────────────────────────────────────────────────────────\n\n/* Maps the success value. Passes failures through unchanged. /\nexport function map<T, U, E>(result: Result<T, E>, fn: (value: T) => U): Result<U, E> {\n return result.ok ? ok(fn(result.value)) : result;\n}\n\n/* Maps the error value. Passes successes through unchanged. /\nexport function mapError<T, E, F>(result: Result<T, E>, fn: (error: E) => F): Result<T, F> {\n return result.ok ? result : fail(fn(result.error));\n}\n\n/* Monadic bind — chains a Result-returning function on success. /\nexport function flatMap<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Result<U, E>,\n): Result<U, E> {\n return result.ok ? fn(result.value) : result;\n}\n\n/* Async variant of `flatMap`. /\nexport async function flatMapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<Result<U, E>>,\n): Promise<Result<U, E>> {\n return result.ok ? fn(result.value) : Promise.resolve(result);\n}\n\n/* Async variant of `map`. /\nexport async function mapAsync<T, U, E>(\n result: Result<T, E>,\n fn: (value: T) => Promise<U>,\n): Promise<Result<U, E>> {\n if (!result.ok) return Promise.resolve(result);\n return ok(await fn(result.value));\n}\n\n// ── Pattern matching ───────────────────────────────────────────────────────\n\n/\n Exhaustive pattern match over both branches.\n \n @example\n * const msg = match(result, {\n * ok: (user) => `Welcome, ${user.name}`,\n * fail: (error) => `Error: ${error.message}`,\n * });\n /\nexport function match<T, E, R>(\n result: Result<T, E>,\n handlers: { ok: (value: T) => R; fail: (error: E) => R },\n): R {\n return result.ok ? handlers.ok(result.value) : handlers.fail(result.error);\n}\n\n/* Alias for `match` — familiar to fp-ts / Scala users. /\nexport const fold = match;\n\n// ── Side effects ───────────────────────────────────────────────────────────\n\n/* Runs a side effect on the success value; returns the result unchanged. /\nexport function tap<T, E>(result: Result<T, E>, fn: (value: T) => void): Result<T, E> {\n if (result.ok) fn(result.value);\n return result;\n}\n\n/* Runs a side effect on the error value; returns the result unchanged. /\nexport function tapError<T, E>(result: Result<T, E>, fn: (error: E) => void): Result<T, E> {\n if (!result.ok) fn(result.error);\n return result;\n}\n\n// ── Unwrapping ─────────────────────────────────────────────────────────────\n\n/* Extracts the value or throws the error (re-thrown as-is if it's an Error, wrapped otherwise). /\nexport function unwrap<T, E>(result: Result<T, E>): T {\n if (result.ok) return result.value;\n throw result.error instanceof Error ? result.error : new Error(String(result.error));\n}\n\n/* Extracts the error or throws if the result is Ok. /\nexport function unwrapError<T, E>(result: Result<T, E>): E {\n if (!result.ok) return result.error;\n throw new Error('Called unwrapError on an Ok result');\n}\n\n/* Extracts the value or returns `defaultValue` on failure. /\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n return result.ok ? result.value : defaultValue;\n}\n\n/* Extracts the value or computes a fallback from the error. /\nexport function unwrapOrElse<T, E>(result: Result<T, E>, fn: (error: E) => T): T {\n return result.ok ? result.value : fn(result.error);\n}\n\n/* Extracts the value or throws with a custom `message`. /\nexport function expect<T, E>(result: Result<T, E>, message: string): T {\n if (result.ok) return result.value;\n throw new Error(message);\n}\n\n// ── Conversion ─────────────────────────────────────────────────────────────\n\n/* Converts to a Promise — resolves on Ok, rejects on Fail. /\nexport function toPromise<T, E>(result: Result<T, E>): Promise<T> {\n return result.ok ? Promise.resolve(result.value) : Promise.reject(result.error);\n}\n\n/* Returns the value or `null` on failure. /\nexport function toNullable<T, E>(result: Result<T, E>): T \| null {\n return result.ok ? result.value : null;\n}\n\n/* Returns the value or `undefined` on failure. /\nexport function toUndefined<T, E>(result: Result<T, E>): T \| undefined {\n return result.ok ? result.value : undefined;\n}\n","import type { Result, RichResult, TrackOptions } from './types.js';\nimport { ok, fail } from './constructors.js';\n\n/\n Executes an async (or sync) function and captures any thrown exception,\n * returning a `Result<T, E>` instead of propagating the error.\n \n @example\n * const result = await run(() => fetchUser(id));\n * const result = await run(() => fetchUser(id), (e) => new UserError(e));\n /\nexport async function run<T, E = Error>(\n fn: () => T \| Promise<T>,\n errorTransform?: (caught: unknown) => E,\n): Promise<Result<T, E>> {\n try {\n return ok(await fn());\n } catch (caught) {\n return fail(errorTransform ? errorTransform(caught) : (caught as E));\n }\n}\n\n/\n Like `run()` but also captures timing and metadata, returning a `RichResult<T, E>`.\n \n @example\n * const result = await track(() => fetchUser(id), { operation: 'user.fetch', tags: ['db'] });\n /\nexport async function track<T, E = Error>(\n fn: () => T \| Promise<T>,\n options?: TrackOptions & { errorTransform?: (caught: unknown) => E },\n): Promise<RichResult<T, E>> {\n const start = performance.now();\n const timestamp = new Date().toISOString();\n const meta = {\n durationMs: 0,\n timestamp,\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n\n try {\n const value = await fn();\n return { ok: true, value, ...meta, durationMs: Math.round(performance.now() - start) };\n } catch (caught) {\n const error = options?.errorTransform ? options.errorTransform(caught) : (caught as E);\n return { ok: false, error, ...meta, durationMs: Math.round(performance.now() - start) };\n }\n}\n\n/\n Promotes a plain `Result<T, E>` to a `RichResult<T, E>` with a zero-duration snapshot.\n * Useful when you already have a Result and want to attach metadata.\n /\nexport function enrich<T, E>(result: Result<T, E>, options?: TrackOptions): RichResult<T, E> {\n return {\n ...result,\n durationMs: 0,\n timestamp: new Date().toISOString(),\n operation: options?.operation,\n correlationId: options?.correlationId,\n tags: options?.tags,\n };\n}\n\n/\n Strips observability metadata from a `RichResult`, returning a plain `Result<T, E>`.\n /\nexport function simplify<T, E>(rich: RichResult<T, E>): Result<T, E> {\n return rich.ok\n ? { ok: true, value: rich.value }\n : { ok: false, error: rich.error };\n}\n","import type { Result } from './types.js';\nimport { fail } from './constructors.js';\n\nexport interface RetryOptions<E> {\n /* Maximum number of attempts (including the first). /\n attempts: number;\n /* Fixed delay in ms between attempts. Default: 0 /\n delayMs?: number;\n /* Return false to stop retrying early based on the error. /\n shouldRetry?: (error: E, attempt: number) => boolean;\n /* Called before each retry with the previous error and attempt number. /\n onRetry?: (error: E, attempt: number) => void;\n}\n\nexport interface BackoffOptions<E> extends RetryOptions<E> {\n /* Cap for the computed backoff delay. Default: 30_000 /\n maxDelayMs?: number;\n /\n Adds random noise to the backoff delay to avoid thundering herd when\n * multiple instances retry simultaneously.\n \n - `true` → full jitter: delay = random(0, computedDelay)\n * - `number` → partial jitter: delay ± (computedDelay * factor), clamped to [0, maxDelayMs]\n * e.g. 0.25 adds ±25% noise\n * - `false` → no jitter (default)\n /\n jitter?: boolean \| number;\n}\n\n/\n Retries a Result-returning function up to `options.attempts` times with\n * an optional fixed delay between attempts.\n \n @example\n * const result = await retry(() => run(() => callApi()), {\n * attempts: 3,\n * delayMs: 500,\n * shouldRetry: (err) => err.code === 'ECONNRESET',\n * });\n /\nexport async function retry<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: RetryOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n if (options.delayMs) await sleep(options.delayMs);\n }\n\n return last;\n}\n\n/\n Like `retry()` but uses exponential backoff: delay doubles on each attempt,\n * capped at `maxDelayMs`.\n \n @example\n * const result = await retryWithBackoff(() => run(() => callApi()), {\n * attempts: 4,\n * delayMs: 100, // 100ms → 200ms → 400ms\n * maxDelayMs: 1_000,\n * });\n /\nexport async function retryWithBackoff<T, E = Error>(\n fn: () => Promise<Result<T, E>>,\n options: BackoffOptions<E>,\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n\n for (let attempt = 1; attempt <= options.attempts; attempt++) {\n last = await fn();\n if (last.ok) return last;\n if (attempt === options.attempts) break;\n if (options.shouldRetry && !options.shouldRetry(last.error, attempt)) break;\n options.onRetry?.(last.error, attempt);\n await sleep(computeBackoffDelay(attempt, options));\n }\n\n return last;\n}\n\n/\n Races a Result-returning function against a timeout.\n * Returns `fail(timeoutError)` if `ms` elapses before the function resolves.\n \n @example\n * const result = await withTimeout(\n * () => run(() => fetchData()),\n * 5_000,\n * new TimeoutError('fetchData timed out'),\n * );\n /\nexport async function withTimeout<T, E>(\n fn: () => Promise<Result<T, E>>,\n ms: number,\n timeoutError: E,\n): Promise<Result<T, E>> {\n const timer = new Promise<Result<T, E>>(resolve =>\n setTimeout(() => resolve(fail<T, E>(timeoutError)), ms),\n );\n return Promise.race([fn(), timer]);\n}\n\nfunction computeBackoffDelay<E>(attempt: number, options: BackoffOptions<E>): number {\n const base = (options.delayMs ?? 100) Math.pow(2, attempt - 1);\n const capped = Math.min(base, options.maxDelayMs ?? 30_000);\n const { jitter } = options;\n\n if (!jitter) return capped;\n\n if (jitter === true) {\n // Full jitter: uniform random in [0, capped] — maximises spread across instances\n return Math.random() * capped;\n }\n\n // Partial jitter: ± (capped * factor), stays within [0, maxDelayMs]\n const noise = (Math.random() * 2 - 1) * capped * jitter;\n return Math.max(0, Math.min(capped + noise, options.maxDelayMs ?? 30_000));\n}\n\nconst sleep = (ms: number): Promise<void> => new Promise(r => setTimeout(r, ms));\n","import type { Result } from './types.js';\nimport { ok } from './constructors.js';\n\n/*\n Returns `ok([...values])` if every result succeeds, or the first `fail` encountered.\n \n @example\n * const result = all([findUser(id), findAccount(id)]);\n * // Result<[User, Account], Error>\n /\nexport function all<T, E>(results: Result<T, E>[]): Result<T[], E> {\n const values: T[] = [];\n for (const r of results) {\n if (!r.ok) return r;\n values.push(r.value);\n }\n return ok(values);\n}\n\n/\n Returns the first successful result from a list of async operations,\n * tried sequentially. Returns the last failure if all fail.\n \n @example\n * const result = await any([\n * () => run(() => primaryCache.get(key)),\n * () => run(() => database.find(key)),\n * ]);\n /\nexport async function any<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n): Promise<Result<T, E>> {\n let last!: Result<T, E>;\n for (const op of operations) {\n last = await op();\n if (last.ok) return last;\n }\n return last;\n}\n\nexport interface ParallelOptions {\n /* Max number of operations running concurrently. Default: all at once. /\n concurrency?: number;\n}\n\n/\n Runs operations concurrently (optionally throttled by `concurrency`).\n * Returns `ok([...values])` if all succeed, or the first failure.\n \n @example\n * const result = await parallel(\n * userIds.map(id => () => run(() => fetchUser(id))),\n * { concurrency: 5 },\n * );\n /\nexport async function parallel<T, E>(\n operations: (() => Promise<Result<T, E>>)[],\n options?: ParallelOptions,\n): Promise<Result<T[], E>> {\n const concurrency = options?.concurrency ?? operations.length;\n const results: Result<T, E>[] = [];\n\n for (let i = 0; i < operations.length; i += concurrency) {\n const batch = await Promise.all(operations.slice(i, i + concurrency).map(op => op()));\n results.push(...batch);\n }\n\n return all(results);\n}\n\n/\n Splits an array of Results into `[successValues, errorValues]`.\n \n @example\n * const [users, errors] = partition(results);\n /\nexport function partition<T, E>(results: Result<T, E>[]): [T[], E[]] {\n const values: T[] = [];\n const errors: E[] = [];\n for (const r of results) {\n if (r.ok) values.push(r.value);\n else errors.push(r.error);\n }\n return [values, errors];\n}\n\n/\n Extracts only the success values, silently discarding failures.\n \n @example\n * const users = collect(results); // User[]\n /\nexport function collect<T, E>(results: Result<T, E>[]): T[] {\n return results\n .filter((r): r is Extract<Result<T, E>, { ok: true }> => r.ok)\n .map(r => r.value);\n}\n\n/\n Maps each item through a Result-returning function, collecting all successes\n * into an array or short-circuiting on the first failure.\n \n @example\n * const result = traverse(ids, id => fromNullable(cache.get(id), 'not-found'));\n /\nexport function traverse<T, U, E>(\n items: T[],\n fn: (item: T) => Result<U, E>,\n): Result<U[], E> {\n return all(items.map(fn));\n}\n\n// ── Typed tuple combinators ────────────────────────────────────────────────\n\n/* Combines two Results into a tuple. Short-circuits on first failure. /\nexport function combine2<A, B, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n): Result<[A, B], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n return ok([r1.value, r2.value]);\n}\n\n/* Combines three Results into a typed tuple. Short-circuits on first failure. /\nexport function combine3<A, B, C, E>(\n r1: Result<A, E>,\n r2: Result<B, E>,\n r3: Result<C, E>,\n): Result<[A, B, C], E> {\n if (!r1.ok) return r1;\n if (!r2.ok) return r2;\n if (!r3.ok) return r3;\n return ok([r1.value, r2.value, r3.value]);\n}\n","import type { Result, RichResult } from './types.js';\nimport { ok, fail } from './constructors.js';\nimport { isRich } from './guards.js';\n\n/\n Fluent pipeline wrapper around `Result<T, E>`.\n * Operations short-circuit on failure — subsequent transforms are skipped.\n \n @example\n * const price = Flow.from(findProduct(id))\n * .map(p => p.price)\n * .filter(price => price > 0, new Error('Price must be positive'))\n * .map(price => price * taxRate)\n * .getResult();\n /\nexport class Flow<T, E = Error> {\n private constructor(private readonly _result: Result<T, E>) {}\n\n /* Start a pipeline from an existing Result. /\n static from<T, E>(result: Result<T, E>): Flow<T, E> {\n return new Flow(result);\n }\n\n /* Start an empty pipeline (value is `undefined`). /\n static start(): Flow<void, never> {\n return new Flow(ok(undefined));\n }\n\n /* Maps the success value. Skipped on failure. /\n map<U>(fn: (value: T) => U): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(ok(fn(this._result.value)));\n }\n\n /* Maps the error value. Skipped on success. /\n mapError<F>(fn: (error: E) => F): Flow<T, F> {\n if (this._result.ok) return new Flow<T, F>(this._result as unknown as Result<T, F>);\n return new Flow(fail(fn(this._result.error)));\n }\n\n /* Chains a Result-returning function. Skipped on failure. /\n flatMap<U>(fn: (value: T) => Result<U, E>): Flow<U, E> {\n if (!this._result.ok) return new Flow<U, E>(this._result as unknown as Result<U, E>);\n return new Flow(fn(this._result.value));\n }\n\n /* Filters the success value. Becomes `fail(error)` if predicate is false. /\n filter(pred: (value: T) => boolean, error: E): Flow<T, E> {\n if (!this._result.ok) return this;\n return pred(this._result.value) ? this : new Flow(fail(error));\n }\n\n /* Runs a side effect on success; returns `this` unchanged. /\n tap(fn: (value: T) => void): this {\n if (this._result.ok) fn(this._result.value);\n return this;\n }\n\n /* Runs a side effect on failure; returns `this` unchanged. /\n tapError(fn: (error: E) => void): this {\n if (!this._result.ok) fn(this._result.error);\n return this;\n }\n\n /\n Recovers from a failure by computing a new success value.\n * Skipped if already Ok.\n /\n recover(fn: (error: E) => T): Flow<T, never> {\n if (this._result.ok) return new Flow<T, never>(this._result as unknown as Result<T, never>);\n return new Flow(ok(fn(this._result.error)));\n }\n\n /* Exhaustive pattern match — always produces a value. /\n match<R>(handlers: { ok: (value: T) => R; fail: (error: E) => R }): R {\n return this._result.ok\n ? handlers.ok(this._result.value)\n : handlers.fail(this._result.error);\n }\n\n /* Returns the underlying `Result<T, E>`. /\n getResult(): Result<T, E> {\n return this._result;\n }\n\n /\n Returns the underlying result as `RichResult<T, E>` if it was created by `track()`.\n * Throws if the result has no observability metadata.\n */\n getRichResult(): RichResult<T, E> {\n if (!isRich(this._result)) throw new Error('Result is not a RichResult');\n return this._result;\n }\n\n isOk(): boolean { return this._result.ok; }\n isFail(): boolean { return !this._result.ok; }\n}\n"]}

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@backendkit-labs/result",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "Type-safe Result monad for Node.js — generic error types, observability, resilience, and optional NestJS integration",
   "type": "module",
   "main": "./dist/index.cjs",