@mulmoclaude/core 0.1.0 → 0.2.2

package/dist/collection-watchers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/collection-watchers/config.ts","../../src/collection-watchers/reconciler.ts","../../src/collection-watchers/watcher.ts"],"sourcesContent":["// Host-injected configuration for the collection-completion watchers.\n// The reconciler logic + watcher plumbing are host-agnostic; the\n// notification TAXONOMY (which plugin namespace, how a record priority\n// maps to a bell severity) and the in-app ROUTING (the deep-link a bell\n// row navigates to) are host-specific, so the host supplies them via an\n// adapter. MulmoClaude wires its legacy notification machinery; a future\n// MulmoTerminal wires its own routes + pluginData shape.\n\nimport type { NotifierSeverity } from \"../notifier\";\n\n/** Two-level urgency a pending record can carry, derived from the\n *  schema's `notifyWhen` spec. The host maps this onto its own severity\n *  scale via `priorityToSeverity`. */\nexport type CompletionPriority = \"normal\" | \"high\";\n\nexport interface CollectionWatcherLogger {\n  info: (message: string, data?: Record<string, unknown>) => void;\n  warn: (message: string, data?: Record<string, unknown>) => void;\n}\n\n/** The host-specific notification surface the reconciler binds to. The\n *  reconciler owns the internal `legacyId` key (it encodes slug+itemId\n *  and round-trips it through `pluginData`); the adapter only wraps /\n *  unwraps it into whatever shape the host's bell expects. */\nexport interface CollectionNotificationAdapter {\n  /** Plugin namespace these bell entries publish under (MulmoClaude: \"todo\"). */\n  pluginPkg: string;\n  /** Map a record's completion priority onto the host's bell severity. */\n  priorityToSeverity: (priority: CompletionPriority) => NotifierSeverity;\n  /** Build the in-app deep-link the bell row routes to on click. */\n  buildNavigateTarget: (slug: string, itemId: string) => string;\n  /** Wrap the reconciler's internal key + priority into the host's\n   *  `pluginData` shape. Stored verbatim on the entry; recovered via\n   *  `readEntry`. */\n  buildPluginData: (input: { legacyId: string; slug: string; itemId: string; priority: CompletionPriority; navigateTarget: string }) => unknown;\n  /** Recognise a bell entry produced by this reconciler and recover its\n   *  internal key + stored priority. Returns null for entries that didn't\n   *  originate here, so `listAll()` scans skip foreign entries. */\n  readEntry: (pluginData: unknown) => { legacyId: string; priority: CompletionPriority } | null;\n}\n\nconst NOOP_LOG: CollectionWatcherLogger = { info: () => {}, warn: () => {} };\n\nlet adapter: CollectionNotificationAdapter | null = null;\nlet activeLogger: CollectionWatcherLogger = NOOP_LOG;\n\n/** Wire the host adapter + logger. Call once at startup, before\n *  `startCollectionWatchers` or any direct reconcile call. */\nexport function configureCollectionWatchers(config: { adapter: CollectionNotificationAdapter; log?: CollectionWatcherLogger }): void {\n  ({ adapter } = config);\n  activeLogger = config.log ?? NOOP_LOG;\n}\n\nexport function requireAdapter(): CollectionNotificationAdapter {\n  if (!adapter) throw new Error(\"collection-watchers: configureCollectionWatchers() not called\");\n  return adapter;\n}\n\nexport function log(): CollectionWatcherLogger {\n  return activeLogger;\n}\n\n/** Test-only: clear the host wiring. */\nexport function resetCollectionWatchersConfig(): void {\n  adapter = null;\n  activeLogger = NOOP_LOG;\n}\n\nexport function errMsg(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n","// Bell-notification reconciler for collections whose schema declares\n// `completionField`. Driven by `watcher.ts`, which calls into the\n// functions below on file-system events and on boot.\n//\n// The model is **convergent**: a watcher event re-reads the record from\n// disk and the reconciler enforces the invariant\n//\n//   bell entry exists for (slug, itemId)  ↔\n//     schema has completionField  ∧\n//     file exists  ∧\n//     `String(item[completionField])` ∉ completionDoneValues\n//     (∧ trigger due ∧ notifyWhen matches, when declared)\n//\n// Each reconcile is idempotent (`ensure*` / `clear*` no-op when state\n// already matches). This is why event-type quirks of `fs.watch`\n// (`rename` vs `change`, missed events, atomic-write coalescence) don't\n// matter — every event re-derives the desired state from the file.\n//\n// Lookup uses a deterministic internal `legacyId` derived from\n// `<slug>:<itemId>`, stashed on each entry's `pluginData` via the host\n// adapter, so the clear path and the dedup check both find the entry\n// without a side state file.\n\nimport { clear as notifierClear, listAll, publish as notifierPublish, updateForPlugin as notifierUpdate, type NotifierEntry } from \"../notifier\";\nimport { whenMatches, type CollectionItem, type CollectionSchema } from \"../collection\";\nimport { type DiscoveryOptions, listItems, readItem, type IoOptions, isTriggerDue, maybeSpawnSuccessor, loadCollection } from \"../collection/server\";\nimport { type CompletionPriority, errMsg, log, requireAdapter } from \"./config.js\";\n\n/** The internal-id prefix every collection-completion bell entry carries.\n *  Used both to build new keys and to filter sweep candidates from the\n *  active bell. */\nconst LEGACY_ID_PREFIX = \"collection-completion:\";\n\n/** Stable key encoding slug + item, round-tripped through the entry's\n *  `pluginData` so we can find it later without a side state file. Slug +\n *  itemId are upstream-validated via `safeSlugName`, which forbids the\n *  colon separator, so the two-segment parse below is unambiguous. */\nfunction completionLegacyId(slug: string, itemId: string): string {\n  return `${LEGACY_ID_PREFIX}${slug}:${itemId}`;\n}\n\n/** Decode a key back into its (slug, itemId) pair, or null if the string\n *  didn't originate from this module. Used by the sweep step. */\nfunction parseCompletionLegacyId(legacyId: string): { slug: string; itemId: string } | null {\n  if (!legacyId.startsWith(LEGACY_ID_PREFIX)) return null;\n  const body = legacyId.slice(LEGACY_ID_PREFIX.length);\n  const colon = body.indexOf(\":\");\n  if (colon < 0) return null;\n  return { slug: body.slice(0, colon), itemId: body.slice(colon + 1) };\n}\n\n/** The human-readable label shown in a completion notification's title.\n *  Uses the schema's `displayField` value when declared and non-empty;\n *  otherwise falls back to the record's primaryKey (`itemId`). */\nexport function resolveDisplayLabel(schema: CollectionSchema, item: CollectionItem, itemId: string): string {\n  const { displayField } = schema;\n  if (!displayField) return itemId;\n  const raw = item[displayField];\n  if (raw === undefined || raw === null) return itemId;\n  const label = String(raw).trim();\n  return label.length > 0 ? label : itemId;\n}\n\n/** True iff the schema declares completion tracking AND the item's\n *  `completionField` value (stringified) is in `completionDoneValues`. */\nexport function itemIsDone(schema: CollectionSchema, item: CollectionItem): boolean {\n  const { completionField, completionDoneValues } = schema;\n  if (!completionField || !completionDoneValues) return false;\n  const raw = item[completionField];\n  if (raw === undefined || raw === null) return false;\n  return completionDoneValues.includes(String(raw));\n}\n\n/** Every active bell entry whose key matches this (slug, itemId).\n *  Returns multiple when defensive cleanup is needed. Scans `listAll()`\n *  — cheap because the active set is bounded. */\nasync function findActiveEntries(slug: string, itemId: string): Promise<NotifierEntry[]> {\n  const adapter = requireAdapter();\n  const legacyId = completionLegacyId(slug, itemId);\n  const entries = await listAll();\n  return entries.filter((entry) => adapter.readEntry(entry.pluginData)?.legacyId === legacyId);\n}\n\nasync function findActiveEntryIds(slug: string, itemId: string): Promise<string[]> {\n  return (await findActiveEntries(slug, itemId)).map((entry) => entry.id);\n}\n\n/** Per-key in-flight lock. Serializes concurrent `ensureItemNotification`\n *  calls for the same (slug, itemId) so the `findActiveEntries → publish`\n *  check stays atomic across callers — not just across watcher events.\n *  `listAll` bypasses the engine's write queue, so without this lock two\n *  reconcile paths (a watcher event + a `reconcileAllItems` pass that a\n *  readdir-triggered event raced) could both miss each other's in-flight\n *  publish and produce duplicate entries. */\ninterface EnsureLock {\n  promise: Promise<void>;\n}\nconst ensureLocks = new Map<string, EnsureLock>();\n\n/** Bell priority for a record: the FIRST flagged value in `notifyWhen.in`\n *  (most urgent) reads `high`, every other flagged value `normal`.\n *  Collections with no `notifyWhen` (notify for every open record) stay\n *  `normal`. */\nfunction notifyPriorityForItem(schema: CollectionSchema, item: CollectionItem): CompletionPriority {\n  const spec = schema.notifyWhen;\n  if (!spec) return \"normal\";\n  const value = item[spec.field] === undefined || item[spec.field] === null ? \"\" : String(item[spec.field]);\n  return spec.in.indexOf(value) === 0 ? \"high\" : \"normal\";\n}\n\nasync function ensureItemNotification(\n  slug: string,\n  schema: CollectionSchema,\n  itemId: string,\n  displayLabel: string,\n  priority: CompletionPriority,\n): Promise<void> {\n  const legacyId = completionLegacyId(slug, itemId);\n  // Drain any in-flight publish for this key BEFORE our check + set. The\n  // drain + claim runs synchronously between `ensureLocks.get` and\n  // `ensureLocks.set`, so two callers can't both observe an empty slot.\n\n  while (true) {\n    const inflight = ensureLocks.get(legacyId);\n    if (!inflight) break;\n    await inflight.promise;\n  }\n  const lock: EnsureLock = { promise: doEnsureItemNotification(slug, schema, itemId, legacyId, displayLabel, priority) };\n  ensureLocks.set(legacyId, lock);\n  try {\n    await lock.promise;\n  } finally {\n    // Only clear the slot if it still points at OUR lock — a\n    // sufficiently-delayed cleanup must not stomp a later claim.\n    if (ensureLocks.get(legacyId) === lock) {\n      ensureLocks.delete(legacyId);\n    }\n  }\n}\n\n/** Converge any already-present bell entries to `priority`, updating in\n *  place (preserving id / position / createdAt) so a record whose flagged\n *  value changed while it stayed pending re-colours the bell without a\n *  clear+republish flicker. No-op when the stored priority already matches. */\nasync function reconcileEntrySeverity(slug: string, itemId: string, entries: NotifierEntry[], priority: CompletionPriority): Promise<void> {\n  const adapter = requireAdapter();\n  for (const entry of entries) {\n    const parsed = adapter.readEntry(entry.pluginData);\n    if (!parsed || parsed.priority === priority) continue;\n    await notifierUpdate(adapter.pluginPkg, entry.id, {\n      severity: adapter.priorityToSeverity(priority),\n      pluginData: adapter.buildPluginData({\n        legacyId: parsed.legacyId,\n        slug,\n        itemId,\n        priority,\n        navigateTarget: adapter.buildNavigateTarget(slug, itemId),\n      }),\n    });\n  }\n}\n\nasync function doEnsureItemNotification(\n  slug: string,\n  schema: CollectionSchema,\n  itemId: string,\n  legacyId: string,\n  displayLabel: string,\n  priority: CompletionPriority,\n): Promise<void> {\n  const adapter = requireAdapter();\n  try {\n    const existing = await findActiveEntries(slug, itemId);\n    if (existing.length > 0) {\n      await reconcileEntrySeverity(slug, itemId, existing, priority);\n      return;\n    }\n    const navigateTarget = adapter.buildNavigateTarget(slug, itemId);\n    // `lifecycle: \"action\"` — these are state-of-the-world entries\n    // mirroring an outstanding obligation (the item is pending), not\n    // transient pings. Validation requires a non-info severity and a\n    // non-empty `navigateTarget` (the slug + itemId deep-link).\n    await notifierPublish({\n      pluginPkg: adapter.pluginPkg,\n      severity: adapter.priorityToSeverity(priority),\n      lifecycle: \"action\",\n      title: `${schema.title}: ${displayLabel}`,\n      navigateTarget,\n      pluginData: adapter.buildPluginData({ legacyId, slug, itemId, priority, navigateTarget }),\n    });\n  } catch (err) {\n    log().warn(\"notify ensure failed\", { slug, itemId, error: errMsg(err) });\n  }\n}\n\n/** Idempotently clear EVERY bell entry that matches this (slug, itemId).\n *  Silent no-op when nothing matches. The \"every\" is defensive: if a\n *  duplicate ever slips through, this drains the lot. */\nexport async function clearItemNotification(slug: string, itemId: string): Promise<void> {\n  try {\n    const ids = await findActiveEntryIds(slug, itemId);\n    for (const entryId of ids) {\n      await notifierClear(entryId);\n    }\n  } catch (err) {\n    log().warn(\"notify clear failed\", { slug, itemId, error: errMsg(err) });\n  }\n}\n\n/** Reconcile one item to the desired bell state. Re-reads the record from\n *  disk so the decision is grounded in current truth, not in the event\n *  payload. Safe to call when the file is missing (delete path).\n *\n *  `ioOpts` flows into `readItem`'s workspace-containment check —\n *  production callers (the watcher) pass nothing; tests pass\n *  `{ workspaceRoot: <tmpdir> }` so the check accepts a fixture dataDir. */\nexport async function reconcileItem(\n  slug: string,\n  schema: CollectionSchema,\n  dataDir: string,\n  itemId: string,\n  ioOpts: IoOptions = {},\n  now: Date = new Date(),\n): Promise<void> {\n  if (!schema.completionField) {\n    // Schema doesn't track completion — drop any stale entry.\n    await clearItemNotification(slug, itemId);\n    return;\n  }\n  const item = await readItem(dataDir, itemId, ioOpts);\n  if (item === null) {\n    await clearItemNotification(slug, itemId);\n    return;\n  }\n  // Recurrence: predicate-gated + create-if-absent, idempotent and\n  // independent of this item's own bell state. Runs before the done-clear\n  // below so marking an item done still spawns its successor.\n  await maybeSpawnSuccessor(slug, schema, dataDir, item, itemId, ioOpts);\n  if (itemIsDone(schema, item)) {\n    await clearItemNotification(slug, itemId);\n    return;\n  }\n  // Time gate: when the schema declares `triggerField`, suppress the bell\n  // until the clock reaches that date (minus `triggerLeadDays`).\n  // Unparseable date ⇒ fail safe (no bell); warn ONLY when the field carries\n  // a non-empty value that won't parse — an empty optional trigger date is a\n  // normal state and must not spam a WARN every reconcile tick.\n  if (schema.triggerField) {\n    const triggerRaw = item[schema.triggerField];\n    const due = isTriggerDue(triggerRaw, now, schema.triggerLeadDays);\n    const isEmpty = triggerRaw === undefined || triggerRaw === null || triggerRaw === \"\";\n    if (due === null && !isEmpty) {\n      log().warn(\"trigger date unparseable, suppressing bell\", { slug, itemId, triggerField: schema.triggerField });\n    }\n    if (due !== true) {\n      await clearItemNotification(slug, itemId);\n      return;\n    }\n  }\n  // Condition gate: when the schema declares `notifyWhen`, only bell\n  // records matching the predicate. Convergent — a record that stops\n  // matching has its bell cleared.\n  if (!whenMatches(schema.notifyWhen, item)) {\n    await clearItemNotification(slug, itemId);\n    return;\n  }\n  await ensureItemNotification(slug, schema, itemId, resolveDisplayLabel(schema, item, itemId), notifyPriorityForItem(schema, item));\n}\n\n/** Boot-time reconcile: walk every record under `dataDir` once and\n *  reconcile it. Catches up changes that happened while the server was\n *  down. Deleted items are covered by `sweepStaleActiveEntries`, not this\n *  function (it only sees files that exist). */\nexport async function reconcileAllItems(\n  slug: string,\n  schema: CollectionSchema,\n  dataDir: string,\n  ioOpts: IoOptions = {},\n  now: Date = new Date(),\n): Promise<void> {\n  if (!schema.completionField) return;\n  let items: CollectionItem[];\n  try {\n    items = await listItems(dataDir, ioOpts);\n  } catch (err) {\n    log().warn(\"reconcile list failed\", { slug, dataDir, error: errMsg(err) });\n    return;\n  }\n  const { primaryKey } = schema;\n  for (const item of items) {\n    const raw = item[primaryKey];\n    if (typeof raw !== \"string\" || raw.length === 0) continue;\n    await reconcileItem(slug, schema, dataDir, raw, ioOpts, now);\n  }\n}\n\n/** Boot-time sweep over the active bell: drop any entries whose underlying\n *  file is gone, whose collection was deleted, whose schema no longer\n *  tracks completion, or whose item is now done. Reverse-covers the cases\n *  `reconcileAllItems` misses (it only walks files that exist). */\nexport async function sweepStaleActiveEntries(opts: DiscoveryOptions = {}): Promise<void> {\n  const adapter = requireAdapter();\n  let entries;\n  try {\n    entries = await listAll();\n  } catch (err) {\n    log().warn(\"sweep list failed\", { error: errMsg(err) });\n    return;\n  }\n  for (const entry of entries) {\n    const own = adapter.readEntry(entry.pluginData);\n    if (!own) continue;\n    const parsed = parseCompletionLegacyId(own.legacyId);\n    if (!parsed) continue;\n    const { slug, itemId } = parsed;\n    try {\n      const collection = await loadCollection(slug, opts);\n      if (!collection || !collection.schema.completionField) {\n        await notifierClear(entry.id);\n        continue;\n      }\n      const item = await readItem(collection.dataDir, itemId, opts);\n      if (item === null || itemIsDone(collection.schema, item) || !whenMatches(collection.schema.notifyWhen, item)) {\n        await notifierClear(entry.id);\n      }\n    } catch (err) {\n      log().warn(\"sweep entry failed\", { slug, itemId, error: errMsg(err) });\n    }\n  }\n}\n\n/** Test-only: clear the per-key in-flight locks. */\nexport function _resetReconcilerLocksForTesting(): void {\n  ensureLocks.clear();\n}\n","// Filesystem watchers that drive collection-completion bell\n// notifications. One `fs.watch` per discovered collection's `dataDir`,\n// fanned out from a single boot call + a 30-second re-discovery interval\n// that catches newly-created / deleted collections (there is no\n// in-process \"collections changed\" event broadcast).\n//\n// Why a watcher, not just route hooks: the canonical pattern for\n// collection-skills has the agent Write records directly with the Write\n// tool — that path never hits the REST API, so a route-level hook would\n// miss most of the traffic the user generates. The watcher catches every\n// mutation regardless of who wrote the file.\n//\n// All decisions live in `reconciler.ts`; this module is pure plumbing:\n// discover, mkdir, fs.watch, forward events into the reconciler. Every\n// reconcile call is idempotent so fs.watch's well-known quirks (`rename`\n// vs `change`, atomic-write coalescence, filename === null on some\n// platforms) don't need special handling.\n\nimport { watch, type FSWatcher } from \"node:fs\";\nimport { mkdir } from \"node:fs/promises\";\nimport { discoverCollections, loadCollection, type DiscoveryOptions, type LoadedCollection } from \"../collection/server\";\nimport type { CollectionSchema } from \"../collection\";\nimport { errMsg, log } from \"./config.js\";\nimport { reconcileAllItems, reconcileItem, sweepStaleActiveEntries } from \"./reconciler.js\";\n\n// Collections don't get added / removed rapidly; 30 s is a comfortable\n// upper bound on how long a new schema can sit before its watcher is up.\nconst ONE_SECOND_MS = 1000;\nconst ONE_MINUTE_MS = 60 * ONE_SECOND_MS;\nconst REDISCOVERY_INTERVAL_MS = 30 * ONE_SECOND_MS;\n\n// Wall-clock tick that re-reconciles time-dependent collections (those\n// declaring `triggerField` and/or `spawn`). The fs.watcher only re-runs\n// the reconciler on FILE changes; a `triggerField` bell that should fire\n// \"when the clock reaches date X\" — and a `spawn` whose successor's own\n// trigger later comes due — change no file at that moment, so a periodic\n// re-derivation is required.\nconst TRIGGER_TICK_INTERVAL_MS = ONE_MINUTE_MS;\n\ninterface CollectionWatcher {\n  slug: string;\n  dataDir: string;\n  watcher: FSWatcher;\n  /** Last-seen serialized schema for change detection. When a rediscovery\n   *  tick observes a different value, the watcher's items are reconciled\n   *  and the cache is refreshed — this catches schema-only edits (e.g.\n   *  flipping `completionField` on or off) that don't touch any record\n   *  file and would otherwise leave bell state stale indefinitely. */\n  schemaJson: string;\n}\n\nconst watchers = new Map<string, CollectionWatcher>();\nlet rediscoveryTimer: ReturnType<typeof setInterval> | null = null;\nlet triggerTimer: ReturnType<typeof setInterval> | null = null;\nlet started = false;\n/** Discovery options threaded into every `discoverCollections` /\n *  `loadCollection` / `sweepStaleActiveEntries` call. Production: empty\n *  (live workspace). Tests: `{ workspaceRoot, userSkillsDir }` pointing\n *  at a fixture tree. Module-level so per-event handlers can read it\n *  without threading through every signature. */\nlet discoveryOpts: DiscoveryOptions = {};\n\n/** Per-key single-flight slot (declared here so `stopCollectionWatchers`\n *  can clear it during teardown). */\ninterface ReconcileSlot {\n  running: Promise<void>;\n  pending: boolean;\n}\nconst itemSlots = new Map<string, ReconcileSlot>();\n\n/** Test-only configuration knobs. Production callers pass nothing and get\n *  the live workspace defaults; tests pass a tmpdir-rooted `discoveryOpts`\n *  and override the tick cadences (or set them to `null` to disable the\n *  auto-ticks so the test drives sync manually). */\nexport interface CollectionWatcherOptions {\n  discoveryOpts?: DiscoveryOptions;\n  rediscoveryIntervalMs?: number | null;\n  triggerTickIntervalMs?: number | null;\n}\n\n/** Boot entry point: sweep stale active entries, then mount watchers for\n *  every discovered collection and arm the periodic re-discovery poll.\n *  Idempotent — a second call is a no-op. */\nexport async function startCollectionWatchers(opts: CollectionWatcherOptions = {}): Promise<void> {\n  if (started) return;\n  // `started` only flips on AFTER boot finishes. If sweep or syncWatchers\n  // throws mid-boot, reset state on failure so a supervisor / test\n  // harness can retry instead of being permanently latched.\n  discoveryOpts = opts.discoveryOpts ?? {};\n  try {\n    // Boot reconcile is split in two: sweep first (drop bell entries whose\n    // files / collections / schemas vanished while the server was down),\n    // then `syncWatchers` runs the per-collection forward fill. Both paths\n    // are idempotent and converge on the same end state.\n    await sweepStaleActiveEntries(discoveryOpts);\n    await syncWatchers();\n    const intervalMs = opts.rediscoveryIntervalMs === undefined ? REDISCOVERY_INTERVAL_MS : opts.rediscoveryIntervalMs;\n    if (intervalMs !== null) {\n      rediscoveryTimer = setInterval(() => {\n        syncWatchers().catch((err: unknown) => {\n          log().warn(\"watcher rediscovery failed\", { error: errMsg(err) });\n        });\n      }, intervalMs);\n      // `unref` so a clean process exit isn't blocked waiting for the tick.\n      rediscoveryTimer.unref();\n    }\n    const triggerMs = opts.triggerTickIntervalMs === undefined ? TRIGGER_TICK_INTERVAL_MS : opts.triggerTickIntervalMs;\n    if (triggerMs !== null) {\n      triggerTimer = setInterval(() => {\n        tickTimeTriggers().catch((err: unknown) => {\n          log().warn(\"watcher trigger tick failed\", { error: errMsg(err) });\n        });\n      }, triggerMs);\n      triggerTimer.unref();\n    }\n    started = true;\n  } catch (err) {\n    discoveryOpts = {};\n    throw err;\n  }\n}\n\n/** Tear down every watcher and stop the intervals. Used by tests;\n *  production never calls this (process exit reclaims the fds). Resets\n *  `started` so a subsequent `startCollectionWatchers` re-mounts. */\nexport async function stopCollectionWatchers(): Promise<void> {\n  if (rediscoveryTimer) {\n    clearInterval(rediscoveryTimer);\n    rediscoveryTimer = null;\n  }\n  if (triggerTimer) {\n    clearInterval(triggerTimer);\n    triggerTimer = null;\n  }\n  for (const watcher of watchers.values()) {\n    try {\n      watcher.watcher.close();\n    } catch {\n      /* fs.watch close is best-effort */\n    }\n  }\n  watchers.clear();\n  itemSlots.clear();\n  discoveryOpts = {};\n  started = false;\n}\n\n/** Test-only: manually trigger one rediscovery + reconcile pass. */\nexport async function _syncWatchersForTesting(): Promise<void> {\n  await syncWatchers();\n}\n\n/** Test-only: drive one wall-clock tick synchronously, with an optional\n *  injected clock. */\nexport async function _tickTimeTriggersForTesting(now?: Date): Promise<void> {\n  await tickTimeTriggers(now);\n}\n\n/** Re-reconcile every watched collection that depends on the clock — i.e.\n *  declares `triggerField` (a bell that fires at a date) and/or `spawn`\n *  (recurrence whose successors come due over time). Collections with\n *  neither are skipped. Idempotent. The schema is parsed back from the\n *  watcher's cached `schemaJson` to avoid a per-tick disk read. */\nasync function tickTimeTriggers(now: Date = new Date()): Promise<void> {\n  for (const entry of watchers.values()) {\n    let schema: CollectionSchema;\n    try {\n      schema = JSON.parse(entry.schemaJson) as CollectionSchema;\n    } catch (err) {\n      log().warn(\"trigger tick: bad cached schema\", { slug: entry.slug, error: errMsg(err) });\n      continue;\n    }\n    if (!schema.triggerField && !schema.spawn) continue;\n    await reconcileAllItems(entry.slug, schema, entry.dataDir, discoveryOpts, now);\n  }\n}\n\n/** Reconcile the watcher set against the currently-discovered\n *  collections. Adds watchers for new slugs (with a boot reconcile of\n *  their items), drops watchers for vanished slugs, and re-reconciles\n *  items for collections whose schema changed. Runs a final sweep when\n *  this tick changed the watcher set or any schema. */\nasync function syncWatchers(): Promise<void> {\n  let collections;\n  try {\n    collections = await discoverCollections(discoveryOpts);\n  } catch (err) {\n    log().warn(\"watcher discover failed\", { error: errMsg(err) });\n    return;\n  }\n  const liveSlugs = new Set(collections.map((collection) => collection.slug));\n  const vanishedMutated = stopVanishedWatchers(liveSlugs);\n  const schemaMutated = await reconcileChangedSchemas(collections);\n  const addedMutated = await startNewWatchers(collections);\n  if (vanishedMutated || schemaMutated || addedMutated) {\n    await sweepStaleActiveEntries(discoveryOpts);\n  }\n}\n\nfunction stopVanishedWatchers(liveSlugs: Set<string>): boolean {\n  let mutated = false;\n  for (const slug of [...watchers.keys()]) {\n    if (liveSlugs.has(slug)) continue;\n    const watcher = watchers.get(slug);\n    if (watcher) {\n      try {\n        watcher.watcher.close();\n      } catch {\n        /* best-effort */\n      }\n    }\n    watchers.delete(slug);\n    mutated = true;\n    log().info(\"watcher stopped\", { slug });\n  }\n  return mutated;\n}\n\n/** Re-reconcile already-watched collections whose schema changed since\n *  the last tick. New collections fall through to `startNewWatchers`. */\nasync function reconcileChangedSchemas(collections: readonly LoadedCollection[]): Promise<boolean> {\n  let mutated = false;\n  for (const collection of collections) {\n    const existing = watchers.get(collection.slug);\n    if (!existing) continue;\n    const nextJson = JSON.stringify(collection.schema);\n    if (existing.schemaJson === nextJson) continue;\n    existing.schemaJson = nextJson;\n    log().info(\"watcher schema changed, re-reconciling\", { slug: collection.slug });\n    await reconcileAllItems(collection.slug, collection.schema, collection.dataDir, discoveryOpts);\n    mutated = true;\n  }\n  return mutated;\n}\n\nasync function startNewWatchers(collections: readonly LoadedCollection[]): Promise<boolean> {\n  let mutated = false;\n  for (const collection of collections) {\n    if (watchers.has(collection.slug)) continue;\n    await startWatcherFor(collection.slug, collection.schema, collection.dataDir);\n    mutated = true;\n  }\n  return mutated;\n}\n\nasync function startWatcherFor(slug: string, schema: CollectionSchema, dataDir: string): Promise<void> {\n  try {\n    // `fs.watch` throws on a missing dir, so ensure it exists. New\n    // collections legitimately start with no records — mkdir is the\n    // canonical first-use bootstrap.\n    await mkdir(dataDir, { recursive: true });\n    // Boot reconcile this collection's existing items BEFORE mounting the\n    // watcher: a pending item the user added during downtime needs its\n    // bell entry even if no event fires today.\n    await reconcileAllItems(slug, schema, dataDir, discoveryOpts);\n    const watcher = watch(dataDir, { persistent: false }, (_eventType, filename) => {\n      // Errors from inside the callback would propagate as unhandled\n      // rejections — wrap so a single bad event can't unwind the watcher.\n      onEvent(slug, filename).catch((err: unknown) => {\n        log().warn(\"watcher event failed\", { slug, filename, error: errMsg(err) });\n      });\n    });\n    watcher.on(\"error\", (err) => {\n      log().warn(\"watcher error\", { slug, error: errMsg(err) });\n    });\n    watchers.set(slug, { slug, dataDir, watcher, schemaJson: JSON.stringify(schema) });\n    log().info(\"watcher started\", { slug, dataDir });\n  } catch (err) {\n    log().warn(\"watcher start failed\", { slug, error: errMsg(err) });\n  }\n}\n\n/** Test-only: the per-key single-flight scheduler. Exported so test code\n *  can drive rapid-fire calls directly and observe the trailing coalesce\n *  — `fs.watch` event timing is too flaky to assert against.\n *\n *  Single-flight semantics: while a reconcile is in flight for a given\n *  (slug, itemId), additional events on the same key set `pending = true`\n *  and return — the running reconcile re-runs once after it completes.\n *  This collapses fs.watch's rapid-fire bursts (atomic rename surfaces as\n *  2-3 events) into a single reconcile + one trailing re-run. */\nexport function _scheduleItemReconcileForTesting(slug: string, schema: CollectionSchema, dataDir: string, itemId: string): Promise<void> {\n  return scheduleItemReconcile(slug, schema, dataDir, itemId);\n}\n\nfunction scheduleItemReconcile(slug: string, schema: CollectionSchema, dataDir: string, itemId: string): Promise<void> {\n  const key = `${slug}\\x00${itemId}`;\n  const existing = itemSlots.get(key);\n  if (existing) {\n    existing.pending = true;\n    return existing.running;\n  }\n  const slot: ReconcileSlot = { running: Promise.resolve(), pending: false };\n  slot.running = (async () => {\n    try {\n      // Re-run while events keep arriving — the trailing re-run captures\n      // any state change that landed during a prior pass. After each pass\n      // we read `pending` and zero it before the next iteration, so an\n      // event that fires *during* the last reconcile's await still\n      // triggers one more pass before the slot is freed.\n      let keepGoing = true;\n      while (keepGoing) {\n        slot.pending = false;\n        await reconcileItem(slug, schema, dataDir, itemId, discoveryOpts);\n        keepGoing = slot.pending;\n      }\n    } finally {\n      itemSlots.delete(key);\n    }\n  })();\n  itemSlots.set(key, slot);\n  return slot.running;\n}\n\n/** Handle a single fs.watch event. Re-loads the collection (schema may\n *  have changed since startup), filters out non-record files, and\n *  forwards to the single-flighted reconciler. `filename === null` (rare,\n *  platform-specific) triggers a full directory rescan to be safe. */\nasync function onEvent(slug: string, filename: string | Buffer | null): Promise<void> {\n  const collection = await loadCollection(slug, discoveryOpts);\n  if (!collection) return;\n  if (filename === null) {\n    // Some platforms omit the filename on a watch event — we don't know\n    // which record changed. `reconcileAllItems` covers items whose file\n    // still exists; pair it with a sweep so any record deleted inside the\n    // same opaque event has its stale bell entry cleared too.\n    await reconcileAllItems(slug, collection.schema, collection.dataDir, discoveryOpts);\n    await sweepStaleActiveEntries(discoveryOpts);\n    return;\n  }\n  const name = typeof filename === \"string\" ? filename : filename.toString(\"utf-8\");\n  // Filter: only record files (`*.json`), skip dot-prefixed (atomic\n  // writes / OS metadata / editor swap files). The reconciler is\n  // idempotent so a stray non-record event would be harmless, but\n  // skipping early avoids needless I/O.\n  if (!name.endsWith(\".json\") || name.startsWith(\".\")) return;\n  const itemId = name.slice(0, -\".json\".length);\n  await scheduleItemReconcile(slug, collection.schema, collection.dataDir, itemId);\n}\n"],"mappings":";;;;;;AAyCA,IAAM,WAAoC;CAAE,YAAY,CAAC;CAAG,YAAY,CAAC;AAAE;AAE3E,IAAI,UAAgD;AACpD,IAAI,eAAwC;;;AAI5C,SAAgB,4BAA4B,QAAyF;CACnI,CAAC,CAAE,WAAY;CACf,eAAe,OAAO,OAAO;AAC/B;AAEA,SAAgB,iBAAgD;CAC9D,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,+DAA+D;CAC7F,OAAO;AACT;AAEA,SAAgB,MAA+B;CAC7C,OAAO;AACT;;AAGA,SAAgB,gCAAsC;CACpD,UAAU;CACV,eAAe;AACjB;AAEA,SAAgB,OAAO,KAAsB;CAC3C,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;;;;;;ACvCA,IAAM,mBAAmB;;;;;AAMzB,SAAS,mBAAmB,MAAc,QAAwB;CAChE,OAAO,GAAG,mBAAmB,KAAK,GAAG;AACvC;;;AAIA,SAAS,wBAAwB,UAA2D;CAC1F,IAAI,CAAC,SAAS,WAAW,gBAAgB,GAAG,OAAO;CACnD,MAAM,OAAO,SAAS,MAAM,EAAuB;CACnD,MAAM,QAAQ,KAAK,QAAQ,GAAG;CAC9B,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO;EAAE,MAAM,KAAK,MAAM,GAAG,KAAK;EAAG,QAAQ,KAAK,MAAM,QAAQ,CAAC;CAAE;AACrE;;;;AAKA,SAAgB,oBAAoB,QAA0B,MAAsB,QAAwB;CAC1G,MAAM,EAAE,iBAAiB;CACzB,IAAI,CAAC,cAAc,OAAO;CAC1B,MAAM,MAAM,KAAK;CACjB,IAAI,QAAQ,KAAA,KAAa,QAAQ,MAAM,OAAO;CAC9C,MAAM,QAAQ,OAAO,GAAG,CAAC,CAAC,KAAK;CAC/B,OAAO,MAAM,SAAS,IAAI,QAAQ;AACpC;;;AAIA,SAAgB,WAAW,QAA0B,MAA+B;CAClF,MAAM,EAAE,iBAAiB,yBAAyB;CAClD,IAAI,CAAC,mBAAmB,CAAC,sBAAsB,OAAO;CACtD,MAAM,MAAM,KAAK;CACjB,IAAI,QAAQ,KAAA,KAAa,QAAQ,MAAM,OAAO;CAC9C,OAAO,qBAAqB,SAAS,OAAO,GAAG,CAAC;AAClD;;;;AAKA,eAAe,kBAAkB,MAAc,QAA0C;CACvF,MAAM,UAAU,eAAe;CAC/B,MAAM,WAAW,mBAAmB,MAAM,MAAM;CAEhD,QAAO,MADe,QAAQ,EAAA,CACf,QAAQ,UAAU,QAAQ,UAAU,MAAM,UAAU,CAAC,EAAE,aAAa,QAAQ;AAC7F;AAEA,eAAe,mBAAmB,MAAc,QAAmC;CACjF,QAAQ,MAAM,kBAAkB,MAAM,MAAM,EAAA,CAAG,KAAK,UAAU,MAAM,EAAE;AACxE;AAYA,IAAM,8BAAc,IAAI,IAAwB;;;;;AAMhD,SAAS,sBAAsB,QAA0B,MAA0C;CACjG,MAAM,OAAO,OAAO;CACpB,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ,KAAK,KAAK,WAAW,KAAA,KAAa,KAAK,KAAK,WAAW,OAAO,KAAK,OAAO,KAAK,KAAK,MAAM;CACxG,OAAO,KAAK,GAAG,QAAQ,KAAK,MAAM,IAAI,SAAS;AACjD;AAEA,eAAe,uBACb,MACA,QACA,QACA,cACA,UACe;CACf,MAAM,WAAW,mBAAmB,MAAM,MAAM;CAKhD,OAAO,MAAM;EACX,MAAM,WAAW,YAAY,IAAI,QAAQ;EACzC,IAAI,CAAC,UAAU;EACf,MAAM,SAAS;CACjB;CACA,MAAM,OAAmB,EAAE,SAAS,yBAAyB,MAAM,QAAQ,QAAQ,UAAU,cAAc,QAAQ,EAAE;CACrH,YAAY,IAAI,UAAU,IAAI;CAC9B,IAAI;EACF,MAAM,KAAK;CACb,UAAU;EAGR,IAAI,YAAY,IAAI,QAAQ,MAAM,MAChC,YAAY,OAAO,QAAQ;CAE/B;AACF;;;;;AAMA,eAAe,uBAAuB,MAAc,QAAgB,SAA0B,UAA6C;CACzI,MAAM,UAAU,eAAe;CAC/B,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,SAAS,QAAQ,UAAU,MAAM,UAAU;EACjD,IAAI,CAAC,UAAU,OAAO,aAAa,UAAU;EAC7C,MAAM,gBAAe,QAAQ,WAAW,MAAM,IAAI;GAChD,UAAU,QAAQ,mBAAmB,QAAQ;GAC7C,YAAY,QAAQ,gBAAgB;IAClC,UAAU,OAAO;IACjB;IACA;IACA;IACA,gBAAgB,QAAQ,oBAAoB,MAAM,MAAM;GAC1D,CAAC;EACH,CAAC;CACH;AACF;AAEA,eAAe,yBACb,MACA,QACA,QACA,UACA,cACA,UACe;CACf,MAAM,UAAU,eAAe;CAC/B,IAAI;EACF,MAAM,WAAW,MAAM,kBAAkB,MAAM,MAAM;EACrD,IAAI,SAAS,SAAS,GAAG;GACvB,MAAM,uBAAuB,MAAM,QAAQ,UAAU,QAAQ;GAC7D;EACF;EACA,MAAM,iBAAiB,QAAQ,oBAAoB,MAAM,MAAM;EAK/D,MAAM,QAAgB;GACpB,WAAW,QAAQ;GACnB,UAAU,QAAQ,mBAAmB,QAAQ;GAC7C,WAAW;GACX,OAAO,GAAG,OAAO,MAAM,IAAI;GAC3B;GACA,YAAY,QAAQ,gBAAgB;IAAE;IAAU;IAAM;IAAQ;IAAU;GAAe,CAAC;EAC1F,CAAC;CACH,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,wBAAwB;GAAE;GAAM;GAAQ,OAAO,OAAO,GAAG;EAAE,CAAC;CACzE;AACF;;;;AAKA,eAAsB,sBAAsB,MAAc,QAA+B;CACvF,IAAI;EACF,MAAM,MAAM,MAAM,mBAAmB,MAAM,MAAM;EACjD,KAAK,MAAM,WAAW,KACpB,MAAM,MAAc,OAAO;CAE/B,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,uBAAuB;GAAE;GAAM;GAAQ,OAAO,OAAO,GAAG;EAAE,CAAC;CACxE;AACF;;;;;;;;AASA,eAAsB,cACpB,MACA,QACA,SACA,QACA,SAAoB,CAAC,GACrB,sBAAY,IAAI,KAAK,GACN;CACf,IAAI,CAAC,OAAO,iBAAiB;EAE3B,MAAM,sBAAsB,MAAM,MAAM;EACxC;CACF;CACA,MAAM,OAAO,MAAM,SAAS,SAAS,QAAQ,MAAM;CACnD,IAAI,SAAS,MAAM;EACjB,MAAM,sBAAsB,MAAM,MAAM;EACxC;CACF;CAIA,MAAM,oBAAoB,MAAM,QAAQ,SAAS,MAAM,QAAQ,MAAM;CACrE,IAAI,WAAW,QAAQ,IAAI,GAAG;EAC5B,MAAM,sBAAsB,MAAM,MAAM;EACxC;CACF;CAMA,IAAI,OAAO,cAAc;EACvB,MAAM,aAAa,KAAK,OAAO;EAC/B,MAAM,MAAM,aAAa,YAAY,KAAK,OAAO,eAAe;EAEhE,IAAI,QAAQ,QAAQ,EADJ,eAAe,KAAA,KAAa,eAAe,QAAQ,eAAe,KAEhF,IAAI,CAAC,CAAC,KAAK,8CAA8C;GAAE;GAAM;GAAQ,cAAc,OAAO;EAAa,CAAC;EAE9G,IAAI,QAAQ,MAAM;GAChB,MAAM,sBAAsB,MAAM,MAAM;GACxC;EACF;CACF;CAIA,IAAI,CAAC,YAAY,OAAO,YAAY,IAAI,GAAG;EACzC,MAAM,sBAAsB,MAAM,MAAM;EACxC;CACF;CACA,MAAM,uBAAuB,MAAM,QAAQ,QAAQ,oBAAoB,QAAQ,MAAM,MAAM,GAAG,sBAAsB,QAAQ,IAAI,CAAC;AACnI;;;;;AAMA,eAAsB,kBACpB,MACA,QACA,SACA,SAAoB,CAAC,GACrB,sBAAY,IAAI,KAAK,GACN;CACf,IAAI,CAAC,OAAO,iBAAiB;CAC7B,IAAI;CACJ,IAAI;EACF,QAAQ,MAAM,UAAU,SAAS,MAAM;CACzC,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,yBAAyB;GAAE;GAAM;GAAS,OAAO,OAAO,GAAG;EAAE,CAAC;EACzE;CACF;CACA,MAAM,EAAE,eAAe;CACvB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,KAAK;EACjB,IAAI,OAAO,QAAQ,YAAY,IAAI,WAAW,GAAG;EACjD,MAAM,cAAc,MAAM,QAAQ,SAAS,KAAK,QAAQ,GAAG;CAC7D;AACF;;;;;AAMA,eAAsB,wBAAwB,OAAyB,CAAC,GAAkB;CACxF,MAAM,UAAU,eAAe;CAC/B,IAAI;CACJ,IAAI;EACF,UAAU,MAAM,QAAQ;CAC1B,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,qBAAqB,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;EACtD;CACF;CACA,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,MAAM,QAAQ,UAAU,MAAM,UAAU;EAC9C,IAAI,CAAC,KAAK;EACV,MAAM,SAAS,wBAAwB,IAAI,QAAQ;EACnD,IAAI,CAAC,QAAQ;EACb,MAAM,EAAE,MAAM,WAAW;EACzB,IAAI;GACF,MAAM,aAAa,MAAM,eAAe,MAAM,IAAI;GAClD,IAAI,CAAC,cAAc,CAAC,WAAW,OAAO,iBAAiB;IACrD,MAAM,MAAc,MAAM,EAAE;IAC5B;GACF;GACA,MAAM,OAAO,MAAM,SAAS,WAAW,SAAS,QAAQ,IAAI;GAC5D,IAAI,SAAS,QAAQ,WAAW,WAAW,QAAQ,IAAI,KAAK,CAAC,YAAY,WAAW,OAAO,YAAY,IAAI,GACzG,MAAM,MAAc,MAAM,EAAE;EAEhC,SAAS,KAAK;GACZ,IAAI,CAAC,CAAC,KAAK,sBAAsB;IAAE;IAAM;IAAQ,OAAO,OAAO,GAAG;GAAE,CAAC;EACvE;CACF;AACF;;AAGA,SAAgB,kCAAwC;CACtD,YAAY,MAAM;AACpB;;;ACnTA,IAAM,gBAAgB;AACtB,IAAM,gBAAgB,KAAK;AAC3B,IAAM,0BAA0B,KAAK;AAQrC,IAAM,2BAA2B;AAcjC,IAAM,2BAAW,IAAI,IAA+B;AACpD,IAAI,mBAA0D;AAC9D,IAAI,eAAsD;AAC1D,IAAI,UAAU;;;;;;AAMd,IAAI,gBAAkC,CAAC;AAQvC,IAAM,4BAAY,IAAI,IAA2B;;;;AAejD,eAAsB,wBAAwB,OAAiC,CAAC,GAAkB;CAChG,IAAI,SAAS;CAIb,gBAAgB,KAAK,iBAAiB,CAAC;CACvC,IAAI;EAKF,MAAM,wBAAwB,aAAa;EAC3C,MAAM,aAAa;EACnB,MAAM,aAAa,KAAK,0BAA0B,KAAA,IAAY,0BAA0B,KAAK;EAC7F,IAAI,eAAe,MAAM;GACvB,mBAAmB,kBAAkB;IACnC,aAAa,CAAC,CAAC,OAAO,QAAiB;KACrC,IAAI,CAAC,CAAC,KAAK,8BAA8B,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;IACjE,CAAC;GACH,GAAG,UAAU;GAEb,iBAAiB,MAAM;EACzB;EACA,MAAM,YAAY,KAAK,0BAA0B,KAAA,IAAY,2BAA2B,KAAK;EAC7F,IAAI,cAAc,MAAM;GACtB,eAAe,kBAAkB;IAC/B,iBAAiB,CAAC,CAAC,OAAO,QAAiB;KACzC,IAAI,CAAC,CAAC,KAAK,+BAA+B,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;IAClE,CAAC;GACH,GAAG,SAAS;GACZ,aAAa,MAAM;EACrB;EACA,UAAU;CACZ,SAAS,KAAK;EACZ,gBAAgB,CAAC;EACjB,MAAM;CACR;AACF;;;;AAKA,eAAsB,yBAAwC;CAC5D,IAAI,kBAAkB;EACpB,cAAc,gBAAgB;EAC9B,mBAAmB;CACrB;CACA,IAAI,cAAc;EAChB,cAAc,YAAY;EAC1B,eAAe;CACjB;CACA,KAAK,MAAM,WAAW,SAAS,OAAO,GACpC,IAAI;EACF,QAAQ,QAAQ,MAAM;CACxB,QAAQ,CAER;CAEF,SAAS,MAAM;CACf,UAAU,MAAM;CAChB,gBAAgB,CAAC;CACjB,UAAU;AACZ;;AAGA,eAAsB,0BAAyC;CAC7D,MAAM,aAAa;AACrB;;;AAIA,eAAsB,4BAA4B,KAA2B;CAC3E,MAAM,iBAAiB,GAAG;AAC5B;;;;;;AAOA,eAAe,iBAAiB,sBAAY,IAAI,KAAK,GAAkB;CACrE,KAAK,MAAM,SAAS,SAAS,OAAO,GAAG;EACrC,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,MAAM,UAAU;EACtC,SAAS,KAAK;GACZ,IAAI,CAAC,CAAC,KAAK,mCAAmC;IAAE,MAAM,MAAM;IAAM,OAAO,OAAO,GAAG;GAAE,CAAC;GACtF;EACF;EACA,IAAI,CAAC,OAAO,gBAAgB,CAAC,OAAO,OAAO;EAC3C,MAAM,kBAAkB,MAAM,MAAM,QAAQ,MAAM,SAAS,eAAe,GAAG;CAC/E;AACF;;;;;;AAOA,eAAe,eAA8B;CAC3C,IAAI;CACJ,IAAI;EACF,cAAc,MAAM,oBAAoB,aAAa;CACvD,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,2BAA2B,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;EAC5D;CACF;CAEA,MAAM,kBAAkB,qBAAqB,IADvB,IAAI,YAAY,KAAK,eAAe,WAAW,IAAI,CAC5B,CAAS;CACtD,MAAM,gBAAgB,MAAM,wBAAwB,WAAW;CAC/D,MAAM,eAAe,MAAM,iBAAiB,WAAW;CACvD,IAAI,mBAAmB,iBAAiB,cACtC,MAAM,wBAAwB,aAAa;AAE/C;AAEA,SAAS,qBAAqB,WAAiC;CAC7D,IAAI,UAAU;CACd,KAAK,MAAM,QAAQ,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG;EACvC,IAAI,UAAU,IAAI,IAAI,GAAG;EACzB,MAAM,UAAU,SAAS,IAAI,IAAI;EACjC,IAAI,SACF,IAAI;GACF,QAAQ,QAAQ,MAAM;EACxB,QAAQ,CAER;EAEF,SAAS,OAAO,IAAI;EACpB,UAAU;EACV,IAAI,CAAC,CAAC,KAAK,mBAAmB,EAAE,KAAK,CAAC;CACxC;CACA,OAAO;AACT;;;AAIA,eAAe,wBAAwB,aAA4D;CACjG,IAAI,UAAU;CACd,KAAK,MAAM,cAAc,aAAa;EACpC,MAAM,WAAW,SAAS,IAAI,WAAW,IAAI;EAC7C,IAAI,CAAC,UAAU;EACf,MAAM,WAAW,KAAK,UAAU,WAAW,MAAM;EACjD,IAAI,SAAS,eAAe,UAAU;EACtC,SAAS,aAAa;EACtB,IAAI,CAAC,CAAC,KAAK,0CAA0C,EAAE,MAAM,WAAW,KAAK,CAAC;EAC9E,MAAM,kBAAkB,WAAW,MAAM,WAAW,QAAQ,WAAW,SAAS,aAAa;EAC7F,UAAU;CACZ;CACA,OAAO;AACT;AAEA,eAAe,iBAAiB,aAA4D;CAC1F,IAAI,UAAU;CACd,KAAK,MAAM,cAAc,aAAa;EACpC,IAAI,SAAS,IAAI,WAAW,IAAI,GAAG;EACnC,MAAM,gBAAgB,WAAW,MAAM,WAAW,QAAQ,WAAW,OAAO;EAC5E,UAAU;CACZ;CACA,OAAO;AACT;AAEA,eAAe,gBAAgB,MAAc,QAA0B,SAAgC;CACrG,IAAI;EAIF,MAAM,MAAM,SAAS,EAAE,WAAW,KAAK,CAAC;EAIxC,MAAM,kBAAkB,MAAM,QAAQ,SAAS,aAAa;EAC5D,MAAM,UAAU,MAAM,SAAS,EAAE,YAAY,MAAM,IAAI,YAAY,aAAa;GAG9E,QAAQ,MAAM,QAAQ,CAAC,CAAC,OAAO,QAAiB;IAC9C,IAAI,CAAC,CAAC,KAAK,wBAAwB;KAAE;KAAM;KAAU,OAAO,OAAO,GAAG;IAAE,CAAC;GAC3E,CAAC;EACH,CAAC;EACD,QAAQ,GAAG,UAAU,QAAQ;GAC3B,IAAI,CAAC,CAAC,KAAK,iBAAiB;IAAE;IAAM,OAAO,OAAO,GAAG;GAAE,CAAC;EAC1D,CAAC;EACD,SAAS,IAAI,MAAM;GAAE;GAAM;GAAS;GAAS,YAAY,KAAK,UAAU,MAAM;EAAE,CAAC;EACjF,IAAI,CAAC,CAAC,KAAK,mBAAmB;GAAE;GAAM;EAAQ,CAAC;CACjD,SAAS,KAAK;EACZ,IAAI,CAAC,CAAC,KAAK,wBAAwB;GAAE;GAAM,OAAO,OAAO,GAAG;EAAE,CAAC;CACjE;AACF;;;;;;;;;;AAWA,SAAgB,iCAAiC,MAAc,QAA0B,SAAiB,QAA+B;CACvI,OAAO,sBAAsB,MAAM,QAAQ,SAAS,MAAM;AAC5D;AAEA,SAAS,sBAAsB,MAAc,QAA0B,SAAiB,QAA+B;CACrH,MAAM,MAAM,GAAG,KAAK,MAAM;CAC1B,MAAM,WAAW,UAAU,IAAI,GAAG;CAClC,IAAI,UAAU;EACZ,SAAS,UAAU;EACnB,OAAO,SAAS;CAClB;CACA,MAAM,OAAsB;EAAE,SAAS,QAAQ,QAAQ;EAAG,SAAS;CAAM;CACzE,KAAK,WAAW,YAAY;EAC1B,IAAI;GAMF,IAAI,YAAY;GAChB,OAAO,WAAW;IAChB,KAAK,UAAU;IACf,MAAM,cAAc,MAAM,QAAQ,SAAS,QAAQ,aAAa;IAChE,YAAY,KAAK;GACnB;EACF,UAAU;GACR,UAAU,OAAO,GAAG;EACtB;CACF,EAAA,CAAG;CACH,UAAU,IAAI,KAAK,IAAI;CACvB,OAAO,KAAK;AACd;;;;;AAMA,eAAe,QAAQ,MAAc,UAAiD;CACpF,MAAM,aAAa,MAAM,eAAe,MAAM,aAAa;CAC3D,IAAI,CAAC,YAAY;CACjB,IAAI,aAAa,MAAM;EAKrB,MAAM,kBAAkB,MAAM,WAAW,QAAQ,WAAW,SAAS,aAAa;EAClF,MAAM,wBAAwB,aAAa;EAC3C;CACF;CACA,MAAM,OAAO,OAAO,aAAa,WAAW,WAAW,SAAS,SAAS,OAAO;CAKhF,IAAI,CAAC,KAAK,SAAS,OAAO,KAAK,KAAK,WAAW,GAAG,GAAG;CACrD,MAAM,SAAS,KAAK,MAAM,GAAG,EAAe;CAC5C,MAAM,sBAAsB,MAAM,WAAW,QAAQ,WAAW,SAAS,MAAM;AACjF"}

