@smthrs/flow 0.0.0-stage → 1.0.0-rc.13

package/dist/cjs/Action/retry.js

@@ -0,0 +1,75 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var retry_exports = {};
+__export(retry_exports, {
+  retry: () => retry
+});
+module.exports = __toCommonJS(retry_exports);
+var Effect = __toESM(require("effect/Effect"), 1);
+var import_Function = require("effect/Function");
+var import_Context = require("./Context.js");
+const retry = (0, import_Function.dual)(
+  2,
+  (effect, options) => Effect.gen(function* () {
+    const enclosing = yield* import_Context.CurrentOrdinal;
+    const slot = {
+      values: enclosing?.values ?? /* @__PURE__ */ new Map(),
+      cursors: new Map(enclosing?.cursors)
+    };
+    const entryCursors = new Map(slot.cursors);
+    let attempt = 1;
+    return yield* Effect.suspend(() => {
+      slot.cursors.clear();
+      for (const [scope, cursor] of entryCursors) {
+        slot.cursors.set(scope, cursor);
+      }
+      return effect.pipe(
+        Effect.provideService(import_Context.CurrentAttempt, attempt++),
+        Effect.provideService(import_Context.CurrentOrdinal, slot)
+      );
+    }).pipe(
+      Effect.retry(options),
+      // On exit, fold this block's final cursor positions back into the
+      // enclosing block's view (max-merge, so a concurrent sibling's later
+      // propagation never rewinds a scope): an enclosing dispatch of a
+      // scope this block consumed must take the next pinned position, not
+      // re-consume this block's ordinals.
+      Effect.onExit(
+        () => Effect.sync(() => {
+          if (enclosing === void 0) return;
+          for (const [scope, cursor] of slot.cursors) {
+            const current = enclosing.cursors.get(scope) ?? 0;
+            if (cursor > current) enclosing.cursors.set(scope, cursor);
+          }
+        })
+      )
+    );
+  })
+);
+//# sourceMappingURL=retry.js.map

package/dist/cjs/Action/retry.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/Action/retry.ts"],
+  "sourcesContent": ["// Deep reviewed and polished by a human on 2026-08-10.\n\n/**\n * Retries effects while preserving durable action identity.\n *\n * @since 0.1.0\n */\n\nimport * as Effect from \"effect/Effect\"\nimport { dual } from \"effect/Function\"\nimport type * as Types from \"effect/Types\"\nimport { CurrentAttempt, CurrentOrdinal, type OrdinalSlot } from \"./Context.ts\"\n\n/**\n * Retries an effect with `Effect.retry` while updating `CurrentAttempt` for\n * each attempt.\n *\n * @category error handling\n * @since 0.1.0\n */\nexport const retry: {\n  <E, O extends Types.NoExcessProperties<Omit<Effect.Retry.Options<E>, \"schedule\">, O>>(\n    options: O\n  ): <A, R>(self: Effect.Effect<A, E, R>) => Effect.Retry.Return<R, E, A, O>\n  <A, E, R, O extends Types.NoExcessProperties<Omit<Effect.Retry.Options<E>, \"schedule\">, O>>(\n    self: Effect.Effect<A, E, R>,\n    options: O\n  ): Effect.Retry.Return<R, E, A, O>\n} = dual(\n  2,\n  (effect: Effect.Effect<any, any, any>, options: object) =>\n    Effect.gen(function*() {\n      // A nested retry block shares the enclosing block's slot instead of\n      // shadowing it with a fresh one (issue #108): a per-invocation slot was\n      // rebuilt on every outer attempt, discarding the pinned `values`, so a\n      // completed irreversible inner dispatch drew a brand-new ordinal \u2014 a\n      // new step key \u2014 and re-executed instead of replaying. Sharing the\n      // outermost slot keeps every pin alive for the whole outer sequence.\n      const enclosing = yield* CurrentOrdinal\n      // One `values` map for the whole retry sequence: the engine fills each\n      // action's scope with the ordinal it allocates on the first attempt,\n      // and every later attempt of the same sequence reuses those ordinals\n      // (issues #73, #84). The `cursors` map, however, is *per block*\n      // (issue #116): #108 shared the enclosing block's mutable cursor map\n      // wholesale, so a sibling block's attempt boundary \u2014 sanctioned to run\n      // concurrently under keyed overlap (issue #111) \u2014 cleared every\n      // scope's cursor and rewound another block's mid-flight dispatch onto\n      // an already-consumed pinned ordinal, a duplicate step key. Each block\n      // now owns a private cursor view seeded from the enclosing block's\n      // cursors at entry, so its attempt boundaries reset only its own view.\n      const slot: OrdinalSlot = {\n        values: enclosing?.values ?? new Map(),\n        cursors: new Map(enclosing?.cursors)\n      }\n      // Where each scope's dispatch cursor stood when this block was entered.\n      // An inner attempt replays the block from its own first dispatch, not\n      // from the outer attempt's start, so its cursors rewind to the block\n      // entry rather than to zero (issues #100, #108). At the top level the\n      // snapshot is empty and rewinding degenerates to a plain reset.\n      const entryCursors = new Map(slot.cursors)\n      let attempt = 1\n      return yield* Effect.suspend(() => {\n        // Every attempt replays the block from its first dispatch, so the\n        // per-scope dispatch cursors restart with it (issue #100); the pinned\n        // ordinal sequences in `values` persist across attempts.\n        slot.cursors.clear()\n        for (const [scope, cursor] of entryCursors) {\n          slot.cursors.set(scope, cursor)\n        }\n        return effect.pipe(\n          Effect.provideService(CurrentAttempt, attempt++),\n          Effect.provideService(CurrentOrdinal, slot)\n        )\n      }).pipe(\n        Effect.retry(options),\n        // On exit, fold this block's final cursor positions back into the\n        // enclosing block's view (max-merge, so a concurrent sibling's later\n        // propagation never rewinds a scope): an enclosing dispatch of a\n        // scope this block consumed must take the next pinned position, not\n        // re-consume this block's ordinals.\n        Effect.onExit(() =>\n          Effect.sync(() => {\n            if (enclosing === undefined) return\n            for (const [scope, cursor] of slot.cursors) {\n              const current = enclosing.cursors.get(scope) ?? 0\n              if (cursor > current) enclosing.cursors.set(scope, cursor)\n            }\n          })\n        )\n      )\n    })\n)\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAQA,aAAwB;AACxB,sBAAqB;AAErB,qBAAiE;AAS1D,MAAM,YAQT;AAAA,EACF;AAAA,EACA,CAAC,QAAsC,YACrC,OAAO,IAAI,aAAY;AAOrB,UAAM,YAAY,OAAO;AAYzB,UAAM,OAAoB;AAAA,MACxB,QAAQ,WAAW,UAAU,oBAAI,IAAI;AAAA,MACrC,SAAS,IAAI,IAAI,WAAW,OAAO;AAAA,IACrC;AAMA,UAAM,eAAe,IAAI,IAAI,KAAK,OAAO;AACzC,QAAI,UAAU;AACd,WAAO,OAAO,OAAO,QAAQ,MAAM;AAIjC,WAAK,QAAQ,MAAM;AACnB,iBAAW,CAAC,OAAO,MAAM,KAAK,cAAc;AAC1C,aAAK,QAAQ,IAAI,OAAO,MAAM;AAAA,MAChC;AACA,aAAO,OAAO;AAAA,QACZ,OAAO,eAAe,+BAAgB,SAAS;AAAA,QAC/C,OAAO,eAAe,+BAAgB,IAAI;AAAA,MAC5C;AAAA,IACF,CAAC,EAAE;AAAA,MACD,OAAO,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMpB,OAAO;AAAA,QAAO,MACZ,OAAO,KAAK,MAAM;AAChB,cAAI,cAAc,OAAW;AAC7B,qBAAW,CAAC,OAAO,MAAM,KAAK,KAAK,SAAS;AAC1C,kBAAM,UAAU,UAAU,QAAQ,IAAI,KAAK,KAAK;AAChD,gBAAI,SAAS,QAAS,WAAU,QAAQ,IAAI,OAAO,MAAM;AAAA,UAC3D;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC;AACL;",
+  "names": []
+}

