@mulmoclaude/core 0.25.1 → 0.27.0

package/dist/scheduler/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../src/scheduler/task-manager.ts","../../src/scheduler/adapter.ts"],"sourcesContent":["// Generic dependency-ordered cron tick engine. Host-agnostic: the only\n// host coupling (a logger) is injected via options. Schedules are either\n// fixed intervals or a daily UTC time; tasks may declare a `dependsOn`\n// edge so an ordering like \"news fetch → journal → memory extraction\"\n// runs in sequence within one tick.\n\nimport { SCHEDULE_TYPES } from \"@receptron/task-scheduler\";\n\nconst ONE_SECOND_MS = 1000;\nconst ONE_MINUTE_MS = 60 * ONE_SECOND_MS;\nconst ONE_HOUR_MS = 60 * ONE_MINUTE_MS;\n\n// Gap between the START of each independently-due task within one tick. When\n// many tasks come due at the same minute (system journal + feed-refresh + a few\n// user tasks all at 20:00 UTC), firing every chat in the same event-loop turn\n// floods the machine; the mulmoclaude MCP broker each chat spawns then boots\n// under contention and can lose the startup race to the CLI's first tool call,\n// so that turn fails with `handlePermission not found` (#2057). Spacing the\n// launches by a second gives each broker room to connect. Far under one tick\n// (a handful of tasks spread over a few seconds), so nothing is delayed past\n// its window.\nconst DEFAULT_FIRING_STAGGER_MS = ONE_SECOND_MS;\n\n// The total stagger must stay well inside one tick, or the tail tasks start in a\n// LATER tick window and two ticks overlap. Cap all starts to this fraction of\n// `tickMs` regardless of task count or the configured gap — this keeps a debug\n// `tickMs === firingStaggerMs` (see server boot) from degenerating.\nconst MAX_STAGGER_FRACTION_OF_TICK = 0.5;\n\nconst realSleep = (delayMs: number): Promise<void> => new Promise((resolve) => setTimeout(resolve, delayMs));\n\n// Per-task stagger step: the configured gap, shrunk so the last of `count` tasks\n// still starts within MAX_STAGGER_FRACTION_OF_TICK of the tick. 0 disables it.\nfunction staggerStepMs(staggerMs: number, tickMs: number, count: number): number {\n  if (staggerMs <= 0 || count <= 1) return 0;\n  const maxStepMs = (tickMs * MAX_STAGGER_FRACTION_OF_TICK) / (count - 1);\n  return Math.min(staggerMs, maxStepMs);\n}\n\n/** Minimal logger the engine logs through. Absent one, runs silent. */\nexport interface SchedulerLogger {\n  info: (message: string, data?: Record<string, unknown>) => void;\n  warn: (message: string, data?: Record<string, unknown>) => void;\n  error: (message: string, data?: Record<string, unknown>) => void;\n}\n\nconst NOOP_LOG: SchedulerLogger = { info: () => {}, warn: () => {}, error: () => {} };\n\nexport type TaskSchedule = { type: typeof SCHEDULE_TYPES.interval; intervalMs: number } | { type: typeof SCHEDULE_TYPES.daily; time: string }; // time: \"HH:MM\" in UTC\n\nexport interface TaskRunContext {\n  taskId: string;\n  now: Date;\n}\n\nexport interface TaskDefinition {\n  id: string;\n  description?: string;\n  schedule: TaskSchedule;\n  enabled?: boolean; // default: true\n  /** If set, this task only fires after the named task has completed\n   *  successfully in the current tick cycle. Enforces ordering like\n   *  \"news fetch → journal → memory extraction\". */\n  dependsOn?: string;\n  run: (ctx: TaskRunContext) => Promise<void>;\n}\n\nexport interface TaskSummary {\n  id: string;\n  description?: string;\n  schedule: TaskSchedule;\n  dependsOn?: string;\n}\n\nexport interface ITaskManager {\n  registerTask: (def: TaskDefinition) => void;\n  removeTask: (taskId: string) => void;\n  /** Update the schedule of an existing task. Returns false if not found. */\n  updateSchedule: (taskId: string, schedule: TaskSchedule) => boolean;\n  start: () => void;\n  stop: () => void;\n  /** Run one tick manually (for testing). */\n  tick: () => Promise<void>;\n  listTasks: () => TaskSummary[];\n}\n\nexport interface TaskManagerOptions {\n  tickMs?: number; // default: ONE_MINUTE_MS\n  now?: () => Date; // default: () => new Date()\n  log?: SchedulerLogger; // default: noop\n  /** Gap between the start of each independently-due task in a tick (#2057).\n   *  Default DEFAULT_FIRING_STAGGER_MS; 0 fires them all at once. */\n  firingStaggerMs?: number;\n  /** Injected so tests advance time without real timers. Default setTimeout. */\n  sleep?: (delayMs: number) => Promise<void>;\n}\n\nfunction isDue(now: Date, schedule: TaskSchedule, tickMs: number): boolean {\n  if (schedule.type === SCHEDULE_TYPES.interval) {\n    const msSinceMidnight = now.getUTCHours() * ONE_HOUR_MS + now.getUTCMinutes() * ONE_MINUTE_MS + now.getUTCSeconds() * ONE_SECOND_MS;\n    // Round down to tick boundary, then check if it aligns with the interval\n    const rounded = Math.floor(msSinceMidnight / tickMs) * tickMs;\n    return rounded % schedule.intervalMs === 0;\n  }\n\n  if (schedule.type === SCHEDULE_TYPES.daily) {\n    const [hours, minutes] = schedule.time.split(\":\").map(Number);\n    const targetMs = hours * ONE_HOUR_MS + minutes * ONE_MINUTE_MS;\n    const msSinceMidnight = now.getUTCHours() * ONE_HOUR_MS + now.getUTCMinutes() * ONE_MINUTE_MS + now.getUTCSeconds() * ONE_SECOND_MS;\n    const rounded = Math.floor(msSinceMidnight / tickMs) * tickMs;\n    return rounded === targetMs;\n  }\n\n  return false;\n}\n\n/** Split the due tasks into those that may run immediately and those gated\n *  behind a `dependsOn` edge (resolved later in the same tick cycle). */\nexport function collectDueTasks(\n  currentTime: Date,\n  registry: Map<string, TaskDefinition>,\n  tickMs: number,\n): { independent: TaskDefinition[]; dependent: TaskDefinition[] } {\n  const independent: TaskDefinition[] = [];\n  const dependent: TaskDefinition[] = [];\n  for (const def of registry.values()) {\n    if (def.enabled === false) continue;\n    if (!isDue(currentTime, def.schedule, tickMs)) continue;\n    if (def.dependsOn) {\n      dependent.push(def);\n    } else {\n      independent.push(def);\n    }\n  }\n  return { independent, dependent };\n}\n\nasync function runAndTrack(def: TaskDefinition, currentTime: Date, succeeded: Set<string>, log: SchedulerLogger): Promise<void> {\n  try {\n    await def.run({ taskId: def.id, now: currentTime });\n    succeeded.add(def.id);\n  } catch (err) {\n    log.error(\"task failed\", {\n      id: def.id,\n      error: String(err),\n    });\n  }\n}\n\nasync function runDependentChain(dependent: TaskDefinition[], currentTime: Date, succeeded: Set<string>, log: SchedulerLogger): Promise<void> {\n  let remaining = [...dependent];\n  let progress = true;\n  while (remaining.length > 0 && progress) {\n    progress = false;\n    const next: TaskDefinition[] = [];\n    for (const def of remaining) {\n      const dep = def.dependsOn;\n      if (!dep || !succeeded.has(dep)) {\n        next.push(def);\n        continue;\n      }\n      await runAndTrack(def, currentTime, succeeded, log);\n      progress = true;\n    }\n    remaining = next;\n  }\n}\n\ninterface TickConfig {\n  tickMs: number;\n  staggerMs: number;\n  sleep: (delayMs: number) => Promise<void>;\n  log: SchedulerLogger;\n}\n\nasync function runTick(now: () => Date, registry: Map<string, TaskDefinition>, cfg: TickConfig): Promise<void> {\n  const currentTime = now();\n  const { independent, dependent } = collectDueTasks(currentTime, registry, cfg.tickMs);\n\n  // Per-invocation set — success does not leak across tick() calls.\n  const succeeded = new Set<string>();\n\n  // Staggered start (#2057), still concurrent: each fires after its own capped\n  // delay but the tick awaits them all, preserving the previous \"all due tasks\n  // ran this tick\" contract.\n  const stepMs = staggerStepMs(cfg.staggerMs, cfg.tickMs, independent.length);\n  await Promise.all(\n    independent.map(async (def, index) => {\n      if (stepMs > 0 && index > 0) await cfg.sleep(index * stepMs);\n      await runAndTrack(def, currentTime, succeeded, cfg.log);\n    }),\n  );\n\n  await runDependentChain(dependent, currentTime, succeeded, cfg.log);\n}\n\nexport function listTaskSummaries(registry: Map<string, TaskDefinition>): TaskSummary[] {\n  return [...registry.values()].map((taskDef) => ({\n    id: taskDef.id,\n    description: taskDef.description,\n    schedule: taskDef.schedule,\n    dependsOn: taskDef.dependsOn,\n  }));\n}\n\n// A tick runner that skips re-entry: if the previous tick is still draining its\n// staggered starts, drop this one so a slow tick + short tickMs can never run\n// two ticks concurrently.\nfunction makeGuardedTick(now: () => Date, registry: Map<string, TaskDefinition>, cfg: TickConfig): () => Promise<void> {\n  let ticking = false;\n  return async () => {\n    if (ticking) return;\n    ticking = true;\n    try {\n      await runTick(now, registry, cfg);\n    } finally {\n      ticking = false;\n    }\n  };\n}\n\nfunction resolveTickConfig(options?: TaskManagerOptions): { tickMs: number; now: () => Date; cfg: TickConfig } {\n  const tickMs = options?.tickMs ?? ONE_MINUTE_MS;\n  return {\n    tickMs,\n    now: options?.now ?? (() => new Date()),\n    cfg: {\n      tickMs,\n      staggerMs: options?.firingStaggerMs ?? DEFAULT_FIRING_STAGGER_MS,\n      sleep: options?.sleep ?? realSleep,\n      log: options?.log ?? NOOP_LOG,\n    },\n  };\n}\n\nexport function createTaskManager(options?: TaskManagerOptions): ITaskManager {\n  const { tickMs, now, cfg } = resolveTickConfig(options);\n  const { log } = cfg;\n  const registry = new Map<string, TaskDefinition>();\n  let timer: ReturnType<typeof setInterval> | null = null;\n  const onTick = makeGuardedTick(now, registry, cfg);\n\n  return {\n    async tick() {\n      await onTick();\n    },\n\n    registerTask(def: TaskDefinition) {\n      if (registry.has(def.id)) {\n        throw new Error(`[task-manager] Task \"${def.id}\" is already registered`);\n      }\n      registry.set(def.id, def);\n      log.info(\"registered\", { id: def.id });\n    },\n\n    updateSchedule(taskId: string, schedule: TaskSchedule): boolean {\n      const def = registry.get(taskId);\n      if (!def) return false;\n      def.schedule = schedule;\n      log.info(\"schedule updated\", { id: taskId });\n      return true;\n    },\n\n    removeTask(taskId: string) {\n      if (registry.delete(taskId)) {\n        log.info(\"removed\", { id: taskId });\n      }\n    },\n\n    start() {\n      if (timer) return;\n      // `onTick` guards re-entry but not failure — it has a `finally`, no\n      // `catch` — so handing it straight to setInterval let a rejected tick\n      // escape as an unhandled rejection, which the host turns into a process\n      // exit. The scheduler must outlive one bad tick.\n      timer = setInterval(() => {\n        onTick().catch((err: unknown) => log.error(\"tick failed\", { error: String(err) }));\n      }, tickMs);\n      log.info(\"started\", { tickMs });\n    },\n\n    stop() {\n      if (timer) {\n        clearInterval(timer);\n        timer = null;\n        log.info(\"stopped\");\n      }\n    },\n\n    listTasks() {\n      return listTaskSummaries(registry);\n    },\n  };\n}\n","// Adapter that wires the pure scheduler library (@receptron/task-scheduler)\n// to a host's task-manager + workspace. Registers system tasks, runs\n// catch-up on startup, and persists execution state + logs.\n//\n// Host-agnostic: the workspace root, the atomic file writer, and the\n// logger are injected via `configureScheduler`. The host supplies its OWN\n// system tasks (journal / feeds / user-cron in MulmoClaude) to\n// `initScheduler` — the package owns no task definitions. Deliberately\n// thin: all complex scheduling logic lives in @receptron/task-scheduler.\n\nimport { existsSync } from \"node:fs\";\nimport { readFile, appendFile, mkdir } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport {\n  type TaskSchedule,\n  type TaskExecutionState,\n  type TaskLogEntry,\n  type CatchUpTask,\n  type TaskTrigger,\n  emptyState,\n  computeCatchUpPlan,\n  nextWindowAfter,\n  loadState,\n  updateAndSave,\n  appendLogEntry,\n  queryLog,\n  SCHEDULE_TYPES,\n  TASK_RESULTS,\n  TASK_TRIGGERS,\n  type MISSED_RUN_POLICIES,\n  type StateMap,\n  type StateDeps,\n  type LogDeps,\n} from \"@receptron/task-scheduler\";\nimport type { ITaskManager, TaskDefinition, SchedulerLogger } from \"./task-manager.js\";\n\nconst ONE_SECOND_MS = 1000;\nconst SCHEDULER_CONFIG_DIR = \"config/scheduler\";\nconst SCHEDULER_DATA_DIR = \"data/scheduler/logs\";\n\n// ── Host injection ────────────────────────────────────────────────\n\nexport interface SchedulerConfig {\n  /** Absolute workspace root — state.json + logs hang off it. */\n  workspaceRoot: string;\n  /** Host atomic file writer (used with `uniqueTmp` for the state file). */\n  writeFileAtomic: (filePath: string, content: string, opts: { uniqueTmp: boolean }) => Promise<void>;\n  /** Optional logger. */\n  log?: SchedulerLogger;\n}\n\nconst NOOP_LOG: SchedulerLogger = { info: () => {}, warn: () => {}, error: () => {} };\n\nlet config: SchedulerConfig | null = null;\n\n/** Wire the adapter to a host. Call once at startup, before `initScheduler`. */\nexport function configureScheduler(injected: SchedulerConfig): void {\n  config = injected;\n}\n\nfunction requireConfig(): SchedulerConfig {\n  if (!config) throw new Error(\"scheduler: configureScheduler() not called\");\n  return config;\n}\n\nfunction logger(): SchedulerLogger {\n  return config?.log ?? NOOP_LOG;\n}\n\nfunction errorMessage(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n\n// ── Paths ─────────────────────────────────────────────────────────\n\nfunction stateFilePath(): string {\n  return path.join(requireConfig().workspaceRoot, SCHEDULER_CONFIG_DIR, \"state.json\");\n}\n\nfunction logsDir(): string {\n  return path.join(requireConfig().workspaceRoot, SCHEDULER_DATA_DIR);\n}\n\n// ── I/O deps (real filesystem) ────────────────────────────────────\n\nfunction stateDeps(): StateDeps {\n  return {\n    readFile: (filePath: string) => readFile(filePath, \"utf-8\"),\n    writeFileAtomic: (filePath: string, content: string) => requireConfig().writeFileAtomic(filePath, content, { uniqueTmp: true }),\n    exists: existsSync,\n  };\n}\n\nconst logDeps: LogDeps = {\n  appendFile: (filePath: string, content: string) => appendFile(filePath, content),\n  readFile: (filePath: string) => readFile(filePath, \"utf-8\"),\n  exists: existsSync,\n  ensureDir: (directoryPath: string) => mkdir(directoryPath, { recursive: true }).then(() => {}),\n};\n\n// ── System task registry ──────────────────────────────────────────\n\nexport interface SystemTaskDef {\n  id: string;\n  name: string;\n  description: string;\n  schedule: TaskDefinition[\"schedule\"];\n  missedRunPolicy: typeof MISSED_RUN_POLICIES.skip | typeof MISSED_RUN_POLICIES.runOnce | typeof MISSED_RUN_POLICIES.runAll;\n  run: () => Promise<void>;\n}\n\n// ── Public API ────────────────────────────────────────────────────\n\nlet stateMap: StateMap = new Map();\nconst systemTasks: SystemTaskDef[] = [];\nlet taskManagerRef: ITaskManager | null = null;\n\n/**\n * Initialize the scheduler adapter. Call once at server startup AFTER the\n * task-manager is created but BEFORE `taskManager.start()`.\n */\nexport async function initScheduler(taskManager: ITaskManager, tasks: SystemTaskDef[]): Promise<void> {\n  await mkdir(path.dirname(stateFilePath()), { recursive: true });\n  await mkdir(logsDir(), { recursive: true });\n\n  stateMap = await loadState(stateFilePath(), stateDeps());\n  systemTasks.length = 0;\n  systemTasks.push(...tasks);\n  taskManagerRef = taskManager;\n\n  // Run catch-up\n  const catchUpTasks: CatchUpTask[] = tasks.map((taskDef) => ({\n    id: taskDef.id,\n    name: taskDef.name,\n    schedule: toCoreSchedule(taskDef.schedule),\n    missedRunPolicy: taskDef.missedRunPolicy,\n    enabled: true,\n  }));\n  const plan = computeCatchUpPlan(catchUpTasks, stateMap, Date.now());\n\n  for (const skip of plan.skipped) {\n    logger().info(\"catch-up skipped\", { taskId: skip.taskId, windows: skip.windowCount });\n    await safeUpdateState(skip.taskId, { lastRunAt: skip.lastWindow });\n  }\n\n  if (plan.runs.length > 0) {\n    logger().info(\"catch-up enqueued\", { runs: plan.runs.length });\n    for (const run of plan.runs) {\n      const task = tasks.find((taskDef) => taskDef.id === run.taskId);\n      if (!task) continue;\n      await executeAndLog(task, run.context.scheduledFor, TASK_TRIGGERS.catchUp);\n    }\n  }\n\n  // Register with task-manager for ongoing ticks\n  for (const task of tasks) {\n    taskManager.registerTask({\n      id: task.id,\n      description: task.description,\n      schedule: task.schedule,\n      run: async () => {\n        const windowIso = computeCurrentWindow(task);\n        await executeAndLog(task, windowIso, TASK_TRIGGERS.scheduled);\n      },\n    });\n  }\n\n  logger().info(\"initialized\", { tasks: tasks.map((taskDef) => taskDef.id), stateEntries: stateMap.size });\n}\n\n/** Apply a schedule override to a running system task. Updates the\n *  in-memory task definition, the task-manager, and recalculates\n *  nextScheduledAt in persisted state. */\nexport async function applyScheduleOverride(taskId: string, schedule: SystemTaskDef[\"schedule\"]): Promise<boolean> {\n  const task = systemTasks.find((taskDef) => taskDef.id === taskId);\n  if (!task || !taskManagerRef) return false;\n  if (!taskManagerRef.updateSchedule(taskId, schedule)) return false;\n  task.schedule = schedule;\n\n  // Recalculate next window so the UI reflects the new schedule\n  const nextScheduledAt = computeNextScheduledFor(task.schedule);\n  await safeUpdateState(taskId, { nextScheduledAt });\n\n  return true;\n}\n\n/** Query execution logs — used by API routes. */\nexport async function getSchedulerLogs(opts: { since?: string; taskId?: string; limit?: number }): Promise<TaskLogEntry[]> {\n  return queryLog(logsDir(), opts, logDeps);\n}\n\n/** Get all task states — used by API routes. */\nexport function getSchedulerTasks(): {\n  id: string;\n  name: string;\n  description: string;\n  schedule: TaskDefinition[\"schedule\"];\n  missedRunPolicy: string;\n  state: TaskExecutionState;\n}[] {\n  return systemTasks.map((taskDef) => ({\n    id: taskDef.id,\n    name: taskDef.name,\n    description: taskDef.description,\n    schedule: taskDef.schedule,\n    missedRunPolicy: taskDef.missedRunPolicy,\n    state: stateMap.get(taskDef.id) ?? emptyState(taskDef.id),\n  }));\n}\n\n/** Read the persisted execution state for any task id (system, user, or\n *  skill). Returns an empty state when the id has never run — used by the API\n *  route to attach last-run / next-run / history state to user + skill tasks\n *  it lists from other sources. */\nexport function getSchedulerTaskState(taskId: string): TaskExecutionState {\n  return stateMap.get(taskId) ?? emptyState(taskId);\n}\n\n/** Record a run of an EXTERNAL (skill / user) task — one registered directly\n *  on the task-manager rather than through `initScheduler`. Persists a log\n *  entry + updates state so these tasks get the same history / last-run /\n *  next-run as system tasks. Because they are fire-and-forget (`startChat`\n *  spawns an async chat), `errorMessage` reflects whether the *dispatch*\n *  succeeded, not the chat's eventual outcome; `chatSessionId` links the run\n *  to the spawned session. */\nexport async function recordExternalRun(params: {\n  id: string;\n  name: string;\n  schedule: TaskDefinition[\"schedule\"];\n  scheduledFor: string;\n  startedAt: string;\n  durationMs: number;\n  trigger: TaskTrigger;\n  errorMessage: string | null;\n  chatSessionId?: string;\n}): Promise<void> {\n  await persistRun({\n    meta: { id: params.id, name: params.name, schedule: params.schedule },\n    scheduledFor: params.scheduledFor,\n    startedAt: params.startedAt,\n    durationMs: params.durationMs,\n    trigger: params.trigger,\n    errMsg: params.errorMessage,\n    chatSessionId: params.chatSessionId,\n  });\n}\n\n/** Test-only: clear config + in-memory state. */\nexport function resetSchedulerForTesting(): void {\n  config = null;\n  stateMap = new Map();\n  systemTasks.length = 0;\n  taskManagerRef = null;\n}\n\n// ── Internal ──────────────────────────────────────────────────────\n\nasync function executeAndLog(task: SystemTaskDef, scheduledFor: string, trigger: TaskTrigger): Promise<void> {\n  const startedAt = new Date().toISOString();\n  const startMs = Date.now();\n  let errMsg: string | null = null;\n  try {\n    await task.run();\n  } catch (err) {\n    errMsg = errorMessage(err);\n    logger().error(\"task failed\", { taskId: task.id, error: errMsg });\n  }\n  const durationMs = Date.now() - startMs;\n  // Persistence is best-effort — never let disk failures propagate to the\n  // tick loop or abort startup catch-up.\n  await persistRun({ meta: { id: task.id, name: task.name, schedule: task.schedule }, scheduledFor, startedAt, durationMs, trigger, errMsg });\n}\n\n/** The minimum a run needs to persist state + a log entry — shared by system\n *  tasks (`executeAndLog`) and external skill/user runs (`recordExternalRun`). */\ninterface TaskRunMeta {\n  id: string;\n  name: string;\n  schedule: TaskDefinition[\"schedule\"];\n}\n\ninterface RunRecord {\n  meta: TaskRunMeta;\n  scheduledFor: string;\n  startedAt: string;\n  durationMs: number;\n  trigger: TaskTrigger;\n  errMsg: string | null;\n  chatSessionId?: string;\n}\n\n/** Best-effort persistence — state and log are independent, so one failing\n *  never blocks the other and neither propagates upward. */\nasync function persistRun(run: RunRecord): Promise<void> {\n  await writeRunState(run);\n  await writeRunLog(run);\n}\n\nasync function writeRunState(run: RunRecord): Promise<void> {\n  const { meta, scheduledFor, durationMs, errMsg } = run;\n  const isSuccess = errMsg === null;\n  const currentState = stateMap.get(meta.id);\n  try {\n    await updateAndSave(\n      stateFilePath(),\n      stateMap,\n      meta.id,\n      {\n        lastRunAt: scheduledFor,\n        lastRunResult: isSuccess ? TASK_RESULTS.success : TASK_RESULTS.error,\n        lastRunDurationMs: durationMs,\n        lastErrorMessage: errMsg,\n        consecutiveFailures: isSuccess ? 0 : (currentState?.consecutiveFailures ?? 0) + 1,\n        totalRuns: (currentState?.totalRuns ?? 0) + 1,\n        nextScheduledAt: computeNextScheduledFor(meta.schedule),\n      },\n      stateDeps(),\n    );\n  } catch (err) {\n    logger().warn(\"state persistence failed\", { taskId: meta.id, error: String(err) });\n  }\n}\n\nasync function writeRunLog(run: RunRecord): Promise<void> {\n  const { meta, scheduledFor, startedAt, durationMs, trigger, errMsg, chatSessionId } = run;\n  const isSuccess = errMsg === null;\n  try {\n    await appendLogEntry(\n      logsDir(),\n      {\n        taskId: meta.id,\n        taskName: meta.name,\n        scheduledFor,\n        startedAt,\n        completedAt: new Date().toISOString(),\n        result: isSuccess ? TASK_RESULTS.success : TASK_RESULTS.error,\n        durationMs,\n        trigger,\n        ...(errMsg !== null && { errorMessage: errMsg }),\n        ...(chatSessionId !== undefined && { chatSessionId }),\n      },\n      logDeps,\n    );\n  } catch (err) {\n    logger().warn(\"log persistence failed\", { taskId: meta.id, error: String(err) });\n  }\n}\n\n/** Safe state update — swallows errors. */\nasync function safeUpdateState(taskId: string, patch: Partial<TaskExecutionState>): Promise<void> {\n  try {\n    await updateAndSave(stateFilePath(), stateMap, taskId, patch, stateDeps());\n  } catch (err) {\n    logger().warn(\"state update failed\", { taskId, error: String(err) });\n  }\n}\n\n/** Compute the window boundary that the current tick belongs to. For\n *  scheduled runs, this is the epoch-aligned window — not the wall-clock\n *  time of execution. This keeps lastRunAt consistent with catch-up's\n *  window-based accounting. */\nfunction computeCurrentWindow(task: SystemTaskDef): string {\n  const coreSchedule = toCoreSchedule(task.schedule);\n  // The window that just fired is the latest one at or before now.\n  const nowMs = Date.now();\n  const windowMs = nextWindowAfter(coreSchedule, nowMs - (coreSchedule.type === SCHEDULE_TYPES.interval ? coreSchedule.intervalSec * ONE_SECOND_MS : 0));\n  return windowMs !== null && windowMs <= nowMs ? new Date(windowMs).toISOString() : new Date(nowMs).toISOString();\n}\n\nfunction computeNextScheduledFor(schedule: TaskDefinition[\"schedule\"]): string | null {\n  const coreSchedule = toCoreSchedule(schedule);\n  const next = nextWindowAfter(coreSchedule, Date.now() + 1);\n  return next !== null ? new Date(next).toISOString() : null;\n}\n\nfunction toCoreSchedule(schedule: TaskDefinition[\"schedule\"]): TaskSchedule {\n  if (schedule.type === SCHEDULE_TYPES.interval) {\n    return {\n      type: SCHEDULE_TYPES.interval,\n      intervalSec: Math.round(schedule.intervalMs / ONE_SECOND_MS),\n    };\n  }\n  return schedule;\n}\n"],"mappings":";;;;;AAQA,IAAM,kBAAgB;AACtB,IAAM,gBAAgB,KAAK;AAC3B,IAAM,cAAc,KAAK;AAWzB,IAAM,4BAA4B;AAMlC,IAAM,+BAA+B;AAErC,IAAM,aAAa,YAAmC,IAAI,SAAS,YAAY,WAAW,SAAS,OAAO,CAAC;AAI3G,SAAS,cAAc,WAAmB,QAAgB,OAAuB;CAC/E,IAAI,aAAa,KAAK,SAAS,GAAG,OAAO;CACzC,MAAM,YAAa,SAAS,gCAAiC,QAAQ;CACrE,OAAO,KAAK,IAAI,WAAW,SAAS;AACtC;AASA,IAAM,aAA4B;CAAE,YAAY,CAAC;CAAG,YAAY,CAAC;CAAG,aAAa,CAAC;AAAE;AAmDpF,SAAS,MAAM,KAAW,UAAwB,QAAyB;CACzE,IAAI,SAAS,SAAS,eAAe,UAAU;EAC7C,MAAM,kBAAkB,IAAI,YAAY,IAAI,cAAc,IAAI,cAAc,IAAI,gBAAgB,IAAI,cAAc,IAAI;EAGtH,OADgB,KAAK,MAAM,kBAAkB,MAAM,IAAI,SACtC,SAAS,eAAe;CAC3C;CAEA,IAAI,SAAS,SAAS,eAAe,OAAO;EAC1C,MAAM,CAAC,OAAO,WAAW,SAAS,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM;EAC5D,MAAM,WAAW,QAAQ,cAAc,UAAU;EACjD,MAAM,kBAAkB,IAAI,YAAY,IAAI,cAAc,IAAI,cAAc,IAAI,gBAAgB,IAAI,cAAc,IAAI;EAEtH,OADgB,KAAK,MAAM,kBAAkB,MAAM,IAAI,WACpC;CACrB;CAEA,OAAO;AACT;;;AAIA,SAAgB,gBACd,aACA,UACA,QACgE;CAChE,MAAM,cAAgC,CAAC;CACvC,MAAM,YAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,SAAS,OAAO,GAAG;EACnC,IAAI,IAAI,YAAY,OAAO;EAC3B,IAAI,CAAC,MAAM,aAAa,IAAI,UAAU,MAAM,GAAG;EAC/C,IAAI,IAAI,WACN,UAAU,KAAK,GAAG;OAElB,YAAY,KAAK,GAAG;CAExB;CACA,OAAO;EAAE;EAAa;CAAU;AAClC;AAEA,eAAe,YAAY,KAAqB,aAAmB,WAAwB,KAAqC;CAC9H,IAAI;EACF,MAAM,IAAI,IAAI;GAAE,QAAQ,IAAI;GAAI,KAAK;EAAY,CAAC;EAClD,UAAU,IAAI,IAAI,EAAE;CACtB,SAAS,KAAK;EACZ,IAAI,MAAM,eAAe;GACvB,IAAI,IAAI;GACR,OAAO,OAAO,GAAG;EACnB,CAAC;CACH;AACF;AAEA,eAAe,kBAAkB,WAA6B,aAAmB,WAAwB,KAAqC;CAC5I,IAAI,YAAY,CAAC,GAAG,SAAS;CAC7B,IAAI,WAAW;CACf,OAAO,UAAU,SAAS,KAAK,UAAU;EACvC,WAAW;EACX,MAAM,OAAyB,CAAC;EAChC,KAAK,MAAM,OAAO,WAAW;GAC3B,MAAM,MAAM,IAAI;GAChB,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,GAAG,GAAG;IAC/B,KAAK,KAAK,GAAG;IACb;GACF;GACA,MAAM,YAAY,KAAK,aAAa,WAAW,GAAG;GAClD,WAAW;EACb;EACA,YAAY;CACd;AACF;AASA,eAAe,QAAQ,KAAiB,UAAuC,KAAgC;CAC7G,MAAM,cAAc,IAAI;CACxB,MAAM,EAAE,aAAa,cAAc,gBAAgB,aAAa,UAAU,IAAI,MAAM;CAGpF,MAAM,4BAAY,IAAI,IAAY;CAKlC,MAAM,SAAS,cAAc,IAAI,WAAW,IAAI,QAAQ,YAAY,MAAM;CAC1E,MAAM,QAAQ,IACZ,YAAY,IAAI,OAAO,KAAK,UAAU;EACpC,IAAI,SAAS,KAAK,QAAQ,GAAG,MAAM,IAAI,MAAM,QAAQ,MAAM;EAC3D,MAAM,YAAY,KAAK,aAAa,WAAW,IAAI,GAAG;CACxD,CAAC,CACH;CAEA,MAAM,kBAAkB,WAAW,aAAa,WAAW,IAAI,GAAG;AACpE;AAEA,SAAgB,kBAAkB,UAAsD;CACtF,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,aAAa;EAC9C,IAAI,QAAQ;EACZ,aAAa,QAAQ;EACrB,UAAU,QAAQ;EAClB,WAAW,QAAQ;CACrB,EAAE;AACJ;AAKA,SAAS,gBAAgB,KAAiB,UAAuC,KAAsC;CACrH,IAAI,UAAU;CACd,OAAO,YAAY;EACjB,IAAI,SAAS;EACb,UAAU;EACV,IAAI;GACF,MAAM,QAAQ,KAAK,UAAU,GAAG;EAClC,UAAU;GACR,UAAU;EACZ;CACF;AACF;AAEA,SAAS,kBAAkB,SAAoF;CAC7G,MAAM,SAAS,SAAS,UAAU;CAClC,OAAO;EACL;EACA,KAAK,SAAS,8BAAc,IAAI,KAAK;EACrC,KAAK;GACH;GACA,WAAW,SAAS,mBAAmB;GACvC,OAAO,SAAS,SAAS;GACzB,KAAK,SAAS,OAAO;EACvB;CACF;AACF;AAEA,SAAgB,kBAAkB,SAA4C;CAC5E,MAAM,EAAE,QAAQ,KAAK,QAAQ,kBAAkB,OAAO;CACtD,MAAM,EAAE,QAAQ;CAChB,MAAM,2BAAW,IAAI,IAA4B;CACjD,IAAI,QAA+C;CACnD,MAAM,SAAS,gBAAgB,KAAK,UAAU,GAAG;CAEjD,OAAO;EACL,MAAM,OAAO;GACX,MAAM,OAAO;EACf;EAEA,aAAa,KAAqB;GAChC,IAAI,SAAS,IAAI,IAAI,EAAE,GACrB,MAAM,IAAI,MAAM,wBAAwB,IAAI,GAAG,wBAAwB;GAEzE,SAAS,IAAI,IAAI,IAAI,GAAG;GACxB,IAAI,KAAK,cAAc,EAAE,IAAI,IAAI,GAAG,CAAC;EACvC;EAEA,eAAe,QAAgB,UAAiC;GAC9D,MAAM,MAAM,SAAS,IAAI,MAAM;GAC/B,IAAI,CAAC,KAAK,OAAO;GACjB,IAAI,WAAW;GACf,IAAI,KAAK,oBAAoB,EAAE,IAAI,OAAO,CAAC;GAC3C,OAAO;EACT;EAEA,WAAW,QAAgB;GACzB,IAAI,SAAS,OAAO,MAAM,GACxB,IAAI,KAAK,WAAW,EAAE,IAAI,OAAO,CAAC;EAEtC;EAEA,QAAQ;GACN,IAAI,OAAO;GAKX,QAAQ,kBAAkB;IACxB,OAAO,CAAC,CAAC,OAAO,QAAiB,IAAI,MAAM,eAAe,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC,CAAC;GACnF,GAAG,MAAM;GACT,IAAI,KAAK,WAAW,EAAE,OAAO,CAAC;EAChC;EAEA,OAAO;GACL,IAAI,OAAO;IACT,cAAc,KAAK;IACnB,QAAQ;IACR,IAAI,KAAK,SAAS;GACpB;EACF;EAEA,YAAY;GACV,OAAO,kBAAkB,QAAQ;EACnC;CACF;AACF;;;ACjQA,IAAM,gBAAgB;AACtB,IAAM,uBAAuB;AAC7B,IAAM,qBAAqB;AAa3B,IAAM,WAA4B;CAAE,YAAY,CAAC;CAAG,YAAY,CAAC;CAAG,aAAa,CAAC;AAAE;AAEpF,IAAI,SAAiC;;AAGrC,SAAgB,mBAAmB,UAAiC;CAClE,SAAS;AACX;AAEA,SAAS,gBAAiC;CACxC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,4CAA4C;CACzE,OAAO;AACT;AAEA,SAAS,SAA0B;CACjC,OAAO,QAAQ,OAAO;AACxB;AAEA,SAAS,aAAa,KAAsB;CAC1C,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;AAIA,SAAS,gBAAwB;CAC/B,OAAO,KAAK,KAAK,cAAc,CAAC,CAAC,eAAe,sBAAsB,YAAY;AACpF;AAEA,SAAS,UAAkB;CACzB,OAAO,KAAK,KAAK,cAAc,CAAC,CAAC,eAAe,kBAAkB;AACpE;AAIA,SAAS,YAAuB;CAC9B,OAAO;EACL,WAAW,aAAqB,SAAS,UAAU,OAAO;EAC1D,kBAAkB,UAAkB,YAAoB,cAAc,CAAC,CAAC,gBAAgB,UAAU,SAAS,EAAE,WAAW,KAAK,CAAC;EAC9H,QAAQ;CACV;AACF;AAEA,IAAM,UAAmB;CACvB,aAAa,UAAkB,YAAoB,WAAW,UAAU,OAAO;CAC/E,WAAW,aAAqB,SAAS,UAAU,OAAO;CAC1D,QAAQ;CACR,YAAY,kBAA0B,MAAM,eAAe,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;AAC/F;AAeA,IAAI,2BAAqB,IAAI,IAAI;AACjC,IAAM,cAA+B,CAAC;AACtC,IAAI,iBAAsC;;;;;AAM1C,eAAsB,cAAc,aAA2B,OAAuC;CACpG,MAAM,MAAM,KAAK,QAAQ,cAAc,CAAC,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9D,MAAM,MAAM,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAE1C,WAAW,MAAM,UAAU,cAAc,GAAG,UAAU,CAAC;CACvD,YAAY,SAAS;CACrB,YAAY,KAAK,GAAG,KAAK;CACzB,iBAAiB;CAUjB,MAAM,OAAO,mBAPuB,MAAM,KAAK,aAAa;EAC1D,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,UAAU,eAAe,QAAQ,QAAQ;EACzC,iBAAiB,QAAQ;EACzB,SAAS;CACX,EACgC,GAAc,UAAU,KAAK,IAAI,CAAC;CAElE,KAAK,MAAM,QAAQ,KAAK,SAAS;EAC/B,OAAO,CAAC,CAAC,KAAK,oBAAoB;GAAE,QAAQ,KAAK;GAAQ,SAAS,KAAK;EAAY,CAAC;EACpF,MAAM,gBAAgB,KAAK,QAAQ,EAAE,WAAW,KAAK,WAAW,CAAC;CACnE;CAEA,IAAI,KAAK,KAAK,SAAS,GAAG;EACxB,OAAO,CAAC,CAAC,KAAK,qBAAqB,EAAE,MAAM,KAAK,KAAK,OAAO,CAAC;EAC7D,KAAK,MAAM,OAAO,KAAK,MAAM;GAC3B,MAAM,OAAO,MAAM,MAAM,YAAY,QAAQ,OAAO,IAAI,MAAM;GAC9D,IAAI,CAAC,MAAM;GACX,MAAM,cAAc,MAAM,IAAI,QAAQ,cAAc,gBAAc,OAAO;EAC3E;CACF;CAGA,KAAK,MAAM,QAAQ,OACjB,YAAY,aAAa;EACvB,IAAI,KAAK;EACT,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,KAAK,YAAY;GACf,MAAM,YAAY,qBAAqB,IAAI;GAC3C,MAAM,cAAc,MAAM,WAAW,gBAAc,SAAS;EAC9D;CACF,CAAC;CAGH,OAAO,CAAC,CAAC,KAAK,eAAe;EAAE,OAAO,MAAM,KAAK,YAAY,QAAQ,EAAE;EAAG,cAAc,SAAS;CAAK,CAAC;AACzG;;;;AAKA,eAAsB,sBAAsB,QAAgB,UAAuD;CACjH,MAAM,OAAO,YAAY,MAAM,YAAY,QAAQ,OAAO,MAAM;CAChE,IAAI,CAAC,QAAQ,CAAC,gBAAgB,OAAO;CACrC,IAAI,CAAC,eAAe,eAAe,QAAQ,QAAQ,GAAG,OAAO;CAC7D,KAAK,WAAW;CAIhB,MAAM,gBAAgB,QAAQ,EAAE,iBADR,wBAAwB,KAAK,QACrB,EAAgB,CAAC;CAEjD,OAAO;AACT;;AAGA,eAAsB,iBAAiB,MAAoF;CACzH,OAAO,SAAS,QAAQ,GAAG,MAAM,OAAO;AAC1C;;AAGA,SAAgB,oBAOZ;CACF,OAAO,YAAY,KAAK,aAAa;EACnC,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,aAAa,QAAQ;EACrB,UAAU,QAAQ;EAClB,iBAAiB,QAAQ;EACzB,OAAO,SAAS,IAAI,QAAQ,EAAE,KAAK,WAAW,QAAQ,EAAE;CAC1D,EAAE;AACJ;;;;;AAMA,SAAgB,sBAAsB,QAAoC;CACxE,OAAO,SAAS,IAAI,MAAM,KAAK,WAAW,MAAM;AAClD;;;;;;;;AASA,eAAsB,kBAAkB,QAUtB;CAChB,MAAM,WAAW;EACf,MAAM;GAAE,IAAI,OAAO;GAAI,MAAM,OAAO;GAAM,UAAU,OAAO;EAAS;EACpE,cAAc,OAAO;EACrB,WAAW,OAAO;EAClB,YAAY,OAAO;EACnB,SAAS,OAAO;EAChB,QAAQ,OAAO;EACf,eAAe,OAAO;CACxB,CAAC;AACH;;AAGA,SAAgB,2BAAiC;CAC/C,SAAS;CACT,2BAAW,IAAI,IAAI;CACnB,YAAY,SAAS;CACrB,iBAAiB;AACnB;AAIA,eAAe,cAAc,MAAqB,cAAsB,SAAqC;CAC3G,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;CACzC,MAAM,UAAU,KAAK,IAAI;CACzB,IAAI,SAAwB;CAC5B,IAAI;EACF,MAAM,KAAK,IAAI;CACjB,SAAS,KAAK;EACZ,SAAS,aAAa,GAAG;EACzB,OAAO,CAAC,CAAC,MAAM,eAAe;GAAE,QAAQ,KAAK;GAAI,OAAO;EAAO,CAAC;CAClE;CACA,MAAM,aAAa,KAAK,IAAI,IAAI;CAGhC,MAAM,WAAW;EAAE,MAAM;GAAE,IAAI,KAAK;GAAI,MAAM,KAAK;GAAM,UAAU,KAAK;EAAS;EAAG;EAAc;EAAW;EAAY;EAAS;CAAO,CAAC;AAC5I;;;AAsBA,eAAe,WAAW,KAA+B;CACvD,MAAM,cAAc,GAAG;CACvB,MAAM,YAAY,GAAG;AACvB;AAEA,eAAe,cAAc,KAA+B;CAC1D,MAAM,EAAE,MAAM,cAAc,YAAY,WAAW;CACnD,MAAM,YAAY,WAAW;CAC7B,MAAM,eAAe,SAAS,IAAI,KAAK,EAAE;CACzC,IAAI;EACF,MAAM,cACJ,cAAc,GACd,UACA,KAAK,IACL;GACE,WAAW;GACX,eAAe,YAAY,aAAa,UAAU,aAAa;GAC/D,mBAAmB;GACnB,kBAAkB;GAClB,qBAAqB,YAAY,KAAK,cAAc,uBAAuB,KAAK;GAChF,YAAY,cAAc,aAAa,KAAK;GAC5C,iBAAiB,wBAAwB,KAAK,QAAQ;EACxD,GACA,UAAU,CACZ;CACF,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,4BAA4B;GAAE,QAAQ,KAAK;GAAI,OAAO,OAAO,GAAG;EAAE,CAAC;CACnF;AACF;AAEA,eAAe,YAAY,KAA+B;CACxD,MAAM,EAAE,MAAM,cAAc,WAAW,YAAY,SAAS,QAAQ,kBAAkB;CACtF,MAAM,YAAY,WAAW;CAC7B,IAAI;EACF,MAAM,eACJ,QAAQ,GACR;GACE,QAAQ,KAAK;GACb,UAAU,KAAK;GACf;GACA;GACA,8BAAa,IAAI,KAAK,EAAA,CAAE,YAAY;GACpC,QAAQ,YAAY,aAAa,UAAU,aAAa;GACxD;GACA;GACA,GAAI,WAAW,QAAQ,EAAE,cAAc,OAAO;GAC9C,GAAI,kBAAkB,KAAA,KAAa,EAAE,cAAc;EACrD,GACA,OACF;CACF,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,0BAA0B;GAAE,QAAQ,KAAK;GAAI,OAAO,OAAO,GAAG;EAAE,CAAC;CACjF;AACF;;AAGA,eAAe,gBAAgB,QAAgB,OAAmD;CAChG,IAAI;EACF,MAAM,cAAc,cAAc,GAAG,UAAU,QAAQ,OAAO,UAAU,CAAC;CAC3E,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,uBAAuB;GAAE;GAAQ,OAAO,OAAO,GAAG;EAAE,CAAC;CACrE;AACF;;;;;AAMA,SAAS,qBAAqB,MAA6B;CACzD,MAAM,eAAe,eAAe,KAAK,QAAQ;CAEjD,MAAM,QAAQ,KAAK,IAAI;CACvB,MAAM,WAAW,gBAAgB,cAAc,SAAS,aAAa,SAAS,eAAe,WAAW,aAAa,cAAc,gBAAgB,EAAE;CACrJ,OAAO,aAAa,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,CAAC,CAAC,YAAY,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,YAAY;AACjH;AAEA,SAAS,wBAAwB,UAAqD;CAEpF,MAAM,OAAO,gBADQ,eAAe,QACP,GAAc,KAAK,IAAI,IAAI,CAAC;CACzD,OAAO,SAAS,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,YAAY,IAAI;AACxD;AAEA,SAAS,eAAe,UAAoD;CAC1E,IAAI,SAAS,SAAS,eAAe,UACnC,OAAO;EACL,MAAM,eAAe;EACrB,aAAa,KAAK,MAAM,SAAS,aAAa,aAAa;CAC7D;CAEF,OAAO;AACT"}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/scheduler/task-manager.ts","../../src/scheduler/adapter.ts"],"sourcesContent":["// Generic dependency-ordered cron tick engine. Host-agnostic: the only\n// host coupling (a logger) is injected via options. Schedules are either\n// fixed intervals or a daily UTC time; tasks may declare a `dependsOn`\n// edge so an ordering like \"news fetch → journal → memory extraction\"\n// runs in sequence within one tick.\n\nimport { SCHEDULE_TYPES } from \"@receptron/task-scheduler\";\n\nconst ONE_SECOND_MS = 1000;\nconst ONE_MINUTE_MS = 60 * ONE_SECOND_MS;\nconst ONE_HOUR_MS = 60 * ONE_MINUTE_MS;\n\n// Gap between the START of each independently-due task within one tick. When\n// many tasks come due at the same minute (system journal + feed-refresh + a few\n// user tasks all at 20:00 UTC), firing every chat in the same event-loop turn\n// floods the machine; the mulmoclaude MCP broker each chat spawns then boots\n// under contention and can lose the startup race to the CLI's first tool call,\n// so that turn fails with `handlePermission not found` (#2057). Spacing the\n// launches by a second gives each broker room to connect. Far under one tick\n// (a handful of tasks spread over a few seconds), so nothing is delayed past\n// its window.\nconst DEFAULT_FIRING_STAGGER_MS = ONE_SECOND_MS;\n\n// The total stagger must stay well inside one tick, or the tail tasks start in a\n// LATER tick window and two ticks overlap. Cap all starts to this fraction of\n// `tickMs` regardless of task count or the configured gap — this keeps a debug\n// `tickMs === firingStaggerMs` (see server boot) from degenerating.\nconst MAX_STAGGER_FRACTION_OF_TICK = 0.5;\n\nconst realSleep = (delayMs: number): Promise<void> => new Promise((resolve) => setTimeout(resolve, delayMs));\n\n// Per-task stagger step: the configured gap, shrunk so the last of `count` tasks\n// still starts within MAX_STAGGER_FRACTION_OF_TICK of the tick. 0 disables it.\nfunction staggerStepMs(staggerMs: number, tickMs: number, count: number): number {\n  if (staggerMs <= 0 || count <= 1) return 0;\n  const maxStepMs = (tickMs * MAX_STAGGER_FRACTION_OF_TICK) / (count - 1);\n  return Math.min(staggerMs, maxStepMs);\n}\n\n/** Minimal logger the engine logs through. Absent one, runs silent. */\nexport interface SchedulerLogger {\n  info: (message: string, data?: Record<string, unknown>) => void;\n  warn: (message: string, data?: Record<string, unknown>) => void;\n  error: (message: string, data?: Record<string, unknown>) => void;\n}\n\nconst NOOP_LOG: SchedulerLogger = { info: () => {}, warn: () => {}, error: () => {} };\n\nexport type TaskSchedule = { type: typeof SCHEDULE_TYPES.interval; intervalMs: number } | { type: typeof SCHEDULE_TYPES.daily; time: string }; // time: \"HH:MM\" in UTC\n\nexport interface TaskRunContext {\n  taskId: string;\n  now: Date;\n}\n\nexport interface TaskDefinition {\n  id: string;\n  description?: string;\n  schedule: TaskSchedule;\n  enabled?: boolean; // default: true\n  /** If set, this task only fires after the named task has completed\n   *  successfully in the current tick cycle. Enforces ordering like\n   *  \"news fetch → journal → memory extraction\". */\n  dependsOn?: string;\n  run: (ctx: TaskRunContext) => Promise<void>;\n}\n\nexport interface TaskSummary {\n  id: string;\n  description?: string;\n  schedule: TaskSchedule;\n  dependsOn?: string;\n}\n\nexport interface ITaskManager {\n  registerTask: (def: TaskDefinition) => void;\n  removeTask: (taskId: string) => void;\n  /** Update the schedule of an existing task. Returns false if not found. */\n  updateSchedule: (taskId: string, schedule: TaskSchedule) => boolean;\n  start: () => void;\n  stop: () => void;\n  /** Run one tick manually (for testing). */\n  tick: () => Promise<void>;\n  listTasks: () => TaskSummary[];\n}\n\nexport interface TaskManagerOptions {\n  tickMs?: number; // default: ONE_MINUTE_MS\n  now?: () => Date; // default: () => new Date()\n  log?: SchedulerLogger; // default: noop\n  /** Gap between the start of each independently-due task in a tick (#2057).\n   *  Default DEFAULT_FIRING_STAGGER_MS; 0 fires them all at once. */\n  firingStaggerMs?: number;\n  /** Injected so tests advance time without real timers. Default setTimeout. */\n  sleep?: (delayMs: number) => Promise<void>;\n}\n\nfunction isDue(now: Date, schedule: TaskSchedule, tickMs: number): boolean {\n  if (schedule.type === SCHEDULE_TYPES.interval) {\n    const msSinceMidnight = now.getUTCHours() * ONE_HOUR_MS + now.getUTCMinutes() * ONE_MINUTE_MS + now.getUTCSeconds() * ONE_SECOND_MS;\n    // Round down to tick boundary, then check if it aligns with the interval\n    const rounded = Math.floor(msSinceMidnight / tickMs) * tickMs;\n    return rounded % schedule.intervalMs === 0;\n  }\n\n  if (schedule.type === SCHEDULE_TYPES.daily) {\n    const [hours, minutes] = schedule.time.split(\":\").map(Number);\n    const targetMs = hours * ONE_HOUR_MS + minutes * ONE_MINUTE_MS;\n    const msSinceMidnight = now.getUTCHours() * ONE_HOUR_MS + now.getUTCMinutes() * ONE_MINUTE_MS + now.getUTCSeconds() * ONE_SECOND_MS;\n    const rounded = Math.floor(msSinceMidnight / tickMs) * tickMs;\n    return rounded === targetMs;\n  }\n\n  return false;\n}\n\n/** Split the due tasks into those that may run immediately and those gated\n *  behind a `dependsOn` edge (resolved later in the same tick cycle). */\nexport function collectDueTasks(\n  currentTime: Date,\n  registry: Map<string, TaskDefinition>,\n  tickMs: number,\n): { independent: TaskDefinition[]; dependent: TaskDefinition[] } {\n  const independent: TaskDefinition[] = [];\n  const dependent: TaskDefinition[] = [];\n  for (const def of registry.values()) {\n    if (def.enabled === false) continue;\n    if (!isDue(currentTime, def.schedule, tickMs)) continue;\n    if (def.dependsOn) {\n      dependent.push(def);\n    } else {\n      independent.push(def);\n    }\n  }\n  return { independent, dependent };\n}\n\nasync function runAndTrack(def: TaskDefinition, currentTime: Date, succeeded: Set<string>, log: SchedulerLogger): Promise<void> {\n  try {\n    await def.run({ taskId: def.id, now: currentTime });\n    succeeded.add(def.id);\n  } catch (err) {\n    log.error(\"task failed\", {\n      id: def.id,\n      error: String(err),\n    });\n  }\n}\n\nasync function runDependentChain(dependent: TaskDefinition[], currentTime: Date, succeeded: Set<string>, log: SchedulerLogger): Promise<void> {\n  let remaining = [...dependent];\n  let progress = true;\n  while (remaining.length > 0 && progress) {\n    progress = false;\n    const next: TaskDefinition[] = [];\n    for (const def of remaining) {\n      const dep = def.dependsOn;\n      if (!dep || !succeeded.has(dep)) {\n        next.push(def);\n        continue;\n      }\n      await runAndTrack(def, currentTime, succeeded, log);\n      progress = true;\n    }\n    remaining = next;\n  }\n}\n\ninterface TickConfig {\n  tickMs: number;\n  staggerMs: number;\n  sleep: (delayMs: number) => Promise<void>;\n  log: SchedulerLogger;\n}\n\nasync function runTick(now: () => Date, registry: Map<string, TaskDefinition>, cfg: TickConfig): Promise<void> {\n  const currentTime = now();\n  const { independent, dependent } = collectDueTasks(currentTime, registry, cfg.tickMs);\n\n  // Per-invocation set — success does not leak across tick() calls.\n  const succeeded = new Set<string>();\n\n  // Staggered start (#2057), still concurrent: each fires after its own capped\n  // delay but the tick awaits them all, preserving the previous \"all due tasks\n  // ran this tick\" contract.\n  const stepMs = staggerStepMs(cfg.staggerMs, cfg.tickMs, independent.length);\n  await Promise.all(\n    independent.map(async (def, index) => {\n      if (stepMs > 0 && index > 0) await cfg.sleep(index * stepMs);\n      await runAndTrack(def, currentTime, succeeded, cfg.log);\n    }),\n  );\n\n  await runDependentChain(dependent, currentTime, succeeded, cfg.log);\n}\n\nexport function listTaskSummaries(registry: Map<string, TaskDefinition>): TaskSummary[] {\n  return [...registry.values()].map((taskDef) => ({\n    id: taskDef.id,\n    description: taskDef.description,\n    schedule: taskDef.schedule,\n    dependsOn: taskDef.dependsOn,\n  }));\n}\n\n// A tick runner that skips re-entry: if the previous tick is still draining its\n// staggered starts, drop this one so a slow tick + short tickMs can never run\n// two ticks concurrently.\nfunction makeGuardedTick(now: () => Date, registry: Map<string, TaskDefinition>, cfg: TickConfig): () => Promise<void> {\n  let ticking = false;\n  return async () => {\n    if (ticking) return;\n    ticking = true;\n    try {\n      await runTick(now, registry, cfg);\n    } finally {\n      ticking = false;\n    }\n  };\n}\n\nfunction resolveTickConfig(options?: TaskManagerOptions): { tickMs: number; now: () => Date; cfg: TickConfig } {\n  const tickMs = options?.tickMs ?? ONE_MINUTE_MS;\n  return {\n    tickMs,\n    now: options?.now ?? (() => new Date()),\n    cfg: {\n      tickMs,\n      staggerMs: options?.firingStaggerMs ?? DEFAULT_FIRING_STAGGER_MS,\n      sleep: options?.sleep ?? realSleep,\n      log: options?.log ?? NOOP_LOG,\n    },\n  };\n}\n\nexport function createTaskManager(options?: TaskManagerOptions): ITaskManager {\n  const { tickMs, now, cfg } = resolveTickConfig(options);\n  const { log } = cfg;\n  const registry = new Map<string, TaskDefinition>();\n  let timer: ReturnType<typeof setInterval> | null = null;\n  const onTick = makeGuardedTick(now, registry, cfg);\n\n  return {\n    async tick() {\n      await onTick();\n    },\n\n    registerTask(def: TaskDefinition) {\n      if (registry.has(def.id)) {\n        throw new Error(`[task-manager] Task \"${def.id}\" is already registered`);\n      }\n      registry.set(def.id, def);\n      log.info(\"registered\", { id: def.id });\n    },\n\n    updateSchedule(taskId: string, schedule: TaskSchedule): boolean {\n      const def = registry.get(taskId);\n      if (!def) return false;\n      def.schedule = schedule;\n      log.info(\"schedule updated\", { id: taskId });\n      return true;\n    },\n\n    removeTask(taskId: string) {\n      if (registry.delete(taskId)) {\n        log.info(\"removed\", { id: taskId });\n      }\n    },\n\n    start() {\n      if (timer) return;\n      // `onTick` guards re-entry but not failure — it has a `finally`, no\n      // `catch` — so handing it straight to setInterval let a rejected tick\n      // escape as an unhandled rejection, which the host turns into a process\n      // exit. The scheduler must outlive one bad tick.\n      timer = setInterval(() => {\n        onTick().catch((err: unknown) => log.error(\"tick failed\", { error: String(err) }));\n      }, tickMs);\n      log.info(\"started\", { tickMs });\n    },\n\n    stop() {\n      if (timer) {\n        clearInterval(timer);\n        timer = null;\n        log.info(\"stopped\");\n      }\n    },\n\n    listTasks() {\n      return listTaskSummaries(registry);\n    },\n  };\n}\n","// Adapter that wires the pure scheduler library (@receptron/task-scheduler)\n// to a host's task-manager + workspace. Registers system tasks, runs\n// catch-up on startup, and persists execution state + logs.\n//\n// Host-agnostic: the workspace root, the atomic file writer, and the\n// logger are injected via `configureScheduler`. The host supplies its OWN\n// system tasks (journal / feeds / user-cron in MulmoClaude) to\n// `initScheduler` — the package owns no task definitions. Deliberately\n// thin: all complex scheduling logic lives in @receptron/task-scheduler.\n\nimport { existsSync } from \"node:fs\";\nimport { readFile, appendFile, mkdir } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport {\n  type TaskSchedule,\n  type TaskExecutionState,\n  type TaskLogEntry,\n  type CatchUpTask,\n  type TaskTrigger,\n  emptyState,\n  computeCatchUpPlan,\n  nextWindowAfter,\n  loadState,\n  updateAndSave,\n  appendLogEntry,\n  queryLog,\n  SCHEDULE_TYPES,\n  TASK_RESULTS,\n  TASK_TRIGGERS,\n  type MISSED_RUN_POLICIES,\n  type StateMap,\n  type StateDeps,\n  type LogDeps,\n} from \"@receptron/task-scheduler\";\nimport type { ITaskManager, TaskDefinition, SchedulerLogger } from \"./task-manager.js\";\nimport { errorMessage } from \"../utils/errors.js\";\n\nconst ONE_SECOND_MS = 1000;\nconst SCHEDULER_CONFIG_DIR = \"config/scheduler\";\nconst SCHEDULER_DATA_DIR = \"data/scheduler/logs\";\n\n// ── Host injection ────────────────────────────────────────────────\n\nexport interface SchedulerConfig {\n  /** Absolute workspace root — state.json + logs hang off it. */\n  workspaceRoot: string;\n  /** Host atomic file writer (used with `uniqueTmp` for the state file). */\n  writeFileAtomic: (filePath: string, content: string, opts: { uniqueTmp: boolean }) => Promise<void>;\n  /** Optional logger. */\n  log?: SchedulerLogger;\n}\n\nconst NOOP_LOG: SchedulerLogger = { info: () => {}, warn: () => {}, error: () => {} };\n\nlet config: SchedulerConfig | null = null;\n\n/** Wire the adapter to a host. Call once at startup, before `initScheduler`. */\nexport function configureScheduler(injected: SchedulerConfig): void {\n  config = injected;\n}\n\nfunction requireConfig(): SchedulerConfig {\n  if (!config) throw new Error(\"scheduler: configureScheduler() not called\");\n  return config;\n}\n\nfunction logger(): SchedulerLogger {\n  return config?.log ?? NOOP_LOG;\n}\n\n// ── Paths ─────────────────────────────────────────────────────────\n\nfunction stateFilePath(): string {\n  return path.join(requireConfig().workspaceRoot, SCHEDULER_CONFIG_DIR, \"state.json\");\n}\n\nfunction logsDir(): string {\n  return path.join(requireConfig().workspaceRoot, SCHEDULER_DATA_DIR);\n}\n\n// ── I/O deps (real filesystem) ────────────────────────────────────\n\nfunction stateDeps(): StateDeps {\n  return {\n    readFile: (filePath: string) => readFile(filePath, \"utf-8\"),\n    writeFileAtomic: (filePath: string, content: string) => requireConfig().writeFileAtomic(filePath, content, { uniqueTmp: true }),\n    exists: existsSync,\n  };\n}\n\nconst logDeps: LogDeps = {\n  appendFile: (filePath: string, content: string) => appendFile(filePath, content),\n  readFile: (filePath: string) => readFile(filePath, \"utf-8\"),\n  exists: existsSync,\n  ensureDir: (directoryPath: string) => mkdir(directoryPath, { recursive: true }).then(() => {}),\n};\n\n// ── System task registry ──────────────────────────────────────────\n\nexport interface SystemTaskDef {\n  id: string;\n  name: string;\n  description: string;\n  schedule: TaskDefinition[\"schedule\"];\n  missedRunPolicy: typeof MISSED_RUN_POLICIES.skip | typeof MISSED_RUN_POLICIES.runOnce | typeof MISSED_RUN_POLICIES.runAll;\n  run: () => Promise<void>;\n}\n\n// ── Public API ────────────────────────────────────────────────────\n\nlet stateMap: StateMap = new Map();\nconst systemTasks: SystemTaskDef[] = [];\nlet taskManagerRef: ITaskManager | null = null;\n\n/**\n * Initialize the scheduler adapter. Call once at server startup AFTER the\n * task-manager is created but BEFORE `taskManager.start()`.\n */\nexport async function initScheduler(taskManager: ITaskManager, tasks: SystemTaskDef[]): Promise<void> {\n  await mkdir(path.dirname(stateFilePath()), { recursive: true });\n  await mkdir(logsDir(), { recursive: true });\n\n  stateMap = await loadState(stateFilePath(), stateDeps());\n  systemTasks.length = 0;\n  systemTasks.push(...tasks);\n  taskManagerRef = taskManager;\n\n  // Run catch-up\n  const catchUpTasks: CatchUpTask[] = tasks.map((taskDef) => ({\n    id: taskDef.id,\n    name: taskDef.name,\n    schedule: toCoreSchedule(taskDef.schedule),\n    missedRunPolicy: taskDef.missedRunPolicy,\n    enabled: true,\n  }));\n  const plan = computeCatchUpPlan(catchUpTasks, stateMap, Date.now());\n\n  for (const skip of plan.skipped) {\n    logger().info(\"catch-up skipped\", { taskId: skip.taskId, windows: skip.windowCount });\n    await safeUpdateState(skip.taskId, { lastRunAt: skip.lastWindow });\n  }\n\n  if (plan.runs.length > 0) {\n    logger().info(\"catch-up enqueued\", { runs: plan.runs.length });\n    for (const run of plan.runs) {\n      const task = tasks.find((taskDef) => taskDef.id === run.taskId);\n      if (!task) continue;\n      await executeAndLog(task, run.context.scheduledFor, TASK_TRIGGERS.catchUp);\n    }\n  }\n\n  // Register with task-manager for ongoing ticks\n  for (const task of tasks) {\n    taskManager.registerTask({\n      id: task.id,\n      description: task.description,\n      schedule: task.schedule,\n      run: async () => {\n        const windowIso = computeCurrentWindow(task);\n        await executeAndLog(task, windowIso, TASK_TRIGGERS.scheduled);\n      },\n    });\n  }\n\n  logger().info(\"initialized\", { tasks: tasks.map((taskDef) => taskDef.id), stateEntries: stateMap.size });\n}\n\n/** Apply a schedule override to a running system task. Updates the\n *  in-memory task definition, the task-manager, and recalculates\n *  nextScheduledAt in persisted state. */\nexport async function applyScheduleOverride(taskId: string, schedule: SystemTaskDef[\"schedule\"]): Promise<boolean> {\n  const task = systemTasks.find((taskDef) => taskDef.id === taskId);\n  if (!task || !taskManagerRef) return false;\n  if (!taskManagerRef.updateSchedule(taskId, schedule)) return false;\n  task.schedule = schedule;\n\n  // Recalculate next window so the UI reflects the new schedule\n  const nextScheduledAt = computeNextScheduledFor(task.schedule);\n  await safeUpdateState(taskId, { nextScheduledAt });\n\n  return true;\n}\n\n/** Query execution logs — used by API routes. */\nexport async function getSchedulerLogs(opts: { since?: string; taskId?: string; limit?: number }): Promise<TaskLogEntry[]> {\n  return queryLog(logsDir(), opts, logDeps);\n}\n\n/** Get all task states — used by API routes. */\nexport function getSchedulerTasks(): {\n  id: string;\n  name: string;\n  description: string;\n  schedule: TaskDefinition[\"schedule\"];\n  missedRunPolicy: string;\n  state: TaskExecutionState;\n}[] {\n  return systemTasks.map((taskDef) => ({\n    id: taskDef.id,\n    name: taskDef.name,\n    description: taskDef.description,\n    schedule: taskDef.schedule,\n    missedRunPolicy: taskDef.missedRunPolicy,\n    state: stateMap.get(taskDef.id) ?? emptyState(taskDef.id),\n  }));\n}\n\n/** Read the persisted execution state for any task id (system, user, or\n *  skill). Returns an empty state when the id has never run — used by the API\n *  route to attach last-run / next-run / history state to user + skill tasks\n *  it lists from other sources. */\nexport function getSchedulerTaskState(taskId: string): TaskExecutionState {\n  return stateMap.get(taskId) ?? emptyState(taskId);\n}\n\n/** Record a run of an EXTERNAL (skill / user) task — one registered directly\n *  on the task-manager rather than through `initScheduler`. Persists a log\n *  entry + updates state so these tasks get the same history / last-run /\n *  next-run as system tasks. Because they are fire-and-forget (`startChat`\n *  spawns an async chat), `errorMessage` reflects whether the *dispatch*\n *  succeeded, not the chat's eventual outcome; `chatSessionId` links the run\n *  to the spawned session. */\nexport async function recordExternalRun(params: {\n  id: string;\n  name: string;\n  schedule: TaskDefinition[\"schedule\"];\n  scheduledFor: string;\n  startedAt: string;\n  durationMs: number;\n  trigger: TaskTrigger;\n  errorMessage: string | null;\n  chatSessionId?: string;\n}): Promise<void> {\n  await persistRun({\n    meta: { id: params.id, name: params.name, schedule: params.schedule },\n    scheduledFor: params.scheduledFor,\n    startedAt: params.startedAt,\n    durationMs: params.durationMs,\n    trigger: params.trigger,\n    errMsg: params.errorMessage,\n    chatSessionId: params.chatSessionId,\n  });\n}\n\n/** Test-only: clear config + in-memory state. */\nexport function resetSchedulerForTesting(): void {\n  config = null;\n  stateMap = new Map();\n  systemTasks.length = 0;\n  taskManagerRef = null;\n}\n\n// ── Internal ──────────────────────────────────────────────────────\n\nasync function executeAndLog(task: SystemTaskDef, scheduledFor: string, trigger: TaskTrigger): Promise<void> {\n  const startedAt = new Date().toISOString();\n  const startMs = Date.now();\n  let errMsg: string | null = null;\n  try {\n    await task.run();\n  } catch (err) {\n    errMsg = errorMessage(err);\n    logger().error(\"task failed\", { taskId: task.id, error: errMsg });\n  }\n  const durationMs = Date.now() - startMs;\n  // Persistence is best-effort — never let disk failures propagate to the\n  // tick loop or abort startup catch-up.\n  await persistRun({ meta: { id: task.id, name: task.name, schedule: task.schedule }, scheduledFor, startedAt, durationMs, trigger, errMsg });\n}\n\n/** The minimum a run needs to persist state + a log entry — shared by system\n *  tasks (`executeAndLog`) and external skill/user runs (`recordExternalRun`). */\ninterface TaskRunMeta {\n  id: string;\n  name: string;\n  schedule: TaskDefinition[\"schedule\"];\n}\n\ninterface RunRecord {\n  meta: TaskRunMeta;\n  scheduledFor: string;\n  startedAt: string;\n  durationMs: number;\n  trigger: TaskTrigger;\n  errMsg: string | null;\n  chatSessionId?: string;\n}\n\n/** Best-effort persistence — state and log are independent, so one failing\n *  never blocks the other and neither propagates upward. */\nasync function persistRun(run: RunRecord): Promise<void> {\n  await writeRunState(run);\n  await writeRunLog(run);\n}\n\nasync function writeRunState(run: RunRecord): Promise<void> {\n  const { meta, scheduledFor, durationMs, errMsg } = run;\n  const isSuccess = errMsg === null;\n  const currentState = stateMap.get(meta.id);\n  try {\n    await updateAndSave(\n      stateFilePath(),\n      stateMap,\n      meta.id,\n      {\n        lastRunAt: scheduledFor,\n        lastRunResult: isSuccess ? TASK_RESULTS.success : TASK_RESULTS.error,\n        lastRunDurationMs: durationMs,\n        lastErrorMessage: errMsg,\n        consecutiveFailures: isSuccess ? 0 : (currentState?.consecutiveFailures ?? 0) + 1,\n        totalRuns: (currentState?.totalRuns ?? 0) + 1,\n        nextScheduledAt: computeNextScheduledFor(meta.schedule),\n      },\n      stateDeps(),\n    );\n  } catch (err) {\n    logger().warn(\"state persistence failed\", { taskId: meta.id, error: String(err) });\n  }\n}\n\nasync function writeRunLog(run: RunRecord): Promise<void> {\n  const { meta, scheduledFor, startedAt, durationMs, trigger, errMsg, chatSessionId } = run;\n  const isSuccess = errMsg === null;\n  try {\n    await appendLogEntry(\n      logsDir(),\n      {\n        taskId: meta.id,\n        taskName: meta.name,\n        scheduledFor,\n        startedAt,\n        completedAt: new Date().toISOString(),\n        result: isSuccess ? TASK_RESULTS.success : TASK_RESULTS.error,\n        durationMs,\n        trigger,\n        ...(errMsg !== null && { errorMessage: errMsg }),\n        ...(chatSessionId !== undefined && { chatSessionId }),\n      },\n      logDeps,\n    );\n  } catch (err) {\n    logger().warn(\"log persistence failed\", { taskId: meta.id, error: String(err) });\n  }\n}\n\n/** Safe state update — swallows errors. */\nasync function safeUpdateState(taskId: string, patch: Partial<TaskExecutionState>): Promise<void> {\n  try {\n    await updateAndSave(stateFilePath(), stateMap, taskId, patch, stateDeps());\n  } catch (err) {\n    logger().warn(\"state update failed\", { taskId, error: String(err) });\n  }\n}\n\n/** Compute the window boundary that the current tick belongs to. For\n *  scheduled runs, this is the epoch-aligned window — not the wall-clock\n *  time of execution. This keeps lastRunAt consistent with catch-up's\n *  window-based accounting. */\nfunction computeCurrentWindow(task: SystemTaskDef): string {\n  const coreSchedule = toCoreSchedule(task.schedule);\n  // The window that just fired is the latest one at or before now.\n  const nowMs = Date.now();\n  const windowMs = nextWindowAfter(coreSchedule, nowMs - (coreSchedule.type === SCHEDULE_TYPES.interval ? coreSchedule.intervalSec * ONE_SECOND_MS : 0));\n  return windowMs !== null && windowMs <= nowMs ? new Date(windowMs).toISOString() : new Date(nowMs).toISOString();\n}\n\nfunction computeNextScheduledFor(schedule: TaskDefinition[\"schedule\"]): string | null {\n  const coreSchedule = toCoreSchedule(schedule);\n  const next = nextWindowAfter(coreSchedule, Date.now() + 1);\n  return next !== null ? new Date(next).toISOString() : null;\n}\n\nfunction toCoreSchedule(schedule: TaskDefinition[\"schedule\"]): TaskSchedule {\n  if (schedule.type === SCHEDULE_TYPES.interval) {\n    return {\n      type: SCHEDULE_TYPES.interval,\n      intervalSec: Math.round(schedule.intervalMs / ONE_SECOND_MS),\n    };\n  }\n  return schedule;\n}\n"],"mappings":";;;;;;AAQA,IAAM,kBAAgB;AACtB,IAAM,gBAAgB,KAAK;AAC3B,IAAM,cAAc,KAAK;AAWzB,IAAM,4BAA4B;AAMlC,IAAM,+BAA+B;AAErC,IAAM,aAAa,YAAmC,IAAI,SAAS,YAAY,WAAW,SAAS,OAAO,CAAC;AAI3G,SAAS,cAAc,WAAmB,QAAgB,OAAuB;CAC/E,IAAI,aAAa,KAAK,SAAS,GAAG,OAAO;CACzC,MAAM,YAAa,SAAS,gCAAiC,QAAQ;CACrE,OAAO,KAAK,IAAI,WAAW,SAAS;AACtC;AASA,IAAM,aAA4B;CAAE,YAAY,CAAC;CAAG,YAAY,CAAC;CAAG,aAAa,CAAC;AAAE;AAmDpF,SAAS,MAAM,KAAW,UAAwB,QAAyB;CACzE,IAAI,SAAS,SAAS,eAAe,UAAU;EAC7C,MAAM,kBAAkB,IAAI,YAAY,IAAI,cAAc,IAAI,cAAc,IAAI,gBAAgB,IAAI,cAAc,IAAI;EAGtH,OADgB,KAAK,MAAM,kBAAkB,MAAM,IAAI,SACtC,SAAS,eAAe;CAC3C;CAEA,IAAI,SAAS,SAAS,eAAe,OAAO;EAC1C,MAAM,CAAC,OAAO,WAAW,SAAS,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM;EAC5D,MAAM,WAAW,QAAQ,cAAc,UAAU;EACjD,MAAM,kBAAkB,IAAI,YAAY,IAAI,cAAc,IAAI,cAAc,IAAI,gBAAgB,IAAI,cAAc,IAAI;EAEtH,OADgB,KAAK,MAAM,kBAAkB,MAAM,IAAI,WACpC;CACrB;CAEA,OAAO;AACT;;;AAIA,SAAgB,gBACd,aACA,UACA,QACgE;CAChE,MAAM,cAAgC,CAAC;CACvC,MAAM,YAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,SAAS,OAAO,GAAG;EACnC,IAAI,IAAI,YAAY,OAAO;EAC3B,IAAI,CAAC,MAAM,aAAa,IAAI,UAAU,MAAM,GAAG;EAC/C,IAAI,IAAI,WACN,UAAU,KAAK,GAAG;OAElB,YAAY,KAAK,GAAG;CAExB;CACA,OAAO;EAAE;EAAa;CAAU;AAClC;AAEA,eAAe,YAAY,KAAqB,aAAmB,WAAwB,KAAqC;CAC9H,IAAI;EACF,MAAM,IAAI,IAAI;GAAE,QAAQ,IAAI;GAAI,KAAK;EAAY,CAAC;EAClD,UAAU,IAAI,IAAI,EAAE;CACtB,SAAS,KAAK;EACZ,IAAI,MAAM,eAAe;GACvB,IAAI,IAAI;GACR,OAAO,OAAO,GAAG;EACnB,CAAC;CACH;AACF;AAEA,eAAe,kBAAkB,WAA6B,aAAmB,WAAwB,KAAqC;CAC5I,IAAI,YAAY,CAAC,GAAG,SAAS;CAC7B,IAAI,WAAW;CACf,OAAO,UAAU,SAAS,KAAK,UAAU;EACvC,WAAW;EACX,MAAM,OAAyB,CAAC;EAChC,KAAK,MAAM,OAAO,WAAW;GAC3B,MAAM,MAAM,IAAI;GAChB,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,GAAG,GAAG;IAC/B,KAAK,KAAK,GAAG;IACb;GACF;GACA,MAAM,YAAY,KAAK,aAAa,WAAW,GAAG;GAClD,WAAW;EACb;EACA,YAAY;CACd;AACF;AASA,eAAe,QAAQ,KAAiB,UAAuC,KAAgC;CAC7G,MAAM,cAAc,IAAI;CACxB,MAAM,EAAE,aAAa,cAAc,gBAAgB,aAAa,UAAU,IAAI,MAAM;CAGpF,MAAM,4BAAY,IAAI,IAAY;CAKlC,MAAM,SAAS,cAAc,IAAI,WAAW,IAAI,QAAQ,YAAY,MAAM;CAC1E,MAAM,QAAQ,IACZ,YAAY,IAAI,OAAO,KAAK,UAAU;EACpC,IAAI,SAAS,KAAK,QAAQ,GAAG,MAAM,IAAI,MAAM,QAAQ,MAAM;EAC3D,MAAM,YAAY,KAAK,aAAa,WAAW,IAAI,GAAG;CACxD,CAAC,CACH;CAEA,MAAM,kBAAkB,WAAW,aAAa,WAAW,IAAI,GAAG;AACpE;AAEA,SAAgB,kBAAkB,UAAsD;CACtF,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,aAAa;EAC9C,IAAI,QAAQ;EACZ,aAAa,QAAQ;EACrB,UAAU,QAAQ;EAClB,WAAW,QAAQ;CACrB,EAAE;AACJ;AAKA,SAAS,gBAAgB,KAAiB,UAAuC,KAAsC;CACrH,IAAI,UAAU;CACd,OAAO,YAAY;EACjB,IAAI,SAAS;EACb,UAAU;EACV,IAAI;GACF,MAAM,QAAQ,KAAK,UAAU,GAAG;EAClC,UAAU;GACR,UAAU;EACZ;CACF;AACF;AAEA,SAAS,kBAAkB,SAAoF;CAC7G,MAAM,SAAS,SAAS,UAAU;CAClC,OAAO;EACL;EACA,KAAK,SAAS,8BAAc,IAAI,KAAK;EACrC,KAAK;GACH;GACA,WAAW,SAAS,mBAAmB;GACvC,OAAO,SAAS,SAAS;GACzB,KAAK,SAAS,OAAO;EACvB;CACF;AACF;AAEA,SAAgB,kBAAkB,SAA4C;CAC5E,MAAM,EAAE,QAAQ,KAAK,QAAQ,kBAAkB,OAAO;CACtD,MAAM,EAAE,QAAQ;CAChB,MAAM,2BAAW,IAAI,IAA4B;CACjD,IAAI,QAA+C;CACnD,MAAM,SAAS,gBAAgB,KAAK,UAAU,GAAG;CAEjD,OAAO;EACL,MAAM,OAAO;GACX,MAAM,OAAO;EACf;EAEA,aAAa,KAAqB;GAChC,IAAI,SAAS,IAAI,IAAI,EAAE,GACrB,MAAM,IAAI,MAAM,wBAAwB,IAAI,GAAG,wBAAwB;GAEzE,SAAS,IAAI,IAAI,IAAI,GAAG;GACxB,IAAI,KAAK,cAAc,EAAE,IAAI,IAAI,GAAG,CAAC;EACvC;EAEA,eAAe,QAAgB,UAAiC;GAC9D,MAAM,MAAM,SAAS,IAAI,MAAM;GAC/B,IAAI,CAAC,KAAK,OAAO;GACjB,IAAI,WAAW;GACf,IAAI,KAAK,oBAAoB,EAAE,IAAI,OAAO,CAAC;GAC3C,OAAO;EACT;EAEA,WAAW,QAAgB;GACzB,IAAI,SAAS,OAAO,MAAM,GACxB,IAAI,KAAK,WAAW,EAAE,IAAI,OAAO,CAAC;EAEtC;EAEA,QAAQ;GACN,IAAI,OAAO;GAKX,QAAQ,kBAAkB;IACxB,OAAO,CAAC,CAAC,OAAO,QAAiB,IAAI,MAAM,eAAe,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC,CAAC;GACnF,GAAG,MAAM;GACT,IAAI,KAAK,WAAW,EAAE,OAAO,CAAC;EAChC;EAEA,OAAO;GACL,IAAI,OAAO;IACT,cAAc,KAAK;IACnB,QAAQ;IACR,IAAI,KAAK,SAAS;GACpB;EACF;EAEA,YAAY;GACV,OAAO,kBAAkB,QAAQ;EACnC;CACF;AACF;;;AChQA,IAAM,gBAAgB;AACtB,IAAM,uBAAuB;AAC7B,IAAM,qBAAqB;AAa3B,IAAM,WAA4B;CAAE,YAAY,CAAC;CAAG,YAAY,CAAC;CAAG,aAAa,CAAC;AAAE;AAEpF,IAAI,SAAiC;;AAGrC,SAAgB,mBAAmB,UAAiC;CAClE,SAAS;AACX;AAEA,SAAS,gBAAiC;CACxC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,4CAA4C;CACzE,OAAO;AACT;AAEA,SAAS,SAA0B;CACjC,OAAO,QAAQ,OAAO;AACxB;AAIA,SAAS,gBAAwB;CAC/B,OAAO,KAAK,KAAK,cAAc,CAAC,CAAC,eAAe,sBAAsB,YAAY;AACpF;AAEA,SAAS,UAAkB;CACzB,OAAO,KAAK,KAAK,cAAc,CAAC,CAAC,eAAe,kBAAkB;AACpE;AAIA,SAAS,YAAuB;CAC9B,OAAO;EACL,WAAW,aAAqB,SAAS,UAAU,OAAO;EAC1D,kBAAkB,UAAkB,YAAoB,cAAc,CAAC,CAAC,gBAAgB,UAAU,SAAS,EAAE,WAAW,KAAK,CAAC;EAC9H,QAAQ;CACV;AACF;AAEA,IAAM,UAAmB;CACvB,aAAa,UAAkB,YAAoB,WAAW,UAAU,OAAO;CAC/E,WAAW,aAAqB,SAAS,UAAU,OAAO;CAC1D,QAAQ;CACR,YAAY,kBAA0B,MAAM,eAAe,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;AAC/F;AAeA,IAAI,2BAAqB,IAAI,IAAI;AACjC,IAAM,cAA+B,CAAC;AACtC,IAAI,iBAAsC;;;;;AAM1C,eAAsB,cAAc,aAA2B,OAAuC;CACpG,MAAM,MAAM,KAAK,QAAQ,cAAc,CAAC,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9D,MAAM,MAAM,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAE1C,WAAW,MAAM,UAAU,cAAc,GAAG,UAAU,CAAC;CACvD,YAAY,SAAS;CACrB,YAAY,KAAK,GAAG,KAAK;CACzB,iBAAiB;CAUjB,MAAM,OAAO,mBAPuB,MAAM,KAAK,aAAa;EAC1D,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,UAAU,eAAe,QAAQ,QAAQ;EACzC,iBAAiB,QAAQ;EACzB,SAAS;CACX,EACgC,GAAc,UAAU,KAAK,IAAI,CAAC;CAElE,KAAK,MAAM,QAAQ,KAAK,SAAS;EAC/B,OAAO,CAAC,CAAC,KAAK,oBAAoB;GAAE,QAAQ,KAAK;GAAQ,SAAS,KAAK;EAAY,CAAC;EACpF,MAAM,gBAAgB,KAAK,QAAQ,EAAE,WAAW,KAAK,WAAW,CAAC;CACnE;CAEA,IAAI,KAAK,KAAK,SAAS,GAAG;EACxB,OAAO,CAAC,CAAC,KAAK,qBAAqB,EAAE,MAAM,KAAK,KAAK,OAAO,CAAC;EAC7D,KAAK,MAAM,OAAO,KAAK,MAAM;GAC3B,MAAM,OAAO,MAAM,MAAM,YAAY,QAAQ,OAAO,IAAI,MAAM;GAC9D,IAAI,CAAC,MAAM;GACX,MAAM,cAAc,MAAM,IAAI,QAAQ,cAAc,gBAAc,OAAO;EAC3E;CACF;CAGA,KAAK,MAAM,QAAQ,OACjB,YAAY,aAAa;EACvB,IAAI,KAAK;EACT,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,KAAK,YAAY;GACf,MAAM,YAAY,qBAAqB,IAAI;GAC3C,MAAM,cAAc,MAAM,WAAW,gBAAc,SAAS;EAC9D;CACF,CAAC;CAGH,OAAO,CAAC,CAAC,KAAK,eAAe;EAAE,OAAO,MAAM,KAAK,YAAY,QAAQ,EAAE;EAAG,cAAc,SAAS;CAAK,CAAC;AACzG;;;;AAKA,eAAsB,sBAAsB,QAAgB,UAAuD;CACjH,MAAM,OAAO,YAAY,MAAM,YAAY,QAAQ,OAAO,MAAM;CAChE,IAAI,CAAC,QAAQ,CAAC,gBAAgB,OAAO;CACrC,IAAI,CAAC,eAAe,eAAe,QAAQ,QAAQ,GAAG,OAAO;CAC7D,KAAK,WAAW;CAIhB,MAAM,gBAAgB,QAAQ,EAAE,iBADR,wBAAwB,KAAK,QACrB,EAAgB,CAAC;CAEjD,OAAO;AACT;;AAGA,eAAsB,iBAAiB,MAAoF;CACzH,OAAO,SAAS,QAAQ,GAAG,MAAM,OAAO;AAC1C;;AAGA,SAAgB,oBAOZ;CACF,OAAO,YAAY,KAAK,aAAa;EACnC,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,aAAa,QAAQ;EACrB,UAAU,QAAQ;EAClB,iBAAiB,QAAQ;EACzB,OAAO,SAAS,IAAI,QAAQ,EAAE,KAAK,WAAW,QAAQ,EAAE;CAC1D,EAAE;AACJ;;;;;AAMA,SAAgB,sBAAsB,QAAoC;CACxE,OAAO,SAAS,IAAI,MAAM,KAAK,WAAW,MAAM;AAClD;;;;;;;;AASA,eAAsB,kBAAkB,QAUtB;CAChB,MAAM,WAAW;EACf,MAAM;GAAE,IAAI,OAAO;GAAI,MAAM,OAAO;GAAM,UAAU,OAAO;EAAS;EACpE,cAAc,OAAO;EACrB,WAAW,OAAO;EAClB,YAAY,OAAO;EACnB,SAAS,OAAO;EAChB,QAAQ,OAAO;EACf,eAAe,OAAO;CACxB,CAAC;AACH;;AAGA,SAAgB,2BAAiC;CAC/C,SAAS;CACT,2BAAW,IAAI,IAAI;CACnB,YAAY,SAAS;CACrB,iBAAiB;AACnB;AAIA,eAAe,cAAc,MAAqB,cAAsB,SAAqC;CAC3G,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;CACzC,MAAM,UAAU,KAAK,IAAI;CACzB,IAAI,SAAwB;CAC5B,IAAI;EACF,MAAM,KAAK,IAAI;CACjB,SAAS,KAAK;EACZ,SAAS,aAAa,GAAG;EACzB,OAAO,CAAC,CAAC,MAAM,eAAe;GAAE,QAAQ,KAAK;GAAI,OAAO;EAAO,CAAC;CAClE;CACA,MAAM,aAAa,KAAK,IAAI,IAAI;CAGhC,MAAM,WAAW;EAAE,MAAM;GAAE,IAAI,KAAK;GAAI,MAAM,KAAK;GAAM,UAAU,KAAK;EAAS;EAAG;EAAc;EAAW;EAAY;EAAS;CAAO,CAAC;AAC5I;;;AAsBA,eAAe,WAAW,KAA+B;CACvD,MAAM,cAAc,GAAG;CACvB,MAAM,YAAY,GAAG;AACvB;AAEA,eAAe,cAAc,KAA+B;CAC1D,MAAM,EAAE,MAAM,cAAc,YAAY,WAAW;CACnD,MAAM,YAAY,WAAW;CAC7B,MAAM,eAAe,SAAS,IAAI,KAAK,EAAE;CACzC,IAAI;EACF,MAAM,cACJ,cAAc,GACd,UACA,KAAK,IACL;GACE,WAAW;GACX,eAAe,YAAY,aAAa,UAAU,aAAa;GAC/D,mBAAmB;GACnB,kBAAkB;GAClB,qBAAqB,YAAY,KAAK,cAAc,uBAAuB,KAAK;GAChF,YAAY,cAAc,aAAa,KAAK;GAC5C,iBAAiB,wBAAwB,KAAK,QAAQ;EACxD,GACA,UAAU,CACZ;CACF,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,4BAA4B;GAAE,QAAQ,KAAK;GAAI,OAAO,OAAO,GAAG;EAAE,CAAC;CACnF;AACF;AAEA,eAAe,YAAY,KAA+B;CACxD,MAAM,EAAE,MAAM,cAAc,WAAW,YAAY,SAAS,QAAQ,kBAAkB;CACtF,MAAM,YAAY,WAAW;CAC7B,IAAI;EACF,MAAM,eACJ,QAAQ,GACR;GACE,QAAQ,KAAK;GACb,UAAU,KAAK;GACf;GACA;GACA,8BAAa,IAAI,KAAK,EAAA,CAAE,YAAY;GACpC,QAAQ,YAAY,aAAa,UAAU,aAAa;GACxD;GACA;GACA,GAAI,WAAW,QAAQ,EAAE,cAAc,OAAO;GAC9C,GAAI,kBAAkB,KAAA,KAAa,EAAE,cAAc;EACrD,GACA,OACF;CACF,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,0BAA0B;GAAE,QAAQ,KAAK;GAAI,OAAO,OAAO,GAAG;EAAE,CAAC;CACjF;AACF;;AAGA,eAAe,gBAAgB,QAAgB,OAAmD;CAChG,IAAI;EACF,MAAM,cAAc,cAAc,GAAG,UAAU,QAAQ,OAAO,UAAU,CAAC;CAC3E,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,KAAK,uBAAuB;GAAE;GAAQ,OAAO,OAAO,GAAG;EAAE,CAAC;CACrE;AACF;;;;;AAMA,SAAS,qBAAqB,MAA6B;CACzD,MAAM,eAAe,eAAe,KAAK,QAAQ;CAEjD,MAAM,QAAQ,KAAK,IAAI;CACvB,MAAM,WAAW,gBAAgB,cAAc,SAAS,aAAa,SAAS,eAAe,WAAW,aAAa,cAAc,gBAAgB,EAAE;CACrJ,OAAO,aAAa,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,CAAC,CAAC,YAAY,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,YAAY;AACjH;AAEA,SAAS,wBAAwB,UAAqD;CAEpF,MAAM,OAAO,gBADQ,eAAe,QACP,GAAc,KAAK,IAAI,IAAI,CAAC;CACzD,OAAO,SAAS,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,YAAY,IAAI;AACxD;AAEA,SAAS,eAAe,UAAoD;CAC1E,IAAI,SAAS,SAAS,eAAe,UACnC,OAAO;EACL,MAAM,eAAe;EACrB,aAAa,KAAK,MAAM,SAAS,aAAa,aAAa;CAC7D;CAEF,OAAO;AACT"}

