@nicolastoulemont/std 0.9.0 → 0.11.0

package/dist/predicate/index.mjs

@@ -1 +1 @@
-import{t as e}from"../predicate-D_1SsIi4.mjs";export{e as Predicate};
+import{t as e}from"../predicate-CvH7cY_J.mjs";export{e as Predicate};

package/dist/predicate-CvH7cY_J.mjs

@@ -0,0 +1,2 @@
+import{t as e}from"./chunk-6rpU2rUb.mjs";var t=e({all:()=>a,and:()=>r,andRefinement:()=>c,constant:()=>u,equals:()=>d,none:()=>s,not:()=>n,or:()=>i,orRefinement:()=>l,some:()=>o});const n=e=>t=>!e(t);function r(...e){return t=>{for(let n of e)if(!n(t))return!1;return!0}}function i(...e){return t=>{for(let n of e)if(n(t))return!0;return!1}}const a=e=>t=>t.every(e),o=e=>t=>t.some(e),s=e=>t=>!t.some(e),c=(...e)=>t=>{for(let n of e)if(!n(t))return!1;return!0},l=(...e)=>t=>{for(let n of e)if(n(t))return!0;return!1},u=e=>()=>e,d=e=>t=>t===e;export{t};
+//# sourceMappingURL=predicate-CvH7cY_J.mjs.map

package/dist/predicate-CvH7cY_J.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"predicate-CvH7cY_J.mjs","names":[],"sources":["../src/predicate/predicate.ts"],"sourcesContent":["import type { Prettify, UnionToIntersection } from \"../shared/type-utils.types\"\nimport type { Predicate as PredicateType, Refinement } from \"./predicate.types\"\n\ntype PredicateInput<TPredicate> = TPredicate extends PredicateType<infer T> ? T : never\n\ntype PredicateInputIntersection<TPredicates extends readonly PredicateType<never>[]> = Prettify<\n  UnionToIntersection<PredicateInput<TPredicates[number]>>\n>\n\n/**\n * Negate a predicate.\n * Returns true when the original predicate returns false, and vice versa.\n *\n * @template T - The type being tested\n * @param predicate - The predicate to negate\n * @returns A new predicate that returns the opposite boolean\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isOdd = Predicate.not((n: number) => n % 2 === 0)\n * const result = isOdd(3)\n * // => true\n * ```\n */\nexport const not = <T>(predicate: PredicateType<T>): PredicateType<T> => {\n  return (value: T): boolean => !predicate(value)\n}\n\n/**\n * Combine predicates with logical AND.\n * Returns true only when ALL predicates return true.\n * Short-circuits on first false (lazy evaluation).\n *\n * @template T - The type being tested\n * @param predicates - The predicates to combine\n * @returns A new predicate that returns true if all predicates pass\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isPositiveEven = Predicate.and<number>((n) => n > 0, (n) => n % 2 === 0)\n * const result = isPositiveEven(4)\n * // => true\n * ```\n */\nexport function and<T>(...predicates: readonly PredicateType<T>[]): PredicateType<T>\nexport function and<const TPredicates extends readonly PredicateType<never>[]>(\n  ...predicates: TPredicates\n): PredicateType<PredicateInputIntersection<TPredicates>>\nexport function and(...predicates: readonly PredicateType<never>[]): PredicateType<never> {\n  return (value: never): boolean => {\n    for (const predicate of predicates) {\n      if (!predicate(value)) return false\n    }\n    return true\n  }\n}\n\n/**\n * Combine predicates with logical OR.\n * Returns true when ANY predicate returns true.\n * Short-circuits on first true (lazy evaluation).\n *\n * @template T - The type being tested\n * @param predicates - The predicates to combine\n * @returns A new predicate that returns true if any predicate passes\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isWeekend = Predicate.or<string>((day) => day === \"sat\", (day) => day === \"sun\")\n * const result = isWeekend(\"sun\")\n * // => true\n * ```\n */\nexport function or<T>(...predicates: readonly PredicateType<T>[]): PredicateType<T>\nexport function or<const TPredicates extends readonly PredicateType<never>[]>(\n  ...predicates: TPredicates\n): PredicateType<PredicateInputIntersection<TPredicates>>\nexport function or(...predicates: readonly PredicateType<never>[]): PredicateType<never> {\n  return (value: never): boolean => {\n    for (const predicate of predicates) {\n      if (predicate(value)) return true\n    }\n    return false\n  }\n}\n\n/**\n * Create a predicate that tests if ALL elements in an array match.\n * Returns true for empty arrays (vacuous truth).\n *\n * @template T - The element type\n * @param predicate - The predicate to test each element\n * @returns A predicate that takes an array and returns true if all match\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const allPositive = Predicate.all((n: number) => n > 0)\n * const result = allPositive([1, 2, 3])\n * // => true\n * ```\n */\nexport const all = <T>(predicate: PredicateType<T>): PredicateType<readonly T[]> => {\n  return (arr: readonly T[]): boolean => arr.every(predicate)\n}\n\n/**\n * Create a predicate that tests if ANY element in an array matches.\n * Returns false for empty arrays.\n *\n * @template T - The element type\n * @param predicate - The predicate to test each element\n * @returns A predicate that takes an array and returns true if any match\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const someNegative = Predicate.some((n: number) => n < 0)\n * const result = someNegative([1, -1, 3])\n * // => true\n * ```\n */\nexport const some = <T>(predicate: PredicateType<T>): PredicateType<readonly T[]> => {\n  return (arr: readonly T[]): boolean => arr.some(predicate)\n}\n\n/**\n * Create a predicate that tests if NO elements in an array match.\n * Returns true for empty arrays (vacuous truth).\n * Equivalent to `not(some(predicate))`.\n *\n * @template T - The element type\n * @param predicate - The predicate that should NOT match any element\n * @returns A predicate that takes an array and returns true if none match\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const noneZero = Predicate.none((n: number) => n === 0)\n * const result = noneZero([1, 2, 3])\n * // => true\n * ```\n */\nexport const none = <T>(predicate: PredicateType<T>): PredicateType<readonly T[]> => {\n  return (arr: readonly T[]): boolean => !arr.some(predicate)\n}\n\n/**\n * Combine refinements with logical AND, preserving type narrowing.\n * Use this instead of `and` when you need to preserve type guard behavior.\n *\n * @template T - The base type\n * @template U - The narrowed type (must extend T)\n * @param refinements - The refinements to combine\n * @returns A refinement that narrows to U if all refinements pass\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isString = (value: unknown): value is string => typeof value === \"string\"\n * const isNonEmpty = (value: unknown): value is string => typeof value === \"string\" && value.length > 0\n * const refine = Predicate.andRefinement(isString, isNonEmpty)\n * const result = refine(\"hello\")\n * // => true\n * ```\n */\nexport const andRefinement = <T, U extends T>(...refinements: readonly Refinement<T, U>[]): Refinement<T, U> => {\n  return (value: T): value is U => {\n    for (const refinement of refinements) {\n      if (!refinement(value)) return false\n    }\n    return true\n  }\n}\n\n/**\n * Combine refinements with logical OR, preserving type narrowing.\n * Use this instead of `or` when you need to preserve type guard behavior.\n *\n * @template T - The base type\n * @template U - The narrowed type (must extend T)\n * @param refinements - The refinements to combine\n * @returns A refinement that narrows to U if any refinement passes\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isGuest = (value: unknown): value is string => value === \"guest\"\n * const isAdmin = (value: unknown): value is string => value === \"admin\"\n * const refine = Predicate.orRefinement(isGuest, isAdmin)\n * const result = refine(\"admin\")\n * // => true\n * ```\n */\nexport const orRefinement = <T, U extends T>(...refinements: readonly Refinement<T, U>[]): Refinement<T, U> => {\n  return (value: T): value is U => {\n    for (const refinement of refinements) {\n      if (refinement(value)) return true\n    }\n    return false\n  }\n}\n\n/**\n * Create a predicate from a constant boolean value.\n * Useful for testing or as a placeholder.\n *\n * @template T - The type (can be anything)\n * @param value - The constant boolean to return\n * @returns A predicate that always returns the given value\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const always = Predicate.constant<number>(true)\n * const result = always(123)\n * // => true\n * ```\n */\nexport const constant = <T>(value: boolean): PredicateType<T> => {\n  return (): boolean => value\n}\n\n/**\n * Create a predicate that checks strict equality.\n *\n * @template T - The type being compared\n * @param expected - The value to compare against\n * @returns A predicate that returns true if value === expected\n *\n * @example\n * ```ts\n * import { Predicate } from \"@nicolastoulemont/std\"\n *\n * const isReady = Predicate.equals(\"ready\")\n * const result = isReady(\"ready\")\n * // => true\n * ```\n */\nexport const equals = <T>(expected: T): PredicateType<T> => {\n  return (value: T): boolean => value === expected\n}\n"],"mappings":"oLA0BA,MAAa,EAAU,GACb,GAAsB,CAAC,EAAU,EAAM,CAyBjD,SAAgB,EAAI,GAAG,EAAmE,CACxF,MAAQ,IAA0B,CAChC,IAAK,IAAM,KAAa,EACtB,GAAI,CAAC,EAAU,EAAM,CAAE,MAAO,GAEhC,MAAO,IA0BX,SAAgB,EAAG,GAAG,EAAmE,CACvF,MAAQ,IAA0B,CAChC,IAAK,IAAM,KAAa,EACtB,GAAI,EAAU,EAAM,CAAE,MAAO,GAE/B,MAAO,IAqBX,MAAa,EAAU,GACb,GAA+B,EAAI,MAAM,EAAU,CAoBhD,EAAW,GACd,GAA+B,EAAI,KAAK,EAAU,CAqB/C,EAAW,GACd,GAA+B,CAAC,EAAI,KAAK,EAAU,CAuBhD,GAAiC,GAAG,IACvC,GAAyB,CAC/B,IAAK,IAAM,KAAc,EACvB,GAAI,CAAC,EAAW,EAAM,CAAE,MAAO,GAEjC,MAAO,IAwBE,GAAgC,GAAG,IACtC,GAAyB,CAC/B,IAAK,IAAM,KAAc,EACvB,GAAI,EAAW,EAAM,CAAE,MAAO,GAEhC,MAAO,IAqBE,EAAe,OACJ,EAmBX,EAAa,GAChB,GAAsB,IAAU"}

package/dist/provide/index.d.mts

@@ -1,2 +1,2 @@
-import { t as provide_d_exports } from "../index-D8gcYvR9.mjs";
+import { t as provide_d_exports } from "../index-DDdSA1Rs.mjs";
 export { provide_d_exports as Provide };

package/dist/provide/index.mjs

@@ -1 +1 @@
-import{t as e}from"../provide-CuccogWx.mjs";export{e as Provide};
+import{t as e}from"../provide-K-6oXtLm.mjs";export{e as Provide};

package/dist/provide-K-6oXtLm.mjs

@@ -0,0 +1,2 @@
+import{t as e}from"./chunk-6rpU2rUb.mjs";import{t}from"./fx.types-Bg-Mmdm5.mjs";import{i as n}from"./result-C74pRN2x.mjs";import{r}from"./context-7oKePrBY.mjs";import{b as i,h as a,l as o,x as s}from"./fx.runtime-B2_rL7h_.mjs";import{n as c}from"./layer-BmrPWBkT.mjs";import{t as l}from"./scope-D2AqJy7j.mjs";var u=class{cache=new Map;getOrBuild(e,r,a){let o=this.cache.get(e);if(o?.context)return{_tag:`SyncFx`,[t]:{_A:()=>o.context,_E:()=>void 0,_R:()=>void 0},run:()=>n(o.context),*[Symbol.iterator](){return o.context}};if(o?.promise)return{_tag:`AsyncFx`,[t]:{_A:()=>void 0,_E:()=>void 0,_R:()=>void 0},run:async()=>n(await o.promise),async*[Symbol.asyncIterator](){return await o.promise}};this.cache.set(e,{building:!0});let s=e.build(this,r),c=this.cache;if(s._tag===`AsyncFx`){let r=(async()=>{let t=s[Symbol.asyncIterator](),n=await t.next();for(;n.done!==!0;){let e=n.value,r=i(e);if(r===void 0)throw e;let o=a._services.get(r.key);if(o===void 0)throw Error(`Service "${r.key}" not found during layer build`);n=await t.next(o)}let r=n.value;return c.set(e,{context:r}),r})();return this.cache.set(e,{promise:r}),{_tag:`AsyncFx`,[t]:{_A:()=>void 0,_E:()=>void 0,_R:()=>void 0},run:async()=>{try{return n(await r)}catch(e){return{ok:!1,error:e,*[Symbol.iterator](){throw yield e,Error(`Unreachable`)}}}},async*[Symbol.asyncIterator](){try{return await r}catch(e){throw yield e,Error(`Unreachable`,{cause:e})}}}}return{_tag:`SyncFx`,[t]:{_A:()=>void 0,_E:()=>void 0,_R:()=>void 0},run:()=>{let t=s[Symbol.iterator](),r=t.next();for(;r.done!==!0;){let e=r.value,n=i(e);if(n===void 0)return{ok:!1,error:e,*[Symbol.iterator](){throw yield e,Error(`Unreachable`)}};let o=a._services.get(n.key);if(o===void 0)throw Error(`Service "${n.key}" not found during layer build`);r=t.next(o)}let o=r.value;return c.set(e,{context:o}),n(o)},*[Symbol.iterator](){let t=s[Symbol.iterator](),n=t.next();for(;n.done!==!0;){let e=n.value,r=i(e);if(r===void 0)throw yield e,Error(`Unreachable`);let o=a._services.get(r.key);if(o===void 0)throw Error(`Service "${r.key}" not found during layer build`);n=t.next(o)}return c.set(e,{context:n.value}),n.value}}}clear(){this.cache.clear()}get size(){return this.cache.size}},d=e({context:()=>m,layer:()=>f,layers:()=>p,service:()=>h});function f(e){return r=>{let i=e.build(new u,l())._tag,o=()=>{let t=new u,n=l();return{scope:n,layerBuildFx:e.build(t,n)}};return i===`AsyncFx`||r._tag===`AsyncFx`?{_tag:`AsyncFx`,[t]:{_A:()=>void 0,_E:()=>void 0,_R:()=>void 0},async*[Symbol.asyncIterator](){let{scope:e,layerBuildFx:t}=o();try{let e;if(t._tag===`AsyncFx`){let n=t[Symbol.asyncIterator](),r=await n.next();for(;r.done!==!0;){let e=yield r.value;r=await n.next(e)}e=r.value}else{let n=t[Symbol.iterator](),r=n.next();for(;r.done!==!0;){let e=yield r.value;r=n.next(e)}e=r.value}if(r._tag===`AsyncFx`){let t=r[Symbol.asyncIterator](),n=await t.next();for(;n.done!==!0;){let r=n.value,i=s(e,r);if(i!==void 0){n=await t.next(i);continue}let a=yield r;n=await t.next(a)}return n.value}let n=r[Symbol.iterator](),i=n.next();for(;i.done!==!0;){let t=i.value,r=s(e,t);if(r!==void 0){i=n.next(r);continue}let a=yield t;i=n.next(a)}return i.value}finally{yield*a(e.close(n(void 0)),t=>({...t,scope:e}))}}}:{_tag:`SyncFx`,[t]:{_A:()=>void 0,_E:()=>void 0,_R:()=>void 0},*[Symbol.iterator](){let{scope:e,layerBuildFx:t}=o();if(t._tag===`AsyncFx`)throw Error(`Provide.layer sync execution encountered an async layer build. Ensure async layers are treated as async at composition time.`);try{let e=t[Symbol.iterator](),n=e.next();for(;n.done!==!0;){let t=yield n.value;n=e.next(t)}let i=n.value,a=r[Symbol.iterator](),o=a.next();for(;o.done!==!0;){let e=o.value,t=s(i,e);if(t!==void 0){o=a.next(t);continue}let n=yield e;o=a.next(n)}return o.value}finally{yield*a(e.close(n(void 0)),t=>({...t,scope:e}))}}}}}function p(...e){return f(c(...e))}const m=e=>t=>a(t,o(e)),h=(e,t)=>n=>a(n,o(r(e,t)));export{d as t};
+//# sourceMappingURL=provide-K-6oXtLm.mjs.map

