@mulmoclaude/core 1.14.0 → 2.0.0

package/dist/atomic-C_7YpMiM.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"atomic-C_7YpMiM.cjs","names":[],"sources":["../src/files/atomic.ts"],"sourcesContent":["// rename(2) is atomic on POSIX; Node's Windows fallback (copy+unlink) is still safer than truncating in place.\n// Readers always see either the old file or the new — never a half-written one.\n//\n// Single source of truth for atomic file writes across the whole monorepo\n// (host, core, plugins). Previously copy-pasted four times, so a Windows retry\n// fix landed in only one (#2399, precedent #2222).\n\nimport { mkdirSync, promises, renameSync, unlinkSync, writeFileSync } from \"node:fs\";\nimport path from \"node:path\";\nimport { randomBytes } from \"node:crypto\";\n\nexport interface WriteAtomicOptions {\n  mode?: number;\n  /** Give the staging file a random suffix so concurrent writers to the same\n   *  destination can't collide at the OS layer.\n   *\n   *  Defaults to `true`, and opting out is almost always wrong. A shared\n   *  `${filePath}.tmp` means two writers of one file race: the second write\n   *  overwrites the first's staging file, or one rename/unlink pulls it out\n   *  from under the other, surfacing as `ENOENT … rename '<file>.tmp'`. That is\n   *  not theoretical — it fired in production on session meta, where ten\n   *  distinct callers (`setClaudeSessionId`, `backfillOrigin`,\n   *  `incrementUserQueryCount`, …) all write the same `<sessionId>.json`\n   *  (#2222).\n   *\n   *  Pass `false` only when you specifically need the staging path to be\n   *  predictable (e.g. a single-writer token file, or a test that pre-creates\n   *  it to force a write failure). */\n  uniqueTmp?: boolean;\n}\n\n// Unique staging names are the safe default: the cost is a random suffix, the\n// cost of the alternative is a lost update under concurrency (#2222).\nconst DEFAULT_UNIQUE_TMP = true;\n\nfunction tmpPathFor(filePath: string, uniqueTmp: boolean | undefined): string {\n  return (uniqueTmp ?? DEFAULT_UNIQUE_TMP) ? `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp` : `${filePath}.tmp`;\n}\n\n// On Windows, AV / Search Indexer / Defender briefly hold handles and rename trips EPERM/EBUSY/EACCES. Retry loop is\n// gated to Windows because POSIX EPERM means a real perm problem (read-only fs, sticky, cross-device) — retrying\n// just adds latency before the inevitable throw.\nconst IS_WINDOWS = process.platform === \"win32\";\nconst RENAME_RETRY_DELAYS_MS = [30, 100, 300] as const;\n\nfunction hasErrnoCode(err: unknown): err is { code: string } {\n  return typeof err === \"object\" && err !== null && \"code\" in err && typeof err.code === \"string\";\n}\n\n// `isWindows` is a parameter (defaulting to the real platform) so the safety-critical decision is testable on any OS.\nexport function isTransientRenameError(err: unknown, isWindows: boolean = IS_WINDOWS): boolean {\n  if (!isWindows || !hasErrnoCode(err)) return false;\n  return err.code === \"EPERM\" || err.code === \"EBUSY\" || err.code === \"EACCES\";\n}\n\n// Injectable so a test can drive the retry path (fail-then-succeed rename, no-op sleep, isWindows=true) on any OS.\nexport interface RenameRetryDeps {\n  rename: (fromPath: string, toPath: string) => Promise<void>;\n  sleep: (millis: number) => Promise<void>;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDeps: RenameRetryDeps = {\n  rename: (fromPath, toPath) => promises.rename(fromPath, toPath),\n  sleep: (millis) => new Promise((resolve) => setTimeout(resolve, millis)),\n  isWindows: IS_WINDOWS,\n};\n\nexport async function renameWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDeps = defaultRenameRetryDeps): Promise<void> {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      await deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      await deps.sleep(delayMs);\n    }\n  }\n  // Final attempt — let any error propagate.\n  await deps.rename(fromPath, toPath);\n}\n\n// Atomics.wait parks the thread instead of busy-spinning. Only on the Windows-rename retry path, total ≤ ~430ms.\nconst SYNC_SLEEP_BUF = new Int32Array(new SharedArrayBuffer(4));\nfunction sleepSync(millis: number): void {\n  Atomics.wait(SYNC_SLEEP_BUF, 0, 0, millis);\n}\n\n// Deliberate async/sync twin of RenameRetryDeps: `sleep` blocks the thread instead of returning a Promise.\nexport interface RenameRetryDepsSync {\n  rename: (fromPath: string, toPath: string) => void;\n  sleep: (millis: number) => void;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDepsSync: RenameRetryDepsSync = {\n  rename: (fromPath, toPath) => renameSync(fromPath, toPath),\n  sleep: sleepSync,\n  isWindows: IS_WINDOWS,\n};\n\nexport function renameSyncWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDepsSync = defaultRenameRetryDepsSync): void {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      deps.sleep(delayMs);\n    }\n  }\n  deps.rename(fromPath, toPath);\n}\n\n// Forcing utf-8 on a Uint8Array would re-encode the bytes — wrong for PNGs and other binary blobs.\nfunction writeOptionsFor(content: string | Uint8Array, mode: number | undefined): { encoding?: \"utf-8\"; mode?: number } {\n  return typeof content === \"string\" ? { encoding: \"utf-8\", mode } : { mode };\n}\n\nexport async function writeFileAtomic(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): Promise<void> {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  await promises.mkdir(path.dirname(filePath), { recursive: true });\n  try {\n    await promises.writeFile(tmp, content, writeOptionsFor(content, opts.mode));\n    await renameWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    await promises.unlink(tmp).catch(() => {});\n    throw err;\n  }\n}\n\nexport function writeFileAtomicSync(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): void {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  mkdirSync(path.dirname(filePath), { recursive: true });\n  try {\n    writeFileSync(tmp, content, writeOptionsFor(content, opts.mode));\n    renameSyncWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    try {\n      unlinkSync(tmp);\n    } catch {\n      // best-effort cleanup\n    }\n    throw err;\n  }\n}\n"],"mappings":";;;;;;AAiCA,IAAM,qBAAqB;AAE3B,SAAS,WAAW,UAAkB,WAAwC;CAC5E,OAAQ,aAAa,qBAAsB,GAAG,SAAS,IAAA,GAAA,YAAA,YAAA,CAAe,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,QAAQ,GAAG,SAAS;AAC/G;AAKA,IAAM,aAAa,QAAQ,aAAa;AACxC,IAAM,yBAAyB;CAAC;CAAI;CAAK;AAAG;AAE5C,SAAS,aAAa,KAAuC;CAC3D,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,OAAO,OAAO,IAAI,SAAS;AACzF;AAGA,SAAgB,uBAAuB,KAAc,YAAqB,YAAqB;CAC7F,IAAI,CAAC,aAAa,CAAC,aAAa,GAAG,GAAG,OAAO;CAC7C,OAAO,IAAI,SAAS,WAAW,IAAI,SAAS,WAAW,IAAI,SAAS;AACtE;AASA,IAAM,yBAA0C;CAC9C,SAAS,UAAU,WAAW,QAAA,SAAS,OAAO,UAAU,MAAM;CAC9D,QAAQ,WAAW,IAAI,SAAS,YAAY,WAAW,SAAS,MAAM,CAAC;CACvE,WAAW;AACb;AAEA,eAAsB,uBAAuB,UAAkB,QAAgB,OAAwB,wBAAuC;CAC5I,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,MAAM,KAAK,OAAO,UAAU,MAAM;EAClC;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,MAAM,KAAK,MAAM,OAAO;CAC1B;CAGF,MAAM,KAAK,OAAO,UAAU,MAAM;AACpC;AAGA,IAAM,iBAAiB,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC;AAC9D,SAAS,UAAU,QAAsB;CACvC,QAAQ,KAAK,gBAAgB,GAAG,GAAG,MAAM;AAC3C;AASA,IAAM,6BAAkD;CACtD,SAAS,UAAU,YAAA,GAAA,QAAA,WAAA,CAAsB,UAAU,MAAM;CACzD,OAAO;CACP,WAAW;AACb;AAEA,SAAgB,2BAA2B,UAAkB,QAAgB,OAA4B,4BAAkC;CACzI,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,KAAK,OAAO,UAAU,MAAM;EAC5B;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,KAAK,MAAM,OAAO;CACpB;CAEF,KAAK,OAAO,UAAU,MAAM;AAC9B;AAGA,SAAS,gBAAgB,SAA8B,MAAiE;CACtH,OAAO,OAAO,YAAY,WAAW;EAAE,UAAU;EAAS;CAAK,IAAI,EAAE,KAAK;AAC5E;AAEA,eAAsB,gBAAgB,UAAkB,SAA8B,OAA2B,CAAC,GAAkB;CAClI,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,MAAM,QAAA,SAAS,MAAM,UAAA,QAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAChE,IAAI;EACF,MAAM,QAAA,SAAS,UAAU,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC1E,MAAM,uBAAuB,KAAK,QAAQ;CAC5C,SAAS,KAAK;EACZ,MAAM,QAAA,SAAS,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;EACzC,MAAM;CACR;AACF;AAEA,SAAgB,oBAAoB,UAAkB,SAA8B,OAA2B,CAAC,GAAS;CACvH,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,CAAA,GAAA,QAAA,UAAA,CAAU,UAAA,QAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CACrD,IAAI;EACF,CAAA,GAAA,QAAA,cAAA,CAAc,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC/D,2BAA2B,KAAK,QAAQ;CAC1C,SAAS,KAAK;EACZ,IAAI;GACF,CAAA,GAAA,QAAA,WAAA,CAAW,GAAG;EAChB,QAAQ,CAER;EACA,MAAM;CACR;AACF"}
+{"version":3,"file":"atomic-C_7YpMiM.cjs","names":[],"sources":["../src/files/atomic.ts"],"sourcesContent":["// rename(2) is atomic on POSIX; Node's Windows fallback (copy+unlink) is still safer than truncating in place.\n// Readers always see either the old file or the new — never a half-written one.\n//\n// Single source of truth for atomic file writes across the whole monorepo\n// (host, core, plugins). Previously copy-pasted four times, so a Windows retry\n// fix landed in only one (#2399, precedent #2222).\n\nimport { mkdirSync, promises, renameSync, unlinkSync, writeFileSync } from \"node:fs\";\nimport path from \"node:path\";\nimport { randomBytes } from \"node:crypto\";\n\nexport interface WriteAtomicOptions {\n  mode?: number;\n  /** Give the staging file a random suffix so concurrent writers to the same\n   *  destination can't collide at the OS layer.\n   *\n   *  Defaults to `true`, and opting out is almost always wrong. A shared\n   *  `${filePath}.tmp` means two writers of one file race: the second write\n   *  overwrites the first's staging file, or one rename/unlink pulls it out\n   *  from under the other, surfacing as `ENOENT … rename '<file>.tmp'`. That is\n   *  not theoretical — it fired in production on session meta, where ten\n   *  distinct callers (`setClaudeSessionId`, `backfillOrigin`,\n   *  `incrementUserQueryCount`, …) all write the same `<sessionId>.json`\n   *  (#2222).\n   *\n   *  Pass `false` only when you specifically need the staging path to be\n   *  predictable (e.g. a single-writer token file, or a test that pre-creates\n   *  it to force a write failure). */\n  uniqueTmp?: boolean;\n}\n\n// Unique staging names are the safe default: the cost is a random suffix, the\n// cost of the alternative is a lost update under concurrency (#2222).\nconst DEFAULT_UNIQUE_TMP = true;\n\nfunction tmpPathFor(filePath: string, uniqueTmp: boolean | undefined): string {\n  return (uniqueTmp ?? DEFAULT_UNIQUE_TMP) ? `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp` : `${filePath}.tmp`;\n}\n\n// On Windows, AV / Search Indexer / Defender briefly hold handles and rename trips EPERM/EBUSY/EACCES. Retry loop is\n// gated to Windows because POSIX EPERM means a real perm problem (read-only fs, sticky, cross-device) — retrying\n// just adds latency before the inevitable throw.\nconst IS_WINDOWS = process.platform === \"win32\";\nconst RENAME_RETRY_DELAYS_MS = [30, 100, 300] as const;\n\nfunction hasErrnoCode(err: unknown): err is { code: string } {\n  return typeof err === \"object\" && err !== null && \"code\" in err && typeof err.code === \"string\";\n}\n\n// `isWindows` is a parameter (defaulting to the real platform) so the safety-critical decision is testable on any OS.\nexport function isTransientRenameError(err: unknown, isWindows: boolean = IS_WINDOWS): boolean {\n  if (!isWindows || !hasErrnoCode(err)) return false;\n  return err.code === \"EPERM\" || err.code === \"EBUSY\" || err.code === \"EACCES\";\n}\n\n// Injectable so a test can drive the retry path (fail-then-succeed rename, no-op sleep, isWindows=true) on any OS.\nexport interface RenameRetryDeps {\n  rename: (fromPath: string, toPath: string) => Promise<void>;\n  sleep: (millis: number) => Promise<void>;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDeps: RenameRetryDeps = {\n  rename: (fromPath, toPath) => promises.rename(fromPath, toPath),\n  sleep: (millis) => new Promise((resolve) => setTimeout(resolve, millis)),\n  isWindows: IS_WINDOWS,\n};\n\nexport async function renameWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDeps = defaultRenameRetryDeps): Promise<void> {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      await deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      await deps.sleep(delayMs);\n    }\n  }\n  // Final attempt — let any error propagate.\n  await deps.rename(fromPath, toPath);\n}\n\n// Atomics.wait parks the thread instead of busy-spinning. Only on the Windows-rename retry path, total ≤ ~430ms.\nconst SYNC_SLEEP_BUF = new Int32Array(new SharedArrayBuffer(4));\nfunction sleepSync(millis: number): void {\n  Atomics.wait(SYNC_SLEEP_BUF, 0, 0, millis);\n}\n\n// Deliberate async/sync twin of RenameRetryDeps: `sleep` blocks the thread instead of returning a Promise.\nexport interface RenameRetryDepsSync {\n  rename: (fromPath: string, toPath: string) => void;\n  sleep: (millis: number) => void;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDepsSync: RenameRetryDepsSync = {\n  rename: (fromPath, toPath) => renameSync(fromPath, toPath),\n  sleep: sleepSync,\n  isWindows: IS_WINDOWS,\n};\n\nexport function renameSyncWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDepsSync = defaultRenameRetryDepsSync): void {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      deps.sleep(delayMs);\n    }\n  }\n  deps.rename(fromPath, toPath);\n}\n\n// Forcing utf-8 on a Uint8Array would re-encode the bytes — wrong for PNGs and other binary blobs.\nfunction writeOptionsFor(content: string | Uint8Array, mode: number | undefined): { encoding?: \"utf-8\" | undefined; mode?: number | undefined } {\n  return typeof content === \"string\" ? { encoding: \"utf-8\", mode } : { mode };\n}\n\nexport async function writeFileAtomic(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): Promise<void> {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  await promises.mkdir(path.dirname(filePath), { recursive: true });\n  try {\n    await promises.writeFile(tmp, content, writeOptionsFor(content, opts.mode));\n    await renameWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    await promises.unlink(tmp).catch(() => {});\n    throw err;\n  }\n}\n\nexport function writeFileAtomicSync(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): void {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  mkdirSync(path.dirname(filePath), { recursive: true });\n  try {\n    writeFileSync(tmp, content, writeOptionsFor(content, opts.mode));\n    renameSyncWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    try {\n      unlinkSync(tmp);\n    } catch {\n      // best-effort cleanup\n    }\n    throw err;\n  }\n}\n"],"mappings":";;;;;;AAiCA,IAAM,qBAAqB;AAE3B,SAAS,WAAW,UAAkB,WAAwC;CAC5E,OAAQ,aAAa,qBAAsB,GAAG,SAAS,IAAA,GAAA,YAAA,YAAA,CAAe,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,QAAQ,GAAG,SAAS;AAC/G;AAKA,IAAM,aAAa,QAAQ,aAAa;AACxC,IAAM,yBAAyB;CAAC;CAAI;CAAK;AAAG;AAE5C,SAAS,aAAa,KAAuC;CAC3D,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,OAAO,OAAO,IAAI,SAAS;AACzF;AAGA,SAAgB,uBAAuB,KAAc,YAAqB,YAAqB;CAC7F,IAAI,CAAC,aAAa,CAAC,aAAa,GAAG,GAAG,OAAO;CAC7C,OAAO,IAAI,SAAS,WAAW,IAAI,SAAS,WAAW,IAAI,SAAS;AACtE;AASA,IAAM,yBAA0C;CAC9C,SAAS,UAAU,WAAW,QAAA,SAAS,OAAO,UAAU,MAAM;CAC9D,QAAQ,WAAW,IAAI,SAAS,YAAY,WAAW,SAAS,MAAM,CAAC;CACvE,WAAW;AACb;AAEA,eAAsB,uBAAuB,UAAkB,QAAgB,OAAwB,wBAAuC;CAC5I,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,MAAM,KAAK,OAAO,UAAU,MAAM;EAClC;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,MAAM,KAAK,MAAM,OAAO;CAC1B;CAGF,MAAM,KAAK,OAAO,UAAU,MAAM;AACpC;AAGA,IAAM,iBAAiB,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC;AAC9D,SAAS,UAAU,QAAsB;CACvC,QAAQ,KAAK,gBAAgB,GAAG,GAAG,MAAM;AAC3C;AASA,IAAM,6BAAkD;CACtD,SAAS,UAAU,YAAA,GAAA,QAAA,WAAA,CAAsB,UAAU,MAAM;CACzD,OAAO;CACP,WAAW;AACb;AAEA,SAAgB,2BAA2B,UAAkB,QAAgB,OAA4B,4BAAkC;CACzI,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,KAAK,OAAO,UAAU,MAAM;EAC5B;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,KAAK,MAAM,OAAO;CACpB;CAEF,KAAK,OAAO,UAAU,MAAM;AAC9B;AAGA,SAAS,gBAAgB,SAA8B,MAAyF;CAC9I,OAAO,OAAO,YAAY,WAAW;EAAE,UAAU;EAAS;CAAK,IAAI,EAAE,KAAK;AAC5E;AAEA,eAAsB,gBAAgB,UAAkB,SAA8B,OAA2B,CAAC,GAAkB;CAClI,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,MAAM,QAAA,SAAS,MAAM,UAAA,QAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAChE,IAAI;EACF,MAAM,QAAA,SAAS,UAAU,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC1E,MAAM,uBAAuB,KAAK,QAAQ;CAC5C,SAAS,KAAK;EACZ,MAAM,QAAA,SAAS,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;EACzC,MAAM;CACR;AACF;AAEA,SAAgB,oBAAoB,UAAkB,SAA8B,OAA2B,CAAC,GAAS;CACvH,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,CAAA,GAAA,QAAA,UAAA,CAAU,UAAA,QAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CACrD,IAAI;EACF,CAAA,GAAA,QAAA,cAAA,CAAc,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC/D,2BAA2B,KAAK,QAAQ;CAC1C,SAAS,KAAK;EACZ,IAAI;GACF,CAAA,GAAA,QAAA,WAAA,CAAW,GAAG;EAChB,QAAQ,CAER;EACA,MAAM;CACR;AACF"}