package/dist/{server-CKdWENZ-.cjs → server-DOGKfUuD.cjs}

@@ -1,7 +1,8 @@
 const require_rolldown_runtime = require("./rolldown-runtime-D6vf50IK.cjs");
-const require_ids = require("./ids-Dl9Ij63K.cjs");
-const require_promptSafety = require("./promptSafety-Co4cYQ_Z.cjs");
-const require_discovery = require("./discovery-cwtfyDxl.cjs");
+const require_errors = require("./errors-7P5eMOSX.cjs");
+const require_ids = require("./ids-DWmHjm17.cjs");
+const require_promptSafety = require("./promptSafety-0ZKHX-6J.cjs");
+const require_discovery = require("./discovery-BxbJy2VN.cjs");
 const require_skill_bridge_index = require("./skill-bridge/index.cjs");
 let node_path = require("node:path");
 node_path = require_rolldown_runtime.__toESM(node_path, 1);
@@ -157,7 +158,7 @@ function projectBacklinks(field, schema, enriched, linked) {
 *  `backlinks` → the matching source rows (see `projectBacklinks`). */
 function projectComputed(schema, enriched, linked) {
 	for (const [key, field] of Object.entries(schema.fields)) {
-		if (field.type === "toggle" && field.field) enriched[key] = String(enriched[field.field] ?? "") === field.onValue;
+		if (field.type === "toggle" && field.field) enriched[key] = require_ids.fieldText(enriched[field.field]) === field.onValue;
 		if (field.type === "embed" && field.to) {
 			const targetId = require_ids.embedTargetId(field, enriched);
 			enriched[key] = targetId && linked[field.to]?.byId[targetId] || null;
@@ -495,7 +496,8 @@ function schemaRelations(schema) {
 		if (spec.type === "backlinks" || spec.type === "rollup") relations.push({
 			field: key,
 			kind: spec.type,
-			to: spec.from
+			to: spec.from,
+			via: spec.via
 		});
 		if (spec.type !== "table") continue;
 		for (const [subKey, subSpec] of Object.entries(spec.of)) if (subSpec.type === "ref") relations.push({
@@ -606,10 +608,6 @@ async function computeCollectionIcon(collection, opts = {}) {
 }
 //#endregion
 //#region src/collection/server/util.ts
-/** Human-readable message from an unknown thrown value. */
-function errorMessage(err) {
-	return err instanceof Error ? err.message : String(err);
-}
 var ONE_SECOND_MS = 1e3;
 var ONE_DAY_MS = 1440 * 60 * 1e3;
 //#endregion
@@ -823,7 +821,7 @@ async function maybeSpawnSuccessor(collection, sourceItem, sourceId, ioOpts = {}
 			slug,
 			sourceId,
 			successorId: computed.id,
-			error: errorMessage(err)
+			error: require_errors.errorMessage(err)
 		});
 	}
 }
@@ -1320,6 +1318,44 @@ async function handlePutItems(collection, args, deps) {
 		rejected
 	});
 }
+/** Delete records by id, through the store — so it works on any writable
+*  backend, not just file records. Same read-only refusal as putItems (an
+*  absent `delete` IS the refusal), and the same per-id result shape so a
+*  partially-bad batch reports per id instead of failing whole. */
+async function handleDeleteItems(collection, ids, deps) {
+	const { delete: removeItem } = require_discovery.storeFor(collection, { workspaceRoot: deps.workspaceRoot });
+	if (!removeItem) return `manageCollection: ${require_discovery.readOnlyRefusal(collection.slug)} (its records are the rows of '${collection.schema.dataSource?.path}'; edit that file to change the data).`;
+	const deleted = [];
+	const rejected = [];
+	for (const itemId of ids) {
+		const outcome = await deleteOneItem(removeItem, itemId);
+		if (outcome.deleted) deleted.push(outcome.deleted);
+		if (outcome.rejected) rejected.push(outcome.rejected);
+	}
+	return JSON.stringify({
+		collection: collection.slug,
+		deleted,
+		rejected
+	});
+}
+/** A missing id is a rejection, not a silent success: deleting by a typo'd
+*  id would otherwise report "done" while the real record survives. */
+async function deleteOneItem(removeItem, itemId) {
+	const result = await removeItem(itemId);
+	if (result.kind === "ok") return { deleted: result.itemId };
+	const reject = (problem) => ({ rejected: {
+		id: require_promptSafety.defangForPrompt(itemId),
+		problem: require_promptSafety.defangForPrompt(problem)
+	} });
+	if (result.kind === "invalid-id") return reject(`'${itemId}' is not a valid record id (letters/digits at the ends; -, _, or . inside; no '..' or path characters)`);
+	if (result.kind === "not-found") return reject(`'${itemId}' not found — nothing was deleted; confirm the id with getItems`);
+	return reject("delete refused: the collection's data dir escapes the workspace");
+}
+function parseDeleteIds(args) {
+	const { ids } = args;
+	if (!(Array.isArray(ids) && ids.length > 0 && ids.every((entry) => typeof entry === "string" && entry.trim().length > 0))) return "manageCollection: `ids` is required for deleteItems — a non-empty array of record ids.";
+	return ids;
+}
 function parsePutItems(args, slug) {
 	const { items, mode } = args;
 	if (!(Array.isArray(items) && items.length > 0 && items.every((entry) => Boolean(entry) && typeof entry === "object" && !Array.isArray(entry)))) return "manageCollection: `items` is required for putItems — a non-empty array of record objects.";
@@ -1428,7 +1464,7 @@ async function handlePutSchema(slug, schemaArg, deps) {
 		written: true
 	});
 }
-var MANAGE_COLLECTION_PROMPT = "Use `manageCollection` instead of raw Read/Write/Edit when working with a collection's records OR its schema (raw file I/O stays available as the escape hatch). Before authoring or changing a collection's `schema.json`, call `schemaDocs` to load the field/DSL reference, then read with `getSchema` and write with `putSchema` — `putSchema` validates the whole schema before writing and returns actionable errors instead of silently failing discovery's validation. `getItems` is the only way to see computed values — `derived` fields (e.g. a portfolio's value), `toggle` projections, and `embed` records are host-computed and never present in the stored JSON files. On large collections pass `ids` and/or `fields` to keep the result small. For a question that spans collections (\"which clients have unpaid invoices?\"), start with `getOntology`: it lists every collection with its primaryKey, record count, and outbound `ref`/`embed` relations, so you know which collections to join before reading any records. `putItems` validates every row against the schema before writing (required fields, enum values, primaryKey = record id) and returns `{ written, rejected }`; fix each rejected row using its `problem` text and retry just those rows. Never include computed fields in a row you write. To update a few fields of an existing record, use `mode: \"merge\"` with a partial row ({ id, <changed fields> }) — the default upsert replaces the WHOLE record, so a partial upsert would silently erase every optional field it omits. Answer aggregation questions (counts, sums, averages, group-bys) with `queryItems` on ANY collection — on a dataSource (CSV) collection it scans the whole file (getItems is row-capped, so aggregates computed from its output can be silently wrong on large files); on a file-backed collection it aggregates the enriched records, so computed fields (derived/rollup/toggle) are queryable columns.";
+var MANAGE_COLLECTION_PROMPT = "Use `manageCollection` instead of raw Read/Write/Edit when working with a collection's records OR its schema (raw file I/O stays available as the escape hatch). Before authoring or changing a collection's `schema.json`, call `schemaDocs` to load the field/DSL reference, then read with `getSchema` and write with `putSchema` — `putSchema` validates the whole schema before writing and returns actionable errors instead of silently failing discovery's validation. `getItems` is the only way to see computed values — `derived` fields (e.g. a portfolio's value), `toggle` projections, and `embed` records are host-computed and never present in the stored JSON files. On large collections pass `ids` and/or `fields` to keep the result small. For a question that spans collections (\"which clients have unpaid invoices?\"), start with `getOntology`: it lists every collection with its primaryKey, record count, and outbound `ref`/`embed` relations, so you know which collections to join before reading any records. `putItems` validates every row against the schema before writing (required fields, enum values, primaryKey = record id) and returns `{ written, rejected }`; fix each rejected row using its `problem` text and retry just those rows. Never include computed fields in a row you write. To update a few fields of an existing record, use `mode: \"merge\"` with a partial row ({ id, <changed fields> }) — the default upsert replaces the WHOLE record, so a partial upsert would silently erase every optional field it omits. `deleteItems` removes records by id and returns `{ deleted, rejected }`; an id that doesn't exist comes back rejected rather than counted as deleted, so check `rejected` before reporting a deletion as done. Answer aggregation questions (counts, sums, averages, group-bys) with `queryItems` on ANY collection — on a dataSource (CSV) collection it scans the whole file (getItems is row-capped, so aggregates computed from its output can be silently wrong on large files); on a file-backed collection it aggregates the enriched records, so computed fields (derived/rollup/toggle) are queryable columns.";
 /** Validate getItems' optional `ids`/`fields` args, then delegate. */
 async function dispatchGetItems(collection, args, deps) {
 	const ids = optionalStringArray(args.ids, "ids");
@@ -1441,6 +1477,26 @@ async function dispatchGetItems(collection, args, deps) {
 		fields: fields.value
 	}, deps);
 }