package/dist/provide-K-6oXtLm.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"provide-K-6oXtLm.mjs","names":["layer","service","layer","makeScope","fxGen","fxResult","service","layers","mergeLayers","Context.make"],"sources":["../src/provide/memo-map.ts","../src/provide/provide.ts"],"sourcesContent":["import type { Context } from \"../context/context\"\nimport { FxTypeId } from \"../fx/fx.types\"\nimport type { RunnableFx, SyncFx, AsyncFx, FxYield } from \"../fx/fx.types\"\nimport type { Layer } from \"../layer/layer.types\"\nimport { ok } from \"../result/result\"\nimport type { ScopeService } from \"../scope/scope\"\nimport { asServiceRequest } from \"../service/service-resolution\"\n\n/* oxlint-disable no-unsafe-type-assertion, only-throw-error -- MemoMap bridges erased generic Fx channels and re-emits typed domain errors from generator boundaries. */\n\n// ============================================================================\n// MemoMap\n// ============================================================================\n\ntype AnyLayer = Layer<unknown, unknown, unknown>\n\n/**\n * MemoMap caches built layers so each layer is only built once.\n * Multiple dependents share the same service instance.\n *\n * This implements the \"service singleton\" pattern where a service\n * is instantiated once and shared across all consumers.\n *\n * @example\n * ```ts\n * // Database is built once, shared by DocumentService and TeamService\n * const AppLayer = Layer.merge(\n *   ConfigLive,\n *   LoggerLive,\n *   DatabaseLive,       // Built once\n *   DocumentServiceLive, // Uses shared Database\n *   TeamServiceLive,     // Uses same Database instance\n * )\n * ```\n */\nexport class MemoMap {\n  private cache = new Map<\n    AnyLayer,\n    {\n      promise?: Promise<Context<unknown>>\n      context?: Context<unknown>\n      building?: boolean\n    }\n  >()\n\n  /**\n   * Get a cached context or build the layer if not cached.\n   *\n   * @param layer - The layer to get or build\n   * @param scope - The scope for resource management\n   * @param deps - Context containing the layer's dependencies\n   * @returns A RunnableFx producing the layer's context\n   */\n  getOrBuild<ROut, E, RIn>(\n    layer: Layer<ROut, E, RIn>,\n    scope: ScopeService,\n    deps: Context<RIn>,\n  ): RunnableFx<Context<ROut>, E> {\n    const cached = this.cache.get(layer as AnyLayer)\n\n    // Already built - return cached context\n    if (cached?.context) {\n      return {\n        _tag: \"SyncFx\",\n        [FxTypeId]: {\n          _A: () => cached.context as Context<ROut>,\n          _E: () => undefined as unknown as E,\n          _R: () => undefined as never,\n        },\n        run: () => ok(cached.context as Context<ROut>),\n        // oxlint-disable-next-line require-yield\n        *[Symbol.iterator](): Generator<FxYield<E, never>, Context<ROut>, unknown> {\n          return cached.context as Context<ROut>\n        },\n      } as SyncFx<Context<ROut>, E>\n    }\n\n    // Building in progress (async) - wait for it\n    if (cached?.promise) {\n      return {\n        _tag: \"AsyncFx\",\n        [FxTypeId]: {\n          _A: () => undefined as unknown as Context<ROut>,\n          _E: () => undefined as unknown as E,\n          _R: () => undefined as never,\n        },\n        run: async () => {\n          const ctx = await cached.promise!\n          return ok(ctx as Context<ROut>)\n        },\n        // oxlint-disable-next-line require-yield\n        async *[Symbol.asyncIterator](): AsyncGenerator<FxYield<E, never>, Context<ROut>, unknown> {\n          const ctx = await cached.promise!\n          return ctx as Context<ROut>\n        },\n      } as AsyncFx<Context<ROut>, E>\n    }\n\n    // Need to build - mark as building\n    this.cache.set(layer as AnyLayer, { building: true })\n\n    // Build the layer with provided dependencies\n    const buildFx = layer.build(this, scope)\n    const cacheRef = this.cache\n\n    // Determine if async\n    if (buildFx._tag === \"AsyncFx\") {\n      // Create a promise for the build\n      const buildPromise = (async () => {\n        const gen = buildFx[Symbol.asyncIterator]()\n        let result = await gen.next()\n\n        // Resolve service requests from deps\n        while (result.done !== true) {\n          const yielded = result.value\n          const serviceRequest = asServiceRequest(yielded)\n          if (serviceRequest === undefined) {\n            // It's an error - rethrow\n            throw yielded\n          }\n          const service = deps._services.get(serviceRequest.key)\n          if (service === undefined) {\n            throw new Error(`Service \"${serviceRequest.key}\" not found during layer build`)\n          }\n          // oxlint-disable-next-line no-await-in-loop\n          result = await gen.next(service)\n        }\n\n        const ctx = result.value\n        cacheRef.set(layer as AnyLayer, { context: ctx })\n        return ctx\n      })()\n\n      this.cache.set(layer as AnyLayer, { promise: buildPromise })\n\n      return {\n        _tag: \"AsyncFx\",\n        [FxTypeId]: {\n          _A: () => undefined as unknown as Context<ROut>,\n          _E: () => undefined as unknown as E,\n          _R: () => undefined as never,\n        },\n        run: async () => {\n          try {\n            const ctx = await buildPromise\n            return ok(ctx)\n          } catch (e) {\n            return {\n              ok: false,\n              error: e as E,\n              *[Symbol.iterator]() {\n                yield e as E\n                throw new Error(\"Unreachable\")\n              },\n            }\n          }\n        },\n        async *[Symbol.asyncIterator](): AsyncGenerator<FxYield<E, never>, Context<ROut>, unknown> {\n          try {\n            const ctx = await buildPromise\n            return ctx\n          } catch (e) {\n            yield e as E\n            throw new Error(\"Unreachable\", { cause: e })\n          }\n        },\n      } as AsyncFx<Context<ROut>, E>\n    }\n\n    // Sync build\n    return {\n      _tag: \"SyncFx\",\n      [FxTypeId]: {\n        _A: () => undefined as unknown as Context<ROut>,\n        _E: () => undefined as unknown as E,\n        _R: () => undefined as never,\n      },\n      run: () => {\n        const gen = buildFx[Symbol.iterator]()\n        let result = gen.next()\n\n        // Resolve service requests from deps\n        while (result.done !== true) {\n          const yielded = result.value\n          const serviceRequest = asServiceRequest(yielded)\n          if (serviceRequest === undefined) {\n            // It's an error\n            return {\n              ok: false,\n              error: yielded as E,\n              *[Symbol.iterator]() {\n                yield yielded as E\n                throw new Error(\"Unreachable\")\n              },\n            }\n          }\n          const service = deps._services.get(serviceRequest.key)\n          if (service === undefined) {\n            throw new Error(`Service \"${serviceRequest.key}\" not found during layer build`)\n          }\n          result = gen.next(service)\n        }\n\n        const ctx = result.value\n        cacheRef.set(layer as AnyLayer, { context: ctx })\n        return ok(ctx)\n      },\n      *[Symbol.iterator](): Generator<FxYield<E, never>, Context<ROut>, unknown> {\n        const gen = buildFx[Symbol.iterator]()\n        let result = gen.next()\n\n        // Resolve service requests from deps\n        while (result.done !== true) {\n          const yielded = result.value\n          const serviceRequest = asServiceRequest(yielded)\n          if (serviceRequest === undefined) {\n            // It's an error - yield it\n            yield yielded as E\n            throw new Error(\"Unreachable\")\n          }\n          const service = deps._services.get(serviceRequest.key)\n          if (service === undefined) {\n            throw new Error(`Service \"${serviceRequest.key}\" not found during layer build`)\n          }\n          result = gen.next(service)\n        }\n\n        cacheRef.set(layer as AnyLayer, { context: result.value })\n        return result.value\n      },\n    } as SyncFx<Context<ROut>, E>\n  }\n\n  /**\n   * Clear the cache.\n   * Useful for testing.\n   */\n  clear(): void {\n    this.cache.clear()\n  }\n\n  /**\n   * Get the number of cached layers.\n   */\n  get size(): number {\n    return this.cache.size\n  }\n}\n\n/* oxlint-enable no-unsafe-type-assertion, only-throw-error */\n","import * as Context from \"../context/context\"\nimport type { Context as ContextType } from \"../context/context\"\nimport { mergeRuntimeServices, withRuntimeState } from \"../fx/fx.runtime\"\nimport { FxTypeId } from \"../fx/fx.types\"\nimport type { RunnableFx, SyncFx, AsyncFx, FxYield } from \"../fx/fx.types\"\nimport { merge as mergeLayers } from \"../layer/layer\"\nimport type { AllSync, Layer as LayerType, MergeError, MergeROut, UnprovidedDeps } from \"../layer/layer.types\"\nimport { ok } from \"../result/result\"\nimport { make as makeScope } from \"../scope/scope\"\nimport type { ServiceClass } from \"../service/service\"\nimport { resolveService } from \"../service/service-resolution\"\nimport { MemoMap } from \"./memo-map\"\n\n/* oxlint-disable no-unsafe-type-assertion -- layer/service re-thread generic Fx channels through runtime service injection points. */\n\n// ============================================================================\n// Provide Layer\n// ============================================================================\n\n/**\n * Extract the value type from an Fx.\n */\ntype FxValueType<F> = F extends RunnableFx<infer A, unknown, unknown> ? A : never\n\n/**\n * Extract the error type from an Fx.\n */\ntype FxErrorType<F> = F extends RunnableFx<unknown, infer E, unknown> ? E : never\n\n/**\n * Type for the result of provide based on layer sync and fx type.\n * Uses infer to extract A and E from the actual Fx type.\n * - Sync layer + SyncFx → SyncFx\n * - Sync layer + AsyncFx → AsyncFx\n * - Async layer + any fx → AsyncFx\n * - Unknown sync layer + any fx → RunnableFx (fallback)\n */\ntype ProvideResult<\n  E2,\n  LayerSync extends boolean,\n  Fx extends RunnableFx<unknown, unknown, unknown>,\n> = LayerSync extends true\n  ? Fx[\"_tag\"] extends \"SyncFx\"\n    ? SyncFx<FxValueType<Fx>, FxErrorType<Fx> | E2>\n    : AsyncFx<FxValueType<Fx>, FxErrorType<Fx> | E2>\n  : LayerSync extends false\n    ? AsyncFx<FxValueType<Fx>, FxErrorType<Fx> | E2>\n    : RunnableFx<FxValueType<Fx>, FxErrorType<Fx> | E2>\n\ntype LayerList = [LayerType<unknown, unknown, unknown>, ...LayerType<unknown, unknown, unknown>[]]\ntype CompleteLayers<L extends LayerList> = UnprovidedDeps<L> extends never ? L : never\n\n/**\n * Provide a layer to an Fx computation, resolving all service requirements.\n * Creates a new scope for resource management.\n *\n * Type preservation:\n * - Sync layer + SyncFx → SyncFx\n * - Sync layer + AsyncFx → AsyncFx\n * - Async layer + any fx → AsyncFx\n * - Unknown sync layer + any fx → RunnableFx (fallback)\n *\n * @param layer - The layer providing services (must have no external requirements)\n * @returns A function that takes an Fx and returns an Fx with dependencies resolved\n *\n * @example\n * ```ts\n * import { Fx, Layer, Provide, Service } from \"@nicolastoulemont/std\"\n *\n * const Port = Service.tag<number>(\"Port\")\n * const portLayer = Layer.ok(Port, 3000)\n * const readPort = Fx.gen(function* () {\n *   return yield* Port\n * })\n * const provided = Provide.layer(portLayer)(readPort)\n * const exit = Fx.run(provided)\n * // => { _tag: \"Ok\", value: 3000 }\n * ```\n */\nexport function layer<ROut, E2, LayerSync extends boolean>(\n  layer: LayerType<ROut, E2, never, LayerSync>,\n): <Fx extends RunnableFx<unknown, unknown, ROut>>(fx: Fx) => ProvideResult<E2, LayerSync, Fx>\nexport function layer<ROut, E2>(layer: LayerType<ROut, E2>) {\n  return <A, E, R extends ROut>(fx: RunnableFx<A, E, R>): RunnableFx<A, E | E2> => {\n    // Build mode selection should remain stable for this wrapper,\n    // while actual layer state (scope + memoization) must be per-execution.\n    const layerBuildTag = layer.build(new MemoMap(), makeScope())._tag\n\n    const createRunLayerState = (): {\n      readonly scope: ReturnType<typeof makeScope>\n      readonly layerBuildFx: ReturnType<typeof layer.build>\n    } => {\n      const memoMap = new MemoMap()\n      const scope = makeScope()\n      return {\n        scope,\n        layerBuildFx: layer.build(memoMap, scope),\n      }\n    }\n\n    if (layerBuildTag === \"AsyncFx\" || fx._tag === \"AsyncFx\") {\n      return {\n        _tag: \"AsyncFx\",\n        [FxTypeId]: {\n          _A: () => undefined as unknown as A,\n          _E: () => undefined as unknown as E | E2,\n          _R: () => undefined as never,\n        },\n        async *[Symbol.asyncIterator](): AsyncGenerator<FxYield<E | E2, Exclude<R, ROut>>, A, unknown> {\n          const { scope, layerBuildFx } = createRunLayerState()\n\n          try {\n            // Build the layer\n            let ctx: ContextType<ROut>\n\n            if (layerBuildFx._tag === \"AsyncFx\") {\n              const gen = layerBuildFx[Symbol.asyncIterator]()\n              let result = await gen.next()\n\n              while (result.done !== true) {\n                const value = yield result.value\n                // oxlint-disable-next-line no-await-in-loop\n                result = await gen.next(value)\n              }\n              ctx = result.value\n            } else {\n              const gen = layerBuildFx[Symbol.iterator]()\n              let result = gen.next()\n\n              while (result.done !== true) {\n                const value = yield result.value\n                result = gen.next(value)\n              }\n              ctx = result.value\n            }\n\n            // Run the fx with the context\n            if (fx._tag === \"AsyncFx\") {\n              const fxGen = fx[Symbol.asyncIterator]()\n              let fxResult = await fxGen.next()\n\n              while (fxResult.done !== true) {\n                const yielded = fxResult.value\n\n                const service = resolveService(ctx, yielded)\n                if (service !== undefined) {\n                  // oxlint-disable-next-line no-await-in-loop\n                  fxResult = await fxGen.next(service)\n                  continue\n                }\n\n                // Pass through (error or unsatisfied service)\n                const value = yield yielded as FxYield<E, Exclude<R, ROut>>\n                // oxlint-disable-next-line no-await-in-loop\n                fxResult = await fxGen.next(value)\n              }\n\n              return fxResult.value\n            }\n\n            // Sync fx\n            const fxGen = fx[Symbol.iterator]()\n            let fxResult = fxGen.next()\n\n            while (fxResult.done !== true) {\n              const yielded = fxResult.value\n\n              const service = resolveService(ctx, yielded)\n              if (service !== undefined) {\n                fxResult = fxGen.next(service)\n                continue\n              }\n\n              const value = yield yielded as FxYield<E, Exclude<R, ROut>>\n              fxResult = fxGen.next(value)\n            }\n\n            return fxResult.value\n          } finally {\n            const closeResult = scope.close(ok(undefined))\n            const closeFx = withRuntimeState(closeResult, (state) => ({ ...state, scope }))\n            yield* closeFx\n          }\n        },\n      } as AsyncFx<A, E | E2>\n    }\n\n    // Both sync\n    return {\n      _tag: \"SyncFx\",\n      [FxTypeId]: {\n        _A: () => undefined as unknown as A,\n        _E: () => undefined as unknown as E | E2,\n        _R: () => undefined as never,\n      },\n      *[Symbol.iterator](): Generator<FxYield<E | E2, Exclude<R, ROut>>, A, unknown> {\n        const { scope, layerBuildFx } = createRunLayerState()\n\n        if (layerBuildFx._tag === \"AsyncFx\") {\n          throw new Error(\n            \"Provide.layer sync execution encountered an async layer build. Ensure async layers are treated as async at composition time.\",\n          )\n        }\n\n        try {\n          // Build the layer\n          const layerGen = layerBuildFx[Symbol.iterator]()\n          let layerResult = layerGen.next()\n\n          while (layerResult.done !== true) {\n            const value = yield layerResult.value\n            layerResult = layerGen.next(value)\n          }\n\n          const ctx = layerResult.value\n\n          // Run the fx with the context\n          const fxGen = fx[Symbol.iterator]()\n          let fxResult = fxGen.next()\n\n          while (fxResult.done !== true) {\n            const yielded = fxResult.value\n\n            const service = resolveService(ctx, yielded)\n            if (service !== undefined) {\n              fxResult = fxGen.next(service)\n              continue\n            }\n\n            const value = yield yielded as FxYield<E, Exclude<R, ROut>>\n            fxResult = fxGen.next(value)\n          }\n\n          return fxResult.value\n        } finally {\n          const closeResult = scope.close(ok(undefined))\n          // In sync-only branch, closeResult is always SyncFx.\n          yield* withRuntimeState(closeResult as SyncFx<void>, (state) => ({ ...state, scope }))\n        }\n      },\n    } as SyncFx<A, E | E2>\n  }\n}\n\n/**\n * Provide multiple layers to an Fx computation.\n * Equivalent to `Provide.layer(Layer.merge(...layers))`, but keeps the call site flatter.\n *\n * @param layers - Layers whose combined external requirements are fully satisfied\n * @returns A function that takes an Fx and returns an Fx with dependencies resolved\n *\n * @example\n * ```ts\n * import { Fx, Layer, Provide, Service, pipe } from \"@nicolastoulemont/std\"\n *\n * const Document = Service.tag<{ readonly getById: (id: string) => string }>(\"Document\")\n * const Team = Service.tag<{ readonly canRead: (id: string) => boolean }>(\"Team\")\n *\n * const program = Fx.gen(function* () {\n *   const document = yield* Document\n *   const team = yield* Team\n *   return team.canRead(\"doc-1\") ? document.getById(\"doc-1\") : \"forbidden\"\n * })\n *\n * const exit = Fx.run(\n *   pipe(\n *     program,\n *     Provide.layers(\n *       Layer.ok(Document, { getById: (id) => id }),\n *       Layer.ok(Team, { canRead: () => true }),\n *     ),\n *   ),\n * )\n * // => { _tag: \"Ok\", value: \"doc-1\" }\n * ```\n */\nexport function layers<L extends LayerList>(\n  ...layers: CompleteLayers<L>\n): <Fx extends RunnableFx<unknown, unknown, MergeROut<L>>>(fx: Fx) => ProvideResult<MergeError<L>, AllSync<L>, Fx>\nexport function layers(...layers: LayerList) {\n  return layer(mergeLayers(...layers))\n}\n\n// ============================================================================\n// Provide Context\n// ============================================================================\n\n/**\n * Provide a context directly to an Fx computation.\n *\n * @param ctx - The context containing services\n * @returns A function that takes an Fx and returns an Fx with dependencies resolved\n *\n * @example\n * ```ts\n * import { Context, Fx, Provide, Service } from \"@nicolastoulemont/std\"\n *\n * const Port = Service.tag<number>(\"Port\")\n * const ctx = Context.make(Port, 3000)\n * const readPort = Fx.gen(function* () {\n *   return yield* Port\n * })\n * const provided = Provide.context(ctx)(readPort)\n * const exit = Fx.run(provided)\n * // => { _tag: \"Ok\", value: 3000 }\n * ```\n */\nexport const context =\n  <R>(ctx: ContextType<R>) =>\n  <A, E>(fx: RunnableFx<A, E, R>): RunnableFx<A, E> => {\n    return withRuntimeState(fx, mergeRuntimeServices(ctx))\n  }\n\n// ============================================================================\n// Provide Service\n// ============================================================================\n\n/**\n * Provide a single service to an Fx computation.\n *\n * @param service - The service class (tag)\n * @param impl - The service implementation\n * @returns A function that takes an Fx and returns an Fx with the service provided\n *\n * @example\n * ```ts\n * import { Fx, Provide, Service } from \"@nicolastoulemont/std\"\n *\n * const Port = Service.tag<number>(\"Port\")\n * const readPort = Fx.gen(function* () {\n *   return yield* Port\n * })\n * const provided = Provide.service(Port, 3000)(readPort)\n * const exit = Fx.run(provided)\n * // => { _tag: \"Ok\", value: 3000 }\n * ```\n */\nexport const service =\n  <S>(service: ServiceClass<S>, impl: S) =>\n  <A, E, R>(fx: RunnableFx<A, E, R | S>): RunnableFx<A, E, Exclude<R, S>> => {\n    return withRuntimeState(fx, mergeRuntimeServices(Context.make(service, impl))) as RunnableFx<A, E, Exclude<R, S>>\n  }\n\n/* oxlint-enable no-unsafe-type-assertion */\n"],"mappings":"qTAmCA,IAAa,EAAb,KAAqB,CACnB,MAAgB,IAAI,IAiBpB,WACE,EACA,EACA,EAC8B,CAC9B,IAAM,EAAS,KAAK,MAAM,IAAIA,EAAkB,CAGhD,GAAI,GAAQ,QACV,MAAO,CACL,KAAM,UACL,GAAW,CACV,OAAU,EAAO,QACjB,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,QAAW,EAAG,EAAO,QAAyB,CAE9C,EAAE,OAAO,WAAkE,CACzE,OAAO,EAAO,SAEjB,CAIH,GAAI,GAAQ,QACV,MAAO,CACL,KAAM,WACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,IAAK,SAEI,EADK,MAAM,EAAO,QACM,CAGjC,OAAQ,OAAO,gBAA4E,CAEzF,OADY,MAAM,EAAO,SAG5B,CAIH,KAAK,MAAM,IAAIA,EAAmB,CAAE,SAAU,GAAM,CAAC,CAGrD,IAAM,EAAUA,EAAM,MAAM,KAAM,EAAM,CAClC,EAAW,KAAK,MAGtB,GAAI,EAAQ,OAAS,UAAW,CAE9B,IAAM,GAAgB,SAAY,CAChC,IAAM,EAAM,EAAQ,OAAO,gBAAgB,CACvC,EAAS,MAAM,EAAI,MAAM,CAG7B,KAAO,EAAO,OAAS,IAAM,CAC3B,IAAM,EAAU,EAAO,MACjB,EAAiB,EAAiB,EAAQ,CAChD,GAAI,IAAmB,IAAA,GAErB,MAAM,EAER,IAAMC,EAAU,EAAK,UAAU,IAAI,EAAe,IAAI,CACtD,GAAIA,IAAY,IAAA,GACd,MAAU,MAAM,YAAY,EAAe,IAAI,gCAAgC,CAGjF,EAAS,MAAM,EAAI,KAAKA,EAAQ,CAGlC,IAAM,EAAM,EAAO,MAEnB,OADA,EAAS,IAAID,EAAmB,CAAE,QAAS,EAAK,CAAC,CAC1C,KACL,CAIJ,OAFA,KAAK,MAAM,IAAIA,EAAmB,CAAE,QAAS,EAAc,CAAC,CAErD,CACL,KAAM,WACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,IAAK,SAAY,CACf,GAAI,CAEF,OAAO,EADK,MAAM,EACJ,OACP,EAAG,CACV,MAAO,CACL,GAAI,GACJ,MAAO,EACP,EAAE,OAAO,WAAY,CAEnB,MADA,MAAM,EACI,MAAM,cAAc,EAEjC,GAGL,OAAQ,OAAO,gBAA4E,CACzF,GAAI,CAEF,OADY,MAAM,QAEX,EAAG,CAEV,MADA,MAAM,EACI,MAAM,cAAe,CAAE,MAAO,EAAG,CAAC,GAGjD,CAIH,MAAO,CACL,KAAM,UACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,QAAW,CACT,IAAM,EAAM,EAAQ,OAAO,WAAW,CAClC,EAAS,EAAI,MAAM,CAGvB,KAAO,EAAO,OAAS,IAAM,CAC3B,IAAM,EAAU,EAAO,MACjB,EAAiB,EAAiB,EAAQ,CAChD,GAAI,IAAmB,IAAA,GAErB,MAAO,CACL,GAAI,GACJ,MAAO,EACP,EAAE,OAAO,WAAY,CAEnB,MADA,MAAM,EACI,MAAM,cAAc,EAEjC,CAEH,IAAMC,EAAU,EAAK,UAAU,IAAI,EAAe,IAAI,CACtD,GAAIA,IAAY,IAAA,GACd,MAAU,MAAM,YAAY,EAAe,IAAI,gCAAgC,CAEjF,EAAS,EAAI,KAAKA,EAAQ,CAG5B,IAAM,EAAM,EAAO,MAEnB,OADA,EAAS,IAAID,EAAmB,CAAE,QAAS,EAAK,CAAC,CAC1C,EAAG,EAAI,EAEhB,EAAE,OAAO,WAAkE,CACzE,IAAM,EAAM,EAAQ,OAAO,WAAW,CAClC,EAAS,EAAI,MAAM,CAGvB,KAAO,EAAO,OAAS,IAAM,CAC3B,IAAM,EAAU,EAAO,MACjB,EAAiB,EAAiB,EAAQ,CAChD,GAAI,IAAmB,IAAA,GAGrB,MADA,MAAM,EACI,MAAM,cAAc,CAEhC,IAAMC,EAAU,EAAK,UAAU,IAAI,EAAe,IAAI,CACtD,GAAIA,IAAY,IAAA,GACd,MAAU,MAAM,YAAY,EAAe,IAAI,gCAAgC,CAEjF,EAAS,EAAI,KAAKA,EAAQ,CAI5B,OADA,EAAS,IAAID,EAAmB,CAAE,QAAS,EAAO,MAAO,CAAC,CACnD,EAAO,OAEjB,CAOH,OAAc,CACZ,KAAK,MAAM,OAAO,CAMpB,IAAI,MAAe,CACjB,OAAO,KAAK,MAAM,mECnKtB,SAAgB,EAAgB,EAA4B,CAC1D,MAA8B,IAAmD,CAG/E,IAAM,EAAgBE,EAAM,MAAM,IAAI,EAAWC,GAAW,CAAC,CAAC,KAExD,MAGD,CACH,IAAM,EAAU,IAAI,EACd,EAAQA,GAAW,CACzB,MAAO,CACL,QACA,aAAcD,EAAM,MAAM,EAAS,EAAM,CAC1C,EA2FH,OAxFI,IAAkB,WAAa,EAAG,OAAS,UACtC,CACL,KAAM,WACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,OAAQ,OAAO,gBAAgF,CAC7F,GAAM,CAAE,QAAO,gBAAiB,GAAqB,CAErD,GAAI,CAEF,IAAI,EAEJ,GAAI,EAAa,OAAS,UAAW,CACnC,IAAM,EAAM,EAAa,OAAO,gBAAgB,CAC5C,EAAS,MAAM,EAAI,MAAM,CAE7B,KAAO,EAAO,OAAS,IAAM,CAC3B,IAAM,EAAQ,MAAM,EAAO,MAE3B,EAAS,MAAM,EAAI,KAAK,EAAM,CAEhC,EAAM,EAAO,UACR,CACL,IAAM,EAAM,EAAa,OAAO,WAAW,CACvC,EAAS,EAAI,MAAM,CAEvB,KAAO,EAAO,OAAS,IAAM,CAC3B,IAAM,EAAQ,MAAM,EAAO,MAC3B,EAAS,EAAI,KAAK,EAAM,CAE1B,EAAM,EAAO,MAIf,GAAI,EAAG,OAAS,UAAW,CACzB,IAAME,EAAQ,EAAG,OAAO,gBAAgB,CACpCC,EAAW,MAAMD,EAAM,MAAM,CAEjC,KAAOC,EAAS,OAAS,IAAM,CAC7B,IAAM,EAAUA,EAAS,MAEnBC,EAAU,EAAe,EAAK,EAAQ,CAC5C,GAAIA,IAAY,IAAA,GAAW,CAEzB,EAAW,MAAMF,EAAM,KAAKE,EAAQ,CACpC,SAIF,IAAM,EAAQ,MAAM,EAEpB,EAAW,MAAMF,EAAM,KAAK,EAAM,CAGpC,OAAOC,EAAS,MAIlB,IAAM,EAAQ,EAAG,OAAO,WAAW,CAC/B,EAAW,EAAM,MAAM,CAE3B,KAAO,EAAS,OAAS,IAAM,CAC7B,IAAM,EAAU,EAAS,MAEnBC,EAAU,EAAe,EAAK,EAAQ,CAC5C,GAAIA,IAAY,IAAA,GAAW,CACzB,EAAW,EAAM,KAAKA,EAAQ,CAC9B,SAGF,IAAM,EAAQ,MAAM,EACpB,EAAW,EAAM,KAAK,EAAM,CAG9B,OAAO,EAAS,aACR,CAGR,MADgB,EADI,EAAM,MAAM,EAAG,IAAA,GAAU,CAAC,CACC,IAAW,CAAE,GAAG,EAAO,QAAO,EAAE,GAIpF,CAII,CACL,KAAM,UACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CACD,EAAE,OAAO,WAAsE,CAC7E,GAAM,CAAE,QAAO,gBAAiB,GAAqB,CAErD,GAAI,EAAa,OAAS,UACxB,MAAU,MACR,+HACD,CAGH,GAAI,CAEF,IAAM,EAAW,EAAa,OAAO,WAAW,CAC5C,EAAc,EAAS,MAAM,CAEjC,KAAO,EAAY,OAAS,IAAM,CAChC,IAAM,EAAQ,MAAM,EAAY,MAChC,EAAc,EAAS,KAAK,EAAM,CAGpC,IAAM,EAAM,EAAY,MAGlB,EAAQ,EAAG,OAAO,WAAW,CAC/B,EAAW,EAAM,MAAM,CAE3B,KAAO,EAAS,OAAS,IAAM,CAC7B,IAAM,EAAU,EAAS,MAEnBA,EAAU,EAAe,EAAK,EAAQ,CAC5C,GAAIA,IAAY,IAAA,GAAW,CACzB,EAAW,EAAM,KAAKA,EAAQ,CAC9B,SAGF,IAAM,EAAQ,MAAM,EACpB,EAAW,EAAM,KAAK,EAAM,CAG9B,OAAO,EAAS,aACR,CAGR,MAAO,EAFa,EAAM,MAAM,EAAG,IAAA,GAAU,CAAC,CAEQ,IAAW,CAAE,GAAG,EAAO,QAAO,EAAE,GAG3F,EAuCL,SAAgB,EAAO,GAAGC,EAAmB,CAC3C,OAAO,EAAMC,EAAY,GAAGD,EAAO,CAAC,CA2BtC,MAAa,EACP,GACG,GACE,EAAiB,EAAI,EAAqB,EAAI,CAAC,CA2B7C,GACP,EAA0B,IACpB,GACD,EAAiB,EAAI,EAAqBE,EAAaH,EAAS,EAAK,CAAC,CAAC"}

package/dist/queue/index.d.mts

@@ -1,2 +1,2 @@
-import { t as queue_d_exports } from "../index-CVmgBpDt.mjs";
+import { t as queue_d_exports } from "../index-CBtUJ94I.mjs";
 export { queue_d_exports as Queue };

package/dist/queue/index.mjs

@@ -1 +1 @@
-import{a as e}from"../queue-GYVrD39q.mjs";export{e as Queue};
+import{a as e}from"../queue-CeEIUHcY.mjs";export{e as Queue};

package/dist/{queue-GYVrD39q.mjs → queue-CeEIUHcY.mjs}

@@ -1,2 +1,2 @@
-import{t as e}from"./chunk-oQKkju2G.mjs";import{t}from"./data-DqACNS_g.mjs";var n=e({QueueAbortedError:()=>i,QueueClosedError:()=>r,QueueTaskAbortedError:()=>a,bounded:()=>h,is:()=>f,make:()=>m,unbounded:()=>g}),r=class extends t(`QueueClosedError`){},i=class extends t(`QueueAbortedError`){},a=class extends t(`QueueTaskAbortedError`){};const o=e=>{let t=e??`unbounded`;if(t===`unbounded`)return 1/0;if(!Number.isInteger(t)||t<=0)throw RangeError(`Queue concurrency must be a positive integer or "unbounded", received: ${String(t)}`);return t},s=e=>{if(e!==1/0&&(!Number.isInteger(e)||e<0))throw RangeError(`Queue maxSize must be an integer >= 0, received: ${String(e)}`)},c=e=>new a({reason:e.reason}),l=e=>new r({state:e}),u=e=>e instanceof Error?e:Error(`Queue rejection reason was not an Error`,{cause:e}),d=(e,t)=>{if(t===void 0)return e;if(t.aborted)return t;if(e.aborted)return e;let n=new AbortController,r=()=>{n.abort(e.reason),t.removeEventListener(`abort`,i)},i=()=>{n.abort(t.reason),e.removeEventListener(`abort`,r)};return e.addEventListener(`abort`,r,{once:!0}),t.addEventListener(`abort`,i,{once:!0}),n.signal.addEventListener(`abort`,()=>{e.removeEventListener(`abort`,r),t.removeEventListener(`abort`,i)},{once:!0}),n.signal},f=e=>typeof e==`object`&&!!e&&`_tag`in e&&e._tag===`Queue`,p=(e,t)=>{s(e);let n=o(t?.concurrency),r=`open`,a,f=t?.autoStart===!1,p=0,m=!1,h=[],g=[],_=new Set,v=new AbortController,y,b,x=()=>{if(!(p!==0||h.length>0)){for(let e of _)e();_.clear(),(r===`draining`||r===`aborted`)&&(r=`closed`,y?.(),y=void 0)}},S=e=>{if(g.length===0)return;let t=g.splice(0);for(let n of t)n.reject(e)},C=()=>{if(!(!Number.isFinite(e)||g.length===0))for(;g.length>0&&h.length<e&&r===`open`;){let e=g.shift();e!==void 0&&e.resolve()}},w=e=>{if(h.length===0)return;let t=new i({reason:e}),n=h.splice(0);for(let e of n)e.reject(t)},T=t=>!Number.isFinite(e)||h.length<e?Promise.resolve():new Promise((e,n)=>{let r={resolve:()=>{t!==void 0&&i!==void 0&&t.removeEventListener(`abort`,i),e()},reject:e=>{t!==void 0&&i!==void 0&&t.removeEventListener(`abort`,i),n(e)},signal:t},i=t===void 0?void 0:()=>{let e=g.indexOf(r);e!==-1&&g.splice(e,1),n(c(t))};if(t!==void 0&&t.aborted){n(c(t));return}t!==void 0&&i!==void 0&&t.addEventListener(`abort`,i,{once:!0}),g.push(r)}),E=()=>{(r===`draining`||r===`aborted`)&&p===0&&h.length===0&&x()},D=e=>{p+=1;let t=d(v.signal,e.signal),n;if(t.aborted)n=Promise.reject(c(t));else try{n=Promise.resolve(e.task({signal:t}))}catch(e){n=Promise.reject(u(e))}n.then(t=>{e.resolve(t)},t=>{e.reject(u(t))}).finally(()=>{--p,C(),O(),x()})},O=()=>{if(!m){m=!0;try{if(r===`aborted`){E();return}for(;!f&&p<n&&h.length>0;){let e=h.shift();if(e===void 0)break;C(),D(e)}E()}finally{m=!1}}},k=()=>l(a===void 0?r===`aborted`?`aborted`:r===`draining`?`draining`:r===`closed`?a??`draining`:`draining`:a);return{_tag:`Queue`,get pending(){return p},get size(){return h.length},get isPaused(){return f},get isShutdown(){return r!==`open`},enqueue(t,n){let i=n?.signal;if(i!==void 0&&i.aborted)return Promise.reject(c(i));if(r!==`open`)return Promise.reject(k());let a=()=>new Promise((e,n)=>{let r={task:t,resolve:e,reject:n,signal:i};h.push(r),O()});return!Number.isFinite(e)||h.length<e?a():T(i).then(()=>{if(i!==void 0&&i.aborted)throw c(i);if(r!==`open`)throw k();return a()})},pause(){f=!0},resume(){f&&(f=!1,O())},awaitIdle(){return p===0&&h.length===0?Promise.resolve():new Promise(e=>{_.add(e)})},shutdown(e){let t=e?.mode??`drain`;return b!==void 0&&(r===`draining`||r===`aborted`||r===`closed`)?(t===`abort`&&a!==`aborted`&&(a=`aborted`,r=`aborted`,v.abort(e?.reason),w(e?.reason),S(l(`aborted`)),E()),b):(b??=new Promise(e=>{y=e}),t===`abort`?(a=`aborted`,r=`aborted`,f=!1,v.abort(e?.reason),w(e?.reason),S(l(`aborted`))):(a=`draining`,r===`open`&&(r=`draining`),f=!1,S(l(`draining`))),O(),x(),b)}}},m=e=>p(1/0,e),h=(e,t)=>p(e,t),g=e=>p(1/0,e);export{n as a,m as i,r as n,a as r,i as t};
-//# sourceMappingURL=queue-GYVrD39q.mjs.map
+import{t as e}from"./chunk-6rpU2rUb.mjs";import{t}from"./data-W10ldR5l.mjs";var n=e({QueueAbortedError:()=>i,QueueClosedError:()=>r,QueueTaskAbortedError:()=>a,bounded:()=>h,is:()=>f,make:()=>m,unbounded:()=>g}),r=class extends t(`QueueClosedError`){},i=class extends t(`QueueAbortedError`){},a=class extends t(`QueueTaskAbortedError`){};const o=e=>{let t=e??`unbounded`;if(t===`unbounded`)return 1/0;if(!Number.isInteger(t)||t<=0)throw RangeError(`Queue concurrency must be a positive integer or "unbounded", received: ${String(t)}`);return t},s=e=>{if(e!==1/0&&(!Number.isInteger(e)||e<0))throw RangeError(`Queue maxSize must be an integer >= 0, received: ${String(e)}`)},c=e=>new a({reason:e.reason}),l=e=>new r({state:e}),u=e=>e instanceof Error?e:Error(`Queue rejection reason was not an Error`,{cause:e}),d=(e,t)=>{if(t===void 0)return e;if(t.aborted)return t;if(e.aborted)return e;let n=new AbortController,r=()=>{n.abort(e.reason),t.removeEventListener(`abort`,i)},i=()=>{n.abort(t.reason),e.removeEventListener(`abort`,r)};return e.addEventListener(`abort`,r,{once:!0}),t.addEventListener(`abort`,i,{once:!0}),n.signal.addEventListener(`abort`,()=>{e.removeEventListener(`abort`,r),t.removeEventListener(`abort`,i)},{once:!0}),n.signal},f=e=>typeof e==`object`&&!!e&&`_tag`in e&&e._tag===`Queue`,p=(e,t)=>{s(e);let n=o(t?.concurrency),r=`open`,a,f=t?.autoStart===!1,p=0,m=!1,h=[],g=[],_=new Set,v=new AbortController,y,b,x=()=>{if(!(p!==0||h.length>0)){for(let e of _)e();_.clear(),(r===`draining`||r===`aborted`)&&(r=`closed`,y?.(),y=void 0)}},S=e=>{if(g.length===0)return;let t=g.splice(0);for(let n of t)n.reject(e)},C=()=>{if(!(!Number.isFinite(e)||g.length===0))for(;g.length>0&&h.length<e&&r===`open`;){let e=g.shift();e!==void 0&&e.resolve()}},w=e=>{if(h.length===0)return;let t=new i({reason:e}),n=h.splice(0);for(let e of n)e.reject(t)},T=t=>!Number.isFinite(e)||h.length<e?Promise.resolve():new Promise((e,n)=>{let r={resolve:()=>{t!==void 0&&i!==void 0&&t.removeEventListener(`abort`,i),e()},reject:e=>{t!==void 0&&i!==void 0&&t.removeEventListener(`abort`,i),n(e)},signal:t},i=t===void 0?void 0:()=>{let e=g.indexOf(r);e!==-1&&g.splice(e,1),n(c(t))};if(t!==void 0&&t.aborted){n(c(t));return}t!==void 0&&i!==void 0&&t.addEventListener(`abort`,i,{once:!0}),g.push(r)}),E=()=>{(r===`draining`||r===`aborted`)&&p===0&&h.length===0&&x()},D=e=>{p+=1;let t=d(v.signal,e.signal),n;if(t.aborted)n=Promise.reject(c(t));else try{n=Promise.resolve(e.task({signal:t}))}catch(e){n=Promise.reject(u(e))}n.then(t=>{e.resolve(t)},t=>{e.reject(u(t))}).finally(()=>{--p,C(),O(),x()})},O=()=>{if(!m){m=!0;try{if(r===`aborted`){E();return}for(;!f&&p<n&&h.length>0;){let e=h.shift();if(e===void 0)break;C(),D(e)}E()}finally{m=!1}}},k=()=>l(a===void 0?r===`aborted`?`aborted`:r===`draining`?`draining`:r===`closed`?a??`draining`:`draining`:a);return{_tag:`Queue`,get pending(){return p},get size(){return h.length},get isPaused(){return f},get isShutdown(){return r!==`open`},enqueue(t,n){let i=n?.signal;if(i!==void 0&&i.aborted)return Promise.reject(c(i));if(r!==`open`)return Promise.reject(k());let a=()=>new Promise((e,n)=>{let r={task:t,resolve:e,reject:n,signal:i};h.push(r),O()});return!Number.isFinite(e)||h.length<e?a():T(i).then(()=>{if(i!==void 0&&i.aborted)throw c(i);if(r!==`open`)throw k();return a()})},pause(){f=!0},resume(){f&&(f=!1,O())},awaitIdle(){return p===0&&h.length===0?Promise.resolve():new Promise(e=>{_.add(e)})},shutdown(e){let t=e?.mode??`drain`;return b!==void 0&&(r===`draining`||r===`aborted`||r===`closed`)?(t===`abort`&&a!==`aborted`&&(a=`aborted`,r=`aborted`,v.abort(e?.reason),w(e?.reason),S(l(`aborted`)),E()),b):(b??=new Promise(e=>{y=e}),t===`abort`?(a=`aborted`,r=`aborted`,f=!1,v.abort(e?.reason),w(e?.reason),S(l(`aborted`))):(a=`draining`,r===`open`&&(r=`draining`),f=!1,S(l(`draining`))),O(),x(),b)}}},m=e=>p(1/0,e),h=(e,t)=>p(e,t),g=e=>p(1/0,e);export{n as a,m as i,r as n,a as r,i as t};
+//# sourceMappingURL=queue-CeEIUHcY.mjs.map

