@backendkit-labs/result 0.1.2 → 0.2.0

package/LICENSE

@@ -0,0 +1,184 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship made available under
+      the License, as indicated by a copyright notice that is included in
+      or attached to the work (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and the Work's derivative works.
+
+      "Contribution" shall mean, as submitted to the Licensor for inclusion
+      in the Work by the copyright owner or by an individual or Legal Entity
+      authorized to submit on behalf of the copyright owner. For the purposes
+      of this definition, "submitted" means any form of electronic, verbal,
+      or written communication sent to the Licensor or its representatives,
+      including but not limited to communication on electronic mailing lists,
+      source code control systems, and issue tracking systems that are managed
+      by, or on behalf of, the Licensor for the purpose of discussing and
+      improving the Work, but excluding communication that is conspicuously
+      marked or designated in writing by the copyright owner as
+      "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any Legal Entity on behalf of
+      whom a Contribution has been received by the Licensor and subsequently
+      incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by the combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a cross-claim
+      or counterclaim in a lawsuit) alleging that the Work or any
+      Contribution embodied within the Work constitutes direct or contributory
+      patent infringement, then any patent licenses granted to You under
+      this License for that Work shall terminate as of the date such
+      litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, You must include a readable copy of the
+          attribution notices contained within such NOTICE file, in
+          at least one of the following places: within a NOTICE text
+          file distributed as part of the Derivative Works; within
+          the Source form or documentation, if provided along with the
+          Derivative Works; or, within a display generated by the
+          Derivative Works, if and wherever such third-party notices
+          normally appear. The contents of the NOTICE file are for
+          informational purposes only and do not modify the License.
+          You may add Your own attribution notices within Derivative
+          Works that You distribute, alongside or in addition to the
+          NOTICE text from the Work, provided that such additional
+          attribution notices cannot be construed as modifying the License.
+
+      You may add Your own license statement for Your modifications and
+      may provide additional grant of rights to use, copy, modify, and
+      distribute Your modifications, or for such Derivative Works as a
+      whole, subject to the terms and conditions of this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or reproducing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or exemplary damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or all other
+      commercial damages or losses), even if such Contributor has been
+      advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2024-2026 Mairon Cuello / BackendKit Labs
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/README.md