package/dist/cjs/Deadline.d.ts

@@ -0,0 +1,110 @@
+/**
+ * The wall-clock bound one run of a flow settles by.
+ *
+ * A deadline counts from the run's FIRST start, which is journaled, so it
+ * survives park, resume and process death: a restarted engine honors the
+ * original deadline instead of starting a new one. A trampoline lineage is one
+ * run, so its rounds share one deadline: the round that hands off stamps the
+ * lineage's start and bound on the {@link module:Result.Handoff}, and the next
+ * round runs under that stamp rather than starting a clock of its own. Like
+ * `maxRounds`, the bound belongs to the lineage originator; a handoff target
+ * cannot reset or replace it.
+ *
+ * The engine applies {@link bound} to every execution of a flow that declares
+ * `Flow.make(tag, { deadline })`. A control plane applies it inside a run body
+ * to bound a run by an approved envelope's deadline. Both settle an expired
+ * run with the same {@link module:DeadlineExceeded.DeadlineExceeded} defect.
+ *
+ * @since 1.0.0
+ */
+import type * as Crypto from "effect/Crypto";
+import * as Duration from "effect/Duration";
+import * as Effect from "effect/Effect";
+import { type LineageDeadline } from "./Flow/Result.ts";
+import { FlowInstance } from "./FlowRuntime/FlowInstance.ts";
+import { FlowRuntime } from "./FlowRuntime/FlowRuntime.ts";
+/**
+ * Starts the current execution's deadline: the lineage deadline this round
+ * inherited from a handoff, or `deadline` counted from the execution's
+ * journaled first start, or from `startedAtMs` when the host supplies a
+ * durable start of its own. Answers `undefined` when neither applies, which is
+ * an unbounded execution.
+ *
+ * **Details**
+ *
+ * The first start is a sealed action, so every later drive of the execution,
+ * on this engine or one that resumes it after a restart, reads the same
+ * origin. A durable clock is armed at the deadline so a parked execution is
+ * driven again when it passes; the clock keeps the due time it was first armed
+ * with, so arming it on every drive is idempotent.
+ *
+ * **Gotchas**
+ *
+ * Start at most one deadline per execution, before any other dispatch that a
+ * replay must line up with: the origin and the clock are addressed by fixed
+ * names within the execution.
+ *
+ * A deadline that is not a positive finite duration, a `startedAtMs` that is
+ * not finite, or a bound that would expire after epoch millisecond
+ * `Number.MAX_SAFE_INTEGER` dies with a `RangeError`: a durable store records
+ * the clock's due time as a safe integer.
+ *
+ * @category constructors
+ * @since 1.0.0
+ */
+export declare const start: (options: {
+    /** The flow the refusal names. */
+    readonly flowName: string;
+    /** The bound; a positive finite duration. Absent means unbounded. */
+    readonly deadline?: Duration.Input | undefined;
+    /**
+     * Where the bound counts from, when the host already holds a durable
+     * start of its own, such as the time a control plane accepted the run.
+     * Absent, the execution's first start is journaled and read back.
+     */
+    readonly startedAtMs?: number | undefined;
+}) => Effect.Effect<LineageDeadline | undefined, never, FlowRuntime | FlowInstance | Crypto.Crypto>;
+/**
+ * The whole milliseconds left before `deadline` passes, as the durable clock
+ * row stores its due time; zero or less once it has passed.
+ *
+ * @category getters
+ * @since 1.0.0
+ */
+export declare const remainingMs: (deadline: LineageDeadline) => Effect.Effect<number>;
+/**
+ * Runs `body` within a started deadline.
+ *
+ * A body that starts at or past the deadline settles at once, and one that
+ * starts before it races the time remaining in this fiber, so a running
+ * execution is stopped too. Both settle with the same `DeadlineExceeded`
+ * defect. The race is `raceFirst`: a body that parks exits first, so parking
+ * still parks. A round that hands off stamps the deadline on its handoff, so
+ * the next round of the lineage runs under it. An `undefined` deadline runs
+ * `body` unbounded.
+ *
+ * @category combinators
+ * @since 1.0.0
+ */
+export declare const within: (deadline: LineageDeadline | undefined, flowName: string) => <A, E, R>(body: Effect.Effect<A, E, R>) => Effect.Effect<A, E, R | FlowInstance>;
+/**
+ * Bounds the current execution by `deadline`, counted from its journaled first
+ * start, or by the lineage deadline this round inherited from a handoff:
+ * {@link start}, then {@link within}.
+ *
+ * A round that inherited a lineage deadline runs under it whatever it
+ * declares, so every round of a lineage expires at the originator's time. With
+ * no inherited deadline and `deadline` absent, the body runs unbounded.
+ *
+ * @category combinators
+ * @since 1.0.0
+ */
+export declare const bound: (options: {
+    /** The flow the refusal names. */
+    readonly flowName: string;
+    /** The bound; a positive finite duration. Absent means unbounded. */
+    readonly deadline?: Duration.Input | undefined;
+    /** Where the bound counts from; see {@link start}. */
+    readonly startedAtMs?: number | undefined;
+}) => <A, E, R>(body: Effect.Effect<A, E, R>) => Effect.Effect<A, E, R | FlowRuntime | FlowInstance | Crypto.Crypto>;
+//# sourceMappingURL=Deadline.d.ts.map