package/dist/{queue-GYVrD39q.mjs.map → queue-CeEIUHcY.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"queue-GYVrD39q.mjs","names":["Data.TaggedError","options"],"sources":["../src/queue/queue.ts"],"sourcesContent":["/**\n * Promise-based work queue with bounded/unbounded capacity and shutdown modes.\n *\n * **Mental model**\n * - A queue coordinates concurrent task execution with backpressure.\n * - Enqueue returns a promise for each task result.\n *\n * **Common tasks**\n * - Create queues via `Queue.make`, `Queue.bounded`, or `Queue.unbounded`.\n * - Pause/resume processing and await idle state.\n * - Shutdown with drain or abort semantics.\n *\n * **Gotchas**\n * - Bounded queues can block enqueue when capacity is reached.\n * - Aborted queues reject queued and future tasks.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const pending = queue.pending\n * // => 0\n * ```\n *\n * @module\n */\nimport { Data } from \"../data\"\nimport type {\n  Concurrency,\n  Queue as QueueType,\n  QueueBoundedOptions,\n  QueueOptions,\n  QueueShutdownMode,\n  QueueShutdownOptions,\n  QueueTask,\n} from \"./queue.types\"\n\n/* oxlint-disable max-classes-per-file -- Queue exports dedicated error classes for precise instanceof checks at call sites. */\n/**\n * Error raised when enqueueing into a non-open queue.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueClosedError({ state: \"draining\" })\n * // => { _tag: \"QueueClosedError\", state: \"draining\" }\n * ```\n */\nexport class QueueClosedError extends Data.TaggedError(\"QueueClosedError\")<{ state: \"draining\" | \"aborted\" }> {}\n/**\n * Error raised when queue processing is aborted.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueAbortedError({ reason: \"manual\" })\n * // => { _tag: \"QueueAbortedError\", reason: \"manual\" }\n * ```\n */\nexport class QueueAbortedError extends Data.TaggedError(\"QueueAbortedError\")<{ reason?: unknown }> {}\n/**\n * Error raised when a specific task is aborted.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueTaskAbortedError({ reason: \"signal\" })\n * // => { _tag: \"QueueTaskAbortedError\", reason: \"signal\" }\n * ```\n */\nexport class QueueTaskAbortedError extends Data.TaggedError(\"QueueTaskAbortedError\")<{ reason?: unknown }> {}\n\ntype QueueState = \"open\" | \"draining\" | \"aborted\" | \"closed\"\n\ntype TaskEntry<A> = {\n  readonly task: QueueTask<A>\n  resolve(value: A | PromiseLike<A>): void\n  reject(reason: unknown): void\n  readonly signal: AbortSignal | undefined\n}\n\ntype CapacityWaiter = {\n  resolve(): void\n  reject(reason: Error): void\n  readonly signal: AbortSignal | undefined\n}\n\nconst asConcurrencyLimit = (concurrency: Concurrency | undefined): number => {\n  const resolved = concurrency ?? \"unbounded\"\n  if (resolved === \"unbounded\") {\n    return Number.POSITIVE_INFINITY\n  }\n\n  if (!Number.isInteger(resolved) || resolved <= 0) {\n    throw new RangeError(`Queue concurrency must be a positive integer or \"unbounded\", received: ${String(resolved)}`)\n  }\n\n  return resolved\n}\n\nconst assertMaxSize = (maxSize: number) => {\n  if (maxSize === Number.POSITIVE_INFINITY) {\n    return\n  }\n\n  if (!Number.isInteger(maxSize) || maxSize < 0) {\n    throw new RangeError(`Queue maxSize must be an integer >= 0, received: ${String(maxSize)}`)\n  }\n}\n\nconst queueTaskAbortedError = (signal: AbortSignal): QueueTaskAbortedError =>\n  new QueueTaskAbortedError({ reason: signal.reason })\n\nconst queueClosedError = (state: \"draining\" | \"aborted\"): QueueClosedError => new QueueClosedError({ state })\n\nconst toError = (reason: unknown): Error =>\n  reason instanceof Error ? reason : new Error(\"Queue rejection reason was not an Error\", { cause: reason })\n\nconst composeSignals = (queueSignal: AbortSignal, taskSignal: AbortSignal | undefined): AbortSignal => {\n  if (taskSignal === undefined) {\n    return queueSignal\n  }\n\n  if (taskSignal.aborted) {\n    return taskSignal\n  }\n\n  if (queueSignal.aborted) {\n    return queueSignal\n  }\n\n  const composite = new AbortController()\n\n  const onQueueAbort = () => {\n    composite.abort(queueSignal.reason)\n    taskSignal.removeEventListener(\"abort\", onTaskAbort)\n  }\n\n  const onTaskAbort = () => {\n    composite.abort(taskSignal.reason)\n    queueSignal.removeEventListener(\"abort\", onQueueAbort)\n  }\n\n  queueSignal.addEventListener(\"abort\", onQueueAbort, { once: true })\n  taskSignal.addEventListener(\"abort\", onTaskAbort, { once: true })\n\n  composite.signal.addEventListener(\n    \"abort\",\n    () => {\n      queueSignal.removeEventListener(\"abort\", onQueueAbort)\n      taskSignal.removeEventListener(\"abort\", onTaskAbort)\n    },\n    { once: true },\n  )\n\n  return composite.signal\n}\n\n/**\n * Check if a value is a `Queue`.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const isQueue = Queue.is(queue)\n * // => true\n * ```\n */\nexport const is = (value: unknown): value is QueueType =>\n  typeof value === \"object\" && value !== null && \"_tag\" in value && value._tag === \"Queue\"\n\nconst createQueue = (maxSize: number, options?: QueueOptions): QueueType => {\n  assertMaxSize(maxSize)\n\n  const concurrencyLimit = asConcurrencyLimit(options?.concurrency)\n  let state: QueueState = \"open\"\n  let closeState: \"draining\" | \"aborted\" | undefined\n  let paused = options?.autoStart === false\n  let pending = 0\n  let draining = false\n\n  const queuedTasks: TaskEntry<unknown>[] = []\n  const capacityWaiters: CapacityWaiter[] = []\n  const idleWaiters = new Set<() => void>()\n\n  const queueAbortController = new AbortController()\n\n  let shutdownResolver: (() => void) | undefined\n  let shutdownPromise: Promise<void> | undefined\n\n  const resolveIdleIfNeeded = () => {\n    if (pending !== 0 || queuedTasks.length > 0) {\n      return\n    }\n\n    for (const resolve of idleWaiters) {\n      resolve()\n    }\n    idleWaiters.clear()\n\n    if (state === \"draining\" || state === \"aborted\") {\n      state = \"closed\"\n      shutdownResolver?.()\n      shutdownResolver = undefined\n    }\n  }\n\n  const rejectCapacityWaiters = (reason: Error) => {\n    if (capacityWaiters.length === 0) {\n      return\n    }\n\n    const waiters = capacityWaiters.splice(0)\n    for (const waiter of waiters) {\n      waiter.reject(reason)\n    }\n  }\n\n  const releaseCapacityWaiters = () => {\n    if (!Number.isFinite(maxSize) || capacityWaiters.length === 0) {\n      return\n    }\n\n    while (capacityWaiters.length > 0 && queuedTasks.length < maxSize && state === \"open\") {\n      const waiter = capacityWaiters.shift()\n      if (waiter !== undefined) {\n        waiter.resolve()\n      }\n    }\n  }\n\n  const applyAbortToQueuedTasks = (reason: unknown) => {\n    if (queuedTasks.length === 0) {\n      return\n    }\n\n    const error = new QueueAbortedError({ reason })\n    const tasks = queuedTasks.splice(0)\n    for (const entry of tasks) {\n      entry.reject(error)\n    }\n  }\n\n  const waitForCapacity = (signal: AbortSignal | undefined): Promise<void> => {\n    if (!Number.isFinite(maxSize)) {\n      return Promise.resolve()\n    }\n\n    if (queuedTasks.length < maxSize) {\n      return Promise.resolve()\n    }\n\n    return new Promise<void>((resolve, reject) => {\n      const waiter: CapacityWaiter = {\n        resolve: () => {\n          if (signal !== undefined && onAbort !== undefined) {\n            signal.removeEventListener(\"abort\", onAbort)\n          }\n          resolve()\n        },\n        reject: (error) => {\n          if (signal !== undefined && onAbort !== undefined) {\n            signal.removeEventListener(\"abort\", onAbort)\n          }\n          reject(error)\n        },\n        signal,\n      }\n\n      const onAbort =\n        signal === undefined\n          ? undefined\n          : () => {\n              const index = capacityWaiters.indexOf(waiter)\n              if (index !== -1) {\n                capacityWaiters.splice(index, 1)\n              }\n              reject(queueTaskAbortedError(signal))\n            }\n\n      if (signal !== undefined && signal.aborted) {\n        reject(queueTaskAbortedError(signal))\n        return\n      }\n\n      if (signal !== undefined && onAbort !== undefined) {\n        signal.addEventListener(\"abort\", onAbort, { once: true })\n      }\n\n      capacityWaiters.push(waiter)\n    })\n  }\n\n  const closeIfNeeded = () => {\n    if ((state === \"draining\" || state === \"aborted\") && pending === 0 && queuedTasks.length === 0) {\n      resolveIdleIfNeeded()\n    }\n  }\n\n  const runTask = <A>(entry: TaskEntry<A>) => {\n    pending += 1\n\n    const taskSignal = composeSignals(queueAbortController.signal, entry.signal)\n\n    let taskResult: Promise<A>\n    if (taskSignal.aborted) {\n      taskResult = Promise.reject(queueTaskAbortedError(taskSignal))\n    } else {\n      try {\n        taskResult = Promise.resolve(entry.task({ signal: taskSignal }))\n      } catch (error) {\n        taskResult = Promise.reject(toError(error))\n      }\n    }\n\n    void taskResult\n      .then(\n        (value) => {\n          entry.resolve(value)\n          return undefined\n        },\n        (error: unknown) => {\n          entry.reject(toError(error))\n          return undefined\n        },\n      )\n      .finally(() => {\n        pending -= 1\n        releaseCapacityWaiters()\n        drainQueue()\n        resolveIdleIfNeeded()\n      })\n  }\n\n  const drainQueue = () => {\n    if (draining) {\n      return\n    }\n\n    draining = true\n    try {\n      if (state === \"aborted\") {\n        closeIfNeeded()\n        return\n      }\n\n      while (!paused && pending < concurrencyLimit && queuedTasks.length > 0) {\n        const entry = queuedTasks.shift()\n        if (entry === undefined) {\n          break\n        }\n        releaseCapacityWaiters()\n        runTask(entry)\n      }\n\n      closeIfNeeded()\n    } finally {\n      draining = false\n    }\n  }\n\n  const enqueueErrorForState = (): QueueClosedError => {\n    if (closeState !== undefined) {\n      return queueClosedError(closeState)\n    }\n\n    if (state === \"aborted\") {\n      return queueClosedError(\"aborted\")\n    }\n\n    if (state === \"draining\") {\n      return queueClosedError(\"draining\")\n    }\n\n    if (state === \"closed\") {\n      return queueClosedError(closeState ?? \"draining\")\n    }\n\n    return queueClosedError(\"draining\")\n  }\n\n  const queue: QueueType = {\n    _tag: \"Queue\",\n\n    get pending(): number {\n      return pending\n    },\n\n    get size(): number {\n      return queuedTasks.length\n    },\n\n    get isPaused(): boolean {\n      return paused\n    },\n\n    get isShutdown(): boolean {\n      return state !== \"open\"\n    },\n\n    enqueue<A>(task: QueueTask<A>, options?: { readonly signal?: AbortSignal }): Promise<A> {\n      const signal = options?.signal\n\n      if (signal !== undefined && signal.aborted) {\n        return Promise.reject(queueTaskAbortedError(signal))\n      }\n\n      if (state !== \"open\") {\n        return Promise.reject(enqueueErrorForState())\n      }\n\n      const enqueueTask = () =>\n        new Promise<A>((resolve, reject) => {\n          const entry: TaskEntry<A> = {\n            task,\n            resolve,\n            reject,\n            signal,\n          }\n\n          queuedTasks.push(entry)\n          drainQueue()\n        })\n\n      if (!Number.isFinite(maxSize) || queuedTasks.length < maxSize) {\n        return enqueueTask()\n      }\n\n      return waitForCapacity(signal).then(() => {\n        if (signal !== undefined && signal.aborted) {\n          throw queueTaskAbortedError(signal)\n        }\n\n        if (state !== \"open\") {\n          throw enqueueErrorForState()\n        }\n\n        return enqueueTask()\n      })\n    },\n\n    pause(): void {\n      paused = true\n    },\n\n    resume(): void {\n      if (!paused) {\n        return\n      }\n\n      paused = false\n      drainQueue()\n    },\n\n    awaitIdle(): Promise<void> {\n      if (pending === 0 && queuedTasks.length === 0) {\n        return Promise.resolve()\n      }\n\n      return new Promise<void>((resolve) => {\n        idleWaiters.add(resolve)\n      })\n    },\n\n    shutdown(options?: QueueShutdownOptions): Promise<void> {\n      const mode: QueueShutdownMode = options?.mode ?? \"drain\"\n\n      if (shutdownPromise !== undefined && (state === \"draining\" || state === \"aborted\" || state === \"closed\")) {\n        if (mode === \"abort\" && closeState !== \"aborted\") {\n          closeState = \"aborted\"\n          state = \"aborted\"\n          queueAbortController.abort(options?.reason)\n          applyAbortToQueuedTasks(options?.reason)\n          rejectCapacityWaiters(queueClosedError(\"aborted\"))\n          closeIfNeeded()\n        }\n\n        return shutdownPromise\n      }\n\n      shutdownPromise =\n        shutdownPromise ??\n        new Promise<void>((resolve) => {\n          shutdownResolver = resolve\n        })\n\n      if (mode === \"abort\") {\n        closeState = \"aborted\"\n        state = \"aborted\"\n        paused = false\n        queueAbortController.abort(options?.reason)\n        applyAbortToQueuedTasks(options?.reason)\n        rejectCapacityWaiters(queueClosedError(\"aborted\"))\n      } else {\n        closeState = \"draining\"\n        if (state === \"open\") {\n          state = \"draining\"\n        }\n        paused = false\n        rejectCapacityWaiters(queueClosedError(\"draining\"))\n      }\n\n      drainQueue()\n      resolveIdleIfNeeded()\n\n      return shutdownPromise\n    },\n  }\n\n  return queue\n}\n\n/**\n * Create a queue with default unbounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const pending = queue.pending\n * // => 0\n * ```\n */\nexport const make = (options?: QueueOptions): QueueType => createQueue(Number.POSITIVE_INFINITY, options)\n\n/**\n * Create a queue with bounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.bounded(2)\n * const size = queue.size\n * // => 0\n * ```\n */\nexport const bounded = (maxSize: number, options?: QueueBoundedOptions): QueueType => createQueue(maxSize, options)\n\n/**\n * Create a queue with explicit unbounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.unbounded()\n * const paused = queue.isPaused\n * // => false\n * ```\n */\nexport const unbounded = (options?: QueueOptions): QueueType => createQueue(Number.POSITIVE_INFINITY, options)\n\n/* oxlint-enable max-classes-per-file */\n"],"mappings":"oNAoDa,EAAb,cAAsCA,EAAiB,mBAAmB,AAAoC,GAYjG,EAAb,cAAuCA,EAAiB,oBAAoB,AAAuB,GAYtF,EAAb,cAA2CA,EAAiB,wBAAwB,AAAuB,GAiB3G,MAAM,EAAsB,GAAiD,CAC3E,IAAM,EAAW,GAAe,YAChC,GAAI,IAAa,YACf,MAAO,KAGT,GAAI,CAAC,OAAO,UAAU,EAAS,EAAI,GAAY,EAC7C,MAAU,WAAW,0EAA0E,OAAO,EAAS,GAAG,CAGpH,OAAO,GAGH,EAAiB,GAAoB,CACrC,OAAY,MAIZ,CAAC,OAAO,UAAU,EAAQ,EAAI,EAAU,GAC1C,MAAU,WAAW,oDAAoD,OAAO,EAAQ,GAAG,EAIzF,EAAyB,GAC7B,IAAI,EAAsB,CAAE,OAAQ,EAAO,OAAQ,CAAC,CAEhD,EAAoB,GAAoD,IAAI,EAAiB,CAAE,QAAO,CAAC,CAEvG,EAAW,GACf,aAAkB,MAAQ,EAAa,MAAM,0CAA2C,CAAE,MAAO,EAAQ,CAAC,CAEtG,GAAkB,EAA0B,IAAqD,CACrG,GAAI,IAAe,IAAA,GACjB,OAAO,EAGT,GAAI,EAAW,QACb,OAAO,EAGT,GAAI,EAAY,QACd,OAAO,EAGT,IAAM,EAAY,IAAI,gBAEhB,MAAqB,CACzB,EAAU,MAAM,EAAY,OAAO,CACnC,EAAW,oBAAoB,QAAS,EAAY,EAGhD,MAAoB,CACxB,EAAU,MAAM,EAAW,OAAO,CAClC,EAAY,oBAAoB,QAAS,EAAa,EAexD,OAZA,EAAY,iBAAiB,QAAS,EAAc,CAAE,KAAM,GAAM,CAAC,CACnE,EAAW,iBAAiB,QAAS,EAAa,CAAE,KAAM,GAAM,CAAC,CAEjE,EAAU,OAAO,iBACf,YACM,CACJ,EAAY,oBAAoB,QAAS,EAAa,CACtD,EAAW,oBAAoB,QAAS,EAAY,EAEtD,CAAE,KAAM,GAAM,CACf,CAEM,EAAU,QAeN,EAAM,GACjB,OAAO,GAAU,YAAY,GAAkB,SAAU,GAAS,EAAM,OAAS,QAE7E,GAAe,EAAiB,IAAsC,CAC1E,EAAc,EAAQ,CAEtB,IAAM,EAAmB,EAAmB,GAAS,YAAY,CAC7D,EAAoB,OACpB,EACA,EAAS,GAAS,YAAc,GAChC,EAAU,EACV,EAAW,GAET,EAAoC,EAAE,CACtC,EAAoC,EAAE,CACtC,EAAc,IAAI,IAElB,EAAuB,IAAI,gBAE7B,EACA,EAEE,MAA4B,CAC5B,SAAY,GAAK,EAAY,OAAS,GAI1C,KAAK,IAAM,KAAW,EACpB,GAAS,CAEX,EAAY,OAAO,EAEf,IAAU,YAAc,IAAU,aACpC,EAAQ,SACR,KAAoB,CACpB,EAAmB,IAAA,MAIjB,EAAyB,GAAkB,CAC/C,GAAI,EAAgB,SAAW,EAC7B,OAGF,IAAM,EAAU,EAAgB,OAAO,EAAE,CACzC,IAAK,IAAM,KAAU,EACnB,EAAO,OAAO,EAAO,EAInB,MAA+B,CAC/B,MAAC,OAAO,SAAS,EAAQ,EAAI,EAAgB,SAAW,GAI5D,KAAO,EAAgB,OAAS,GAAK,EAAY,OAAS,GAAW,IAAU,QAAQ,CACrF,IAAM,EAAS,EAAgB,OAAO,CAClC,IAAW,IAAA,IACb,EAAO,SAAS,GAKhB,EAA2B,GAAoB,CACnD,GAAI,EAAY,SAAW,EACzB,OAGF,IAAM,EAAQ,IAAI,EAAkB,CAAE,SAAQ,CAAC,CACzC,EAAQ,EAAY,OAAO,EAAE,CACnC,IAAK,IAAM,KAAS,EAClB,EAAM,OAAO,EAAM,EAIjB,EAAmB,GACnB,CAAC,OAAO,SAAS,EAAQ,EAIzB,EAAY,OAAS,EAChB,QAAQ,SAAS,CAGnB,IAAI,SAAe,EAAS,IAAW,CAC5C,IAAM,EAAyB,CAC7B,YAAe,CACT,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,oBAAoB,QAAS,EAAQ,CAE9C,GAAS,EAEX,OAAS,GAAU,CACb,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,oBAAoB,QAAS,EAAQ,CAE9C,EAAO,EAAM,EAEf,SACD,CAEK,EACJ,IAAW,IAAA,GACP,IAAA,OACM,CACJ,IAAM,EAAQ,EAAgB,QAAQ,EAAO,CACzC,IAAU,IACZ,EAAgB,OAAO,EAAO,EAAE,CAElC,EAAO,EAAsB,EAAO,CAAC,EAG7C,GAAI,IAAW,IAAA,IAAa,EAAO,QAAS,CAC1C,EAAO,EAAsB,EAAO,CAAC,CACrC,OAGE,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,GAAM,CAAC,CAG3D,EAAgB,KAAK,EAAO,EAC5B,CAGE,MAAsB,EACrB,IAAU,YAAc,IAAU,YAAc,IAAY,GAAK,EAAY,SAAW,GAC3F,GAAqB,EAInB,EAAc,GAAwB,CAC1C,GAAW,EAEX,IAAM,EAAa,EAAe,EAAqB,OAAQ,EAAM,OAAO,CAExE,EACJ,GAAI,EAAW,QACb,EAAa,QAAQ,OAAO,EAAsB,EAAW,CAAC,MAE9D,GAAI,CACF,EAAa,QAAQ,QAAQ,EAAM,KAAK,CAAE,OAAQ,EAAY,CAAC,CAAC,OACzD,EAAO,CACd,EAAa,QAAQ,OAAO,EAAQ,EAAM,CAAC,CAI1C,EACF,KACE,GAAU,CACT,EAAM,QAAQ,EAAM,EAGrB,GAAmB,CAClB,EAAM,OAAO,EAAQ,EAAM,CAAC,EAG/B,CACA,YAAc,CACb,IACA,GAAwB,CACxB,GAAY,CACZ,GAAqB,EACrB,EAGA,MAAmB,CACnB,MAIJ,GAAW,GACX,GAAI,CACF,GAAI,IAAU,UAAW,CACvB,GAAe,CACf,OAGF,KAAO,CAAC,GAAU,EAAU,GAAoB,EAAY,OAAS,GAAG,CACtE,IAAM,EAAQ,EAAY,OAAO,CACjC,GAAI,IAAU,IAAA,GACZ,MAEF,GAAwB,CACxB,EAAQ,EAAM,CAGhB,GAAe,QACP,CACR,EAAW,MAIT,MAMK,EALL,IAAe,IAAA,GAIf,IAAU,UACY,UAGtB,IAAU,WACY,WAGtB,IAAU,SACY,GAAc,WAGhB,WAfE,EAAW,CAkJvC,MAhIyB,CACvB,KAAM,QAEN,IAAI,SAAkB,CACpB,OAAO,GAGT,IAAI,MAAe,CACjB,OAAO,EAAY,QAGrB,IAAI,UAAoB,CACtB,OAAO,GAGT,IAAI,YAAsB,CACxB,OAAO,IAAU,QAGnB,QAAW,EAAoB,EAAyD,CACtF,IAAM,EAASC,GAAS,OAExB,GAAI,IAAW,IAAA,IAAa,EAAO,QACjC,OAAO,QAAQ,OAAO,EAAsB,EAAO,CAAC,CAGtD,GAAI,IAAU,OACZ,OAAO,QAAQ,OAAO,GAAsB,CAAC,CAG/C,IAAM,MACJ,IAAI,SAAY,EAAS,IAAW,CAClC,IAAM,EAAsB,CAC1B,OACA,UACA,SACA,SACD,CAED,EAAY,KAAK,EAAM,CACvB,GAAY,EACZ,CAMJ,MAJI,CAAC,OAAO,SAAS,EAAQ,EAAI,EAAY,OAAS,EAC7C,GAAa,CAGf,EAAgB,EAAO,CAAC,SAAW,CACxC,GAAI,IAAW,IAAA,IAAa,EAAO,QACjC,MAAM,EAAsB,EAAO,CAGrC,GAAI,IAAU,OACZ,MAAM,GAAsB,CAG9B,OAAO,GAAa,EACpB,EAGJ,OAAc,CACZ,EAAS,IAGX,QAAe,CACR,IAIL,EAAS,GACT,GAAY,GAGd,WAA2B,CAKzB,OAJI,IAAY,GAAK,EAAY,SAAW,EACnC,QAAQ,SAAS,CAGnB,IAAI,QAAe,GAAY,CACpC,EAAY,IAAI,EAAQ,EACxB,EAGJ,SAAS,EAA+C,CACtD,IAAM,EAA0BA,GAAS,MAAQ,QAwCjD,OAtCI,IAAoB,IAAA,KAAc,IAAU,YAAc,IAAU,WAAa,IAAU,WACzF,IAAS,SAAW,IAAe,YACrC,EAAa,UACb,EAAQ,UACR,EAAqB,MAAMA,GAAS,OAAO,CAC3C,EAAwBA,GAAS,OAAO,CACxC,EAAsB,EAAiB,UAAU,CAAC,CAClD,GAAe,EAGV,IAGT,IAEE,IAAI,QAAe,GAAY,CAC7B,EAAmB,GACnB,CAEA,IAAS,SACX,EAAa,UACb,EAAQ,UACR,EAAS,GACT,EAAqB,MAAMA,GAAS,OAAO,CAC3C,EAAwBA,GAAS,OAAO,CACxC,EAAsB,EAAiB,UAAU,CAAC,GAElD,EAAa,WACT,IAAU,SACZ,EAAQ,YAEV,EAAS,GACT,EAAsB,EAAiB,WAAW,CAAC,EAGrD,GAAY,CACZ,GAAqB,CAEd,IAEV,EAiBU,EAAQ,GAAsC,EAAY,IAA0B,EAAQ,CAc5F,GAAW,EAAiB,IAA6C,EAAY,EAAS,EAAQ,CActG,EAAa,GAAsC,EAAY,IAA0B,EAAQ"}
+{"version":3,"file":"queue-CeEIUHcY.mjs","names":["Data.TaggedError","options"],"sources":["../src/queue/queue.ts"],"sourcesContent":["/**\n * Promise-based work queue with bounded/unbounded capacity and shutdown modes.\n *\n * **Mental model**\n * - A queue coordinates concurrent task execution with backpressure.\n * - Enqueue returns a promise for each task result.\n *\n * **Common tasks**\n * - Create queues via `Queue.make`, `Queue.bounded`, or `Queue.unbounded`.\n * - Pause/resume processing and await idle state.\n * - Shutdown with drain or abort semantics.\n *\n * **Gotchas**\n * - Bounded queues can block enqueue when capacity is reached.\n * - Aborted queues reject queued and future tasks.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const pending = queue.pending\n * // => 0\n * ```\n *\n * @module\n */\nimport { Data } from \"../data\"\nimport type {\n  Concurrency,\n  Queue as QueueType,\n  QueueBoundedOptions,\n  QueueOptions,\n  QueueShutdownMode,\n  QueueShutdownOptions,\n  QueueTask,\n} from \"./queue.types\"\n\n/* oxlint-disable max-classes-per-file -- Queue exports dedicated error classes for precise instanceof checks at call sites. */\n/**\n * Error raised when enqueueing into a non-open queue.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueClosedError({ state: \"draining\" })\n * // => { _tag: \"QueueClosedError\", state: \"draining\" }\n * ```\n */\nexport class QueueClosedError extends Data.TaggedError(\"QueueClosedError\")<{ state: \"draining\" | \"aborted\" }> {}\n/**\n * Error raised when queue processing is aborted.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueAbortedError({ reason: \"manual\" })\n * // => { _tag: \"QueueAbortedError\", reason: \"manual\" }\n * ```\n */\nexport class QueueAbortedError extends Data.TaggedError(\"QueueAbortedError\")<{ reason?: unknown }> {}\n/**\n * Error raised when a specific task is aborted.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const error = new Queue.QueueTaskAbortedError({ reason: \"signal\" })\n * // => { _tag: \"QueueTaskAbortedError\", reason: \"signal\" }\n * ```\n */\nexport class QueueTaskAbortedError extends Data.TaggedError(\"QueueTaskAbortedError\")<{ reason?: unknown }> {}\n\ntype QueueState = \"open\" | \"draining\" | \"aborted\" | \"closed\"\n\ntype TaskEntry<A> = {\n  readonly task: QueueTask<A>\n  resolve(value: A | PromiseLike<A>): void\n  reject(reason: unknown): void\n  readonly signal: AbortSignal | undefined\n}\n\ntype CapacityWaiter = {\n  resolve(): void\n  reject(reason: Error): void\n  readonly signal: AbortSignal | undefined\n}\n\nconst asConcurrencyLimit = (concurrency: Concurrency | undefined): number => {\n  const resolved = concurrency ?? \"unbounded\"\n  if (resolved === \"unbounded\") {\n    return Number.POSITIVE_INFINITY\n  }\n\n  if (!Number.isInteger(resolved) || resolved <= 0) {\n    throw new RangeError(`Queue concurrency must be a positive integer or \"unbounded\", received: ${String(resolved)}`)\n  }\n\n  return resolved\n}\n\nconst assertMaxSize = (maxSize: number) => {\n  if (maxSize === Number.POSITIVE_INFINITY) {\n    return\n  }\n\n  if (!Number.isInteger(maxSize) || maxSize < 0) {\n    throw new RangeError(`Queue maxSize must be an integer >= 0, received: ${String(maxSize)}`)\n  }\n}\n\nconst queueTaskAbortedError = (signal: AbortSignal): QueueTaskAbortedError =>\n  new QueueTaskAbortedError({ reason: signal.reason })\n\nconst queueClosedError = (state: \"draining\" | \"aborted\"): QueueClosedError => new QueueClosedError({ state })\n\nconst toError = (reason: unknown): Error =>\n  reason instanceof Error ? reason : new Error(\"Queue rejection reason was not an Error\", { cause: reason })\n\nconst composeSignals = (queueSignal: AbortSignal, taskSignal: AbortSignal | undefined): AbortSignal => {\n  if (taskSignal === undefined) {\n    return queueSignal\n  }\n\n  if (taskSignal.aborted) {\n    return taskSignal\n  }\n\n  if (queueSignal.aborted) {\n    return queueSignal\n  }\n\n  const composite = new AbortController()\n\n  const onQueueAbort = () => {\n    composite.abort(queueSignal.reason)\n    taskSignal.removeEventListener(\"abort\", onTaskAbort)\n  }\n\n  const onTaskAbort = () => {\n    composite.abort(taskSignal.reason)\n    queueSignal.removeEventListener(\"abort\", onQueueAbort)\n  }\n\n  queueSignal.addEventListener(\"abort\", onQueueAbort, { once: true })\n  taskSignal.addEventListener(\"abort\", onTaskAbort, { once: true })\n\n  composite.signal.addEventListener(\n    \"abort\",\n    () => {\n      queueSignal.removeEventListener(\"abort\", onQueueAbort)\n      taskSignal.removeEventListener(\"abort\", onTaskAbort)\n    },\n    { once: true },\n  )\n\n  return composite.signal\n}\n\n/**\n * Check if a value is a `Queue`.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const isQueue = Queue.is(queue)\n * // => true\n * ```\n */\nexport const is = (value: unknown): value is QueueType =>\n  typeof value === \"object\" && value !== null && \"_tag\" in value && value._tag === \"Queue\"\n\nconst createQueue = (maxSize: number, options?: QueueOptions): QueueType => {\n  assertMaxSize(maxSize)\n\n  const concurrencyLimit = asConcurrencyLimit(options?.concurrency)\n  let state: QueueState = \"open\"\n  let closeState: \"draining\" | \"aborted\" | undefined\n  let paused = options?.autoStart === false\n  let pending = 0\n  let draining = false\n\n  const queuedTasks: TaskEntry<unknown>[] = []\n  const capacityWaiters: CapacityWaiter[] = []\n  const idleWaiters = new Set<() => void>()\n\n  const queueAbortController = new AbortController()\n\n  let shutdownResolver: (() => void) | undefined\n  let shutdownPromise: Promise<void> | undefined\n\n  const resolveIdleIfNeeded = () => {\n    if (pending !== 0 || queuedTasks.length > 0) {\n      return\n    }\n\n    for (const resolve of idleWaiters) {\n      resolve()\n    }\n    idleWaiters.clear()\n\n    if (state === \"draining\" || state === \"aborted\") {\n      state = \"closed\"\n      shutdownResolver?.()\n      shutdownResolver = undefined\n    }\n  }\n\n  const rejectCapacityWaiters = (reason: Error) => {\n    if (capacityWaiters.length === 0) {\n      return\n    }\n\n    const waiters = capacityWaiters.splice(0)\n    for (const waiter of waiters) {\n      waiter.reject(reason)\n    }\n  }\n\n  const releaseCapacityWaiters = () => {\n    if (!Number.isFinite(maxSize) || capacityWaiters.length === 0) {\n      return\n    }\n\n    while (capacityWaiters.length > 0 && queuedTasks.length < maxSize && state === \"open\") {\n      const waiter = capacityWaiters.shift()\n      if (waiter !== undefined) {\n        waiter.resolve()\n      }\n    }\n  }\n\n  const applyAbortToQueuedTasks = (reason: unknown) => {\n    if (queuedTasks.length === 0) {\n      return\n    }\n\n    const error = new QueueAbortedError({ reason })\n    const tasks = queuedTasks.splice(0)\n    for (const entry of tasks) {\n      entry.reject(error)\n    }\n  }\n\n  const waitForCapacity = (signal: AbortSignal | undefined): Promise<void> => {\n    if (!Number.isFinite(maxSize)) {\n      return Promise.resolve()\n    }\n\n    if (queuedTasks.length < maxSize) {\n      return Promise.resolve()\n    }\n\n    return new Promise<void>((resolve, reject) => {\n      const waiter: CapacityWaiter = {\n        resolve: () => {\n          if (signal !== undefined && onAbort !== undefined) {\n            signal.removeEventListener(\"abort\", onAbort)\n          }\n          resolve()\n        },\n        reject: (error) => {\n          if (signal !== undefined && onAbort !== undefined) {\n            signal.removeEventListener(\"abort\", onAbort)\n          }\n          reject(error)\n        },\n        signal,\n      }\n\n      const onAbort =\n        signal === undefined\n          ? undefined\n          : () => {\n              const index = capacityWaiters.indexOf(waiter)\n              if (index !== -1) {\n                capacityWaiters.splice(index, 1)\n              }\n              reject(queueTaskAbortedError(signal))\n            }\n\n      if (signal !== undefined && signal.aborted) {\n        reject(queueTaskAbortedError(signal))\n        return\n      }\n\n      if (signal !== undefined && onAbort !== undefined) {\n        signal.addEventListener(\"abort\", onAbort, { once: true })\n      }\n\n      capacityWaiters.push(waiter)\n    })\n  }\n\n  const closeIfNeeded = () => {\n    if ((state === \"draining\" || state === \"aborted\") && pending === 0 && queuedTasks.length === 0) {\n      resolveIdleIfNeeded()\n    }\n  }\n\n  const runTask = <A>(entry: TaskEntry<A>) => {\n    pending += 1\n\n    const taskSignal = composeSignals(queueAbortController.signal, entry.signal)\n\n    let taskResult: Promise<A>\n    if (taskSignal.aborted) {\n      taskResult = Promise.reject(queueTaskAbortedError(taskSignal))\n    } else {\n      try {\n        taskResult = Promise.resolve(entry.task({ signal: taskSignal }))\n      } catch (error) {\n        taskResult = Promise.reject(toError(error))\n      }\n    }\n\n    void taskResult\n      .then(\n        (value) => {\n          entry.resolve(value)\n          return undefined\n        },\n        (error: unknown) => {\n          entry.reject(toError(error))\n          return undefined\n        },\n      )\n      .finally(() => {\n        pending -= 1\n        releaseCapacityWaiters()\n        drainQueue()\n        resolveIdleIfNeeded()\n      })\n  }\n\n  const drainQueue = () => {\n    if (draining) {\n      return\n    }\n\n    draining = true\n    try {\n      if (state === \"aborted\") {\n        closeIfNeeded()\n        return\n      }\n\n      while (!paused && pending < concurrencyLimit && queuedTasks.length > 0) {\n        const entry = queuedTasks.shift()\n        if (entry === undefined) {\n          break\n        }\n        releaseCapacityWaiters()\n        runTask(entry)\n      }\n\n      closeIfNeeded()\n    } finally {\n      draining = false\n    }\n  }\n\n  const enqueueErrorForState = (): QueueClosedError => {\n    if (closeState !== undefined) {\n      return queueClosedError(closeState)\n    }\n\n    if (state === \"aborted\") {\n      return queueClosedError(\"aborted\")\n    }\n\n    if (state === \"draining\") {\n      return queueClosedError(\"draining\")\n    }\n\n    if (state === \"closed\") {\n      return queueClosedError(closeState ?? \"draining\")\n    }\n\n    return queueClosedError(\"draining\")\n  }\n\n  const queue: QueueType = {\n    _tag: \"Queue\",\n\n    get pending(): number {\n      return pending\n    },\n\n    get size(): number {\n      return queuedTasks.length\n    },\n\n    get isPaused(): boolean {\n      return paused\n    },\n\n    get isShutdown(): boolean {\n      return state !== \"open\"\n    },\n\n    enqueue<A>(task: QueueTask<A>, options?: { readonly signal?: AbortSignal }): Promise<A> {\n      const signal = options?.signal\n\n      if (signal !== undefined && signal.aborted) {\n        return Promise.reject(queueTaskAbortedError(signal))\n      }\n\n      if (state !== \"open\") {\n        return Promise.reject(enqueueErrorForState())\n      }\n\n      const enqueueTask = () =>\n        new Promise<A>((resolve, reject) => {\n          const entry: TaskEntry<A> = {\n            task,\n            resolve,\n            reject,\n            signal,\n          }\n\n          queuedTasks.push(entry)\n          drainQueue()\n        })\n\n      if (!Number.isFinite(maxSize) || queuedTasks.length < maxSize) {\n        return enqueueTask()\n      }\n\n      return waitForCapacity(signal).then(() => {\n        if (signal !== undefined && signal.aborted) {\n          throw queueTaskAbortedError(signal)\n        }\n\n        if (state !== \"open\") {\n          throw enqueueErrorForState()\n        }\n\n        return enqueueTask()\n      })\n    },\n\n    pause(): void {\n      paused = true\n    },\n\n    resume(): void {\n      if (!paused) {\n        return\n      }\n\n      paused = false\n      drainQueue()\n    },\n\n    awaitIdle(): Promise<void> {\n      if (pending === 0 && queuedTasks.length === 0) {\n        return Promise.resolve()\n      }\n\n      return new Promise<void>((resolve) => {\n        idleWaiters.add(resolve)\n      })\n    },\n\n    shutdown(options?: QueueShutdownOptions): Promise<void> {\n      const mode: QueueShutdownMode = options?.mode ?? \"drain\"\n\n      if (shutdownPromise !== undefined && (state === \"draining\" || state === \"aborted\" || state === \"closed\")) {\n        if (mode === \"abort\" && closeState !== \"aborted\") {\n          closeState = \"aborted\"\n          state = \"aborted\"\n          queueAbortController.abort(options?.reason)\n          applyAbortToQueuedTasks(options?.reason)\n          rejectCapacityWaiters(queueClosedError(\"aborted\"))\n          closeIfNeeded()\n        }\n\n        return shutdownPromise\n      }\n\n      shutdownPromise =\n        shutdownPromise ??\n        new Promise<void>((resolve) => {\n          shutdownResolver = resolve\n        })\n\n      if (mode === \"abort\") {\n        closeState = \"aborted\"\n        state = \"aborted\"\n        paused = false\n        queueAbortController.abort(options?.reason)\n        applyAbortToQueuedTasks(options?.reason)\n        rejectCapacityWaiters(queueClosedError(\"aborted\"))\n      } else {\n        closeState = \"draining\"\n        if (state === \"open\") {\n          state = \"draining\"\n        }\n        paused = false\n        rejectCapacityWaiters(queueClosedError(\"draining\"))\n      }\n\n      drainQueue()\n      resolveIdleIfNeeded()\n\n      return shutdownPromise\n    },\n  }\n\n  return queue\n}\n\n/**\n * Create a queue with default unbounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.make()\n * const pending = queue.pending\n * // => 0\n * ```\n */\nexport const make = (options?: QueueOptions): QueueType => createQueue(Number.POSITIVE_INFINITY, options)\n\n/**\n * Create a queue with bounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.bounded(2)\n * const size = queue.size\n * // => 0\n * ```\n */\nexport const bounded = (maxSize: number, options?: QueueBoundedOptions): QueueType => createQueue(maxSize, options)\n\n/**\n * Create a queue with explicit unbounded capacity.\n *\n * @example\n * ```ts\n * import { Queue } from \"@nicolastoulemont/std\"\n *\n * const queue = Queue.unbounded()\n * const paused = queue.isPaused\n * // => false\n * ```\n */\nexport const unbounded = (options?: QueueOptions): QueueType => createQueue(Number.POSITIVE_INFINITY, options)\n\n/* oxlint-enable max-classes-per-file */\n"],"mappings":"oNAoDa,EAAb,cAAsCA,EAAiB,mBAAmB,AAAoC,GAYjG,EAAb,cAAuCA,EAAiB,oBAAoB,AAAuB,GAYtF,EAAb,cAA2CA,EAAiB,wBAAwB,AAAuB,GAiB3G,MAAM,EAAsB,GAAiD,CAC3E,IAAM,EAAW,GAAe,YAChC,GAAI,IAAa,YACf,MAAO,KAGT,GAAI,CAAC,OAAO,UAAU,EAAS,EAAI,GAAY,EAC7C,MAAU,WAAW,0EAA0E,OAAO,EAAS,GAAG,CAGpH,OAAO,GAGH,EAAiB,GAAoB,CACrC,OAAY,MAIZ,CAAC,OAAO,UAAU,EAAQ,EAAI,EAAU,GAC1C,MAAU,WAAW,oDAAoD,OAAO,EAAQ,GAAG,EAIzF,EAAyB,GAC7B,IAAI,EAAsB,CAAE,OAAQ,EAAO,OAAQ,CAAC,CAEhD,EAAoB,GAAoD,IAAI,EAAiB,CAAE,QAAO,CAAC,CAEvG,EAAW,GACf,aAAkB,MAAQ,EAAa,MAAM,0CAA2C,CAAE,MAAO,EAAQ,CAAC,CAEtG,GAAkB,EAA0B,IAAqD,CACrG,GAAI,IAAe,IAAA,GACjB,OAAO,EAGT,GAAI,EAAW,QACb,OAAO,EAGT,GAAI,EAAY,QACd,OAAO,EAGT,IAAM,EAAY,IAAI,gBAEhB,MAAqB,CACzB,EAAU,MAAM,EAAY,OAAO,CACnC,EAAW,oBAAoB,QAAS,EAAY,EAGhD,MAAoB,CACxB,EAAU,MAAM,EAAW,OAAO,CAClC,EAAY,oBAAoB,QAAS,EAAa,EAexD,OAZA,EAAY,iBAAiB,QAAS,EAAc,CAAE,KAAM,GAAM,CAAC,CACnE,EAAW,iBAAiB,QAAS,EAAa,CAAE,KAAM,GAAM,CAAC,CAEjE,EAAU,OAAO,iBACf,YACM,CACJ,EAAY,oBAAoB,QAAS,EAAa,CACtD,EAAW,oBAAoB,QAAS,EAAY,EAEtD,CAAE,KAAM,GAAM,CACf,CAEM,EAAU,QAeN,EAAM,GACjB,OAAO,GAAU,YAAY,GAAkB,SAAU,GAAS,EAAM,OAAS,QAE7E,GAAe,EAAiB,IAAsC,CAC1E,EAAc,EAAQ,CAEtB,IAAM,EAAmB,EAAmB,GAAS,YAAY,CAC7D,EAAoB,OACpB,EACA,EAAS,GAAS,YAAc,GAChC,EAAU,EACV,EAAW,GAET,EAAoC,EAAE,CACtC,EAAoC,EAAE,CACtC,EAAc,IAAI,IAElB,EAAuB,IAAI,gBAE7B,EACA,EAEE,MAA4B,CAC5B,SAAY,GAAK,EAAY,OAAS,GAI1C,KAAK,IAAM,KAAW,EACpB,GAAS,CAEX,EAAY,OAAO,EAEf,IAAU,YAAc,IAAU,aACpC,EAAQ,SACR,KAAoB,CACpB,EAAmB,IAAA,MAIjB,EAAyB,GAAkB,CAC/C,GAAI,EAAgB,SAAW,EAC7B,OAGF,IAAM,EAAU,EAAgB,OAAO,EAAE,CACzC,IAAK,IAAM,KAAU,EACnB,EAAO,OAAO,EAAO,EAInB,MAA+B,CAC/B,MAAC,OAAO,SAAS,EAAQ,EAAI,EAAgB,SAAW,GAI5D,KAAO,EAAgB,OAAS,GAAK,EAAY,OAAS,GAAW,IAAU,QAAQ,CACrF,IAAM,EAAS,EAAgB,OAAO,CAClC,IAAW,IAAA,IACb,EAAO,SAAS,GAKhB,EAA2B,GAAoB,CACnD,GAAI,EAAY,SAAW,EACzB,OAGF,IAAM,EAAQ,IAAI,EAAkB,CAAE,SAAQ,CAAC,CACzC,EAAQ,EAAY,OAAO,EAAE,CACnC,IAAK,IAAM,KAAS,EAClB,EAAM,OAAO,EAAM,EAIjB,EAAmB,GACnB,CAAC,OAAO,SAAS,EAAQ,EAIzB,EAAY,OAAS,EAChB,QAAQ,SAAS,CAGnB,IAAI,SAAe,EAAS,IAAW,CAC5C,IAAM,EAAyB,CAC7B,YAAe,CACT,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,oBAAoB,QAAS,EAAQ,CAE9C,GAAS,EAEX,OAAS,GAAU,CACb,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,oBAAoB,QAAS,EAAQ,CAE9C,EAAO,EAAM,EAEf,SACD,CAEK,EACJ,IAAW,IAAA,GACP,IAAA,OACM,CACJ,IAAM,EAAQ,EAAgB,QAAQ,EAAO,CACzC,IAAU,IACZ,EAAgB,OAAO,EAAO,EAAE,CAElC,EAAO,EAAsB,EAAO,CAAC,EAG7C,GAAI,IAAW,IAAA,IAAa,EAAO,QAAS,CAC1C,EAAO,EAAsB,EAAO,CAAC,CACrC,OAGE,IAAW,IAAA,IAAa,IAAY,IAAA,IACtC,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,GAAM,CAAC,CAG3D,EAAgB,KAAK,EAAO,EAC5B,CAGE,MAAsB,EACrB,IAAU,YAAc,IAAU,YAAc,IAAY,GAAK,EAAY,SAAW,GAC3F,GAAqB,EAInB,EAAc,GAAwB,CAC1C,GAAW,EAEX,IAAM,EAAa,EAAe,EAAqB,OAAQ,EAAM,OAAO,CAExE,EACJ,GAAI,EAAW,QACb,EAAa,QAAQ,OAAO,EAAsB,EAAW,CAAC,MAE9D,GAAI,CACF,EAAa,QAAQ,QAAQ,EAAM,KAAK,CAAE,OAAQ,EAAY,CAAC,CAAC,OACzD,EAAO,CACd,EAAa,QAAQ,OAAO,EAAQ,EAAM,CAAC,CAI1C,EACF,KACE,GAAU,CACT,EAAM,QAAQ,EAAM,EAGrB,GAAmB,CAClB,EAAM,OAAO,EAAQ,EAAM,CAAC,EAG/B,CACA,YAAc,CACb,IACA,GAAwB,CACxB,GAAY,CACZ,GAAqB,EACrB,EAGA,MAAmB,CACnB,MAIJ,GAAW,GACX,GAAI,CACF,GAAI,IAAU,UAAW,CACvB,GAAe,CACf,OAGF,KAAO,CAAC,GAAU,EAAU,GAAoB,EAAY,OAAS,GAAG,CACtE,IAAM,EAAQ,EAAY,OAAO,CACjC,GAAI,IAAU,IAAA,GACZ,MAEF,GAAwB,CACxB,EAAQ,EAAM,CAGhB,GAAe,QACP,CACR,EAAW,MAIT,MAMK,EALL,IAAe,IAAA,GAIf,IAAU,UACY,UAGtB,IAAU,WACY,WAGtB,IAAU,SACY,GAAc,WAGhB,WAfE,EAAW,CAkJvC,MAhIyB,CACvB,KAAM,QAEN,IAAI,SAAkB,CACpB,OAAO,GAGT,IAAI,MAAe,CACjB,OAAO,EAAY,QAGrB,IAAI,UAAoB,CACtB,OAAO,GAGT,IAAI,YAAsB,CACxB,OAAO,IAAU,QAGnB,QAAW,EAAoB,EAAyD,CACtF,IAAM,EAASC,GAAS,OAExB,GAAI,IAAW,IAAA,IAAa,EAAO,QACjC,OAAO,QAAQ,OAAO,EAAsB,EAAO,CAAC,CAGtD,GAAI,IAAU,OACZ,OAAO,QAAQ,OAAO,GAAsB,CAAC,CAG/C,IAAM,MACJ,IAAI,SAAY,EAAS,IAAW,CAClC,IAAM,EAAsB,CAC1B,OACA,UACA,SACA,SACD,CAED,EAAY,KAAK,EAAM,CACvB,GAAY,EACZ,CAMJ,MAJI,CAAC,OAAO,SAAS,EAAQ,EAAI,EAAY,OAAS,EAC7C,GAAa,CAGf,EAAgB,EAAO,CAAC,SAAW,CACxC,GAAI,IAAW,IAAA,IAAa,EAAO,QACjC,MAAM,EAAsB,EAAO,CAGrC,GAAI,IAAU,OACZ,MAAM,GAAsB,CAG9B,OAAO,GAAa,EACpB,EAGJ,OAAc,CACZ,EAAS,IAGX,QAAe,CACR,IAIL,EAAS,GACT,GAAY,GAGd,WAA2B,CAKzB,OAJI,IAAY,GAAK,EAAY,SAAW,EACnC,QAAQ,SAAS,CAGnB,IAAI,QAAe,GAAY,CACpC,EAAY,IAAI,EAAQ,EACxB,EAGJ,SAAS,EAA+C,CACtD,IAAM,EAA0BA,GAAS,MAAQ,QAwCjD,OAtCI,IAAoB,IAAA,KAAc,IAAU,YAAc,IAAU,WAAa,IAAU,WACzF,IAAS,SAAW,IAAe,YACrC,EAAa,UACb,EAAQ,UACR,EAAqB,MAAMA,GAAS,OAAO,CAC3C,EAAwBA,GAAS,OAAO,CACxC,EAAsB,EAAiB,UAAU,CAAC,CAClD,GAAe,EAGV,IAGT,IAEE,IAAI,QAAe,GAAY,CAC7B,EAAmB,GACnB,CAEA,IAAS,SACX,EAAa,UACb,EAAQ,UACR,EAAS,GACT,EAAqB,MAAMA,GAAS,OAAO,CAC3C,EAAwBA,GAAS,OAAO,CACxC,EAAsB,EAAiB,UAAU,CAAC,GAElD,EAAa,WACT,IAAU,SACZ,EAAQ,YAEV,EAAS,GACT,EAAsB,EAAiB,WAAW,CAAC,EAGrD,GAAY,CACZ,GAAqB,CAEd,IAEV,EAiBU,EAAQ,GAAsC,EAAY,IAA0B,EAAQ,CAc5F,GAAW,EAAiB,IAA6C,EAAY,EAAS,EAAQ,CActG,EAAa,GAAsC,EAAY,IAA0B,EAAQ"}