@@ -1,9 +1,10 @@
 # @backendkit-labs/result
 
 [![npm version](https://img.shields.io/npm/v/@backendkit-labs/result?style=flat-square&color=cb3837)](https://www.npmjs.com/package/@backendkit-labs/result)
-[![CI](https://img.shields.io/github/actions/workflow/status/backendkit-dev/backendkit-monorepo/ci.yml?style=flat-square&label=CI)](https://github.com/backendkit-dev/backendkit-monorepo/actions/workflows/ci.yml)
+[![CI](https://img.shields.io/github/actions/workflow/status/BackendKit-labs/backendkit-monorepo/ci.yml?style=flat-square&label=CI)](https://github.com/BackendKit-labs/backendkit-monorepo/actions/workflows/ci.yml)
 [![License](https://img.shields.io/npm/l/@backendkit-labs/result?style=flat-square)](LICENSE)
 [![Node](https://img.shields.io/node/v/@backendkit-labs/result?style=flat-square)](package.json)
+[![Docs](https://img.shields.io/badge/docs-backendkitlabs.dev-4f7eff?style=flat-square)](https://backendkitlabs.dev/docs/result/)
 
 > Type-safe Result monad for Node.js. Generic error types, observability, resilience, and optional NestJS integration. Zero runtime dependencies.
 
@@ -46,6 +47,65 @@ npm install @nestjs/common @nestjs/core rxjs
 
 ---
 
+## TypeScript Configuration
+
+### Subpath exports (`/nestjs`)
+
+This package uses the `exports` field in `package.json` to expose the `/nestjs` subpath. TypeScript's ability to resolve it depends on the `moduleResolution` setting in your `tsconfig.json`.
+
+**Modern resolution (recommended) — no extra config needed:**
+
+```json
+{
+  "compilerOptions": {
+    "moduleResolution": "bundler"
+  }
+}
+```
+
+`"bundler"`, `"node16"`, and `"nodenext"` all understand the `exports` field natively. This is the recommended setting for any project using a bundler or NestJS on TypeScript ≥ 5.
+
+**Legacy resolution (`"node"`) — add a `paths` alias:**
+
+NestJS projects generated before ~2024 default to `"moduleResolution": "node"`, which ignores the `exports` field. Add an explicit alias so TypeScript can find the types:
+
+```json
+{
+  "compilerOptions": {
+    "moduleResolution": "node",
+    "paths": {
+      "@backendkit-labs/result/nestjs": [
+        "./node_modules/@backendkit-labs/result/dist/nestjs/index"
+      ]
+    }
+  }
+}
+```
+
+> **Why?** The `"node"` resolver was designed before subpath exports existed and only reads `main`/`types` at the package root — it ignores the `exports` map entirely. The `paths` alias manually points TypeScript to the correct `.d.ts` file.
+
+### NestJS decorator support
+
+```json
+{
+  "compilerOptions": {
+    "experimentalDecorators": true,
+    "emitDecoratorMetadata": true
+  }
+}
+```
+
+And import `reflect-metadata` once at application startup:
+
+```typescript
+// main.ts
+import 'reflect-metadata';
+```
+
+> NestJS CLI scaffolds these automatically. You only need to verify them if setting up a project manually.
+
+---
+
 ## Quick Start
 
 ```typescript
@@ -1149,4 +1209,4 @@ The core is a pure TypeScript library with no runtime dependencies. The NestJS l
 
 ## License
 
-MIT — [BackendKit Labs](https://github.com/backendkit-dev)
+Apache-2.0 — [BackendKit Labs](https://github.com/BackendKit-labs)

package/dist/index.cjs

@@ -61,6 +61,7 @@ function toUndefined(result) {
 
 // src/result/resilience.ts
 async function retry(fn, options) {
+  if (options.attempts < 1) throw new Error("retry() attempts must be at least 1");
   let last;
   for (let attempt = 1; attempt <= options.attempts; attempt++) {
     last = await fn();
@@ -73,6 +74,7 @@ async function retry(fn, options) {
   return last;
 }
 async function retryWithBackoff(fn, options) {
+  if (options.attempts < 1) throw new Error("retryWithBackoff() attempts must be at least 1");
   let last;
   for (let attempt = 1; attempt <= options.attempts; attempt++) {
     last = await fn();
@@ -85,10 +87,15 @@ async function retryWithBackoff(fn, options) {
   return last;
 }
 async function withTimeout(fn, ms, timeoutError) {
-  const timer = new Promise(
-    (resolve) => setTimeout(() => resolve(chunkGCGL2Y6D_cjs.fail(timeoutError)), ms)
-  );
-  return Promise.race([fn(), timer]);
+  let timerId;
+  const timer = new Promise((resolve) => {
+    timerId = setTimeout(() => resolve(chunkGCGL2Y6D_cjs.fail(timeoutError)), ms);
+  });
+  try {
+    return await Promise.race([fn(), timer]);
+  } finally {
+    clearTimeout(timerId);
+  }
 }
 function computeBackoffDelay(attempt, options) {
   const base = (options.delayMs ?? 100) * Math.pow(2, attempt - 1);
@@ -113,6 +120,7 @@ function all(results) {
   return chunkGCGL2Y6D_cjs.ok(values);
 }
 async function any(operations) {
+  if (operations.length === 0) throw new Error("any() requires at least one operation");
   let last;
   for (const op of operations) {
     last = await op();
@@ -121,7 +129,10 @@ async function any(operations) {
   return last;
 }
 async function parallel(operations, options) {
-  const concurrency = options?.concurrency ?? operations.length;
+  if (options?.concurrency !== void 0 && options.concurrency < 1) {
+    throw new Error("parallel() concurrency must be at least 1");
+  }
+  const concurrency = options?.concurrency ?? (operations.length || 1);
   const results = [];
   for (let i = 0; i < operations.length; i += concurrency) {
     const batch = await Promise.all(operations.slice(i, i + concurrency).map((op) => op()));

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/result/operations.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":["ok","fail","isRich"],"mappings":";;;;;AAMO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAKA,oBAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAASC,uBAAK,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,OAAOD,oBAAA,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;;;AChFA,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,CAAQC,uBAAW,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,OAAOD,qBAAG,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,OAAOA,qBAAG,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,OAAOA,oBAAA,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,CAAKA,oBAAA,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,MAAKA,oBAAA,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,MAAKC,sBAAA,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,CAAKA,sBAAA,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,MAAKD,oBAAA,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,CAACE,yBAAO,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';\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 } 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"]}
+{"version":3,"sources":["../src/result/operations.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":["ok","fail","isRich"],"mappings":";;;;;AAMO,SAAS,GAAA,CAAa,QAAsB,EAAA,EAAmC;AACpF,EAAA,OAAO,OAAO,EAAA,GAAKA,oBAAA,CAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAA,GAAI,MAAA;AAC5C;AAGO,SAAS,QAAA,CAAkB,QAAsB,EAAA,EAAmC;AACzF,EAAA,OAAO,OAAO,EAAA,GAAK,MAAA,GAASC,uBAAK,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,OAAOD,oBAAA,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;;;AChFA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,QAAQ,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,MAAM,qCAAqC,CAAA;AAC/E,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,QAAQ,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAC1F,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,IAAI,OAAA;AACJ,EAAA,MAAM,KAAA,GAAQ,IAAI,OAAA,CAAsB,CAAA,OAAA,KAAW;AACjD,IAAA,OAAA,GAAU,WAAW,MAAM,OAAA,CAAQC,uBAAW,YAAY,CAAC,GAAG,EAAE,CAAA;AAAA,EAClE,CAAC,CAAA;AACD,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,OAAA,CAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AAAA,EACzC,CAAA,SAAE;AACA,IAAA,YAAA,CAAa,OAAO,CAAA;AAAA,EACtB;AACF;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;;;AC3HxE,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,OAAOD,qBAAG,MAAM,CAAA;AAClB;AAYA,eAAsB,IACpB,UAAA,EACuB;AACvB,EAAA,IAAI,WAAW,MAAA,KAAW,CAAA,EAAG,MAAM,IAAI,MAAM,uCAAuC,CAAA;AACpF,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,IAAI,OAAA,EAAS,WAAA,KAAgB,MAAA,IAAa,OAAA,CAAQ,cAAc,CAAA,EAAG;AACjE,IAAA,MAAM,IAAI,MAAM,2CAA2C,CAAA;AAAA,EAC7D;AACA,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,KAAgB,UAAA,CAAW,MAAA,IAAU,CAAA,CAAA;AAClE,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,OAAOA,qBAAG,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,OAAOA,oBAAA,CAAG,CAAC,EAAA,CAAG,KAAA,EAAO,GAAG,KAAA,EAAO,EAAA,CAAG,KAAK,CAAC,CAAA;AAC1C;;;AC3HO,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,CAAKA,oBAAA,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,MAAKA,oBAAA,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,MAAKC,sBAAA,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,CAAKA,sBAAA,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,MAAKD,oBAAA,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,CAACE,yBAAO,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';\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 } 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  if (options.attempts < 1) throw new Error('retry() attempts must be at least 1');\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  if (options.attempts < 1) throw new Error('retryWithBackoff() attempts must be at least 1');\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  let timerId!: ReturnType<typeof setTimeout>;\n  const timer = new Promise<Result<T, E>>(resolve => {\n    timerId = setTimeout(() => resolve(fail<T, E>(timeoutError)), ms);\n  });\n  try {\n    return await Promise.race([fn(), timer]);\n  } finally {\n    clearTimeout(timerId);\n  }\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  if (operations.length === 0) throw new Error('any() requires at least one operation');\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  if (options?.concurrency !== undefined && options.concurrency < 1) {\n    throw new Error('parallel() concurrency must be at least 1');\n  }\n  const concurrency = options?.concurrency ?? (operations.length || 1);\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.js

@@ -60,6 +60,7 @@ function toUndefined(result) {
 
 // src/result/resilience.ts
 async function retry(fn, options) {
+  if (options.attempts < 1) throw new Error("retry() attempts must be at least 1");
   let last;
   for (let attempt = 1; attempt <= options.attempts; attempt++) {
     last = await fn();
@@ -72,6 +73,7 @@ async function retry(fn, options) {
   return last;
 }
 async function retryWithBackoff(fn, options) {
+  if (options.attempts < 1) throw new Error("retryWithBackoff() attempts must be at least 1");
   let last;
   for (let attempt = 1; attempt <= options.attempts; attempt++) {
     last = await fn();
@@ -84,10 +86,15 @@ async function retryWithBackoff(fn, options) {
   return last;
 }
 async function withTimeout(fn, ms, timeoutError) {
-  const timer = new Promise(
-    (resolve) => setTimeout(() => resolve(fail(timeoutError)), ms)
-  );
-  return Promise.race([fn(), timer]);
+  let timerId;
+  const timer = new Promise((resolve) => {
+    timerId = setTimeout(() => resolve(fail(timeoutError)), ms);
+  });
+  try {
+    return await Promise.race([fn(), timer]);
+  } finally {
+    clearTimeout(timerId);
+  }
 }
 function computeBackoffDelay(attempt, options) {
   const base = (options.delayMs ?? 100) * Math.pow(2, attempt - 1);
@@ -112,6 +119,7 @@ function all(results) {
   return ok(values);
 }
 async function any(operations) {
+  if (operations.length === 0) throw new Error("any() requires at least one operation");
   let last;
   for (const op of operations) {
     last = await op();
@@ -120,7 +128,10 @@ async function any(operations) {
   return last;
 }
 async function parallel(operations, options) {
-  const concurrency = options?.concurrency ?? operations.length;
+  if (options?.concurrency !== void 0 && options.concurrency < 1) {
+    throw new Error("parallel() concurrency must be at least 1");
+  }
+  const concurrency = options?.concurrency ?? (operations.length || 1);
   const results = [];
   for (let i = 0; i < operations.length; i += concurrency) {
     const batch = await Promise.all(operations.slice(i, i + concurrency).map((op) => op()));

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/result/operations.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";;;;AAMO,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;;;AChFA,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';\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 } 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"]}
+{"version":3,"sources":["../src/result/operations.ts","../src/result/resilience.ts","../src/result/combinators.ts","../src/result/flow.ts"],"names":[],"mappings":";;;;AAMO,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;;;AChFA,eAAsB,KAAA,CACpB,IACA,OAAA,EACuB;AACvB,EAAA,IAAI,QAAQ,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,MAAM,qCAAqC,CAAA;AAC/E,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,QAAQ,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAC1F,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,IAAI,OAAA;AACJ,EAAA,MAAM,KAAA,GAAQ,IAAI,OAAA,CAAsB,CAAA,OAAA,KAAW;AACjD,IAAA,OAAA,GAAU,WAAW,MAAM,OAAA,CAAQ,KAAW,YAAY,CAAC,GAAG,EAAE,CAAA;AAAA,EAClE,CAAC,CAAA;AACD,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,OAAA,CAAQ,IAAA,CAAK,CAAC,EAAA,EAAG,EAAG,KAAK,CAAC,CAAA;AAAA,EACzC,CAAA,SAAE;AACA,IAAA,YAAA,CAAa,OAAO,CAAA;AAAA,EACtB;AACF;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;;;AC3HxE,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,WAAW,MAAA,KAAW,CAAA,EAAG,MAAM,IAAI,MAAM,uCAAuC,CAAA;AACpF,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,IAAI,OAAA,EAAS,WAAA,KAAgB,MAAA,IAAa,OAAA,CAAQ,cAAc,CAAA,EAAG;AACjE,IAAA,MAAM,IAAI,MAAM,2CAA2C,CAAA;AAAA,EAC7D;AACA,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,KAAgB,UAAA,CAAW,MAAA,IAAU,CAAA,CAAA;AAClE,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;;;AC3HO,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';\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 } 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  if (options.attempts < 1) throw new Error('retry() attempts must be at least 1');\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  if (options.attempts < 1) throw new Error('retryWithBackoff() attempts must be at least 1');\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  let timerId!: ReturnType<typeof setTimeout>;\n  const timer = new Promise<Result<T, E>>(resolve => {\n    timerId = setTimeout(() => resolve(fail<T, E>(timeoutError)), ms);\n  });\n  try {\n    return await Promise.race([fn(), timer]);\n  } finally {\n    clearTimeout(timerId);\n  }\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  if (operations.length === 0) throw new Error('any() requires at least one operation');\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  if (options?.concurrency !== undefined && options.concurrency < 1) {\n    throw new Error('parallel() concurrency must be at least 1');\n  }\n  const concurrency = options?.concurrency ?? (operations.length || 1);\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

@@ -1,71 +1,97 @@
-{
-  "name": "@backendkit-labs/result",
-  "version": "0.1.2",
-  "description": "Type-safe Result monad for Node.js — generic error types, observability, resilience, and optional NestJS integration",
-  "type": "module",
-  "main": "./dist/index.cjs",
-  "module": "./dist/index.js",
-  "types": "./dist/index.d.ts",
-  "exports": {
-    ".": {
-      "types":   "./dist/index.d.ts",
-      "import":  "./dist/index.js",
-      "require": "./dist/index.cjs"
-    },
-    "./nestjs": {
-      "types":   "./dist/nestjs/index.d.ts",
-      "import":  "./dist/nestjs/index.js",
-      "require": "./dist/nestjs/index.cjs"
-    }
-  },
-  "files": ["dist", "README.md", "LICENSE"],
-  "scripts": {
-    "build":         "tsup",
-    "dev":           "tsup --watch",
-    "test":          "vitest run",
-    "test:watch":    "vitest",
-    "test:coverage": "vitest run --coverage",
-    "typecheck":     "tsc --noEmit",
-    "lint":          "eslint src/",
-    "prepublishOnly": "npm run build && npm run test && npm run lint"
-  },
-  "keywords": [
-    "result", "either", "monad", "error-handling",
-    "functional", "railway", "nestjs", "typescript", "node"
-  ],
-  "author": "Mairon José Cuello Martínez",
-  "license": "MIT",
-  "homepage": "https://github.com/backendkit-dev/backendkit-monorepo/tree/master/packages/result#readme",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/backendkit-dev/backendkit-monorepo.git",
-    "directory": "packages/result"
-  },
-  "bugs": { "url": "https://github.com/backendkit-dev/backendkit-monorepo/issues" },
-  "publishConfig": { "access": "public" },
-  "sideEffects": false,
-  "engines": { "node": ">=18" },
-  "peerDependencies": {
-    "@nestjs/common": ">=10.0.0",
-    "@nestjs/core":   ">=10.0.0",
-    "rxjs":           ">=7.0.0"
-  },
-  "peerDependenciesMeta": {
-    "@nestjs/common": { "optional": true },
-    "@nestjs/core":   { "optional": true },
-    "rxjs":           { "optional": true }
-  },
-  "devDependencies": {
-    "@eslint/js":           "^9.39.4",
-    "@nestjs/common":       "^10.0.0",
-    "@nestjs/core":         "^10.0.0",
-    "@types/node":          "^22.0.0",
-    "eslint":               "^9.0.0",
-    "reflect-metadata":     "^0.2.0",
-    "rxjs":                 "^7.8.0",
-    "tsup":                 "^8.0.0",
-    "typescript":           "^5.5.0",
-    "typescript-eslint":    "^8.59.3",
-    "vitest":               "^2.0.0"
-  }
-}
+{
+  "name": "@backendkit-labs/result",
+  "version": "0.2.0",
+  "license": "Apache-2.0",
+  "author": {
+    "name": "BackendKit Labs",
+    "email": "hello@backendkitlabs.dev"
+  },
+  "description": "Type-safe Result monad for Node.js — generic error types, observability, resilience, and optional NestJS integration",
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    },
+    "./nestjs": {
+      "types": "./dist/nestjs/index.d.ts",
+      "import": "./dist/nestjs/index.js",
+      "require": "./dist/nestjs/index.cjs"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint src/",
+    "prepublishOnly": "npm run build && npm run test && npm run lint"
+  },
+  "keywords": [
+    "result",
+    "either",
+    "monad",
+    "error-handling",
+    "functional",
+    "railway",
+    "nestjs",
+    "typescript",
+    "node"
+  ],
+  "homepage": "https://backendkitlabs.dev/docs/result/",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/BackendKit-labs/backendkit-monorepo.git",
+    "directory": "packages/result"
+  },
+  "bugs": {
+    "url": "https://github.com/BackendKit-labs/backendkit-monorepo/issues"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "sideEffects": false,
+  "engines": {
+    "node": ">=18"
+  },
+  "peerDependencies": {
+    "@nestjs/common": ">=10.0.0",
+    "@nestjs/core": ">=10.0.0",
+    "rxjs": ">=7.0.0"
+  },
+  "peerDependenciesMeta": {
+    "@nestjs/common": {
+      "optional": true
+    },
+    "@nestjs/core": {
+      "optional": true
+    },
+    "rxjs": {
+      "optional": true
+    }
+  },
+  "devDependencies": {
+    "@eslint/js": "^9.39.4",
+    "@nestjs/common": "^10.0.0",
+    "@nestjs/core": "^10.0.0",
+    "@types/node": "^22.0.0",
+    "eslint": "^9.0.0",
+    "reflect-metadata": "^0.2.0",
+    "rxjs": "^7.8.0",
+    "tsup": "^8.0.0",
+    "typescript": "^5.5.0",
+    "typescript-eslint": "^8.59.3",
+    "vitest": "^2.0.0"
+  }
+}