package/dist/atomic-DPpdrJzO.js.map

@@ -1 +1 @@
-{"version":3,"file":"atomic-DPpdrJzO.js","names":[],"sources":["../src/files/atomic.ts"],"sourcesContent":["// rename(2) is atomic on POSIX; Node's Windows fallback (copy+unlink) is still safer than truncating in place.\n// Readers always see either the old file or the new — never a half-written one.\n//\n// Single source of truth for atomic file writes across the whole monorepo\n// (host, core, plugins). Previously copy-pasted four times, so a Windows retry\n// fix landed in only one (#2399, precedent #2222).\n\nimport { mkdirSync, promises, renameSync, unlinkSync, writeFileSync } from \"node:fs\";\nimport path from \"node:path\";\nimport { randomBytes } from \"node:crypto\";\n\nexport interface WriteAtomicOptions {\n  mode?: number;\n  /** Give the staging file a random suffix so concurrent writers to the same\n   *  destination can't collide at the OS layer.\n   *\n   *  Defaults to `true`, and opting out is almost always wrong. A shared\n   *  `${filePath}.tmp` means two writers of one file race: the second write\n   *  overwrites the first's staging file, or one rename/unlink pulls it out\n   *  from under the other, surfacing as `ENOENT … rename '<file>.tmp'`. That is\n   *  not theoretical — it fired in production on session meta, where ten\n   *  distinct callers (`setClaudeSessionId`, `backfillOrigin`,\n   *  `incrementUserQueryCount`, …) all write the same `<sessionId>.json`\n   *  (#2222).\n   *\n   *  Pass `false` only when you specifically need the staging path to be\n   *  predictable (e.g. a single-writer token file, or a test that pre-creates\n   *  it to force a write failure). */\n  uniqueTmp?: boolean;\n}\n\n// Unique staging names are the safe default: the cost is a random suffix, the\n// cost of the alternative is a lost update under concurrency (#2222).\nconst DEFAULT_UNIQUE_TMP = true;\n\nfunction tmpPathFor(filePath: string, uniqueTmp: boolean | undefined): string {\n  return (uniqueTmp ?? DEFAULT_UNIQUE_TMP) ? `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp` : `${filePath}.tmp`;\n}\n\n// On Windows, AV / Search Indexer / Defender briefly hold handles and rename trips EPERM/EBUSY/EACCES. Retry loop is\n// gated to Windows because POSIX EPERM means a real perm problem (read-only fs, sticky, cross-device) — retrying\n// just adds latency before the inevitable throw.\nconst IS_WINDOWS = process.platform === \"win32\";\nconst RENAME_RETRY_DELAYS_MS = [30, 100, 300] as const;\n\nfunction hasErrnoCode(err: unknown): err is { code: string } {\n  return typeof err === \"object\" && err !== null && \"code\" in err && typeof err.code === \"string\";\n}\n\n// `isWindows` is a parameter (defaulting to the real platform) so the safety-critical decision is testable on any OS.\nexport function isTransientRenameError(err: unknown, isWindows: boolean = IS_WINDOWS): boolean {\n  if (!isWindows || !hasErrnoCode(err)) return false;\n  return err.code === \"EPERM\" || err.code === \"EBUSY\" || err.code === \"EACCES\";\n}\n\n// Injectable so a test can drive the retry path (fail-then-succeed rename, no-op sleep, isWindows=true) on any OS.\nexport interface RenameRetryDeps {\n  rename: (fromPath: string, toPath: string) => Promise<void>;\n  sleep: (millis: number) => Promise<void>;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDeps: RenameRetryDeps = {\n  rename: (fromPath, toPath) => promises.rename(fromPath, toPath),\n  sleep: (millis) => new Promise((resolve) => setTimeout(resolve, millis)),\n  isWindows: IS_WINDOWS,\n};\n\nexport async function renameWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDeps = defaultRenameRetryDeps): Promise<void> {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      await deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      await deps.sleep(delayMs);\n    }\n  }\n  // Final attempt — let any error propagate.\n  await deps.rename(fromPath, toPath);\n}\n\n// Atomics.wait parks the thread instead of busy-spinning. Only on the Windows-rename retry path, total ≤ ~430ms.\nconst SYNC_SLEEP_BUF = new Int32Array(new SharedArrayBuffer(4));\nfunction sleepSync(millis: number): void {\n  Atomics.wait(SYNC_SLEEP_BUF, 0, 0, millis);\n}\n\n// Deliberate async/sync twin of RenameRetryDeps: `sleep` blocks the thread instead of returning a Promise.\nexport interface RenameRetryDepsSync {\n  rename: (fromPath: string, toPath: string) => void;\n  sleep: (millis: number) => void;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDepsSync: RenameRetryDepsSync = {\n  rename: (fromPath, toPath) => renameSync(fromPath, toPath),\n  sleep: sleepSync,\n  isWindows: IS_WINDOWS,\n};\n\nexport function renameSyncWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDepsSync = defaultRenameRetryDepsSync): void {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      deps.sleep(delayMs);\n    }\n  }\n  deps.rename(fromPath, toPath);\n}\n\n// Forcing utf-8 on a Uint8Array would re-encode the bytes — wrong for PNGs and other binary blobs.\nfunction writeOptionsFor(content: string | Uint8Array, mode: number | undefined): { encoding?: \"utf-8\"; mode?: number } {\n  return typeof content === \"string\" ? { encoding: \"utf-8\", mode } : { mode };\n}\n\nexport async function writeFileAtomic(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): Promise<void> {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  await promises.mkdir(path.dirname(filePath), { recursive: true });\n  try {\n    await promises.writeFile(tmp, content, writeOptionsFor(content, opts.mode));\n    await renameWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    await promises.unlink(tmp).catch(() => {});\n    throw err;\n  }\n}\n\nexport function writeFileAtomicSync(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): void {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  mkdirSync(path.dirname(filePath), { recursive: true });\n  try {\n    writeFileSync(tmp, content, writeOptionsFor(content, opts.mode));\n    renameSyncWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    try {\n      unlinkSync(tmp);\n    } catch {\n      // best-effort cleanup\n    }\n    throw err;\n  }\n}\n"],"mappings":";;;;AAiCA,IAAM,qBAAqB;AAE3B,SAAS,WAAW,UAAkB,WAAwC;CAC5E,OAAQ,aAAa,qBAAsB,GAAG,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,QAAQ,GAAG,SAAS;AAC/G;AAKA,IAAM,aAAa,QAAQ,aAAa;AACxC,IAAM,yBAAyB;CAAC;CAAI;CAAK;AAAG;AAE5C,SAAS,aAAa,KAAuC;CAC3D,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,OAAO,OAAO,IAAI,SAAS;AACzF;AAGA,SAAgB,uBAAuB,KAAc,YAAqB,YAAqB;CAC7F,IAAI,CAAC,aAAa,CAAC,aAAa,GAAG,GAAG,OAAO;CAC7C,OAAO,IAAI,SAAS,WAAW,IAAI,SAAS,WAAW,IAAI,SAAS;AACtE;AASA,IAAM,yBAA0C;CAC9C,SAAS,UAAU,WAAW,SAAS,OAAO,UAAU,MAAM;CAC9D,QAAQ,WAAW,IAAI,SAAS,YAAY,WAAW,SAAS,MAAM,CAAC;CACvE,WAAW;AACb;AAEA,eAAsB,uBAAuB,UAAkB,QAAgB,OAAwB,wBAAuC;CAC5I,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,MAAM,KAAK,OAAO,UAAU,MAAM;EAClC;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,MAAM,KAAK,MAAM,OAAO;CAC1B;CAGF,MAAM,KAAK,OAAO,UAAU,MAAM;AACpC;AAGA,IAAM,iBAAiB,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC;AAC9D,SAAS,UAAU,QAAsB;CACvC,QAAQ,KAAK,gBAAgB,GAAG,GAAG,MAAM;AAC3C;AASA,IAAM,6BAAkD;CACtD,SAAS,UAAU,WAAW,WAAW,UAAU,MAAM;CACzD,OAAO;CACP,WAAW;AACb;AAEA,SAAgB,2BAA2B,UAAkB,QAAgB,OAA4B,4BAAkC;CACzI,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,KAAK,OAAO,UAAU,MAAM;EAC5B;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,KAAK,MAAM,OAAO;CACpB;CAEF,KAAK,OAAO,UAAU,MAAM;AAC9B;AAGA,SAAS,gBAAgB,SAA8B,MAAiE;CACtH,OAAO,OAAO,YAAY,WAAW;EAAE,UAAU;EAAS;CAAK,IAAI,EAAE,KAAK;AAC5E;AAEA,eAAsB,gBAAgB,UAAkB,SAA8B,OAA2B,CAAC,GAAkB;CAClI,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,MAAM,SAAS,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAChE,IAAI;EACF,MAAM,SAAS,UAAU,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC1E,MAAM,uBAAuB,KAAK,QAAQ;CAC5C,SAAS,KAAK;EACZ,MAAM,SAAS,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;EACzC,MAAM;CACR;AACF;AAEA,SAAgB,oBAAoB,UAAkB,SAA8B,OAA2B,CAAC,GAAS;CACvH,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,UAAU,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CACrD,IAAI;EACF,cAAc,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC/D,2BAA2B,KAAK,QAAQ;CAC1C,SAAS,KAAK;EACZ,IAAI;GACF,WAAW,GAAG;EAChB,QAAQ,CAER;EACA,MAAM;CACR;AACF"}
+{"version":3,"file":"atomic-DPpdrJzO.js","names":[],"sources":["../src/files/atomic.ts"],"sourcesContent":["// rename(2) is atomic on POSIX; Node's Windows fallback (copy+unlink) is still safer than truncating in place.\n// Readers always see either the old file or the new — never a half-written one.\n//\n// Single source of truth for atomic file writes across the whole monorepo\n// (host, core, plugins). Previously copy-pasted four times, so a Windows retry\n// fix landed in only one (#2399, precedent #2222).\n\nimport { mkdirSync, promises, renameSync, unlinkSync, writeFileSync } from \"node:fs\";\nimport path from \"node:path\";\nimport { randomBytes } from \"node:crypto\";\n\nexport interface WriteAtomicOptions {\n  mode?: number;\n  /** Give the staging file a random suffix so concurrent writers to the same\n   *  destination can't collide at the OS layer.\n   *\n   *  Defaults to `true`, and opting out is almost always wrong. A shared\n   *  `${filePath}.tmp` means two writers of one file race: the second write\n   *  overwrites the first's staging file, or one rename/unlink pulls it out\n   *  from under the other, surfacing as `ENOENT … rename '<file>.tmp'`. That is\n   *  not theoretical — it fired in production on session meta, where ten\n   *  distinct callers (`setClaudeSessionId`, `backfillOrigin`,\n   *  `incrementUserQueryCount`, …) all write the same `<sessionId>.json`\n   *  (#2222).\n   *\n   *  Pass `false` only when you specifically need the staging path to be\n   *  predictable (e.g. a single-writer token file, or a test that pre-creates\n   *  it to force a write failure). */\n  uniqueTmp?: boolean;\n}\n\n// Unique staging names are the safe default: the cost is a random suffix, the\n// cost of the alternative is a lost update under concurrency (#2222).\nconst DEFAULT_UNIQUE_TMP = true;\n\nfunction tmpPathFor(filePath: string, uniqueTmp: boolean | undefined): string {\n  return (uniqueTmp ?? DEFAULT_UNIQUE_TMP) ? `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp` : `${filePath}.tmp`;\n}\n\n// On Windows, AV / Search Indexer / Defender briefly hold handles and rename trips EPERM/EBUSY/EACCES. Retry loop is\n// gated to Windows because POSIX EPERM means a real perm problem (read-only fs, sticky, cross-device) — retrying\n// just adds latency before the inevitable throw.\nconst IS_WINDOWS = process.platform === \"win32\";\nconst RENAME_RETRY_DELAYS_MS = [30, 100, 300] as const;\n\nfunction hasErrnoCode(err: unknown): err is { code: string } {\n  return typeof err === \"object\" && err !== null && \"code\" in err && typeof err.code === \"string\";\n}\n\n// `isWindows` is a parameter (defaulting to the real platform) so the safety-critical decision is testable on any OS.\nexport function isTransientRenameError(err: unknown, isWindows: boolean = IS_WINDOWS): boolean {\n  if (!isWindows || !hasErrnoCode(err)) return false;\n  return err.code === \"EPERM\" || err.code === \"EBUSY\" || err.code === \"EACCES\";\n}\n\n// Injectable so a test can drive the retry path (fail-then-succeed rename, no-op sleep, isWindows=true) on any OS.\nexport interface RenameRetryDeps {\n  rename: (fromPath: string, toPath: string) => Promise<void>;\n  sleep: (millis: number) => Promise<void>;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDeps: RenameRetryDeps = {\n  rename: (fromPath, toPath) => promises.rename(fromPath, toPath),\n  sleep: (millis) => new Promise((resolve) => setTimeout(resolve, millis)),\n  isWindows: IS_WINDOWS,\n};\n\nexport async function renameWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDeps = defaultRenameRetryDeps): Promise<void> {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      await deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      await deps.sleep(delayMs);\n    }\n  }\n  // Final attempt — let any error propagate.\n  await deps.rename(fromPath, toPath);\n}\n\n// Atomics.wait parks the thread instead of busy-spinning. Only on the Windows-rename retry path, total ≤ ~430ms.\nconst SYNC_SLEEP_BUF = new Int32Array(new SharedArrayBuffer(4));\nfunction sleepSync(millis: number): void {\n  Atomics.wait(SYNC_SLEEP_BUF, 0, 0, millis);\n}\n\n// Deliberate async/sync twin of RenameRetryDeps: `sleep` blocks the thread instead of returning a Promise.\nexport interface RenameRetryDepsSync {\n  rename: (fromPath: string, toPath: string) => void;\n  sleep: (millis: number) => void;\n  isWindows: boolean;\n}\n\nconst defaultRenameRetryDepsSync: RenameRetryDepsSync = {\n  rename: (fromPath, toPath) => renameSync(fromPath, toPath),\n  sleep: sleepSync,\n  isWindows: IS_WINDOWS,\n};\n\nexport function renameSyncWithWindowsRetry(fromPath: string, toPath: string, deps: RenameRetryDepsSync = defaultRenameRetryDepsSync): void {\n  for (const delayMs of RENAME_RETRY_DELAYS_MS) {\n    try {\n      deps.rename(fromPath, toPath);\n      return;\n    } catch (err) {\n      if (!isTransientRenameError(err, deps.isWindows)) throw err;\n      deps.sleep(delayMs);\n    }\n  }\n  deps.rename(fromPath, toPath);\n}\n\n// Forcing utf-8 on a Uint8Array would re-encode the bytes — wrong for PNGs and other binary blobs.\nfunction writeOptionsFor(content: string | Uint8Array, mode: number | undefined): { encoding?: \"utf-8\" | undefined; mode?: number | undefined } {\n  return typeof content === \"string\" ? { encoding: \"utf-8\", mode } : { mode };\n}\n\nexport async function writeFileAtomic(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): Promise<void> {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  await promises.mkdir(path.dirname(filePath), { recursive: true });\n  try {\n    await promises.writeFile(tmp, content, writeOptionsFor(content, opts.mode));\n    await renameWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    await promises.unlink(tmp).catch(() => {});\n    throw err;\n  }\n}\n\nexport function writeFileAtomicSync(filePath: string, content: string | Uint8Array, opts: WriteAtomicOptions = {}): void {\n  const tmp = tmpPathFor(filePath, opts.uniqueTmp);\n  mkdirSync(path.dirname(filePath), { recursive: true });\n  try {\n    writeFileSync(tmp, content, writeOptionsFor(content, opts.mode));\n    renameSyncWithWindowsRetry(tmp, filePath);\n  } catch (err) {\n    try {\n      unlinkSync(tmp);\n    } catch {\n      // best-effort cleanup\n    }\n    throw err;\n  }\n}\n"],"mappings":";;;;AAiCA,IAAM,qBAAqB;AAE3B,SAAS,WAAW,UAAkB,WAAwC;CAC5E,OAAQ,aAAa,qBAAsB,GAAG,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,QAAQ,GAAG,SAAS;AAC/G;AAKA,IAAM,aAAa,QAAQ,aAAa;AACxC,IAAM,yBAAyB;CAAC;CAAI;CAAK;AAAG;AAE5C,SAAS,aAAa,KAAuC;CAC3D,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,OAAO,OAAO,IAAI,SAAS;AACzF;AAGA,SAAgB,uBAAuB,KAAc,YAAqB,YAAqB;CAC7F,IAAI,CAAC,aAAa,CAAC,aAAa,GAAG,GAAG,OAAO;CAC7C,OAAO,IAAI,SAAS,WAAW,IAAI,SAAS,WAAW,IAAI,SAAS;AACtE;AASA,IAAM,yBAA0C;CAC9C,SAAS,UAAU,WAAW,SAAS,OAAO,UAAU,MAAM;CAC9D,QAAQ,WAAW,IAAI,SAAS,YAAY,WAAW,SAAS,MAAM,CAAC;CACvE,WAAW;AACb;AAEA,eAAsB,uBAAuB,UAAkB,QAAgB,OAAwB,wBAAuC;CAC5I,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,MAAM,KAAK,OAAO,UAAU,MAAM;EAClC;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,MAAM,KAAK,MAAM,OAAO;CAC1B;CAGF,MAAM,KAAK,OAAO,UAAU,MAAM;AACpC;AAGA,IAAM,iBAAiB,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC;AAC9D,SAAS,UAAU,QAAsB;CACvC,QAAQ,KAAK,gBAAgB,GAAG,GAAG,MAAM;AAC3C;AASA,IAAM,6BAAkD;CACtD,SAAS,UAAU,WAAW,WAAW,UAAU,MAAM;CACzD,OAAO;CACP,WAAW;AACb;AAEA,SAAgB,2BAA2B,UAAkB,QAAgB,OAA4B,4BAAkC;CACzI,KAAK,MAAM,WAAW,wBACpB,IAAI;EACF,KAAK,OAAO,UAAU,MAAM;EAC5B;CACF,SAAS,KAAK;EACZ,IAAI,CAAC,uBAAuB,KAAK,KAAK,SAAS,GAAG,MAAM;EACxD,KAAK,MAAM,OAAO;CACpB;CAEF,KAAK,OAAO,UAAU,MAAM;AAC9B;AAGA,SAAS,gBAAgB,SAA8B,MAAyF;CAC9I,OAAO,OAAO,YAAY,WAAW;EAAE,UAAU;EAAS;CAAK,IAAI,EAAE,KAAK;AAC5E;AAEA,eAAsB,gBAAgB,UAAkB,SAA8B,OAA2B,CAAC,GAAkB;CAClI,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,MAAM,SAAS,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CAChE,IAAI;EACF,MAAM,SAAS,UAAU,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC1E,MAAM,uBAAuB,KAAK,QAAQ;CAC5C,SAAS,KAAK;EACZ,MAAM,SAAS,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;EACzC,MAAM;CACR;AACF;AAEA,SAAgB,oBAAoB,UAAkB,SAA8B,OAA2B,CAAC,GAAS;CACvH,MAAM,MAAM,WAAW,UAAU,KAAK,SAAS;CAC/C,UAAU,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;CACrD,IAAI;EACF,cAAc,KAAK,SAAS,gBAAgB,SAAS,KAAK,IAAI,CAAC;EAC/D,2BAA2B,KAAK,QAAQ;CAC1C,SAAS,KAAK;EACZ,IAAI;GACF,WAAW,GAAG;EAChB,QAAQ,CAER;EACA,MAAM;CACR;AACF"}