package/dist/{queue.types-B-l5XYbU.d.mts → queue.types-Bj63N2ab.d.mts}

@@ -33,4 +33,4 @@ type Queue = {
 };
 //#endregion
 export { QueueOptions as i, Queue as n, QueueBoundedOptions as r, Concurrency as t };
-//# sourceMappingURL=queue.types-B-l5XYbU.d.mts.map
+//# sourceMappingURL=queue.types-Bj63N2ab.d.mts.map

package/dist/{queue.types-B-l5XYbU.d.mts.map → queue.types-Bj63N2ab.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"queue.types-B-l5XYbU.d.mts","names":[],"sources":["../src/queue/queue.types.ts"],"sourcesContent":[],"mappings":";KAAY,WAAA;AAAZ,KAEK,gBAAA,GAFkB;EAElB,SAAA,MAAA,EACc,WADE;AAIrB,CAAA;AAAiC,KAArB,SAAqB,CAAA,CAAA,CAAA,GAAA,CAAA,GAAA,EAAA,gBAAA,EAAA,GAAqB,CAArB,GAAyB,OAAzB,CAAiC,CAAjC,CAAA;AAAqB,KAE1C,iBAAA,GAF0C,OAAA,GAAA,OAAA;AAAY,KAItD,YAAA,GAJsD;EAAR,SAAA,WAAA,CAAA,EAKjC,WALiC;EAAO,SAAA,SAAA,CAAA,EAAA,OAAA;AAEjE,CAAA;AAEY,KAKA,mBAAA,GAJa;EAIb,SAAA,WAAA,CAAA,EACa,WADM;EAKnB,SAAA,SAAA,CAAA,EAAA,OAAoB;AAKhC,CAAA;AAM6B,KAXjB,oBAAA,GAWiB;EAAV,SAAA,IAAA,CAAA,EAVD,iBAUC;EAA4C,SAAA,MAAA,CAAA,EAAA,OAAA;CAAwB;AAAR,KANnE,KAAA,GAMmE;EAGhE,SAAA,IAAA,EAAA,OAAA;EACM,SAAA,OAAA,EAAA,MAAA;EAAuB,SAAA,IAAA,EAAA,MAAA;EAAO,SAAA,QAAA,EAAA,OAAA;;mBAJhC,UAAU;sBAAkC;MAAgB,QAAQ;;;eAGxE;qBACM,uBAAuB"}
+{"version":3,"file":"queue.types-Bj63N2ab.d.mts","names":[],"sources":["../src/queue/queue.types.ts"],"sourcesContent":[],"mappings":";KAAY,WAAA;AAAZ,KAEK,gBAAA,GAFkB;EAElB,SAAA,MAAA,EACc,WADE;AAIrB,CAAA;AAAiC,KAArB,SAAqB,CAAA,CAAA,CAAA,GAAA,CAAA,GAAA,EAAA,gBAAA,EAAA,GAAqB,CAArB,GAAyB,OAAzB,CAAiC,CAAjC,CAAA;AAAqB,KAE1C,iBAAA,GAF0C,OAAA,GAAA,OAAA;AAAY,KAItD,YAAA,GAJsD;EAAR,SAAA,WAAA,CAAA,EAKjC,WALiC;EAAO,SAAA,SAAA,CAAA,EAAA,OAAA;AAEjE,CAAA;AAEY,KAKA,mBAAA,GAJa;EAIb,SAAA,WAAA,CAAA,EACa,WADM;EAKnB,SAAA,SAAA,CAAA,EAAA,OAAoB;AAKhC,CAAA;AAM6B,KAXjB,oBAAA,GAWiB;EAAV,SAAA,IAAA,CAAA,EAVD,iBAUC;EAA4C,SAAA,MAAA,CAAA,EAAA,OAAA;CAAwB;AAAR,KANnE,KAAA,GAMmE;EAGhE,SAAA,IAAA,EAAA,OAAA;EACM,SAAA,OAAA,EAAA,MAAA;EAAuB,SAAA,IAAA,EAAA,MAAA;EAAO,SAAA,QAAA,EAAA,OAAA;;mBAJhC,UAAU;sBAAkC;MAAgB,QAAQ;;;eAGxE;qBACM,uBAAuB"}