package/dist/collection-watchers/reconciler.d.ts

@@ -0,0 +1,33 @@
+import { CollectionItem, CollectionSchema } from '../collection';
+import { DiscoveryOptions, IoOptions } from '../collection/server';
+/** The human-readable label shown in a completion notification's title.
+ *  Uses the schema's `displayField` value when declared and non-empty;
+ *  otherwise falls back to the record's primaryKey (`itemId`). */
+export declare function resolveDisplayLabel(schema: CollectionSchema, item: CollectionItem, itemId: string): string;
+/** True iff the schema declares completion tracking AND the item's
+ *  `completionField` value (stringified) is in `completionDoneValues`. */
+export declare function itemIsDone(schema: CollectionSchema, item: CollectionItem): boolean;
+/** Idempotently clear EVERY bell entry that matches this (slug, itemId).
+ *  Silent no-op when nothing matches. The "every" is defensive: if a
+ *  duplicate ever slips through, this drains the lot. */
+export declare function clearItemNotification(slug: string, itemId: string): Promise<void>;
+/** Reconcile one item to the desired bell state. Re-reads the record from
+ *  disk so the decision is grounded in current truth, not in the event
+ *  payload. Safe to call when the file is missing (delete path).
+ *
+ *  `ioOpts` flows into `readItem`'s workspace-containment check —
+ *  production callers (the watcher) pass nothing; tests pass
+ *  `{ workspaceRoot: <tmpdir> }` so the check accepts a fixture dataDir. */
+export declare function reconcileItem(slug: string, schema: CollectionSchema, dataDir: string, itemId: string, ioOpts?: IoOptions, now?: Date): Promise<void>;
+/** Boot-time reconcile: walk every record under `dataDir` once and
+ *  reconcile it. Catches up changes that happened while the server was
+ *  down. Deleted items are covered by `sweepStaleActiveEntries`, not this
+ *  function (it only sees files that exist). */
+export declare function reconcileAllItems(slug: string, schema: CollectionSchema, dataDir: string, ioOpts?: IoOptions, now?: Date): Promise<void>;
+/** Boot-time sweep over the active bell: drop any entries whose underlying
+ *  file is gone, whose collection was deleted, whose schema no longer
+ *  tracks completion, or whose item is now done. Reverse-covers the cases
+ *  `reconcileAllItems` misses (it only walks files that exist). */
+export declare function sweepStaleActiveEntries(opts?: DiscoveryOptions): Promise<void>;
+/** Test-only: clear the per-key in-flight locks. */
+export declare function _resetReconcilerLocksForTesting(): void;