package/dist/cjs/Deadline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Deadline.d.ts","sourceRoot":"","sources":["../../src/Deadline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAA;AAC5C,OAAO,KAAK,QAAQ,MAAM,iBAAiB,CAAA;AAC3C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAMvC,OAAO,EAAW,KAAK,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAA;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAA;AAgB1D;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,KAAK,GAAI,SAAS;IAC7B,kCAAkC;IAClC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,KAAK,GAAG,SAAS,CAAA;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAC1C,KAAG,MAAM,CAAC,MAAM,CAAC,eAAe,GAAG,SAAS,EAAE,KAAK,EAAE,WAAW,GAAG,YAAY,GAAG,MAAM,CAAC,MAAM,CAoC5F,CAAA;AAEJ;;;;;;GAMG;AACH,eAAO,MAAM,WAAW,GAAI,UAAU,eAAe,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAC+B,CAAA;AAE3G;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,MAAM,GAChB,UAAU,eAAe,GAAG,SAAS,EAAE,UAAU,MAAM,MACvD,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,YAAY,CAwBzE,CAAA;AAEN;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,KAAK,GAAI,SAAS;IAC7B,kCAAkC;IAClC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,KAAK,GAAG,SAAS,CAAA;IAC9C,sDAAsD;IACtD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAC1C,MACA,CAAC,EAAE,CAAC,EAAE,CAAC,EACN,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,YAAY,GAAG,MAAM,CAAC,MAAM,CACmB,CAAA"}

package/dist/cjs/Deadline.js

@@ -0,0 +1,112 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var Deadline_exports = {};
+__export(Deadline_exports, {
+  bound: () => bound,
+  remainingMs: () => remainingMs,
+  start: () => start,
+  within: () => within
+});
+module.exports = __toCommonJS(Deadline_exports);
+var Clock = __toESM(require("effect/Clock"), 1);
+var Duration = __toESM(require("effect/Duration"), 1);
+var Effect = __toESM(require("effect/Effect"), 1);
+var Option = __toESM(require("effect/Option"), 1);
+var Schema = __toESM(require("effect/Schema"), 1);
+var Action = __toESM(require("./Action/index.js"), 1);
+var DurableClock = __toESM(require("./DurableClock.js"), 1);
+var import_DeadlineExceeded = require("./Flow/DeadlineExceeded.js");
+var import_Result = require("./Flow/Result.js");
+var import_FlowInstance = require("./FlowRuntime/FlowInstance.js");
+var import_FlowRuntime = require("./FlowRuntime/FlowRuntime.js");
+const origin = Action.make({
+  name: "@smthrs/engine/deadline-origin",
+  tier: "sealed",
+  success: Schema.Number,
+  execute: Clock.currentTimeMillis.pipe(Effect.map(Math.floor))
+});
+const start = (options) => Effect.gen(function* () {
+  const instance = yield* import_FlowInstance.FlowInstance;
+  let lineage = instance.lineageDeadline;
+  if (lineage === void 0) {
+    if (options.deadline === void 0) return void 0;
+    const deadlineMs = Option.match(Duration.fromInput(options.deadline), {
+      onNone: () => Number.NaN,
+      onSome: Duration.toMillis
+    });
+    if (!Number.isFinite(deadlineMs) || deadlineMs <= 0) {
+      return yield* Effect.die(
+        new RangeError(`Deadline.start: "${options.flowName}" deadline must be a positive finite duration`)
+      );
+    }
+    const startedAtMs = options.startedAtMs ?? (yield* origin);
+    if (!Number.isFinite(startedAtMs) || startedAtMs + deadlineMs > Number.MAX_SAFE_INTEGER) {
+      return yield* Effect.die(
+        new RangeError(
+          `Deadline.start: "${options.flowName}" deadline must expire by epoch millisecond ${Number.MAX_SAFE_INTEGER}, and a ${deadlineMs} ms deadline from ${startedAtMs} does not`
+        )
+      );
+    }
+    lineage = { startedAtMs, deadlineMs };
+  }
+  const remaining = yield* remainingMs(lineage);
+  if (remaining > 0) {
+    yield* (yield* import_FlowRuntime.FlowRuntime).scheduleClock(instance.flow, {
+      executionId: instance.executionId,
+      clock: DurableClock.make({ name: "@smthrs/engine/deadline", duration: remaining })
+    });
+  }
+  return lineage;
+});
+const remainingMs = (deadline) => Effect.map(Clock.currentTimeMillis, (now) => Math.ceil(deadline.startedAtMs + deadline.deadlineMs - now));
+const within = (deadline, flowName) => (body) => deadline === void 0 ? body : Effect.gen(function* () {
+  const instance = yield* import_FlowInstance.FlowInstance;
+  const expired = new import_DeadlineExceeded.DeadlineExceeded({
+    flowName,
+    executionId: instance.executionId,
+    deadlineMs: deadline.deadlineMs,
+    startedAtMs: deadline.startedAtMs,
+    message: `${flowName} execution ${instance.executionId} ran past its ${deadline.deadlineMs} ms deadline, counted from its start at ${new Date(deadline.startedAtMs).toISOString()}`
+  });
+  const remaining = yield* remainingMs(deadline);
+  if (remaining <= 0) return yield* Effect.die(expired);
+  const value = yield* Effect.raceFirst(body, Effect.andThen(Effect.sleep(remaining), Effect.die(expired)));
+  const handoff = instance.handoff;
+  if (handoff !== void 0 && handoff.deadline === void 0) {
+    instance.handoff = new import_Result.Handoff({
+      flow: handoff.flow,
+      payload: handoff.payload,
+      ...handoff.capabilityCeilings === void 0 ? {} : { capabilityCeilings: handoff.capabilityCeilings },
+      deadline
+    });
+  }
+  return value;
+});
+const bound = (options) => (body) => Effect.flatMap(start(options), (deadline) => within(deadline, options.flowName)(body));
+//# sourceMappingURL=Deadline.js.map