package/dist/result/index.d.mts

@@ -1,2 +1,2 @@
-import { n as result_d_exports } from "../index-CIvNgjsx.mjs";
+import { n as result_d_exports } from "../index-hrn4s4Vn.mjs";
 export { result_d_exports as Result };

package/dist/result/index.mjs

@@ -1 +1 @@
-import{a as e}from"../result-D3VY0qBG.mjs";export{e as Result};
+import{a as e}from"../result-C74pRN2x.mjs";export{e as Result};

package/dist/{result-D3VY0qBG.mjs → result-C74pRN2x.mjs}

@@ -1,2 +1,2 @@
-import{t as e}from"./chunk-oQKkju2G.mjs";import{t}from"./fx.types-DyQVgTS8.mjs";import{t as n}from"./dual-fN6OUwN_.mjs";import{n as r}from"./flow-CNyLsPGb.mjs";import{t as i}from"./pipeable-Dp1_23zH.mjs";var a=e({all:()=>g,err:()=>s,filter:()=>h,flatMap:()=>f,fromTry:()=>b,isErr:()=>l,isOk:()=>c,map:()=>u,mapErr:()=>d,match:()=>y,ok:()=>o,orElse:()=>m,tap:()=>p,try:()=>x,unwrapOr:()=>_,unwrapOrElse:()=>v});const o=e=>({_tag:`Ok`,value:e,pipe:i,[t]:{_A:()=>e,_E:()=>void 0,_R:()=>void 0},*[Symbol.iterator](){return e}}),s=e=>{let n={_tag:`Err`,error:e,pipe:i,[t]:{_A:()=>void 0,_E:()=>e,_R:()=>void 0},*[Symbol.iterator](){throw yield n,Error(`Unreachable: Fx.gen should short-circuit on error`)}};return n},c=e=>e._tag===`Ok`,l=e=>e._tag===`Err`,u=n(2,(e,t)=>{if(e._tag===`Err`)return e;let n=t(e.value);return r(n)?Promise.resolve(n).then(o):o(n)}),d=n(2,(e,t)=>{if(e._tag===`Ok`)return e;let n=t(e.error);return r(n)?Promise.resolve(n).then(s):s(n)}),f=n(2,(e,t)=>e._tag===`Ok`?t(e.value):e),p=n(2,(e,t)=>{if(e._tag===`Err`)return e;let n=t(e.value);return r(n)?Promise.resolve(n).then(()=>e):e}),m=n(2,(e,t)=>e._tag===`Ok`?e:t(e.error)),h=n(3,(e,t,n)=>e._tag===`Err`||t(e.value)?e:s(n(e.value))),g=e=>{if(Array.isArray(e)){let t=[];for(let n of e){if(n._tag===`Err`)return n;t.push(n.value)}return o(t)}let t={};for(let[n,r]of Object.entries(e)){let e=r;if(e._tag===`Err`)return r;t[n]=e.value}return o(t)},_=n(2,(e,t)=>e._tag===`Ok`?e.value:t),v=n(2,(e,t)=>e._tag===`Ok`?e.value:t(e.error)),y=n(2,(e,t)=>e._tag===`Ok`?t.Ok(e.value):t.Err(e.error)),b=e=>{let t=typeof e==`function`?e:e.try,n=typeof e==`function`?e=>e instanceof Error?e:Error(String(e)):e.catch,i=typeof e==`function`?void 0:e.finally,a=!1;try{let e=t();if(r(e)){a=!0;let t=Promise.resolve(e).then(o).catch(e=>s(n(e)));return i?t.finally(i):t}return o(e)}catch(e){return s(n(e))}finally{i&&!a&&i()}},x=b;export{a,o as i,b as n,l as r,s as t};
-//# sourceMappingURL=result-D3VY0qBG.mjs.map
+import{t as e}from"./chunk-6rpU2rUb.mjs";import{t}from"./fx.types-Bg-Mmdm5.mjs";import{t as n}from"./dual-CZhzZslG.mjs";import{n as r}from"./flow-D8_tllWl.mjs";import{t as i}from"./pipeable-COGyGMUV.mjs";var a=e({all:()=>g,err:()=>s,filter:()=>h,flatMap:()=>f,fromTry:()=>b,isErr:()=>l,isOk:()=>c,map:()=>u,mapErr:()=>d,match:()=>y,ok:()=>o,orElse:()=>m,tap:()=>p,try:()=>x,unwrapOr:()=>_,unwrapOrElse:()=>v});const o=e=>({_tag:`Ok`,value:e,pipe:i,[t]:{_A:()=>e,_E:()=>void 0,_R:()=>void 0},*[Symbol.iterator](){return e}}),s=e=>{let n={_tag:`Err`,error:e,pipe:i,[t]:{_A:()=>void 0,_E:()=>e,_R:()=>void 0},*[Symbol.iterator](){throw yield n,Error(`Unreachable: Fx.gen should short-circuit on error`)}};return n},c=e=>e._tag===`Ok`,l=e=>e._tag===`Err`,u=n(2,(e,t)=>{if(e._tag===`Err`)return e;let n=t(e.value);return r(n)?Promise.resolve(n).then(o):o(n)}),d=n(2,(e,t)=>{if(e._tag===`Ok`)return e;let n=t(e.error);return r(n)?Promise.resolve(n).then(s):s(n)}),f=n(2,(e,t)=>e._tag===`Ok`?t(e.value):e),p=n(2,(e,t)=>{if(e._tag===`Err`)return e;let n=t(e.value);return r(n)?Promise.resolve(n).then(()=>e):e}),m=n(2,(e,t)=>e._tag===`Ok`?e:t(e.error)),h=n(3,(e,t,n)=>e._tag===`Err`||t(e.value)?e:s(n(e.value))),g=e=>{if(Array.isArray(e)){let t=[];for(let n of e){if(n._tag===`Err`)return n;t.push(n.value)}return o(t)}let t={};for(let[n,r]of Object.entries(e)){let e=r;if(e._tag===`Err`)return r;t[n]=e.value}return o(t)},_=n(2,(e,t)=>e._tag===`Ok`?e.value:t),v=n(2,(e,t)=>e._tag===`Ok`?e.value:t(e.error)),y=n(2,(e,t)=>e._tag===`Ok`?t.Ok(e.value):t.Err(e.error)),b=e=>{let t=typeof e==`function`?e:e.try,n=typeof e==`function`?e=>e instanceof Error?e:Error(String(e)):e.catch,i=typeof e==`function`?void 0:e.finally,a=!1;try{let e=t();if(r(e)){a=!0;let t=Promise.resolve(e).then(o).catch(e=>s(n(e)));return i?t.finally(i):t}return o(e)}catch(e){return s(n(e))}finally{i&&!a&&i()}},x=b;export{a,o as i,b as n,l as r,s as t};
+//# sourceMappingURL=result-C74pRN2x.mjs.map