+/** Actions that operate on a collection's RECORDS — i.e. the ones that
+*  need the collection loaded first. Schema/workspace actions don't. */
+var RECORD_ACTIONS = /* @__PURE__ */ new Set([
+	"getItems",
+	"putItems",
+	"deleteItems",
+	"queryItems"
+]);
+/** Record-action dispatch, split from `manageCollectionHandler` to keep
+*  both within the cognitive-complexity budget. */
+async function dispatchRecordAction(action, collection, args, deps) {
+	if (action === "getItems") return dispatchGetItems(collection, args, deps);
+	if (action === "queryItems") return handleQueryItems(collection, args.query, deps);
+	if (action === "deleteItems") {
+		const ids = parseDeleteIds(args);
+		return typeof ids === "string" ? ids : handleDeleteItems(collection, ids, deps);
+	}
+	const parsed = parsePutItems(args, collection.slug);
+	return typeof parsed === "string" ? parsed : handlePutItems(collection, parsed, deps);
+}
 async function manageCollectionHandler(deps, args) {
 	const action = typeof args.action === "string" ? args.action : "";
 	if (action === "schemaDocs") return handleSchemaDocs(deps);
@@ -1449,18 +1505,14 @@ async function manageCollectionHandler(deps, args) {
 	if (!slug) return "manageCollection: `slug` is required (the collection's slug).";
 	if (action === "getSchema") return handleGetSchema(slug, deps);
 	if (action === "putSchema") return handlePutSchema(slug, args.schema, deps);
-	if (action !== "getItems" && action !== "putItems" && action !== "queryItems") return "manageCollection: `action` must be \"getItems\", \"putItems\", \"queryItems\", \"getOntology\", \"schemaDocs\", \"getSchema\", or \"putSchema\".";
+	if (!RECORD_ACTIONS.has(action)) return "manageCollection: `action` must be \"getItems\", \"putItems\", \"deleteItems\", \"queryItems\", \"getOntology\", \"schemaDocs\", \"getSchema\", or \"putSchema\".";
 	const collection = await require_discovery.loadCollection(slug, deps);
 	if (!collection) return unknownCollection(slug);
-	if (action === "getItems") return dispatchGetItems(collection, args, deps);
-	if (action === "queryItems") return handleQueryItems(collection, args.query, deps);
-	const parsed = parsePutItems(args, slug);
-	if (typeof parsed === "string") return parsed;
-	return handlePutItems(collection, parsed, deps);
+	return dispatchRecordAction(action, collection, args, deps);
 }
 var MANAGE_COLLECTION_DEFINITION = {
 	name: "manageCollection",
-	description: "Read and write a schema-driven collection through the host — both its records and its structure. getItems returns records WITH computed values (derived formulas, toggles, embeds) the stored JSON files don't contain; putItems validates each row against the schema before writing. getOntology maps the whole workspace: every collection with its record count and outbound ref/embed relations — call it first for cross-collection questions. schemaDocs returns the collection-authoring reference; getSchema/putSchema read and validate-then-write the collection's schema.json. Prefer it over raw file I/O on collections.",
+	description: "Read and write a schema-driven collection through the host — both its records and its structure. getItems returns records WITH computed values (derived formulas, toggles, embeds) the stored JSON files don't contain; putItems validates each row against the schema before writing; deleteItems removes records by id. getOntology maps the whole workspace: every collection with its record count and outbound ref/embed relations — call it first for cross-collection questions. schemaDocs returns the collection-authoring reference; getSchema/putSchema read and validate-then-write the collection's schema.json. Prefer it over raw file I/O on collections.",
 	inputSchema: {
 		type: "object",
 		properties: {
@@ -1469,6 +1521,7 @@ var MANAGE_COLLECTION_DEFINITION = {
 				enum: [
 					"getItems",
 					"putItems",
+					"deleteItems",
 					"queryItems",
 					"getOntology",
 					"schemaDocs",
@@ -1484,7 +1537,7 @@ var MANAGE_COLLECTION_DEFINITION = {
 			ids: {
 				type: "array",
 				items: { type: "string" },
-				description: "getItems: only these record ids (primary-key values). Omit for all records."
+				description: "getItems: only these record ids (primary-key values); omit for all records. deleteItems: the record ids to delete — required, and never optional there."
 			},
 			fields: {
 				type: "array",
@@ -1610,12 +1663,6 @@ Object.defineProperty(exports, "enrichItems", {
 		return enrichItems;
 	}
 });
-Object.defineProperty(exports, "errorMessage", {
-	enumerable: true,
-	get: function() {
-		return errorMessage;
-	}
-});
 Object.defineProperty(exports, "firstMutateParamProblem", {
 	enumerable: true,
 	get: function() {
@@ -1701,4 +1748,4 @@ Object.defineProperty(exports, "validateRecordObject", {
 	}
 });
 
-//# sourceMappingURL=server-CKdWENZ-.cjs.map
+//# sourceMappingURL=server-DOGKfUuD.cjs.map