package/dist/cjs/Deadline.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/Deadline.ts"],
+  "sourcesContent": ["/**\n * The wall-clock bound one run of a flow settles by.\n *\n * A deadline counts from the run's FIRST start, which is journaled, so it\n * survives park, resume and process death: a restarted engine honors the\n * original deadline instead of starting a new one. A trampoline lineage is one\n * run, so its rounds share one deadline: the round that hands off stamps the\n * lineage's start and bound on the {@link module:Result.Handoff}, and the next\n * round runs under that stamp rather than starting a clock of its own. Like\n * `maxRounds`, the bound belongs to the lineage originator; a handoff target\n * cannot reset or replace it.\n *\n * The engine applies {@link bound} to every execution of a flow that declares\n * `Flow.make(tag, { deadline })`. A control plane applies it inside a run body\n * to bound a run by an approved envelope's deadline. Both settle an expired\n * run with the same {@link module:DeadlineExceeded.DeadlineExceeded} defect.\n *\n * @since 1.0.0\n */\n\nimport * as Clock from \"effect/Clock\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Duration from \"effect/Duration\"\nimport * as Effect from \"effect/Effect\"\nimport * as Option from \"effect/Option\"\nimport * as Schema from \"effect/Schema\"\nimport * as Action from \"./Action/index.ts\"\nimport * as DurableClock from \"./DurableClock.ts\"\nimport { DeadlineExceeded } from \"./Flow/DeadlineExceeded.ts\"\nimport { Handoff, type LineageDeadline } from \"./Flow/Result.ts\"\nimport { FlowInstance } from \"./FlowRuntime/FlowInstance.ts\"\nimport { FlowRuntime } from \"./FlowRuntime/FlowRuntime.ts\"\n\n/**\n * The execution's first start, journaled once.\n *\n * A sealed action's result is recorded with its attempt and replayed on every\n * later drive, so the origin a deadline counts from is the time the execution\n * first ran, on this engine or on the one that resumes it after a restart.\n */\nconst origin = Action.make({\n  name: \"@smthrs/engine/deadline-origin\",\n  tier: \"sealed\",\n  success: Schema.Number,\n  execute: Clock.currentTimeMillis.pipe(Effect.map(Math.floor))\n})\n\n/**\n * Starts the current execution's deadline: the lineage deadline this round\n * inherited from a handoff, or `deadline` counted from the execution's\n * journaled first start, or from `startedAtMs` when the host supplies a\n * durable start of its own. Answers `undefined` when neither applies, which is\n * an unbounded execution.\n *\n * **Details**\n *\n * The first start is a sealed action, so every later drive of the execution,\n * on this engine or one that resumes it after a restart, reads the same\n * origin. A durable clock is armed at the deadline so a parked execution is\n * driven again when it passes; the clock keeps the due time it was first armed\n * with, so arming it on every drive is idempotent.\n *\n * **Gotchas**\n *\n * Start at most one deadline per execution, before any other dispatch that a\n * replay must line up with: the origin and the clock are addressed by fixed\n * names within the execution.\n *\n * A deadline that is not a positive finite duration, a `startedAtMs` that is\n * not finite, or a bound that would expire after epoch millisecond\n * `Number.MAX_SAFE_INTEGER` dies with a `RangeError`: a durable store records\n * the clock's due time as a safe integer.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const start = (options: {\n  /** The flow the refusal names. */\n  readonly flowName: string\n  /** The bound; a positive finite duration. Absent means unbounded. */\n  readonly deadline?: Duration.Input | undefined\n  /**\n   * Where the bound counts from, when the host already holds a durable\n   * start of its own, such as the time a control plane accepted the run.\n   * Absent, the execution's first start is journaled and read back.\n   */\n  readonly startedAtMs?: number | undefined\n}): Effect.Effect<LineageDeadline | undefined, never, FlowRuntime | FlowInstance | Crypto.Crypto> =>\n  Effect.gen(function*() {\n    const instance = yield* FlowInstance\n    let lineage = instance.lineageDeadline\n    if (lineage === undefined) {\n      if (options.deadline === undefined) return undefined\n      const deadlineMs = Option.match(Duration.fromInput(options.deadline), {\n        onNone: () => Number.NaN,\n        onSome: Duration.toMillis\n      })\n      if (!Number.isFinite(deadlineMs) || deadlineMs <= 0) {\n        return yield* Effect.die(\n          new RangeError(`Deadline.start: \"${options.flowName}\" deadline must be a positive finite duration`)\n        )\n      }\n      const startedAtMs = options.startedAtMs ?? (yield* origin)\n      // The clock armed below is due at `startedAtMs + deadlineMs`, and a\n      // durable store records a due time as a safe integer.\n      if (!Number.isFinite(startedAtMs) || startedAtMs + deadlineMs > Number.MAX_SAFE_INTEGER) {\n        return yield* Effect.die(\n          new RangeError(\n            `Deadline.start: \"${options.flowName}\" deadline must expire by epoch millisecond ` +\n              `${Number.MAX_SAFE_INTEGER}, and a ${deadlineMs} ms deadline from ${startedAtMs} does not`\n          )\n        )\n      }\n      lineage = { startedAtMs, deadlineMs }\n    }\n    const remaining = yield* remainingMs(lineage)\n    if (remaining > 0) {\n      yield* (yield* FlowRuntime).scheduleClock(instance.flow, {\n        executionId: instance.executionId,\n        clock: DurableClock.make({ name: \"@smthrs/engine/deadline\", duration: remaining })\n      })\n    }\n    return lineage\n  })\n\n/**\n * The whole milliseconds left before `deadline` passes, as the durable clock\n * row stores its due time; zero or less once it has passed.\n *\n * @category getters\n * @since 1.0.0\n */\nexport const remainingMs = (deadline: LineageDeadline): Effect.Effect<number> =>\n  Effect.map(Clock.currentTimeMillis, (now) => Math.ceil(deadline.startedAtMs + deadline.deadlineMs - now))\n\n/**\n * Runs `body` within a started deadline.\n *\n * A body that starts at or past the deadline settles at once, and one that\n * starts before it races the time remaining in this fiber, so a running\n * execution is stopped too. Both settle with the same `DeadlineExceeded`\n * defect. The race is `raceFirst`: a body that parks exits first, so parking\n * still parks. A round that hands off stamps the deadline on its handoff, so\n * the next round of the lineage runs under it. An `undefined` deadline runs\n * `body` unbounded.\n *\n * @category combinators\n * @since 1.0.0\n */\nexport const within =\n  (deadline: LineageDeadline | undefined, flowName: string) =>\n  <A, E, R>(body: Effect.Effect<A, E, R>): Effect.Effect<A, E, R | FlowInstance> =>\n    deadline === undefined ? body : Effect.gen(function*() {\n      const instance = yield* FlowInstance\n      const expired = new DeadlineExceeded({\n        flowName,\n        executionId: instance.executionId,\n        deadlineMs: deadline.deadlineMs,\n        startedAtMs: deadline.startedAtMs,\n        message: `${flowName} execution ${instance.executionId} ran past its ${deadline.deadlineMs} ms deadline, ` +\n          `counted from its start at ${new Date(deadline.startedAtMs).toISOString()}`\n      })\n      const remaining = yield* remainingMs(deadline)\n      if (remaining <= 0) return yield* Effect.die(expired)\n      const value = yield* Effect.raceFirst(body, Effect.andThen(Effect.sleep(remaining), Effect.die(expired)))\n      const handoff = instance.handoff\n      if (handoff !== undefined && handoff.deadline === undefined) {\n        instance.handoff = new Handoff({\n          flow: handoff.flow,\n          payload: handoff.payload,\n          ...(handoff.capabilityCeilings === undefined ? {} : { capabilityCeilings: handoff.capabilityCeilings }),\n          deadline\n        })\n      }\n      return value\n    })\n\n/**\n * Bounds the current execution by `deadline`, counted from its journaled first\n * start, or by the lineage deadline this round inherited from a handoff:\n * {@link start}, then {@link within}.\n *\n * A round that inherited a lineage deadline runs under it whatever it\n * declares, so every round of a lineage expires at the originator's time. With\n * no inherited deadline and `deadline` absent, the body runs unbounded.\n *\n * @category combinators\n * @since 1.0.0\n */\nexport const bound = (options: {\n  /** The flow the refusal names. */\n  readonly flowName: string\n  /** The bound; a positive finite duration. Absent means unbounded. */\n  readonly deadline?: Duration.Input | undefined\n  /** Where the bound counts from; see {@link start}. */\n  readonly startedAtMs?: number | undefined\n}) =>\n<A, E, R>(\n  body: Effect.Effect<A, E, R>\n): Effect.Effect<A, E, R | FlowRuntime | FlowInstance | Crypto.Crypto> =>\n  Effect.flatMap(start(options), (deadline) => within(deadline, options.flowName)(body))\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBA,YAAuB;AAEvB,eAA0B;AAC1B,aAAwB;AACxB,aAAwB;AACxB,aAAwB;AACxB,aAAwB;AACxB,mBAA8B;AAC9B,8BAAiC;AACjC,oBAA8C;AAC9C,0BAA6B;AAC7B,yBAA4B;AAS5B,MAAM,SAAS,OAAO,KAAK;AAAA,EACzB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,SAAS,OAAO;AAAA,EAChB,SAAS,MAAM,kBAAkB,KAAK,OAAO,IAAI,KAAK,KAAK,CAAC;AAC9D,CAAC;AA+BM,MAAM,QAAQ,CAAC,YAYpB,OAAO,IAAI,aAAY;AACrB,QAAM,WAAW,OAAO;AACxB,MAAI,UAAU,SAAS;AACvB,MAAI,YAAY,QAAW;AACzB,QAAI,QAAQ,aAAa,OAAW,QAAO;AAC3C,UAAM,aAAa,OAAO,MAAM,SAAS,UAAU,QAAQ,QAAQ,GAAG;AAAA,MACpE,QAAQ,MAAM,OAAO;AAAA,MACrB,QAAQ,SAAS;AAAA,IACnB,CAAC;AACD,QAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,GAAG;AACnD,aAAO,OAAO,OAAO;AAAA,QACnB,IAAI,WAAW,oBAAoB,QAAQ,QAAQ,+CAA+C;AAAA,MACpG;AAAA,IACF;AACA,UAAM,cAAc,QAAQ,gBAAgB,OAAO;AAGnD,QAAI,CAAC,OAAO,SAAS,WAAW,KAAK,cAAc,aAAa,OAAO,kBAAkB;AACvF,aAAO,OAAO,OAAO;AAAA,QACnB,IAAI;AAAA,UACF,oBAAoB,QAAQ,QAAQ,+CAC/B,OAAO,gBAAgB,WAAW,UAAU,qBAAqB,WAAW;AAAA,QACnF;AAAA,MACF;AAAA,IACF;AACA,cAAU,EAAE,aAAa,WAAW;AAAA,EACtC;AACA,QAAM,YAAY,OAAO,YAAY,OAAO;AAC5C,MAAI,YAAY,GAAG;AACjB,YAAQ,OAAO,gCAAa,cAAc,SAAS,MAAM;AAAA,MACvD,aAAa,SAAS;AAAA,MACtB,OAAO,aAAa,KAAK,EAAE,MAAM,2BAA2B,UAAU,UAAU,CAAC;AAAA,IACnF,CAAC;AAAA,EACH;AACA,SAAO;AACT,CAAC;AASI,MAAM,cAAc,CAAC,aAC1B,OAAO,IAAI,MAAM,mBAAmB,CAAC,QAAQ,KAAK,KAAK,SAAS,cAAc,SAAS,aAAa,GAAG,CAAC;AAgBnG,MAAM,SACX,CAAC,UAAuC,aACxC,CAAU,SACR,aAAa,SAAY,OAAO,OAAO,IAAI,aAAY;AACrD,QAAM,WAAW,OAAO;AACxB,QAAM,UAAU,IAAI,yCAAiB;AAAA,IACnC;AAAA,IACA,aAAa,SAAS;AAAA,IACtB,YAAY,SAAS;AAAA,IACrB,aAAa,SAAS;AAAA,IACtB,SAAS,GAAG,QAAQ,cAAc,SAAS,WAAW,iBAAiB,SAAS,UAAU,2CAC3D,IAAI,KAAK,SAAS,WAAW,EAAE,YAAY,CAAC;AAAA,EAC7E,CAAC;AACD,QAAM,YAAY,OAAO,YAAY,QAAQ;AAC7C,MAAI,aAAa,EAAG,QAAO,OAAO,OAAO,IAAI,OAAO;AACpD,QAAM,QAAQ,OAAO,OAAO,UAAU,MAAM,OAAO,QAAQ,OAAO,MAAM,SAAS,GAAG,OAAO,IAAI,OAAO,CAAC,CAAC;AACxG,QAAM,UAAU,SAAS;AACzB,MAAI,YAAY,UAAa,QAAQ,aAAa,QAAW;AAC3D,aAAS,UAAU,IAAI,sBAAQ;AAAA,MAC7B,MAAM,QAAQ;AAAA,MACd,SAAS,QAAQ;AAAA,MACjB,GAAI,QAAQ,uBAAuB,SAAY,CAAC,IAAI,EAAE,oBAAoB,QAAQ,mBAAmB;AAAA,MACrG;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACT,CAAC;AAcE,MAAM,QAAQ,CAAC,YAQtB,CACE,SAEA,OAAO,QAAQ,MAAM,OAAO,GAAG,CAAC,aAAa,OAAO,UAAU,QAAQ,QAAQ,EAAE,IAAI,CAAC;",
+  "names": []
+}