package/dist/{result-D3VY0qBG.mjs.map → result-C74pRN2x.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"result-D3VY0qBG.mjs","names":["values"],"sources":["../src/result/result.ts"],"sourcesContent":["/**\n * Synchronous success/error primitives with typed channels (`Ok` / `Err`).\n *\n * **Mental model**\n * - `Result<A, E>` makes success and failure explicit.\n * - Use `flatMap` to sequence fallible operations without throwing.\n *\n * **Common tasks**\n * - Construct with `Result.ok`, `Result.err`, `Result.fromTry`.\n * - Transform with `Result.map`, `Result.mapErr`, `Result.flatMap`.\n * - Handle with `Result.match` or `Result.unwrapOr`.\n *\n * **Gotchas**\n * - `Result.err` short-circuits in `Fx.gen`.\n * - Keep domain errors in the `E` channel instead of throwing.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const parsed = Result.fromTry(() => Number.parseInt(\"42\", 10))\n * const doubled = Result.map(parsed, (value) => value * 2)\n * ```\n *\n * @module\n */\nimport { FxTypeId } from \"../fx/fx.types\"\nimport { dual } from \"../shared/dual\"\nimport { isPromise } from \"../shared/is-promise\"\nimport { pipeable } from \"../shared/pipeable\"\nimport type {\n  FromTryOptions,\n  Result as ResultType,\n  ResultAll,\n  ResultFlatMap,\n  ResultFromTry,\n  ResultMap,\n  ResultMapErr,\n  ResultMatch,\n  ResultTap,\n  ResultOrElse,\n  ResultFilter,\n  ResultUnwrapOr,\n  ResultUnwrapOrElse,\n} from \"./result.types\"\n\n/**\n * Re-exported `Result` type.\n *\n * @example\n * ```ts\n * import type { Result } from \"@nicolastoulemont/std\"\n *\n * type Example = Result.Result<unknown, unknown>\n * ```\n */\nexport type Result<T, E> = ResultType<T, E>\n\n/* oxlint-disable no-unsafe-type-assertion -- Result constructors encode Fx phantom channels and iterator contracts via type-level markers. */\n\n// ============================================================================\n// Constructors\n// ============================================================================\n\n/**\n * Create a successful Result.\n *\n * @param value - The success value\n * @returns A Result with _tag: \"Ok\"\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const value = Result.ok(42)\n * // => { _tag: \"Ok\", value: 42 }\n * ```\n */\nexport const ok = <T>(value: T): ResultType<T, never> => {\n  const result: ResultType<T, never> = {\n    _tag: \"Ok\",\n    value,\n    pipe: pipeable,\n    [FxTypeId]: {\n      _A: () => value,\n      _E: () => undefined as never,\n      _R: () => undefined as never,\n    },\n    // oxlint-disable-next-line require-yield\n    *[Symbol.iterator](): Generator<ResultType<T, never>, T, unknown> {\n      return value\n    },\n  }\n  return result\n}\n\n/**\n * Create an error Result.\n *\n * @param error - The error value\n * @returns A Result with _tag: \"Err\"\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const value = Result.err(\"boom\")\n * // => { _tag: \"Err\", error: \"boom\" }\n * ```\n */\nexport const err = <E>(error: E): ResultType<never, E> => {\n  const result: ResultType<never, E> = {\n    _tag: \"Err\",\n    error,\n    pipe: pipeable,\n    [FxTypeId]: {\n      _A: () => undefined as never,\n      _E: () => error,\n      _R: () => undefined as never,\n    },\n    *[Symbol.iterator](): Generator<ResultType<never, E>, never, unknown> {\n      yield result\n      throw new Error(\"Unreachable: Fx.gen should short-circuit on error\")\n    },\n  }\n  return result\n}\n\n// ============================================================================\n// Type Guards\n// ============================================================================\n\n/**\n * Check if a Result is successful.\n *\n * @param result - The Result to check\n * @returns true if the Result is Ok\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const isOk = Result.isOk(Result.ok(1))\n * // => true\n * ```\n */\nexport const isOk = <T, E>(result: ResultType<T, E>): result is Extract<ResultType<T, E>, { _tag: \"Ok\" }> =>\n  result._tag === \"Ok\"\n\n/**\n * Check if a Result is an error.\n *\n * @param result - The Result to check\n * @returns true if the Result is an error\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const isErr = Result.isErr(Result.err(\"boom\"))\n * // => true\n * ```\n */\nexport const isErr = <T, E>(result: ResultType<T, E>): result is Extract<ResultType<T, E>, { _tag: \"Err\" }> =>\n  result._tag === \"Err\"\n\n// ============================================================================\n// Transformations (curried for pipe)\n// ============================================================================\n\n/**\n * Transform the success value of a Result.\n * If the Result is an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `map(result, fn)`\n * - Data-last: `pipe(result, map(fn))`\n *\n * Supports both sync and async callbacks:\n * - Sync fn: returns U\n * - Async fn: returns Promise<U>\n *\n * @param fn - Function that transforms the success value\n * @returns The mapped Result in data-first form, or a function that maps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2)\n * const dataFirst = Result.map(input, (n) => n + 1)\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.map((n: number) => n + 1)(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const map: ResultMap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) => {\n  if (result._tag === \"Err\") return result as any\n  const mapped = fn(result.value)\n  if (isPromise(mapped)) {\n    return Promise.resolve(mapped).then(ok) as any\n  }\n  return ok(mapped) as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Transform the error value of a Result.\n * If the Result is successful, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `mapErr(result, fn)`\n * - Data-last: `pipe(result, mapErr(fn))`\n *\n * Supports both sync and async callbacks:\n * - Sync fn: returns F\n * - Async fn: returns Promise<F>\n *\n * @param fn - Function that transforms the error value\n * @returns The mapped Result in data-first form, or a function that maps Result errors in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\")\n * const dataFirst = Result.mapErr(input, (msg) => msg.toUpperCase())\n * // => { _tag: \"Err\", error: \"MISSING\" }\n *\n * const dataLast = Result.mapErr((msg: string) => msg.toUpperCase())(input)\n * // => { _tag: \"Err\", error: \"MISSING\" }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const mapErr: ResultMapErr = dual(2, (result: ResultType<unknown, unknown>, fn: (error: unknown) => unknown) => {\n  if (result._tag === \"Ok\") return result as any\n  const mapped = fn(result.error)\n  if (isPromise(mapped)) {\n    return Promise.resolve(mapped).then(err) as any\n  }\n  return err(mapped) as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Chain operations that return Results.\n * If the Result is an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `flatMap(result, fn)`\n * - Data-last: `pipe(result, flatMap(fn))`\n *\n * Supports both sync and async functions:\n * - Sync fn: returns Result<U, E | E2>\n * - Async fn: returns Promise<Result<U, E | E2>>\n *\n * @param fn - Function that takes a value and returns a Result (or Promise<Result>)\n * @returns The resulting Result in data-first form, or a function that flatMaps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2)\n * const dataFirst = Result.flatMap(input, (n) => Result.ok(n + 1))\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.flatMap((n: number) => Result.ok(n + 1))(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\n// oxlint-disable-next-line no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types\nexport const flatMap: ResultFlatMap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) =>\n  result._tag === \"Ok\" ? fn(result.value) : result,\n)\n\n/**\n * Perform a side effect on the success value without modifying the Result.\n * Useful for debugging, logging, or other side effects in a pipeline.\n * If the Result is an error, the function is not called.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `tap(result, fn)`\n * - Data-last: `pipe(result, tap(fn))`\n *\n * Supports both sync and async side effects:\n * - Sync fn: returns any value (ignored)\n * - Async fn: returns Promise<unknown>\n *\n * @param fn - Function to call with the success value (return value is ignored)\n * @returns The original Result in data-first form, or a function that taps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * let seen = 0\n * const input = Result.ok(2)\n * const dataFirst = Result.tap(input, (n) => {\n *   seen = n\n * })\n * // => { _tag: \"Ok\", value: 2 }\n *\n * const dataLast = Result.tap((n: number) => {\n *   seen = n\n * })(input)\n * // => { _tag: \"Ok\", value: 2 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const tap: ResultTap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) => {\n  if (result._tag === \"Err\") return result as any\n  const sideEffect = fn(result.value)\n  if (isPromise(sideEffect)) {\n    return Promise.resolve(sideEffect).then(() => result) as any\n  }\n  return result as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Recover from an error by providing an alternative Result.\n * If the Result is successful, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `orElse(result, fn)`\n * - Data-last: `pipe(result, orElse(fn))`\n *\n * Supports both sync and async fallback functions:\n * - Sync fn: returns Result<T | U, E2>\n * - Async fn: returns Promise<Result<T | U, E2>>\n *\n * @param fn - Function that takes the error and returns an alternative Result\n * @returns The original or fallback Result in data-first form, or a function that recovers from an error in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.orElse(input, () => Result.ok(0))\n * // => { _tag: \"Ok\", value: 0 }\n *\n * const dataLast = Result.orElse(() => Result.ok(0))(input)\n * // => { _tag: \"Ok\", value: 0 }\n * ```\n */\n// oxlint-disable-next-line no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types\nexport const orElse: ResultOrElse = dual(2, (result: ResultType<unknown, unknown>, fn: (error: unknown) => unknown) =>\n  result._tag === \"Ok\" ? result : fn(result.error),\n)\n\n/**\n * Filter a successful Result based on a predicate.\n * If the predicate returns false, converts the success to an error.\n * If the Result is already an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `filter(result, predicate, onFail)`\n * - Data-last: `pipe(result, filter(predicate, onFail))`\n *\n * @param predicate - Function that returns true to keep the value\n * @param onFail - Function that creates the error when predicate fails\n * @returns The filtered Result in data-first form, or a function that filters a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(3)\n * const dataFirst = Result.filter(input, (n) => n > 0, (n) => `${n} must be positive`)\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.filter((n: number) => n > 0, (n) => `${n} must be positive`)(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\nexport const filter: ResultFilter = dual(\n  3,\n  (\n    result: ResultType<unknown, unknown>,\n    predicate: (value: unknown) => boolean,\n    onFail: (value: unknown) => unknown,\n  ) => {\n    if (result._tag === \"Err\") return result\n    return predicate(result.value) ? result : err(onFail(result.value))\n  },\n)\n\n// ============================================================================\n// Combinators\n// ============================================================================\n\n/**\n * Combine multiple Results into a single Result.\n * Supports both array and object inputs.\n *\n * - If all Results are ok, returns ok with all values\n * - If any Result is an error, returns the first error (short-circuits)\n *\n * For arrays of 1-6 elements, tuple types are inferred automatically.\n * For longer arrays, use `as const` to preserve tuple structure.\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const combined = Result.all([Result.ok(1), Result.ok(2)] as const)\n * // => { _tag: \"Ok\", value: [1, 2] }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-member-access, strict-boolean-expressions, no-unsafe-type-assertion, no-unsafe-argument -- Required for handling union types in overloaded function */\nexport const all: ResultAll = (results: any): any => {\n  if (Array.isArray(results)) {\n    const values: unknown[] = []\n    for (const result of results) {\n      if (result._tag === \"Err\") return result\n      values.push(result.value)\n    }\n    return ok(values)\n  }\n\n  const values: Record<string, unknown> = {}\n  for (const [key, result] of Object.entries(results)) {\n    const r = result as ResultType<unknown, unknown>\n    if (r._tag === \"Err\") return result\n    values[key] = r.value\n  }\n  return ok(values)\n}\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-member-access, strict-boolean-expressions, no-unsafe-type-assertion, no-unsafe-argument */\n\n// ============================================================================\n// Extraction\n// ============================================================================\n\n/**\n * Get the success value or a default value.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `unwrapOr(result, defaultValue)`\n * - Data-last: `pipe(result, unwrapOr(defaultValue))`\n *\n * Uses NoInfer to prevent type inference from the default value.\n *\n * @param defaultValue - Value to return if the Result is an error\n * @returns The unwrapped value in data-first form, or a function that unwraps a Result with a default in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.unwrapOr(input, 0)\n * // => 0\n *\n * const dataLast = Result.unwrapOr(0)(input)\n * // => 0\n * ```\n */\nexport const unwrapOr: ResultUnwrapOr = dual(\n  2,\n  <T, E>(result: ResultType<T, E>, defaultValue: NoInfer<T>): T => (result._tag === \"Ok\" ? result.value : defaultValue),\n)\n\n/**\n * Get the success value or compute a value from the error.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `unwrapOrElse(result, fn)`\n * - Data-last: `pipe(result, unwrapOrElse(fn))`\n *\n * @param fn - Function to compute a value from the error\n * @returns The unwrapped value in data-first form, or a function that unwraps a Result lazily in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.unwrapOrElse(input, () => 0)\n * // => 0\n *\n * const dataLast = Result.unwrapOrElse(() => 0)(input)\n * // => 0\n * ```\n */\nexport const unwrapOrElse: ResultUnwrapOrElse = dual(\n  2,\n  <T, E>(result: ResultType<T, E>, fn: (error: E) => T): T => (result._tag === \"Ok\" ? result.value : fn(result.error)),\n)\n\n/**\n * Pattern match on a Result, handling both success and error cases.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `match(result, { Ok: ..., Err: ... })`\n * - Data-last: `pipe(result, match({ Ok: ..., Err: ... }))`\n *\n * @param handlers - Object with `Ok` and `Err` handlers\n * @returns The handler result in data-first form, or a function that matches a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2) as Result.Result<number, string>\n * const dataFirst = Result.match(input, {\n *   Ok: (value) => `ok:${value}` ,\n *   Err: (error) => `err:${error}` ,\n * })\n * // => \"ok:2\"\n *\n * const dataLast = Result.match({\n *   Ok: (value: number) => `ok:${value}` ,\n *   Err: (error: string) => `err:${error}` ,\n * })(input)\n * // => \"ok:2\"\n * ```\n */\nexport const match: ResultMatch = dual(\n  2,\n  <T, E, U>(result: ResultType<T, E>, handlers: { Ok: (value: T) => U; Err: (error: E) => U }): U =>\n    result._tag === \"Ok\" ? handlers.Ok(result.value) : handlers.Err(result.error),\n)\n\n// ============================================================================\n// Error Boundary\n// ============================================================================\n\n/**\n * Wrap a function that might throw into a Result.\n * Supports both sync and async functions with automatic type inference.\n *\n * Can be called with a simple callback or an object with `try` and `catch`:\n * - Simple: `fromTry(() => riskyOp())` — errors are wrapped as `Error`\n * - Object: `fromTry({ try: () => riskyOp(), catch: (e) => mapError(e) })` — custom error mapping\n *\n * @param fnOrOptions - Function that might throw, or object with `try` and `catch`\n * @returns A Result with the return value or the caught/mapped error\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const parsed = Result.fromTry(() => Number.parseInt(\"42\", 10))\n * // => { _tag: \"Ok\", value: 42 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-type-assertion -- Required for overloaded return type */\nexport const fromTry: ResultFromTry = (fnOrOptions: (() => unknown) | FromTryOptions<unknown, unknown>): any => {\n  const fn = typeof fnOrOptions === \"function\" ? fnOrOptions : fnOrOptions.try\n  const catchFn =\n    typeof fnOrOptions === \"function\"\n      ? (e: unknown) => (e instanceof Error ? e : new Error(String(e)))\n      : fnOrOptions.catch\n  const finallyFn = typeof fnOrOptions === \"function\" ? undefined : fnOrOptions.finally\n\n  let isAsync = false\n  try {\n    const result = fn()\n    if (isPromise(result)) {\n      isAsync = true\n      const promise = Promise.resolve(result)\n        .then(ok)\n        .catch((e: unknown) => err(catchFn(e)))\n      return finallyFn ? promise.finally(finallyFn) : promise\n    }\n    return ok(result)\n  } catch (e) {\n    return err(catchFn(e))\n  } finally {\n    if (finallyFn && !isAsync) {\n      finallyFn()\n    }\n  }\n}\n/* oxlint-enable no-explicit-any, no-unsafe-type-assertion */\n\nconst try_ = fromTry\n\nexport {\n  /**\n   * Alias of {@link fromTry}.\n   *\n   * @example\n   * ```ts\n   * import { Result } from \"@nicolastoulemont/std\"\n   *\n   * const parsed = Result.try(() => JSON.parse(\"{\\\"ok\\\":true}\"))\n   * ```\n   *\n   */\n  try_ as try,\n}\n\n/* oxlint-enable no-unsafe-type-assertion */\n"],"mappings":"0ZAgFA,MAAa,EAAS,IACiB,CACnC,KAAM,KACN,QACA,KAAM,GACL,GAAW,CACV,OAAU,EACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CAED,EAAE,OAAO,WAAyD,CAChE,OAAO,GAEV,EAkBU,EAAU,GAAmC,CACxD,IAAM,EAA+B,CACnC,KAAM,MACN,QACA,KAAM,GACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,EACV,OAAU,IAAA,GACX,CACD,EAAE,OAAO,WAA6D,CAEpE,MADA,MAAM,EACI,MAAM,oDAAoD,EAEvE,CACD,OAAO,GAqBI,EAAc,GACzB,EAAO,OAAS,KAgBL,EAAe,GAC1B,EAAO,OAAS,MAkCL,EAAiB,EAAK,GAAI,EAAsC,IAAoC,CAC/G,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,IAAM,EAAS,EAAG,EAAO,MAAM,CAI/B,OAHI,EAAU,EAAO,CACZ,QAAQ,QAAQ,EAAO,CAAC,KAAK,EAAG,CAElC,EAAG,EAAO,EACjB,CA+BW,EAAuB,EAAK,GAAI,EAAsC,IAAoC,CACrH,GAAI,EAAO,OAAS,KAAM,OAAO,EACjC,IAAM,EAAS,EAAG,EAAO,MAAM,CAI/B,OAHI,EAAU,EAAO,CACZ,QAAQ,QAAQ,EAAO,CAAC,KAAK,EAAI,CAEnC,EAAI,EAAO,EAClB,CA+BW,EAAyB,EAAK,GAAI,EAAsC,IACnF,EAAO,OAAS,KAAO,EAAG,EAAO,MAAM,CAAG,EAC3C,CAoCY,EAAiB,EAAK,GAAI,EAAsC,IAAoC,CAC/G,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,IAAM,EAAa,EAAG,EAAO,MAAM,CAInC,OAHI,EAAU,EAAW,CAChB,QAAQ,QAAQ,EAAW,CAAC,SAAW,EAAO,CAEhD,GACP,CA+BW,EAAuB,EAAK,GAAI,EAAsC,IACjF,EAAO,OAAS,KAAO,EAAS,EAAG,EAAO,MAAM,CACjD,CA2BY,EAAuB,EAClC,GAEE,EACA,EACA,IAEI,EAAO,OAAS,OACb,EAAU,EAAO,MAAM,CADI,EACQ,EAAI,EAAO,EAAO,MAAM,CAAC,CAEtE,CAyBY,EAAkB,GAAsB,CACnD,GAAI,MAAM,QAAQ,EAAQ,CAAE,CAC1B,IAAMA,EAAoB,EAAE,CAC5B,IAAK,IAAM,KAAU,EAAS,CAC5B,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,EAAO,KAAK,EAAO,MAAM,CAE3B,OAAO,EAAGA,EAAO,CAGnB,IAAM,EAAkC,EAAE,CAC1C,IAAK,GAAM,CAAC,EAAK,KAAW,OAAO,QAAQ,EAAQ,CAAE,CACnD,IAAM,EAAI,EACV,GAAI,EAAE,OAAS,MAAO,OAAO,EAC7B,EAAO,GAAO,EAAE,MAElB,OAAO,EAAG,EAAO,EAgCN,EAA2B,EACtC,GACO,EAA0B,IAAiC,EAAO,OAAS,KAAO,EAAO,MAAQ,EACzG,CAwBY,EAAmC,EAC9C,GACO,EAA0B,IAA4B,EAAO,OAAS,KAAO,EAAO,MAAQ,EAAG,EAAO,MAAM,CACpH,CA8BY,EAAqB,EAChC,GACU,EAA0B,IAClC,EAAO,OAAS,KAAO,EAAS,GAAG,EAAO,MAAM,CAAG,EAAS,IAAI,EAAO,MAAM,CAChF,CA0BY,EAA0B,GAAyE,CAC9G,IAAM,EAAK,OAAO,GAAgB,WAAa,EAAc,EAAY,IACnE,EACJ,OAAO,GAAgB,WAClB,GAAgB,aAAa,MAAQ,EAAQ,MAAM,OAAO,EAAE,CAAC,CAC9D,EAAY,MACZ,EAAY,OAAO,GAAgB,WAAa,IAAA,GAAY,EAAY,QAE1E,EAAU,GACd,GAAI,CACF,IAAM,EAAS,GAAI,CACnB,GAAI,EAAU,EAAO,CAAE,CACrB,EAAU,GACV,IAAM,EAAU,QAAQ,QAAQ,EAAO,CACpC,KAAK,EAAG,CACR,MAAO,GAAe,EAAI,EAAQ,EAAE,CAAC,CAAC,CACzC,OAAO,EAAY,EAAQ,QAAQ,EAAU,CAAG,EAElD,OAAO,EAAG,EAAO,OACV,EAAG,CACV,OAAO,EAAI,EAAQ,EAAE,CAAC,QACd,CACJ,GAAa,CAAC,GAChB,GAAW,GAMX,EAAO"}
+{"version":3,"file":"result-C74pRN2x.mjs","names":["values"],"sources":["../src/result/result.ts"],"sourcesContent":["/**\n * Synchronous success/error primitives with typed channels (`Ok` / `Err`).\n *\n * **Mental model**\n * - `Result<A, E>` makes success and failure explicit.\n * - Use `flatMap` to sequence fallible operations without throwing.\n *\n * **Common tasks**\n * - Construct with `Result.ok`, `Result.err`, `Result.fromTry`.\n * - Transform with `Result.map`, `Result.mapErr`, `Result.flatMap`.\n * - Handle with `Result.match` or `Result.unwrapOr`.\n *\n * **Gotchas**\n * - `Result.err` short-circuits in `Fx.gen`.\n * - Keep domain errors in the `E` channel instead of throwing.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const parsed = Result.fromTry(() => Number.parseInt(\"42\", 10))\n * const doubled = Result.map(parsed, (value) => value * 2)\n * ```\n *\n * @module\n */\nimport { FxTypeId } from \"../fx/fx.types\"\nimport { dual } from \"../shared/dual\"\nimport { isPromise } from \"../shared/is-promise\"\nimport { pipeable } from \"../shared/pipeable\"\nimport type {\n  FromTryOptions,\n  Result as ResultType,\n  ResultAll,\n  ResultFlatMap,\n  ResultFromTry,\n  ResultMap,\n  ResultMapErr,\n  ResultMatch,\n  ResultTap,\n  ResultOrElse,\n  ResultFilter,\n  ResultUnwrapOr,\n  ResultUnwrapOrElse,\n} from \"./result.types\"\n\n/**\n * Re-exported `Result` type.\n *\n * @example\n * ```ts\n * import type { Result } from \"@nicolastoulemont/std\"\n *\n * type Example = Result.Result<unknown, unknown>\n * ```\n */\nexport type Result<T, E> = ResultType<T, E>\n\n/* oxlint-disable no-unsafe-type-assertion -- Result constructors encode Fx phantom channels and iterator contracts via type-level markers. */\n\n// ============================================================================\n// Constructors\n// ============================================================================\n\n/**\n * Create a successful Result.\n *\n * @param value - The success value\n * @returns A Result with _tag: \"Ok\"\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const value = Result.ok(42)\n * // => { _tag: \"Ok\", value: 42 }\n * ```\n */\nexport const ok = <T>(value: T): ResultType<T, never> => {\n  const result: ResultType<T, never> = {\n    _tag: \"Ok\",\n    value,\n    pipe: pipeable,\n    [FxTypeId]: {\n      _A: () => value,\n      _E: () => undefined as never,\n      _R: () => undefined as never,\n    },\n    // oxlint-disable-next-line require-yield\n    *[Symbol.iterator](): Generator<ResultType<T, never>, T, unknown> {\n      return value\n    },\n  }\n  return result\n}\n\n/**\n * Create an error Result.\n *\n * @param error - The error value\n * @returns A Result with _tag: \"Err\"\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const value = Result.err(\"boom\")\n * // => { _tag: \"Err\", error: \"boom\" }\n * ```\n */\nexport const err = <E>(error: E): ResultType<never, E> => {\n  const result: ResultType<never, E> = {\n    _tag: \"Err\",\n    error,\n    pipe: pipeable,\n    [FxTypeId]: {\n      _A: () => undefined as never,\n      _E: () => error,\n      _R: () => undefined as never,\n    },\n    *[Symbol.iterator](): Generator<ResultType<never, E>, never, unknown> {\n      yield result\n      throw new Error(\"Unreachable: Fx.gen should short-circuit on error\")\n    },\n  }\n  return result\n}\n\n// ============================================================================\n// Type Guards\n// ============================================================================\n\n/**\n * Check if a Result is successful.\n *\n * @param result - The Result to check\n * @returns true if the Result is Ok\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const isOk = Result.isOk(Result.ok(1))\n * // => true\n * ```\n */\nexport const isOk = <T, E>(result: ResultType<T, E>): result is Extract<ResultType<T, E>, { _tag: \"Ok\" }> =>\n  result._tag === \"Ok\"\n\n/**\n * Check if a Result is an error.\n *\n * @param result - The Result to check\n * @returns true if the Result is an error\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const isErr = Result.isErr(Result.err(\"boom\"))\n * // => true\n * ```\n */\nexport const isErr = <T, E>(result: ResultType<T, E>): result is Extract<ResultType<T, E>, { _tag: \"Err\" }> =>\n  result._tag === \"Err\"\n\n// ============================================================================\n// Transformations (curried for pipe)\n// ============================================================================\n\n/**\n * Transform the success value of a Result.\n * If the Result is an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `map(result, fn)`\n * - Data-last: `pipe(result, map(fn))`\n *\n * Supports both sync and async callbacks:\n * - Sync fn: returns U\n * - Async fn: returns Promise<U>\n *\n * @param fn - Function that transforms the success value\n * @returns The mapped Result in data-first form, or a function that maps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2)\n * const dataFirst = Result.map(input, (n) => n + 1)\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.map((n: number) => n + 1)(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const map: ResultMap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) => {\n  if (result._tag === \"Err\") return result as any\n  const mapped = fn(result.value)\n  if (isPromise(mapped)) {\n    return Promise.resolve(mapped).then(ok) as any\n  }\n  return ok(mapped) as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Transform the error value of a Result.\n * If the Result is successful, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `mapErr(result, fn)`\n * - Data-last: `pipe(result, mapErr(fn))`\n *\n * Supports both sync and async callbacks:\n * - Sync fn: returns F\n * - Async fn: returns Promise<F>\n *\n * @param fn - Function that transforms the error value\n * @returns The mapped Result in data-first form, or a function that maps Result errors in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\")\n * const dataFirst = Result.mapErr(input, (msg) => msg.toUpperCase())\n * // => { _tag: \"Err\", error: \"MISSING\" }\n *\n * const dataLast = Result.mapErr((msg: string) => msg.toUpperCase())(input)\n * // => { _tag: \"Err\", error: \"MISSING\" }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const mapErr: ResultMapErr = dual(2, (result: ResultType<unknown, unknown>, fn: (error: unknown) => unknown) => {\n  if (result._tag === \"Ok\") return result as any\n  const mapped = fn(result.error)\n  if (isPromise(mapped)) {\n    return Promise.resolve(mapped).then(err) as any\n  }\n  return err(mapped) as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Chain operations that return Results.\n * If the Result is an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `flatMap(result, fn)`\n * - Data-last: `pipe(result, flatMap(fn))`\n *\n * Supports both sync and async functions:\n * - Sync fn: returns Result<U, E | E2>\n * - Async fn: returns Promise<Result<U, E | E2>>\n *\n * @param fn - Function that takes a value and returns a Result (or Promise<Result>)\n * @returns The resulting Result in data-first form, or a function that flatMaps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2)\n * const dataFirst = Result.flatMap(input, (n) => Result.ok(n + 1))\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.flatMap((n: number) => Result.ok(n + 1))(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\n// oxlint-disable-next-line no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types\nexport const flatMap: ResultFlatMap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) =>\n  result._tag === \"Ok\" ? fn(result.value) : result,\n)\n\n/**\n * Perform a side effect on the success value without modifying the Result.\n * Useful for debugging, logging, or other side effects in a pipeline.\n * If the Result is an error, the function is not called.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `tap(result, fn)`\n * - Data-last: `pipe(result, tap(fn))`\n *\n * Supports both sync and async side effects:\n * - Sync fn: returns any value (ignored)\n * - Async fn: returns Promise<unknown>\n *\n * @param fn - Function to call with the success value (return value is ignored)\n * @returns The original Result in data-first form, or a function that taps a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * let seen = 0\n * const input = Result.ok(2)\n * const dataFirst = Result.tap(input, (n) => {\n *   seen = n\n * })\n * // => { _tag: \"Ok\", value: 2 }\n *\n * const dataLast = Result.tap((n: number) => {\n *   seen = n\n * })(input)\n * // => { _tag: \"Ok\", value: 2 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types in curried functions */\nexport const tap: ResultTap = dual(2, (result: ResultType<unknown, unknown>, fn: (value: unknown) => unknown) => {\n  if (result._tag === \"Err\") return result as any\n  const sideEffect = fn(result.value)\n  if (isPromise(sideEffect)) {\n    return Promise.resolve(sideEffect).then(() => result) as any\n  }\n  return result as any\n})\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-type-assertion */\n\n/**\n * Recover from an error by providing an alternative Result.\n * If the Result is successful, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `orElse(result, fn)`\n * - Data-last: `pipe(result, orElse(fn))`\n *\n * Supports both sync and async fallback functions:\n * - Sync fn: returns Result<T | U, E2>\n * - Async fn: returns Promise<Result<T | U, E2>>\n *\n * @param fn - Function that takes the error and returns an alternative Result\n * @returns The original or fallback Result in data-first form, or a function that recovers from an error in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.orElse(input, () => Result.ok(0))\n * // => { _tag: \"Ok\", value: 0 }\n *\n * const dataLast = Result.orElse(() => Result.ok(0))(input)\n * // => { _tag: \"Ok\", value: 0 }\n * ```\n */\n// oxlint-disable-next-line no-explicit-any, no-unsafe-return, no-unsafe-type-assertion -- Required for overloaded return types\nexport const orElse: ResultOrElse = dual(2, (result: ResultType<unknown, unknown>, fn: (error: unknown) => unknown) =>\n  result._tag === \"Ok\" ? result : fn(result.error),\n)\n\n/**\n * Filter a successful Result based on a predicate.\n * If the predicate returns false, converts the success to an error.\n * If the Result is already an error, it passes through unchanged.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `filter(result, predicate, onFail)`\n * - Data-last: `pipe(result, filter(predicate, onFail))`\n *\n * @param predicate - Function that returns true to keep the value\n * @param onFail - Function that creates the error when predicate fails\n * @returns The filtered Result in data-first form, or a function that filters a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(3)\n * const dataFirst = Result.filter(input, (n) => n > 0, (n) => `${n} must be positive`)\n * // => { _tag: \"Ok\", value: 3 }\n *\n * const dataLast = Result.filter((n: number) => n > 0, (n) => `${n} must be positive`)(input)\n * // => { _tag: \"Ok\", value: 3 }\n * ```\n */\nexport const filter: ResultFilter = dual(\n  3,\n  (\n    result: ResultType<unknown, unknown>,\n    predicate: (value: unknown) => boolean,\n    onFail: (value: unknown) => unknown,\n  ) => {\n    if (result._tag === \"Err\") return result\n    return predicate(result.value) ? result : err(onFail(result.value))\n  },\n)\n\n// ============================================================================\n// Combinators\n// ============================================================================\n\n/**\n * Combine multiple Results into a single Result.\n * Supports both array and object inputs.\n *\n * - If all Results are ok, returns ok with all values\n * - If any Result is an error, returns the first error (short-circuits)\n *\n * For arrays of 1-6 elements, tuple types are inferred automatically.\n * For longer arrays, use `as const` to preserve tuple structure.\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const combined = Result.all([Result.ok(1), Result.ok(2)] as const)\n * // => { _tag: \"Ok\", value: [1, 2] }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-return, no-unsafe-member-access, strict-boolean-expressions, no-unsafe-type-assertion, no-unsafe-argument -- Required for handling union types in overloaded function */\nexport const all: ResultAll = (results: any): any => {\n  if (Array.isArray(results)) {\n    const values: unknown[] = []\n    for (const result of results) {\n      if (result._tag === \"Err\") return result\n      values.push(result.value)\n    }\n    return ok(values)\n  }\n\n  const values: Record<string, unknown> = {}\n  for (const [key, result] of Object.entries(results)) {\n    const r = result as ResultType<unknown, unknown>\n    if (r._tag === \"Err\") return result\n    values[key] = r.value\n  }\n  return ok(values)\n}\n/* oxlint-enable no-explicit-any, no-unsafe-return, no-unsafe-member-access, strict-boolean-expressions, no-unsafe-type-assertion, no-unsafe-argument */\n\n// ============================================================================\n// Extraction\n// ============================================================================\n\n/**\n * Get the success value or a default value.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `unwrapOr(result, defaultValue)`\n * - Data-last: `pipe(result, unwrapOr(defaultValue))`\n *\n * Uses NoInfer to prevent type inference from the default value.\n *\n * @param defaultValue - Value to return if the Result is an error\n * @returns The unwrapped value in data-first form, or a function that unwraps a Result with a default in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.unwrapOr(input, 0)\n * // => 0\n *\n * const dataLast = Result.unwrapOr(0)(input)\n * // => 0\n * ```\n */\nexport const unwrapOr: ResultUnwrapOr = dual(\n  2,\n  <T, E>(result: ResultType<T, E>, defaultValue: NoInfer<T>): T => (result._tag === \"Ok\" ? result.value : defaultValue),\n)\n\n/**\n * Get the success value or compute a value from the error.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `unwrapOrElse(result, fn)`\n * - Data-last: `pipe(result, unwrapOrElse(fn))`\n *\n * @param fn - Function to compute a value from the error\n * @returns The unwrapped value in data-first form, or a function that unwraps a Result lazily in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.err(\"missing\") as Result.Result<number, string>\n * const dataFirst = Result.unwrapOrElse(input, () => 0)\n * // => 0\n *\n * const dataLast = Result.unwrapOrElse(() => 0)(input)\n * // => 0\n * ```\n */\nexport const unwrapOrElse: ResultUnwrapOrElse = dual(\n  2,\n  <T, E>(result: ResultType<T, E>, fn: (error: E) => T): T => (result._tag === \"Ok\" ? result.value : fn(result.error)),\n)\n\n/**\n * Pattern match on a Result, handling both success and error cases.\n *\n * Supports both data-first and data-last calling styles:\n * - Data-first: `match(result, { Ok: ..., Err: ... })`\n * - Data-last: `pipe(result, match({ Ok: ..., Err: ... }))`\n *\n * @param handlers - Object with `Ok` and `Err` handlers\n * @returns The handler result in data-first form, or a function that matches a Result in data-last form\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const input = Result.ok(2) as Result.Result<number, string>\n * const dataFirst = Result.match(input, {\n *   Ok: (value) => `ok:${value}` ,\n *   Err: (error) => `err:${error}` ,\n * })\n * // => \"ok:2\"\n *\n * const dataLast = Result.match({\n *   Ok: (value: number) => `ok:${value}` ,\n *   Err: (error: string) => `err:${error}` ,\n * })(input)\n * // => \"ok:2\"\n * ```\n */\nexport const match: ResultMatch = dual(\n  2,\n  <T, E, U>(result: ResultType<T, E>, handlers: { Ok: (value: T) => U; Err: (error: E) => U }): U =>\n    result._tag === \"Ok\" ? handlers.Ok(result.value) : handlers.Err(result.error),\n)\n\n// ============================================================================\n// Error Boundary\n// ============================================================================\n\n/**\n * Wrap a function that might throw into a Result.\n * Supports both sync and async functions with automatic type inference.\n *\n * Can be called with a simple callback or an object with `try` and `catch`:\n * - Simple: `fromTry(() => riskyOp())` — errors are wrapped as `Error`\n * - Object: `fromTry({ try: () => riskyOp(), catch: (e) => mapError(e) })` — custom error mapping\n *\n * @param fnOrOptions - Function that might throw, or object with `try` and `catch`\n * @returns A Result with the return value or the caught/mapped error\n *\n * @example\n * ```ts\n * import { Result } from \"@nicolastoulemont/std\"\n *\n * const parsed = Result.fromTry(() => Number.parseInt(\"42\", 10))\n * // => { _tag: \"Ok\", value: 42 }\n * ```\n */\n/* oxlint-disable no-explicit-any, no-unsafe-type-assertion -- Required for overloaded return type */\nexport const fromTry: ResultFromTry = (fnOrOptions: (() => unknown) | FromTryOptions<unknown, unknown>): any => {\n  const fn = typeof fnOrOptions === \"function\" ? fnOrOptions : fnOrOptions.try\n  const catchFn =\n    typeof fnOrOptions === \"function\"\n      ? (e: unknown) => (e instanceof Error ? e : new Error(String(e)))\n      : fnOrOptions.catch\n  const finallyFn = typeof fnOrOptions === \"function\" ? undefined : fnOrOptions.finally\n\n  let isAsync = false\n  try {\n    const result = fn()\n    if (isPromise(result)) {\n      isAsync = true\n      const promise = Promise.resolve(result)\n        .then(ok)\n        .catch((e: unknown) => err(catchFn(e)))\n      return finallyFn ? promise.finally(finallyFn) : promise\n    }\n    return ok(result)\n  } catch (e) {\n    return err(catchFn(e))\n  } finally {\n    if (finallyFn && !isAsync) {\n      finallyFn()\n    }\n  }\n}\n/* oxlint-enable no-explicit-any, no-unsafe-type-assertion */\n\nconst try_ = fromTry\n\nexport {\n  /**\n   * Alias of {@link fromTry}.\n   *\n   * @example\n   * ```ts\n   * import { Result } from \"@nicolastoulemont/std\"\n   *\n   * const parsed = Result.try(() => JSON.parse(\"{\\\"ok\\\":true}\"))\n   * ```\n   *\n   */\n  try_ as try,\n}\n\n/* oxlint-enable no-unsafe-type-assertion */\n"],"mappings":"0ZAgFA,MAAa,EAAS,IACiB,CACnC,KAAM,KACN,QACA,KAAM,GACL,GAAW,CACV,OAAU,EACV,OAAU,IAAA,GACV,OAAU,IAAA,GACX,CAED,EAAE,OAAO,WAAyD,CAChE,OAAO,GAEV,EAkBU,EAAU,GAAmC,CACxD,IAAM,EAA+B,CACnC,KAAM,MACN,QACA,KAAM,GACL,GAAW,CACV,OAAU,IAAA,GACV,OAAU,EACV,OAAU,IAAA,GACX,CACD,EAAE,OAAO,WAA6D,CAEpE,MADA,MAAM,EACI,MAAM,oDAAoD,EAEvE,CACD,OAAO,GAqBI,EAAc,GACzB,EAAO,OAAS,KAgBL,EAAe,GAC1B,EAAO,OAAS,MAkCL,EAAiB,EAAK,GAAI,EAAsC,IAAoC,CAC/G,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,IAAM,EAAS,EAAG,EAAO,MAAM,CAI/B,OAHI,EAAU,EAAO,CACZ,QAAQ,QAAQ,EAAO,CAAC,KAAK,EAAG,CAElC,EAAG,EAAO,EACjB,CA+BW,EAAuB,EAAK,GAAI,EAAsC,IAAoC,CACrH,GAAI,EAAO,OAAS,KAAM,OAAO,EACjC,IAAM,EAAS,EAAG,EAAO,MAAM,CAI/B,OAHI,EAAU,EAAO,CACZ,QAAQ,QAAQ,EAAO,CAAC,KAAK,EAAI,CAEnC,EAAI,EAAO,EAClB,CA+BW,EAAyB,EAAK,GAAI,EAAsC,IACnF,EAAO,OAAS,KAAO,EAAG,EAAO,MAAM,CAAG,EAC3C,CAoCY,EAAiB,EAAK,GAAI,EAAsC,IAAoC,CAC/G,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,IAAM,EAAa,EAAG,EAAO,MAAM,CAInC,OAHI,EAAU,EAAW,CAChB,QAAQ,QAAQ,EAAW,CAAC,SAAW,EAAO,CAEhD,GACP,CA+BW,EAAuB,EAAK,GAAI,EAAsC,IACjF,EAAO,OAAS,KAAO,EAAS,EAAG,EAAO,MAAM,CACjD,CA2BY,EAAuB,EAClC,GAEE,EACA,EACA,IAEI,EAAO,OAAS,OACb,EAAU,EAAO,MAAM,CADI,EACQ,EAAI,EAAO,EAAO,MAAM,CAAC,CAEtE,CAyBY,EAAkB,GAAsB,CACnD,GAAI,MAAM,QAAQ,EAAQ,CAAE,CAC1B,IAAMA,EAAoB,EAAE,CAC5B,IAAK,IAAM,KAAU,EAAS,CAC5B,GAAI,EAAO,OAAS,MAAO,OAAO,EAClC,EAAO,KAAK,EAAO,MAAM,CAE3B,OAAO,EAAGA,EAAO,CAGnB,IAAM,EAAkC,EAAE,CAC1C,IAAK,GAAM,CAAC,EAAK,KAAW,OAAO,QAAQ,EAAQ,CAAE,CACnD,IAAM,EAAI,EACV,GAAI,EAAE,OAAS,MAAO,OAAO,EAC7B,EAAO,GAAO,EAAE,MAElB,OAAO,EAAG,EAAO,EAgCN,EAA2B,EACtC,GACO,EAA0B,IAAiC,EAAO,OAAS,KAAO,EAAO,MAAQ,EACzG,CAwBY,EAAmC,EAC9C,GACO,EAA0B,IAA4B,EAAO,OAAS,KAAO,EAAO,MAAQ,EAAG,EAAO,MAAM,CACpH,CA8BY,EAAqB,EAChC,GACU,EAA0B,IAClC,EAAO,OAAS,KAAO,EAAS,GAAG,EAAO,MAAM,CAAG,EAAS,IAAI,EAAO,MAAM,CAChF,CA0BY,EAA0B,GAAyE,CAC9G,IAAM,EAAK,OAAO,GAAgB,WAAa,EAAc,EAAY,IACnE,EACJ,OAAO,GAAgB,WAClB,GAAgB,aAAa,MAAQ,EAAQ,MAAM,OAAO,EAAE,CAAC,CAC9D,EAAY,MACZ,EAAY,OAAO,GAAgB,WAAa,IAAA,GAAY,EAAY,QAE1E,EAAU,GACd,GAAI,CACF,IAAM,EAAS,GAAI,CACnB,GAAI,EAAU,EAAO,CAAE,CACrB,EAAU,GACV,IAAM,EAAU,QAAQ,QAAQ,EAAO,CACpC,KAAK,EAAG,CACR,MAAO,GAAe,EAAI,EAAQ,EAAE,CAAC,CAAC,CACzC,OAAO,EAAY,EAAQ,QAAQ,EAAU,CAAG,EAElD,OAAO,EAAG,EAAO,OACV,EAAG,CACV,OAAO,EAAI,EAAQ,EAAE,CAAC,QACd,CACJ,GAAa,CAAC,GAChB,GAAW,GAMX,EAAO"}