package/dist/collection-watchers/watcher.d.ts

@@ -0,0 +1,34 @@
+import { DiscoveryOptions } from '../collection/server';
+import { CollectionSchema } from '../collection';
+/** Test-only configuration knobs. Production callers pass nothing and get
+ *  the live workspace defaults; tests pass a tmpdir-rooted `discoveryOpts`
+ *  and override the tick cadences (or set them to `null` to disable the
+ *  auto-ticks so the test drives sync manually). */
+export interface CollectionWatcherOptions {
+    discoveryOpts?: DiscoveryOptions;
+    rediscoveryIntervalMs?: number | null;
+    triggerTickIntervalMs?: number | null;
+}
+/** Boot entry point: sweep stale active entries, then mount watchers for
+ *  every discovered collection and arm the periodic re-discovery poll.
+ *  Idempotent — a second call is a no-op. */
+export declare function startCollectionWatchers(opts?: CollectionWatcherOptions): Promise<void>;
+/** Tear down every watcher and stop the intervals. Used by tests;
+ *  production never calls this (process exit reclaims the fds). Resets
+ *  `started` so a subsequent `startCollectionWatchers` re-mounts. */
+export declare function stopCollectionWatchers(): Promise<void>;
+/** Test-only: manually trigger one rediscovery + reconcile pass. */
+export declare function _syncWatchersForTesting(): Promise<void>;
+/** Test-only: drive one wall-clock tick synchronously, with an optional
+ *  injected clock. */
+export declare function _tickTimeTriggersForTesting(now?: Date): Promise<void>;
+/** Test-only: the per-key single-flight scheduler. Exported so test code
+ *  can drive rapid-fire calls directly and observe the trailing coalesce
+ *  — `fs.watch` event timing is too flaky to assert against.
+ *
+ *  Single-flight semantics: while a reconcile is in flight for a given
+ *  (slug, itemId), additional events on the same key set `pending = true`
+ *  and return — the running reconcile re-runs once after it completes.
+ *  This collapses fs.watch's rapid-fire bursts (atomic rename surfaces as
+ *  2-3 events) into a single reconcile + one trailing re-run. */
+export declare function _scheduleItemReconcileForTesting(slug: string, schema: CollectionSchema, dataDir: string, itemId: string): Promise<void>;

package/dist/{deriveAll-C15OpM3K.cjs → deriveAll-VRWrs3SF.cjs}

@@ -1,13 +1,21 @@
 //#region src/collection/core/schema.ts
-/** Retriever kinds a Feed's `ingest.kind` may declare. The host's feeds engine
-*  dispatches on these; they live here (with the schema contract) so the schema
-*  validator can enforce them. The host re-exports these from
+/** Declarative retriever kinds a Feed's `ingest.kind` may declare. The host's
+*  feeds engine dispatches on these; they live here (with the schema contract)
+*  so the schema validator can enforce them. The host re-exports these from
 *  `server/workspace/feeds/ingestTypes.ts`. */
 var INGEST_KINDS = [
 	"rss",
 	"atom",
 	"http-json"
 ];