package/dist/cjs/DurableClock.d.ts

@@ -0,0 +1,60 @@
+import type * as Crypto from "effect/Crypto";
+import * as Duration from "effect/Duration";
+import * as Effect from "effect/Effect";
+import type * as Schema from "effect/Schema";
+import * as DurableDeferred from "./DurableDeferred.ts";
+import { FlowInstance } from "./FlowRuntime/FlowInstance.ts";
+import { FlowRuntime } from "./FlowRuntime/FlowRuntime.ts";
+declare const TypeId = "@smthrs/flow/DurableClock";
+/**
+ * Represents a durable flow timer with a name, duration, and deferred
+ * completed when the timer wakes.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export interface DurableClock {
+    readonly [TypeId]: typeof TypeId;
+    readonly name: string;
+    readonly duration: Duration.Duration;
+    readonly deferred: DurableDeferred.DurableDeferred<typeof Schema.Void>;
+}
+/**
+ * Declares one durable clock after validating its finite nonnegative duration.
+ *
+ * Throws a `RangeError` for a malformed, infinite or negative duration, or one
+ * longer than `Number.MAX_SAFE_INTEGER` milliseconds: a durable store records
+ * a clock's due time as a safe integer.
+ *
+ * @category constructors
+ * @since 0.1.0
+ */
+export declare const make: (options: {
+    readonly name: string;
+    readonly duration: Duration.Input;
+}) => DurableClock;
+/**
+ * Waits inside a flow, using an in-memory action for durations at or
+ * below the threshold and scheduling a durable clock for longer durations.
+ *
+ * Throws a `RangeError` for the same durations {@link make} refuses, and for
+ * a malformed, infinite or negative threshold. A durable sleep that would
+ * wake after epoch millisecond `Number.MAX_SAFE_INTEGER` dies with a
+ * `RangeError` instead of arming its clock.
+ *
+ * @category sleeping
+ * @since 0.1.0
+ */
+export declare const sleep: (options: {
+    readonly name: string;
+    readonly duration: Duration.Input;
+    /**
+     * If the duration is less than or equal to this threshold, the clock will
+     * be executed in memory.
+     *
+     * @default 60 seconds
+     */
+    readonly inMemoryThreshold?: Duration.Input | undefined;
+}) => Effect.Effect<void, never, Crypto.Crypto | FlowRuntime | FlowInstance>;
+export {};
+//# sourceMappingURL=DurableClock.d.ts.map