package/dist/{calendarGrid-DivcNKkX.js → calendarGrid-Csy2rpjp.js}

@@ -208,7 +208,8 @@ function parseTimeRange(value) {
 	if (tokens.length === 0) return null;
 	const minutesOf = (match) => clockToMinutes(Number(match[1]), Number(match[2]));
 	if (!RANGE_SEP_RE.test(text)) {
-		const startMin = minutesOf(tokens[0]);
+		const [firstToken] = tokens;
+		const startMin = firstToken ? minutesOf(firstToken) : null;
 		return startMin === null ? null : {
 			startMin,
 			endMin: null
@@ -354,35 +355,64 @@ function daySlice(span, day) {
 		bleedsAfter: !isEndDay
 	};
 }
+function sortByStart(blocks) {
+	return [...blocks.entries()].map(([index, span]) => ({
+		index,
+		span
+	})).sort((left, right) => left.span.startMin - right.span.startMin || left.span.endMin - right.span.endMin);
+}
+/** Cut the start-ordered blocks into overlap clusters: a new cluster begins at
+*  the first block that starts at or after every earlier block has ended. */
+function splitClusters(ordered) {
+	const initial = {
+		done: [],
+		current: [],
+		end: Number.NEGATIVE_INFINITY
+	};
+	const state = ordered.reduce((acc, block) => {
+		if (acc.current.length > 0 && block.span.startMin >= acc.end) {
+			acc.done.push(acc.current);
+			return {
+				done: acc.done,
+				current: [block],
+				end: block.span.endMin
+			};
+		}
+		acc.current.push(block);
+		return {
+			done: acc.done,
+			current: acc.current,
+			end: Math.max(acc.end, block.span.endMin)
+		};
+	}, initial);
+	if (state.current.length > 0) state.done.push(state.current);
+	return state.done;
+}
+/** Greedy lane packing inside one cluster: reuse the first lane already free at
+*  this block's start, else open a new one. Every member reports the cluster's
+*  final lane count so a renderer can size each block to `1 / lanes`. */
+function packCluster(cluster) {
+	const laneEnds = [];
+	return cluster.map(({ index, span }) => {
+		const reusable = laneEnds.findIndex((end) => end <= span.startMin);
+		const lane = reusable === -1 ? laneEnds.length : reusable;
+		laneEnds[lane] = span.endMin;
+		return {
+			index,
+			lane
+		};
+	}).map(({ index, lane }) => [index, {
+		lane,
+		lanes: laneEnds.length
+	}]);
+}
 function assignLanes(blocks) {
-	const order = [...blocks.keys()].sort((left, right) => blocks[left].startMin - blocks[right].startMin || blocks[left].endMin - blocks[right].endMin);
-	const result = blocks.map(() => ({
+	const clusters = splitClusters(sortByStart(blocks));
+	const assignments = new Map(clusters.flatMap(packCluster));
+	return blocks.map((_, index) => assignments.get(index) ?? {
 		lane: 0,
 		lanes: 1
-	}));
-	let cluster = [];
-	let clusterEnd = Number.NEGATIVE_INFINITY;
-	const laneEnds = [];
-	const flush = () => {
-		for (const index of cluster) result[index].lanes = laneEnds.length;
-		cluster = [];
-		laneEnds.length = 0;
-		clusterEnd = Number.NEGATIVE_INFINITY;
-	};
-	for (const index of order) {
-		const block = blocks[index];
-		if (cluster.length > 0 && block.startMin >= clusterEnd) flush();
-		let lane = laneEnds.findIndex((end) => end <= block.startMin);
-		if (lane === -1) {
-			lane = laneEnds.length;
-			laneEnds.push(block.endMin);
-		} else laneEnds[lane] = block.endMin;
-		result[index].lane = lane;
-		cluster.push(index);
-		clusterEnd = Math.max(clusterEnd, block.endMin);
-	}
-	flush();
-	return result;
+	});
 }
 /** Month label key inputs — returns the 1st of the month as a `Date` so the
 *  component can feed it to `Intl.DateTimeFormat(locale, …)` for a localized
@@ -393,4 +423,4 @@ function monthAnchorDate(year, month) {
 //#endregion
 export { fieldTextOrNull as A, FEED_SCHEDULES as C, isReadOnlySchema as D, isFieldDrivenEvery as E, storageKindFor as O, COMPUTED_TYPES as S, embedTargetId as T, generateUniqueId as _, compareYmd as a, nextUniqueItemId as b, monthAnchorDate as c, parseTimeRange as d, recordSpan as f, SAFE_SLUG_PATTERN as g, SAFE_RECORD_ID_PATTERN as h, buildMonthGrid as i, fieldText as k, parseIsoDate as l, ymdKey as m, assignLanes as n, dateOf as o, spanCoversDay as p, bucketRecords as r, daySlice as s, MINUTES_PER_DAY as t, parseIsoDateTime as u, isSafeRecordId as v, INGEST_KINDS as w, AGENT_INGEST_KIND as x, isSafeSlug as y };
 
-//# sourceMappingURL=calendarGrid-DivcNKkX.js.map
+//# sourceMappingURL=calendarGrid-Csy2rpjp.js.map

package/dist/{calendarGrid-DivcNKkX.js.map → calendarGrid-Csy2rpjp.js.map}

@@ -1 +1 @@
-{"version":3,"file":"calendarGrid-DivcNKkX.js","names":[],"sources":["../src/collection/core/fieldText.ts","../src/collection/core/schema.ts","../src/collection/core/ids.ts","../src/collection/core/calendarGrid.ts"],"sourcesContent":["// Turning a record field into text.\n//\n// `CollectionItem` is `Record<string, unknown>`, so a field holds whatever the\n// record's JSON had — including arrays and objects (real workspace data has\n// plenty: weather `hourly`, GeoJSON `geometry`, `sites` lists). Bare\n// `String(value)` on one of those yields `\"[object Object]\"`, which then gets\n// compared, matched or displayed as if it were a value. Nothing throws; a\n// predicate just silently stops matching, or the UI shows `[object Object]`.\n//\n// These two helpers are the only sanctioned way to read a field as text. The\n// rule they encode was already in `itemLabelOf`: accept primitives, let\n// everything else fall through to the caller's fallback.\n\n/** A field value that has a meaningful text form. Dates are included because\n *  a JSON record can carry one once it has been revived. */\nconst isTextable = (value: unknown): value is string | number | boolean | Date =>\n  typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\" || value instanceof Date;\n\n/** The field's text, or `null` when it has no meaningful one (absent, or an\n *  array/object that would stringify to `\"[object Object]\"`).\n *\n *  Returning `null` rather than `\"\"` keeps \"the field is empty\" distinct from\n *  \"the field can't be text\" — a matcher must not treat an object-valued field\n *  as an empty string and match `\"\"`. */\nexport function fieldTextOrNull(value: unknown): string | null {\n  if (value === undefined || value === null) return null;\n  if (!isTextable(value)) return null;\n  if (value instanceof Date) {\n    // `new Date(\"nonsense\")` is still `instanceof Date`, and `toISOString()`\n    // throws `RangeError` on it. This helper sits on the match, sort and\n    // display paths, so one unparseable date in one record would take the whole\n    // render down — the loud version of the bug this module exists to prevent.\n    return Number.isNaN(value.getTime()) ? null : value.toISOString();\n  }\n  return String(value);\n}\n\n/** The field's text, or `fallback` (default `\"\"`) when it has none. Use where\n *  a string is required and an empty one is a safe stand-in — display, sort\n *  keys, CSV cells. Where the distinction matters, use {@link fieldTextOrNull}. */\nexport function fieldText(value: unknown, fallback = \"\"): string {\n  return fieldTextOrNull(value) ?? fallback;\n}\n","// 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// SINGLE SOURCE OF TRUTH: every type describing the schema.json contract is\n// derived (`z.infer`) from the zod definitions in `./schemaZ` — the shapes,\n// their doc comments, and the validation rules live THERE; this module only\n// re-derives the TypeScript names consumers import. The imports from\n// `./schemaZ` are type-only, so zod never reaches the browser bundle through\n// the isomorphic barrel; at runtime the dependency points the other way\n// (schemaZ imports this module's consts).\n//\n// Field specs are a DISCRIMINATED UNION on `type`: narrow with\n// `field.type === \"enum\"` (etc.) before reading a variant key like `values`,\n// `to`, `formula`, or `of`.\n\nimport { fieldText } from \"./fieldText\";\nimport type { z } from \"zod\";\nimport type {\n  ActionSpecZ,\n  CollectionSchemaZ,\n  CustomViewZ,\n  DataSourceZ,\n  DynamicIconRuleZ,\n  DynamicIconSourceZ,\n  DynamicIconSpecZ,\n  EveryFieldDrivenZ,\n  EveryLiteralZ,\n  EveryZ,\n  FieldSpecZ,\n  IngestZ,\n  SpawnZ,\n  StorageZ,\n  SubFieldSpecZ,\n  WhenZ,\n} from \"./schemaZ\";\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 `feeds/ingestTypes.ts`) is a subtype, so feed code\n *  reads the extra fields by typing feed schemas with that subtype;\n *  collection rendering only needs 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\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/** One field of a record — a discriminated union on `type`; see the variant\n *  docs in `./schemaZ` (`FieldSpecZ`). */\nexport type CollectionFieldSpec = z.infer<typeof FieldSpecZ>;\n\n/** A `table` field's row sub-schema entry — the field union minus `table` /\n *  `derived` / display-only types (see `SubFieldSpecZ`). */\nexport type CollectionSubFieldSpec = z.infer<typeof SubFieldSpecZ>;\n\nexport type CollectionFieldType = CollectionFieldSpec[\"type\"];\n\n/** The computed-boolean variant — a `where` predicate bound to a field\n *  name; see `FlagFieldZ`. */\nexport type CollectionFlagField = Extract<CollectionFieldSpec, { type: \"flag\" }>;\n\n/** derived/embed/backlinks/rollup/toggle/flag are host-computed or\n *  projected — never written to the record JSON, so required / value\n *  checks and edit-draft slots must not apply to them. THE single source\n *  for \"computed\" — lives here (zod-free at runtime) so browser code\n *  (`./draft`) and the zod record compiler (`./recordZ`, which re-exports\n *  it) share one set instead of drifting copies. */\nexport const COMPUTED_TYPES: ReadonlySet<CollectionFieldType> = new Set<CollectionFieldType>([\"derived\", \"embed\", \"backlinks\", \"rollup\", \"toggle\", \"flag\"]);\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 type CollectionWhen = z.infer<typeof WhenZ>;\n\n/** @deprecated Name retained for back-compat; use {@link CollectionWhen}.\n *  Both actions and fields share the same predicate shape. No in-repo\n *  consumers, but the package is public API (MulmoTerminal). */\n// eslint-disable-next-line sonarjs/redundant-type-aliases -- deliberate deprecated back-compat export\nexport type CollectionActionWhen = CollectionWhen;\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 — or the declarative `set`) live in the schema / skill\n *  folder, so the host stays generic. A discriminated union on `kind`;\n *  see `ActionSpecZ`. */\nexport type CollectionAction = z.infer<typeof ActionSpecZ>;\n\n/** The kind of work an action kicks off: `\"chat\"` (visible LLM chat),\n *  `\"agent\"` (hidden LLM worker), or `\"mutate\"` (declarative host write,\n *  no LLM). */\nexport type CollectionActionKind = CollectionAction[\"kind\"];\n\n/** The LLM-seeded action variants (`role` + `template`). */\nexport type CollectionSeededAction = Extract<CollectionAction, { kind: \"chat\" | \"agent\" }>;\n\n/** The declarative host-write variant (`set` + optional `require`/`params`). */\nexport type CollectionMutateAction = Extract<CollectionAction, { kind: \"mutate\" }>;\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.\n *  See `CustomViewZ` for the per-key contracts. */\nexport type CollectionCustomView = z.infer<typeof CustomViewZ>;\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 = NonNullable<CollectionCustomView[\"capabilities\"]>[number];\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 type CollectionEvery = z.infer<typeof EveryLiteralZ>;\n\n/** Recurrence unit for a `spawn.every` advance. */\nexport type CollectionRecurUnit = CollectionEvery[\"unit\"];\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`. See\n *  `EveryFieldDrivenZ`. */\nexport type CollectionEveryFieldDriven = z.infer<typeof EveryFieldDrivenZ>;\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 = z.infer<typeof EveryZ>;\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. See `SpawnZ`. */\nexport type CollectionSpawn = z.infer<typeof SpawnZ>;\n\n/** One rule in a `dynamicIcon.rules` list: when the resolved source\n *  record matches `where` (an AND of typed conditions, see `./where`),\n *  the collection's effective launcher icon becomes `icon`. Evaluated top\n *  to bottom — the first match wins. */\nexport type DynamicIconRule = z.infer<typeof DynamicIconRuleZ>;\n\n/** Where a {@link DynamicIconSpec}'s source record comes from: a (possibly\n *  cross-collection) pool of records, optionally narrowed by `where` and\n *  reduced to a single record by `from`. */\nexport type DynamicIconSource = z.infer<typeof DynamicIconSourceZ>;\n\n/** Declarative \"data state → icon\" mapping for a collection's launcher\n *  shortcut icon (see `CollectionSchema.dynamicIcon`). When absent, the\n *  launcher icon is the static `schema.icon`. */\nexport type DynamicIconSpec = z.infer<typeof DynamicIconSpecZ>;\n\n/** The `ingest` block as the schema validator accepts it — a discriminated\n *  union on `kind` (declarative retrievers | agent worker). The feeds\n *  subsystem's `IngestSpec` is the same union under its historical name. */\nexport type CollectionIngestSpec = z.infer<typeof IngestZ>;\n\n/** The `dataSource` block: this collection's records are the rows of an\n *  external read-only data file (v1: CSV). See `DataSourceZ`. */\nexport type CollectionDataSource = z.infer<typeof DataSourceZ>;\n\n/** The `storage` block: an alternative WRITABLE record backend (v1:\n *  sqlite). See `StorageZ`. */\nexport type CollectionStorage = z.infer<typeof StorageZ>;\n\n/** Every storage backend a schema can select. `file` is the implicit\n *  default (`dataPath`); `csv` is implied by `dataSource`; other kinds are\n *  named explicitly via `storage.type`. The server's store factory registry\n *  (`server/store.ts`) is keyed by this. */\nexport type CollectionStorageKind = \"file\" | \"csv\" | \"sqlite\";\n\n/** Which storage backend serves this schema's records. Derived, not stored:\n *  existing schemas carry no `storage` key and must keep resolving exactly\n *  as before (`dataSource` ⇒ csv, else file). */\nexport function storageKindFor(schema: Pick<CollectionSchema, \"dataSource\" | \"storage\">): CollectionStorageKind {\n  if (schema.dataSource !== undefined) return \"csv\";\n  return schema.storage?.type ?? \"file\";\n}\n\n/** The whole `schema.json` contract. Key-level docs live on\n *  `CollectionSchemaZ` in `./schemaZ`. */\nexport type CollectionSchema = z.infer<typeof CollectionSchemaZ>;\n\n/** True when `schema` declares an external `dataSource` — i.e. the\n *  collection is READ-ONLY through every UI/tool write path (updates\n *  happen by editing/replacing the data file itself). Isomorphic: both\n *  the server write guards and the client's control hiding key off this\n *  one predicate. */\nexport function isReadOnlySchema(schema: Pick<CollectionSchema, \"dataSource\">): boolean {\n  return schema.dataSource !== undefined;\n}\n\nexport interface CollectionSummary {\n  slug: string;\n  title: string;\n  icon: string;\n  source: CollectionSource;\n  /** Present (true) when the collection is backed by an external\n   *  `dataSource` and therefore read-only in every UI/tool write path.\n   *  Absent-when-writable, matching the other optional summary flags. */\n  readonly?: true;\n  /** Slugs of the source collection(s) a `dynamicIcon` icon was computed\n   *  from — present only when `schema.dynamicIcon` is set. Lets a client\n   *  know which collection change-channel(s) to watch for a live icon\n   *  update (see `useDynamicShortcutIcons`). */\n  iconSources?: string[];\n}\n\nexport interface CollectionDetail extends CollectionSummary {\n  schema: CollectionSchema;\n}\n\nexport type CollectionItem = Record<string, unknown>;\n\n/** Resolve an `embed` field's target record id: the fixed `id`, or the value\n *  of the sibling `idField` on this record (empty string when neither applies\n *  — the caller renders that as \"no record\"). Pure + isomorphic so the server\n *  projection (`derive.ts`) and the client preview (`useCollectionRendering`)\n *  resolve embeds identically. Non-`embed` fields resolve to \"no record\". */\nexport function embedTargetId(field: CollectionFieldSpec, record: CollectionItem | null): string {\n  if (field.type !== \"embed\") return \"\";\n  if (field.id) return field.id;\n  if (field.idField && record) return fieldText(record[field.idField]);\n  return \"\";\n}\n","// Pure slug / record-id character rules. Shared by the isomorphic schema\n// validator (`./schemaZ`) — which must stay node-free — and the server-side\n// path sanitisers (`../server/paths`), which wrap these patterns with the\n// `path.basename` round-trip CodeQL recognises as a `js/path-injection`\n// sanitiser. Both layers MUST gate on the same patterns; importing them from\n// here is what keeps them in sync.\n\n// The ONE slug pattern — `server/workspace/skills/catalog.ts` imports it\n// for its own sanitiser, so there is no second copy to keep in sync.\n// Bounded character classes, no nested quantifiers; ReDoS-safe.\nimport { fieldText } from \"./fieldText\";\nimport type { CollectionItem } from \"./schema\";\n\n// eslint-disable-next-line security/detect-unsafe-regex -- non-overlapping character classes, no catastrophic backtracking\nexport const SAFE_SLUG_PATTERN = /^[a-zA-Z0-9](?:[a-zA-Z0-9_-]*[a-zA-Z0-9])?$/;\n\n// Record ids are a superset of slugs: they're only ever filename stems\n// (`<id>.json`), never directory names or URL segments, so they may carry\n// dots — natural keys like a Slack ts (`1718900000.123456`), a SemVer\n// (`1.2.3`), or a decimal timestamp. The interior class adds `.` to the slug\n// set; the explicit `..` reject in `isSafeRecordId` keeps a\n// parent-dir-looking segment out while still allowing repeated `-`/`_`\n// (`a--b`, `a__b`). Start/end stay alphanumeric so leading/trailing dots\n// (hidden files, the special `.`/`..` names) and `..`-only ids are all\n// excluded.\n// eslint-disable-next-line security/detect-unsafe-regex -- non-overlapping character classes, no catastrophic backtracking\nexport const SAFE_RECORD_ID_PATTERN = /^[a-zA-Z0-9](?:[a-zA-Z0-9_.-]*[a-zA-Z0-9])?$/;\n\n/** True when `value` is a well-formed collection slug (alphanumeric /\n *  hyphen / underscore, no path separators). The pattern admits no `/`,\n *  `\\`, or `.`, so a passing value is trivially also a safe basename —\n *  validation callers need no `path.basename` round-trip (path-building\n *  callers use `../server/paths#safeSlugName`, which adds it). */\nexport function isSafeSlug(value: string): boolean {\n  return typeof value === \"string\" && SAFE_SLUG_PATTERN.test(value);\n}\n\n/** True when `value` is a well-formed record id (slug charset plus interior\n *  dots), with any `..` substring rejected explicitly. Validation-only\n *  counterpart of `../server/paths#safeRecordId`. */\nexport function isSafeRecordId(value: string): boolean {\n  if (typeof value !== \"string\" || !SAFE_RECORD_ID_PATTERN.test(value)) return false;\n  return !value.includes(\"..\");\n}\n\nconst DEFAULT_UNIQUE_ID_ATTEMPTS = 8;\n\n/** Pick an id not already in `existing`, re-rolling `generate()` up to\n *  `maxAttempts` times before giving up and returning the last candidate.\n *  Collisions on a wide id space are astronomically unlikely, so a caller's\n *  own overwrite guard is the final backstop rather than an unbounded loop. */\nexport function generateUniqueId(existing: ReadonlySet<string>, generate: () => string, maxAttempts: number = DEFAULT_UNIQUE_ID_ATTEMPTS): string {\n  let candidate = generate();\n  for (let attempt = 0; attempt < maxAttempts && existing.has(candidate); attempt++) {\n    candidate = generate();\n  }\n  return candidate;\n}\n\n/** An id not already used by any loaded record: collects the in-memory primary\n *  keys and re-rolls `generate()` against them (see {@link generateUniqueId}).\n *  The pure core of the view's create-form id prefill. */\nexport function nextUniqueItemId(\n  items: readonly CollectionItem[],\n  primaryKey: string,\n  generate: () => string,\n  maxAttempts: number = DEFAULT_UNIQUE_ID_ATTEMPTS,\n): string {\n  const existing = new Set(items.map((item) => fieldText(item[primaryKey])));\n  return generateUniqueId(existing, generate, maxAttempts);\n}\n","// Pure, deterministic helpers for the collection calendar view: parse\n// `date`-field values, build a month grid, and bucket records onto the\n// days they cover. No `Date.now()` / `new Date()` (argless) here — every\n// function takes its inputs explicitly so the logic is unit-testable\n// without faking the clock. All internal arithmetic runs in UTC (which\n// has no DST), so fixed 86_400_000 ms steps never skip or double a day.\n\nconst MS_PER_DAY = 86_400_000;\nconst ISO_DATE_RE = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n// A two-digit field (hours / minutes / seconds) of a clock value.\nconst TWO_DIGIT_RE = /^\\d{2}$/;\n// A single clock token inside a free-form `time` string field (e.g. the\n// \"14:00-17:00\" / \"17:00-\" / \"16:30\" / \"終日\" shapes seen in user data).\nconst CLOCK_RE = /(\\d{1,2}):(\\d{2})/g;\n// Range separators we tolerate between two clock tokens: ASCII hyphen, en/em\n// dash, tilde, and the Japanese wave dashes.\nconst RANGE_SEP_RE = /[-–—~〜～]/;\n\n/** Minutes in a full day — the timeline's vertical extent. */\nexport const MINUTES_PER_DAY = 1440;\n\n/** A civil date triple. `month` is 1-12 (NOT the 0-based `Date` month). */\nexport interface Ymd {\n  year: number;\n  month: number;\n  day: number;\n}\n\n/** One cell of the 6×7 month grid. */\nexport interface DayCell {\n  ymd: Ymd;\n  /** False for the leading/trailing days that belong to the adjacent\n   *  month (rendered greyed). */\n  inMonth: boolean;\n  /** Canonical `YYYY-MM-DD` key for this cell. */\n  key: string;\n}\n\n/** A record placed on the calendar: the inclusive `[start, end]` span of\n *  days it covers. `end === start` for a single-day record. `startMin` /\n *  `endMin` are minutes-of-day for the time-allocation (day) view, resolved\n *  from either a `datetime` field's clock or a separate time-string field.\n *  `null` means \"no clock\" — `startMin === null && endMin === null` is an\n *  all-day record; a non-null `startMin` with a null `endMin` is a\n *  point-in-time record (rendered as a single line). */\nexport interface RecordSpan<T> {\n  item: T;\n  start: Ymd;\n  end: Ymd;\n  startMin: number | null;\n  endMin: number | null;\n}\n\nfunction pad2(value: number): string {\n  return String(value).padStart(2, \"0\");\n}\n\n/** Canonical `YYYY-MM-DD` string for a civil date. */\nexport function ymdKey(ymd: Ymd): string {\n  return `${String(ymd.year).padStart(4, \"0\")}-${pad2(ymd.month)}-${pad2(ymd.day)}`;\n}\n\n/** Strictly parse a `YYYY-MM-DD` string into a civil date, rejecting\n *  anything that isn't a real calendar day (e.g. `2026-02-30`, `2026-13-01`).\n *  Returns null for non-strings and malformed values so callers can route\n *  records with no usable date into the \"no date\" tray rather than crash. */\nexport function parseIsoDate(value: unknown): Ymd | null {\n  if (typeof value !== \"string\") return null;\n  const match = ISO_DATE_RE.exec(value.trim());\n  if (!match) return null;\n  const year = Number(match[1]);\n  const month = Number(match[2]);\n  const day = Number(match[3]);\n  // Round-trip through a UTC Date to reject impossible days: a value the\n  // Date constructor rolls over (Feb 30 → Mar 2) won't match back.\n  const probe = new Date(Date.UTC(year, month - 1, day));\n  if (probe.getUTCFullYear() !== year || probe.getUTCMonth() !== month - 1 || probe.getUTCDate() !== day) return null;\n  return { year, month, day };\n}\n\n/** Minutes-of-day for an `HH:MM` pair, or null when out of range. */\nfunction clockToMinutes(hours: number, minutes: number): number | null {\n  if (hours < 0 || hours > 23 || minutes < 0 || minutes > 59) return null;\n  return hours * 60 + minutes;\n}\n\n/** Strictly parse a `YYYY-MM-DDTHH:MM` (optional `:SS`) datetime into its\n *  civil date and minutes-of-day. Returns null for anything that isn't a real\n *  calendar day or a valid 24h clock. */\nexport function parseIsoDateTime(value: unknown): { ymd: Ymd; minutes: number } | null {\n  if (typeof value !== \"string\") return null;\n  const trimmed = value.trim();\n  const tIndex = trimmed.indexOf(\"T\");\n  if (tIndex === -1) return null;\n  const ymd = parseIsoDate(trimmed.slice(0, tIndex));\n  if (!ymd) return null;\n  // `HH:MM` with an optional `:SS` the browser appends for non-zero seconds.\n  const parts = trimmed.slice(tIndex + 1).split(\":\");\n  if (parts.length < 2 || parts.length > 3 || !parts.every((part) => TWO_DIGIT_RE.test(part))) return null;\n  const minutes = clockToMinutes(Number(parts[0]), Number(parts[1]));\n  if (minutes === null) return null;\n  return { ymd, minutes };\n}\n\n/** Civil date from either a `YYYY-MM-DD` or a `YYYY-MM-DDTHH:MM` value, so the\n *  month grid buckets date-only and datetime anchors alike. */\nexport function dateOf(value: unknown): Ymd | null {\n  return parseIsoDate(value) ?? parseIsoDateTime(value)?.ymd ?? null;\n}\n\n/** Minutes-of-day from a datetime value, or null for date-only / invalid. */\nfunction timeOf(value: unknown): number | null {\n  return parseIsoDateTime(value)?.minutes ?? null;\n}\n\n/** Parse a free-form time-string field into start/end minutes-of-day.\n *  Handles the common shapes in user data:\n *    \"14:00-17:00\" → { start: 840, end: 1020 }   (range → block)\n *    \"17:00-\"      → { start: 1020, end: null }   (open end → single line)\n *    \"16:30\"       → { start: 990, end: null }    (point in time → single line)\n *    \"終日\" / \"\"   → null                          (no clock → all-day)\n *  Returns null when no clock token is parseable. */\nexport function parseTimeRange(value: unknown): { startMin: number | null; endMin: number | null } | null {\n  if (typeof value !== \"string\") return null;\n  const text = value.trim();\n  if (!text) return null;\n  const tokens = [...text.matchAll(CLOCK_RE)];\n  if (tokens.length === 0) return null;\n  const minutesOf = (match: RegExpMatchArray): number | null => clockToMinutes(Number(match[1]), Number(match[2]));\n  // No separator → a single point in time (start only).\n  if (!RANGE_SEP_RE.test(text)) {\n    const startMin = minutesOf(tokens[0]);\n    return startMin === null ? null : { startMin, endMin: null };\n  }\n  // Separator present → assign each token to the side of the first separator.\n  const sepIndex = text.search(RANGE_SEP_RE);\n  let startMin: number | null = null;\n  let endMin: number | null = null;\n  for (const token of tokens) {\n    if ((token.index ?? 0) < sepIndex) startMin = minutesOf(token);\n    else endMin = minutesOf(token);\n  }\n  // A start-less range (\"-09:00\") has no anchor on the timeline → treat as\n  // unparseable so the record falls back to the all-day strip.\n  if (startMin === null) return null;\n  return { startMin, endMin };\n}\n\nfunction ymdToUtcMs(ymd: Ymd): number {\n  return Date.UTC(ymd.year, ymd.month - 1, ymd.day);\n}\n\nfunction utcMsToYmd(epochMs: number): Ymd {\n  const date = new Date(epochMs);\n  return { year: date.getUTCFullYear(), month: date.getUTCMonth() + 1, day: date.getUTCDate() };\n}\n\n/** Chronological comparison: negative if `left` precedes `right`, 0 if the\n *  same day, positive if after. */\nexport function compareYmd(left: Ymd, right: Ymd): number {\n  return ymdToUtcMs(left) - ymdToUtcMs(right);\n}\n\n/** True iff `day` falls within the inclusive span `[span.start, span.end]`. */\nexport function spanCoversDay<T>(span: RecordSpan<T>, day: Ymd): boolean {\n  return compareYmd(span.start, day) <= 0 && compareYmd(day, span.end) <= 0;\n}\n\n/** Build the 6×7 (42-cell) grid for the given month, including the\n *  leading/trailing days of the adjacent months so every week is full.\n *  `month` is 1-12. `weekStartsOn` is 0 (Sunday) … 6 (Saturday). */\nexport function buildMonthGrid(year: number, month: number, weekStartsOn = 0): DayCell[] {\n  const firstWeekday = new Date(Date.UTC(year, month - 1, 1)).getUTCDay();\n  const lead = (firstWeekday - weekStartsOn + 7) % 7;\n  const startMs = Date.UTC(year, month - 1, 1) - lead * MS_PER_DAY;\n  const cells: DayCell[] = [];\n  for (let i = 0; i < 42; i++) {\n    const ymd = utcMsToYmd(startMs + i * MS_PER_DAY);\n    cells.push({ ymd, inMonth: ymd.year === year && ymd.month === month, key: ymdKey(ymd) });\n  }\n  return cells;\n}\n\n/** Resolve a record's calendar span from its date/datetime fields. Returns\n *  null when the anchor date is missing/invalid (→ the caller's \"no date\"\n *  tray). An end date that is missing, invalid, or earlier than the start\n *  collapses to a single-day span — never an inverted range.\n *\n *  Times for the day (time-allocation) view come from, in priority order:\n *    1. the clock on a `datetime` anchor/end value, else\n *    2. `timeField` — a separate free-form time-string column (e.g. \"14:00-17:00\").\n *  A record with no resolvable clock has `startMin === endMin === null`. */\nexport function recordSpan<T extends Record<string, unknown>>(item: T, anchorField: string, endField?: string, timeField?: string): RecordSpan<T> | null {\n  const startRaw = item[anchorField];\n  const start = dateOf(startRaw);\n  if (!start) return null;\n  let end = start;\n  let startMin = timeOf(startRaw);\n  let endMin: number | null = null;\n  if (endField) {\n    const endRaw = item[endField];\n    const parsedEnd = dateOf(endRaw);\n    if (parsedEnd && compareYmd(parsedEnd, start) >= 0) {\n      end = parsedEnd;\n      endMin = timeOf(endRaw);\n    }\n  }\n  // Fall back to a separate time-string field only when the date fields\n  // carried no clock (the date-only anchor + `time` column shape).\n  if (timeField && startMin === null && endMin === null) {\n    const range = parseTimeRange(item[timeField]);\n    if (range) {\n      ({ startMin, endMin } = range);\n    }\n  }\n  return { item, start, end, startMin, endMin };\n}\n\n/** Split records into those that land on the calendar (with their spans)\n *  and those with no usable anchor date (the \"no date\" tray). Spans are\n *  sorted by start day so same-day stacking is stable across renders. */\nexport function bucketRecords<T extends Record<string, unknown>>(\n  items: readonly T[],\n  anchorField: string,\n  endField?: string,\n  timeField?: string,\n): { spans: RecordSpan<T>[]; noDate: T[] } {\n  const spans: RecordSpan<T>[] = [];\n  const noDate: T[] = [];\n  for (const item of items) {\n    const span = recordSpan(item, anchorField, endField, timeField);\n    if (span) spans.push(span);\n    else noDate.push(item);\n  }\n  spans.sort((left, right) => compareYmd(left.start, right.start));\n  return { spans, noDate };\n}\n\n/** Geometry for one record on one day of the time-allocation view.\n *  `kind`:\n *    \"allDay\" — no clock anywhere → render in the bottom all-day strip.\n *    \"line\"   — a single point in time → a 1px marker at `startMin`.\n *    \"block\"  — a [startMin, endMin) span, clamped to this day's [0, 1440).\n *  `bleedsBefore` / `bleedsAfter` flag a multi-day span that began on an\n *  earlier day or continues onto a later one (so the view can show arrows). */\nexport interface DaySlice {\n  kind: \"allDay\" | \"line\" | \"block\";\n  startMin: number;\n  endMin: number;\n  bleedsBefore: boolean;\n  bleedsAfter: boolean;\n}\n\n/** Project a record's span onto a single day for the time-allocation view, or\n *  null when the span doesn't cover that day. */\nexport function daySlice<T>(span: RecordSpan<T>, day: Ymd): DaySlice | null {\n  if (!spanCoversDay(span, day)) return null;\n  // Destructured so the `!== null` tests narrow the clocks where they are used;\n  // reading them back off `span` each time would not.\n  const { startMin: spanStart, endMin: spanEnd } = span;\n  if (spanStart === null && spanEnd === null) {\n    return { kind: \"allDay\", startMin: 0, endMin: MINUTES_PER_DAY, bleedsBefore: false, bleedsAfter: false };\n  }\n  const singleDay = compareYmd(span.start, span.end) === 0;\n  const isStartDay = compareYmd(day, span.start) === 0;\n  const isEndDay = compareYmd(day, span.end) === 0;\n  // A point in time: a start clock with no end, all on one day.\n  if (singleDay && spanStart !== null && spanEnd === null) {\n    return { kind: \"line\", startMin: spanStart, endMin: spanStart, bleedsBefore: false, bleedsAfter: false };\n  }\n  const startMin = isStartDay && spanStart !== null ? spanStart : 0;\n  const endMin = isEndDay && spanEnd !== null ? spanEnd : MINUTES_PER_DAY;\n  // Zero-length or inverted same-day range → degrade to a line.\n  if (singleDay && endMin <= startMin) {\n    return { kind: \"line\", startMin, endMin: startMin, bleedsBefore: false, bleedsAfter: false };\n  }\n  return { kind: \"block\", startMin, endMin, bleedsBefore: !isStartDay, bleedsAfter: !isEndDay };\n}\n\n/** Side-by-side lane assignment for overlapping timeline blocks. Each input\n *  is an `[startMin, endMin)` interval; the result (parallel to the input)\n *  gives each item its `lane` (column index) and the `lanes` total of its\n *  overlap cluster, so a renderer can size every block to `1 / lanes` width\n *  and offset it by `lane / lanes`. Non-overlapping items get `lanes === 1`. */\nexport interface LaneSpan {\n  startMin: number;\n  endMin: number;\n}\nexport interface LaneAssignment {\n  lane: number;\n  lanes: number;\n}\n\nexport function assignLanes(blocks: readonly LaneSpan[]): LaneAssignment[] {\n  const order = [...blocks.keys()].sort((left, right) => blocks[left].startMin - blocks[right].startMin || blocks[left].endMin - blocks[right].endMin);\n  const result: LaneAssignment[] = blocks.map(() => ({ lane: 0, lanes: 1 }));\n  let cluster: number[] = [];\n  let clusterEnd = Number.NEGATIVE_INFINITY;\n  const laneEnds: number[] = [];\n  const flush = (): void => {\n    for (const index of cluster) result[index].lanes = laneEnds.length;\n    cluster = [];\n    laneEnds.length = 0;\n    clusterEnd = Number.NEGATIVE_INFINITY;\n  };\n  for (const index of order) {\n    const block = blocks[index];\n    if (cluster.length > 0 && block.startMin >= clusterEnd) flush();\n    let lane = laneEnds.findIndex((end) => end <= block.startMin);\n    if (lane === -1) {\n      lane = laneEnds.length;\n      laneEnds.push(block.endMin);\n    } else {\n      laneEnds[lane] = block.endMin;\n    }\n    result[index].lane = lane;\n    cluster.push(index);\n    clusterEnd = Math.max(clusterEnd, block.endMin);\n  }\n  flush();\n  return result;\n}\n\n/** Month label key inputs — returns the 1st of the month as a `Date` so the\n *  component can feed it to `Intl.DateTimeFormat(locale, …)` for a localized\n *  \"April 2026\" header without this module taking a locale dependency. */\nexport function monthAnchorDate(year: number, month: number): Date {\n  return new Date(Date.UTC(year, month - 1, 1));\n}\n"],"mappings":";;;AAeA,IAAM,cAAc,UAClB,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,iBAAiB;;;;;;;AAQ3G,SAAgB,gBAAgB,OAA+B;CAC7D,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO;CAC/B,IAAI,iBAAiB,MAKnB,OAAO,OAAO,MAAM,MAAM,QAAQ,CAAC,IAAI,OAAO,MAAM,YAAY;CAElE,OAAO,OAAO,KAAK;AACrB;;;;AAKA,SAAgB,UAAU,OAAgB,WAAW,IAAY;CAC/D,OAAO,gBAAgB,KAAK,KAAK;AACnC;;;;;;;AC4BA,IAAa,eAAe;CAAC;CAAO;CAAQ;AAAW;;;;;;;;AAUvD,IAAa,oBAAoB;;AAIjC,IAAa,iBAAiB;CAAC;CAAU;CAAS;CAAU;AAAW;;;;;;;AA4BvE,IAAa,iCAAmD,IAAI,IAAyB;CAAC;CAAW;CAAS;CAAa;CAAU;CAAU;AAAM,CAAC;;AAsE1J,SAAgB,mBAAmB,OAAkE;CACnG,OAAO,eAAe;AACxB;;;;AA2CA,SAAgB,eAAe,QAAiF;CAC9G,IAAI,OAAO,eAAe,KAAA,GAAW,OAAO;CAC5C,OAAO,OAAO,SAAS,QAAQ;AACjC;;;;;;AAWA,SAAgB,iBAAiB,QAAuD;CACtF,OAAO,OAAO,eAAe,KAAA;AAC/B;;;;;;AA6BA,SAAgB,cAAc,OAA4B,QAAuC;CAC/F,IAAI,MAAM,SAAS,SAAS,OAAO;CACnC,IAAI,MAAM,IAAI,OAAO,MAAM;CAC3B,IAAI,MAAM,WAAW,QAAQ,OAAO,UAAU,OAAO,MAAM,QAAQ;CACnE,OAAO;AACT;;;ACvQA,IAAa,oBAAoB;AAYjC,IAAa,yBAAyB;;;;;;AAOtC,SAAgB,WAAW,OAAwB;CACjD,OAAO,OAAO,UAAU,YAAY,kBAAkB,KAAK,KAAK;AAClE;;;;AAKA,SAAgB,eAAe,OAAwB;CACrD,IAAI,OAAO,UAAU,YAAY,CAAC,uBAAuB,KAAK,KAAK,GAAG,OAAO;CAC7E,OAAO,CAAC,MAAM,SAAS,IAAI;AAC7B;AAEA,IAAM,6BAA6B;;;;;AAMnC,SAAgB,iBAAiB,UAA+B,UAAwB,cAAsB,4BAAoC;CAChJ,IAAI,YAAY,SAAS;CACzB,KAAK,IAAI,UAAU,GAAG,UAAU,eAAe,SAAS,IAAI,SAAS,GAAG,WACtE,YAAY,SAAS;CAEvB,OAAO;AACT;;;;AAKA,SAAgB,iBACd,OACA,YACA,UACA,cAAsB,4BACd;CAER,OAAO,iBAAiB,IADH,IAAI,MAAM,KAAK,SAAS,UAAU,KAAK,WAAW,CAAC,CAChD,GAAU,UAAU,WAAW;AACzD;;;AC/DA,IAAM,aAAa;AACnB,IAAM,cAAc;AAEpB,IAAM,eAAe;AAGrB,IAAM,WAAW;AAGjB,IAAM,eAAe;;AAGrB,IAAa,kBAAkB;AAkC/B,SAAS,KAAK,OAAuB;CACnC,OAAO,OAAO,KAAK,CAAC,CAAC,SAAS,GAAG,GAAG;AACtC;;AAGA,SAAgB,OAAO,KAAkB;CACvC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,EAAE,GAAG,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,IAAI,GAAG;AAChF;;;;;AAMA,SAAgB,aAAa,OAA4B;CACvD,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,QAAQ,YAAY,KAAK,MAAM,KAAK,CAAC;CAC3C,IAAI,CAAC,OAAO,OAAO;CACnB,MAAM,OAAO,OAAO,MAAM,EAAE;CAC5B,MAAM,QAAQ,OAAO,MAAM,EAAE;CAC7B,MAAM,MAAM,OAAO,MAAM,EAAE;CAG3B,MAAM,QAAQ,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,GAAG,CAAC;CACrD,IAAI,MAAM,eAAe,MAAM,QAAQ,MAAM,YAAY,MAAM,QAAQ,KAAK,MAAM,WAAW,MAAM,KAAK,OAAO;CAC/G,OAAO;EAAE;EAAM;EAAO;CAAI;AAC5B;;AAGA,SAAS,eAAe,OAAe,SAAgC;CACrE,IAAI,QAAQ,KAAK,QAAQ,MAAM,UAAU,KAAK,UAAU,IAAI,OAAO;CACnE,OAAO,QAAQ,KAAK;AACtB;;;;AAKA,SAAgB,iBAAiB,OAAsD;CACrF,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,UAAU,MAAM,KAAK;CAC3B,MAAM,SAAS,QAAQ,QAAQ,GAAG;CAClC,IAAI,WAAW,IAAI,OAAO;CAC1B,MAAM,MAAM,aAAa,QAAQ,MAAM,GAAG,MAAM,CAAC;CACjD,IAAI,CAAC,KAAK,OAAO;CAEjB,MAAM,QAAQ,QAAQ,MAAM,SAAS,CAAC,CAAC,CAAC,MAAM,GAAG;CACjD,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,CAAC,MAAM,OAAO,SAAS,aAAa,KAAK,IAAI,CAAC,GAAG,OAAO;CACpG,MAAM,UAAU,eAAe,OAAO,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC;CACjE,IAAI,YAAY,MAAM,OAAO;CAC7B,OAAO;EAAE;EAAK;CAAQ;AACxB;;;AAIA,SAAgB,OAAO,OAA4B;CACjD,OAAO,aAAa,KAAK,KAAK,iBAAiB,KAAK,CAAC,EAAE,OAAO;AAChE;;AAGA,SAAS,OAAO,OAA+B;CAC7C,OAAO,iBAAiB,KAAK,CAAC,EAAE,WAAW;AAC7C;;;;;;;;AASA,SAAgB,eAAe,OAA2E;CACxG,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,OAAO,MAAM,KAAK;CACxB,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,SAAS,CAAC,GAAG,KAAK,SAAS,QAAQ,CAAC;CAC1C,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,aAAa,UAA2C,eAAe,OAAO,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC;CAE/G,IAAI,CAAC,aAAa,KAAK,IAAI,GAAG;EAC5B,MAAM,WAAW,UAAU,OAAO,EAAE;EACpC,OAAO,aAAa,OAAO,OAAO;GAAE;GAAU,QAAQ;EAAK;CAC7D;CAEA,MAAM,WAAW,KAAK,OAAO,YAAY;CACzC,IAAI,WAA0B;CAC9B,IAAI,SAAwB;CAC5B,KAAK,MAAM,SAAS,QAClB,KAAK,MAAM,SAAS,KAAK,UAAU,WAAW,UAAU,KAAK;MACxD,SAAS,UAAU,KAAK;CAI/B,IAAI,aAAa,MAAM,OAAO;CAC9B,OAAO;EAAE;EAAU;CAAO;AAC5B;AAEA,SAAS,WAAW,KAAkB;CACpC,OAAO,KAAK,IAAI,IAAI,MAAM,IAAI,QAAQ,GAAG,IAAI,GAAG;AAClD;AAEA,SAAS,WAAW,SAAsB;CACxC,MAAM,OAAO,IAAI,KAAK,OAAO;CAC7B,OAAO;EAAE,MAAM,KAAK,eAAe;EAAG,OAAO,KAAK,YAAY,IAAI;EAAG,KAAK,KAAK,WAAW;CAAE;AAC9F;;;AAIA,SAAgB,WAAW,MAAW,OAAoB;CACxD,OAAO,WAAW,IAAI,IAAI,WAAW,KAAK;AAC5C;;AAGA,SAAgB,cAAiB,MAAqB,KAAmB;CACvE,OAAO,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,KAAK,GAAG,KAAK;AAC1E;;;;AAKA,SAAgB,eAAe,MAAc,OAAe,eAAe,GAAc;CAEvF,MAAM,QADe,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,UAC9C,IAAe,eAAe,KAAK;CACjD,MAAM,UAAU,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,IAAI,OAAO;CACtD,MAAM,QAAmB,CAAC;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,MAAM,WAAW,UAAU,IAAI,UAAU;EAC/C,MAAM,KAAK;GAAE;GAAK,SAAS,IAAI,SAAS,QAAQ,IAAI,UAAU;GAAO,KAAK,OAAO,GAAG;EAAE,CAAC;CACzF;CACA,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,WAA8C,MAAS,aAAqB,UAAmB,WAA0C;CACvJ,MAAM,WAAW,KAAK;CACtB,MAAM,QAAQ,OAAO,QAAQ;CAC7B,IAAI,CAAC,OAAO,OAAO;CACnB,IAAI,MAAM;CACV,IAAI,WAAW,OAAO,QAAQ;CAC9B,IAAI,SAAwB;CAC5B,IAAI,UAAU;EACZ,MAAM,SAAS,KAAK;EACpB,MAAM,YAAY,OAAO,MAAM;EAC/B,IAAI,aAAa,WAAW,WAAW,KAAK,KAAK,GAAG;GAClD,MAAM;GACN,SAAS,OAAO,MAAM;EACxB;CACF;CAGA,IAAI,aAAa,aAAa,QAAQ,WAAW,MAAM;EACrD,MAAM,QAAQ,eAAe,KAAK,UAAU;EAC5C,IAAI,OACF,CAAC,CAAE,UAAU,UAAW;CAE5B;CACA,OAAO;EAAE;EAAM;EAAO;EAAK;EAAU;CAAO;AAC9C;;;;AAKA,SAAgB,cACd,OACA,aACA,UACA,WACyC;CACzC,MAAM,QAAyB,CAAC;CAChC,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,WAAW,MAAM,aAAa,UAAU,SAAS;EAC9D,IAAI,MAAM,MAAM,KAAK,IAAI;OACpB,OAAO,KAAK,IAAI;CACvB;CACA,MAAM,MAAM,MAAM,UAAU,WAAW,KAAK,OAAO,MAAM,KAAK,CAAC;CAC/D,OAAO;EAAE;EAAO;CAAO;AACzB;;;AAmBA,SAAgB,SAAY,MAAqB,KAA2B;CAC1E,IAAI,CAAC,cAAc,MAAM,GAAG,GAAG,OAAO;CAGtC,MAAM,EAAE,UAAU,WAAW,QAAQ,YAAY;CACjD,IAAI,cAAc,QAAQ,YAAY,MACpC,OAAO;EAAE,MAAM;EAAU,UAAU;EAAG,QAAQ;EAAiB,cAAc;EAAO,aAAa;CAAM;CAEzG,MAAM,YAAY,WAAW,KAAK,OAAO,KAAK,GAAG,MAAM;CACvD,MAAM,aAAa,WAAW,KAAK,KAAK,KAAK,MAAM;CACnD,MAAM,WAAW,WAAW,KAAK,KAAK,GAAG,MAAM;CAE/C,IAAI,aAAa,cAAc,QAAQ,YAAY,MACjD,OAAO;EAAE,MAAM;EAAQ,UAAU;EAAW,QAAQ;EAAW,cAAc;EAAO,aAAa;CAAM;CAEzG,MAAM,WAAW,cAAc,cAAc,OAAO,YAAY;CAChE,MAAM,SAAS,YAAY,YAAY,OAAO,UAAU;CAExD,IAAI,aAAa,UAAU,UACzB,OAAO;EAAE,MAAM;EAAQ;EAAU,QAAQ;EAAU,cAAc;EAAO,aAAa;CAAM;CAE7F,OAAO;EAAE,MAAM;EAAS;EAAU;EAAQ,cAAc,CAAC;EAAY,aAAa,CAAC;CAAS;AAC9F;AAgBA,SAAgB,YAAY,QAA+C;CACzE,MAAM,QAAQ,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,MAAM,UAAU,OAAO,KAAK,CAAC,WAAW,OAAO,MAAM,CAAC,YAAY,OAAO,KAAK,CAAC,SAAS,OAAO,MAAM,CAAC,MAAM;CACnJ,MAAM,SAA2B,OAAO,WAAW;EAAE,MAAM;EAAG,OAAO;CAAE,EAAE;CACzE,IAAI,UAAoB,CAAC;CACzB,IAAI,aAAa,OAAO;CACxB,MAAM,WAAqB,CAAC;CAC5B,MAAM,cAAoB;EACxB,KAAK,MAAM,SAAS,SAAS,OAAO,MAAM,CAAC,QAAQ,SAAS;EAC5D,UAAU,CAAC;EACX,SAAS,SAAS;EAClB,aAAa,OAAO;CACtB;CACA,KAAK,MAAM,SAAS,OAAO;EACzB,MAAM,QAAQ,OAAO;EACrB,IAAI,QAAQ,SAAS,KAAK,MAAM,YAAY,YAAY,MAAM;EAC9D,IAAI,OAAO,SAAS,WAAW,QAAQ,OAAO,MAAM,QAAQ;EAC5D,IAAI,SAAS,IAAI;GACf,OAAO,SAAS;GAChB,SAAS,KAAK,MAAM,MAAM;EAC5B,OACE,SAAS,QAAQ,MAAM;EAEzB,OAAO,MAAM,CAAC,OAAO;EACrB,QAAQ,KAAK,KAAK;EAClB,aAAa,KAAK,IAAI,YAAY,MAAM,MAAM;CAChD;CACA,MAAM;CACN,OAAO;AACT;;;;AAKA,SAAgB,gBAAgB,MAAc,OAAqB;CACjE,OAAO,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC9C"}
+{"version":3,"file":"calendarGrid-Csy2rpjp.js","names":[],"sources":["../src/collection/core/fieldText.ts","../src/collection/core/schema.ts","../src/collection/core/ids.ts","../src/collection/core/calendarGrid.ts"],"sourcesContent":["// Turning a record field into text.\n//\n// `CollectionItem` is `Record<string, unknown>`, so a field holds whatever the\n// record's JSON had — including arrays and objects (real workspace data has\n// plenty: weather `hourly`, GeoJSON `geometry`, `sites` lists). Bare\n// `String(value)` on one of those yields `\"[object Object]\"`, which then gets\n// compared, matched or displayed as if it were a value. Nothing throws; a\n// predicate just silently stops matching, or the UI shows `[object Object]`.\n//\n// These two helpers are the only sanctioned way to read a field as text. The\n// rule they encode was already in `itemLabelOf`: accept primitives, let\n// everything else fall through to the caller's fallback.\n\n/** A field value that has a meaningful text form. Dates are included because\n *  a JSON record can carry one once it has been revived. */\nconst isTextable = (value: unknown): value is string | number | boolean | Date =>\n  typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\" || value instanceof Date;\n\n/** The field's text, or `null` when it has no meaningful one (absent, or an\n *  array/object that would stringify to `\"[object Object]\"`).\n *\n *  Returning `null` rather than `\"\"` keeps \"the field is empty\" distinct from\n *  \"the field can't be text\" — a matcher must not treat an object-valued field\n *  as an empty string and match `\"\"`. */\nexport function fieldTextOrNull(value: unknown): string | null {\n  if (value === undefined || value === null) return null;\n  if (!isTextable(value)) return null;\n  if (value instanceof Date) {\n    // `new Date(\"nonsense\")` is still `instanceof Date`, and `toISOString()`\n    // throws `RangeError` on it. This helper sits on the match, sort and\n    // display paths, so one unparseable date in one record would take the whole\n    // render down — the loud version of the bug this module exists to prevent.\n    return Number.isNaN(value.getTime()) ? null : value.toISOString();\n  }\n  return String(value);\n}\n\n/** The field's text, or `fallback` (default `\"\"`) when it has none. Use where\n *  a string is required and an empty one is a safe stand-in — display, sort\n *  keys, CSV cells. Where the distinction matters, use {@link fieldTextOrNull}. */\nexport function fieldText(value: unknown, fallback = \"\"): string {\n  return fieldTextOrNull(value) ?? fallback;\n}\n","// 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// SINGLE SOURCE OF TRUTH: every type describing the schema.json contract is\n// derived (`z.infer`) from the zod definitions in `./schemaZ` — the shapes,\n// their doc comments, and the validation rules live THERE; this module only\n// re-derives the TypeScript names consumers import. The imports from\n// `./schemaZ` are type-only, so zod never reaches the browser bundle through\n// the isomorphic barrel; at runtime the dependency points the other way\n// (schemaZ imports this module's consts).\n//\n// Field specs are a DISCRIMINATED UNION on `type`: narrow with\n// `field.type === \"enum\"` (etc.) before reading a variant key like `values`,\n// `to`, `formula`, or `of`.\n\nimport { fieldText } from \"./fieldText\";\nimport type { z } from \"zod\";\nimport type {\n  ActionSpecZ,\n  CollectionSchemaZ,\n  CustomViewZ,\n  DataSourceZ,\n  DynamicIconRuleZ,\n  DynamicIconSourceZ,\n  DynamicIconSpecZ,\n  EveryFieldDrivenZ,\n  EveryLiteralZ,\n  EveryZ,\n  FieldSpecZ,\n  IngestZ,\n  SpawnZ,\n  StorageZ,\n  SubFieldSpecZ,\n  WhenZ,\n} from \"./schemaZ\";\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 `feeds/ingestTypes.ts`) is a subtype, so feed code\n *  reads the extra fields by typing feed schemas with that subtype;\n *  collection rendering only needs 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\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/** One field of a record — a discriminated union on `type`; see the variant\n *  docs in `./schemaZ` (`FieldSpecZ`). */\nexport type CollectionFieldSpec = z.infer<typeof FieldSpecZ>;\n\n/** A `table` field's row sub-schema entry — the field union minus `table` /\n *  `derived` / display-only types (see `SubFieldSpecZ`). */\nexport type CollectionSubFieldSpec = z.infer<typeof SubFieldSpecZ>;\n\nexport type CollectionFieldType = CollectionFieldSpec[\"type\"];\n\n/** The computed-boolean variant — a `where` predicate bound to a field\n *  name; see `FlagFieldZ`. */\nexport type CollectionFlagField = Extract<CollectionFieldSpec, { type: \"flag\" }>;\n\n/** derived/embed/backlinks/rollup/toggle/flag are host-computed or\n *  projected — never written to the record JSON, so required / value\n *  checks and edit-draft slots must not apply to them. THE single source\n *  for \"computed\" — lives here (zod-free at runtime) so browser code\n *  (`./draft`) and the zod record compiler (`./recordZ`, which re-exports\n *  it) share one set instead of drifting copies. */\nexport const COMPUTED_TYPES: ReadonlySet<CollectionFieldType> = new Set<CollectionFieldType>([\"derived\", \"embed\", \"backlinks\", \"rollup\", \"toggle\", \"flag\"]);\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 type CollectionWhen = z.infer<typeof WhenZ>;\n\n/** @deprecated Name retained for back-compat; use {@link CollectionWhen}.\n *  Both actions and fields share the same predicate shape. No in-repo\n *  consumers, but the package is public API (MulmoTerminal). */\n// eslint-disable-next-line sonarjs/redundant-type-aliases -- deliberate deprecated back-compat export\nexport type CollectionActionWhen = CollectionWhen;\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 — or the declarative `set`) live in the schema / skill\n *  folder, so the host stays generic. A discriminated union on `kind`;\n *  see `ActionSpecZ`. */\nexport type CollectionAction = z.infer<typeof ActionSpecZ>;\n\n/** The kind of work an action kicks off: `\"chat\"` (visible LLM chat),\n *  `\"agent\"` (hidden LLM worker), or `\"mutate\"` (declarative host write,\n *  no LLM). */\nexport type CollectionActionKind = CollectionAction[\"kind\"];\n\n/** The LLM-seeded action variants (`role` + `template`). */\nexport type CollectionSeededAction = Extract<CollectionAction, { kind: \"chat\" | \"agent\" }>;\n\n/** The declarative host-write variant (`set` + optional `require`/`params`). */\nexport type CollectionMutateAction = Extract<CollectionAction, { kind: \"mutate\" }>;\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.\n *  See `CustomViewZ` for the per-key contracts. */\nexport type CollectionCustomView = z.infer<typeof CustomViewZ>;\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 = NonNullable<CollectionCustomView[\"capabilities\"]>[number];\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 type CollectionEvery = z.infer<typeof EveryLiteralZ>;\n\n/** Recurrence unit for a `spawn.every` advance. */\nexport type CollectionRecurUnit = CollectionEvery[\"unit\"];\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`. See\n *  `EveryFieldDrivenZ`. */\nexport type CollectionEveryFieldDriven = z.infer<typeof EveryFieldDrivenZ>;\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 = z.infer<typeof EveryZ>;\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. See `SpawnZ`. */\nexport type CollectionSpawn = z.infer<typeof SpawnZ>;\n\n/** One rule in a `dynamicIcon.rules` list: when the resolved source\n *  record matches `where` (an AND of typed conditions, see `./where`),\n *  the collection's effective launcher icon becomes `icon`. Evaluated top\n *  to bottom — the first match wins. */\nexport type DynamicIconRule = z.infer<typeof DynamicIconRuleZ>;\n\n/** Where a {@link DynamicIconSpec}'s source record comes from: a (possibly\n *  cross-collection) pool of records, optionally narrowed by `where` and\n *  reduced to a single record by `from`. */\nexport type DynamicIconSource = z.infer<typeof DynamicIconSourceZ>;\n\n/** Declarative \"data state → icon\" mapping for a collection's launcher\n *  shortcut icon (see `CollectionSchema.dynamicIcon`). When absent, the\n *  launcher icon is the static `schema.icon`. */\nexport type DynamicIconSpec = z.infer<typeof DynamicIconSpecZ>;\n\n/** The `ingest` block as the schema validator accepts it — a discriminated\n *  union on `kind` (declarative retrievers | agent worker). The feeds\n *  subsystem's `IngestSpec` is the same union under its historical name. */\nexport type CollectionIngestSpec = z.infer<typeof IngestZ>;\n\n/** The `dataSource` block: this collection's records are the rows of an\n *  external read-only data file (v1: CSV). See `DataSourceZ`. */\nexport type CollectionDataSource = z.infer<typeof DataSourceZ>;\n\n/** The `storage` block: an alternative WRITABLE record backend (v1:\n *  sqlite). See `StorageZ`. */\nexport type CollectionStorage = z.infer<typeof StorageZ>;\n\n/** Every storage backend a schema can select. `file` is the implicit\n *  default (`dataPath`); `csv` is implied by `dataSource`; other kinds are\n *  named explicitly via `storage.type`. The server's store factory registry\n *  (`server/store.ts`) is keyed by this. */\nexport type CollectionStorageKind = \"file\" | \"csv\" | \"sqlite\";\n\n/** Which storage backend serves this schema's records. Derived, not stored:\n *  existing schemas carry no `storage` key and must keep resolving exactly\n *  as before (`dataSource` ⇒ csv, else file). */\nexport function storageKindFor(schema: Pick<CollectionSchema, \"dataSource\" | \"storage\">): CollectionStorageKind {\n  if (schema.dataSource !== undefined) return \"csv\";\n  return schema.storage?.type ?? \"file\";\n}\n\n/** The whole `schema.json` contract. Key-level docs live on\n *  `CollectionSchemaZ` in `./schemaZ`. */\nexport type CollectionSchema = z.infer<typeof CollectionSchemaZ>;\n\n/** True when `schema` declares an external `dataSource` — i.e. the\n *  collection is READ-ONLY through every UI/tool write path (updates\n *  happen by editing/replacing the data file itself). Isomorphic: both\n *  the server write guards and the client's control hiding key off this\n *  one predicate. */\nexport function isReadOnlySchema(schema: Pick<CollectionSchema, \"dataSource\">): boolean {\n  return schema.dataSource !== undefined;\n}\n\nexport interface CollectionSummary {\n  slug: string;\n  title: string;\n  icon: string;\n  source: CollectionSource;\n  /** Present (true) when the collection is backed by an external\n   *  `dataSource` and therefore read-only in every UI/tool write path.\n   *  Absent-when-writable, matching the other optional summary flags. */\n  readonly?: true;\n  /** Slugs of the source collection(s) a `dynamicIcon` icon was computed\n   *  from — present only when `schema.dynamicIcon` is set. Lets a client\n   *  know which collection change-channel(s) to watch for a live icon\n   *  update (see `useDynamicShortcutIcons`). */\n  iconSources?: string[];\n}\n\nexport interface CollectionDetail extends CollectionSummary {\n  schema: CollectionSchema;\n}\n\nexport type CollectionItem = Record<string, unknown>;\n\n/** Resolve an `embed` field's target record id: the fixed `id`, or the value\n *  of the sibling `idField` on this record (empty string when neither applies\n *  — the caller renders that as \"no record\"). Pure + isomorphic so the server\n *  projection (`derive.ts`) and the client preview (`useCollectionRendering`)\n *  resolve embeds identically. Non-`embed` fields resolve to \"no record\". */\nexport function embedTargetId(field: CollectionFieldSpec, record: CollectionItem | null): string {\n  if (field.type !== \"embed\") return \"\";\n  if (field.id) return field.id;\n  if (field.idField && record) return fieldText(record[field.idField]);\n  return \"\";\n}\n","// Pure slug / record-id character rules. Shared by the isomorphic schema\n// validator (`./schemaZ`) — which must stay node-free — and the server-side\n// path sanitisers (`../server/paths`), which wrap these patterns with the\n// `path.basename` round-trip CodeQL recognises as a `js/path-injection`\n// sanitiser. Both layers MUST gate on the same patterns; importing them from\n// here is what keeps them in sync.\n\n// The ONE slug pattern — `server/workspace/skills/catalog.ts` imports it\n// for its own sanitiser, so there is no second copy to keep in sync.\n// Bounded character classes, no nested quantifiers; ReDoS-safe.\nimport { fieldText } from \"./fieldText\";\nimport type { CollectionItem } from \"./schema\";\n\n// eslint-disable-next-line security/detect-unsafe-regex -- non-overlapping character classes, no catastrophic backtracking\nexport const SAFE_SLUG_PATTERN = /^[a-zA-Z0-9](?:[a-zA-Z0-9_-]*[a-zA-Z0-9])?$/;\n\n// Record ids are a superset of slugs: they're only ever filename stems\n// (`<id>.json`), never directory names or URL segments, so they may carry\n// dots — natural keys like a Slack ts (`1718900000.123456`), a SemVer\n// (`1.2.3`), or a decimal timestamp. The interior class adds `.` to the slug\n// set; the explicit `..` reject in `isSafeRecordId` keeps a\n// parent-dir-looking segment out while still allowing repeated `-`/`_`\n// (`a--b`, `a__b`). Start/end stay alphanumeric so leading/trailing dots\n// (hidden files, the special `.`/`..` names) and `..`-only ids are all\n// excluded.\n// eslint-disable-next-line security/detect-unsafe-regex -- non-overlapping character classes, no catastrophic backtracking\nexport const SAFE_RECORD_ID_PATTERN = /^[a-zA-Z0-9](?:[a-zA-Z0-9_.-]*[a-zA-Z0-9])?$/;\n\n/** True when `value` is a well-formed collection slug (alphanumeric /\n *  hyphen / underscore, no path separators). The pattern admits no `/`,\n *  `\\`, or `.`, so a passing value is trivially also a safe basename —\n *  validation callers need no `path.basename` round-trip (path-building\n *  callers use `../server/paths#safeSlugName`, which adds it). */\nexport function isSafeSlug(value: string): boolean {\n  return typeof value === \"string\" && SAFE_SLUG_PATTERN.test(value);\n}\n\n/** True when `value` is a well-formed record id (slug charset plus interior\n *  dots), with any `..` substring rejected explicitly. Validation-only\n *  counterpart of `../server/paths#safeRecordId`. */\nexport function isSafeRecordId(value: string): boolean {\n  if (typeof value !== \"string\" || !SAFE_RECORD_ID_PATTERN.test(value)) return false;\n  return !value.includes(\"..\");\n}\n\nconst DEFAULT_UNIQUE_ID_ATTEMPTS = 8;\n\n/** Pick an id not already in `existing`, re-rolling `generate()` up to\n *  `maxAttempts` times before giving up and returning the last candidate.\n *  Collisions on a wide id space are astronomically unlikely, so a caller's\n *  own overwrite guard is the final backstop rather than an unbounded loop. */\nexport function generateUniqueId(existing: ReadonlySet<string>, generate: () => string, maxAttempts: number = DEFAULT_UNIQUE_ID_ATTEMPTS): string {\n  let candidate = generate();\n  for (let attempt = 0; attempt < maxAttempts && existing.has(candidate); attempt++) {\n    candidate = generate();\n  }\n  return candidate;\n}\n\n/** An id not already used by any loaded record: collects the in-memory primary\n *  keys and re-rolls `generate()` against them (see {@link generateUniqueId}).\n *  The pure core of the view's create-form id prefill. */\nexport function nextUniqueItemId(\n  items: readonly CollectionItem[],\n  primaryKey: string,\n  generate: () => string,\n  maxAttempts: number = DEFAULT_UNIQUE_ID_ATTEMPTS,\n): string {\n  const existing = new Set(items.map((item) => fieldText(item[primaryKey])));\n  return generateUniqueId(existing, generate, maxAttempts);\n}\n","// Pure, deterministic helpers for the collection calendar view: parse\n// `date`-field values, build a month grid, and bucket records onto the\n// days they cover. No `Date.now()` / `new Date()` (argless) here — every\n// function takes its inputs explicitly so the logic is unit-testable\n// without faking the clock. All internal arithmetic runs in UTC (which\n// has no DST), so fixed 86_400_000 ms steps never skip or double a day.\n\nconst MS_PER_DAY = 86_400_000;\nconst ISO_DATE_RE = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n// A two-digit field (hours / minutes / seconds) of a clock value.\nconst TWO_DIGIT_RE = /^\\d{2}$/;\n// A single clock token inside a free-form `time` string field (e.g. the\n// \"14:00-17:00\" / \"17:00-\" / \"16:30\" / \"終日\" shapes seen in user data).\nconst CLOCK_RE = /(\\d{1,2}):(\\d{2})/g;\n// Range separators we tolerate between two clock tokens: ASCII hyphen, en/em\n// dash, tilde, and the Japanese wave dashes.\nconst RANGE_SEP_RE = /[-–—~〜～]/;\n\n/** Minutes in a full day — the timeline's vertical extent. */\nexport const MINUTES_PER_DAY = 1440;\n\n/** A civil date triple. `month` is 1-12 (NOT the 0-based `Date` month). */\nexport interface Ymd {\n  year: number;\n  month: number;\n  day: number;\n}\n\n/** One cell of the 6×7 month grid. */\nexport interface DayCell {\n  ymd: Ymd;\n  /** False for the leading/trailing days that belong to the adjacent\n   *  month (rendered greyed). */\n  inMonth: boolean;\n  /** Canonical `YYYY-MM-DD` key for this cell. */\n  key: string;\n}\n\n/** A record placed on the calendar: the inclusive `[start, end]` span of\n *  days it covers. `end === start` for a single-day record. `startMin` /\n *  `endMin` are minutes-of-day for the time-allocation (day) view, resolved\n *  from either a `datetime` field's clock or a separate time-string field.\n *  `null` means \"no clock\" — `startMin === null && endMin === null` is an\n *  all-day record; a non-null `startMin` with a null `endMin` is a\n *  point-in-time record (rendered as a single line). */\nexport interface RecordSpan<T> {\n  item: T;\n  start: Ymd;\n  end: Ymd;\n  startMin: number | null;\n  endMin: number | null;\n}\n\nfunction pad2(value: number): string {\n  return String(value).padStart(2, \"0\");\n}\n\n/** Canonical `YYYY-MM-DD` string for a civil date. */\nexport function ymdKey(ymd: Ymd): string {\n  return `${String(ymd.year).padStart(4, \"0\")}-${pad2(ymd.month)}-${pad2(ymd.day)}`;\n}\n\n/** Strictly parse a `YYYY-MM-DD` string into a civil date, rejecting\n *  anything that isn't a real calendar day (e.g. `2026-02-30`, `2026-13-01`).\n *  Returns null for non-strings and malformed values so callers can route\n *  records with no usable date into the \"no date\" tray rather than crash. */\nexport function parseIsoDate(value: unknown): Ymd | null {\n  if (typeof value !== \"string\") return null;\n  const match = ISO_DATE_RE.exec(value.trim());\n  if (!match) return null;\n  const year = Number(match[1]);\n  const month = Number(match[2]);\n  const day = Number(match[3]);\n  // Round-trip through a UTC Date to reject impossible days: a value the\n  // Date constructor rolls over (Feb 30 → Mar 2) won't match back.\n  const probe = new Date(Date.UTC(year, month - 1, day));\n  if (probe.getUTCFullYear() !== year || probe.getUTCMonth() !== month - 1 || probe.getUTCDate() !== day) return null;\n  return { year, month, day };\n}\n\n/** Minutes-of-day for an `HH:MM` pair, or null when out of range. */\nfunction clockToMinutes(hours: number, minutes: number): number | null {\n  if (hours < 0 || hours > 23 || minutes < 0 || minutes > 59) return null;\n  return hours * 60 + minutes;\n}\n\n/** Strictly parse a `YYYY-MM-DDTHH:MM` (optional `:SS`) datetime into its\n *  civil date and minutes-of-day. Returns null for anything that isn't a real\n *  calendar day or a valid 24h clock. */\nexport function parseIsoDateTime(value: unknown): { ymd: Ymd; minutes: number } | null {\n  if (typeof value !== \"string\") return null;\n  const trimmed = value.trim();\n  const tIndex = trimmed.indexOf(\"T\");\n  if (tIndex === -1) return null;\n  const ymd = parseIsoDate(trimmed.slice(0, tIndex));\n  if (!ymd) return null;\n  // `HH:MM` with an optional `:SS` the browser appends for non-zero seconds.\n  const parts = trimmed.slice(tIndex + 1).split(\":\");\n  if (parts.length < 2 || parts.length > 3 || !parts.every((part) => TWO_DIGIT_RE.test(part))) return null;\n  const minutes = clockToMinutes(Number(parts[0]), Number(parts[1]));\n  if (minutes === null) return null;\n  return { ymd, minutes };\n}\n\n/** Civil date from either a `YYYY-MM-DD` or a `YYYY-MM-DDTHH:MM` value, so the\n *  month grid buckets date-only and datetime anchors alike. */\nexport function dateOf(value: unknown): Ymd | null {\n  return parseIsoDate(value) ?? parseIsoDateTime(value)?.ymd ?? null;\n}\n\n/** Minutes-of-day from a datetime value, or null for date-only / invalid. */\nfunction timeOf(value: unknown): number | null {\n  return parseIsoDateTime(value)?.minutes ?? null;\n}\n\n/** Parse a free-form time-string field into start/end minutes-of-day.\n *  Handles the common shapes in user data:\n *    \"14:00-17:00\" → { start: 840, end: 1020 }   (range → block)\n *    \"17:00-\"      → { start: 1020, end: null }   (open end → single line)\n *    \"16:30\"       → { start: 990, end: null }    (point in time → single line)\n *    \"終日\" / \"\"   → null                          (no clock → all-day)\n *  Returns null when no clock token is parseable. */\nexport function parseTimeRange(value: unknown): { startMin: number | null; endMin: number | null } | null {\n  if (typeof value !== \"string\") return null;\n  const text = value.trim();\n  if (!text) return null;\n  const tokens = [...text.matchAll(CLOCK_RE)];\n  if (tokens.length === 0) return null;\n  const minutesOf = (match: RegExpMatchArray): number | null => clockToMinutes(Number(match[1]), Number(match[2]));\n  // No separator → a single point in time (start only).\n  if (!RANGE_SEP_RE.test(text)) {\n    const [firstToken] = tokens;\n    const startMin = firstToken ? minutesOf(firstToken) : null;\n    return startMin === null ? null : { startMin, endMin: null };\n  }\n  // Separator present → assign each token to the side of the first separator.\n  const sepIndex = text.search(RANGE_SEP_RE);\n  let startMin: number | null = null;\n  let endMin: number | null = null;\n  for (const token of tokens) {\n    if ((token.index ?? 0) < sepIndex) startMin = minutesOf(token);\n    else endMin = minutesOf(token);\n  }\n  // A start-less range (\"-09:00\") has no anchor on the timeline → treat as\n  // unparseable so the record falls back to the all-day strip.\n  if (startMin === null) return null;\n  return { startMin, endMin };\n}\n\nfunction ymdToUtcMs(ymd: Ymd): number {\n  return Date.UTC(ymd.year, ymd.month - 1, ymd.day);\n}\n\nfunction utcMsToYmd(epochMs: number): Ymd {\n  const date = new Date(epochMs);\n  return { year: date.getUTCFullYear(), month: date.getUTCMonth() + 1, day: date.getUTCDate() };\n}\n\n/** Chronological comparison: negative if `left` precedes `right`, 0 if the\n *  same day, positive if after. */\nexport function compareYmd(left: Ymd, right: Ymd): number {\n  return ymdToUtcMs(left) - ymdToUtcMs(right);\n}\n\n/** True iff `day` falls within the inclusive span `[span.start, span.end]`. */\nexport function spanCoversDay<T>(span: RecordSpan<T>, day: Ymd): boolean {\n  return compareYmd(span.start, day) <= 0 && compareYmd(day, span.end) <= 0;\n}\n\n/** Build the 6×7 (42-cell) grid for the given month, including the\n *  leading/trailing days of the adjacent months so every week is full.\n *  `month` is 1-12. `weekStartsOn` is 0 (Sunday) … 6 (Saturday). */\nexport function buildMonthGrid(year: number, month: number, weekStartsOn = 0): DayCell[] {\n  const firstWeekday = new Date(Date.UTC(year, month - 1, 1)).getUTCDay();\n  const lead = (firstWeekday - weekStartsOn + 7) % 7;\n  const startMs = Date.UTC(year, month - 1, 1) - lead * MS_PER_DAY;\n  const cells: DayCell[] = [];\n  for (let i = 0; i < 42; i++) {\n    const ymd = utcMsToYmd(startMs + i * MS_PER_DAY);\n    cells.push({ ymd, inMonth: ymd.year === year && ymd.month === month, key: ymdKey(ymd) });\n  }\n  return cells;\n}\n\n/** Resolve a record's calendar span from its date/datetime fields. Returns\n *  null when the anchor date is missing/invalid (→ the caller's \"no date\"\n *  tray). An end date that is missing, invalid, or earlier than the start\n *  collapses to a single-day span — never an inverted range.\n *\n *  Times for the day (time-allocation) view come from, in priority order:\n *    1. the clock on a `datetime` anchor/end value, else\n *    2. `timeField` — a separate free-form time-string column (e.g. \"14:00-17:00\").\n *  A record with no resolvable clock has `startMin === endMin === null`. */\nexport function recordSpan<T extends Record<string, unknown>>(item: T, anchorField: string, endField?: string, timeField?: string): RecordSpan<T> | null {\n  const startRaw = item[anchorField];\n  const start = dateOf(startRaw);\n  if (!start) return null;\n  let end = start;\n  let startMin = timeOf(startRaw);\n  let endMin: number | null = null;\n  if (endField) {\n    const endRaw = item[endField];\n    const parsedEnd = dateOf(endRaw);\n    if (parsedEnd && compareYmd(parsedEnd, start) >= 0) {\n      end = parsedEnd;\n      endMin = timeOf(endRaw);\n    }\n  }\n  // Fall back to a separate time-string field only when the date fields\n  // carried no clock (the date-only anchor + `time` column shape).\n  if (timeField && startMin === null && endMin === null) {\n    const range = parseTimeRange(item[timeField]);\n    if (range) {\n      ({ startMin, endMin } = range);\n    }\n  }\n  return { item, start, end, startMin, endMin };\n}\n\n/** Split records into those that land on the calendar (with their spans)\n *  and those with no usable anchor date (the \"no date\" tray). Spans are\n *  sorted by start day so same-day stacking is stable across renders. */\nexport function bucketRecords<T extends Record<string, unknown>>(\n  items: readonly T[],\n  anchorField: string,\n  endField?: string,\n  timeField?: string,\n): { spans: RecordSpan<T>[]; noDate: T[] } {\n  const spans: RecordSpan<T>[] = [];\n  const noDate: T[] = [];\n  for (const item of items) {\n    const span = recordSpan(item, anchorField, endField, timeField);\n    if (span) spans.push(span);\n    else noDate.push(item);\n  }\n  spans.sort((left, right) => compareYmd(left.start, right.start));\n  return { spans, noDate };\n}\n\n/** Geometry for one record on one day of the time-allocation view.\n *  `kind`:\n *    \"allDay\" — no clock anywhere → render in the bottom all-day strip.\n *    \"line\"   — a single point in time → a 1px marker at `startMin`.\n *    \"block\"  — a [startMin, endMin) span, clamped to this day's [0, 1440).\n *  `bleedsBefore` / `bleedsAfter` flag a multi-day span that began on an\n *  earlier day or continues onto a later one (so the view can show arrows). */\nexport interface DaySlice {\n  kind: \"allDay\" | \"line\" | \"block\";\n  startMin: number;\n  endMin: number;\n  bleedsBefore: boolean;\n  bleedsAfter: boolean;\n}\n\n/** Project a record's span onto a single day for the time-allocation view, or\n *  null when the span doesn't cover that day. */\nexport function daySlice<T>(span: RecordSpan<T>, day: Ymd): DaySlice | null {\n  if (!spanCoversDay(span, day)) return null;\n  // Destructured so the `!== null` tests narrow the clocks where they are used;\n  // reading them back off `span` each time would not.\n  const { startMin: spanStart, endMin: spanEnd } = span;\n  if (spanStart === null && spanEnd === null) {\n    return { kind: \"allDay\", startMin: 0, endMin: MINUTES_PER_DAY, bleedsBefore: false, bleedsAfter: false };\n  }\n  const singleDay = compareYmd(span.start, span.end) === 0;\n  const isStartDay = compareYmd(day, span.start) === 0;\n  const isEndDay = compareYmd(day, span.end) === 0;\n  // A point in time: a start clock with no end, all on one day.\n  if (singleDay && spanStart !== null && spanEnd === null) {\n    return { kind: \"line\", startMin: spanStart, endMin: spanStart, bleedsBefore: false, bleedsAfter: false };\n  }\n  const startMin = isStartDay && spanStart !== null ? spanStart : 0;\n  const endMin = isEndDay && spanEnd !== null ? spanEnd : MINUTES_PER_DAY;\n  // Zero-length or inverted same-day range → degrade to a line.\n  if (singleDay && endMin <= startMin) {\n    return { kind: \"line\", startMin, endMin: startMin, bleedsBefore: false, bleedsAfter: false };\n  }\n  return { kind: \"block\", startMin, endMin, bleedsBefore: !isStartDay, bleedsAfter: !isEndDay };\n}\n\n/** Side-by-side lane assignment for overlapping timeline blocks. Each input\n *  is an `[startMin, endMin)` interval; the result (parallel to the input)\n *  gives each item its `lane` (column index) and the `lanes` total of its\n *  overlap cluster, so a renderer can size every block to `1 / lanes` width\n *  and offset it by `lane / lanes`. Non-overlapping items get `lanes === 1`. */\nexport interface LaneSpan {\n  startMin: number;\n  endMin: number;\n}\nexport interface LaneAssignment {\n  lane: number;\n  lanes: number;\n}\n\n/** One input block paired with its position in the caller's array, so lane\n *  assignment can sort freely and still report back in input order. */\ninterface PositionedSpan {\n  index: number;\n  span: LaneSpan;\n}\n\nfunction sortByStart(blocks: readonly LaneSpan[]): PositionedSpan[] {\n  return [...blocks.entries()]\n    .map(([index, span]) => ({ index, span }))\n    .sort((left, right) => left.span.startMin - right.span.startMin || left.span.endMin - right.span.endMin);\n}\n\ninterface ClusterState {\n  /** Clusters already closed. */\n  done: PositionedSpan[][];\n  /** The cluster still accepting blocks. */\n  current: PositionedSpan[];\n  /** Latest end minute seen in `current` — the cutoff for the next block. */\n  end: number;\n}\n\n/** Cut the start-ordered blocks into overlap clusters: a new cluster begins at\n *  the first block that starts at or after every earlier block has ended. */\nfunction splitClusters(ordered: readonly PositionedSpan[]): PositionedSpan[][] {\n  // Appends into the accumulator's arrays rather than rebuilding them. The\n  // spread form read well but copied both arrays on every block, so a day\n  // whose blocks all overlap cost O(n²) allocations to lay out (#2765).\n  const initial: ClusterState = { done: [], current: [], end: Number.NEGATIVE_INFINITY };\n  const state = ordered.reduce<ClusterState>((acc, block) => {\n    if (acc.current.length > 0 && block.span.startMin >= acc.end) {\n      acc.done.push(acc.current);\n      return { done: acc.done, current: [block], end: block.span.endMin };\n    }\n    acc.current.push(block);\n    return { done: acc.done, current: acc.current, end: Math.max(acc.end, block.span.endMin) };\n  }, initial);\n  if (state.current.length > 0) state.done.push(state.current);\n  return state.done;\n}\n\n/** Greedy lane packing inside one cluster: reuse the first lane already free at\n *  this block's start, else open a new one. Every member reports the cluster's\n *  final lane count so a renderer can size each block to `1 / lanes`. */\nfunction packCluster(cluster: readonly PositionedSpan[]): [number, LaneAssignment][] {\n  const laneEnds: number[] = [];\n  const placed = cluster.map(({ index, span }) => {\n    const reusable = laneEnds.findIndex((end) => end <= span.startMin);\n    const lane = reusable === -1 ? laneEnds.length : reusable;\n    laneEnds[lane] = span.endMin;\n    return { index, lane };\n  });\n  return placed.map(({ index, lane }) => [index, { lane, lanes: laneEnds.length }]);\n}\n\nexport function assignLanes(blocks: readonly LaneSpan[]): LaneAssignment[] {\n  const clusters = splitClusters(sortByStart(blocks));\n  const assignments = new Map<number, LaneAssignment>(clusters.flatMap(packCluster));\n  return blocks.map((_, index) => assignments.get(index) ?? { lane: 0, lanes: 1 });\n}\n\n/** Month label key inputs — returns the 1st of the month as a `Date` so the\n *  component can feed it to `Intl.DateTimeFormat(locale, …)` for a localized\n *  \"April 2026\" header without this module taking a locale dependency. */\nexport function monthAnchorDate(year: number, month: number): Date {\n  return new Date(Date.UTC(year, month - 1, 1));\n}\n"],"mappings":";;;AAeA,IAAM,cAAc,UAClB,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,iBAAiB;;;;;;;AAQ3G,SAAgB,gBAAgB,OAA+B;CAC7D,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO;CAC/B,IAAI,iBAAiB,MAKnB,OAAO,OAAO,MAAM,MAAM,QAAQ,CAAC,IAAI,OAAO,MAAM,YAAY;CAElE,OAAO,OAAO,KAAK;AACrB;;;;AAKA,SAAgB,UAAU,OAAgB,WAAW,IAAY;CAC/D,OAAO,gBAAgB,KAAK,KAAK;AACnC;;;;;;;AC4BA,IAAa,eAAe;CAAC;CAAO;CAAQ;AAAW;;;;;;;;AAUvD,IAAa,oBAAoB;;AAIjC,IAAa,iBAAiB;CAAC;CAAU;CAAS;CAAU;AAAW;;;;;;;AA4BvE,IAAa,iCAAmD,IAAI,IAAyB;CAAC;CAAW;CAAS;CAAa;CAAU;CAAU;AAAM,CAAC;;AAsE1J,SAAgB,mBAAmB,OAAkE;CACnG,OAAO,eAAe;AACxB;;;;AA2CA,SAAgB,eAAe,QAAiF;CAC9G,IAAI,OAAO,eAAe,KAAA,GAAW,OAAO;CAC5C,OAAO,OAAO,SAAS,QAAQ;AACjC;;;;;;AAWA,SAAgB,iBAAiB,QAAuD;CACtF,OAAO,OAAO,eAAe,KAAA;AAC/B;;;;;;AA6BA,SAAgB,cAAc,OAA4B,QAAuC;CAC/F,IAAI,MAAM,SAAS,SAAS,OAAO;CACnC,IAAI,MAAM,IAAI,OAAO,MAAM;CAC3B,IAAI,MAAM,WAAW,QAAQ,OAAO,UAAU,OAAO,MAAM,QAAQ;CACnE,OAAO;AACT;;;ACvQA,IAAa,oBAAoB;AAYjC,IAAa,yBAAyB;;;;;;AAOtC,SAAgB,WAAW,OAAwB;CACjD,OAAO,OAAO,UAAU,YAAY,kBAAkB,KAAK,KAAK;AAClE;;;;AAKA,SAAgB,eAAe,OAAwB;CACrD,IAAI,OAAO,UAAU,YAAY,CAAC,uBAAuB,KAAK,KAAK,GAAG,OAAO;CAC7E,OAAO,CAAC,MAAM,SAAS,IAAI;AAC7B;AAEA,IAAM,6BAA6B;;;;;AAMnC,SAAgB,iBAAiB,UAA+B,UAAwB,cAAsB,4BAAoC;CAChJ,IAAI,YAAY,SAAS;CACzB,KAAK,IAAI,UAAU,GAAG,UAAU,eAAe,SAAS,IAAI,SAAS,GAAG,WACtE,YAAY,SAAS;CAEvB,OAAO;AACT;;;;AAKA,SAAgB,iBACd,OACA,YACA,UACA,cAAsB,4BACd;CAER,OAAO,iBAAiB,IADH,IAAI,MAAM,KAAK,SAAS,UAAU,KAAK,WAAW,CAAC,CAChD,GAAU,UAAU,WAAW;AACzD;;;AC/DA,IAAM,aAAa;AACnB,IAAM,cAAc;AAEpB,IAAM,eAAe;AAGrB,IAAM,WAAW;AAGjB,IAAM,eAAe;;AAGrB,IAAa,kBAAkB;AAkC/B,SAAS,KAAK,OAAuB;CACnC,OAAO,OAAO,KAAK,CAAC,CAAC,SAAS,GAAG,GAAG;AACtC;;AAGA,SAAgB,OAAO,KAAkB;CACvC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,EAAE,GAAG,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,IAAI,GAAG;AAChF;;;;;AAMA,SAAgB,aAAa,OAA4B;CACvD,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,QAAQ,YAAY,KAAK,MAAM,KAAK,CAAC;CAC3C,IAAI,CAAC,OAAO,OAAO;CACnB,MAAM,OAAO,OAAO,MAAM,EAAE;CAC5B,MAAM,QAAQ,OAAO,MAAM,EAAE;CAC7B,MAAM,MAAM,OAAO,MAAM,EAAE;CAG3B,MAAM,QAAQ,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,GAAG,CAAC;CACrD,IAAI,MAAM,eAAe,MAAM,QAAQ,MAAM,YAAY,MAAM,QAAQ,KAAK,MAAM,WAAW,MAAM,KAAK,OAAO;CAC/G,OAAO;EAAE;EAAM;EAAO;CAAI;AAC5B;;AAGA,SAAS,eAAe,OAAe,SAAgC;CACrE,IAAI,QAAQ,KAAK,QAAQ,MAAM,UAAU,KAAK,UAAU,IAAI,OAAO;CACnE,OAAO,QAAQ,KAAK;AACtB;;;;AAKA,SAAgB,iBAAiB,OAAsD;CACrF,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,UAAU,MAAM,KAAK;CAC3B,MAAM,SAAS,QAAQ,QAAQ,GAAG;CAClC,IAAI,WAAW,IAAI,OAAO;CAC1B,MAAM,MAAM,aAAa,QAAQ,MAAM,GAAG,MAAM,CAAC;CACjD,IAAI,CAAC,KAAK,OAAO;CAEjB,MAAM,QAAQ,QAAQ,MAAM,SAAS,CAAC,CAAC,CAAC,MAAM,GAAG;CACjD,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,CAAC,MAAM,OAAO,SAAS,aAAa,KAAK,IAAI,CAAC,GAAG,OAAO;CACpG,MAAM,UAAU,eAAe,OAAO,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC;CACjE,IAAI,YAAY,MAAM,OAAO;CAC7B,OAAO;EAAE;EAAK;CAAQ;AACxB;;;AAIA,SAAgB,OAAO,OAA4B;CACjD,OAAO,aAAa,KAAK,KAAK,iBAAiB,KAAK,CAAC,EAAE,OAAO;AAChE;;AAGA,SAAS,OAAO,OAA+B;CAC7C,OAAO,iBAAiB,KAAK,CAAC,EAAE,WAAW;AAC7C;;;;;;;;AASA,SAAgB,eAAe,OAA2E;CACxG,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,OAAO,MAAM,KAAK;CACxB,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,SAAS,CAAC,GAAG,KAAK,SAAS,QAAQ,CAAC;CAC1C,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,aAAa,UAA2C,eAAe,OAAO,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC;CAE/G,IAAI,CAAC,aAAa,KAAK,IAAI,GAAG;EAC5B,MAAM,CAAC,cAAc;EACrB,MAAM,WAAW,aAAa,UAAU,UAAU,IAAI;EACtD,OAAO,aAAa,OAAO,OAAO;GAAE;GAAU,QAAQ;EAAK;CAC7D;CAEA,MAAM,WAAW,KAAK,OAAO,YAAY;CACzC,IAAI,WAA0B;CAC9B,IAAI,SAAwB;CAC5B,KAAK,MAAM,SAAS,QAClB,KAAK,MAAM,SAAS,KAAK,UAAU,WAAW,UAAU,KAAK;MACxD,SAAS,UAAU,KAAK;CAI/B,IAAI,aAAa,MAAM,OAAO;CAC9B,OAAO;EAAE;EAAU;CAAO;AAC5B;AAEA,SAAS,WAAW,KAAkB;CACpC,OAAO,KAAK,IAAI,IAAI,MAAM,IAAI,QAAQ,GAAG,IAAI,GAAG;AAClD;AAEA,SAAS,WAAW,SAAsB;CACxC,MAAM,OAAO,IAAI,KAAK,OAAO;CAC7B,OAAO;EAAE,MAAM,KAAK,eAAe;EAAG,OAAO,KAAK,YAAY,IAAI;EAAG,KAAK,KAAK,WAAW;CAAE;AAC9F;;;AAIA,SAAgB,WAAW,MAAW,OAAoB;CACxD,OAAO,WAAW,IAAI,IAAI,WAAW,KAAK;AAC5C;;AAGA,SAAgB,cAAiB,MAAqB,KAAmB;CACvE,OAAO,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,KAAK,GAAG,KAAK;AAC1E;;;;AAKA,SAAgB,eAAe,MAAc,OAAe,eAAe,GAAc;CAEvF,MAAM,QADe,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,UAC9C,IAAe,eAAe,KAAK;CACjD,MAAM,UAAU,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,IAAI,OAAO;CACtD,MAAM,QAAmB,CAAC;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,MAAM,WAAW,UAAU,IAAI,UAAU;EAC/C,MAAM,KAAK;GAAE;GAAK,SAAS,IAAI,SAAS,QAAQ,IAAI,UAAU;GAAO,KAAK,OAAO,GAAG;EAAE,CAAC;CACzF;CACA,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,WAA8C,MAAS,aAAqB,UAAmB,WAA0C;CACvJ,MAAM,WAAW,KAAK;CACtB,MAAM,QAAQ,OAAO,QAAQ;CAC7B,IAAI,CAAC,OAAO,OAAO;CACnB,IAAI,MAAM;CACV,IAAI,WAAW,OAAO,QAAQ;CAC9B,IAAI,SAAwB;CAC5B,IAAI,UAAU;EACZ,MAAM,SAAS,KAAK;EACpB,MAAM,YAAY,OAAO,MAAM;EAC/B,IAAI,aAAa,WAAW,WAAW,KAAK,KAAK,GAAG;GAClD,MAAM;GACN,SAAS,OAAO,MAAM;EACxB;CACF;CAGA,IAAI,aAAa,aAAa,QAAQ,WAAW,MAAM;EACrD,MAAM,QAAQ,eAAe,KAAK,UAAU;EAC5C,IAAI,OACF,CAAC,CAAE,UAAU,UAAW;CAE5B;CACA,OAAO;EAAE;EAAM;EAAO;EAAK;EAAU;CAAO;AAC9C;;;;AAKA,SAAgB,cACd,OACA,aACA,UACA,WACyC;CACzC,MAAM,QAAyB,CAAC;CAChC,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,WAAW,MAAM,aAAa,UAAU,SAAS;EAC9D,IAAI,MAAM,MAAM,KAAK,IAAI;OACpB,OAAO,KAAK,IAAI;CACvB;CACA,MAAM,MAAM,MAAM,UAAU,WAAW,KAAK,OAAO,MAAM,KAAK,CAAC;CAC/D,OAAO;EAAE;EAAO;CAAO;AACzB;;;AAmBA,SAAgB,SAAY,MAAqB,KAA2B;CAC1E,IAAI,CAAC,cAAc,MAAM,GAAG,GAAG,OAAO;CAGtC,MAAM,EAAE,UAAU,WAAW,QAAQ,YAAY;CACjD,IAAI,cAAc,QAAQ,YAAY,MACpC,OAAO;EAAE,MAAM;EAAU,UAAU;EAAG,QAAQ;EAAiB,cAAc;EAAO,aAAa;CAAM;CAEzG,MAAM,YAAY,WAAW,KAAK,OAAO,KAAK,GAAG,MAAM;CACvD,MAAM,aAAa,WAAW,KAAK,KAAK,KAAK,MAAM;CACnD,MAAM,WAAW,WAAW,KAAK,KAAK,GAAG,MAAM;CAE/C,IAAI,aAAa,cAAc,QAAQ,YAAY,MACjD,OAAO;EAAE,MAAM;EAAQ,UAAU;EAAW,QAAQ;EAAW,cAAc;EAAO,aAAa;CAAM;CAEzG,MAAM,WAAW,cAAc,cAAc,OAAO,YAAY;CAChE,MAAM,SAAS,YAAY,YAAY,OAAO,UAAU;CAExD,IAAI,aAAa,UAAU,UACzB,OAAO;EAAE,MAAM;EAAQ;EAAU,QAAQ;EAAU,cAAc;EAAO,aAAa;CAAM;CAE7F,OAAO;EAAE,MAAM;EAAS;EAAU;EAAQ,cAAc,CAAC;EAAY,aAAa,CAAC;CAAS;AAC9F;AAuBA,SAAS,YAAY,QAA+C;CAClE,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CACzB,KAAK,CAAC,OAAO,WAAW;EAAE;EAAO;CAAK,EAAE,CAAC,CACzC,MAAM,MAAM,UAAU,KAAK,KAAK,WAAW,MAAM,KAAK,YAAY,KAAK,KAAK,SAAS,MAAM,KAAK,MAAM;AAC3G;;;AAaA,SAAS,cAAc,SAAwD;CAI7E,MAAM,UAAwB;EAAE,MAAM,CAAC;EAAG,SAAS,CAAC;EAAG,KAAK,OAAO;CAAkB;CACrF,MAAM,QAAQ,QAAQ,QAAsB,KAAK,UAAU;EACzD,IAAI,IAAI,QAAQ,SAAS,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK;GAC5D,IAAI,KAAK,KAAK,IAAI,OAAO;GACzB,OAAO;IAAE,MAAM,IAAI;IAAM,SAAS,CAAC,KAAK;IAAG,KAAK,MAAM,KAAK;GAAO;EACpE;EACA,IAAI,QAAQ,KAAK,KAAK;EACtB,OAAO;GAAE,MAAM,IAAI;GAAM,SAAS,IAAI;GAAS,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM;EAAE;CAC3F,GAAG,OAAO;CACV,IAAI,MAAM,QAAQ,SAAS,GAAG,MAAM,KAAK,KAAK,MAAM,OAAO;CAC3D,OAAO,MAAM;AACf;;;;AAKA,SAAS,YAAY,SAAgE;CACnF,MAAM,WAAqB,CAAC;CAO5B,OANe,QAAQ,KAAK,EAAE,OAAO,WAAW;EAC9C,MAAM,WAAW,SAAS,WAAW,QAAQ,OAAO,KAAK,QAAQ;EACjE,MAAM,OAAO,aAAa,KAAK,SAAS,SAAS;EACjD,SAAS,QAAQ,KAAK;EACtB,OAAO;GAAE;GAAO;EAAK;CACvB,CACO,CAAA,CAAO,KAAK,EAAE,OAAO,WAAW,CAAC,OAAO;EAAE;EAAM,OAAO,SAAS;CAAO,CAAC,CAAC;AAClF;AAEA,SAAgB,YAAY,QAA+C;CACzE,MAAM,WAAW,cAAc,YAAY,MAAM,CAAC;CAClD,MAAM,cAAc,IAAI,IAA4B,SAAS,QAAQ,WAAW,CAAC;CACjF,OAAO,OAAO,KAAK,GAAG,UAAU,YAAY,IAAI,KAAK,KAAK;EAAE,MAAM;EAAG,OAAO;CAAE,CAAC;AACjF;;;;AAKA,SAAgB,gBAAgB,MAAc,OAAqB;CACjE,OAAO,IAAI,KAAK,KAAK,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC9C"}