+/** The agent-performed ingest kind. Instead of a declarative fetch, the host
+*  dispatches a hidden background chat (origin `system`) in `ingest.role`,
+*  seeded with `ingest.template` + a summary of every record, on the
+*  `ingest.schedule` cadence; the worker edits records via the collections io
+*  layer. Kept separate from {@link INGEST_KINDS} (which the declarative
+*  retriever registry keys on) so the schema validator can model `ingest` as a
+*  discriminated union without the feeds engine gaining an "agent" retriever. */
+var AGENT_INGEST_KIND = "agent";
 /** Refresh cadences a Feed's `ingest.schedule` may declare. */
 var FEED_SCHEDULES = [
 	"hourly",
@@ -39,7 +47,7 @@ function evaluateDerived(formula, ctx) {
 	const value = evaluate(ast, ctx);
 	return Number.isFinite(value) ? value : null;
 }
-var SINGLE_CHAR_PUNCT = new Set([
+var SINGLE_CHAR_PUNCT = /* @__PURE__ */ new Set([
 	"(",
 	")",
 	"+",
@@ -359,6 +367,12 @@ function deriveAll(schema, base, refRecords) {
 	return enriched;
 }
 //#endregion
+Object.defineProperty(exports, "AGENT_INGEST_KIND", {
+	enumerable: true,
+	get: function() {
+		return AGENT_INGEST_KIND;
+	}
+});
 Object.defineProperty(exports, "FEED_SCHEDULES", {
 	enumerable: true,
 	get: function() {
@@ -396,4 +410,4 @@ Object.defineProperty(exports, "resolveRowRefs", {
 	}
 });
 
-//# sourceMappingURL=deriveAll-C15OpM3K.cjs.map
+//# sourceMappingURL=deriveAll-VRWrs3SF.cjs.map

package/dist/deriveAll-VRWrs3SF.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deriveAll-VRWrs3SF.cjs","names":[],"sources":["../src/collection/core/schema.ts","../src/collection/core/derivedFormula.ts","../src/collection/core/deriveAll.ts"],"sourcesContent":["// Schema-driven collection types. A \"collection\" is a skill (under\n// .claude/skills/<slug>/) that also ships a sibling `schema.json`.\n// The host's <CollectionView> reads the schema + records and renders\n// a table/form; Claude reads SKILL.md and CRUDs the records as JSON\n// files.\n//\n// Field types for v0 — keep this list narrow and grow it only when a\n// real collection needs the new type. v0 supports flat records only;\n// nested tables / cross-collection refs / derived fields / actions are\n// deferred to follow-ups (see plans/done/feat-skill-driven-apps.md and\n// plans/done/feat-skill-driven-apps-worklog.md — historical names predate\n// the rename).\n\n/** Minimal \"this collection is a feed\" descriptor carried on the schema.\n *  Deliberately narrow — the canonical collection contract stays\n *  independent of the host's feeds subsystem. The host's richer retrieval\n *  spec (`IngestSpec` in `server/workspace/feeds/ingestTypes.ts`)\n *  `extends CollectionIngest`, so feed code reads the extra fields by\n *  typing feed schemas with that subtype; collection rendering only needs\n *  these three + the presence check. */\nexport interface CollectionIngest {\n  kind: string;\n  schedule: string;\n  /** Optional time-of-day anchor for `schedule: \"daily\"` — the hour (0–23) to\n   *  refresh around (the host ticks hourly, so the run lands within that hour).\n   *  Ignored for non-daily schedules. Absent ⇒ elapsed-based daily (\"≥24 h since\n   *  the last run\"). NOTE: **UTC**, not local — compared via `getUTCHours()` for\n   *  an unambiguous, DST-free check (matching the rest of the scheduler), so\n   *  convert local times before writing (e.g. 07:00 JST → `atHour: 22`). */\n  atHour?: number;\n  /** Declarative retrievers (`rss`/`atom`/`http-json`) only — the host fetches\n   *  this URL on the schedule. Absent for `kind: \"agent\"`, where the agent owns\n   *  retrieval. */\n  url?: string;\n  /** `kind: \"agent\"` only: role id the scheduled hidden worker runs in. */\n  role?: string;\n  /** `kind: \"agent\"` only: skill-relative template path (under `templates/`)\n   *  whose prose tells the worker how to refresh the records. */\n  template?: string;\n}\n\n/** Declarative retriever kinds a Feed's `ingest.kind` may declare. The host's\n *  feeds engine dispatches on these; they live here (with the schema contract)\n *  so the schema validator can enforce them. The host re-exports these from\n *  `server/workspace/feeds/ingestTypes.ts`. */\nexport const INGEST_KINDS = [\"rss\", \"atom\", \"http-json\"] as const;\nexport type IngestKind = (typeof INGEST_KINDS)[number];\n\n/** The agent-performed ingest kind. Instead of a declarative fetch, the host\n *  dispatches a hidden background chat (origin `system`) in `ingest.role`,\n *  seeded with `ingest.template` + a summary of every record, on the\n *  `ingest.schedule` cadence; the worker edits records via the collections io\n *  layer. Kept separate from {@link INGEST_KINDS} (which the declarative\n *  retriever registry keys on) so the schema validator can model `ingest` as a\n *  discriminated union without the feeds engine gaining an \"agent\" retriever. */\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\n/** Refresh cadences a Feed's `ingest.schedule` may declare. */\nexport const FEED_SCHEDULES = [\"hourly\", \"daily\", \"weekly\", \"on-demand\"] as const;\nexport type FeedSchedule = (typeof FEED_SCHEDULES)[number];\n\nexport type CollectionFieldType =\n  | \"string\"\n  | \"text\"\n  | \"email\"\n  | \"number\"\n  | \"date\"\n  | \"datetime\"\n  | \"boolean\"\n  | \"markdown\"\n  | \"ref\"\n  | \"money\"\n  | \"enum\"\n  | \"table\"\n  | \"derived\"\n  | \"embed\"\n  // Holds a workspace-relative image path (e.g. a `data/attachments/...`\n  // upload); rendered as an <img> in the detail view (not the list table —\n  // a per-row fetch is too expensive at scale). Stored and edited as a\n  // plain string.\n  | \"image\"\n  // Holds a workspace-relative file path as a plain string (e.g. an\n  // `artifacts/html/<name>.html` app). Rendered as a clickable link in\n  // both the list table and the detail view: HTML / SVG artifacts open\n  // their rendered form in a new tab; any other path opens in the File\n  // Explorer. Stored and edited as a plain string, like `image`.\n  | \"file\"\n  // A checkbox that is a pure PROJECTION of an `enum` field — it stores\n  // nothing of its own. Checked when the enum equals `onValue`; toggling\n  // writes `onValue` / `offValue` back to that enum field. Lets a \"done\"\n  // checkbox front a kanban `status` field with the enum as the single\n  // source of truth (no separate stored boolean to keep in sync).\n  | \"toggle\";\n\n// \"feed\" collections live in the non-skill `<workspace>/feeds/` registry\n// and carry an `ingest` block; they reuse the same storage + rendering\n// as skill-backed collections but are never loaded into the agent prompt.\nexport type CollectionSource = \"user\" | \"project\" | \"feed\";\n\n/** Recurrence unit for a `spawn.every` advance. */\nexport type CollectionRecurUnit = \"day\" | \"week\" | \"month\" | \"year\";\n\n/** How a `spawn` advances the source item's `triggerField` date to\n *  produce the successor's. All arithmetic is done on the civil\n *  (year, month, day) triple — never by adding milliseconds — so month\n *  lengths and leap years are handled correctly. */\nexport interface CollectionEvery {\n  unit: CollectionRecurUnit;\n  /** Number of `unit`s to advance (≥ 1). `interval: 3` + `unit: \"month\"`\n   *  = quarterly; `interval: 1` + `unit: \"year\"` = annual. */\n  interval: number;\n  /** Day-of-month anchor for `month`/`year` units. The CANONICAL day —\n   *  read from the rule, never re-derived from the prior concrete date,\n   *  so \"31st of every month\" yields 31 → 28/29 → 31 → 30 … with no\n   *  drift (it is clamped per-month at compute time, not stored\n   *  clamped). `\"last\"` always means the last day of the target month.\n   *  Omitted ⇒ preserve the source date's day (safe for days ≤ 28).\n   *  Ignored for `day`/`week` units. */\n  dayOfMonth?: number | \"last\";\n}\n\n/** Field-driven recurrence: the advance interval is selected PER RECORD by\n *  the value of an `enum` field (`fromField`), looked up in `map`. Lets one\n *  collection mix daily / weekly / monthly obligations in a single list — the\n *  host reads `record[fromField]`, finds the matching `CollectionEvery`, and\n *  advances by it. `fromField` must point at a top-level `enum` field whose\n *  `values` the `map` keys exactly cover (validated at discovery), and must\n *  itself be carried/`set` onto the successor so the chain keeps recurring. */\nexport interface CollectionEveryFieldDriven {\n  /** Top-level `enum` field whose value selects the interval. */\n  fromField: string;\n  /** Interval per enum value. Keys exactly cover `fromField`'s `values`;\n   *  each value is a literal {@link CollectionEvery}. */\n  map: Record<string, CollectionEvery>;\n}\n\n/** The `every` of a `spawn`: either a single literal interval applied to\n *  every record, or a per-record interval selected by an `enum` field. The\n *  literal arm is what `advanceTriggerDate` consumes — the field-driven arm\n *  is resolved down to one of its `map` values before the date math runs. */\nexport type CollectionSpawnEvery = CollectionEvery | CollectionEveryFieldDriven;\n\n/** Narrowing guard: true when `every` is the field-driven arm. */\nexport function isFieldDrivenEvery(every: CollectionSpawnEvery): every is CollectionEveryFieldDriven {\n  return \"fromField\" in every;\n}\n\n/** Host-driven recurrence: when a record satisfies `when`, the host\n *  creates the next record with a forward-advanced `triggerField` date.\n *  The successor's id and contents are a pure function of (source\n *  record, this rule); creation is create-if-absent, so the mechanism\n *  stays convergent — observing the predicate N times writes one\n *  successor. Requires the schema to declare `triggerField`. */\nexport interface CollectionSpawn {\n  /** Predicate that fires the spawn (a `CollectionWhen`). Defaults to\n   *  \"`completionField` value ∈ `completionDoneValues`\" (i.e. spawn the\n   *  next instance when this one is done). */\n  when?: CollectionWhen;\n  /** How to advance `triggerField` from the source to the successor —\n   *  either a single literal interval or a per-record, field-driven map. */\n  every: CollectionSpawnEvery;\n  /** Record fields copied verbatim onto the successor. Fields not listed\n   *  here, not in `set`, and not the trigger / primary keys start\n   *  blank. */\n  carry?: string[];\n  /** Fields forced to fixed values on the successor (typically resetting\n   *  the status field to its pending value). */\n  set?: Record<string, unknown>;\n}\n\n/** The kind of work an action kicks off. v1 ships only `\"chat\"` —\n *  start a new chat in a role with a templated seed prompt. The enum\n *  reserves room for a future `\"mutate\"` (status transitions) without\n *  another schema-shape change. */\nexport type CollectionActionKind = \"chat\";\n\n/** Optional visibility predicate: the target (an action button or a\n *  field) renders only when the open record's `field` (stringified) is\n *  one of `in`. Generic and domain-free — the host evaluates it against\n *  the record with no knowledge of what the field means. Absent ⇒\n *  always shown. */\nexport interface CollectionWhen {\n  /** Top-level record field key whose value gates visibility. */\n  field: string;\n  /** Allowed values; the target shows when `String(record[field])` is\n   *  one of these. Non-empty. */\n  in: string[];\n}\n\n/** @deprecated Name retained for back-compat; use {@link CollectionWhen}.\n *  Both actions and fields share the same predicate shape. */\nexport type CollectionActionWhen = CollectionWhen;\n\n/** What a custom view's capability token is allowed to do against the\n *  collection's data endpoint. `read` returns enriched records (getItems\n *  semantics); `write` validates-and-stores rows (putItems semantics).\n *  There is deliberately no `delete` — a view can never do more than the\n *  agent's own `manageCollection` tool. */\nexport type CollectionViewCapability = \"read\" | \"write\";\n\n/** A custom (LLM-authored) HTML view for a collection. The host renders\n *  `file` in a sandboxed iframe over the collection's records; the view\n *  reaches its data only through a slug- and capability-scoped token (see\n *  `server/api/auth/viewToken.ts`). Pure data — the host holds no\n *  view-specific code; meaning lives in the HTML file + this registration. */\nexport interface CollectionCustomView {\n  /** Stable id; the view-mode selector key (`custom:<id>`) and the\n   *  capability-token clamp key. Must be a valid slug. */\n  id: string;\n  /** Button label in the view-mode selector (author-authored, like field\n   *  labels — not run through i18n). */\n  label: string;\n  /** Optional Material-icon name for the selector button. */\n  icon?: string;\n  /** Skill-relative path to the HTML file under `views/` (e.g.\n   *  `views/year.html`). Path-safe, must end in `.html`. */\n  file: string;\n  /** What the view may do with the data endpoint. Defaults to `[\"read\"]`\n   *  (least privilege); declare `[\"read\",\"write\"]` only for views that\n   *  edit records. The mint endpoint clamps any requested caps to this. */\n  capabilities?: CollectionViewCapability[];\n}\n\n/** A schema-declared, per-record action rendered as a button in the\n *  read-only detail view. Pure UI/behaviour directive — never stored,\n *  never validated against record data. All domain specifics (label,\n *  role, template) live here in the schema / skill folder, so the host\n *  stays generic. */\nexport interface CollectionAction {\n  /** Stable id (used in the dispatch route + testids). */\n  id: string;\n  /** Button text (English, like field labels). */\n  label: string;\n  /** Material-icon name shown on the button. */\n  icon?: string;\n  /** What the action does. v1: `\"chat\"`. */\n  kind: CollectionActionKind;\n  /** `kind: \"chat\"`: the role id the new chat runs in. */\n  role: string;\n  /** `kind: \"chat\"`: skill-relative path to the template file whose\n   *  text becomes the seed prompt body (e.g. `templates/invoice.md`). */\n  template: string;\n  /** Optional visibility predicate; the button renders only when the\n   *  open record matches (see CollectionWhen). Absent ⇒ always\n   *  shown. */\n  when?: CollectionWhen;\n}\n\nexport interface CollectionFieldSpec {\n  type: CollectionFieldType;\n  label: string;\n  /** True for the field whose value is the record's filename (no\n   *  separate auto-id). Exactly one field per schema may set this. */\n  primary?: boolean;\n  required?: boolean;\n  /** When `type === \"ref\"` or `type === \"embed\"`: the slug of the\n   *  target collection. For `ref` the record stores the target\n   *  item's primary-key slug and the host renders a clickable link\n   *  + dropdown picker. For `embed` the host pulls a *fixed* record\n   *  (see `id`) from the target and renders its fields read-only in\n   *  the detail view. Required for both; ignored on every other\n   *  type. */\n  to?: string;\n  /** When `type === \"embed\"`: the primary-key value of the fixed\n   *  record to pull from the `to` collection (e.g. `me` for the\n   *  singleton mc-profile). Nothing is stored on this record — the\n   *  embed is a display-only directive resolved at render time, so\n   *  it never appears in the list table or the edit form. Required\n   *  when type is `embed`; ignored on every other type. */\n  id?: string;\n  /** When `type === \"money\"` (or `type === \"derived\"` with\n   *  `display: \"money\"`): a literal ISO 4217 currency code passed to\n   *  `Intl.NumberFormat` for display — fixed for every record. The\n   *  stored value is always a plain decimal number; currency is\n   *  presentation only. Mutually substitutable with `currencyField`:\n   *  a money field must declare at least one of the two. */\n  currency?: string;\n  /** When `type === \"money\"` (or `type === \"derived\"` with\n   *  `display: \"money\"`): the name of a sibling record field whose\n   *  value holds the ISO 4217 code, letting currency vary per record\n   *  (e.g. an invoice's `currency` enum). The renderer reads\n   *  `record[currencyField]` and falls back to the literal `currency`\n   *  (then \"USD\") when the field is absent or empty. Resolved against\n   *  the top-level record even for money sub-fields inside a table. */\n  currencyField?: string;\n  /** When `type === \"enum\"`: the closed set of allowed string\n   *  values. The form renders a `<select>` populated from this\n   *  list; storage is a plain string. Required when type is\n   *  `enum`; ignored on every other type. */\n  values?: readonly string[];\n  /** When `type === \"table\"`: the sub-schema for each row (a flat\n   *  record of non-table / non-derived field specs). Required when\n   *  type is `table`. v0 disallows nested tables and derived\n   *  columns to keep the editor + evaluator simple. */\n  of?: Record<string, CollectionFieldSpec>;\n  /** When `type === \"derived\"`: a tiny expression evaluated against\n   *  the record. Supports `+ - * /`, parens, identifier refs to\n   *  top-level fields, `sum(tableField[].col)`, and\n   *  `sum(tableField[].col * tableField[].col)`. See\n   *  `src/utils/collections/derivedFormula.ts`. Required when type\n   *  is `derived`. */\n  formula?: string;\n  /** When `type === \"derived\"`: an inner field type the computed\n   *  value should be rendered as (e.g. `\"money\"` so $1,234.56 is\n   *  formatted). Defaults to `\"number\"`. */\n  display?: CollectionFieldType;\n  /** Optional visibility predicate: this field renders only when the\n   *  record matches (e.g. hide a `rating` field until `visited` is\n   *  `true` via `{ field: \"visited\", in: [\"true\"] }`). Applies to the\n   *  list cell (blank when hidden), the edit form (hidden live as the\n   *  gating field changes), and the detail view. Purely presentational\n   *  — a hidden field's stored value is never cleared. `when.field`\n   *  must name another top-level field. Absent ⇒ always shown. Only\n   *  honoured on top-level fields, not inside a `table`'s `of`. */\n  when?: CollectionWhen;\n  /** When `type === \"toggle\"`: the name of the top-level `enum` field this\n   *  checkbox projects. The toggle stores nothing itself — it reads and\n   *  writes this field. Required when type is `toggle`; ignored otherwise.\n   *  Must name a real `enum` field. */\n  field?: string;\n  /** When `type === \"toggle\"`: the enum value that means \"checked\". The\n   *  box is checked when the projected `field` equals this; checking writes\n   *  it. Required when type is `toggle`; must be one of the enum's `values`. */\n  onValue?: string;\n  /** When `type === \"toggle\"`: the enum value written when the box is\n   *  unchecked. Required when type is `toggle`; must be one of the enum's\n   *  `values`. */\n  offValue?: string;\n}\n\nexport interface CollectionSchema {\n  /** Human-facing collection name (sidebar, header). */\n  title: string;\n  /** Material-icon name shown next to the title. */\n  icon: string;\n  /** Workspace-relative folder holding one-JSON-per-record. Validated\n   *  to live under the workspace root at load time. */\n  dataPath: string;\n  /** Field name whose value doubles as the record's filename. */\n  primaryKey: string;\n  /** When set, the collection is a singleton: at most one record,\n   *  whose primary key is fixed to this value (e.g. `me` for the\n   *  business profile). The host pre-fills + locks the create form's\n   *  primary key and hides Add once the record exists. */\n  singleton?: string;\n  /** Ordered map: insertion order = column order in the table view. */\n  fields: Record<string, CollectionFieldSpec>;\n  /** Optional per-record actions rendered as buttons in the detail\n   *  view (e.g. \"Generate PDF\"). Order = button order. */\n  actions?: CollectionAction[];\n  /** Optional collection-level actions rendered as buttons in the\n   *  collection header (e.g. \"Extend the course\"). Unlike `actions`,\n   *  these carry no record context: the seed prompt injects a compact\n   *  progress summary of every record instead. The `when` predicate is\n   *  not evaluated (there is no record to gate on). Order = button order. */\n  collectionActions?: CollectionAction[];\n  /** Name of the field whose value marks an item as \"done\". When set,\n   *  a notification fires on item create (unless the item is born done)\n   *  and clears when the field's value transitions into\n   *  `completionDoneValues`. Must name a real field in `fields`. */\n  completionField?: string;\n  /** The set of values for `completionField` that count as \"done\"\n   *  (e.g. `[\"Done\"]` for a todo status field, `[\"paid\"]` for an\n   *  invoice). Non-empty. Compared as strings. */\n  completionDoneValues?: readonly string[];\n  /** Name of the field whose value is shown as the human-readable\n   *  label in a completion notification's title (e.g. a `name` field,\n   *  so the bell reads `Contacts: Jane Doe` instead of the opaque\n   *  primaryKey). Must name a real field in `fields`. When unset — or\n   *  when the record's value for it is empty — the title falls back to\n   *  the record's primaryKey value. Display-only; never stored. */\n  displayField?: string;\n  /** Name of a `date` field that gates this item's completion\n   *  notification: the bell is suppressed until the clock reaches that\n   *  date (compared at day-granularity in the server's local timezone),\n   *  instead of firing on create. Requires `completionField` /\n   *  `completionDoneValues` (the bell still clears via the done value).\n   *  Must name a real `date` field. Absent ⇒ fire on create, as before. */\n  triggerField?: string;\n  /** Lead time in whole days: fire the bell this many days BEFORE\n   *  `triggerField` (so `10` shows the reminder 10 days early). The lead\n   *  is applied at fire time, not stored, so it composes with `spawn` —\n   *  every recurred cycle fires the same number of days before its own\n   *  trigger. Non-negative integer; requires `triggerField`. Default 0\n   *  (fire on the trigger date). */\n  triggerLeadDays?: number;\n  /** Host-driven recurrence. When set, requires `triggerField`. See\n   *  {@link CollectionSpawn}. */\n  spawn?: CollectionSpawn;\n  /** Name of a `date` field that anchors the optional calendar view: a\n   *  month grid where each record lands on the day cell matching this\n   *  field's value. When unset, the calendar toggle still appears if the\n   *  schema has any `date` field (the first one, in declaration order, is\n   *  used by default and is switchable in-view). Set this to pin a specific\n   *  anchor. Must name a real `date` field. */\n  calendarField?: string;\n  /** Name of a second `date` field marking the END of a multi-day span on\n   *  the calendar: the record renders from `calendarField` through this\n   *  date inclusive. Requires `calendarField`. Must name a real `date`\n   *  field. Absent ⇒ single-day placement. */\n  calendarEndField?: string;\n  /** Name of a string field holding a free-form time or time-range\n   *  (e.g. \"14:00-17:00\", \"17:00-\", \"16:30\") that places records on the\n   *  calendar's day (time-allocation) view. Consulted only when the calendar\n   *  date fields are date-only. Requires `calendarField`. */\n  calendarTimeField?: string;\n  /** Name of an `enum` field that groups records into columns on the\n   *  optional Kanban board: each record lands in the column matching its\n   *  value, with empty/unknown values collected in an \"Uncategorized\"\n   *  column. When unset, the Kanban toggle still appears if the schema has\n   *  any `enum` field (the first one, in declaration order, is used by\n   *  default and is switchable in-view). Set this to pin a specific group\n   *  field. Must name a real `enum` field. */\n  kanbanField?: string;\n  /** Optional custom (LLM-authored) HTML views, each rendered in a\n   *  sandboxed iframe over the records. Absent ⇒ only the built-in\n   *  field-derived views (table / calendar / kanban / dashboard). See\n   *  {@link CollectionCustomView}. */\n  views?: CollectionCustomView[];\n  /** Optional predicate that gates the completion bell: when set, the bell\n   *  fires only for records whose `String(record[notifyWhen.field])` is one\n   *  of `notifyWhen.in` (e.g. notify only `high`/`urgent` priority todos).\n   *  Reuses the `when` predicate shape. Requires `completionField` — it\n   *  narrows that bell rather than introducing a second one. The bell still\n   *  clears on done / delete / when the predicate stops matching. Absent ⇒\n   *  notify for every open record (the prior behaviour). `notifyWhen.field`\n   *  must name a real top-level field. */\n  notifyWhen?: CollectionWhen;\n  /** Optional scheduled-retrieval config. When present, the host refreshes\n   *  this collection on `ingest.schedule`. Two flavours: a declarative Feed\n   *  (`kind: rss/atom/http-json`) periodically fetches `ingest.url`, maps the\n   *  response into records, and upserts them by `primaryKey` — only feeds\n   *  discovered from the `<workspace>/feeds/` registry carry this. Or\n   *  `kind: \"agent\"`, valid on any (incl. skill-backed) collection: the host\n   *  dispatches a hidden background worker in `ingest.role` seeded with\n   *  `ingest.template`, and the worker edits the records itself. The host's\n   *  feeds subsystem narrows this to its richer `IngestSpec`. */\n  ingest?: CollectionIngest;\n}\n\nexport interface CollectionSummary {\n  slug: string;\n  title: string;\n  icon: string;\n  source: CollectionSource;\n}\n\nexport interface CollectionDetail extends CollectionSummary {\n  schema: CollectionSchema;\n}\n\nexport type CollectionItem = Record<string, unknown>;\n","// Tiny expression evaluator for the `derived` field type on\n// schema-driven collections (see plans/done/feat-mc-invoice.md).\n//\n// Grammar (recursive-descent, no precedence climbing — six\n// non-terminals total):\n//\n//   expr   := term (('+' | '-') term)*\n//   term   := factor (('*' | '/') factor)*\n//   factor := number | sumCall | refAccess | identifier | '(' expr ')'\n//   sumCall:= 'sum' '(' sumArg ')'\n//   sumArg := tableCol (('*' | '/') tableCol)*      // e.g. lineItems[].quantity * lineItems[].rate\n//   tableCol := identifier '[]' '.' identifier\n//   refAccess := identifier '.' identifier          // e.g. ticker.price — deref a ref field into its target record\n//\n// `identifier` accepts top-level field names (single segment).\n// Inside `sumArg`, identifiers are the `<table>[].col` form.\n// A two-segment `<field>.<col>` at factor level is a *ref deref*:\n// `<field>` must be a `ref`-typed field on this record (its stored\n// value is the target item's slug), and `<col>` is a numeric column\n// read from that target record. The caller resolves the target into\n// `ctx.refs` (it owns the schema + the loaded target collection);\n// the evaluator stays pure and never does I/O.\n//\n// What's deliberately NOT supported (and would parse-error rather\n// than silently misbehave):\n//   - String literals, boolean operators, comparisons, conditionals\n//   - Nested function calls beyond `sum(...)`\n//   - Anything in the record that isn't a number / table-of-objects\n//\n// All evaluation is pure — no eval(), no Function constructor.\n// Returns `null` on any failure (parse error, unbound identifier,\n// non-finite arithmetic). The caller renders `null` as em-dash in\n// the table cell + form display.\n\nexport interface FormulaContext {\n  /** The record being evaluated. For derived fields in the form,\n   *  this is the live draft (text + table both converted via the\n   *  same `draftToRecord` pipeline). For the main table cell,\n   *  this is the persisted item. */\n  record: Record<string, unknown>;\n  /** Resolved ref-target records for THIS row, keyed by the local\n   *  `ref` field name. The caller (which has the schema + the linked\n   *  collection's items loaded) maps each ref field's stored slug to\n   *  the full target record and passes it here, so a `<field>.<col>`\n   *  formula can read a numeric column off the referenced record\n   *  (e.g. `shares * ticker.price`). A missing key or `null` value\n   *  (unknown field / dangling slug) makes that deref evaluate to\n   *  NaN → the whole formula returns `null` → em-dash, consistent\n   *  with every other failure mode. Absent ⇒ no refs available. */\n  refs?: Record<string, Record<string, unknown> | null>;\n}\n\nexport function evaluateDerived(formula: string, ctx: FormulaContext): number | null {\n  let tokens: Token[];\n  try {\n    tokens = tokenize(formula);\n  } catch {\n    return null;\n  }\n  // eslint-disable-next-line @typescript-eslint/no-use-before-define -- Parser class is defined later in the file (grouped with its AST + evaluator); evaluateDerived runs after module init so the TDZ concern doesn't apply.\n  const parser = new Parser(tokens);\n  let ast: Node;\n  try {\n    ast = parser.parseExpr();\n    if (!parser.atEnd()) return null; // trailing junk\n  } catch {\n    return null;\n  }\n  const value = evaluate(ast, ctx);\n  return Number.isFinite(value) ? value : null;\n}\n\n// ─── Tokens ────────────────────────────────────────────────\n\ntype TokenKind = \"number\" | \"ident\" | \"(\" | \")\" | \"+\" | \"-\" | \"*\" | \"/\" | \"[]\" | \".\";\n\ninterface Token {\n  kind: TokenKind;\n  value?: string | number;\n}\n\nconst SINGLE_CHAR_PUNCT = new Set<TokenKind>([\"(\", \")\", \"+\", \"-\", \"*\", \"/\", \".\"]);\n\ninterface Cursor {\n  input: string;\n  index: number;\n}\n\nfunction consumeWhitespace(cur: Cursor): boolean {\n  const char = cur.input[cur.index];\n  if (char === \" \" || char === \"\\t\" || char === \"\\n\") {\n    cur.index++;\n    return true;\n  }\n  return false;\n}\n\nfunction consumeNumber(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  const next = cur.input[cur.index + 1] ?? \"\";\n  if (!isDigit(char) && !(char === \".\" && isDigit(next))) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length) {\n    const here = cur.input[cur.index] ?? \"\";\n    if (!isDigit(here) && here !== \".\") break;\n    raw += here;\n    cur.index++;\n  }\n  const num = Number(raw);\n  if (!Number.isFinite(num)) throw new Error(\"bad number\");\n  return { kind: \"number\", value: num };\n}\n\nfunction consumeIdent(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (!isIdentStart(char)) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length && isIdentChar(cur.input[cur.index] ?? \"\")) {\n    raw += cur.input[cur.index];\n    cur.index++;\n  }\n  return { kind: \"ident\", value: raw };\n}\n\nfunction consumePunct(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (char === \"[\" && cur.input[cur.index + 1] === \"]\") {\n    cur.index += 2;\n    return { kind: \"[]\" };\n  }\n  if (SINGLE_CHAR_PUNCT.has(char as TokenKind)) {\n    cur.index++;\n    return { kind: char as TokenKind };\n  }\n  return null;\n}\n\nfunction tokenize(input: string): Token[] {\n  const tokens: Token[] = [];\n  const cur: Cursor = { input, index: 0 };\n  while (cur.index < input.length) {\n    if (consumeWhitespace(cur)) continue;\n    // Number FIRST so a leading-dot literal (`.25`) isn't split by\n    // the `.` punctuation branch.\n    const numTok = consumeNumber(cur);\n    if (numTok) {\n      tokens.push(numTok);\n      continue;\n    }\n    const punctTok = consumePunct(cur);\n    if (punctTok) {\n      tokens.push(punctTok);\n      continue;\n    }\n    const identTok = consumeIdent(cur);\n    if (identTok) {\n      tokens.push(identTok);\n      continue;\n    }\n    throw new Error(`unexpected char ${input[cur.index]}`);\n  }\n  return tokens;\n}\n\nfunction isDigit(char: string): boolean {\n  return char >= \"0\" && char <= \"9\";\n}\nfunction isIdentStart(char: string): boolean {\n  return (char >= \"a\" && char <= \"z\") || (char >= \"A\" && char <= \"Z\") || char === \"_\";\n}\nfunction isIdentChar(char: string): boolean {\n  return isIdentStart(char) || isDigit(char);\n}\n\n// ─── AST + Parser ───────────────────────────────────────────\n\ntype Node =\n  | { kind: \"num\"; value: number }\n  | { kind: \"ident\"; name: string }\n  | { kind: \"ref\"; field: string; col: string }\n  | { kind: \"binop\"; operator: \"+\" | \"-\" | \"*\" | \"/\"; left: Node; right: Node }\n  | { kind: \"sum\"; arg: SumArg };\n\ninterface SumArg {\n  // factors multiplied/divided together; each is a (tableName, colName) ref into a row.\n  factors: { table: string; col: string }[];\n  /** Operators between factors: length = factors.length - 1; each\n   *  is \"*\" or \"/\". For a single-factor sum (`sum(lineItems[].amount)`)\n   *  this is empty. */\n  operators: (\"*\" | \"/\")[];\n}\n\nclass Parser {\n  private cursor = 0;\n  constructor(private readonly tokens: Token[]) {}\n\n  atEnd(): boolean {\n    return this.cursor >= this.tokens.length;\n  }\n  private peek(): Token | undefined {\n    return this.tokens[this.cursor];\n  }\n  private consume(): Token {\n    const tok = this.tokens[this.cursor++];\n    if (!tok) throw new Error(\"unexpected end of input\");\n    return tok;\n  }\n  private expect(kind: TokenKind): Token {\n    const tok = this.consume();\n    if (tok.kind !== kind) throw new Error(`expected ${kind}, got ${tok.kind}`);\n    return tok;\n  }\n\n  parseExpr(): Node {\n    let left = this.parseTerm();\n    while (this.peek()?.kind === \"+\" || this.peek()?.kind === \"-\") {\n      const operator = this.consume().kind as \"+\" | \"-\";\n      const right = this.parseTerm();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseTerm(): Node {\n    let left = this.parseFactor();\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      const right = this.parseFactor();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseFactor(): Node {\n    const tok = this.peek();\n    if (!tok) throw new Error(\"unexpected end in factor\");\n    if (tok.kind === \"number\") {\n      this.consume();\n      return { kind: \"num\", value: tok.value as number };\n    }\n    if (tok.kind === \"(\") {\n      this.consume();\n      const inner = this.parseExpr();\n      this.expect(\")\");\n      return inner;\n    }\n    if (tok.kind === \"ident\") {\n      const name = (tok.value as string) ?? \"\";\n      // sum(...) — only function call we support\n      if (name === \"sum\" && this.tokens[this.cursor + 1]?.kind === \"(\") {\n        this.consume(); // ident\n        this.expect(\"(\");\n        const arg = this.parseSumArg();\n        this.expect(\")\");\n        return { kind: \"sum\", arg };\n      }\n      this.consume(); // ident\n      // ref deref: `<field>.<col>` (e.g. ticker.price). The table-row\n      // form `<table>[].col` only appears inside sum(), so a `.`\n      // immediately after a top-level ident is unambiguously a ref\n      // dereference here.\n      if (this.peek()?.kind === \".\") {\n        this.consume(); // '.'\n        const col = this.expect(\"ident\");\n        return { kind: \"ref\", field: name, col: col.value as string };\n      }\n      return { kind: \"ident\", name };\n    }\n    throw new Error(`unexpected token ${tok.kind} in factor`);\n  }\n\n  private parseSumArg(): SumArg {\n    const factors: { table: string; col: string }[] = [];\n    const operators: (\"*\" | \"/\")[] = [];\n    factors.push(this.parseTableCol());\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      operators.push(operator);\n      factors.push(this.parseTableCol());\n    }\n    return { factors, operators };\n  }\n\n  private parseTableCol(): { table: string; col: string } {\n    const tableTok = this.expect(\"ident\");\n    this.expect(\"[]\");\n    this.expect(\".\");\n    const colTok = this.expect(\"ident\");\n    return { table: tableTok.value as string, col: colTok.value as string };\n  }\n}\n\n// ─── Evaluator ──────────────────────────────────────────────\n\nfunction evaluate(node: Node, ctx: FormulaContext): number {\n  if (node.kind === \"num\") return node.value;\n  if (node.kind === \"ident\") {\n    const raw = ctx.record[node.name];\n    return toFiniteNumber(raw);\n  }\n  if (node.kind === \"ref\") {\n    // `<field>.<col>`: read `col` off the resolved target record the\n    // caller put in ctx.refs. Unknown field / dangling slug → null →\n    // NaN, so the whole formula fails soft to an em-dash.\n    const target = ctx.refs?.[node.field] ?? null;\n    if (!target) return Number.NaN;\n    return toFiniteNumber(target[node.col]);\n  }\n  if (node.kind === \"binop\") {\n    const left = evaluate(node.left, ctx);\n    const right = evaluate(node.right, ctx);\n    return applyBinop(node.operator, left, right);\n  }\n  if (node.kind === \"sum\") {\n    return evaluateSum(node.arg, ctx);\n  }\n  // Exhaustive — TS narrows above branches but throw keeps runtime honest.\n  throw new Error(`unknown node`);\n}\n\nfunction applyBinop(operator: \"+\" | \"-\" | \"*\" | \"/\", left: number, right: number): number {\n  if (!Number.isFinite(left) || !Number.isFinite(right)) return Number.NaN;\n  if (operator === \"+\") return left + right;\n  if (operator === \"-\") return left - right;\n  if (operator === \"*\") return left * right;\n  // operator === \"/\"\n  if (right === 0) return Number.NaN;\n  return left / right;\n}\n\nfunction evaluateSum(arg: SumArg, ctx: FormulaContext): number {\n  if (arg.factors.length === 0) return 0;\n  const tableName = arg.factors[0].table;\n  // All factors must reference the SAME table (you can't multiply\n  // a row from lineItems against a row from another table — the\n  // semantics would be ambiguous). Reject mismatch.\n  for (const factor of arg.factors) {\n    if (factor.table !== tableName) return Number.NaN;\n  }\n  const rows = ctx.record[tableName];\n  if (!Array.isArray(rows)) return 0;\n  let total = 0;\n  for (const row of rows) {\n    if (!row || typeof row !== \"object\") continue;\n    let product = toFiniteNumber((row as Record<string, unknown>)[arg.factors[0].col]);\n    if (!Number.isFinite(product)) return Number.NaN;\n    for (let i = 1; i < arg.factors.length; i++) {\n      const value = toFiniteNumber((row as Record<string, unknown>)[arg.factors[i].col]);\n      if (!Number.isFinite(value)) return Number.NaN;\n      product = applyBinop(arg.operators[i - 1], product, value);\n    }\n    total += product;\n  }\n  return total;\n}\n\nfunction toFiniteNumber(value: unknown): number {\n  if (typeof value === \"number\") return Number.isFinite(value) ? value : Number.NaN;\n  if (typeof value === \"string\" && value.length > 0) {\n    const num = Number(value);\n    return Number.isFinite(num) ? num : Number.NaN;\n  }\n  return Number.NaN;\n}\n","// The derived-field saturation loop for schema-driven collections,\n// extracted from `composables/collections/useCollectionRendering.ts` so\n// the server (manageCollection getItems enrichment) and the client\n// (table cells, form display) evaluate formulas through ONE\n// implementation — if the two ever diverged, the UI and the LLM would\n// disagree on a number. Pure module: no Vue, no I/O.\n//\n// Like `actionVisible.ts`, the input types are minimal structural\n// shapes so both the client `FieldSpec`/`CollectionSchema`\n// (src/components/collectionTypes.ts) and the server\n// `CollectionFieldSpec`/`CollectionSchema`\n// (server/workspace/collections/types.ts) satisfy them as-is.\n\nimport { evaluateDerived, type FormulaContext } from \"./derivedFormula\";\n\n/** Minimal field shape the derive loop needs — accepts both the client\n *  FieldSpec and the server CollectionFieldSpec. */\nexport interface DerivableFieldSpec {\n  type: string;\n  /** When type === \"ref\": slug of the target collection. */\n  to?: string;\n  /** When type === \"derived\": formula evaluated against the record. */\n  formula?: string;\n}\n\n/** Minimal schema shape: just the ordered field map. */\nexport interface DerivableSchema {\n  fields: Record<string, DerivableFieldSpec>;\n}\n\nexport type DerivableRecord = Record<string, unknown>;\n\n/** Per-target-collection cache of loaded referenced records:\n *  target collection slug → item slug → full record. Mirrors the\n *  client's `RefRecordCache` / the server's enrichment loader. */\nexport type DeriveRefRecords = Record<string, Record<string, DerivableRecord>>;\n\n/** Map each `ref` field's stored slug to its loaded target record (or\n *  null when dangling / not loaded), keyed by the LOCAL field name —\n *  the shape `evaluateDerived` reads for `<field>.<col>` derefs. */\nexport function resolveRowRefs(schema: DerivableSchema, record: DerivableRecord, refRecords: DeriveRefRecords): NonNullable<FormulaContext[\"refs\"]> {\n  const refs: NonNullable<FormulaContext[\"refs\"]> = {};\n  for (const [key, field] of Object.entries(schema.fields)) {\n    if (field.type !== \"ref\" || !field.to) continue;\n    const slug = record[key];\n    refs[key] = typeof slug === \"string\" ? (refRecords[field.to]?.[slug] ?? null) : null;\n  }\n  return refs;\n}\n\n/** Evaluate every `derived` field against `base`, saturating so a\n *  derived field can read another derived field computed in an earlier\n *  pass (`subtotal → tax → total` converges in ≤ field-count passes).\n *  Cycles can't loop forever — passes are bounded by the number of\n *  derived fields and the loop breaks as soon as a pass changes\n *  nothing. Failed formulas stay ABSENT (the UI renders them as\n *  em-dash). Returns a copy; `base` is never mutated.\n *\n *  Derived keys already present in `base` are stripped before\n *  evaluation: computed output is host-truth, never persisted-input\n *  fallback. A record JSON can carry a stale (or forged) derived value\n *  — raw Write/Edit, legacy data — and without the strip, a failing\n *  formula would silently surface that value as if the host computed\n *  it. */\nexport function deriveAll(schema: DerivableSchema, base: DerivableRecord, refRecords: DeriveRefRecords): DerivableRecord {\n  const derivedKeys = new Set(Object.keys(schema.fields).filter((key) => schema.fields[key]?.type === \"derived\"));\n  const enriched: DerivableRecord = Object.fromEntries(Object.entries(base).filter(([key]) => !derivedKeys.has(key)));\n  const refs = resolveRowRefs(schema, base, refRecords);\n  const maxPasses = Object.values(schema.fields).filter((field) => field.type === \"derived\").length;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let mutated = false;\n    for (const [key, field] of Object.entries(schema.fields)) {\n      if (field.type !== \"derived\" || !field.formula) continue;\n      const next = evaluateDerived(field.formula, { record: enriched, refs });\n      if (next !== null && enriched[key] !== next) {\n        enriched[key] = next;\n        mutated = true;\n      }\n    }\n    if (!mutated) break;\n  }\n  return enriched;\n}\n"],"mappings":";;;;;AA6CA,IAAa,eAAe;CAAC;CAAO;CAAQ;AAAW;;;;;;;;AAUvD,IAAa,oBAAoB;;AAIjC,IAAa,iBAAiB;CAAC;CAAU;CAAS;CAAU;AAAW;;AAqFvE,SAAgB,mBAAmB,OAAkE;CACnG,OAAO,eAAe;AACxB;;;AC9FA,SAAgB,gBAAgB,SAAiB,KAAoC;CACnF,IAAI;CACJ,IAAI;EACF,SAAS,SAAS,OAAO;CAC3B,QAAQ;EACN,OAAO;CACT;CAEA,MAAM,SAAS,IAAI,OAAO,MAAM;CAChC,IAAI;CACJ,IAAI;EACF,MAAM,OAAO,UAAU;EACvB,IAAI,CAAC,OAAO,MAAM,GAAG,OAAO;CAC9B,QAAQ;EACN,OAAO;CACT;CACA,MAAM,QAAQ,SAAS,KAAK,GAAG;CAC/B,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAC1C;AAWA,IAAM,oCAAoB,IAAI,IAAe;CAAC;CAAK;CAAK;CAAK;CAAK;CAAK;CAAK;AAAG,CAAC;AAOhF,SAAS,kBAAkB,KAAsB;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,IAAI,SAAS,OAAO,SAAS,OAAQ,SAAS,MAAM;EAClD,IAAI;EACJ,OAAO;CACT;CACA,OAAO;AACT;AAEA,SAAS,cAAc,KAA2B;CAChD,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,MAAM,OAAO,IAAI,MAAM,IAAI,QAAQ,MAAM;CACzC,IAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,SAAS,OAAO,QAAQ,IAAI,IAAI,OAAO;CAC/D,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,QAAQ;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;EACrC,IAAI,CAAC,QAAQ,IAAI,KAAK,SAAS,KAAK;EACpC,OAAO;EACP,IAAI;CACN;CACA,MAAM,MAAM,OAAO,GAAG;CACtB,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,MAAM,IAAI,MAAM,YAAY;CACvD,OAAO;EAAE,MAAM;EAAU,OAAO;CAAI;AACtC;AAEA,SAAS,aAAa,KAA2B;CAE/C,IAAI,CAAC,aADQ,IAAI,MAAM,IAAI,UAAU,EACf,GAAG,OAAO;CAChC,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,UAAU,YAAY,IAAI,MAAM,IAAI,UAAU,EAAE,GAAG;EAC9E,OAAO,IAAI,MAAM,IAAI;EACrB,IAAI;CACN;CACA,OAAO;EAAE,MAAM;EAAS,OAAO;CAAI;AACrC;AAEA,SAAS,aAAa,KAA2B;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI,QAAQ,OAAO,KAAK;EACpD,IAAI,SAAS;EACb,OAAO,EAAE,MAAM,KAAK;CACtB;CACA,IAAI,kBAAkB,IAAI,IAAiB,GAAG;EAC5C,IAAI;EACJ,OAAO,EAAE,MAAM,KAAkB;CACnC;CACA,OAAO;AACT;AAEA,SAAS,SAAS,OAAwB;CACxC,MAAM,SAAkB,CAAC;CACzB,MAAM,MAAc;EAAE;EAAO,OAAO;CAAE;CACtC,OAAO,IAAI,QAAQ,MAAM,QAAQ;EAC/B,IAAI,kBAAkB,GAAG,GAAG;EAG5B,MAAM,SAAS,cAAc,GAAG;EAChC,IAAI,QAAQ;GACV,OAAO,KAAK,MAAM;GAClB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,IAAI,MAAM,mBAAmB,MAAM,IAAI,QAAQ;CACvD;CACA,OAAO;AACT;AAEA,SAAS,QAAQ,MAAuB;CACtC,OAAO,QAAQ,OAAO,QAAQ;AAChC;AACA,SAAS,aAAa,MAAuB;CAC3C,OAAQ,QAAQ,OAAO,QAAQ,OAAS,QAAQ,OAAO,QAAQ,OAAQ,SAAS;AAClF;AACA,SAAS,YAAY,MAAuB;CAC1C,OAAO,aAAa,IAAI,KAAK,QAAQ,IAAI;AAC3C;AAoBA,IAAM,SAAN,MAAa;CAEkB;CAD7B,SAAiB;CACjB,YAAY,QAAkC;EAAjB,KAAA,SAAA;CAAkB;CAE/C,QAAiB;EACf,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;CACA,OAAkC;EAChC,OAAO,KAAK,OAAO,KAAK;CAC1B;CACA,UAAyB;EACvB,MAAM,MAAM,KAAK,OAAO,KAAK;EAC7B,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,yBAAyB;EACnD,OAAO;CACT;CACA,OAAe,MAAwB;EACrC,MAAM,MAAM,KAAK,QAAQ;EACzB,IAAI,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM,YAAY,KAAK,QAAQ,IAAI,MAAM;EAC1E,OAAO;CACT;CAEA,YAAkB;EAChB,IAAI,OAAO,KAAK,UAAU;EAC1B,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,MAAM,QAAQ,KAAK,UAAU;GAC7B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,YAA0B;EACxB,IAAI,OAAO,KAAK,YAAY;EAC5B,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,MAAM,QAAQ,KAAK,YAAY;GAC/B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,cAA4B;EAC1B,MAAM,MAAM,KAAK,KAAK;EACtB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,0BAA0B;EACpD,IAAI,IAAI,SAAS,UAAU;GACzB,KAAK,QAAQ;GACb,OAAO;IAAE,MAAM;IAAO,OAAO,IAAI;GAAgB;EACnD;EACA,IAAI,IAAI,SAAS,KAAK;GACpB,KAAK,QAAQ;GACb,MAAM,QAAQ,KAAK,UAAU;GAC7B,KAAK,OAAO,GAAG;GACf,OAAO;EACT;EACA,IAAI,IAAI,SAAS,SAAS;GACxB,MAAM,OAAQ,IAAI,SAAoB;GAEtC,IAAI,SAAS,SAAS,KAAK,OAAO,KAAK,SAAS,EAAE,EAAE,SAAS,KAAK;IAChE,KAAK,QAAQ;IACb,KAAK,OAAO,GAAG;IACf,MAAM,MAAM,KAAK,YAAY;IAC7B,KAAK,OAAO,GAAG;IACf,OAAO;KAAE,MAAM;KAAO;IAAI;GAC5B;GACA,KAAK,QAAQ;GAKb,IAAI,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;IAC7B,KAAK,QAAQ;IAEb,OAAO;KAAE,MAAM;KAAO,OAAO;KAAM,KADvB,KAAK,OAAO,OACgB,CAAA,CAAI;IAAgB;GAC9D;GACA,OAAO;IAAE,MAAM;IAAS;GAAK;EAC/B;EACA,MAAM,IAAI,MAAM,oBAAoB,IAAI,KAAK,WAAW;CAC1D;CAEA,cAA8B;EAC5B,MAAM,UAA4C,CAAC;EACnD,MAAM,YAA2B,CAAC;EAClC,QAAQ,KAAK,KAAK,cAAc,CAAC;EACjC,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,UAAU,KAAK,QAAQ;GACvB,QAAQ,KAAK,KAAK,cAAc,CAAC;EACnC;EACA,OAAO;GAAE;GAAS;EAAU;CAC9B;CAEA,gBAAwD;EACtD,MAAM,WAAW,KAAK,OAAO,OAAO;EACpC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,GAAG;EACf,MAAM,SAAS,KAAK,OAAO,OAAO;EAClC,OAAO;GAAE,OAAO,SAAS;GAAiB,KAAK,OAAO;EAAgB;CACxE;AACF;AAIA,SAAS,SAAS,MAAY,KAA6B;CACzD,IAAI,KAAK,SAAS,OAAO,OAAO,KAAK;CACrC,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,MAAM,IAAI,OAAO,KAAK;EAC5B,OAAO,eAAe,GAAG;CAC3B;CACA,IAAI,KAAK,SAAS,OAAO;EAIvB,MAAM,SAAS,IAAI,OAAO,KAAK,UAAU;EACzC,IAAI,CAAC,QAAQ,OAAO;EACpB,OAAO,eAAe,OAAO,KAAK,IAAI;CACxC;CACA,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,OAAO,SAAS,KAAK,MAAM,GAAG;EACpC,MAAM,QAAQ,SAAS,KAAK,OAAO,GAAG;EACtC,OAAO,WAAW,KAAK,UAAU,MAAM,KAAK;CAC9C;CACA,IAAI,KAAK,SAAS,OAChB,OAAO,YAAY,KAAK,KAAK,GAAG;CAGlC,MAAM,IAAI,MAAM,cAAc;AAChC;AAEA,SAAS,WAAW,UAAiC,MAAc,OAAuB;CACxF,IAAI,CAAC,OAAO,SAAS,IAAI,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CAC9D,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CAEpC,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,OAAO;AAChB;AAEA,SAAS,YAAY,KAAa,KAA6B;CAC7D,IAAI,IAAI,QAAQ,WAAW,GAAG,OAAO;CACrC,MAAM,YAAY,IAAI,QAAQ,EAAE,CAAC;CAIjC,KAAK,MAAM,UAAU,IAAI,SACvB,IAAI,OAAO,UAAU,WAAW,OAAO;CAEzC,MAAM,OAAO,IAAI,OAAO;CACxB,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,OAAO;CACjC,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;EACrC,IAAI,UAAU,eAAgB,IAAgC,IAAI,QAAQ,EAAE,CAAC,IAAI;EACjF,IAAI,CAAC,OAAO,SAAS,OAAO,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,QAAQ,KAAK;GAC3C,MAAM,QAAQ,eAAgB,IAAgC,IAAI,QAAQ,EAAE,CAAC,IAAI;GACjF,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;GACpC,UAAU,WAAW,IAAI,UAAU,IAAI,IAAI,SAAS,KAAK;EAC3D;EACA,SAAS;CACX;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAAwB;CAC9C,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;CACvE,IAAI,OAAO,UAAU,YAAY,MAAM,SAAS,GAAG;EACjD,MAAM,MAAM,OAAO,KAAK;EACxB,OAAO,OAAO,SAAS,GAAG,IAAI,MAAM;CACtC;CACA,OAAO;AACT;;;;;;ACnUA,SAAgB,eAAe,QAAyB,QAAyB,YAAmE;CAClJ,MAAM,OAA4C,CAAC;CACnD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;EACxD,IAAI,MAAM,SAAS,SAAS,CAAC,MAAM,IAAI;EACvC,MAAM,OAAO,OAAO;EACpB,KAAK,OAAO,OAAO,SAAS,WAAY,WAAW,MAAM,GAAG,GAAG,SAAS,OAAQ;CAClF;CACA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,UAAU,QAAyB,MAAuB,YAA+C;CACvH,MAAM,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,OAAO,IAAI,EAAE,SAAS,SAAS,CAAC;CAC9G,MAAM,WAA4B,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC;CAClH,MAAM,OAAO,eAAe,QAAQ,MAAM,UAAU;CACpD,MAAM,YAAY,OAAO,OAAO,OAAO,MAAM,CAAC,CAAC,QAAQ,UAAU,MAAM,SAAS,SAAS,CAAC,CAAC;CAC3F,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;GACxD,IAAI,MAAM,SAAS,aAAa,CAAC,MAAM,SAAS;GAChD,MAAM,OAAO,gBAAgB,MAAM,SAAS;IAAE,QAAQ;IAAU;GAAK,CAAC;GACtE,IAAI,SAAS,QAAQ,SAAS,SAAS,MAAM;IAC3C,SAAS,OAAO;IAChB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CACA,OAAO;AACT"}

package/dist/{deriveAll-C6BYnpBL.js → deriveAll-vzIhhKBK.js}

@@ -1,13 +1,21 @@
 //#region src/collection/core/schema.ts
-/** Retriever kinds a Feed's `ingest.kind` may declare. The host's feeds engine
-*  dispatches on these; they live here (with the schema contract) so the schema
-*  validator can enforce them. The host re-exports these from
+/** Declarative retriever kinds a Feed's `ingest.kind` may declare. The host's
+*  feeds engine dispatches on these; they live here (with the schema contract)
+*  so the schema validator can enforce them. The host re-exports these from
 *  `server/workspace/feeds/ingestTypes.ts`. */
 var INGEST_KINDS = [
 	"rss",
 	"atom",
 	"http-json"
 ];
+/** The agent-performed ingest kind. Instead of a declarative fetch, the host
+*  dispatches a hidden background chat (origin `system`) in `ingest.role`,
+*  seeded with `ingest.template` + a summary of every record, on the
+*  `ingest.schedule` cadence; the worker edits records via the collections io
+*  layer. Kept separate from {@link INGEST_KINDS} (which the declarative
+*  retriever registry keys on) so the schema validator can model `ingest` as a
+*  discriminated union without the feeds engine gaining an "agent" retriever. */
+var AGENT_INGEST_KIND = "agent";
 /** Refresh cadences a Feed's `ingest.schedule` may declare. */
 var FEED_SCHEDULES = [
 	"hourly",
@@ -39,7 +47,7 @@ function evaluateDerived(formula, ctx) {
 	const value = evaluate(ast, ctx);
 	return Number.isFinite(value) ? value : null;
 }
-var SINGLE_CHAR_PUNCT = new Set([
+var SINGLE_CHAR_PUNCT = /* @__PURE__ */ new Set([
 	"(",
 	")",
 	"+",
@@ -359,6 +367,6 @@ function deriveAll(schema, base, refRecords) {
 	return enriched;
 }
 //#endregion
-export { INGEST_KINDS as a, FEED_SCHEDULES as i, resolveRowRefs as n, isFieldDrivenEvery as o, evaluateDerived as r, deriveAll as t };
+export { FEED_SCHEDULES as a, AGENT_INGEST_KIND as i, resolveRowRefs as n, INGEST_KINDS as o, evaluateDerived as r, isFieldDrivenEvery as s, deriveAll as t };
 
-//# sourceMappingURL=deriveAll-C6BYnpBL.js.map
+//# sourceMappingURL=deriveAll-vzIhhKBK.js.map

package/dist/deriveAll-vzIhhKBK.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deriveAll-vzIhhKBK.js","names":[],"sources":["../src/collection/core/schema.ts","../src/collection/core/derivedFormula.ts","../src/collection/core/deriveAll.ts"],"sourcesContent":["// Schema-driven collection types. A \"collection\" is a skill (under\n// .claude/skills/<slug>/) that also ships a sibling `schema.json`.\n// The host's <CollectionView> reads the schema + records and renders\n// a table/form; Claude reads SKILL.md and CRUDs the records as JSON\n// files.\n//\n// Field types for v0 — keep this list narrow and grow it only when a\n// real collection needs the new type. v0 supports flat records only;\n// nested tables / cross-collection refs / derived fields / actions are\n// deferred to follow-ups (see plans/done/feat-skill-driven-apps.md and\n// plans/done/feat-skill-driven-apps-worklog.md — historical names predate\n// the rename).\n\n/** Minimal \"this collection is a feed\" descriptor carried on the schema.\n *  Deliberately narrow — the canonical collection contract stays\n *  independent of the host's feeds subsystem. The host's richer retrieval\n *  spec (`IngestSpec` in `server/workspace/feeds/ingestTypes.ts`)\n *  `extends CollectionIngest`, so feed code reads the extra fields by\n *  typing feed schemas with that subtype; collection rendering only needs\n *  these three + the presence check. */\nexport interface CollectionIngest {\n  kind: string;\n  schedule: string;\n  /** Optional time-of-day anchor for `schedule: \"daily\"` — the hour (0–23) to\n   *  refresh around (the host ticks hourly, so the run lands within that hour).\n   *  Ignored for non-daily schedules. Absent ⇒ elapsed-based daily (\"≥24 h since\n   *  the last run\"). NOTE: **UTC**, not local — compared via `getUTCHours()` for\n   *  an unambiguous, DST-free check (matching the rest of the scheduler), so\n   *  convert local times before writing (e.g. 07:00 JST → `atHour: 22`). */\n  atHour?: number;\n  /** Declarative retrievers (`rss`/`atom`/`http-json`) only — the host fetches\n   *  this URL on the schedule. Absent for `kind: \"agent\"`, where the agent owns\n   *  retrieval. */\n  url?: string;\n  /** `kind: \"agent\"` only: role id the scheduled hidden worker runs in. */\n  role?: string;\n  /** `kind: \"agent\"` only: skill-relative template path (under `templates/`)\n   *  whose prose tells the worker how to refresh the records. */\n  template?: string;\n}\n\n/** Declarative retriever kinds a Feed's `ingest.kind` may declare. The host's\n *  feeds engine dispatches on these; they live here (with the schema contract)\n *  so the schema validator can enforce them. The host re-exports these from\n *  `server/workspace/feeds/ingestTypes.ts`. */\nexport const INGEST_KINDS = [\"rss\", \"atom\", \"http-json\"] as const;\nexport type IngestKind = (typeof INGEST_KINDS)[number];\n\n/** The agent-performed ingest kind. Instead of a declarative fetch, the host\n *  dispatches a hidden background chat (origin `system`) in `ingest.role`,\n *  seeded with `ingest.template` + a summary of every record, on the\n *  `ingest.schedule` cadence; the worker edits records via the collections io\n *  layer. Kept separate from {@link INGEST_KINDS} (which the declarative\n *  retriever registry keys on) so the schema validator can model `ingest` as a\n *  discriminated union without the feeds engine gaining an \"agent\" retriever. */\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\n/** Refresh cadences a Feed's `ingest.schedule` may declare. */\nexport const FEED_SCHEDULES = [\"hourly\", \"daily\", \"weekly\", \"on-demand\"] as const;\nexport type FeedSchedule = (typeof FEED_SCHEDULES)[number];\n\nexport type CollectionFieldType =\n  | \"string\"\n  | \"text\"\n  | \"email\"\n  | \"number\"\n  | \"date\"\n  | \"datetime\"\n  | \"boolean\"\n  | \"markdown\"\n  | \"ref\"\n  | \"money\"\n  | \"enum\"\n  | \"table\"\n  | \"derived\"\n  | \"embed\"\n  // Holds a workspace-relative image path (e.g. a `data/attachments/...`\n  // upload); rendered as an <img> in the detail view (not the list table —\n  // a per-row fetch is too expensive at scale). Stored and edited as a\n  // plain string.\n  | \"image\"\n  // Holds a workspace-relative file path as a plain string (e.g. an\n  // `artifacts/html/<name>.html` app). Rendered as a clickable link in\n  // both the list table and the detail view: HTML / SVG artifacts open\n  // their rendered form in a new tab; any other path opens in the File\n  // Explorer. Stored and edited as a plain string, like `image`.\n  | \"file\"\n  // A checkbox that is a pure PROJECTION of an `enum` field — it stores\n  // nothing of its own. Checked when the enum equals `onValue`; toggling\n  // writes `onValue` / `offValue` back to that enum field. Lets a \"done\"\n  // checkbox front a kanban `status` field with the enum as the single\n  // source of truth (no separate stored boolean to keep in sync).\n  | \"toggle\";\n\n// \"feed\" collections live in the non-skill `<workspace>/feeds/` registry\n// and carry an `ingest` block; they reuse the same storage + rendering\n// as skill-backed collections but are never loaded into the agent prompt.\nexport type CollectionSource = \"user\" | \"project\" | \"feed\";\n\n/** Recurrence unit for a `spawn.every` advance. */\nexport type CollectionRecurUnit = \"day\" | \"week\" | \"month\" | \"year\";\n\n/** How a `spawn` advances the source item's `triggerField` date to\n *  produce the successor's. All arithmetic is done on the civil\n *  (year, month, day) triple — never by adding milliseconds — so month\n *  lengths and leap years are handled correctly. */\nexport interface CollectionEvery {\n  unit: CollectionRecurUnit;\n  /** Number of `unit`s to advance (≥ 1). `interval: 3` + `unit: \"month\"`\n   *  = quarterly; `interval: 1` + `unit: \"year\"` = annual. */\n  interval: number;\n  /** Day-of-month anchor for `month`/`year` units. The CANONICAL day —\n   *  read from the rule, never re-derived from the prior concrete date,\n   *  so \"31st of every month\" yields 31 → 28/29 → 31 → 30 … with no\n   *  drift (it is clamped per-month at compute time, not stored\n   *  clamped). `\"last\"` always means the last day of the target month.\n   *  Omitted ⇒ preserve the source date's day (safe for days ≤ 28).\n   *  Ignored for `day`/`week` units. */\n  dayOfMonth?: number | \"last\";\n}\n\n/** Field-driven recurrence: the advance interval is selected PER RECORD by\n *  the value of an `enum` field (`fromField`), looked up in `map`. Lets one\n *  collection mix daily / weekly / monthly obligations in a single list — the\n *  host reads `record[fromField]`, finds the matching `CollectionEvery`, and\n *  advances by it. `fromField` must point at a top-level `enum` field whose\n *  `values` the `map` keys exactly cover (validated at discovery), and must\n *  itself be carried/`set` onto the successor so the chain keeps recurring. */\nexport interface CollectionEveryFieldDriven {\n  /** Top-level `enum` field whose value selects the interval. */\n  fromField: string;\n  /** Interval per enum value. Keys exactly cover `fromField`'s `values`;\n   *  each value is a literal {@link CollectionEvery}. */\n  map: Record<string, CollectionEvery>;\n}\n\n/** The `every` of a `spawn`: either a single literal interval applied to\n *  every record, or a per-record interval selected by an `enum` field. The\n *  literal arm is what `advanceTriggerDate` consumes — the field-driven arm\n *  is resolved down to one of its `map` values before the date math runs. */\nexport type CollectionSpawnEvery = CollectionEvery | CollectionEveryFieldDriven;\n\n/** Narrowing guard: true when `every` is the field-driven arm. */\nexport function isFieldDrivenEvery(every: CollectionSpawnEvery): every is CollectionEveryFieldDriven {\n  return \"fromField\" in every;\n}\n\n/** Host-driven recurrence: when a record satisfies `when`, the host\n *  creates the next record with a forward-advanced `triggerField` date.\n *  The successor's id and contents are a pure function of (source\n *  record, this rule); creation is create-if-absent, so the mechanism\n *  stays convergent — observing the predicate N times writes one\n *  successor. Requires the schema to declare `triggerField`. */\nexport interface CollectionSpawn {\n  /** Predicate that fires the spawn (a `CollectionWhen`). Defaults to\n   *  \"`completionField` value ∈ `completionDoneValues`\" (i.e. spawn the\n   *  next instance when this one is done). */\n  when?: CollectionWhen;\n  /** How to advance `triggerField` from the source to the successor —\n   *  either a single literal interval or a per-record, field-driven map. */\n  every: CollectionSpawnEvery;\n  /** Record fields copied verbatim onto the successor. Fields not listed\n   *  here, not in `set`, and not the trigger / primary keys start\n   *  blank. */\n  carry?: string[];\n  /** Fields forced to fixed values on the successor (typically resetting\n   *  the status field to its pending value). */\n  set?: Record<string, unknown>;\n}\n\n/** The kind of work an action kicks off. v1 ships only `\"chat\"` —\n *  start a new chat in a role with a templated seed prompt. The enum\n *  reserves room for a future `\"mutate\"` (status transitions) without\n *  another schema-shape change. */\nexport type CollectionActionKind = \"chat\";\n\n/** Optional visibility predicate: the target (an action button or a\n *  field) renders only when the open record's `field` (stringified) is\n *  one of `in`. Generic and domain-free — the host evaluates it against\n *  the record with no knowledge of what the field means. Absent ⇒\n *  always shown. */\nexport interface CollectionWhen {\n  /** Top-level record field key whose value gates visibility. */\n  field: string;\n  /** Allowed values; the target shows when `String(record[field])` is\n   *  one of these. Non-empty. */\n  in: string[];\n}\n\n/** @deprecated Name retained for back-compat; use {@link CollectionWhen}.\n *  Both actions and fields share the same predicate shape. */\nexport type CollectionActionWhen = CollectionWhen;\n\n/** What a custom view's capability token is allowed to do against the\n *  collection's data endpoint. `read` returns enriched records (getItems\n *  semantics); `write` validates-and-stores rows (putItems semantics).\n *  There is deliberately no `delete` — a view can never do more than the\n *  agent's own `manageCollection` tool. */\nexport type CollectionViewCapability = \"read\" | \"write\";\n\n/** A custom (LLM-authored) HTML view for a collection. The host renders\n *  `file` in a sandboxed iframe over the collection's records; the view\n *  reaches its data only through a slug- and capability-scoped token (see\n *  `server/api/auth/viewToken.ts`). Pure data — the host holds no\n *  view-specific code; meaning lives in the HTML file + this registration. */\nexport interface CollectionCustomView {\n  /** Stable id; the view-mode selector key (`custom:<id>`) and the\n   *  capability-token clamp key. Must be a valid slug. */\n  id: string;\n  /** Button label in the view-mode selector (author-authored, like field\n   *  labels — not run through i18n). */\n  label: string;\n  /** Optional Material-icon name for the selector button. */\n  icon?: string;\n  /** Skill-relative path to the HTML file under `views/` (e.g.\n   *  `views/year.html`). Path-safe, must end in `.html`. */\n  file: string;\n  /** What the view may do with the data endpoint. Defaults to `[\"read\"]`\n   *  (least privilege); declare `[\"read\",\"write\"]` only for views that\n   *  edit records. The mint endpoint clamps any requested caps to this. */\n  capabilities?: CollectionViewCapability[];\n}\n\n/** A schema-declared, per-record action rendered as a button in the\n *  read-only detail view. Pure UI/behaviour directive — never stored,\n *  never validated against record data. All domain specifics (label,\n *  role, template) live here in the schema / skill folder, so the host\n *  stays generic. */\nexport interface CollectionAction {\n  /** Stable id (used in the dispatch route + testids). */\n  id: string;\n  /** Button text (English, like field labels). */\n  label: string;\n  /** Material-icon name shown on the button. */\n  icon?: string;\n  /** What the action does. v1: `\"chat\"`. */\n  kind: CollectionActionKind;\n  /** `kind: \"chat\"`: the role id the new chat runs in. */\n  role: string;\n  /** `kind: \"chat\"`: skill-relative path to the template file whose\n   *  text becomes the seed prompt body (e.g. `templates/invoice.md`). */\n  template: string;\n  /** Optional visibility predicate; the button renders only when the\n   *  open record matches (see CollectionWhen). Absent ⇒ always\n   *  shown. */\n  when?: CollectionWhen;\n}\n\nexport interface CollectionFieldSpec {\n  type: CollectionFieldType;\n  label: string;\n  /** True for the field whose value is the record's filename (no\n   *  separate auto-id). Exactly one field per schema may set this. */\n  primary?: boolean;\n  required?: boolean;\n  /** When `type === \"ref\"` or `type === \"embed\"`: the slug of the\n   *  target collection. For `ref` the record stores the target\n   *  item's primary-key slug and the host renders a clickable link\n   *  + dropdown picker. For `embed` the host pulls a *fixed* record\n   *  (see `id`) from the target and renders its fields read-only in\n   *  the detail view. Required for both; ignored on every other\n   *  type. */\n  to?: string;\n  /** When `type === \"embed\"`: the primary-key value of the fixed\n   *  record to pull from the `to` collection (e.g. `me` for the\n   *  singleton mc-profile). Nothing is stored on this record — the\n   *  embed is a display-only directive resolved at render time, so\n   *  it never appears in the list table or the edit form. Required\n   *  when type is `embed`; ignored on every other type. */\n  id?: string;\n  /** When `type === \"money\"` (or `type === \"derived\"` with\n   *  `display: \"money\"`): a literal ISO 4217 currency code passed to\n   *  `Intl.NumberFormat` for display — fixed for every record. The\n   *  stored value is always a plain decimal number; currency is\n   *  presentation only. Mutually substitutable with `currencyField`:\n   *  a money field must declare at least one of the two. */\n  currency?: string;\n  /** When `type === \"money\"` (or `type === \"derived\"` with\n   *  `display: \"money\"`): the name of a sibling record field whose\n   *  value holds the ISO 4217 code, letting currency vary per record\n   *  (e.g. an invoice's `currency` enum). The renderer reads\n   *  `record[currencyField]` and falls back to the literal `currency`\n   *  (then \"USD\") when the field is absent or empty. Resolved against\n   *  the top-level record even for money sub-fields inside a table. */\n  currencyField?: string;\n  /** When `type === \"enum\"`: the closed set of allowed string\n   *  values. The form renders a `<select>` populated from this\n   *  list; storage is a plain string. Required when type is\n   *  `enum`; ignored on every other type. */\n  values?: readonly string[];\n  /** When `type === \"table\"`: the sub-schema for each row (a flat\n   *  record of non-table / non-derived field specs). Required when\n   *  type is `table`. v0 disallows nested tables and derived\n   *  columns to keep the editor + evaluator simple. */\n  of?: Record<string, CollectionFieldSpec>;\n  /** When `type === \"derived\"`: a tiny expression evaluated against\n   *  the record. Supports `+ - * /`, parens, identifier refs to\n   *  top-level fields, `sum(tableField[].col)`, and\n   *  `sum(tableField[].col * tableField[].col)`. See\n   *  `src/utils/collections/derivedFormula.ts`. Required when type\n   *  is `derived`. */\n  formula?: string;\n  /** When `type === \"derived\"`: an inner field type the computed\n   *  value should be rendered as (e.g. `\"money\"` so $1,234.56 is\n   *  formatted). Defaults to `\"number\"`. */\n  display?: CollectionFieldType;\n  /** Optional visibility predicate: this field renders only when the\n   *  record matches (e.g. hide a `rating` field until `visited` is\n   *  `true` via `{ field: \"visited\", in: [\"true\"] }`). Applies to the\n   *  list cell (blank when hidden), the edit form (hidden live as the\n   *  gating field changes), and the detail view. Purely presentational\n   *  — a hidden field's stored value is never cleared. `when.field`\n   *  must name another top-level field. Absent ⇒ always shown. Only\n   *  honoured on top-level fields, not inside a `table`'s `of`. */\n  when?: CollectionWhen;\n  /** When `type === \"toggle\"`: the name of the top-level `enum` field this\n   *  checkbox projects. The toggle stores nothing itself — it reads and\n   *  writes this field. Required when type is `toggle`; ignored otherwise.\n   *  Must name a real `enum` field. */\n  field?: string;\n  /** When `type === \"toggle\"`: the enum value that means \"checked\". The\n   *  box is checked when the projected `field` equals this; checking writes\n   *  it. Required when type is `toggle`; must be one of the enum's `values`. */\n  onValue?: string;\n  /** When `type === \"toggle\"`: the enum value written when the box is\n   *  unchecked. Required when type is `toggle`; must be one of the enum's\n   *  `values`. */\n  offValue?: string;\n}\n\nexport interface CollectionSchema {\n  /** Human-facing collection name (sidebar, header). */\n  title: string;\n  /** Material-icon name shown next to the title. */\n  icon: string;\n  /** Workspace-relative folder holding one-JSON-per-record. Validated\n   *  to live under the workspace root at load time. */\n  dataPath: string;\n  /** Field name whose value doubles as the record's filename. */\n  primaryKey: string;\n  /** When set, the collection is a singleton: at most one record,\n   *  whose primary key is fixed to this value (e.g. `me` for the\n   *  business profile). The host pre-fills + locks the create form's\n   *  primary key and hides Add once the record exists. */\n  singleton?: string;\n  /** Ordered map: insertion order = column order in the table view. */\n  fields: Record<string, CollectionFieldSpec>;\n  /** Optional per-record actions rendered as buttons in the detail\n   *  view (e.g. \"Generate PDF\"). Order = button order. */\n  actions?: CollectionAction[];\n  /** Optional collection-level actions rendered as buttons in the\n   *  collection header (e.g. \"Extend the course\"). Unlike `actions`,\n   *  these carry no record context: the seed prompt injects a compact\n   *  progress summary of every record instead. The `when` predicate is\n   *  not evaluated (there is no record to gate on). Order = button order. */\n  collectionActions?: CollectionAction[];\n  /** Name of the field whose value marks an item as \"done\". When set,\n   *  a notification fires on item create (unless the item is born done)\n   *  and clears when the field's value transitions into\n   *  `completionDoneValues`. Must name a real field in `fields`. */\n  completionField?: string;\n  /** The set of values for `completionField` that count as \"done\"\n   *  (e.g. `[\"Done\"]` for a todo status field, `[\"paid\"]` for an\n   *  invoice). Non-empty. Compared as strings. */\n  completionDoneValues?: readonly string[];\n  /** Name of the field whose value is shown as the human-readable\n   *  label in a completion notification's title (e.g. a `name` field,\n   *  so the bell reads `Contacts: Jane Doe` instead of the opaque\n   *  primaryKey). Must name a real field in `fields`. When unset — or\n   *  when the record's value for it is empty — the title falls back to\n   *  the record's primaryKey value. Display-only; never stored. */\n  displayField?: string;\n  /** Name of a `date` field that gates this item's completion\n   *  notification: the bell is suppressed until the clock reaches that\n   *  date (compared at day-granularity in the server's local timezone),\n   *  instead of firing on create. Requires `completionField` /\n   *  `completionDoneValues` (the bell still clears via the done value).\n   *  Must name a real `date` field. Absent ⇒ fire on create, as before. */\n  triggerField?: string;\n  /** Lead time in whole days: fire the bell this many days BEFORE\n   *  `triggerField` (so `10` shows the reminder 10 days early). The lead\n   *  is applied at fire time, not stored, so it composes with `spawn` —\n   *  every recurred cycle fires the same number of days before its own\n   *  trigger. Non-negative integer; requires `triggerField`. Default 0\n   *  (fire on the trigger date). */\n  triggerLeadDays?: number;\n  /** Host-driven recurrence. When set, requires `triggerField`. See\n   *  {@link CollectionSpawn}. */\n  spawn?: CollectionSpawn;\n  /** Name of a `date` field that anchors the optional calendar view: a\n   *  month grid where each record lands on the day cell matching this\n   *  field's value. When unset, the calendar toggle still appears if the\n   *  schema has any `date` field (the first one, in declaration order, is\n   *  used by default and is switchable in-view). Set this to pin a specific\n   *  anchor. Must name a real `date` field. */\n  calendarField?: string;\n  /** Name of a second `date` field marking the END of a multi-day span on\n   *  the calendar: the record renders from `calendarField` through this\n   *  date inclusive. Requires `calendarField`. Must name a real `date`\n   *  field. Absent ⇒ single-day placement. */\n  calendarEndField?: string;\n  /** Name of a string field holding a free-form time or time-range\n   *  (e.g. \"14:00-17:00\", \"17:00-\", \"16:30\") that places records on the\n   *  calendar's day (time-allocation) view. Consulted only when the calendar\n   *  date fields are date-only. Requires `calendarField`. */\n  calendarTimeField?: string;\n  /** Name of an `enum` field that groups records into columns on the\n   *  optional Kanban board: each record lands in the column matching its\n   *  value, with empty/unknown values collected in an \"Uncategorized\"\n   *  column. When unset, the Kanban toggle still appears if the schema has\n   *  any `enum` field (the first one, in declaration order, is used by\n   *  default and is switchable in-view). Set this to pin a specific group\n   *  field. Must name a real `enum` field. */\n  kanbanField?: string;\n  /** Optional custom (LLM-authored) HTML views, each rendered in a\n   *  sandboxed iframe over the records. Absent ⇒ only the built-in\n   *  field-derived views (table / calendar / kanban / dashboard). See\n   *  {@link CollectionCustomView}. */\n  views?: CollectionCustomView[];\n  /** Optional predicate that gates the completion bell: when set, the bell\n   *  fires only for records whose `String(record[notifyWhen.field])` is one\n   *  of `notifyWhen.in` (e.g. notify only `high`/`urgent` priority todos).\n   *  Reuses the `when` predicate shape. Requires `completionField` — it\n   *  narrows that bell rather than introducing a second one. The bell still\n   *  clears on done / delete / when the predicate stops matching. Absent ⇒\n   *  notify for every open record (the prior behaviour). `notifyWhen.field`\n   *  must name a real top-level field. */\n  notifyWhen?: CollectionWhen;\n  /** Optional scheduled-retrieval config. When present, the host refreshes\n   *  this collection on `ingest.schedule`. Two flavours: a declarative Feed\n   *  (`kind: rss/atom/http-json`) periodically fetches `ingest.url`, maps the\n   *  response into records, and upserts them by `primaryKey` — only feeds\n   *  discovered from the `<workspace>/feeds/` registry carry this. Or\n   *  `kind: \"agent\"`, valid on any (incl. skill-backed) collection: the host\n   *  dispatches a hidden background worker in `ingest.role` seeded with\n   *  `ingest.template`, and the worker edits the records itself. The host's\n   *  feeds subsystem narrows this to its richer `IngestSpec`. */\n  ingest?: CollectionIngest;\n}\n\nexport interface CollectionSummary {\n  slug: string;\n  title: string;\n  icon: string;\n  source: CollectionSource;\n}\n\nexport interface CollectionDetail extends CollectionSummary {\n  schema: CollectionSchema;\n}\n\nexport type CollectionItem = Record<string, unknown>;\n","// Tiny expression evaluator for the `derived` field type on\n// schema-driven collections (see plans/done/feat-mc-invoice.md).\n//\n// Grammar (recursive-descent, no precedence climbing — six\n// non-terminals total):\n//\n//   expr   := term (('+' | '-') term)*\n//   term   := factor (('*' | '/') factor)*\n//   factor := number | sumCall | refAccess | identifier | '(' expr ')'\n//   sumCall:= 'sum' '(' sumArg ')'\n//   sumArg := tableCol (('*' | '/') tableCol)*      // e.g. lineItems[].quantity * lineItems[].rate\n//   tableCol := identifier '[]' '.' identifier\n//   refAccess := identifier '.' identifier          // e.g. ticker.price — deref a ref field into its target record\n//\n// `identifier` accepts top-level field names (single segment).\n// Inside `sumArg`, identifiers are the `<table>[].col` form.\n// A two-segment `<field>.<col>` at factor level is a *ref deref*:\n// `<field>` must be a `ref`-typed field on this record (its stored\n// value is the target item's slug), and `<col>` is a numeric column\n// read from that target record. The caller resolves the target into\n// `ctx.refs` (it owns the schema + the loaded target collection);\n// the evaluator stays pure and never does I/O.\n//\n// What's deliberately NOT supported (and would parse-error rather\n// than silently misbehave):\n//   - String literals, boolean operators, comparisons, conditionals\n//   - Nested function calls beyond `sum(...)`\n//   - Anything in the record that isn't a number / table-of-objects\n//\n// All evaluation is pure — no eval(), no Function constructor.\n// Returns `null` on any failure (parse error, unbound identifier,\n// non-finite arithmetic). The caller renders `null` as em-dash in\n// the table cell + form display.\n\nexport interface FormulaContext {\n  /** The record being evaluated. For derived fields in the form,\n   *  this is the live draft (text + table both converted via the\n   *  same `draftToRecord` pipeline). For the main table cell,\n   *  this is the persisted item. */\n  record: Record<string, unknown>;\n  /** Resolved ref-target records for THIS row, keyed by the local\n   *  `ref` field name. The caller (which has the schema + the linked\n   *  collection's items loaded) maps each ref field's stored slug to\n   *  the full target record and passes it here, so a `<field>.<col>`\n   *  formula can read a numeric column off the referenced record\n   *  (e.g. `shares * ticker.price`). A missing key or `null` value\n   *  (unknown field / dangling slug) makes that deref evaluate to\n   *  NaN → the whole formula returns `null` → em-dash, consistent\n   *  with every other failure mode. Absent ⇒ no refs available. */\n  refs?: Record<string, Record<string, unknown> | null>;\n}\n\nexport function evaluateDerived(formula: string, ctx: FormulaContext): number | null {\n  let tokens: Token[];\n  try {\n    tokens = tokenize(formula);\n  } catch {\n    return null;\n  }\n  // eslint-disable-next-line @typescript-eslint/no-use-before-define -- Parser class is defined later in the file (grouped with its AST + evaluator); evaluateDerived runs after module init so the TDZ concern doesn't apply.\n  const parser = new Parser(tokens);\n  let ast: Node;\n  try {\n    ast = parser.parseExpr();\n    if (!parser.atEnd()) return null; // trailing junk\n  } catch {\n    return null;\n  }\n  const value = evaluate(ast, ctx);\n  return Number.isFinite(value) ? value : null;\n}\n\n// ─── Tokens ────────────────────────────────────────────────\n\ntype TokenKind = \"number\" | \"ident\" | \"(\" | \")\" | \"+\" | \"-\" | \"*\" | \"/\" | \"[]\" | \".\";\n\ninterface Token {\n  kind: TokenKind;\n  value?: string | number;\n}\n\nconst SINGLE_CHAR_PUNCT = new Set<TokenKind>([\"(\", \")\", \"+\", \"-\", \"*\", \"/\", \".\"]);\n\ninterface Cursor {\n  input: string;\n  index: number;\n}\n\nfunction consumeWhitespace(cur: Cursor): boolean {\n  const char = cur.input[cur.index];\n  if (char === \" \" || char === \"\\t\" || char === \"\\n\") {\n    cur.index++;\n    return true;\n  }\n  return false;\n}\n\nfunction consumeNumber(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  const next = cur.input[cur.index + 1] ?? \"\";\n  if (!isDigit(char) && !(char === \".\" && isDigit(next))) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length) {\n    const here = cur.input[cur.index] ?? \"\";\n    if (!isDigit(here) && here !== \".\") break;\n    raw += here;\n    cur.index++;\n  }\n  const num = Number(raw);\n  if (!Number.isFinite(num)) throw new Error(\"bad number\");\n  return { kind: \"number\", value: num };\n}\n\nfunction consumeIdent(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (!isIdentStart(char)) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length && isIdentChar(cur.input[cur.index] ?? \"\")) {\n    raw += cur.input[cur.index];\n    cur.index++;\n  }\n  return { kind: \"ident\", value: raw };\n}\n\nfunction consumePunct(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (char === \"[\" && cur.input[cur.index + 1] === \"]\") {\n    cur.index += 2;\n    return { kind: \"[]\" };\n  }\n  if (SINGLE_CHAR_PUNCT.has(char as TokenKind)) {\n    cur.index++;\n    return { kind: char as TokenKind };\n  }\n  return null;\n}\n\nfunction tokenize(input: string): Token[] {\n  const tokens: Token[] = [];\n  const cur: Cursor = { input, index: 0 };\n  while (cur.index < input.length) {\n    if (consumeWhitespace(cur)) continue;\n    // Number FIRST so a leading-dot literal (`.25`) isn't split by\n    // the `.` punctuation branch.\n    const numTok = consumeNumber(cur);\n    if (numTok) {\n      tokens.push(numTok);\n      continue;\n    }\n    const punctTok = consumePunct(cur);\n    if (punctTok) {\n      tokens.push(punctTok);\n      continue;\n    }\n    const identTok = consumeIdent(cur);\n    if (identTok) {\n      tokens.push(identTok);\n      continue;\n    }\n    throw new Error(`unexpected char ${input[cur.index]}`);\n  }\n  return tokens;\n}\n\nfunction isDigit(char: string): boolean {\n  return char >= \"0\" && char <= \"9\";\n}\nfunction isIdentStart(char: string): boolean {\n  return (char >= \"a\" && char <= \"z\") || (char >= \"A\" && char <= \"Z\") || char === \"_\";\n}\nfunction isIdentChar(char: string): boolean {\n  return isIdentStart(char) || isDigit(char);\n}\n\n// ─── AST + Parser ───────────────────────────────────────────\n\ntype Node =\n  | { kind: \"num\"; value: number }\n  | { kind: \"ident\"; name: string }\n  | { kind: \"ref\"; field: string; col: string }\n  | { kind: \"binop\"; operator: \"+\" | \"-\" | \"*\" | \"/\"; left: Node; right: Node }\n  | { kind: \"sum\"; arg: SumArg };\n\ninterface SumArg {\n  // factors multiplied/divided together; each is a (tableName, colName) ref into a row.\n  factors: { table: string; col: string }[];\n  /** Operators between factors: length = factors.length - 1; each\n   *  is \"*\" or \"/\". For a single-factor sum (`sum(lineItems[].amount)`)\n   *  this is empty. */\n  operators: (\"*\" | \"/\")[];\n}\n\nclass Parser {\n  private cursor = 0;\n  constructor(private readonly tokens: Token[]) {}\n\n  atEnd(): boolean {\n    return this.cursor >= this.tokens.length;\n  }\n  private peek(): Token | undefined {\n    return this.tokens[this.cursor];\n  }\n  private consume(): Token {\n    const tok = this.tokens[this.cursor++];\n    if (!tok) throw new Error(\"unexpected end of input\");\n    return tok;\n  }\n  private expect(kind: TokenKind): Token {\n    const tok = this.consume();\n    if (tok.kind !== kind) throw new Error(`expected ${kind}, got ${tok.kind}`);\n    return tok;\n  }\n\n  parseExpr(): Node {\n    let left = this.parseTerm();\n    while (this.peek()?.kind === \"+\" || this.peek()?.kind === \"-\") {\n      const operator = this.consume().kind as \"+\" | \"-\";\n      const right = this.parseTerm();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseTerm(): Node {\n    let left = this.parseFactor();\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      const right = this.parseFactor();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseFactor(): Node {\n    const tok = this.peek();\n    if (!tok) throw new Error(\"unexpected end in factor\");\n    if (tok.kind === \"number\") {\n      this.consume();\n      return { kind: \"num\", value: tok.value as number };\n    }\n    if (tok.kind === \"(\") {\n      this.consume();\n      const inner = this.parseExpr();\n      this.expect(\")\");\n      return inner;\n    }\n    if (tok.kind === \"ident\") {\n      const name = (tok.value as string) ?? \"\";\n      // sum(...) — only function call we support\n      if (name === \"sum\" && this.tokens[this.cursor + 1]?.kind === \"(\") {\n        this.consume(); // ident\n        this.expect(\"(\");\n        const arg = this.parseSumArg();\n        this.expect(\")\");\n        return { kind: \"sum\", arg };\n      }\n      this.consume(); // ident\n      // ref deref: `<field>.<col>` (e.g. ticker.price). The table-row\n      // form `<table>[].col` only appears inside sum(), so a `.`\n      // immediately after a top-level ident is unambiguously a ref\n      // dereference here.\n      if (this.peek()?.kind === \".\") {\n        this.consume(); // '.'\n        const col = this.expect(\"ident\");\n        return { kind: \"ref\", field: name, col: col.value as string };\n      }\n      return { kind: \"ident\", name };\n    }\n    throw new Error(`unexpected token ${tok.kind} in factor`);\n  }\n\n  private parseSumArg(): SumArg {\n    const factors: { table: string; col: string }[] = [];\n    const operators: (\"*\" | \"/\")[] = [];\n    factors.push(this.parseTableCol());\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      operators.push(operator);\n      factors.push(this.parseTableCol());\n    }\n    return { factors, operators };\n  }\n\n  private parseTableCol(): { table: string; col: string } {\n    const tableTok = this.expect(\"ident\");\n    this.expect(\"[]\");\n    this.expect(\".\");\n    const colTok = this.expect(\"ident\");\n    return { table: tableTok.value as string, col: colTok.value as string };\n  }\n}\n\n// ─── Evaluator ──────────────────────────────────────────────\n\nfunction evaluate(node: Node, ctx: FormulaContext): number {\n  if (node.kind === \"num\") return node.value;\n  if (node.kind === \"ident\") {\n    const raw = ctx.record[node.name];\n    return toFiniteNumber(raw);\n  }\n  if (node.kind === \"ref\") {\n    // `<field>.<col>`: read `col` off the resolved target record the\n    // caller put in ctx.refs. Unknown field / dangling slug → null →\n    // NaN, so the whole formula fails soft to an em-dash.\n    const target = ctx.refs?.[node.field] ?? null;\n    if (!target) return Number.NaN;\n    return toFiniteNumber(target[node.col]);\n  }\n  if (node.kind === \"binop\") {\n    const left = evaluate(node.left, ctx);\n    const right = evaluate(node.right, ctx);\n    return applyBinop(node.operator, left, right);\n  }\n  if (node.kind === \"sum\") {\n    return evaluateSum(node.arg, ctx);\n  }\n  // Exhaustive — TS narrows above branches but throw keeps runtime honest.\n  throw new Error(`unknown node`);\n}\n\nfunction applyBinop(operator: \"+\" | \"-\" | \"*\" | \"/\", left: number, right: number): number {\n  if (!Number.isFinite(left) || !Number.isFinite(right)) return Number.NaN;\n  if (operator === \"+\") return left + right;\n  if (operator === \"-\") return left - right;\n  if (operator === \"*\") return left * right;\n  // operator === \"/\"\n  if (right === 0) return Number.NaN;\n  return left / right;\n}\n\nfunction evaluateSum(arg: SumArg, ctx: FormulaContext): number {\n  if (arg.factors.length === 0) return 0;\n  const tableName = arg.factors[0].table;\n  // All factors must reference the SAME table (you can't multiply\n  // a row from lineItems against a row from another table — the\n  // semantics would be ambiguous). Reject mismatch.\n  for (const factor of arg.factors) {\n    if (factor.table !== tableName) return Number.NaN;\n  }\n  const rows = ctx.record[tableName];\n  if (!Array.isArray(rows)) return 0;\n  let total = 0;\n  for (const row of rows) {\n    if (!row || typeof row !== \"object\") continue;\n    let product = toFiniteNumber((row as Record<string, unknown>)[arg.factors[0].col]);\n    if (!Number.isFinite(product)) return Number.NaN;\n    for (let i = 1; i < arg.factors.length; i++) {\n      const value = toFiniteNumber((row as Record<string, unknown>)[arg.factors[i].col]);\n      if (!Number.isFinite(value)) return Number.NaN;\n      product = applyBinop(arg.operators[i - 1], product, value);\n    }\n    total += product;\n  }\n  return total;\n}\n\nfunction toFiniteNumber(value: unknown): number {\n  if (typeof value === \"number\") return Number.isFinite(value) ? value : Number.NaN;\n  if (typeof value === \"string\" && value.length > 0) {\n    const num = Number(value);\n    return Number.isFinite(num) ? num : Number.NaN;\n  }\n  return Number.NaN;\n}\n","// The derived-field saturation loop for schema-driven collections,\n// extracted from `composables/collections/useCollectionRendering.ts` so\n// the server (manageCollection getItems enrichment) and the client\n// (table cells, form display) evaluate formulas through ONE\n// implementation — if the two ever diverged, the UI and the LLM would\n// disagree on a number. Pure module: no Vue, no I/O.\n//\n// Like `actionVisible.ts`, the input types are minimal structural\n// shapes so both the client `FieldSpec`/`CollectionSchema`\n// (src/components/collectionTypes.ts) and the server\n// `CollectionFieldSpec`/`CollectionSchema`\n// (server/workspace/collections/types.ts) satisfy them as-is.\n\nimport { evaluateDerived, type FormulaContext } from \"./derivedFormula\";\n\n/** Minimal field shape the derive loop needs — accepts both the client\n *  FieldSpec and the server CollectionFieldSpec. */\nexport interface DerivableFieldSpec {\n  type: string;\n  /** When type === \"ref\": slug of the target collection. */\n  to?: string;\n  /** When type === \"derived\": formula evaluated against the record. */\n  formula?: string;\n}\n\n/** Minimal schema shape: just the ordered field map. */\nexport interface DerivableSchema {\n  fields: Record<string, DerivableFieldSpec>;\n}\n\nexport type DerivableRecord = Record<string, unknown>;\n\n/** Per-target-collection cache of loaded referenced records:\n *  target collection slug → item slug → full record. Mirrors the\n *  client's `RefRecordCache` / the server's enrichment loader. */\nexport type DeriveRefRecords = Record<string, Record<string, DerivableRecord>>;\n\n/** Map each `ref` field's stored slug to its loaded target record (or\n *  null when dangling / not loaded), keyed by the LOCAL field name —\n *  the shape `evaluateDerived` reads for `<field>.<col>` derefs. */\nexport function resolveRowRefs(schema: DerivableSchema, record: DerivableRecord, refRecords: DeriveRefRecords): NonNullable<FormulaContext[\"refs\"]> {\n  const refs: NonNullable<FormulaContext[\"refs\"]> = {};\n  for (const [key, field] of Object.entries(schema.fields)) {\n    if (field.type !== \"ref\" || !field.to) continue;\n    const slug = record[key];\n    refs[key] = typeof slug === \"string\" ? (refRecords[field.to]?.[slug] ?? null) : null;\n  }\n  return refs;\n}\n\n/** Evaluate every `derived` field against `base`, saturating so a\n *  derived field can read another derived field computed in an earlier\n *  pass (`subtotal → tax → total` converges in ≤ field-count passes).\n *  Cycles can't loop forever — passes are bounded by the number of\n *  derived fields and the loop breaks as soon as a pass changes\n *  nothing. Failed formulas stay ABSENT (the UI renders them as\n *  em-dash). Returns a copy; `base` is never mutated.\n *\n *  Derived keys already present in `base` are stripped before\n *  evaluation: computed output is host-truth, never persisted-input\n *  fallback. A record JSON can carry a stale (or forged) derived value\n *  — raw Write/Edit, legacy data — and without the strip, a failing\n *  formula would silently surface that value as if the host computed\n *  it. */\nexport function deriveAll(schema: DerivableSchema, base: DerivableRecord, refRecords: DeriveRefRecords): DerivableRecord {\n  const derivedKeys = new Set(Object.keys(schema.fields).filter((key) => schema.fields[key]?.type === \"derived\"));\n  const enriched: DerivableRecord = Object.fromEntries(Object.entries(base).filter(([key]) => !derivedKeys.has(key)));\n  const refs = resolveRowRefs(schema, base, refRecords);\n  const maxPasses = Object.values(schema.fields).filter((field) => field.type === \"derived\").length;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let mutated = false;\n    for (const [key, field] of Object.entries(schema.fields)) {\n      if (field.type !== \"derived\" || !field.formula) continue;\n      const next = evaluateDerived(field.formula, { record: enriched, refs });\n      if (next !== null && enriched[key] !== next) {\n        enriched[key] = next;\n        mutated = true;\n      }\n    }\n    if (!mutated) break;\n  }\n  return enriched;\n}\n"],"mappings":";;;;;AA6CA,IAAa,eAAe;CAAC;CAAO;CAAQ;AAAW;;;;;;;;AAUvD,IAAa,oBAAoB;;AAIjC,IAAa,iBAAiB;CAAC;CAAU;CAAS;CAAU;AAAW;;AAqFvE,SAAgB,mBAAmB,OAAkE;CACnG,OAAO,eAAe;AACxB;;;AC9FA,SAAgB,gBAAgB,SAAiB,KAAoC;CACnF,IAAI;CACJ,IAAI;EACF,SAAS,SAAS,OAAO;CAC3B,QAAQ;EACN,OAAO;CACT;CAEA,MAAM,SAAS,IAAI,OAAO,MAAM;CAChC,IAAI;CACJ,IAAI;EACF,MAAM,OAAO,UAAU;EACvB,IAAI,CAAC,OAAO,MAAM,GAAG,OAAO;CAC9B,QAAQ;EACN,OAAO;CACT;CACA,MAAM,QAAQ,SAAS,KAAK,GAAG;CAC/B,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAC1C;AAWA,IAAM,oCAAoB,IAAI,IAAe;CAAC;CAAK;CAAK;CAAK;CAAK;CAAK;CAAK;AAAG,CAAC;AAOhF,SAAS,kBAAkB,KAAsB;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,IAAI,SAAS,OAAO,SAAS,OAAQ,SAAS,MAAM;EAClD,IAAI;EACJ,OAAO;CACT;CACA,OAAO;AACT;AAEA,SAAS,cAAc,KAA2B;CAChD,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,MAAM,OAAO,IAAI,MAAM,IAAI,QAAQ,MAAM;CACzC,IAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,SAAS,OAAO,QAAQ,IAAI,IAAI,OAAO;CAC/D,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,QAAQ;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;EACrC,IAAI,CAAC,QAAQ,IAAI,KAAK,SAAS,KAAK;EACpC,OAAO;EACP,IAAI;CACN;CACA,MAAM,MAAM,OAAO,GAAG;CACtB,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,MAAM,IAAI,MAAM,YAAY;CACvD,OAAO;EAAE,MAAM;EAAU,OAAO;CAAI;AACtC;AAEA,SAAS,aAAa,KAA2B;CAE/C,IAAI,CAAC,aADQ,IAAI,MAAM,IAAI,UAAU,EACf,GAAG,OAAO;CAChC,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,UAAU,YAAY,IAAI,MAAM,IAAI,UAAU,EAAE,GAAG;EAC9E,OAAO,IAAI,MAAM,IAAI;EACrB,IAAI;CACN;CACA,OAAO;EAAE,MAAM;EAAS,OAAO;CAAI;AACrC;AAEA,SAAS,aAAa,KAA2B;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI,QAAQ,OAAO,KAAK;EACpD,IAAI,SAAS;EACb,OAAO,EAAE,MAAM,KAAK;CACtB;CACA,IAAI,kBAAkB,IAAI,IAAiB,GAAG;EAC5C,IAAI;EACJ,OAAO,EAAE,MAAM,KAAkB;CACnC;CACA,OAAO;AACT;AAEA,SAAS,SAAS,OAAwB;CACxC,MAAM,SAAkB,CAAC;CACzB,MAAM,MAAc;EAAE;EAAO,OAAO;CAAE;CACtC,OAAO,IAAI,QAAQ,MAAM,QAAQ;EAC/B,IAAI,kBAAkB,GAAG,GAAG;EAG5B,MAAM,SAAS,cAAc,GAAG;EAChC,IAAI,QAAQ;GACV,OAAO,KAAK,MAAM;GAClB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,IAAI,MAAM,mBAAmB,MAAM,IAAI,QAAQ;CACvD;CACA,OAAO;AACT;AAEA,SAAS,QAAQ,MAAuB;CACtC,OAAO,QAAQ,OAAO,QAAQ;AAChC;AACA,SAAS,aAAa,MAAuB;CAC3C,OAAQ,QAAQ,OAAO,QAAQ,OAAS,QAAQ,OAAO,QAAQ,OAAQ,SAAS;AAClF;AACA,SAAS,YAAY,MAAuB;CAC1C,OAAO,aAAa,IAAI,KAAK,QAAQ,IAAI;AAC3C;AAoBA,IAAM,SAAN,MAAa;CAEkB;CAD7B,SAAiB;CACjB,YAAY,QAAkC;EAAjB,KAAA,SAAA;CAAkB;CAE/C,QAAiB;EACf,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;CACA,OAAkC;EAChC,OAAO,KAAK,OAAO,KAAK;CAC1B;CACA,UAAyB;EACvB,MAAM,MAAM,KAAK,OAAO,KAAK;EAC7B,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,yBAAyB;EACnD,OAAO;CACT;CACA,OAAe,MAAwB;EACrC,MAAM,MAAM,KAAK,QAAQ;EACzB,IAAI,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM,YAAY,KAAK,QAAQ,IAAI,MAAM;EAC1E,OAAO;CACT;CAEA,YAAkB;EAChB,IAAI,OAAO,KAAK,UAAU;EAC1B,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,MAAM,QAAQ,KAAK,UAAU;GAC7B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,YAA0B;EACxB,IAAI,OAAO,KAAK,YAAY;EAC5B,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,MAAM,QAAQ,KAAK,YAAY;GAC/B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,cAA4B;EAC1B,MAAM,MAAM,KAAK,KAAK;EACtB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,0BAA0B;EACpD,IAAI,IAAI,SAAS,UAAU;GACzB,KAAK,QAAQ;GACb,OAAO;IAAE,MAAM;IAAO,OAAO,IAAI;GAAgB;EACnD;EACA,IAAI,IAAI,SAAS,KAAK;GACpB,KAAK,QAAQ;GACb,MAAM,QAAQ,KAAK,UAAU;GAC7B,KAAK,OAAO,GAAG;GACf,OAAO;EACT;EACA,IAAI,IAAI,SAAS,SAAS;GACxB,MAAM,OAAQ,IAAI,SAAoB;GAEtC,IAAI,SAAS,SAAS,KAAK,OAAO,KAAK,SAAS,EAAE,EAAE,SAAS,KAAK;IAChE,KAAK,QAAQ;IACb,KAAK,OAAO,GAAG;IACf,MAAM,MAAM,KAAK,YAAY;IAC7B,KAAK,OAAO,GAAG;IACf,OAAO;KAAE,MAAM;KAAO;IAAI;GAC5B;GACA,KAAK,QAAQ;GAKb,IAAI,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;IAC7B,KAAK,QAAQ;IAEb,OAAO;KAAE,MAAM;KAAO,OAAO;KAAM,KADvB,KAAK,OAAO,OACgB,CAAA,CAAI;IAAgB;GAC9D;GACA,OAAO;IAAE,MAAM;IAAS;GAAK;EAC/B;EACA,MAAM,IAAI,MAAM,oBAAoB,IAAI,KAAK,WAAW;CAC1D;CAEA,cAA8B;EAC5B,MAAM,UAA4C,CAAC;EACnD,MAAM,YAA2B,CAAC;EAClC,QAAQ,KAAK,KAAK,cAAc,CAAC;EACjC,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,CAAC,CAAC;GAChC,UAAU,KAAK,QAAQ;GACvB,QAAQ,KAAK,KAAK,cAAc,CAAC;EACnC;EACA,OAAO;GAAE;GAAS;EAAU;CAC9B;CAEA,gBAAwD;EACtD,MAAM,WAAW,KAAK,OAAO,OAAO;EACpC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,GAAG;EACf,MAAM,SAAS,KAAK,OAAO,OAAO;EAClC,OAAO;GAAE,OAAO,SAAS;GAAiB,KAAK,OAAO;EAAgB;CACxE;AACF;AAIA,SAAS,SAAS,MAAY,KAA6B;CACzD,IAAI,KAAK,SAAS,OAAO,OAAO,KAAK;CACrC,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,MAAM,IAAI,OAAO,KAAK;EAC5B,OAAO,eAAe,GAAG;CAC3B;CACA,IAAI,KAAK,SAAS,OAAO;EAIvB,MAAM,SAAS,IAAI,OAAO,KAAK,UAAU;EACzC,IAAI,CAAC,QAAQ,OAAO;EACpB,OAAO,eAAe,OAAO,KAAK,IAAI;CACxC;CACA,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,OAAO,SAAS,KAAK,MAAM,GAAG;EACpC,MAAM,QAAQ,SAAS,KAAK,OAAO,GAAG;EACtC,OAAO,WAAW,KAAK,UAAU,MAAM,KAAK;CAC9C;CACA,IAAI,KAAK,SAAS,OAChB,OAAO,YAAY,KAAK,KAAK,GAAG;CAGlC,MAAM,IAAI,MAAM,cAAc;AAChC;AAEA,SAAS,WAAW,UAAiC,MAAc,OAAuB;CACxF,IAAI,CAAC,OAAO,SAAS,IAAI,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CAC9D,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CAEpC,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,OAAO;AAChB;AAEA,SAAS,YAAY,KAAa,KAA6B;CAC7D,IAAI,IAAI,QAAQ,WAAW,GAAG,OAAO;CACrC,MAAM,YAAY,IAAI,QAAQ,EAAE,CAAC;CAIjC,KAAK,MAAM,UAAU,IAAI,SACvB,IAAI,OAAO,UAAU,WAAW,OAAO;CAEzC,MAAM,OAAO,IAAI,OAAO;CACxB,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,OAAO;CACjC,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;EACrC,IAAI,UAAU,eAAgB,IAAgC,IAAI,QAAQ,EAAE,CAAC,IAAI;EACjF,IAAI,CAAC,OAAO,SAAS,OAAO,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,QAAQ,KAAK;GAC3C,MAAM,QAAQ,eAAgB,IAAgC,IAAI,QAAQ,EAAE,CAAC,IAAI;GACjF,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;GACpC,UAAU,WAAW,IAAI,UAAU,IAAI,IAAI,SAAS,KAAK;EAC3D;EACA,SAAS;CACX;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAAwB;CAC9C,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;CACvE,IAAI,OAAO,UAAU,YAAY,MAAM,SAAS,GAAG;EACjD,MAAM,MAAM,OAAO,KAAK;EACxB,OAAO,OAAO,SAAS,GAAG,IAAI,MAAM;CACtC;CACA,OAAO;AACT;;;;;;ACnUA,SAAgB,eAAe,QAAyB,QAAyB,YAAmE;CAClJ,MAAM,OAA4C,CAAC;CACnD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;EACxD,IAAI,MAAM,SAAS,SAAS,CAAC,MAAM,IAAI;EACvC,MAAM,OAAO,OAAO;EACpB,KAAK,OAAO,OAAO,SAAS,WAAY,WAAW,MAAM,GAAG,GAAG,SAAS,OAAQ;CAClF;CACA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,UAAU,QAAyB,MAAuB,YAA+C;CACvH,MAAM,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,OAAO,IAAI,EAAE,SAAS,SAAS,CAAC;CAC9G,MAAM,WAA4B,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC;CAClH,MAAM,OAAO,eAAe,QAAQ,MAAM,UAAU;CACpD,MAAM,YAAY,OAAO,OAAO,OAAO,MAAM,CAAC,CAAC,QAAQ,UAAU,MAAM,SAAS,SAAS,CAAC,CAAC;CAC3F,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;GACxD,IAAI,MAAM,SAAS,aAAa,CAAC,MAAM,SAAS;GAChD,MAAM,OAAO,gBAAgB,MAAM,SAAS;IAAE,QAAQ;IAAU;GAAK,CAAC;GACtE,IAAI,SAAS,QAAQ,SAAS,SAAS,MAAM;IAC3C,SAAS,OAAO;IAChB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CACA,OAAO;AACT"}

package/dist/file-change/index.cjs

@@ -1,7 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_chunk = require("../chunk-CKQMccvm.cjs");
+const require_rolldown_runtime = require("../rolldown-runtime-D6vf50IK.cjs");
 let node_path = require("node:path");
-node_path = require_chunk.__toESM(node_path, 1);
+node_path = require_rolldown_runtime.__toESM(node_path, 1);
 let node_fs_promises = require("node:fs/promises");
 //#region src/file-change/index.ts
 var config = null;

package/dist/file-change/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":[],"sources":["../../src/file-change/index.ts"],"sourcesContent":["// @mulmoclaude/core/file-change — shared \"this workspace file changed\"\n// broadcaster. A host write route calls `publishFileChange(relPath)` after a\n// successful write; subscribed UI tabs refetch. Extracted so MulmoClaude and\n// MulmoTerminal forward to the SAME plugin-scoped channels (the live-refresh\n// contract the markdown/html Views subscribe to) without duplicating the logic.\n//\n// Everything host-specific is INJECTED via `configureFileChangePublisher` (the\n// pubsub, the workspace root, the path→posix normaliser, the host's own primary\n// channel, the plugin-scope matchers, and any side-effect), so this package owns\n// only the orchestration + the `plugin:<scope>:file:<path>` channel format and\n// touches neither host's pubsub-channel config nor its frontend subscribers.\nimport { stat } from \"node:fs/promises\";\nimport path from \"node:path\";\n\n/** Payload published on every file-change channel. `mtimeMs` is the post-write\n *  modified time — monotonic, suitable for cache-busting (`?v=`) and out-of-order\n *  drops. */\nexport interface FileChannelPayload {\n  path: string;\n  mtimeMs: number;\n}\n\n/** A plugin View that wants live-refresh: when `matches(posixPath)` is true, the\n *  change is forwarded to `plugin:<scope>:file:<path>` (the channel the View's\n *  runtime subscribes to). */\nexport interface FileChangeScope {\n  scope: string;\n  matches: (posixPath: string) => boolean;\n}\n\nexport interface FileChangePublisherConfig {\n  /** Host pubsub publish. */\n  publish: (channel: string, payload: FileChannelPayload) => void;\n  /** Workspace root — joined with the relative path to stat the post-write mtime. */\n  workspaceRoot: string;\n  /** Normalise a workspace-relative path to POSIX (drives both `payload.path` and\n   *  every channel suffix, so they can't drift on mixed separators). */\n  toPosix: (relativePath: string) => string;\n  /** The host's primary file channel (e.g. a Files explorer's `file:<path>`).\n   *  Omit when the host has no general file subscriber (e.g. MulmoTerminal). */\n  primaryChannel?: (posixPath: string) => string;\n  /** Plugin Views to forward to. */\n  pluginScopes?: FileChangeScope[];\n  /** Optional side-effect after publishing (e.g. a topic-index regen). Receives the\n   *  posix path + payload; may itself call `publishFileChange` for derived files. */\n  onPublished?: (posixPath: string, payload: FileChannelPayload) => void;\n  /** Optional warn logger; a publish/stat failure logs but never throws (callers\n   *  fire-and-forget, so a throw would be an unhandled rejection). */\n  warn?: (message: string, data?: Record<string, unknown>) => void;\n}\n\nlet config: FileChangePublisherConfig | null = null;\n\n/** Wire the publisher to a host. Call once at startup, before any write route. */\nexport function configureFileChangePublisher(cfg: FileChangePublisherConfig): void {\n  config = cfg;\n}\n\n/** Clear the binding — test-only. */\nexport function resetFileChangePublisher(): void {\n  config = null;\n}\n\n/** The plugin-scoped live-refresh channel a View subscribes to. */\nexport function pluginFileChannel(scope: string, posixPath: string): string {\n  return `plugin:${scope}:file:${posixPath}`;\n}\n\n/** Publish a file-change for a workspace-relative path: the primary channel (if any)\n *  + every matching plugin scope, with the post-write mtime. No-op until configured. */\nexport async function publishFileChange(relativePath: string): Promise<void> {\n  const cfg = config;\n  if (!cfg) return;\n  // `relativePath` comes from the host's write routes. Contain it before doing\n  // anything: a path that escapes the workspace is dropped entirely — we\n  // neither stat an arbitrary file nor broadcast an out-of-workspace path to\n  // subscribers or host side-effects. Defence-in-depth, since this is the\n  // shared package both hosts use. `root` carries a trailing separator and the\n  // guard is a single `startsWith` early-return — the canonical containment\n  // shape (so the check is unambiguous for both readers and static analysis).\n  const root = path.resolve(cfg.workspaceRoot) + path.sep;\n  const absPath = path.join(root, relativePath);\n  if (!absPath.startsWith(root)) {\n    cfg.warn?.(\"ignoring file-change for path outside workspace\", { path: relativePath });\n    return;\n  }\n  let mtimeMs: number;\n  try {\n    ({ mtimeMs } = await stat(absPath));\n  } catch (err) {\n    cfg.warn?.(\"stat failed; falling back to Date.now()\", { path: relativePath, error: errMsg(err) });\n    mtimeMs = Date.now();\n  }\n  const posixPath = cfg.toPosix(relativePath);\n  const payload: FileChannelPayload = { path: posixPath, mtimeMs };\n\n  if (cfg.primaryChannel) {\n    safePublish(cfg, cfg.primaryChannel(posixPath), payload, \"primary publish failed\");\n  }\n  for (const { scope, matches } of cfg.pluginScopes ?? []) {\n    if (!matches(posixPath)) continue;\n    safePublish(cfg, pluginFileChannel(scope, posixPath), payload, `${scope} plugin forward failed`);\n  }\n  cfg.onPublished?.(posixPath, payload);\n}\n\nfunction safePublish(cfg: FileChangePublisherConfig, channel: string, payload: FileChannelPayload, failMsg: string): void {\n  try {\n    cfg.publish(channel, payload);\n  } catch (err) {\n    cfg.warn?.(`${failMsg}; subscribers will miss this event`, { channel, error: errMsg(err) });\n  }\n}\n\nfunction errMsg(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n"],"mappings":";;;;;;AAmDA,IAAI,SAA2C;;AAG/C,SAAgB,6BAA6B,KAAsC;CACjF,SAAS;AACX;;AAGA,SAAgB,2BAAiC;CAC/C,SAAS;AACX;;AAGA,SAAgB,kBAAkB,OAAe,WAA2B;CAC1E,OAAO,UAAU,MAAM,QAAQ;AACjC;;;AAIA,eAAsB,kBAAkB,cAAqC;CAC3E,MAAM,MAAM;CACZ,IAAI,CAAC,KAAK;CAQV,MAAM,OAAO,UAAA,QAAK,QAAQ,IAAI,aAAa,IAAI,UAAA,QAAK;CACpD,MAAM,UAAU,UAAA,QAAK,KAAK,MAAM,YAAY;CAC5C,IAAI,CAAC,QAAQ,WAAW,IAAI,GAAG;EAC7B,IAAI,OAAO,mDAAmD,EAAE,MAAM,aAAa,CAAC;EACpF;CACF;CACA,IAAI;CACJ,IAAI;EACF,CAAC,CAAE,WAAY,OAAA,GAAA,iBAAA,MAAW,OAAO;CACnC,SAAS,KAAK;EACZ,IAAI,OAAO,2CAA2C;GAAE,MAAM;GAAc,OAAO,OAAO,GAAG;EAAE,CAAC;EAChG,UAAU,KAAK,IAAI;CACrB;CACA,MAAM,YAAY,IAAI,QAAQ,YAAY;CAC1C,MAAM,UAA8B;EAAE,MAAM;EAAW;CAAQ;CAE/D,IAAI,IAAI,gBACN,YAAY,KAAK,IAAI,eAAe,SAAS,GAAG,SAAS,wBAAwB;CAEnF,KAAK,MAAM,EAAE,OAAO,aAAa,IAAI,gBAAgB,CAAC,GAAG;EACvD,IAAI,CAAC,QAAQ,SAAS,GAAG;EACzB,YAAY,KAAK,kBAAkB,OAAO,SAAS,GAAG,SAAS,GAAG,MAAM,uBAAuB;CACjG;CACA,IAAI,cAAc,WAAW,OAAO;AACtC;AAEA,SAAS,YAAY,KAAgC,SAAiB,SAA6B,SAAuB;CACxH,IAAI;EACF,IAAI,QAAQ,SAAS,OAAO;CAC9B,SAAS,KAAK;EACZ,IAAI,OAAO,GAAG,QAAQ,qCAAqC;GAAE;GAAS,OAAO,OAAO,GAAG;EAAE,CAAC;CAC5F;AACF;AAEA,SAAS,OAAO,KAAsB;CACpC,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD"}
+{"version":3,"file":"index.cjs","names":[],"sources":["../../src/file-change/index.ts"],"sourcesContent":["// @mulmoclaude/core/file-change — shared \"this workspace file changed\"\n// broadcaster. A host write route calls `publishFileChange(relPath)` after a\n// successful write; subscribed UI tabs refetch. Extracted so MulmoClaude and\n// MulmoTerminal forward to the SAME plugin-scoped channels (the live-refresh\n// contract the markdown/html Views subscribe to) without duplicating the logic.\n//\n// Everything host-specific is INJECTED via `configureFileChangePublisher` (the\n// pubsub, the workspace root, the path→posix normaliser, the host's own primary\n// channel, the plugin-scope matchers, and any side-effect), so this package owns\n// only the orchestration + the `plugin:<scope>:file:<path>` channel format and\n// touches neither host's pubsub-channel config nor its frontend subscribers.\nimport { stat } from \"node:fs/promises\";\nimport path from \"node:path\";\n\n/** Payload published on every file-change channel. `mtimeMs` is the post-write\n *  modified time — monotonic, suitable for cache-busting (`?v=`) and out-of-order\n *  drops. */\nexport interface FileChannelPayload {\n  path: string;\n  mtimeMs: number;\n}\n\n/** A plugin View that wants live-refresh: when `matches(posixPath)` is true, the\n *  change is forwarded to `plugin:<scope>:file:<path>` (the channel the View's\n *  runtime subscribes to). */\nexport interface FileChangeScope {\n  scope: string;\n  matches: (posixPath: string) => boolean;\n}\n\nexport interface FileChangePublisherConfig {\n  /** Host pubsub publish. */\n  publish: (channel: string, payload: FileChannelPayload) => void;\n  /** Workspace root — joined with the relative path to stat the post-write mtime. */\n  workspaceRoot: string;\n  /** Normalise a workspace-relative path to POSIX (drives both `payload.path` and\n   *  every channel suffix, so they can't drift on mixed separators). */\n  toPosix: (relativePath: string) => string;\n  /** The host's primary file channel (e.g. a Files explorer's `file:<path>`).\n   *  Omit when the host has no general file subscriber (e.g. MulmoTerminal). */\n  primaryChannel?: (posixPath: string) => string;\n  /** Plugin Views to forward to. */\n  pluginScopes?: FileChangeScope[];\n  /** Optional side-effect after publishing (e.g. a topic-index regen). Receives the\n   *  posix path + payload; may itself call `publishFileChange` for derived files. */\n  onPublished?: (posixPath: string, payload: FileChannelPayload) => void;\n  /** Optional warn logger; a publish/stat failure logs but never throws (callers\n   *  fire-and-forget, so a throw would be an unhandled rejection). */\n  warn?: (message: string, data?: Record<string, unknown>) => void;\n}\n\nlet config: FileChangePublisherConfig | null = null;\n\n/** Wire the publisher to a host. Call once at startup, before any write route. */\nexport function configureFileChangePublisher(cfg: FileChangePublisherConfig): void {\n  config = cfg;\n}\n\n/** Clear the binding — test-only. */\nexport function resetFileChangePublisher(): void {\n  config = null;\n}\n\n/** The plugin-scoped live-refresh channel a View subscribes to. */\nexport function pluginFileChannel(scope: string, posixPath: string): string {\n  return `plugin:${scope}:file:${posixPath}`;\n}\n\n/** Publish a file-change for a workspace-relative path: the primary channel (if any)\n *  + every matching plugin scope, with the post-write mtime. No-op until configured. */\nexport async function publishFileChange(relativePath: string): Promise<void> {\n  const cfg = config;\n  if (!cfg) return;\n  // `relativePath` comes from the host's write routes. Contain it before doing\n  // anything: a path that escapes the workspace is dropped entirely — we\n  // neither stat an arbitrary file nor broadcast an out-of-workspace path to\n  // subscribers or host side-effects. Defence-in-depth, since this is the\n  // shared package both hosts use. `root` carries a trailing separator and the\n  // guard is a single `startsWith` early-return — the canonical containment\n  // shape (so the check is unambiguous for both readers and static analysis).\n  const root = path.resolve(cfg.workspaceRoot) + path.sep;\n  const absPath = path.join(root, relativePath);\n  if (!absPath.startsWith(root)) {\n    cfg.warn?.(\"ignoring file-change for path outside workspace\", { path: relativePath });\n    return;\n  }\n  let mtimeMs: number;\n  try {\n    ({ mtimeMs } = await stat(absPath));\n  } catch (err) {\n    cfg.warn?.(\"stat failed; falling back to Date.now()\", { path: relativePath, error: errMsg(err) });\n    mtimeMs = Date.now();\n  }\n  const posixPath = cfg.toPosix(relativePath);\n  const payload: FileChannelPayload = { path: posixPath, mtimeMs };\n\n  if (cfg.primaryChannel) {\n    safePublish(cfg, cfg.primaryChannel(posixPath), payload, \"primary publish failed\");\n  }\n  for (const { scope, matches } of cfg.pluginScopes ?? []) {\n    if (!matches(posixPath)) continue;\n    safePublish(cfg, pluginFileChannel(scope, posixPath), payload, `${scope} plugin forward failed`);\n  }\n  cfg.onPublished?.(posixPath, payload);\n}\n\nfunction safePublish(cfg: FileChangePublisherConfig, channel: string, payload: FileChannelPayload, failMsg: string): void {\n  try {\n    cfg.publish(channel, payload);\n  } catch (err) {\n    cfg.warn?.(`${failMsg}; subscribers will miss this event`, { channel, error: errMsg(err) });\n  }\n}\n\nfunction errMsg(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n"],"mappings":";;;;;;AAmDA,IAAI,SAA2C;;AAG/C,SAAgB,6BAA6B,KAAsC;CACjF,SAAS;AACX;;AAGA,SAAgB,2BAAiC;CAC/C,SAAS;AACX;;AAGA,SAAgB,kBAAkB,OAAe,WAA2B;CAC1E,OAAO,UAAU,MAAM,QAAQ;AACjC;;;AAIA,eAAsB,kBAAkB,cAAqC;CAC3E,MAAM,MAAM;CACZ,IAAI,CAAC,KAAK;CAQV,MAAM,OAAO,UAAA,QAAK,QAAQ,IAAI,aAAa,IAAI,UAAA,QAAK;CACpD,MAAM,UAAU,UAAA,QAAK,KAAK,MAAM,YAAY;CAC5C,IAAI,CAAC,QAAQ,WAAW,IAAI,GAAG;EAC7B,IAAI,OAAO,mDAAmD,EAAE,MAAM,aAAa,CAAC;EACpF;CACF;CACA,IAAI;CACJ,IAAI;EACF,CAAC,CAAE,WAAY,OAAA,GAAA,iBAAA,KAAA,CAAW,OAAO;CACnC,SAAS,KAAK;EACZ,IAAI,OAAO,2CAA2C;GAAE,MAAM;GAAc,OAAO,OAAO,GAAG;EAAE,CAAC;EAChG,UAAU,KAAK,IAAI;CACrB;CACA,MAAM,YAAY,IAAI,QAAQ,YAAY;CAC1C,MAAM,UAA8B;EAAE,MAAM;EAAW;CAAQ;CAE/D,IAAI,IAAI,gBACN,YAAY,KAAK,IAAI,eAAe,SAAS,GAAG,SAAS,wBAAwB;CAEnF,KAAK,MAAM,EAAE,OAAO,aAAa,IAAI,gBAAgB,CAAC,GAAG;EACvD,IAAI,CAAC,QAAQ,SAAS,GAAG;EACzB,YAAY,KAAK,kBAAkB,OAAO,SAAS,GAAG,SAAS,GAAG,MAAM,uBAAuB;CACjG;CACA,IAAI,cAAc,WAAW,OAAO;AACtC;AAEA,SAAS,YAAY,KAAgC,SAAiB,SAA6B,SAAuB;CACxH,IAAI;EACF,IAAI,QAAQ,SAAS,OAAO;CAC9B,SAAS,KAAK;EACZ,IAAI,OAAO,GAAG,QAAQ,qCAAqC;GAAE;GAAS,OAAO,OAAO,GAAG;EAAE,CAAC;CAC5F;AACF;AAEA,SAAS,OAAO,KAAsB;CACpC,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD"}