package/dist/cjs/DurableClock.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DurableClock.d.ts","sourceRoot":"","sources":["../../src/DurableClock.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAA;AAC5C,OAAO,KAAK,QAAQ,MAAM,iBAAiB,CAAA;AAC3C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAEvC,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAA;AAE5C,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAA;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAA;AAE1D,QAAA,MAAM,MAAM,8BAA8B,CAAA;AAE1C;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAA;IACpC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC,eAAe,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAA;CACvE;AAkDD;;;;;;;;;GASG;AACH,eAAO,MAAM,IAAI,GAAI,SAAS;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAA;CAClC,KAAG,YAAwE,CAAA;AAE5E;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,KAAK,GAChB,SAAS;IACP,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAA;IACjC;;;;;OAKG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,QAAQ,CAAC,KAAK,GAAG,SAAS,CAAA;CACxD,KACA,MAAM,CAAC,MAAM,CACd,IAAI,EACJ,KAAK,EACL,MAAM,CAAC,MAAM,GAAG,WAAW,GAAG,YAAY,CA2C3C,CAAA"}

package/dist/cjs/DurableClock.js

@@ -0,0 +1,107 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var DurableClock_exports = {};
+__export(DurableClock_exports, {
+  make: () => make,
+  sleep: () => sleep
+});
+module.exports = __toCommonJS(DurableClock_exports);
+var Clock = __toESM(require("effect/Clock"), 1);
+var Duration = __toESM(require("effect/Duration"), 1);
+var Effect = __toESM(require("effect/Effect"), 1);
+var Option = __toESM(require("effect/Option"), 1);
+var Action = __toESM(require("./Action/index.js"), 1);
+var DurableDeferred = __toESM(require("./DurableDeferred.js"), 1);
+var import_FlowInstance = require("./FlowRuntime/FlowInstance.js");
+var import_FlowRuntime = require("./FlowRuntime/FlowRuntime.js");
+const TypeId = "@smthrs/flow/DurableClock";
+const durationFromInput = (input, field) => {
+  const parsed = Duration.fromInput(input);
+  if (Option.isNone(parsed)) {
+    throw new RangeError(`DurableClock: "${field}" must be a valid finite duration that is not negative.`);
+  }
+  const millis = Duration.toMillis(parsed.value);
+  if (!Duration.isFinite(parsed.value) || !Number.isFinite(millis) || millis < 0) {
+    throw new RangeError(`DurableClock: "${field}" must be a valid finite duration that is not negative.`);
+  }
+  return parsed.value;
+};
+const latestDueAtMs = Number.MAX_SAFE_INTEGER;
+const clockDuration = (input) => {
+  const duration = durationFromInput(input, "duration");
+  if (Duration.toMillis(duration) > latestDueAtMs) {
+    throw new RangeError(`DurableClock: "duration" must be at most ${latestDueAtMs} milliseconds.`);
+  }
+  return duration;
+};
+const makeClock = (name, duration) => ({
+  [TypeId]: TypeId,
+  name,
+  duration,
+  deferred: DurableDeferred.make(`DurableClock/${name}`)
+});
+const make = (options) => makeClock(options.name, clockDuration(options.duration));
+const sleep = (options) => {
+  const name = options.name;
+  const duration = clockDuration(options.duration);
+  const inMemoryThreshold = durationFromInput(
+    options.inMemoryThreshold ?? defaultInMemoryThreshold,
+    "inMemoryThreshold"
+  );
+  return Effect.fnUntraced(function* () {
+    if (Duration.isZero(duration)) {
+      return;
+    }
+    if (Duration.isLessThanOrEqualTo(duration, inMemoryThreshold)) {
+      return yield* Action.make({
+        name: `DurableClock/${name}`,
+        tier: "sealed",
+        execute: Effect.sleep(duration)
+      });
+    }
+    const now = yield* Clock.currentTimeMillis;
+    if (now + Duration.toMillis(duration) > latestDueAtMs) {
+      return yield* Effect.die(
+        new RangeError(
+          `DurableClock: "${name}" would wake after epoch millisecond ${latestDueAtMs}, the latest due time a durable timer records.`
+        )
+      );
+    }
+    const engine = yield* import_FlowRuntime.FlowRuntime;
+    const instance = yield* import_FlowInstance.FlowInstance;
+    const clock = makeClock(name, duration);
+    yield* engine.scheduleClock(instance.flow, {
+      executionId: instance.executionId,
+      clock
+    });
+    return yield* DurableDeferred.await(clock.deferred);
+  })();
+};
+const defaultInMemoryThreshold = Duration.seconds(60);
+//# sourceMappingURL=DurableClock.js.map

