@alma-harness/schedule 0.3.0

package/LICENSE

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

package/README.md

@@ -0,0 +1,70 @@
+# @alma-harness/schedule
+
+The clock of [Alma](https://github.com/FabioFernandesCarneiro/alma), as a
+tick: what is due, and the call an external scheduler makes to run it. No
+process is kept alive (spec: clock-tick).
+
+> **Status: 0.2.0 on npm, pre-1.0.** The API is still moving; see the
+> [roadmap](../../docs/architecture.md#12-adoption-roadmap) for where it stands.
+
+## What it owns
+
+- `createSchedule({ routines, runs, runner })` — `tick({ now? })` reads
+  the routine store, decides what is due, runs it through the routine
+  runner with the FIRE's instant as the run id, and reports `{ at, due,
+  runs, errors }`. `plan(now?)` answers without running. `runner` may be a
+  resolver, `(routine) => RoutineRunner`, for a deployment with an agent
+  per tenant — `list` crosses every scope. A routine that cannot be
+  planned (a zone typo, a bad cron) is one entry in `errors`; the others
+  run.
+- `register` / `cancel` — register THROUGH the schedule: it asks the runner
+  to validate and reads the schedule once, so what the tick could not run
+  is refused at registration, not at 8h with nobody watching.
+- What is due: the latest fire at or before now — a cron's previous
+  occurrence in its `tz` (UTC when absent), `every` anchored on the
+  routine's registration, `at` once — when it is later than the routine's
+  last run. A job routine whose submission is still open is collected on
+  every tick. Missed fires are not replayed: after downtime a daily routine
+  runs once.
+- `latestFire`, `validateSchedule` — the pure halves, exported.
+
+## Wiring
+
+One endpoint the scheduler calls on a cadence. Cloud Scheduler every
+minute against a Cloud Run service at zero minimum instances is the shape
+it was written for; anything that can call a URL on a cron is the clock.
+
+```ts
+import { createSchedule } from "@alma-harness/schedule";
+
+const schedule = createSchedule({ routines, runs, runner: (routine) => runnerFor(routine.scope) });
+await schedule.register(briefing);
+
+// Node's http, Hono, Express — the product's choice. A shared secret, or
+// the platform's OIDC, decides who may tick.
+app.post("/tick", async (req, res) => {
+  if (req.headers["x-tick-secret"] !== process.env.TICK_SECRET) return res.status(401).end();
+  res.json(await schedule.tick());
+});
+```
+
+A tick retried by the scheduler runs nothing twice: the runner treats the
+same run id as one run (spec: routine-runner), and the run store is in
+Postgres (spec: postgres-routine-runs), so a fresh container reads the same
+state the last one wrote. A turn may take tens of seconds: the host's
+request timeout must allow it (Cloud Run does). A container killed
+mid-turn leaves a lease that expires on its own and a claim the next fire
+re-runs (spec 030).
+
+## What it must never do
+
+- Keep a timer. The clock is outside; this package only answers it.
+- Replay missed fires, or run routines in parallel.
+- Hold a vendor scheduler's SDK. The tick IS the adapter.
+
+## Documentation
+
+[Docs index](../../docs/README.md) · [Architecture §8](../../docs/architecture.md#8-triggered-turns-and-routines)
+· [Routine runner spec](../../docs/specs/047-routine-runner.md)
+
+Apache-2.0

package/dist/index.d.ts

@@ -0,0 +1,74 @@
+import { StoredRoutine, Routine, Scope, RoutineRun, RoutineStore, RoutineRunStore, Schedule } from '@alma-harness/core';
+import { RoutineRunner } from '@alma-harness/loop';
+
+/**
+ * What is due, and the tick that runs it — spec: clock-tick, hardened by
+ * spec: close-060-064-findings.
+ *
+ * The scheduler knows one thing: call `tick` every minute or five. The tick
+ * knows everything else from the stores, so a tick retried, doubled or
+ * missed does no harm: the FIRE's instant is the run id, and the runner
+ * treats the same id twice as one run (spec: routine-runner).
+ */
+interface ScheduleConfig {
+    routines: RoutineStore;
+    runs: RoutineRunStore;
+    /**
+     * One runner, or one per routine: a deployment with an agent per tenant
+     * resolves it from the routine's scope, since `list` crosses every scope.
+     */
+    runner: RoutineRunner | ((routine: Routine) => RoutineRunner);
+    /** Injected clock (ISO 8601) — tests stay deterministic. */
+    now?: () => string;
+    /** Per-routine store reads in flight at once. Default 8. */
+    concurrency?: number;
+}
+interface DueFire {
+    routine: StoredRoutine;
+    /** The instant the run is named by: the fire, or the tick's own instant for a pending collection. */
+    at: string;
+    /** `fire`: the schedule came due. `pending`: a job routine's submission is still open and is collected now. */
+    reason: "fire" | "pending";
+}
+interface ScheduleError {
+    routineId: string;
+    scope: Scope;
+    message: string;
+    /** `plan`: the routine's schedule could not be read. `run`: the runner threw. The others were not affected. */
+    stage: "plan" | "run";
+}
+interface TickPlan {
+    at: string;
+    due: DueFire[];
+    errors: ScheduleError[];
+}
+interface TickReport extends TickPlan {
+    runs: RoutineRun[];
+}
+interface RoutineSchedule {
+    /**
+     * Registers with the store AFTER the runner and the schedule have refused
+     * what they cannot run — at registration, not at 8h with nobody watching.
+     */
+    register(routine: Routine & {
+        registeredAt?: string;
+    }): Promise<void>;
+    cancel(scope: Scope, routineId: string): Promise<void>;
+    /** What would run at `now`, without running it, and which routines could not even be planned. */
+    plan(now?: string): Promise<TickPlan>;
+    /** Runs what is due, one routine after another, and reports. Never throws for a routine's sake. */
+    tick(opts?: {
+        now?: string;
+    }): Promise<TickReport>;
+}
+/** Refuses a schedule the tick could not read — the same errors croner or the parser would raise mid-tick. */
+declare function validateSchedule(schedule: Schedule): void;
+/**
+ * The latest fire of a schedule at or before `now`, as an ISO instant — or
+ * nothing: before the first fire, or a fire the routine never saw (earlier
+ * than its registration). `{ every }` anchors on the registration stamp.
+ */
+declare function latestFire(schedule: Schedule, registeredAt: string, nowIso: string): string | undefined;
+declare function createSchedule(config: ScheduleConfig): RoutineSchedule;
+
+export { type DueFire, type RoutineSchedule, type ScheduleConfig, type ScheduleError, type TickPlan, type TickReport, createSchedule, latestFire, validateSchedule };

package/dist/index.js

@@ -0,0 +1,143 @@
+// src/schedule.ts
+import {
+  assertIso8601,
+  parseIso8601
+} from "@alma-harness/core";
+import { Cron } from "croner";
+var UNITS = { s: 1e3, m: 6e4, h: 36e5, d: 864e5 };
+function durationMs(duration) {
+  const match = /^(\d+)([smhd])$/.exec(duration);
+  const ms = match === null ? 0 : Number(match[1]) * UNITS[match[2]];
+  if (ms <= 0) throw new Error(`malformed duration: ${JSON.stringify(duration)}`);
+  return ms;
+}
+function cronOf(expression, tz) {
+  return new Cron(expression, { timezone: tz ?? "UTC" });
+}
+function validateSchedule(schedule) {
+  if ("at" in schedule) {
+    assertIso8601(schedule.at, "schedule.at");
+  } else if ("every" in schedule) {
+    durationMs(schedule.every);
+  } else {
+    cronOf(schedule.cron, schedule.tz).nextRun(/* @__PURE__ */ new Date());
+  }
+}
+function nextFire(schedule, registered, afterMs) {
+  if ("at" in schedule) {
+    const at = parseIso8601(schedule.at, "schedule.at");
+    return at > afterMs ? at : void 0;
+  }
+  if ("every" in schedule) {
+    const step = durationMs(schedule.every);
+    const k = Math.max(1, Math.floor((afterMs - registered) / step) + 1);
+    return registered + k * step;
+  }
+  const next = cronOf(schedule.cron, schedule.tz).nextRun(new Date(afterMs));
+  return next === null ? void 0 : next.getTime();
+}
+function latestCron(expression, tz, now) {
+  const cron = cronOf(expression, tz);
+  for (const window of [2 * UNITS.m, 2 * UNITS.h, 2 * UNITS.d, 40 * UNITS.d, 400 * UNITS.d]) {
+    let at = cron.nextRun(new Date(now - window));
+    if (at === null || at.getTime() > now) continue;
+    for (; ; ) {
+      const next = cron.nextRun(at);
+      if (next === null || next.getTime() > now) return at.getTime();
+      at = next;
+    }
+  }
+  return void 0;
+}
+function latestFire(schedule, registeredAt, nowIso) {
+  const now = parseIso8601(nowIso, "now");
+  const registered = parseIso8601(registeredAt, "registeredAt");
+  let fire;
+  if ("at" in schedule) {
+    const at = parseIso8601(schedule.at, "schedule.at");
+    fire = at <= now ? at : void 0;
+  } else if ("every" in schedule) {
+    const step = durationMs(schedule.every);
+    fire = now - registered >= step ? registered + Math.floor((now - registered) / step) * step : void 0;
+  } else {
+    fire = latestCron(schedule.cron, schedule.tz, now);
+  }
+  if (fire === void 0 || fire < registered) return void 0;
+  return new Date(fire).toISOString();
+}
+async function mapConcurrent(items, limit, fn) {
+  const out = new Array(items.length);
+  let next = 0;
+  const workers = Array.from({ length: Math.min(limit, items.length) }, async () => {
+    for (; ; ) {
+      const i = next++;
+      if (i >= items.length) return;
+      out[i] = await fn(items[i]);
+    }
+  });
+  await Promise.all(workers);
+  return out;
+}
+function createSchedule(config) {
+  const { routines, runs } = config;
+  const runnerFor = typeof config.runner === "function" ? config.runner : () => config.runner;
+  const clock = config.now ?? (() => (/* @__PURE__ */ new Date()).toISOString());
+  const concurrency = config.concurrency ?? 8;
+  const message = (err) => err instanceof Error ? err.message : String(err);
+  async function planOne(routine, nowIso, now) {
+    try {
+      const [pending] = await runs.list(routine.scope, routine.id, { outcome: "submitted", limit: 1 });
+      if (pending !== void 0) return { fire: { routine, at: nowIso, reason: "pending" } };
+      const [last] = await runs.list(routine.scope, routine.id, { limit: 1 });
+      const registered = parseIso8601(routine.registeredAt, "registeredAt");
+      const after = last === void 0 ? registered - 1 : Math.max(registered - 1, parseIso8601(last.startedAt, "startedAt"));
+      const next = nextFire(routine.schedule, registered, after);
+      if (next === void 0 || next > now) return {};
+      const fire = latestFire(routine.schedule, routine.registeredAt, nowIso);
+      if (fire === void 0 || last !== void 0 && parseIso8601(fire) <= parseIso8601(last.startedAt)) return {};
+      return { fire: { routine, at: fire, reason: "fire" } };
+    } catch (err) {
+      return { error: { routineId: routine.id, scope: routine.scope, message: message(err), stage: "plan" } };
+    }
+  }
+  async function plan(nowIso = clock()) {
+    const now = parseIso8601(nowIso, "now");
+    const plans = await mapConcurrent(await routines.list(), concurrency, (routine) => planOne(routine, nowIso, now));
+    return {
+      at: nowIso,
+      due: plans.flatMap((p) => p.fire === void 0 ? [] : [p.fire]),
+      errors: plans.flatMap((p) => p.error === void 0 ? [] : [p.error])
+    };
+  }
+  return {
+    async register(routine) {
+      runnerFor(routine).validate(routine);
+      try {
+        validateSchedule(routine.schedule);
+      } catch (err) {
+        throw new Error(`routine ${JSON.stringify(routine.id)} has a schedule the tick cannot read: ${message(err)}`);
+      }
+      await routines.register(routine);
+    },
+    cancel: (scope, routineId) => routines.cancel(scope, routineId),
+    plan,
+    async tick(opts = {}) {
+      const planned = await plan(opts.now ?? clock());
+      const report = { ...planned, runs: [] };
+      for (const fire of planned.due) {
+        try {
+          report.runs.push(await runnerFor(fire.routine).run(fire.routine, { runId: fire.at, at: fire.at }));
+        } catch (err) {
+          report.errors.push({ routineId: fire.routine.id, scope: fire.routine.scope, message: message(err), stage: "run" });
+        }
+      }
+      return report;
+    }
+  };
+}
+export {
+  createSchedule,
+  latestFire,
+  validateSchedule
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/schedule.ts"],"sourcesContent":["import {\n  assertIso8601,\n  parseIso8601,\n  type Duration,\n  type Routine,\n  type RoutineRun,\n  type RoutineRunStore,\n  type RoutineStore,\n  type Schedule as ScheduleSpec,\n  type Scope,\n  type StoredRoutine,\n} from \"@alma-harness/core\";\nimport type { RoutineRunner } from \"@alma-harness/loop\";\nimport { Cron } from \"croner\";\n\n/**\n * What is due, and the tick that runs it — spec: clock-tick, hardened by\n * spec: close-060-064-findings.\n *\n * The scheduler knows one thing: call `tick` every minute or five. The tick\n * knows everything else from the stores, so a tick retried, doubled or\n * missed does no harm: the FIRE's instant is the run id, and the runner\n * treats the same id twice as one run (spec: routine-runner).\n */\n\nexport interface ScheduleConfig {\n  routines: RoutineStore;\n  runs: RoutineRunStore;\n  /**\n   * One runner, or one per routine: a deployment with an agent per tenant\n   * resolves it from the routine's scope, since `list` crosses every scope.\n   */\n  runner: RoutineRunner | ((routine: Routine) => RoutineRunner);\n  /** Injected clock (ISO 8601) — tests stay deterministic. */\n  now?: () => string;\n  /** Per-routine store reads in flight at once. Default 8. */\n  concurrency?: number;\n}\n\nexport interface DueFire {\n  routine: StoredRoutine;\n  /** The instant the run is named by: the fire, or the tick's own instant for a pending collection. */\n  at: string;\n  /** `fire`: the schedule came due. `pending`: a job routine's submission is still open and is collected now. */\n  reason: \"fire\" | \"pending\";\n}\n\nexport interface ScheduleError {\n  routineId: string;\n  scope: Scope;\n  message: string;\n  /** `plan`: the routine's schedule could not be read. `run`: the runner threw. The others were not affected. */\n  stage: \"plan\" | \"run\";\n}\n\nexport interface TickPlan {\n  at: string;\n  due: DueFire[];\n  errors: ScheduleError[];\n}\n\nexport interface TickReport extends TickPlan {\n  runs: RoutineRun[];\n}\n\nexport interface RoutineSchedule {\n  /**\n   * Registers with the store AFTER the runner and the schedule have refused\n   * what they cannot run — at registration, not at 8h with nobody watching.\n   */\n  register(routine: Routine & { registeredAt?: string }): Promise<void>;\n  cancel(scope: Scope, routineId: string): Promise<void>;\n  /** What would run at `now`, without running it, and which routines could not even be planned. */\n  plan(now?: string): Promise<TickPlan>;\n  /** Runs what is due, one routine after another, and reports. Never throws for a routine's sake. */\n  tick(opts?: { now?: string }): Promise<TickReport>;\n}\n\nconst UNITS: Record<\"s\" | \"m\" | \"h\" | \"d\", number> = { s: 1_000, m: 60_000, h: 3_600_000, d: 86_400_000 };\n\n/** A compact duration (\"90s\", \"15m\", \"2h\", \"1d\") in milliseconds; zero is refused — it would fire NaN. */\nexport function durationMs(duration: Duration): number {\n  const match = /^(\\d+)([smhd])$/.exec(duration);\n  const ms = match === null ? 0 : Number(match[1]) * UNITS[match[2] as keyof typeof UNITS];\n  if (ms <= 0) throw new Error(`malformed duration: ${JSON.stringify(duration)}`);\n  return ms;\n}\n\n/**\n * UTC unless the routine says where it lives: croner would otherwise read\n * the cron in the PROCESS's zone, and a fire would move with the deployment.\n * Constructed without a callback, so nothing is scheduled.\n */\nfunction cronOf(expression: string, tz: string | undefined): Cron {\n  return new Cron(expression, { timezone: tz ?? \"UTC\" });\n}\n\n/** Refuses a schedule the tick could not read — the same errors croner or the parser would raise mid-tick. */\nexport function validateSchedule(schedule: ScheduleSpec): void {\n  if (\"at\" in schedule) {\n    assertIso8601(schedule.at, \"schedule.at\");\n  } else if (\"every\" in schedule) {\n    durationMs(schedule.every);\n  } else {\n    // A bad zone surfaces only on the first computation, not at construction.\n    cronOf(schedule.cron, schedule.tz).nextRun(new Date());\n  }\n}\n\n/** The first fire strictly after `afterMs`, or nothing. */\nfunction nextFire(schedule: ScheduleSpec, registered: number, afterMs: number): number | undefined {\n  if (\"at\" in schedule) {\n    const at = parseIso8601(schedule.at, \"schedule.at\");\n    return at > afterMs ? at : undefined;\n  }\n  if (\"every\" in schedule) {\n    const step = durationMs(schedule.every);\n    const k = Math.max(1, Math.floor((afterMs - registered) / step) + 1);\n    return registered + k * step;\n  }\n  const next = cronOf(schedule.cron, schedule.tz).nextRun(new Date(afterMs));\n  return next === null ? undefined : next.getTime();\n}\n\n/**\n * The latest occurrence of a cron at or before `now`. Windows widen until\n * one holds an occurrence, then the window is walked forward to the last\n * one — bounded, because a window is only walked when the cron fits it,\n * and only reached once `nextFire` said something may be due.\n */\nfunction latestCron(expression: string, tz: string | undefined, now: number): number | undefined {\n  const cron = cronOf(expression, tz);\n  for (const window of [2 * UNITS.m, 2 * UNITS.h, 2 * UNITS.d, 40 * UNITS.d, 400 * UNITS.d]) {\n    let at = cron.nextRun(new Date(now - window));\n    if (at === null || at.getTime() > now) continue;\n    for (;;) {\n      const next = cron.nextRun(at);\n      if (next === null || next.getTime() > now) return at.getTime();\n      at = next;\n    }\n  }\n  return undefined;\n}\n\n/**\n * The latest fire of a schedule at or before `now`, as an ISO instant — or\n * nothing: before the first fire, or a fire the routine never saw (earlier\n * than its registration). `{ every }` anchors on the registration stamp.\n */\nexport function latestFire(schedule: ScheduleSpec, registeredAt: string, nowIso: string): string | undefined {\n  const now = parseIso8601(nowIso, \"now\");\n  const registered = parseIso8601(registeredAt, \"registeredAt\");\n  let fire: number | undefined;\n  if (\"at\" in schedule) {\n    const at = parseIso8601(schedule.at, \"schedule.at\");\n    fire = at <= now ? at : undefined;\n  } else if (\"every\" in schedule) {\n    const step = durationMs(schedule.every);\n    fire = now - registered >= step ? registered + Math.floor((now - registered) / step) * step : undefined;\n  } else {\n    fire = latestCron(schedule.cron, schedule.tz, now);\n  }\n  if (fire === undefined || fire < registered) return undefined;\n  return new Date(fire).toISOString();\n}\n\n/** `fn` over `items`, at most `limit` in flight — the per-routine reads of a tick (spec: close-060-064-findings). */\nasync function mapConcurrent<T, R>(items: readonly T[], limit: number, fn: (item: T) => Promise<R>): Promise<R[]> {\n  const out: R[] = new Array<R>(items.length);\n  let next = 0;\n  const workers = Array.from({ length: Math.min(limit, items.length) }, async () => {\n    for (;;) {\n      const i = next++;\n      if (i >= items.length) return;\n      out[i] = await fn(items[i]!);\n    }\n  });\n  await Promise.all(workers);\n  return out;\n}\n\nexport function createSchedule(config: ScheduleConfig): RoutineSchedule {\n  const { routines, runs } = config;\n  const runnerFor = typeof config.runner === \"function\" ? config.runner : () => config.runner as RoutineRunner;\n  const clock = config.now ?? (() => new Date().toISOString());\n  const concurrency = config.concurrency ?? 8;\n  const message = (err: unknown): string => (err instanceof Error ? err.message : String(err));\n\n  /** One routine's share of a tick: a fire, nothing, or the error that kept it from being planned. */\n  async function planOne(routine: StoredRoutine, nowIso: string, now: number): Promise<{ fire?: DueFire; error?: ScheduleError }> {\n    try {\n      // A submission still open is collected on EVERY tick, not on the next\n      // cron occurrence (spec: model-jobs) — asked the way the runner asks it.\n      const [pending] = await runs.list(routine.scope, routine.id, { outcome: \"submitted\", limit: 1 });\n      if (pending !== undefined) return { fire: { routine, at: nowIso, reason: \"pending\" } };\n      const [last] = await runs.list(routine.scope, routine.id, { limit: 1 });\n      const registered = parseIso8601(routine.registeredAt, \"registeredAt\");\n      // The common case answered in one step: is there any fire after the\n      // later of the registration and the last run, at or before now?\n      const after = last === undefined ? registered - 1 : Math.max(registered - 1, parseIso8601(last.startedAt, \"startedAt\"));\n      const next = nextFire(routine.schedule, registered, after);\n      if (next === undefined || next > now) return {};\n      const fire = latestFire(routine.schedule, routine.registeredAt, nowIso);\n      // Refusals are runs too: a routine past its ceiling is not re-fired every minute.\n      if (fire === undefined || (last !== undefined && parseIso8601(fire) <= parseIso8601(last.startedAt))) return {};\n      return { fire: { routine, at: fire, reason: \"fire\" } };\n    } catch (err) {\n      return { error: { routineId: routine.id, scope: routine.scope, message: message(err), stage: \"plan\" } };\n    }\n  }\n\n  async function plan(nowIso: string = clock()): Promise<TickPlan> {\n    const now = parseIso8601(nowIso, \"now\");\n    const plans = await mapConcurrent(await routines.list(), concurrency, (routine) => planOne(routine, nowIso, now));\n    return {\n      at: nowIso,\n      due: plans.flatMap((p) => (p.fire === undefined ? [] : [p.fire])),\n      errors: plans.flatMap((p) => (p.error === undefined ? [] : [p.error])),\n    };\n  }\n\n  return {\n    async register(routine) {\n      runnerFor(routine).validate(routine);\n      try {\n        validateSchedule(routine.schedule);\n      } catch (err) {\n        throw new Error(`routine ${JSON.stringify(routine.id)} has a schedule the tick cannot read: ${message(err)}`);\n      }\n      await routines.register(routine);\n    },\n    cancel: (scope, routineId) => routines.cancel(scope, routineId),\n    plan,\n    async tick(opts = {}) {\n      const planned = await plan(opts.now ?? clock());\n      const report: TickReport = { ...planned, runs: [] };\n      for (const fire of planned.due) {\n        try {\n          report.runs.push(await runnerFor(fire.routine).run(fire.routine, { runId: fire.at, at: fire.at }));\n        } catch (err) {\n          report.errors.push({ routineId: fire.routine.id, scope: fire.routine.scope, message: message(err), stage: \"run\" });\n        }\n      }\n      return report;\n    },\n  };\n}\n"],"mappings":";AAAA;AAAA,EACE;AAAA,EACA;AAAA,OASK;AAEP,SAAS,YAAY;AAiErB,IAAM,QAA+C,EAAE,GAAG,KAAO,GAAG,KAAQ,GAAG,MAAW,GAAG,MAAW;AAGjG,SAAS,WAAW,UAA4B;AACrD,QAAM,QAAQ,kBAAkB,KAAK,QAAQ;AAC7C,QAAM,KAAK,UAAU,OAAO,IAAI,OAAO,MAAM,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC,CAAuB;AACvF,MAAI,MAAM,EAAG,OAAM,IAAI,MAAM,uBAAuB,KAAK,UAAU,QAAQ,CAAC,EAAE;AAC9E,SAAO;AACT;AAOA,SAAS,OAAO,YAAoB,IAA8B;AAChE,SAAO,IAAI,KAAK,YAAY,EAAE,UAAU,MAAM,MAAM,CAAC;AACvD;AAGO,SAAS,iBAAiB,UAA8B;AAC7D,MAAI,QAAQ,UAAU;AACpB,kBAAc,SAAS,IAAI,aAAa;AAAA,EAC1C,WAAW,WAAW,UAAU;AAC9B,eAAW,SAAS,KAAK;AAAA,EAC3B,OAAO;AAEL,WAAO,SAAS,MAAM,SAAS,EAAE,EAAE,QAAQ,oBAAI,KAAK,CAAC;AAAA,EACvD;AACF;AAGA,SAAS,SAAS,UAAwB,YAAoB,SAAqC;AACjG,MAAI,QAAQ,UAAU;AACpB,UAAM,KAAK,aAAa,SAAS,IAAI,aAAa;AAClD,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B;AACA,MAAI,WAAW,UAAU;AACvB,UAAM,OAAO,WAAW,SAAS,KAAK;AACtC,UAAM,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,UAAU,cAAc,IAAI,IAAI,CAAC;AACnE,WAAO,aAAa,IAAI;AAAA,EAC1B;AACA,QAAM,OAAO,OAAO,SAAS,MAAM,SAAS,EAAE,EAAE,QAAQ,IAAI,KAAK,OAAO,CAAC;AACzE,SAAO,SAAS,OAAO,SAAY,KAAK,QAAQ;AAClD;AAQA,SAAS,WAAW,YAAoB,IAAwB,KAAiC;AAC/F,QAAM,OAAO,OAAO,YAAY,EAAE;AAClC,aAAW,UAAU,CAAC,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,KAAK,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG;AACzF,QAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,MAAM,CAAC;AAC5C,QAAI,OAAO,QAAQ,GAAG,QAAQ,IAAI,IAAK;AACvC,eAAS;AACP,YAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAI,SAAS,QAAQ,KAAK,QAAQ,IAAI,IAAK,QAAO,GAAG,QAAQ;AAC7D,WAAK;AAAA,IACP;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,WAAW,UAAwB,cAAsB,QAAoC;AAC3G,QAAM,MAAM,aAAa,QAAQ,KAAK;AACtC,QAAM,aAAa,aAAa,cAAc,cAAc;AAC5D,MAAI;AACJ,MAAI,QAAQ,UAAU;AACpB,UAAM,KAAK,aAAa,SAAS,IAAI,aAAa;AAClD,WAAO,MAAM,MAAM,KAAK;AAAA,EAC1B,WAAW,WAAW,UAAU;AAC9B,UAAM,OAAO,WAAW,SAAS,KAAK;AACtC,WAAO,MAAM,cAAc,OAAO,aAAa,KAAK,OAAO,MAAM,cAAc,IAAI,IAAI,OAAO;AAAA,EAChG,OAAO;AACL,WAAO,WAAW,SAAS,MAAM,SAAS,IAAI,GAAG;AAAA,EACnD;AACA,MAAI,SAAS,UAAa,OAAO,WAAY,QAAO;AACpD,SAAO,IAAI,KAAK,IAAI,EAAE,YAAY;AACpC;AAGA,eAAe,cAAoB,OAAqB,OAAe,IAA2C;AAChH,QAAM,MAAW,IAAI,MAAS,MAAM,MAAM;AAC1C,MAAI,OAAO;AACX,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,MAAM,EAAE,GAAG,YAAY;AAChF,eAAS;AACP,YAAM,IAAI;AACV,UAAI,KAAK,MAAM,OAAQ;AACvB,UAAI,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAE;AAAA,IAC7B;AAAA,EACF,CAAC;AACD,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO;AACT;AAEO,SAAS,eAAe,QAAyC;AACtE,QAAM,EAAE,UAAU,KAAK,IAAI;AAC3B,QAAM,YAAY,OAAO,OAAO,WAAW,aAAa,OAAO,SAAS,MAAM,OAAO;AACrF,QAAM,QAAQ,OAAO,QAAQ,OAAM,oBAAI,KAAK,GAAE,YAAY;AAC1D,QAAM,cAAc,OAAO,eAAe;AAC1C,QAAM,UAAU,CAAC,QAA0B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAG1F,iBAAe,QAAQ,SAAwB,QAAgB,KAAiE;AAC9H,QAAI;AAGF,YAAM,CAAC,OAAO,IAAI,MAAM,KAAK,KAAK,QAAQ,OAAO,QAAQ,IAAI,EAAE,SAAS,aAAa,OAAO,EAAE,CAAC;AAC/F,UAAI,YAAY,OAAW,QAAO,EAAE,MAAM,EAAE,SAAS,IAAI,QAAQ,QAAQ,UAAU,EAAE;AACrF,YAAM,CAAC,IAAI,IAAI,MAAM,KAAK,KAAK,QAAQ,OAAO,QAAQ,IAAI,EAAE,OAAO,EAAE,CAAC;AACtE,YAAM,aAAa,aAAa,QAAQ,cAAc,cAAc;AAGpE,YAAM,QAAQ,SAAS,SAAY,aAAa,IAAI,KAAK,IAAI,aAAa,GAAG,aAAa,KAAK,WAAW,WAAW,CAAC;AACtH,YAAM,OAAO,SAAS,QAAQ,UAAU,YAAY,KAAK;AACzD,UAAI,SAAS,UAAa,OAAO,IAAK,QAAO,CAAC;AAC9C,YAAM,OAAO,WAAW,QAAQ,UAAU,QAAQ,cAAc,MAAM;AAEtE,UAAI,SAAS,UAAc,SAAS,UAAa,aAAa,IAAI,KAAK,aAAa,KAAK,SAAS,EAAI,QAAO,CAAC;AAC9G,aAAO,EAAE,MAAM,EAAE,SAAS,IAAI,MAAM,QAAQ,OAAO,EAAE;AAAA,IACvD,SAAS,KAAK;AACZ,aAAO,EAAE,OAAO,EAAE,WAAW,QAAQ,IAAI,OAAO,QAAQ,OAAO,SAAS,QAAQ,GAAG,GAAG,OAAO,OAAO,EAAE;AAAA,IACxG;AAAA,EACF;AAEA,iBAAe,KAAK,SAAiB,MAAM,GAAsB;AAC/D,UAAM,MAAM,aAAa,QAAQ,KAAK;AACtC,UAAM,QAAQ,MAAM,cAAc,MAAM,SAAS,KAAK,GAAG,aAAa,CAAC,YAAY,QAAQ,SAAS,QAAQ,GAAG,CAAC;AAChH,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,KAAK,MAAM,QAAQ,CAAC,MAAO,EAAE,SAAS,SAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAE;AAAA,MAChE,QAAQ,MAAM,QAAQ,CAAC,MAAO,EAAE,UAAU,SAAY,CAAC,IAAI,CAAC,EAAE,KAAK,CAAE;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,SAAS,SAAS;AACtB,gBAAU,OAAO,EAAE,SAAS,OAAO;AACnC,UAAI;AACF,yBAAiB,QAAQ,QAAQ;AAAA,MACnC,SAAS,KAAK;AACZ,cAAM,IAAI,MAAM,WAAW,KAAK,UAAU,QAAQ,EAAE,CAAC,yCAAyC,QAAQ,GAAG,CAAC,EAAE;AAAA,MAC9G;AACA,YAAM,SAAS,SAAS,OAAO;AAAA,IACjC;AAAA,IACA,QAAQ,CAAC,OAAO,cAAc,SAAS,OAAO,OAAO,SAAS;AAAA,IAC9D;AAAA,IACA,MAAM,KAAK,OAAO,CAAC,GAAG;AACpB,YAAM,UAAU,MAAM,KAAK,KAAK,OAAO,MAAM,CAAC;AAC9C,YAAM,SAAqB,EAAE,GAAG,SAAS,MAAM,CAAC,EAAE;AAClD,iBAAW,QAAQ,QAAQ,KAAK;AAC9B,YAAI;AACF,iBAAO,KAAK,KAAK,MAAM,UAAU,KAAK,OAAO,EAAE,IAAI,KAAK,SAAS,EAAE,OAAO,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;AAAA,QACnG,SAAS,KAAK;AACZ,iBAAO,OAAO,KAAK,EAAE,WAAW,KAAK,QAAQ,IAAI,OAAO,KAAK,QAAQ,OAAO,SAAS,QAAQ,GAAG,GAAG,OAAO,MAAM,CAAC;AAAA,QACnH;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;","names":[]}

package/package.json

@@ -0,0 +1,46 @@
+{
+  "name": "@alma-harness/schedule",
+  "version": "0.3.0",
+  "description": "Alma's clock: what is due, and the tick an external scheduler calls to run it — no process kept alive.",
+  "license": "Apache-2.0",
+  "type": "module",
+  "engines": {
+    "node": ">=22"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/FabioFernandesCarneiro/alma.git",
+    "directory": "packages/schedule"
+  },
+  "dependencies": {
+    "croner": "^10.0.1"
+  },
+  "peerDependencies": {
+    "@alma-harness/core": "^0.3.0",
+    "@alma-harness/loop": "^0.3.0"
+  },
+  "devDependencies": {
+    "@types/node": "^24.1.0",
+    "typescript": "^5.9.2",
+    "vitest": "^3.2.4"
+  },
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "build": "tsup"
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts"
+}