package/dist/{result.types-BKzChyWY.d.mts → result.types-JEcowzYH.d.mts}

@@ -1,30 +1,9 @@
-import { i as Fx } from "./fx.types-BdN1EWxr.mjs";
-import { t as Pipeable } from "./pipeable-BIrevC0D.mjs";
+import { i as Fx } from "./fx.types-CpFKa-Jj.mjs";
+import { t as Pipeable } from "./pipeable-BY9yPsNK.mjs";
+import { n as Ok, t as Err } from "./type-utils.types-CnPpsvt5.mjs";
 
-//#region src/shared/type-utils.types.d.ts
-
-/**
- * Prettify a type for better IDE display
- * Utility type that forces TypeScript to expand an intersection type
- * into a more readable object type in hover/intellisense.
- */
-type Prettify<T> = { [K in keyof T]: T[K] } & {};
-/**
- * Represents a successful result with a value.
- */
-type Ok<T> = {
-  readonly _tag: "Ok";
-  readonly value: T;
-};
-/**
- * Represents a failed result with an error.
- */
-type Err<E> = {
-  readonly _tag: "Err";
-  readonly error: E;
-};
-//#endregion
 //#region src/result/result.types.d.ts
+
 /**
  * A discriminated union representing either a successful result or an error.
  * Uses _tag discriminator for unified API compatibility.
@@ -177,5 +156,5 @@ type ResultMatch = {
   }): (result: Result<T, E>) => U;
 };
 //#endregion
-export { ResultFromTry as a, ResultMatch as c, ResultUnwrapOr as d, ResultUnwrapOrElse as f, Prettify as h, ResultFlatMap as i, ResultOrElse as l, Ok as m, ResultAll as n, ResultMap as o, Err as p, ResultFilter as r, ResultMapErr as s, Result as t, ResultTap as u };
-//# sourceMappingURL=result.types-BKzChyWY.d.mts.map
+export { ResultFromTry as a, ResultMatch as c, ResultUnwrapOr as d, ResultUnwrapOrElse as f, ResultFlatMap as i, ResultOrElse as l, ResultAll as n, ResultMap as o, ResultFilter as r, ResultMapErr as s, Result as t, ResultTap as u };
+//# sourceMappingURL=result.types-JEcowzYH.d.mts.map

package/dist/result.types-JEcowzYH.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.types-JEcowzYH.d.mts","names":[],"sources":["../src/result/result.types.ts"],"sourcesContent":[],"mappings":";;;;;;;;AAeA;;;;;AACK,KADO,MACP,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,CADuB,EACvB,CAD0B,CAC1B,CAAA,GAD+B,GAC/B,CADmC,CACnC,CAAA,CAAA,GAAH,EAAG,CAAA,CAAA,EAAG,CAAH,CAAA,GACH,QADG,GAAA;EAAG,CAAA,MAAA,CAAA,QAAA,GAAA,EAEiB,SAFjB,CAE2B,MAF3B,CAEkC,CAFlC,EAEqC,CAFrC,CAAA,EAEyC,CAFzC,EAAA,OAAA,CAAA;CAAN;;;;;AAE+C,KAOrC,cAPqC,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA;EAAxB,GAAA,EAAA,GAAA,GAQZ,CARY;EAAS,KAAA,EAAA,CAAA,KAAA,EAAA,OAAA,EAAA,GASL,CATK;EAOtB,OAAA,CAAA,EAAA,GAAA,GAAA,IAAc;AAW1B,CAAA;;;;;;AAEoE,KAFxD,aAAA,GAEwD;EAAV,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,OAAA,EAAxC,cAAwC,CAAzB,OAAyB,CAAjB,CAAiB,CAAA,EAAb,CAAa,CAAA,CAAA,EAAR,OAAQ,CAAA,MAAA,CAAO,CAAP,EAAU,CAAV,CAAA,CAAA;EAAR,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,OAAA,EAEhC,cAFgC,CAEjB,CAFiB,EAEd,CAFc,CAAA,CAAA,EAET,MAFS,CAEF,CAFE,EAEC,CAFD,CAAA;EAEjB,CAAA,CAAA,CAAA,CAAA,EAAA,EAAA,GAAA,GAEjB,OAFiB,CAET,CAFS,CAAA,CAAA,EAEJ,OAFI,CAEI,MAFJ,CAEW,CAFX,EAEc,KAFd,CAAA,CAAA;EAAG,CAAA,CAAA,CAAA,CAAA,EAAA,EAAA,GAAA,GAIpB,CAJoB,CAAA,EAIhB,MAJgB,CAIT,CAJS,EAIN,KAJM,CAAA;CAAlB;;;;;KAeb,WAbW,CAAA,CAAA,CAAA,GAaM,CAbN,SAAA;EAA4B,SAAA,IAAA,EAAA,IAAA;EAAG,SAAA,KAAA,EAAA,KAAA,EAAA;CAAV,GAAA,CAAA,GAAA,KAAA;;;;;KAmBhC,WAjBe,CAAA,CAAA,CAAA,GAiBE,CAjBF,SAAA;EAAM,SAAA,IAAA,EAAA,KAAA;EAWrB,SAAA,KAAW,EAAA,KAAA,EAAA;AAAO,CAAA,GAMlB,CAAA,GAAA,KAAA;AAML;;;;AAEsD,KAF1C,SAAA,GAE0C;EAAI,CAAA,CAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CAA7B,MAA6B,CAAtB,CAAsB,EAAnB,EAAmB,CAAA,CAAA,CAAA,EAAZ,MAAY,CAAA,CAAJ,CAAI,CAAA,EAAA,EAAA,CAAA;EAAZ,CAAA,CAAA,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CACV,MADU,CACH,CADG,EACA,EADA,CAAA,EACK,MADL,CACY,CADZ,EACe,EADf,CAAA,CAAA,CAAA,EACsB,MADtB,CAAA,CAC8B,CAD9B,EACiC,CADjC,CAAA,EACqC,EADrC,GAC0C,EAD1C,CAAA;EACH,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CAEpB,MAFoB,CAEb,CAFa,EAEV,EAFU,CAAA,EAEL,MAFK,CAEE,CAFF,EAEK,EAFL,CAAA,EAEU,MAFV,CAEiB,CAFjB,EAEoB,EAFpB,CAAA,CAAA,CAAA,EAGtC,MAHsC,CAAA,CAG9B,CAH8B,EAG3B,CAH2B,EAGxB,CAHwB,CAAA,EAGpB,EAHoB,GAGf,EAHe,GAGV,EAHU,CAAA;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CAKvB,MALuB,CAKhB,CALgB,EAKb,EALa,CAAA,EAKR,MALQ,CAKD,CALC,EAKE,EALF,CAAA,EAKO,MALP,CAKc,CALd,EAKiB,EALjB,CAAA,EAKsB,MALtB,CAK6B,CAL7B,EAKgC,EALhC,CAAA,CAAA,CAAA,EAMzC,MANyC,CAAA,CAMjC,CANiC,EAM9B,CAN8B,EAM3B,CAN2B,EAMxB,CANwB,CAAA,EAMpB,EANoB,GAMf,EANe,GAMV,EANU,GAML,EANK,CAAA;EAAV,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CAQb,MARa,CAQN,CARM,EAQH,EARG,CAAA,EAQE,MARF,CAQS,CART,EAQY,EARZ,CAAA,EAQiB,MARjB,CAQwB,CARxB,EAQ2B,EAR3B,CAAA,EAQgC,MARhC,CAQuC,CARvC,EAQ0C,EAR1C,CAAA,EAQ+C,MAR/C,CAQsD,CARtD,EAQyD,EARzD,CAAA,CAAA,CAAA,EAS/B,MAT+B,CAAA,CASvB,CATuB,EASpB,CAToB,EASjB,CATiB,EASd,CATc,EASX,CATW,CAAA,EASP,EATO,GASF,EATE,GASG,EATH,GASQ,EATR,GASa,EATb,CAAA;EAAsB,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,SAAA,CAWnC,MAXmC,CAW5B,CAX4B,EAWzB,EAXyB,CAAA,EAWpB,MAXoB,CAWb,CAXa,EAWV,EAXU,CAAA,EAWL,MAXK,CAWE,CAXF,EAWK,EAXL,CAAA,EAWU,MAXV,CAWiB,CAXjB,EAWoB,EAXpB,CAAA,EAWyB,MAXzB,CAWgC,CAXhC,EAWmC,EAXnC,CAAA,EAWwC,MAXxC,CAW+C,CAX/C,EAWkD,EAXlD,CAAA,CAAA,CAAA,EAYrD,MAZqD,CAAA,CAY7C,CAZ6C,EAY1C,CAZ0C,EAYvC,CAZuC,EAYpC,CAZoC,EAYjC,CAZiC,EAY9B,CAZ8B,CAAA,EAY1B,EAZ0B,GAYrB,EAZqB,GAYhB,EAZgB,GAYX,EAZW,GAYN,EAZM,GAYD,EAZC,CAAA;EAAG,CAAA,UAAA,SAevC,MAfuC,CAAA,OAAA,EAAA,OAAA,CAAA,EAAA,CAAA,CAAA,OAAA,EAgBhD,CAhBgD,CAAA,EAiBxD,MAjBwD,CAAA,kBAAV,MAiBf,CAjBe,GAiBX,WAjBW,CAiBC,CAjBD,CAiBG,CAjBH,CAAA,CAAA,EAAyB,EAiBf,WAjBe,CAiBH,CAjBG,CAAA,MAAA,CAAA,CAAA,CAAA;EAAG,CAAA,UAoBlE,MApBkE,CAAA,MAAA,EAoBnD,MApBmD,CAAA,OAAA,EAAA,OAAA,CAAA,CAAA,CAAA,CAAA,OAAA,EAqBlE,CArBkE,CAAA,EAsB1E,MAtB0E,CAAA,kBAAI,MAsB/C,CAtB+C,GAsB3C,WAtB2C,CAsB/B,CAtB+B,CAsB7B,CAtB6B,CAAA,CAAA,EAAK,EAsB3B,WAtB2B,CAsBf,CAtBe,CAAA,MAsBP,CAtBO,CAAA,CAAA,CAAA;CAApB;;;;;;AAE9B,KAgC1B,aAAA,GAhC0B;EAAsB,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAkCpC,MAlCoC,CAkC7B,CAlC6B,EAkC1B,CAlC0B,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAkCV,CAlCU,EAAA,GAkCJ,OAlCI,CAkCI,MAlCJ,CAkCW,CAlCX,EAkCc,EAlCd,CAAA,CAAA,CAAA,EAkCqB,OAlCrB,CAkC6B,MAlC7B,CAkCoC,CAlCpC,EAkCuC,CAlCvC,GAkC2C,EAlC3C,CAAA,CAAA;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAmCvC,MAnCuC,CAmChC,CAnCgC,EAmC7B,CAnC6B,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAmCb,CAnCa,EAAA,GAmCP,MAnCO,CAmCA,CAnCA,EAmCG,EAnCH,CAAA,CAAA,EAmCS,MAnCT,CAmCgB,CAnChB,EAmCmB,CAnCnB,GAmCuB,EAnCvB,CAAA;EAAV,CAAA,CAAA,EAAA,CAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAqC5B,CArC4B,EAAA,GAqCtB,OArCsB,CAqCd,MArCc,CAqCP,CArCO,EAqCJ,EArCI,CAAA,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAqCe,MArCf,CAqCsB,CArCtB,EAqCyB,CArCzB,CAAA,EAAA,GAqCgC,OArChC,CAqCwC,MArCxC,CAqC+C,CArC/C,EAqCkD,CArClD,GAqCsD,EArCtD,CAAA,CAAA;EACxC,CAAA,CAAA,EAAA,CAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAqCY,CArCZ,EAAA,GAqCkB,MArClB,CAqCyB,CArCzB,EAqC4B,EArC5B,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAqC8C,MArC9C,CAqCqD,CArCrD,EAqCwD,CArCxD,CAAA,EAAA,GAqC+D,MArC/D,CAqCsE,CArCtE,EAqCyE,CArCzE,GAqC6E,EArC7E,CAAA;CAAG;;;;;;AAEc,KA2ClB,SAAA,GA3CkB;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EA6Cb,MA7Ca,CA6CN,CA7CM,EA6CH,CA7CG,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EA6Ca,CA7Cb,EAAA,GA6CmB,OA7CnB,CA6C2B,CA7C3B,CAAA,CAAA,EA6CgC,OA7ChC,CA6CwC,MA7CxC,CA6C+C,CA7C/C,EA6CkD,CA7ClD,CAAA,CAAA;EAAV,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EA8CH,MA9CG,CA8CI,CA9CJ,EA8CO,CA9CP,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EA8CuB,CA9CvB,EAAA,GA8C6B,CA9C7B,CAAA,EA8CiC,MA9CjC,CA8CwC,CA9CxC,EA8C2C,CA9C3C,CAAA;EAAsB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAgDxB,CAhDwB,EAAA,GAgDlB,OAhDkB,CAgDV,CAhDU,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAgDO,MAhDP,CAgDc,CAhDd,EAgDiB,CAhDjB,CAAA,EAAA,GAgDwB,OAhDxB,CAgDgC,MAhDhC,CAgDuC,CAhDvC,EAgD0C,CAhD1C,CAAA,CAAA;EAAG,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAiD3B,CAjD2B,EAAA,GAiDrB,CAjDqB,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAiDL,MAjDK,CAiDE,CAjDF,EAiDK,CAjDL,CAAA,EAAA,GAiDY,MAjDZ,CAiDmB,CAjDnB,EAiDsB,CAjDtB,CAAA;CAAV;;;;;;AAA8B,KAyDxD,YAAA,GAzDwD;EACvD,CAAA,CAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EA0DS,MA1DT,CA0DgB,CA1DhB,EA0DmB,EA1DnB,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EA0DoC,EA1DpC,EAAA,GA0D2C,OA1D3C,CA0DmD,EA1DnD,CAAA,CAAA,EA0DyD,OA1DzD,CA0DiE,MA1DjE,CA0DwE,CA1DxE,EA0D2E,EA1D3E,CAAA,CAAA;EAAG,CAAA,CAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EA2DM,MA3DN,CA2Da,CA3Db,EA2DgB,EA3DhB,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EA2DiC,EA3DjC,EAAA,GA2DwC,EA3DxC,CAAA,EA2D6C,MA3D7C,CA2DoD,CA3DpD,EA2DuD,EA3DvD,CAAA;EAAG,CAAA,EAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EA6DI,EA7DJ,EAAA,GA6DW,OA7DX,CA6DmB,EA7DnB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EA6DqC,MA7DrC,CA6D4C,CA7D5C,EA6D+C,EA7D/C,CAAA,EAAA,GA6DuD,OA7DvD,CA6D+D,MA7D/D,CA6DsE,CA7DtE,EA6DyE,EA7DzE,CAAA,CAAA;EAAG,CAAA,EAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EA8DC,EA9DD,EAAA,GA8DQ,EA9DR,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EA8DyB,MA9DzB,CA8DgC,CA9DhC,EA8DmC,EA9DnC,CAAA,EAAA,GA8D2C,MA9D3C,CA8DkD,CA9DlD,EA8DqD,EA9DrD,CAAA;CAAI;;;;;AAEI,KAmElB,SAAA,GAnEkB;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EAsErB,MAtEqB,CAsEd,CAtEc,EAsEX,CAtEW,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAuEjB,CAvEiB,EAAA,GAuEX,CAvEW,CAAA,EAwE5B,CAxE4B,SAwElB,OAxEkB,CAAA,OAAA,CAAA,GAwEC,OAxED,CAwES,MAxET,CAwEgB,CAxEhB,EAwEmB,CAxEnB,CAAA,CAAA,GAwEyB,MAxEzB,CAwEgC,CAxEhC,EAwEmC,CAxEnC,CAAA;EAAV,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EA2EP,CA3EO,EAAA,GA2ED,CA3EC,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EA4EN,MA5EM,CA4EC,CA5ED,EA4EI,CA5EJ,CAAA,EAAA,GA4EW,CA5EX,SA4EqB,OA5ErB,CAAA,OAAA,CAAA,GA4EwC,OA5ExC,CA4EgD,MA5EhD,CA4EuD,CA5EvD,EA4E0D,CA5E1D,CAAA,CAAA,GA4EgE,MA5EhE,CA4EuE,CA5EvE,EA4E0E,CA5E1E,CAAA;CAAsB;;;;;;AAA8B,KAoF/D,YAAA,GApF+D;EAAG,CAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAsFpD,MAtFoD,CAsF7C,CAtF6C,EAsF1C,EAtF0C,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAsFzB,EAtFyB,EAAA,GAsFlB,OAtFkB,CAsFV,MAtFU,CAsFH,EAtFG,EAsFC,EAtFD,CAAA,CAAA,CAAA,EAsFQ,OAtFR,CAsFgB,MAtFhB,CAsFuB,CAtFvB,GAsF2B,EAtF3B,EAsF+B,EAtF/B,CAAA,CAAA;EAAV,CAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAuF1C,MAvF0C,CAuFnC,CAvFmC,EAuFhC,EAvFgC,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAuFf,EAvFe,EAAA,GAuFR,MAvFQ,CAuFD,EAvFC,EAuFG,EAvFH,CAAA,CAAA,EAuFS,MAvFT,CAuFgB,CAvFhB,GAuFoB,EAvFpB,EAuFwB,EAvFxB,CAAA;EAAsB,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAyF/D,EAzF+D,EAAA,GAyFxD,OAzFwD,CAyFhD,MAzFgD,CAyFzC,EAzFyC,EAyFrC,EAzFqC,CAAA,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAyFlB,MAzFkB,CAyFX,CAzFW,EAyFR,EAzFQ,CAAA,EAAA,GAyFA,OAzFA,CAyFQ,MAzFR,CAyFe,CAzFf,GAyFmB,EAzFnB,EAyFuB,EAzFvB,CAAA,CAAA;EAAG,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EA0FlE,EA1FkE,EAAA,GA0F3D,MA1F2D,CA0FpD,EA1FoD,EA0FhD,EA1FgD,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EA0F9B,MA1F8B,CA0FvB,CA1FuB,EA0FpB,EA1FoB,CAAA,EAAA,GA0FZ,MA1FY,CA0FL,CA1FK,GA0FD,EA1FC,EA0FG,EA1FH,CAAA;CAAV;;;;;AAC1D,KAgGb,YAAA,GAhGa;EAAI,CAAA,CAAA,EAAA,CAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAkGR,MAlGQ,CAkGD,CAlGC,EAkGE,CAlGF,CAAA,EAAA,SAAA,EAAA,CAAA,KAAA,EAkGyB,CAlGzB,EAAA,GAAA,OAAA,EAAA,MAAA,EAAA,CAAA,KAAA,EAkGwD,CAlGxD,EAAA,GAkG8D,EAlG9D,CAAA,EAkGmE,MAlGnE,CAkG0E,CAlG1E,EAkG6E,CAlG7E,GAkGiF,EAlGjF,CAAA;EAAK,CAAA,CAAA,EAAA,EAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAoGL,CApGK,EAAA,GAAA,OAAA,EAAA,MAAA,EAAA,CAAA,KAAA,EAoG0B,CApG1B,EAAA,GAoGgC,EApGhC,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EAoGiD,MApGjD,CAoGwD,CApGxD,EAoG2D,CApG3D,CAAA,EAAA,GAoGkE,MApGlE,CAoGyE,CApGzE,EAoG4E,CApG5E,GAoGgF,EApGhF,CAAA;CAAK;;;;;;AAEhB,KA0GX,cAAA,GA1GW;EAAsB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EA4G5B,MA5G4B,CA4GrB,CA5GqB,EA4GlB,CA5GkB,CAAA,EAAA,YAAA,EA4GA,OA5GA,CA4GQ,CA5GR,CAAA,CAAA,EA4Ga,CA5Gb;EAAG,CAAA,CAAA,CAAA,CAAA,YAAA,EA8G5B,OA9G4B,CA8GpB,CA9GoB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,MAAA,EA8GH,MA9GG,CA8GI,CA9GJ,EA8GO,CA9GP,CAAA,EAAA,GA8Gc,CA9Gd;CAAV;;;;;AAAwC,KAqHlE,kBAAA,GArHkE;EAAV,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EAuHnD,MAvHmD,CAuH5C,CAvH4C,EAuHzC,CAvHyC,CAAA,EAAA,EAAA,EAAA,CAAA,KAAA,EAuHzB,CAvHyB,EAAA,GAuHnB,CAvHmB,CAAA,EAuHf,CAvHe;EAAsB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAyHrE,CAzHqE,EAAA,GAyH/D,CAzH+D,CAAA,EAAA,CAAA,MAAA,EAyHlD,MAzHkD,CAyH3C,CAzH2C,EAyHxC,CAzHwC,CAAA,EAAA,GAyHjC,CAzHiC;CAAG;;;;;AAChF,KA+HD,WAAA,GA/HC;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EAiII,MAjIJ,CAiIW,CAjIX,EAiIc,CAjId,CAAA,EAAA,QAAA,EAAA;IAAG,EAAA,EAAA,CAAA,KAAA,EAiIuC,CAjIvC,EAAA,GAiI6C,CAjI7C;IAAG,GAAA,EAAA,CAAA,KAAA,EAiI0D,CAjI1D,EAAA,GAiIgE,CAjIhE;EAAG,CAAA,CAAA,EAiImE,CAjInE;EAAG,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,QAAA,EAAA;IAAI,EAAA,EAAA,CAAA,KAAA,EAmII,CAnIJ,EAAA,GAmIU,CAnIV;IAAK,GAAA,EAAA,CAAA,KAAA,EAmIqB,CAnIrB,EAAA,GAmI2B,CAnI3B;EAAK,CAAA,CAAA,EAAA,CAAA,MAAA,EAmIqC,MAnIrC,CAmI4C,CAnI5C,EAmI+C,CAnI/C,CAAA,EAAA,GAmIsD,CAnItD;CAAK"}

package/dist/schedule/index.d.mts

@@ -1,2 +1,2 @@
-import { r as schedule_d_exports } from "../schedule-BzPjvMXc.mjs";
+import { r as schedule_d_exports } from "../schedule-ap6y014J.mjs";
 export { schedule_d_exports as Schedule };

package/dist/schedule/index.mjs

@@ -1 +1 @@
-import{t as e}from"../schedule-B7qV60tO.mjs";export{e as Schedule};
+import{t as e}from"../schedule-ChcIgvd5.mjs";export{e as Schedule};

package/dist/{schedule-B7qV60tO.mjs → schedule-ChcIgvd5.mjs}

@@ -1,2 +1,2 @@
-import{t as e}from"./chunk-oQKkju2G.mjs";import{r as t}from"./result-D3VY0qBG.mjs";import{t as n}from"./data-DqACNS_g.mjs";import{n as r,r as i}from"./duration-Bas3mi1N.mjs";var a=e({ScheduleInvalidDelayError:()=>s,ScheduleInvalidFactorError:()=>c,ScheduleInvalidRetryCountError:()=>o,exponential:()=>g,fixed:()=>h,recurs:()=>m}),o=class extends n(`ScheduleInvalidRetryCountError`){},s=class extends n(`ScheduleInvalidDelayError`){},c=class extends n(`ScheduleInvalidFactorError`){};const l=e=>{if(!Number.isInteger(e)||e<0)throw new o({input:e,message:`Schedule retry count must be an integer >= 0, received: ${String(e)}`})},u=(e,n)=>{let a=r(n);if(t(a))throw new s({field:e,input:n,message:a.error.message,cause:a.error});let o=i(a.value);if(!Number.isFinite(o)||o<0)throw new s({field:e,input:n,message:`Schedule ${e} must be a finite number >= 0, received: ${String(o)}`});return o},d=(e,t)=>{if(!Number.isFinite(t)||t<=0)throw new c({input:t,message:`Schedule ${e} must be a finite number > 0, received: ${String(t)}`})},f=(e,t)=>({_tag:`RetrySchedule`,_sync:!0,maxRetries:e,delayForAttempt:t}),p=(e,t)=>({_tag:`RetrySchedule`,_sync:!1,maxRetries:e,delayForAttempt:t}),m=e=>(l(e),f(e,()=>0)),h=e=>{l(e.times);let t=u(`delay`,e.delay);return p(e.times,()=>t)},g=e=>{l(e.times);let t=u(`baseDelay`,e.baseDelay),n=e.factor??2;d(`factor`,n);let r;return e.maxDelay!==void 0&&(r=u(`maxDelay`,e.maxDelay)),p(e.times,e=>{let i=t*n**(e-1);return r===void 0?i:Math.min(i,r)})};export{a as t};
-//# sourceMappingURL=schedule-B7qV60tO.mjs.map
+import{t as e}from"./chunk-6rpU2rUb.mjs";import{r as t}from"./result-C74pRN2x.mjs";import{t as n}from"./data-W10ldR5l.mjs";import{n as r,r as i}from"./duration-Dwtjy95Z.mjs";var a=e({ScheduleInvalidDelayError:()=>s,ScheduleInvalidFactorError:()=>c,ScheduleInvalidRetryCountError:()=>o,exponential:()=>g,fixed:()=>h,recurs:()=>m}),o=class extends n(`ScheduleInvalidRetryCountError`){},s=class extends n(`ScheduleInvalidDelayError`){},c=class extends n(`ScheduleInvalidFactorError`){};const l=e=>{if(!Number.isInteger(e)||e<0)throw new o({input:e,message:`Schedule retry count must be an integer >= 0, received: ${String(e)}`})},u=(e,n)=>{let a=r(n);if(t(a))throw new s({field:e,input:n,message:a.error.message,cause:a.error});let o=i(a.value);if(!Number.isFinite(o)||o<0)throw new s({field:e,input:n,message:`Schedule ${e} must be a finite number >= 0, received: ${String(o)}`});return o},d=(e,t)=>{if(!Number.isFinite(t)||t<=0)throw new c({input:t,message:`Schedule ${e} must be a finite number > 0, received: ${String(t)}`})},f=(e,t)=>({_tag:`RetrySchedule`,_sync:!0,maxRetries:e,delayForAttempt:t}),p=(e,t)=>({_tag:`RetrySchedule`,_sync:!1,maxRetries:e,delayForAttempt:t}),m=e=>(l(e),f(e,()=>0)),h=e=>{l(e.times);let t=u(`delay`,e.delay);return p(e.times,()=>t)},g=e=>{l(e.times);let t=u(`baseDelay`,e.baseDelay),n=e.factor??2;d(`factor`,n);let r;return e.maxDelay!==void 0&&(r=u(`maxDelay`,e.maxDelay)),p(e.times,e=>{let i=t*n**(e-1);return r===void 0?i:Math.min(i,r)})};export{a as t};
+//# sourceMappingURL=schedule-ChcIgvd5.mjs.map

package/dist/{schedule-B7qV60tO.mjs.map → schedule-ChcIgvd5.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"schedule-B7qV60tO.mjs","names":["Data.TaggedError","Duration.from","Result.isErr","Duration.toMillis"],"sources":["../src/schedule/schedule.ts"],"sourcesContent":["/**\n * Retry schedule constructors used by `Fx.retry`.\n *\n * **Mental model**\n * - A schedule defines retry count and per-attempt delay.\n * - Sync schedules have no async delay requirements.\n *\n * **Common tasks**\n * - Use `Schedule.recurs` for immediate retries.\n * - Use `Schedule.fixed` for constant-delay retries.\n * - Use `Schedule.exponential` for backoff.\n *\n * **Gotchas**\n * - `times` is the number of retries after the first attempt.\n * - Delay values must normalize to finite, non-negative milliseconds.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.recurs(2)\n * const delay = schedule.delayForAttempt(1)\n * // => 0\n * ```\n *\n * @module\n */\n/* oxlint-disable eslint/max-classes-per-file -- TaggedError classes are exported alongside schedule constructors by design. */\nimport { Data } from \"../data\"\nimport { Duration } from \"../duration\"\nimport { Result } from \"../result\"\n/**\n * Retry schedule used by Fx.retry.\n *\n * A schedule defines:\n * - how many retries are allowed after the first attempt\n * - how long to wait before each retry attempt\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type RetrySchedule = SyncRetrySchedule | AsyncRetrySchedule\n\n/**\n * Schedule that never introduces async delays.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type SyncRetrySchedule = {\n  readonly _tag: \"RetrySchedule\"\n  readonly _sync: true\n  readonly maxRetries: number\n  readonly delayForAttempt: (retryAttempt: number) => number\n}\n\n/**\n * Schedule that may delay retries, requiring async execution.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type AsyncRetrySchedule = {\n  readonly _tag: \"RetrySchedule\"\n  readonly _sync: false\n  readonly maxRetries: number\n  readonly delayForAttempt: (retryAttempt: number) => number\n}\n\n/**\n * Tagged error for invalid retry counts.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidRetryCountError({\n *   input: -1,\n *   message: \"Schedule retry count must be an integer >= 0, received: -1\",\n * })\n * // => error._tag === \"ScheduleInvalidRetryCountError\"\n * ```\n */\nexport class ScheduleInvalidRetryCountError extends Data.TaggedError(\"ScheduleInvalidRetryCountError\")<{\n  input: number\n  message: string\n}> {}\n\n/**\n * Tagged error for invalid schedule delay inputs.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidDelayError({\n *   field: \"delay\",\n *   input: \"oops\",\n *   message: \"Invalid duration string: oops\",\n * })\n * // => error._tag === \"ScheduleInvalidDelayError\"\n * ```\n */\nexport class ScheduleInvalidDelayError extends Data.TaggedError(\"ScheduleInvalidDelayError\")<{\n  field: \"delay\" | \"baseDelay\" | \"maxDelay\"\n  input: Duration.Input\n  message: string\n  cause?: Duration.InputError\n}> {}\n\n/**\n * Tagged error for invalid exponential factors.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidFactorError({\n *   input: 0,\n *   message: \"Schedule factor must be a finite number > 0, received: 0\",\n * })\n * // => error._tag === \"ScheduleInvalidFactorError\"\n * ```\n */\nexport class ScheduleInvalidFactorError extends Data.TaggedError(\"ScheduleInvalidFactorError\")<{\n  input: number\n  message: string\n}> {}\n\ntype FixedScheduleOptions = {\n  readonly times: number\n  /**\n   * The delay for the fixed schedule.\n   * in milliseconds.\n   */\n  readonly delay: Duration.Input\n}\n\ntype ExponentialScheduleOptions = {\n  readonly times: number\n  /**\n   * The base delay for the exponential schedule.\n   * in milliseconds.\n   */\n  readonly baseDelay: Duration.Input\n  /**\n   * The factor for the exponential schedule.\n   * Default: 2\n   */\n  readonly factor?: number | undefined\n  /**\n   * The maximum delay for the exponential schedule.\n   * in milliseconds.\n   */\n  readonly maxDelay?: Duration.Input | undefined\n}\n\nconst validateRetryCount = (times: number) => {\n  if (!Number.isInteger(times) || times < 0) {\n    throw new ScheduleInvalidRetryCountError({\n      input: times,\n      message: `Schedule retry count must be an integer >= 0, received: ${String(times)}`,\n    })\n  }\n}\n\nconst validateDelay = (field: \"delay\" | \"baseDelay\" | \"maxDelay\", input: Duration.Input): number => {\n  const normalized = Duration.from(input)\n  if (Result.isErr(normalized)) {\n    throw new ScheduleInvalidDelayError({\n      field,\n      input,\n      message: normalized.error.message,\n      cause: normalized.error,\n    })\n  }\n\n  const millis = Duration.toMillis(normalized.value)\n  if (!Number.isFinite(millis) || millis < 0) {\n    throw new ScheduleInvalidDelayError({\n      field,\n      input,\n      message: `Schedule ${field} must be a finite number >= 0, received: ${String(millis)}`,\n    })\n  }\n\n  return millis\n}\n\nconst validatePositiveFinite = (name: \"factor\", value: number) => {\n  if (!Number.isFinite(value) || value <= 0) {\n    throw new ScheduleInvalidFactorError({\n      input: value,\n      message: `Schedule ${name} must be a finite number > 0, received: ${String(value)}`,\n    })\n  }\n}\n\nconst makeSyncSchedule = (\n  maxRetries: number,\n  delayForAttempt: (retryAttempt: number) => number,\n): SyncRetrySchedule => ({\n  _tag: \"RetrySchedule\",\n  _sync: true,\n  maxRetries,\n  delayForAttempt,\n})\n\nconst makeAsyncSchedule = (\n  maxRetries: number,\n  delayForAttempt: (retryAttempt: number) => number,\n): AsyncRetrySchedule => ({\n  _tag: \"RetrySchedule\",\n  _sync: false,\n  maxRetries,\n  delayForAttempt,\n})\n\n/**\n * Retry immediately up to `times` times.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.recurs(2)\n * const delay = schedule.delayForAttempt(1)\n * // => 0\n * ```\n */\nexport const recurs = (times: number): SyncRetrySchedule => {\n  validateRetryCount(times)\n  return makeSyncSchedule(times, () => 0)\n}\n\n/**\n * Retry with a fixed delay between attempts.\n *\n * @example\n * ```ts\n * import { Duration, Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.fixed({ times: 2, delay: Duration.millis(100) })\n * const delay = schedule.delayForAttempt(2)\n * // => 100\n * ```\n */\nexport const fixed = (options: FixedScheduleOptions): AsyncRetrySchedule => {\n  validateRetryCount(options.times)\n  const delay = validateDelay(\"delay\", options.delay)\n  return makeAsyncSchedule(options.times, () => delay)\n}\n\n/**\n * Retry with exponential backoff:\n * `baseDelay * factor^(retryAttempt - 1)`, optionally capped by `maxDelay`.\n *\n * @example\n * ```ts\n * import { Duration, Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.exponential({ times: 3, baseDelay: Duration.millis(100) })\n * const delay = schedule.delayForAttempt(3)\n * // => 400\n * ```\n */\nexport const exponential = (options: ExponentialScheduleOptions): AsyncRetrySchedule => {\n  validateRetryCount(options.times)\n  const baseDelay = validateDelay(\"baseDelay\", options.baseDelay)\n\n  const factor = options.factor ?? 2\n  validatePositiveFinite(\"factor\", factor)\n\n  let maxDelay: number | undefined\n  if (options.maxDelay !== undefined) {\n    maxDelay = validateDelay(\"maxDelay\", options.maxDelay)\n  }\n\n  return makeAsyncSchedule(options.times, (retryAttempt) => {\n    const delay = baseDelay * Math.pow(factor, retryAttempt - 1)\n    return maxDelay === undefined ? delay : Math.min(delay, maxDelay)\n  })\n}\n"],"mappings":"0UAiGa,EAAb,cAAoDA,EAAiB,iCAAiC,AAGnG,GAiBU,EAAb,cAA+CA,EAAiB,4BAA4B,AAKzF,GAgBU,EAAb,cAAgDA,EAAiB,6BAA6B,AAG3F,GA8BH,MAAM,EAAsB,GAAkB,CAC5C,GAAI,CAAC,OAAO,UAAU,EAAM,EAAI,EAAQ,EACtC,MAAM,IAAI,EAA+B,CACvC,MAAO,EACP,QAAS,2DAA2D,OAAO,EAAM,GAClF,CAAC,EAIA,GAAiB,EAA2C,IAAkC,CAClG,IAAM,EAAaC,EAAc,EAAM,CACvC,GAAIC,EAAa,EAAW,CAC1B,MAAM,IAAI,EAA0B,CAClC,QACA,QACA,QAAS,EAAW,MAAM,QAC1B,MAAO,EAAW,MACnB,CAAC,CAGJ,IAAM,EAASC,EAAkB,EAAW,MAAM,CAClD,GAAI,CAAC,OAAO,SAAS,EAAO,EAAI,EAAS,EACvC,MAAM,IAAI,EAA0B,CAClC,QACA,QACA,QAAS,YAAY,EAAM,2CAA2C,OAAO,EAAO,GACrF,CAAC,CAGJ,OAAO,GAGH,GAA0B,EAAgB,IAAkB,CAChE,GAAI,CAAC,OAAO,SAAS,EAAM,EAAI,GAAS,EACtC,MAAM,IAAI,EAA2B,CACnC,MAAO,EACP,QAAS,YAAY,EAAK,0CAA0C,OAAO,EAAM,GAClF,CAAC,EAIA,GACJ,EACA,KACuB,CACvB,KAAM,gBACN,MAAO,GACP,aACA,kBACD,EAEK,GACJ,EACA,KACwB,CACxB,KAAM,gBACN,MAAO,GACP,aACA,kBACD,EAcY,EAAU,IACrB,EAAmB,EAAM,CAClB,EAAiB,MAAa,EAAE,EAe5B,EAAS,GAAsD,CAC1E,EAAmB,EAAQ,MAAM,CACjC,IAAM,EAAQ,EAAc,QAAS,EAAQ,MAAM,CACnD,OAAO,EAAkB,EAAQ,UAAa,EAAM,EAgBzC,EAAe,GAA4D,CACtF,EAAmB,EAAQ,MAAM,CACjC,IAAM,EAAY,EAAc,YAAa,EAAQ,UAAU,CAEzD,EAAS,EAAQ,QAAU,EACjC,EAAuB,SAAU,EAAO,CAExC,IAAI,EAKJ,OAJI,EAAQ,WAAa,IAAA,KACvB,EAAW,EAAc,WAAY,EAAQ,SAAS,EAGjD,EAAkB,EAAQ,MAAQ,GAAiB,CACxD,IAAM,EAAQ,EAAqB,IAAQ,EAAe,GAC1D,OAAO,IAAa,IAAA,GAAY,EAAQ,KAAK,IAAI,EAAO,EAAS,EACjE"}
+{"version":3,"file":"schedule-ChcIgvd5.mjs","names":["Data.TaggedError","Duration.from","Result.isErr","Duration.toMillis"],"sources":["../src/schedule/schedule.ts"],"sourcesContent":["/**\n * Retry schedule constructors used by `Fx.retry`.\n *\n * **Mental model**\n * - A schedule defines retry count and per-attempt delay.\n * - Sync schedules have no async delay requirements.\n *\n * **Common tasks**\n * - Use `Schedule.recurs` for immediate retries.\n * - Use `Schedule.fixed` for constant-delay retries.\n * - Use `Schedule.exponential` for backoff.\n *\n * **Gotchas**\n * - `times` is the number of retries after the first attempt.\n * - Delay values must normalize to finite, non-negative milliseconds.\n *\n * **Quickstart**\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.recurs(2)\n * const delay = schedule.delayForAttempt(1)\n * // => 0\n * ```\n *\n * @module\n */\n/* oxlint-disable eslint/max-classes-per-file -- TaggedError classes are exported alongside schedule constructors by design. */\nimport { Data } from \"../data\"\nimport { Duration } from \"../duration\"\nimport { Result } from \"../result\"\n/**\n * Retry schedule used by Fx.retry.\n *\n * A schedule defines:\n * - how many retries are allowed after the first attempt\n * - how long to wait before each retry attempt\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type RetrySchedule = SyncRetrySchedule | AsyncRetrySchedule\n\n/**\n * Schedule that never introduces async delays.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type SyncRetrySchedule = {\n  readonly _tag: \"RetrySchedule\"\n  readonly _sync: true\n  readonly maxRetries: number\n  readonly delayForAttempt: (retryAttempt: number) => number\n}\n\n/**\n * Schedule that may delay retries, requiring async execution.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * type Example = typeof Schedule\n * ```\n */\nexport type AsyncRetrySchedule = {\n  readonly _tag: \"RetrySchedule\"\n  readonly _sync: false\n  readonly maxRetries: number\n  readonly delayForAttempt: (retryAttempt: number) => number\n}\n\n/**\n * Tagged error for invalid retry counts.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidRetryCountError({\n *   input: -1,\n *   message: \"Schedule retry count must be an integer >= 0, received: -1\",\n * })\n * // => error._tag === \"ScheduleInvalidRetryCountError\"\n * ```\n */\nexport class ScheduleInvalidRetryCountError extends Data.TaggedError(\"ScheduleInvalidRetryCountError\")<{\n  input: number\n  message: string\n}> {}\n\n/**\n * Tagged error for invalid schedule delay inputs.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidDelayError({\n *   field: \"delay\",\n *   input: \"oops\",\n *   message: \"Invalid duration string: oops\",\n * })\n * // => error._tag === \"ScheduleInvalidDelayError\"\n * ```\n */\nexport class ScheduleInvalidDelayError extends Data.TaggedError(\"ScheduleInvalidDelayError\")<{\n  field: \"delay\" | \"baseDelay\" | \"maxDelay\"\n  input: Duration.Input\n  message: string\n  cause?: Duration.InputError\n}> {}\n\n/**\n * Tagged error for invalid exponential factors.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const error = new Schedule.ScheduleInvalidFactorError({\n *   input: 0,\n *   message: \"Schedule factor must be a finite number > 0, received: 0\",\n * })\n * // => error._tag === \"ScheduleInvalidFactorError\"\n * ```\n */\nexport class ScheduleInvalidFactorError extends Data.TaggedError(\"ScheduleInvalidFactorError\")<{\n  input: number\n  message: string\n}> {}\n\ntype FixedScheduleOptions = {\n  readonly times: number\n  /**\n   * The delay for the fixed schedule.\n   * in milliseconds.\n   */\n  readonly delay: Duration.Input\n}\n\ntype ExponentialScheduleOptions = {\n  readonly times: number\n  /**\n   * The base delay for the exponential schedule.\n   * in milliseconds.\n   */\n  readonly baseDelay: Duration.Input\n  /**\n   * The factor for the exponential schedule.\n   * Default: 2\n   */\n  readonly factor?: number | undefined\n  /**\n   * The maximum delay for the exponential schedule.\n   * in milliseconds.\n   */\n  readonly maxDelay?: Duration.Input | undefined\n}\n\nconst validateRetryCount = (times: number) => {\n  if (!Number.isInteger(times) || times < 0) {\n    throw new ScheduleInvalidRetryCountError({\n      input: times,\n      message: `Schedule retry count must be an integer >= 0, received: ${String(times)}`,\n    })\n  }\n}\n\nconst validateDelay = (field: \"delay\" | \"baseDelay\" | \"maxDelay\", input: Duration.Input): number => {\n  const normalized = Duration.from(input)\n  if (Result.isErr(normalized)) {\n    throw new ScheduleInvalidDelayError({\n      field,\n      input,\n      message: normalized.error.message,\n      cause: normalized.error,\n    })\n  }\n\n  const millis = Duration.toMillis(normalized.value)\n  if (!Number.isFinite(millis) || millis < 0) {\n    throw new ScheduleInvalidDelayError({\n      field,\n      input,\n      message: `Schedule ${field} must be a finite number >= 0, received: ${String(millis)}`,\n    })\n  }\n\n  return millis\n}\n\nconst validatePositiveFinite = (name: \"factor\", value: number) => {\n  if (!Number.isFinite(value) || value <= 0) {\n    throw new ScheduleInvalidFactorError({\n      input: value,\n      message: `Schedule ${name} must be a finite number > 0, received: ${String(value)}`,\n    })\n  }\n}\n\nconst makeSyncSchedule = (\n  maxRetries: number,\n  delayForAttempt: (retryAttempt: number) => number,\n): SyncRetrySchedule => ({\n  _tag: \"RetrySchedule\",\n  _sync: true,\n  maxRetries,\n  delayForAttempt,\n})\n\nconst makeAsyncSchedule = (\n  maxRetries: number,\n  delayForAttempt: (retryAttempt: number) => number,\n): AsyncRetrySchedule => ({\n  _tag: \"RetrySchedule\",\n  _sync: false,\n  maxRetries,\n  delayForAttempt,\n})\n\n/**\n * Retry immediately up to `times` times.\n *\n * @example\n * ```ts\n * import { Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.recurs(2)\n * const delay = schedule.delayForAttempt(1)\n * // => 0\n * ```\n */\nexport const recurs = (times: number): SyncRetrySchedule => {\n  validateRetryCount(times)\n  return makeSyncSchedule(times, () => 0)\n}\n\n/**\n * Retry with a fixed delay between attempts.\n *\n * @example\n * ```ts\n * import { Duration, Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.fixed({ times: 2, delay: Duration.millis(100) })\n * const delay = schedule.delayForAttempt(2)\n * // => 100\n * ```\n */\nexport const fixed = (options: FixedScheduleOptions): AsyncRetrySchedule => {\n  validateRetryCount(options.times)\n  const delay = validateDelay(\"delay\", options.delay)\n  return makeAsyncSchedule(options.times, () => delay)\n}\n\n/**\n * Retry with exponential backoff:\n * `baseDelay * factor^(retryAttempt - 1)`, optionally capped by `maxDelay`.\n *\n * @example\n * ```ts\n * import { Duration, Schedule } from \"@nicolastoulemont/std\"\n *\n * const schedule = Schedule.exponential({ times: 3, baseDelay: Duration.millis(100) })\n * const delay = schedule.delayForAttempt(3)\n * // => 400\n * ```\n */\nexport const exponential = (options: ExponentialScheduleOptions): AsyncRetrySchedule => {\n  validateRetryCount(options.times)\n  const baseDelay = validateDelay(\"baseDelay\", options.baseDelay)\n\n  const factor = options.factor ?? 2\n  validatePositiveFinite(\"factor\", factor)\n\n  let maxDelay: number | undefined\n  if (options.maxDelay !== undefined) {\n    maxDelay = validateDelay(\"maxDelay\", options.maxDelay)\n  }\n\n  return makeAsyncSchedule(options.times, (retryAttempt) => {\n    const delay = baseDelay * Math.pow(factor, retryAttempt - 1)\n    return maxDelay === undefined ? delay : Math.min(delay, maxDelay)\n  })\n}\n"],"mappings":"0UAiGa,EAAb,cAAoDA,EAAiB,iCAAiC,AAGnG,GAiBU,EAAb,cAA+CA,EAAiB,4BAA4B,AAKzF,GAgBU,EAAb,cAAgDA,EAAiB,6BAA6B,AAG3F,GA8BH,MAAM,EAAsB,GAAkB,CAC5C,GAAI,CAAC,OAAO,UAAU,EAAM,EAAI,EAAQ,EACtC,MAAM,IAAI,EAA+B,CACvC,MAAO,EACP,QAAS,2DAA2D,OAAO,EAAM,GAClF,CAAC,EAIA,GAAiB,EAA2C,IAAkC,CAClG,IAAM,EAAaC,EAAc,EAAM,CACvC,GAAIC,EAAa,EAAW,CAC1B,MAAM,IAAI,EAA0B,CAClC,QACA,QACA,QAAS,EAAW,MAAM,QAC1B,MAAO,EAAW,MACnB,CAAC,CAGJ,IAAM,EAASC,EAAkB,EAAW,MAAM,CAClD,GAAI,CAAC,OAAO,SAAS,EAAO,EAAI,EAAS,EACvC,MAAM,IAAI,EAA0B,CAClC,QACA,QACA,QAAS,YAAY,EAAM,2CAA2C,OAAO,EAAO,GACrF,CAAC,CAGJ,OAAO,GAGH,GAA0B,EAAgB,IAAkB,CAChE,GAAI,CAAC,OAAO,SAAS,EAAM,EAAI,GAAS,EACtC,MAAM,IAAI,EAA2B,CACnC,MAAO,EACP,QAAS,YAAY,EAAK,0CAA0C,OAAO,EAAM,GAClF,CAAC,EAIA,GACJ,EACA,KACuB,CACvB,KAAM,gBACN,MAAO,GACP,aACA,kBACD,EAEK,GACJ,EACA,KACwB,CACxB,KAAM,gBACN,MAAO,GACP,aACA,kBACD,EAcY,EAAU,IACrB,EAAmB,EAAM,CAClB,EAAiB,MAAa,EAAE,EAe5B,EAAS,GAAsD,CAC1E,EAAmB,EAAQ,MAAM,CACjC,IAAM,EAAQ,EAAc,QAAS,EAAQ,MAAM,CACnD,OAAO,EAAkB,EAAQ,UAAa,EAAM,EAgBzC,EAAe,GAA4D,CACtF,EAAmB,EAAQ,MAAM,CACjC,IAAM,EAAY,EAAc,YAAa,EAAQ,UAAU,CAEzD,EAAS,EAAQ,QAAU,EACjC,EAAuB,SAAU,EAAO,CAExC,IAAI,EAKJ,OAJI,EAAQ,WAAa,IAAA,KACvB,EAAW,EAAc,WAAY,EAAQ,SAAS,EAGjD,EAAkB,EAAQ,MAAQ,GAAiB,CACxD,IAAM,EAAQ,EAAqB,IAAQ,EAAe,GAC1D,OAAO,IAAa,IAAA,GAAY,EAAQ,KAAK,IAAI,EAAO,EAAS,EACjE"}