package/dist/cjs/DurableClock.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/DurableClock.ts"],
+  "sourcesContent": ["// Deep reviewed and polished by a human on 2026-08-10.\n\n/**\n * Durable timers for flow sleeps.\n *\n * `make` creates a `DurableClock` with a name, duration, and deferred wake-up\n * signal. `sleep` ignores zero durations, runs short sleeps through an\n * in-memory action, and schedules longer sleeps through the `FlowRuntime`\n * before awaiting the durable deferred tied to the clock.\n *\n * @since 0.1.0\n */\n\nimport * as Clock from \"effect/Clock\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Duration from \"effect/Duration\"\nimport * as Effect from \"effect/Effect\"\nimport * as Option from \"effect/Option\"\nimport type * as Schema from \"effect/Schema\"\nimport * as Action from \"./Action/index.ts\"\nimport * as DurableDeferred from \"./DurableDeferred.ts\"\nimport { FlowInstance } from \"./FlowRuntime/FlowInstance.ts\"\nimport { FlowRuntime } from \"./FlowRuntime/FlowRuntime.ts\"\n\nconst TypeId = \"@smthrs/flow/DurableClock\"\n\n/**\n * Represents a durable flow timer with a name, duration, and deferred\n * completed when the timer wakes.\n *\n * @category models\n * @since 0.1.0\n */\nexport interface DurableClock {\n  readonly [TypeId]: typeof TypeId\n  readonly name: string\n  readonly duration: Duration.Duration\n  readonly deferred: DurableDeferred.DurableDeferred<typeof Schema.Void>\n}\n\n/**\n * Parses one author-supplied duration and requires it to be finite and\n * nonnegative. Invalid input throws `RangeError` so the authoring mistake is\n * caught at declaration time, matching `Flow.make` and `Poll.make`.\n *\n * @private\n */\nconst durationFromInput = (input: Duration.Input, field: string): Duration.Duration => {\n  const parsed = Duration.fromInput(input)\n  if (Option.isNone(parsed)) {\n    throw new RangeError(`DurableClock: \"${field}\" must be a valid finite duration that is not negative.`)\n  }\n  const millis = Duration.toMillis(parsed.value)\n  if (!Duration.isFinite(parsed.value) || !Number.isFinite(millis) || millis < 0) {\n    throw new RangeError(`DurableClock: \"${field}\" must be a valid finite duration that is not negative.`)\n  }\n  return parsed.value\n}\n\n/**\n * The latest due time a durable timer records, in epoch milliseconds: a store\n * keeps a clock's due time as a safe integer.\n *\n * @private\n */\nconst latestDueAtMs = Number.MAX_SAFE_INTEGER\n\n/**\n * Parses a clock's own duration, which a store adds to the current time and\n * records, so it is at most {@link latestDueAtMs} milliseconds.\n *\n * @private\n */\nconst clockDuration = (input: Duration.Input): Duration.Duration => {\n  const duration = durationFromInput(input, \"duration\")\n  if (Duration.toMillis(duration) > latestDueAtMs) {\n    throw new RangeError(`DurableClock: \"duration\" must be at most ${latestDueAtMs} milliseconds.`)\n  }\n  return duration\n}\n\nconst makeClock = (name: string, duration: Duration.Duration): DurableClock => ({\n  [TypeId]: TypeId,\n  name,\n  duration,\n  deferred: DurableDeferred.make(`DurableClock/${name}`)\n})\n\n/**\n * Declares one durable clock after validating its finite nonnegative duration.\n *\n * Throws a `RangeError` for a malformed, infinite or negative duration, or one\n * longer than `Number.MAX_SAFE_INTEGER` milliseconds: a durable store records\n * a clock's due time as a safe integer.\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const make = (options: {\n  readonly name: string\n  readonly duration: Duration.Input\n}): DurableClock => makeClock(options.name, clockDuration(options.duration))\n\n/**\n * Waits inside a flow, using an in-memory action for durations at or\n * below the threshold and scheduling a durable clock for longer durations.\n *\n * Throws a `RangeError` for the same durations {@link make} refuses, and for\n * a malformed, infinite or negative threshold. A durable sleep that would\n * wake after epoch millisecond `Number.MAX_SAFE_INTEGER` dies with a\n * `RangeError` instead of arming its clock.\n *\n * @category sleeping\n * @since 0.1.0\n */\nexport const sleep = (\n  options: {\n    readonly name: string\n    readonly duration: Duration.Input\n    /**\n     * If the duration is less than or equal to this threshold, the clock will\n     * be executed in memory.\n     *\n     * @default 60 seconds\n     */\n    readonly inMemoryThreshold?: Duration.Input | undefined\n  }\n): Effect.Effect<\n  void,\n  never,\n  Crypto.Crypto | FlowRuntime | FlowInstance\n> => {\n  const name = options.name\n  const duration = clockDuration(options.duration)\n  const inMemoryThreshold = durationFromInput(\n    options.inMemoryThreshold ?? defaultInMemoryThreshold,\n    \"inMemoryThreshold\"\n  )\n\n  // Untraced because durable sleeps are recursively resumed by the engine.\n  return Effect.fnUntraced(function*() {\n    if (Duration.isZero(duration)) {\n      return\n    }\n\n    if (Duration.isLessThanOrEqualTo(duration, inMemoryThreshold)) {\n      return yield* Action.make({\n        name: `DurableClock/${name}`,\n        tier: \"sealed\",\n        execute: Effect.sleep(duration)\n      })\n    }\n\n    // A due time past the latest one a store records would fail the park\n    // write deep in the engine, so the sleep refuses it here by name.\n    const now = yield* Clock.currentTimeMillis\n    if (now + Duration.toMillis(duration) > latestDueAtMs) {\n      return yield* Effect.die(\n        new RangeError(\n          `DurableClock: \"${name}\" would wake after epoch millisecond ${latestDueAtMs}, ` +\n            `the latest due time a durable timer records.`\n        )\n      )\n    }\n    const engine = yield* FlowRuntime\n    const instance = yield* FlowInstance\n    const clock = makeClock(name, duration)\n    yield* engine.scheduleClock(instance.flow, {\n      executionId: instance.executionId,\n      clock\n    })\n    return yield* DurableDeferred.await(clock.deferred)\n  })()\n}\n\nconst defaultInMemoryThreshold = Duration.seconds(60)\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,YAAuB;AAEvB,eAA0B;AAC1B,aAAwB;AACxB,aAAwB;AAExB,aAAwB;AACxB,sBAAiC;AACjC,0BAA6B;AAC7B,yBAA4B;AAE5B,MAAM,SAAS;AAuBf,MAAM,oBAAoB,CAAC,OAAuB,UAAqC;AACrF,QAAM,SAAS,SAAS,UAAU,KAAK;AACvC,MAAI,OAAO,OAAO,MAAM,GAAG;AACzB,UAAM,IAAI,WAAW,kBAAkB,KAAK,yDAAyD;AAAA,EACvG;AACA,QAAM,SAAS,SAAS,SAAS,OAAO,KAAK;AAC7C,MAAI,CAAC,SAAS,SAAS,OAAO,KAAK,KAAK,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AAC9E,UAAM,IAAI,WAAW,kBAAkB,KAAK,yDAAyD;AAAA,EACvG;AACA,SAAO,OAAO;AAChB;AAQA,MAAM,gBAAgB,OAAO;AAQ7B,MAAM,gBAAgB,CAAC,UAA6C;AAClE,QAAM,WAAW,kBAAkB,OAAO,UAAU;AACpD,MAAI,SAAS,SAAS,QAAQ,IAAI,eAAe;AAC/C,UAAM,IAAI,WAAW,4CAA4C,aAAa,gBAAgB;AAAA,EAChG;AACA,SAAO;AACT;AAEA,MAAM,YAAY,CAAC,MAAc,cAA+C;AAAA,EAC9E,CAAC,MAAM,GAAG;AAAA,EACV;AAAA,EACA;AAAA,EACA,UAAU,gBAAgB,KAAK,gBAAgB,IAAI,EAAE;AACvD;AAYO,MAAM,OAAO,CAAC,YAGD,UAAU,QAAQ,MAAM,cAAc,QAAQ,QAAQ,CAAC;AAcpE,MAAM,QAAQ,CACnB,YAeG;AACH,QAAM,OAAO,QAAQ;AACrB,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,oBAAoB;AAAA,IACxB,QAAQ,qBAAqB;AAAA,IAC7B;AAAA,EACF;AAGA,SAAO,OAAO,WAAW,aAAY;AACnC,QAAI,SAAS,OAAO,QAAQ,GAAG;AAC7B;AAAA,IACF;AAEA,QAAI,SAAS,oBAAoB,UAAU,iBAAiB,GAAG;AAC7D,aAAO,OAAO,OAAO,KAAK;AAAA,QACxB,MAAM,gBAAgB,IAAI;AAAA,QAC1B,MAAM;AAAA,QACN,SAAS,OAAO,MAAM,QAAQ;AAAA,MAChC,CAAC;AAAA,IACH;AAIA,UAAM,MAAM,OAAO,MAAM;AACzB,QAAI,MAAM,SAAS,SAAS,QAAQ,IAAI,eAAe;AACrD,aAAO,OAAO,OAAO;AAAA,QACnB,IAAI;AAAA,UACF,kBAAkB,IAAI,wCAAwC,aAAa;AAAA,QAE7E;AAAA,MACF;AAAA,IACF;AACA,UAAM,SAAS,OAAO;AACtB,UAAM,WAAW,OAAO;AACxB,UAAM,QAAQ,UAAU,MAAM,QAAQ;AACtC,WAAO,OAAO,cAAc,SAAS,MAAM;AAAA,MACzC,aAAa,SAAS;AAAA,MACtB;AAAA,IACF,CAAC;AACD,WAAO,OAAO,gBAAgB,MAAM,MAAM,QAAQ;AAAA,EACpD,CAAC,EAAE;AACL;AAEA,MAAM,2BAA2B,SAAS,QAAQ,EAAE;",
+  "names": []
+}