package/dist/{calendarGrid-BQYqOCnF.cjs → calendarGrid-p8K-7cuB.cjs}

@@ -208,7 +208,8 @@ function parseTimeRange(value) {
 	if (tokens.length === 0) return null;
 	const minutesOf = (match) => clockToMinutes(Number(match[1]), Number(match[2]));
 	if (!RANGE_SEP_RE.test(text)) {
-		const startMin = minutesOf(tokens[0]);
+		const [firstToken] = tokens;
+		const startMin = firstToken ? minutesOf(firstToken) : null;
 		return startMin === null ? null : {
 			startMin,
 			endMin: null
@@ -354,35 +355,64 @@ function daySlice(span, day) {
 		bleedsAfter: !isEndDay
 	};
 }
+function sortByStart(blocks) {
+	return [...blocks.entries()].map(([index, span]) => ({
+		index,
+		span
+	})).sort((left, right) => left.span.startMin - right.span.startMin || left.span.endMin - right.span.endMin);
+}
+/** Cut the start-ordered blocks into overlap clusters: a new cluster begins at
+*  the first block that starts at or after every earlier block has ended. */
+function splitClusters(ordered) {
+	const initial = {
+		done: [],
+		current: [],
+		end: Number.NEGATIVE_INFINITY
+	};
+	const state = ordered.reduce((acc, block) => {
+		if (acc.current.length > 0 && block.span.startMin >= acc.end) {
+			acc.done.push(acc.current);
+			return {
+				done: acc.done,
+				current: [block],
+				end: block.span.endMin
+			};
+		}
+		acc.current.push(block);
+		return {
+			done: acc.done,
+			current: acc.current,
+			end: Math.max(acc.end, block.span.endMin)
+		};
+	}, initial);
+	if (state.current.length > 0) state.done.push(state.current);
+	return state.done;
+}
+/** Greedy lane packing inside one cluster: reuse the first lane already free at
+*  this block's start, else open a new one. Every member reports the cluster's
+*  final lane count so a renderer can size each block to `1 / lanes`. */
+function packCluster(cluster) {
+	const laneEnds = [];
+	return cluster.map(({ index, span }) => {
+		const reusable = laneEnds.findIndex((end) => end <= span.startMin);
+		const lane = reusable === -1 ? laneEnds.length : reusable;
+		laneEnds[lane] = span.endMin;
+		return {
+			index,
+			lane
+		};
+	}).map(({ index, lane }) => [index, {
+		lane,
+		lanes: laneEnds.length
+	}]);
+}
 function assignLanes(blocks) {
-	const order = [...blocks.keys()].sort((left, right) => blocks[left].startMin - blocks[right].startMin || blocks[left].endMin - blocks[right].endMin);
-	const result = blocks.map(() => ({
+	const clusters = splitClusters(sortByStart(blocks));
+	const assignments = new Map(clusters.flatMap(packCluster));
+	return blocks.map((_, index) => assignments.get(index) ?? {
 		lane: 0,
 		lanes: 1
-	}));
-	let cluster = [];
-	let clusterEnd = Number.NEGATIVE_INFINITY;
-	const laneEnds = [];
-	const flush = () => {
-		for (const index of cluster) result[index].lanes = laneEnds.length;
-		cluster = [];
-		laneEnds.length = 0;
-		clusterEnd = Number.NEGATIVE_INFINITY;
-	};
-	for (const index of order) {
-		const block = blocks[index];
-		if (cluster.length > 0 && block.startMin >= clusterEnd) flush();
-		let lane = laneEnds.findIndex((end) => end <= block.startMin);
-		if (lane === -1) {
-			lane = laneEnds.length;
-			laneEnds.push(block.endMin);
-		} else laneEnds[lane] = block.endMin;
-		result[index].lane = lane;
-		cluster.push(index);
-		clusterEnd = Math.max(clusterEnd, block.endMin);
-	}
-	flush();
-	return result;
+	});
 }
 /** Month label key inputs — returns the 1st of the month as a `Date` so the
 *  component can feed it to `Intl.DateTimeFormat(locale, …)` for a localized
@@ -572,4 +602,4 @@ Object.defineProperty(exports, "ymdKey", {
 	}
 });
 
-//# sourceMappingURL=calendarGrid-BQYqOCnF.cjs.map
+//# sourceMappingURL=calendarGrid-p8K-7cuB.cjs.map