package/dist/{schedule-BzPjvMXc.d.mts → schedule-ap6y014J.d.mts}

@@ -1,5 +1,5 @@
-import { n as TaggedErrorFactory } from "./index-D6pjHqlK.mjs";
-import { n as InputError, t as Input } from "./index-DfAqfnY0.mjs";
+import { n as TaggedErrorFactory } from "./index-lYxaV6H7.mjs";
+import { n as InputError, t as Input } from "./index-BJiD1-T_.mjs";
 
 //#region src/schedule/schedule.d.ts
 declare namespace schedule_d_exports {
@@ -180,4 +180,4 @@ declare const fixed: (options: FixedScheduleOptions) => AsyncRetrySchedule;
 declare const exponential: (options: ExponentialScheduleOptions) => AsyncRetrySchedule;
 //#endregion
 export { SyncRetrySchedule as n, schedule_d_exports as r, RetrySchedule as t };
-//# sourceMappingURL=schedule-BzPjvMXc.d.mts.map
+//# sourceMappingURL=schedule-ap6y014J.d.mts.map

package/dist/{schedule-BzPjvMXc.d.mts.map → schedule-ap6y014J.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"schedule-BzPjvMXc.d.mts","names":[],"sources":["../src/schedule/schedule.ts"],"sourcesContent":[],"mappings":";;;;;;;AAoPA;AAiBA;AAmBA;;;;;;;;;;;;KAzOY,aAAA,GAAgB,oBAAoB;;;;;;;;;;;KAYpC,iBAAA;;;;;;;;;;;;;;;;KAiBA,kBAAA;;;;;;cAKX,qCAAA;;;;;;;;;;;;;;;cAgBY,8BAAA,SAAuC;;;;cAG/C,gCAAA;;;;;;;;;;;;;;;;cAiBQ,yBAAA,SAAkC;;SAEtC;;UAEC;;cACL,iCAAA;;;;;;;;;;;;;;;cAgBQ,0BAAA,SAAmC;;;;KAK3C,oBAAA;;;;;;kBAMa;;KAGb,0BAAA;;;;;;sBAMiB;;;;;;;;;;sBAUA;;;;;;;;;;;;;;cA4ET,2BAA0B;;;;;;;;;;;;;cAiB1B,iBAAkB,yBAAuB;;;;;;;;;;;;;;cAmBzC,uBAAwB,+BAA6B"}
+{"version":3,"file":"schedule-ap6y014J.d.mts","names":[],"sources":["../src/schedule/schedule.ts"],"sourcesContent":[],"mappings":";;;;;;;AAoPA;AAiBA;AAmBA;;;;;;;;;;;;KAzOY,aAAA,GAAgB,oBAAoB;;;;;;;;;;;KAYpC,iBAAA;;;;;;;;;;;;;;;;KAiBA,kBAAA;;;;;;cAKX,qCAAA;;;;;;;;;;;;;;;cAgBY,8BAAA,SAAuC;;;;cAG/C,gCAAA;;;;;;;;;;;;;;;;cAiBQ,yBAAA,SAAkC;;SAEtC;;UAEC;;cACL,iCAAA;;;;;;;;;;;;;;;cAgBQ,0BAAA,SAAmC;;;;KAK3C,oBAAA;;;;;;kBAMa;;KAGb,0BAAA;;;;;;sBAMiB;;;;;;;;;;sBAUA;;;;;;;;;;;;;;cA4ET,2BAA0B;;;;;;;;;;;;;cAiB1B,iBAAkB,yBAAuB;;;;;;;;;;;;;;cAmBzC,uBAAwB,+BAA6B"}

package/dist/schema/index.d.mts

@@ -1,2 +1,2 @@
-import { t as schema_d_exports } from "../index-BipW0MC3.mjs";
+import { t as schema_d_exports } from "../index-DzGXoCV1.mjs";
 export { schema_d_exports as Schema };