@remnic/core 1.1.11 → 1.1.13

package/dist/chunk-YBPYIAA5.js

@@ -0,0 +1,73 @@
+// src/buffer-surprise-report.ts
+async function reportBufferSurpriseDistribution(readEvents, options = {}) {
+  const limit = normalizeReportLimit(options.limit);
+  const raw = await readEvents({ limit, since: options.since });
+  const sinceMs = typeof options.since === "string" && options.since.length > 0 ? Date.parse(options.since) : Number.NaN;
+  const rows = raw.filter((row) => {
+    if (!row || row.event !== "BUFFER_SURPRISE") return false;
+    const ts = Date.parse(row.timestamp);
+    if (!Number.isFinite(ts)) return false;
+    if (typeof row.surpriseScore !== "number") return false;
+    if (!Number.isFinite(row.surpriseScore)) return false;
+    if (row.surpriseScore < 0 || row.surpriseScore > 1) return false;
+    if (typeof row.triggeredFlush !== "boolean") return false;
+    if (Number.isFinite(sinceMs)) {
+      if (!Number.isFinite(ts) || ts <= sinceMs) return false;
+    }
+    return true;
+  }).sort((left, right) => Date.parse(left.timestamp) - Date.parse(right.timestamp));
+  const windowStart = Math.max(0, rows.length - limit);
+  const windowRows = rows.slice(windowStart);
+  if (windowRows.length === 0) {
+    return {
+      count: 0,
+      triggeredCount: 0,
+      triggeredRate: 0,
+      mean: 0,
+      median: 0,
+      p90: 0,
+      min: 0,
+      max: 0,
+      currentThreshold: null
+    };
+  }
+  const scores = windowRows.map((r) => r.surpriseScore).sort((a, b) => a - b);
+  const triggeredCount = windowRows.reduce(
+    (acc, r) => acc + (r.triggeredFlush ? 1 : 0),
+    0
+  );
+  const sum = scores.reduce((acc, v) => acc + v, 0);
+  const mean = sum / scores.length;
+  const median = percentile(scores, 0.5);
+  const p90 = percentile(scores, 0.9);
+  const mostRecent = windowRows[windowRows.length - 1];
+  const currentThreshold = mostRecent && typeof mostRecent.threshold === "number" ? mostRecent.threshold : null;
+  return {
+    count: scores.length,
+    triggeredCount,
+    triggeredRate: triggeredCount / scores.length,
+    mean,
+    median,
+    p90,
+    min: scores[0],
+    max: scores[scores.length - 1],
+    currentThreshold
+  };
+}
+function normalizeReportLimit(limit) {
+  if (limit === void 0) return 200;
+  if (typeof limit !== "number" || !Number.isFinite(limit)) return 200;
+  const floored = Math.floor(limit);
+  return floored > 0 ? floored : 200;
+}
+function percentile(sorted, p) {
+  if (sorted.length === 0) return 0;
+  const clamped = Math.max(0, Math.min(1, p));
+  const rank = Math.max(1, Math.ceil(clamped * sorted.length));
+  return sorted[rank - 1];
+}
+
+export {
+  reportBufferSurpriseDistribution
+};
+//# sourceMappingURL=chunk-YBPYIAA5.js.map

package/dist/chunk-YBPYIAA5.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/buffer-surprise-report.ts"],"sourcesContent":["/**\n * Buffer-surprise telemetry report (issue #563 PR 3).\n *\n * Reads the append-only `state/buffer-surprise-ledger.jsonl` file written\n * by `SmartBuffer` and summarizes the recent distribution of surprise\n * scores for the Doctor surface. This module is intentionally standalone\n * and pure — the only I/O is reading the ledger via the injected\n * `readEvents` callback, so it can be exercised directly in tests\n * without touching the filesystem.\n *\n * # Output shape\n *\n * `BufferSurpriseDistribution` has fields sized for a one-screen Doctor\n * display:\n *\n *   - `count`            — rows considered in the summary window.\n *   - `triggeredCount`   — rows whose `triggeredFlush === true`.\n *   - `triggeredRate`    — `triggeredCount / count`, or `0` when empty.\n *   - `mean`             — arithmetic mean of `surpriseScore`.\n *   - `median`           — middle value (50th percentile).\n *   - `p90`              — 90th percentile (tail of novelty).\n *   - `min`, `max`       — window extremes.\n *   - `currentThreshold` — threshold from the MOST RECENT row, or `null`.\n *\n * All percentile math uses the nearest-rank method (no interpolation) so\n * the report is stable across small windows.\n *\n * # Why a pure function + injected reader?\n *\n * The Doctor surface is exercised both at runtime (through the CLI and\n * gateway tools) and in tests. A pure distribution helper fed from an\n * arbitrary `readEvents` callback keeps the report logic trivially\n * testable without spinning up a real `StorageManager`.\n */\n\nimport type { BufferSurpriseEvent } from \"./types.js\";\n\nexport interface BufferSurpriseDistribution {\n  count: number;\n  triggeredCount: number;\n  triggeredRate: number;\n  mean: number;\n  median: number;\n  p90: number;\n  min: number;\n  max: number;\n  currentThreshold: number | null;\n}\n\nexport interface BufferSurpriseReportOptions {\n  /**\n   * Maximum number of recent rows to include. Defaults to `200` — large\n   * enough to see a distribution, small enough to read in one sitting.\n   */\n  limit?: number;\n  /** Lower-bound ISO timestamp; rows at or before this are excluded. */\n  since?: string;\n}\n\n/**\n * Reader callback shape. The helper does not want to know whether the\n * rows come from a file, a queue, or an in-memory buffer.\n */\nexport type BufferSurpriseReader = (\n  options: BufferSurpriseReportOptions,\n) => Promise<readonly BufferSurpriseEvent[]>;\n\n/**\n * Summarize the recent buffer-surprise distribution. Returns the empty\n * distribution shape when the ledger has no applicable rows — callers can\n * detect this via `count === 0` and render \"no data yet\".\n */\nexport async function reportBufferSurpriseDistribution(\n  readEvents: BufferSurpriseReader,\n  options: BufferSurpriseReportOptions = {},\n): Promise<BufferSurpriseDistribution> {\n  const limit = normalizeReportLimit(options.limit);\n  const raw = await readEvents({ limit, since: options.since });\n\n  // Filter for sanity: finite numeric scores in [0, 1], event tag match,\n  // and the optional `since` lower bound. Malformed rows are skipped.\n  const sinceMs =\n    typeof options.since === \"string\" && options.since.length > 0\n      ? Date.parse(options.since)\n      : Number.NaN;\n  const rows = raw.filter((row): row is BufferSurpriseEvent => {\n    if (!row || row.event !== \"BUFFER_SURPRISE\") return false;\n    const ts = Date.parse(row.timestamp);\n    if (!Number.isFinite(ts)) return false;\n    if (typeof row.surpriseScore !== \"number\") return false;\n    if (!Number.isFinite(row.surpriseScore)) return false;\n    if (row.surpriseScore < 0 || row.surpriseScore > 1) return false;\n    // `triggeredFlush` must be a real boolean — not a string or other\n    // truthy value. A row with `triggeredFlush: \"false\"` (string from a\n    // JSON-parsing bug upstream) would otherwise be counted as\n    // triggered, inflating the rate and misleading operators tuning the\n    // threshold from real traffic.\n    if (typeof row.triggeredFlush !== \"boolean\") return false;\n    if (Number.isFinite(sinceMs)) {\n      if (!Number.isFinite(ts) || ts <= sinceMs) return false;\n    }\n    return true;\n  }).sort((left, right) => Date.parse(left.timestamp) - Date.parse(right.timestamp));\n\n  const windowStart = Math.max(0, rows.length - limit);\n  const windowRows = rows.slice(windowStart);\n\n  if (windowRows.length === 0) {\n    return {\n      count: 0,\n      triggeredCount: 0,\n      triggeredRate: 0,\n      mean: 0,\n      median: 0,\n      p90: 0,\n      min: 0,\n      max: 0,\n      currentThreshold: null,\n    };\n  }\n\n  const scores = windowRows.map((r) => r.surpriseScore).sort((a, b) => a - b);\n  const triggeredCount = windowRows.reduce(\n    (acc, r) => acc + (r.triggeredFlush ? 1 : 0),\n    0,\n  );\n  const sum = scores.reduce((acc, v) => acc + v, 0);\n  const mean = sum / scores.length;\n\n  // Nearest-rank percentiles keep the output stable for small windows.\n  const median = percentile(scores, 0.5);\n  const p90 = percentile(scores, 0.9);\n\n  // \"Current\" threshold is whichever was in force for the most recent row\n  // — not necessarily the one configured right now, but the value the\n  // ledger rows were judged against. That's what operators need to reason\n  // about the distribution.\n  const mostRecent = windowRows[windowRows.length - 1];\n  const currentThreshold =\n    mostRecent && typeof mostRecent.threshold === \"number\"\n      ? mostRecent.threshold\n      : null;\n\n  return {\n    count: scores.length,\n    triggeredCount,\n    triggeredRate: triggeredCount / scores.length,\n    mean,\n    median,\n    p90,\n    min: scores[0]!,\n    max: scores[scores.length - 1]!,\n    currentThreshold,\n  };\n}\n\nfunction normalizeReportLimit(limit: number | undefined): number {\n  if (limit === undefined) return 200;\n  if (typeof limit !== \"number\" || !Number.isFinite(limit)) return 200;\n  const floored = Math.floor(limit);\n  return floored > 0 ? floored : 200;\n}\n\n/**\n * Nearest-rank percentile of a pre-sorted ascending array.\n *\n * Returns `sorted[ceil(p * n) - 1]`, with `p` clamped to `[0, 1]`.\n * This avoids the interpolation ambiguity of R-7/R-8 percentiles and is\n * stable when the window is small (e.g. 3-5 rows).\n */\nfunction percentile(sorted: readonly number[], p: number): number {\n  if (sorted.length === 0) return 0;\n  const clamped = Math.max(0, Math.min(1, p));\n  const rank = Math.max(1, Math.ceil(clamped * sorted.length));\n  return sorted[rank - 1]!;\n}\n"],"mappings":";AAwEA,eAAsB,iCACpB,YACA,UAAuC,CAAC,GACH;AACrC,QAAM,QAAQ,qBAAqB,QAAQ,KAAK;AAChD,QAAM,MAAM,MAAM,WAAW,EAAE,OAAO,OAAO,QAAQ,MAAM,CAAC;AAI5D,QAAM,UACJ,OAAO,QAAQ,UAAU,YAAY,QAAQ,MAAM,SAAS,IACxD,KAAK,MAAM,QAAQ,KAAK,IACxB,OAAO;AACb,QAAM,OAAO,IAAI,OAAO,CAAC,QAAoC;AAC3D,QAAI,CAAC,OAAO,IAAI,UAAU,kBAAmB,QAAO;AACpD,UAAM,KAAK,KAAK,MAAM,IAAI,SAAS;AACnC,QAAI,CAAC,OAAO,SAAS,EAAE,EAAG,QAAO;AACjC,QAAI,OAAO,IAAI,kBAAkB,SAAU,QAAO;AAClD,QAAI,CAAC,OAAO,SAAS,IAAI,aAAa,EAAG,QAAO;AAChD,QAAI,IAAI,gBAAgB,KAAK,IAAI,gBAAgB,EAAG,QAAO;AAM3D,QAAI,OAAO,IAAI,mBAAmB,UAAW,QAAO;AACpD,QAAI,OAAO,SAAS,OAAO,GAAG;AAC5B,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,QAAS,QAAO;AAAA,IACpD;AACA,WAAO;AAAA,EACT,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,MAAM,KAAK,SAAS,IAAI,KAAK,MAAM,MAAM,SAAS,CAAC;AAEjF,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,SAAS,KAAK;AACnD,QAAM,aAAa,KAAK,MAAM,WAAW;AAEzC,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL,OAAO;AAAA,MACP,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,kBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,QAAM,SAAS,WAAW,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC1E,QAAM,iBAAiB,WAAW;AAAA,IAChC,CAAC,KAAK,MAAM,OAAO,EAAE,iBAAiB,IAAI;AAAA,IAC1C;AAAA,EACF;AACA,QAAM,MAAM,OAAO,OAAO,CAAC,KAAK,MAAM,MAAM,GAAG,CAAC;AAChD,QAAM,OAAO,MAAM,OAAO;AAG1B,QAAM,SAAS,WAAW,QAAQ,GAAG;AACrC,QAAM,MAAM,WAAW,QAAQ,GAAG;AAMlC,QAAM,aAAa,WAAW,WAAW,SAAS,CAAC;AACnD,QAAM,mBACJ,cAAc,OAAO,WAAW,cAAc,WAC1C,WAAW,YACX;AAEN,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd;AAAA,IACA,eAAe,iBAAiB,OAAO;AAAA,IACvC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,OAAO,CAAC;AAAA,IACb,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AACF;AAEA,SAAS,qBAAqB,OAAmC;AAC/D,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACjE,QAAM,UAAU,KAAK,MAAM,KAAK;AAChC,SAAO,UAAU,IAAI,UAAU;AACjC;AASA,SAAS,WAAW,QAA2B,GAAmB;AAChE,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AAC1C,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,UAAU,OAAO,MAAM,CAAC;AAC3D,SAAO,OAAO,OAAO,CAAC;AACxB;","names":[]}

package/dist/chunk-Z734BLO3.js

@@ -0,0 +1,21 @@
+// src/transfer/sqlite-schema.ts
+var SQLITE_SCHEMA_VERSION = 1;
+var SQLITE_TABLES_SQL = `
+CREATE TABLE IF NOT EXISTS meta (
+  key TEXT PRIMARY KEY,
+  value TEXT NOT NULL
+);
+
+CREATE TABLE IF NOT EXISTS files (
+  path_rel TEXT PRIMARY KEY,
+  bytes INTEGER NOT NULL,
+  sha256 TEXT NOT NULL,
+  content TEXT NOT NULL
+);
+`;
+
+export {
+  SQLITE_SCHEMA_VERSION,
+  SQLITE_TABLES_SQL
+};
+//# sourceMappingURL=chunk-Z734BLO3.js.map

package/dist/chunk-Z734BLO3.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/transfer/sqlite-schema.ts"],"sourcesContent":["export const SQLITE_SCHEMA_VERSION = 1 as const;\n\nexport const SQLITE_TABLES_SQL = `\nCREATE TABLE IF NOT EXISTS meta (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL\n);\n\nCREATE TABLE IF NOT EXISTS files (\n  path_rel TEXT PRIMARY KEY,\n  bytes INTEGER NOT NULL,\n  sha256 TEXT NOT NULL,\n  content TEXT NOT NULL\n);\n`;\n\n"],"mappings":";AAAO,IAAM,wBAAwB;AAE9B,IAAM,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;","names":[]}

package/dist/chunk-ZKSK55RC.js

@@ -0,0 +1,269 @@
+import {
+  WORK_ID_PATTERN,
+  WorkStorage
+} from "./chunk-WELDCG6C.js";
+
+// src/work/board.ts
+var BOARD_STATUS_ORDER = [
+  "todo",
+  "in_progress",
+  "blocked",
+  "done",
+  "cancelled"
+];
+var BOARD_STATUS_LABEL = {
+  todo: "Todo",
+  in_progress: "In Progress",
+  blocked: "Blocked",
+  done: "Done",
+  cancelled: "Cancelled"
+};
+var PRIORITY_WEIGHT = {
+  high: 0,
+  medium: 1,
+  low: 2
+};
+function stableSortTasks(tasks) {
+  return [...tasks].sort((a, b) => {
+    const priorityCmp = PRIORITY_WEIGHT[a.priority] - PRIORITY_WEIGHT[b.priority];
+    if (priorityCmp !== 0) return priorityCmp;
+    const createdCmp = a.createdAt.localeCompare(b.createdAt);
+    if (createdCmp !== 0) return createdCmp;
+    return a.id.localeCompare(b.id);
+  });
+}
+function projectMatches(task, projectId) {
+  if (!projectId) return true;
+  return task.projectId === projectId;
+}
+function assertValidImportEnums(item) {
+  if (!["todo", "in_progress", "blocked", "done", "cancelled"].includes(item.status)) {
+    throw new Error(`invalid task status in snapshot for ${item.id}: ${item.status}`);
+  }
+  if (!["low", "medium", "high"].includes(item.priority)) {
+    throw new Error(`invalid task priority in snapshot for ${item.id}: ${item.priority}`);
+  }
+}
+function normalizeImportedProjectId(rawValue, taskId, fallbackForUndefined) {
+  if (rawValue === void 0) return fallbackForUndefined;
+  if (rawValue === null) return null;
+  if (typeof rawValue === "string") {
+    const trimmed = rawValue.trim();
+    return trimmed.length > 0 ? trimmed : null;
+  }
+  throw new Error(`invalid task projectId in snapshot for ${taskId}`);
+}
+function normalizeImportedTags(rawValue, taskId) {
+  if (rawValue === void 0 || rawValue === null) return [];
+  if (!Array.isArray(rawValue)) {
+    throw new Error(`invalid task tags in snapshot for ${taskId}`);
+  }
+  if (!rawValue.every((entry) => typeof entry === "string")) {
+    throw new Error(`invalid task tags in snapshot for ${taskId}`);
+  }
+  return [...rawValue];
+}
+function assertValidImportedTaskId(rawValue) {
+  if (typeof rawValue !== "string") {
+    throw new Error("invalid task id in snapshot");
+  }
+  const trimmed = rawValue.trim();
+  if (!WORK_ID_PATTERN.test(trimmed)) {
+    throw new Error(`invalid task id in snapshot: ${trimmed}`);
+  }
+  return trimmed;
+}
+function normalizeImportedNullableField(rawValue, taskId, fieldName, fallbackForUndefined) {
+  if (rawValue === void 0) return fallbackForUndefined;
+  if (rawValue === null) return null;
+  if (typeof rawValue === "string") return rawValue;
+  throw new Error(`invalid task ${fieldName} in snapshot for ${taskId}`);
+}
+function normalizeImportedTitle(rawValue, taskId) {
+  if (typeof rawValue !== "string") {
+    throw new Error(`invalid task title in snapshot for ${taskId}`);
+  }
+  const trimmed = rawValue.trim();
+  if (trimmed.length === 0) {
+    throw new Error(`invalid task title in snapshot for ${taskId}`);
+  }
+  return trimmed;
+}
+function normalizeImportedDescription(rawValue, taskId) {
+  if (typeof rawValue !== "string") {
+    throw new Error(`invalid task description in snapshot for ${taskId}`);
+  }
+  return rawValue;
+}
+function asBoardItem(task) {
+  return {
+    id: task.id,
+    title: task.title,
+    description: task.description,
+    status: task.status,
+    priority: task.priority,
+    owner: task.owner,
+    assignee: task.assignee,
+    projectId: task.projectId,
+    tags: [...task.tags],
+    dueAt: task.dueAt
+  };
+}
+function formatTaskLine(task) {
+  const bits = [`id:${task.id}`, `priority:${task.priority}`];
+  if (task.assignee) bits.push(`assignee:${task.assignee}`);
+  if (task.owner) bits.push(`owner:${task.owner}`);
+  if (task.dueAt) bits.push(`due:${task.dueAt}`);
+  if (task.tags.length > 0) bits.push(`tags:${task.tags.join(",")}`);
+  const checked = task.status === "done";
+  return `- [${checked ? "x" : " "}] ${task.title} \`[${bits.join(" ")}]\``;
+}
+async function exportWorkBoardSnapshot(options) {
+  const storage = new WorkStorage(options.memoryDir);
+  await storage.ensureDirectories();
+  const projectId = options.projectId?.trim() || void 0;
+  let project = null;
+  if (projectId) {
+    project = await storage.getProject(projectId);
+    if (!project) throw new Error(`project not found: ${projectId}`);
+  }
+  const allTasks = await storage.listTasks();
+  const filtered = stableSortTasks(allTasks.filter((task) => projectMatches(task, projectId)));
+  return {
+    version: 1,
+    generatedAt: (options.now ?? /* @__PURE__ */ new Date()).toISOString(),
+    projectId: projectId ?? null,
+    projectName: project?.name ?? null,
+    items: filtered.map(asBoardItem)
+  };
+}
+function renderWorkBoardMarkdown(snapshot) {
+  const lines = [];
+  lines.push("# Work Board");
+  lines.push("");
+  lines.push(`Generated: ${snapshot.generatedAt}`);
+  lines.push(`Project: ${snapshot.projectName ?? "all"} (${snapshot.projectId ?? "all"})`);
+  lines.push("");
+  for (const status of BOARD_STATUS_ORDER) {
+    const bucket = snapshot.items.filter((item) => item.status === status);
+    lines.push(`## ${BOARD_STATUS_LABEL[status]} (${bucket.length})`);
+    if (bucket.length === 0) {
+      lines.push("_none_");
+    } else {
+      for (const item of bucket) {
+        lines.push(formatTaskLine(item));
+      }
+    }
+    lines.push("");
+  }
+  return `${lines.join("\n").trim()}
+`;
+}
+async function exportWorkBoardMarkdown(options) {
+  const snapshot = await exportWorkBoardSnapshot(options);
+  return renderWorkBoardMarkdown(snapshot);
+}
+async function importWorkBoardSnapshot(options) {
+  if (options.snapshot.version !== 1) {
+    throw new Error(`unsupported work board snapshot version: ${options.snapshot.version}`);
+  }
+  const storage = new WorkStorage(options.memoryDir);
+  await storage.ensureDirectories();
+  const forcedProjectId = options.projectId === void 0 ? void 0 : options.projectId?.trim() || null;
+  const snapshotProjectId = normalizeImportedProjectId(
+    options.snapshot.projectId,
+    "snapshot",
+    null
+  );
+  const preparedRows = [];
+  const seenItemIds = /* @__PURE__ */ new Set();
+  for (const item of options.snapshot.items) {
+    const id = assertValidImportedTaskId(item.id);
+    if (seenItemIds.has(id)) {
+      throw new Error(`duplicate task id in snapshot: ${id}`);
+    }
+    seenItemIds.add(id);
+    assertValidImportEnums(item);
+    const existing = await storage.getTask(id);
+    const title = normalizeImportedTitle(item.title, id);
+    const description = normalizeImportedDescription(item.description, id);
+    const fallbackProjectId = existing ? existing.projectId : snapshotProjectId;
+    const projectId = forcedProjectId === void 0 ? normalizeImportedProjectId(
+      item.projectId,
+      item.id,
+      fallbackProjectId
+    ) : forcedProjectId;
+    const hasTagsField = Object.prototype.hasOwnProperty.call(
+      item,
+      "tags"
+    );
+    const tags = hasTagsField ? normalizeImportedTags(item.tags, item.id) : existing ? [...existing.tags] : [];
+    const owner = normalizeImportedNullableField(
+      item.owner,
+      id,
+      "owner",
+      existing?.owner ?? null
+    );
+    const assignee = normalizeImportedNullableField(
+      item.assignee,
+      id,
+      "assignee",
+      existing?.assignee ?? null
+    );
+    const dueAt = normalizeImportedNullableField(
+      item.dueAt,
+      id,
+      "dueAt",
+      existing?.dueAt ?? null
+    );
+    preparedRows.push({ item, existing, id, title, description, projectId, tags, owner, assignee, dueAt });
+  }
+  const projectIdsToValidate = new Set(
+    preparedRows.map((row) => row.projectId).filter((projectId) => typeof projectId === "string")
+  );
+  for (const projectId of projectIdsToValidate) {
+    const project = await storage.getProject(projectId);
+    if (!project) throw new Error(`project not found: ${projectId}`);
+  }
+  let created = 0;
+  let updated = 0;
+  for (const row of preparedRows) {
+    const { item, existing, id, title, description, projectId, tags, owner, assignee, dueAt } = row;
+    if (existing) {
+      await storage.updateTask(id, {
+        title,
+        description,
+        status: item.status,
+        priority: item.priority,
+        owner,
+        assignee,
+        projectId,
+        tags,
+        dueAt
+      }, options.now, { skipStatusTransitionValidation: true });
+      updated += 1;
+      continue;
+    }
+    await storage.createTask({
+      id,
+      title,
+      description,
+      status: item.status,
+      priority: item.priority,
+      owner,
+      assignee,
+      projectId,
+      tags,
+      dueAt
+    }, options.now);
+    created += 1;
+  }
+  return { created, updated };
+}
+
+export {
+  exportWorkBoardSnapshot,
+  exportWorkBoardMarkdown,
+  importWorkBoardSnapshot
+};
+//# sourceMappingURL=chunk-ZKSK55RC.js.map

package/dist/chunk-ZKSK55RC.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/work/board.ts"],"sourcesContent":["import type { WorkProject, WorkTask, WorkTaskPriority, WorkTaskStatus } from \"./types.js\";\nimport { WORK_ID_PATTERN, WorkStorage } from \"./storage.js\";\n\nconst BOARD_STATUS_ORDER: WorkTaskStatus[] = [\n  \"todo\",\n  \"in_progress\",\n  \"blocked\",\n  \"done\",\n  \"cancelled\",\n];\n\nconst BOARD_STATUS_LABEL: Record<WorkTaskStatus, string> = {\n  todo: \"Todo\",\n  in_progress: \"In Progress\",\n  blocked: \"Blocked\",\n  done: \"Done\",\n  cancelled: \"Cancelled\",\n};\n\nconst PRIORITY_WEIGHT: Record<WorkTaskPriority, number> = {\n  high: 0,\n  medium: 1,\n  low: 2,\n};\n\nexport interface WorkBoardItem {\n  id: string;\n  title: string;\n  description: string;\n  status: WorkTaskStatus;\n  priority: WorkTaskPriority;\n  owner: string | null;\n  assignee: string | null;\n  projectId: string | null;\n  tags: string[];\n  dueAt: string | null;\n}\n\nexport interface WorkBoardSnapshot {\n  version: 1;\n  generatedAt: string;\n  projectId: string | null;\n  projectName: string | null;\n  items: WorkBoardItem[];\n}\n\nexport interface ImportWorkBoardResult {\n  created: number;\n  updated: number;\n}\n\nfunction stableSortTasks(tasks: WorkTask[]): WorkTask[] {\n  return [...tasks].sort((a, b) => {\n    const priorityCmp = PRIORITY_WEIGHT[a.priority] - PRIORITY_WEIGHT[b.priority];\n    if (priorityCmp !== 0) return priorityCmp;\n    const createdCmp = a.createdAt.localeCompare(b.createdAt);\n    if (createdCmp !== 0) return createdCmp;\n    return a.id.localeCompare(b.id);\n  });\n}\n\nfunction projectMatches(task: WorkTask, projectId?: string): boolean {\n  if (!projectId) return true;\n  return task.projectId === projectId;\n}\n\nfunction assertValidImportEnums(item: WorkBoardItem): void {\n  if (![\"todo\", \"in_progress\", \"blocked\", \"done\", \"cancelled\"].includes(item.status)) {\n    throw new Error(`invalid task status in snapshot for ${item.id}: ${item.status}`);\n  }\n  if (![\"low\", \"medium\", \"high\"].includes(item.priority)) {\n    throw new Error(`invalid task priority in snapshot for ${item.id}: ${item.priority}`);\n  }\n}\n\nfunction normalizeImportedProjectId(\n  rawValue: unknown,\n  taskId: string,\n  fallbackForUndefined: string | null,\n): string | null {\n  if (rawValue === undefined) return fallbackForUndefined;\n  if (rawValue === null) return null;\n  if (typeof rawValue === \"string\") {\n    const trimmed = rawValue.trim();\n    return trimmed.length > 0 ? trimmed : null;\n  }\n  throw new Error(`invalid task projectId in snapshot for ${taskId}`);\n}\n\nfunction normalizeImportedTags(rawValue: unknown, taskId: string): string[] {\n  if (rawValue === undefined || rawValue === null) return [];\n  if (!Array.isArray(rawValue)) {\n    throw new Error(`invalid task tags in snapshot for ${taskId}`);\n  }\n  if (!rawValue.every((entry) => typeof entry === \"string\")) {\n    throw new Error(`invalid task tags in snapshot for ${taskId}`);\n  }\n  return [...rawValue];\n}\n\nfunction assertValidImportedTaskId(rawValue: unknown): string {\n  if (typeof rawValue !== \"string\") {\n    throw new Error(\"invalid task id in snapshot\");\n  }\n  const trimmed = rawValue.trim();\n  if (!WORK_ID_PATTERN.test(trimmed)) {\n    throw new Error(`invalid task id in snapshot: ${trimmed}`);\n  }\n  return trimmed;\n}\n\nfunction normalizeImportedNullableField(\n  rawValue: unknown,\n  taskId: string,\n  fieldName: \"owner\" | \"assignee\" | \"dueAt\",\n  fallbackForUndefined: string | null,\n): string | null {\n  if (rawValue === undefined) return fallbackForUndefined;\n  if (rawValue === null) return null;\n  if (typeof rawValue === \"string\") return rawValue;\n  throw new Error(`invalid task ${fieldName} in snapshot for ${taskId}`);\n}\n\nfunction normalizeImportedTitle(rawValue: unknown, taskId: string): string {\n  if (typeof rawValue !== \"string\") {\n    throw new Error(`invalid task title in snapshot for ${taskId}`);\n  }\n  const trimmed = rawValue.trim();\n  if (trimmed.length === 0) {\n    throw new Error(`invalid task title in snapshot for ${taskId}`);\n  }\n  return trimmed;\n}\n\nfunction normalizeImportedDescription(rawValue: unknown, taskId: string): string {\n  if (typeof rawValue !== \"string\") {\n    throw new Error(`invalid task description in snapshot for ${taskId}`);\n  }\n  return rawValue;\n}\n\nfunction asBoardItem(task: WorkTask): WorkBoardItem {\n  return {\n    id: task.id,\n    title: task.title,\n    description: task.description,\n    status: task.status,\n    priority: task.priority,\n    owner: task.owner,\n    assignee: task.assignee,\n    projectId: task.projectId,\n    tags: [...task.tags],\n    dueAt: task.dueAt,\n  };\n}\n\nfunction formatTaskLine(task: WorkBoardItem): string {\n  const bits: string[] = [`id:${task.id}`, `priority:${task.priority}`];\n  if (task.assignee) bits.push(`assignee:${task.assignee}`);\n  if (task.owner) bits.push(`owner:${task.owner}`);\n  if (task.dueAt) bits.push(`due:${task.dueAt}`);\n  if (task.tags.length > 0) bits.push(`tags:${task.tags.join(\",\")}`);\n  const checked = task.status === \"done\";\n  return `- [${checked ? \"x\" : \" \"}] ${task.title} \\`[${bits.join(\" \")}]\\``;\n}\n\nexport async function exportWorkBoardSnapshot(options: {\n  memoryDir: string;\n  projectId?: string;\n  now?: Date;\n}): Promise<WorkBoardSnapshot> {\n  const storage = new WorkStorage(options.memoryDir);\n  await storage.ensureDirectories();\n\n  const projectId = options.projectId?.trim() || undefined;\n  let project: WorkProject | null = null;\n  if (projectId) {\n    project = await storage.getProject(projectId);\n    if (!project) throw new Error(`project not found: ${projectId}`);\n  }\n\n  const allTasks = await storage.listTasks();\n  const filtered = stableSortTasks(allTasks.filter((task) => projectMatches(task, projectId)));\n  return {\n    version: 1,\n    generatedAt: (options.now ?? new Date()).toISOString(),\n    projectId: projectId ?? null,\n    projectName: project?.name ?? null,\n    items: filtered.map(asBoardItem),\n  };\n}\n\nfunction renderWorkBoardMarkdown(snapshot: WorkBoardSnapshot): string {\n  const lines: string[] = [];\n  lines.push(\"# Work Board\");\n  lines.push(\"\");\n  lines.push(`Generated: ${snapshot.generatedAt}`);\n  lines.push(`Project: ${snapshot.projectName ?? \"all\"} (${snapshot.projectId ?? \"all\"})`);\n  lines.push(\"\");\n\n  for (const status of BOARD_STATUS_ORDER) {\n    const bucket = snapshot.items.filter((item) => item.status === status);\n    lines.push(`## ${BOARD_STATUS_LABEL[status]} (${bucket.length})`);\n    if (bucket.length === 0) {\n      lines.push(\"_none_\");\n    } else {\n      for (const item of bucket) {\n        lines.push(formatTaskLine(item));\n      }\n    }\n    lines.push(\"\");\n  }\n\n  return `${lines.join(\"\\n\").trim()}\\n`;\n}\n\nexport async function exportWorkBoardMarkdown(options: {\n  memoryDir: string;\n  projectId?: string;\n  now?: Date;\n}): Promise<string> {\n  const snapshot = await exportWorkBoardSnapshot(options);\n  return renderWorkBoardMarkdown(snapshot);\n}\n\nexport async function importWorkBoardSnapshot(options: {\n  memoryDir: string;\n  snapshot: WorkBoardSnapshot;\n  projectId?: string | null;\n  now?: Date;\n}): Promise<ImportWorkBoardResult> {\n  if (options.snapshot.version !== 1) {\n    throw new Error(`unsupported work board snapshot version: ${options.snapshot.version}`);\n  }\n\n  const storage = new WorkStorage(options.memoryDir);\n  await storage.ensureDirectories();\n\n  const forcedProjectId = options.projectId === undefined\n    ? undefined\n    : (options.projectId?.trim() || null);\n  const snapshotProjectId = normalizeImportedProjectId(\n    (options.snapshot as unknown as { projectId?: unknown }).projectId,\n    \"snapshot\",\n    null,\n  );\n\n  type PreparedImportRow = {\n    item: WorkBoardItem;\n    existing: WorkTask | null;\n    id: string;\n    title: string;\n    description: string;\n    projectId: string | null;\n    tags: string[];\n    owner: string | null;\n    assignee: string | null;\n    dueAt: string | null;\n  };\n\n  const preparedRows: PreparedImportRow[] = [];\n  const seenItemIds = new Set<string>();\n  for (const item of options.snapshot.items) {\n    const id = assertValidImportedTaskId((item as unknown as { id?: unknown }).id);\n    if (seenItemIds.has(id)) {\n      throw new Error(`duplicate task id in snapshot: ${id}`);\n    }\n    seenItemIds.add(id);\n    assertValidImportEnums(item);\n    const existing = await storage.getTask(id);\n    const title = normalizeImportedTitle((item as unknown as { title?: unknown }).title, id);\n    const description = normalizeImportedDescription((item as unknown as { description?: unknown }).description, id);\n    const fallbackProjectId = existing ? existing.projectId : snapshotProjectId;\n    const projectId = forcedProjectId === undefined\n      ? normalizeImportedProjectId(\n        (item as unknown as { projectId?: unknown }).projectId,\n        item.id,\n        fallbackProjectId,\n      )\n      : forcedProjectId;\n\n    const hasTagsField = Object.prototype.hasOwnProperty.call(\n      item as unknown as Record<string, unknown>,\n      \"tags\",\n    );\n    const tags = hasTagsField\n      ? normalizeImportedTags((item as unknown as { tags?: unknown }).tags, item.id)\n      : (existing ? [...existing.tags] : []);\n\n    const owner = normalizeImportedNullableField(\n      (item as unknown as { owner?: unknown }).owner,\n      id,\n      \"owner\",\n      existing?.owner ?? null,\n    );\n    const assignee = normalizeImportedNullableField(\n      (item as unknown as { assignee?: unknown }).assignee,\n      id,\n      \"assignee\",\n      existing?.assignee ?? null,\n    );\n    const dueAt = normalizeImportedNullableField(\n      (item as unknown as { dueAt?: unknown }).dueAt,\n      id,\n      \"dueAt\",\n      existing?.dueAt ?? null,\n    );\n\n    preparedRows.push({ item, existing, id, title, description, projectId, tags, owner, assignee, dueAt });\n  }\n\n  const projectIdsToValidate = new Set(\n    preparedRows\n      .map((row) => row.projectId)\n      .filter((projectId): projectId is string => typeof projectId === \"string\"),\n  );\n  for (const projectId of projectIdsToValidate) {\n    const project = await storage.getProject(projectId);\n    if (!project) throw new Error(`project not found: ${projectId}`);\n  }\n\n  let created = 0;\n  let updated = 0;\n  for (const row of preparedRows) {\n    const { item, existing, id, title, description, projectId, tags, owner, assignee, dueAt } = row;\n\n    if (existing) {\n      await storage.updateTask(id, {\n        title,\n        description,\n        status: item.status,\n        priority: item.priority,\n        owner,\n        assignee,\n        projectId,\n        tags,\n        dueAt,\n      }, options.now, { skipStatusTransitionValidation: true });\n      updated += 1;\n      continue;\n    }\n\n    await storage.createTask({\n      id,\n      title,\n      description,\n      status: item.status,\n      priority: item.priority,\n      owner,\n      assignee,\n      projectId,\n      tags,\n      dueAt,\n    }, options.now);\n    created += 1;\n  }\n\n  return { created, updated };\n}\n"],"mappings":";;;;;;AAGA,IAAM,qBAAuC;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,qBAAqD;AAAA,EACzD,MAAM;AAAA,EACN,aAAa;AAAA,EACb,SAAS;AAAA,EACT,MAAM;AAAA,EACN,WAAW;AACb;AAEA,IAAM,kBAAoD;AAAA,EACxD,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACP;AA4BA,SAAS,gBAAgB,OAA+B;AACtD,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,UAAM,cAAc,gBAAgB,EAAE,QAAQ,IAAI,gBAAgB,EAAE,QAAQ;AAC5E,QAAI,gBAAgB,EAAG,QAAO;AAC9B,UAAM,aAAa,EAAE,UAAU,cAAc,EAAE,SAAS;AACxD,QAAI,eAAe,EAAG,QAAO;AAC7B,WAAO,EAAE,GAAG,cAAc,EAAE,EAAE;AAAA,EAChC,CAAC;AACH;AAEA,SAAS,eAAe,MAAgB,WAA6B;AACnE,MAAI,CAAC,UAAW,QAAO;AACvB,SAAO,KAAK,cAAc;AAC5B;AAEA,SAAS,uBAAuB,MAA2B;AACzD,MAAI,CAAC,CAAC,QAAQ,eAAe,WAAW,QAAQ,WAAW,EAAE,SAAS,KAAK,MAAM,GAAG;AAClF,UAAM,IAAI,MAAM,uCAAuC,KAAK,EAAE,KAAK,KAAK,MAAM,EAAE;AAAA,EAClF;AACA,MAAI,CAAC,CAAC,OAAO,UAAU,MAAM,EAAE,SAAS,KAAK,QAAQ,GAAG;AACtD,UAAM,IAAI,MAAM,yCAAyC,KAAK,EAAE,KAAK,KAAK,QAAQ,EAAE;AAAA,EACtF;AACF;AAEA,SAAS,2BACP,UACA,QACA,sBACe;AACf,MAAI,aAAa,OAAW,QAAO;AACnC,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,OAAO,aAAa,UAAU;AAChC,UAAM,UAAU,SAAS,KAAK;AAC9B,WAAO,QAAQ,SAAS,IAAI,UAAU;AAAA,EACxC;AACA,QAAM,IAAI,MAAM,0CAA0C,MAAM,EAAE;AACpE;AAEA,SAAS,sBAAsB,UAAmB,QAA0B;AAC1E,MAAI,aAAa,UAAa,aAAa,KAAM,QAAO,CAAC;AACzD,MAAI,CAAC,MAAM,QAAQ,QAAQ,GAAG;AAC5B,UAAM,IAAI,MAAM,qCAAqC,MAAM,EAAE;AAAA,EAC/D;AACA,MAAI,CAAC,SAAS,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ,GAAG;AACzD,UAAM,IAAI,MAAM,qCAAqC,MAAM,EAAE;AAAA,EAC/D;AACA,SAAO,CAAC,GAAG,QAAQ;AACrB;AAEA,SAAS,0BAA0B,UAA2B;AAC5D,MAAI,OAAO,aAAa,UAAU;AAChC,UAAM,IAAI,MAAM,6BAA6B;AAAA,EAC/C;AACA,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,CAAC,gBAAgB,KAAK,OAAO,GAAG;AAClC,UAAM,IAAI,MAAM,gCAAgC,OAAO,EAAE;AAAA,EAC3D;AACA,SAAO;AACT;AAEA,SAAS,+BACP,UACA,QACA,WACA,sBACe;AACf,MAAI,aAAa,OAAW,QAAO;AACnC,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,OAAO,aAAa,SAAU,QAAO;AACzC,QAAM,IAAI,MAAM,gBAAgB,SAAS,oBAAoB,MAAM,EAAE;AACvE;AAEA,SAAS,uBAAuB,UAAmB,QAAwB;AACzE,MAAI,OAAO,aAAa,UAAU;AAChC,UAAM,IAAI,MAAM,sCAAsC,MAAM,EAAE;AAAA,EAChE;AACA,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,sCAAsC,MAAM,EAAE;AAAA,EAChE;AACA,SAAO;AACT;AAEA,SAAS,6BAA6B,UAAmB,QAAwB;AAC/E,MAAI,OAAO,aAAa,UAAU;AAChC,UAAM,IAAI,MAAM,4CAA4C,MAAM,EAAE;AAAA,EACtE;AACA,SAAO;AACT;AAEA,SAAS,YAAY,MAA+B;AAClD,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,OAAO,KAAK;AAAA,IACZ,aAAa,KAAK;AAAA,IAClB,QAAQ,KAAK;AAAA,IACb,UAAU,KAAK;AAAA,IACf,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,WAAW,KAAK;AAAA,IAChB,MAAM,CAAC,GAAG,KAAK,IAAI;AAAA,IACnB,OAAO,KAAK;AAAA,EACd;AACF;AAEA,SAAS,eAAe,MAA6B;AACnD,QAAM,OAAiB,CAAC,MAAM,KAAK,EAAE,IAAI,YAAY,KAAK,QAAQ,EAAE;AACpE,MAAI,KAAK,SAAU,MAAK,KAAK,YAAY,KAAK,QAAQ,EAAE;AACxD,MAAI,KAAK,MAAO,MAAK,KAAK,SAAS,KAAK,KAAK,EAAE;AAC/C,MAAI,KAAK,MAAO,MAAK,KAAK,OAAO,KAAK,KAAK,EAAE;AAC7C,MAAI,KAAK,KAAK,SAAS,EAAG,MAAK,KAAK,QAAQ,KAAK,KAAK,KAAK,GAAG,CAAC,EAAE;AACjE,QAAM,UAAU,KAAK,WAAW;AAChC,SAAO,MAAM,UAAU,MAAM,GAAG,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK,GAAG,CAAC;AACtE;AAEA,eAAsB,wBAAwB,SAIf;AAC7B,QAAM,UAAU,IAAI,YAAY,QAAQ,SAAS;AACjD,QAAM,QAAQ,kBAAkB;AAEhC,QAAM,YAAY,QAAQ,WAAW,KAAK,KAAK;AAC/C,MAAI,UAA8B;AAClC,MAAI,WAAW;AACb,cAAU,MAAM,QAAQ,WAAW,SAAS;AAC5C,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,sBAAsB,SAAS,EAAE;AAAA,EACjE;AAEA,QAAM,WAAW,MAAM,QAAQ,UAAU;AACzC,QAAM,WAAW,gBAAgB,SAAS,OAAO,CAAC,SAAS,eAAe,MAAM,SAAS,CAAC,CAAC;AAC3F,SAAO;AAAA,IACL,SAAS;AAAA,IACT,cAAc,QAAQ,OAAO,oBAAI,KAAK,GAAG,YAAY;AAAA,IACrD,WAAW,aAAa;AAAA,IACxB,aAAa,SAAS,QAAQ;AAAA,IAC9B,OAAO,SAAS,IAAI,WAAW;AAAA,EACjC;AACF;AAEA,SAAS,wBAAwB,UAAqC;AACpE,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,cAAc;AACzB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,cAAc,SAAS,WAAW,EAAE;AAC/C,QAAM,KAAK,YAAY,SAAS,eAAe,KAAK,KAAK,SAAS,aAAa,KAAK,GAAG;AACvF,QAAM,KAAK,EAAE;AAEb,aAAW,UAAU,oBAAoB;AACvC,UAAM,SAAS,SAAS,MAAM,OAAO,CAAC,SAAS,KAAK,WAAW,MAAM;AACrE,UAAM,KAAK,MAAM,mBAAmB,MAAM,CAAC,KAAK,OAAO,MAAM,GAAG;AAChE,QAAI,OAAO,WAAW,GAAG;AACvB,YAAM,KAAK,QAAQ;AAAA,IACrB,OAAO;AACL,iBAAW,QAAQ,QAAQ;AACzB,cAAM,KAAK,eAAe,IAAI,CAAC;AAAA,MACjC;AAAA,IACF;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,SAAO,GAAG,MAAM,KAAK,IAAI,EAAE,KAAK,CAAC;AAAA;AACnC;AAEA,eAAsB,wBAAwB,SAI1B;AAClB,QAAM,WAAW,MAAM,wBAAwB,OAAO;AACtD,SAAO,wBAAwB,QAAQ;AACzC;AAEA,eAAsB,wBAAwB,SAKX;AACjC,MAAI,QAAQ,SAAS,YAAY,GAAG;AAClC,UAAM,IAAI,MAAM,4CAA4C,QAAQ,SAAS,OAAO,EAAE;AAAA,EACxF;AAEA,QAAM,UAAU,IAAI,YAAY,QAAQ,SAAS;AACjD,QAAM,QAAQ,kBAAkB;AAEhC,QAAM,kBAAkB,QAAQ,cAAc,SAC1C,SACC,QAAQ,WAAW,KAAK,KAAK;AAClC,QAAM,oBAAoB;AAAA,IACvB,QAAQ,SAAgD;AAAA,IACzD;AAAA,IACA;AAAA,EACF;AAeA,QAAM,eAAoC,CAAC;AAC3C,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,QAAQ,QAAQ,SAAS,OAAO;AACzC,UAAM,KAAK,0BAA2B,KAAqC,EAAE;AAC7E,QAAI,YAAY,IAAI,EAAE,GAAG;AACvB,YAAM,IAAI,MAAM,kCAAkC,EAAE,EAAE;AAAA,IACxD;AACA,gBAAY,IAAI,EAAE;AAClB,2BAAuB,IAAI;AAC3B,UAAM,WAAW,MAAM,QAAQ,QAAQ,EAAE;AACzC,UAAM,QAAQ,uBAAwB,KAAwC,OAAO,EAAE;AACvF,UAAM,cAAc,6BAA8B,KAA8C,aAAa,EAAE;AAC/G,UAAM,oBAAoB,WAAW,SAAS,YAAY;AAC1D,UAAM,YAAY,oBAAoB,SAClC;AAAA,MACC,KAA4C;AAAA,MAC7C,KAAK;AAAA,MACL;AAAA,IACF,IACE;AAEJ,UAAM,eAAe,OAAO,UAAU,eAAe;AAAA,MACnD;AAAA,MACA;AAAA,IACF;AACA,UAAM,OAAO,eACT,sBAAuB,KAAuC,MAAM,KAAK,EAAE,IAC1E,WAAW,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC;AAEtC,UAAM,QAAQ;AAAA,MACX,KAAwC;AAAA,MACzC;AAAA,MACA;AAAA,MACA,UAAU,SAAS;AAAA,IACrB;AACA,UAAM,WAAW;AAAA,MACd,KAA2C;AAAA,MAC5C;AAAA,MACA;AAAA,MACA,UAAU,YAAY;AAAA,IACxB;AACA,UAAM,QAAQ;AAAA,MACX,KAAwC;AAAA,MACzC;AAAA,MACA;AAAA,MACA,UAAU,SAAS;AAAA,IACrB;AAEA,iBAAa,KAAK,EAAE,MAAM,UAAU,IAAI,OAAO,aAAa,WAAW,MAAM,OAAO,UAAU,MAAM,CAAC;AAAA,EACvG;AAEA,QAAM,uBAAuB,IAAI;AAAA,IAC/B,aACG,IAAI,CAAC,QAAQ,IAAI,SAAS,EAC1B,OAAO,CAAC,cAAmC,OAAO,cAAc,QAAQ;AAAA,EAC7E;AACA,aAAW,aAAa,sBAAsB;AAC5C,UAAM,UAAU,MAAM,QAAQ,WAAW,SAAS;AAClD,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,sBAAsB,SAAS,EAAE;AAAA,EACjE;AAEA,MAAI,UAAU;AACd,MAAI,UAAU;AACd,aAAW,OAAO,cAAc;AAC9B,UAAM,EAAE,MAAM,UAAU,IAAI,OAAO,aAAa,WAAW,MAAM,OAAO,UAAU,MAAM,IAAI;AAE5F,QAAI,UAAU;AACZ,YAAM,QAAQ,WAAW,IAAI;AAAA,QAC3B;AAAA,QACA;AAAA,QACA,QAAQ,KAAK;AAAA,QACb,UAAU,KAAK;AAAA,QACf;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,GAAG,QAAQ,KAAK,EAAE,gCAAgC,KAAK,CAAC;AACxD,iBAAW;AACX;AAAA,IACF;AAEA,UAAM,QAAQ,WAAW;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,GAAG,QAAQ,GAAG;AACd,eAAW;AAAA,EACb;AAEA,SAAO,EAAE,SAAS,QAAQ;AAC5B;","names":[]}

package/dist/chunk-ZTFCYYEZ.js

@@ -0,0 +1,69 @@
+// src/lcm/recall.ts
+function assembleCompressedHistory(dag, archive, sessionId, config) {
+  const maxTurn = archive.getMaxTurnIndex(sessionId);
+  if (maxTurn < 0) return "";
+  const allNodes = dag.getAllNodes(sessionId);
+  if (allNodes.length === 0) return "";
+  const freshTailStart = Math.max(0, maxTurn - config.freshTailTurns + 1);
+  const sections = [];
+  let usedChars = 0;
+  if (freshTailStart > 0) {
+    const oldNodes = selectBestCoverage(allNodes, 0, freshTailStart - 1);
+    for (const node of oldNodes) {
+      const label = formatRangeLabel(node, maxTurn);
+      const entry = `**${label}** (depth ${node.depth}):
+${node.summary_text}`;
+      if (usedChars + entry.length > config.budgetChars) break;
+      sections.push(entry);
+      usedChars += entry.length;
+    }
+  }
+  const freshNodes = allNodes.filter(
+    (n) => n.depth === 0 && n.msg_end >= freshTailStart && n.msg_end <= maxTurn
+  ).sort((a, b) => a.msg_start - b.msg_start);
+  for (const node of freshNodes) {
+    const label = `Recent (turns ${node.msg_start}-${node.msg_end})`;
+    const entry = `**${label}**:
+${node.summary_text}`;
+    if (usedChars + entry.length > config.budgetChars) break;
+    sections.push(entry);
+    usedChars += entry.length;
+  }
+  if (sections.length === 0) return "";
+  return `## Session History (Compressed)
+
+${sections.join("\n\n")}`;
+}
+function selectBestCoverage(allNodes, fromTurn, toTurn) {
+  const candidates = allNodes.filter(
+    (n) => n.msg_start <= toTurn && n.msg_end >= fromTurn
+  );
+  if (candidates.length === 0) return [];
+  candidates.sort((a, b) => {
+    if (a.msg_start !== b.msg_start) return a.msg_start - b.msg_start;
+    return b.depth - a.depth;
+  });
+  const selected = [];
+  let coveredUpTo = fromTurn - 1;
+  for (const node of candidates) {
+    if (node.msg_start > coveredUpTo) {
+      selected.push(node);
+      coveredUpTo = Math.min(node.msg_end, toTurn);
+      if (coveredUpTo >= toTurn) break;
+    }
+  }
+  selected.sort((a, b) => a.msg_start - b.msg_start);
+  return selected;
+}
+function formatRangeLabel(node, maxTurn) {
+  const startPct = Math.round(node.msg_start / Math.max(1, maxTurn) * 100);
+  const endPct = Math.round(node.msg_end / Math.max(1, maxTurn) * 100);
+  if (startPct < 33) return `Early session (turns ${node.msg_start}-${node.msg_end})`;
+  if (endPct < 66) return `Mid session (turns ${node.msg_start}-${node.msg_end})`;
+  return `Later session (turns ${node.msg_start}-${node.msg_end})`;
+}
+
+export {
+  assembleCompressedHistory
+};
+//# sourceMappingURL=chunk-ZTFCYYEZ.js.map

package/dist/chunk-ZTFCYYEZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/lcm/recall.ts"],"sourcesContent":["import type { LcmDag, SummaryNode } from \"./dag.js\";\nimport type { LcmArchive } from \"./archive.js\";\nimport { log } from \"../logger.js\";\n\nexport interface LcmRecallConfig {\n  freshTailTurns: number;\n  budgetChars: number;\n}\n\n/**\n * Assemble a compressed session history section from the summary DAG.\n *\n * Strategy:\n * 1. For the \"fresh tail\" (most recent N turns), use leaf-level summaries for maximum detail.\n * 2. For older portions, use the deepest available summary nodes (most compressed).\n * 3. Fill within budget, prioritizing recent content.\n */\nexport function assembleCompressedHistory(\n  dag: LcmDag,\n  archive: LcmArchive,\n  sessionId: string,\n  config: LcmRecallConfig,\n): string {\n  const maxTurn = archive.getMaxTurnIndex(sessionId);\n  if (maxTurn < 0) return \"\";\n\n  const allNodes = dag.getAllNodes(sessionId);\n  if (allNodes.length === 0) return \"\";\n\n  const freshTailStart = Math.max(0, maxTurn - config.freshTailTurns + 1);\n  const sections: string[] = [];\n  let usedChars = 0;\n\n  // Collect nodes covering the \"old\" portion (before fresh tail)\n  if (freshTailStart > 0) {\n    const oldNodes = selectBestCoverage(allNodes, 0, freshTailStart - 1);\n    for (const node of oldNodes) {\n      const label = formatRangeLabel(node, maxTurn);\n      const entry = `**${label}** (depth ${node.depth}):\\n${node.summary_text}`;\n      if (usedChars + entry.length > config.budgetChars) break;\n      sections.push(entry);\n      usedChars += entry.length;\n    }\n  }\n\n  // Collect leaf nodes that overlap with the fresh tail region.\n  // The old section uses deep nodes (depth > 0), so leaf nodes included here\n  // won't duplicate old-section content. Use msg_end >= freshTailStart to\n  // include straddling leaf nodes that partially cover the fresh region.\n  const freshNodes = allNodes\n    .filter(\n      (n) => n.depth === 0 && n.msg_end >= freshTailStart && n.msg_end <= maxTurn,\n    )\n    .sort((a, b) => a.msg_start - b.msg_start);\n\n  for (const node of freshNodes) {\n    const label = `Recent (turns ${node.msg_start}-${node.msg_end})`;\n    const entry = `**${label}**:\\n${node.summary_text}`;\n    if (usedChars + entry.length > config.budgetChars) break;\n    sections.push(entry);\n    usedChars += entry.length;\n  }\n\n  if (sections.length === 0) return \"\";\n\n  return `## Session History (Compressed)\\n\\n${sections.join(\"\\n\\n\")}`;\n}\n\n/**\n * Select the best coverage for a turn range.\n * Prefers deeper (more compressed) nodes. Avoids overlapping coverage.\n */\nfunction selectBestCoverage(\n  allNodes: SummaryNode[],\n  fromTurn: number,\n  toTurn: number,\n): SummaryNode[] {\n  // Filter to nodes that overlap with the requested range\n  const candidates = allNodes.filter(\n    (n) => n.msg_start <= toTurn && n.msg_end >= fromTurn,\n  );\n\n  if (candidates.length === 0) return [];\n\n  // Sort by msg_start ascending, then depth descending (prefer deeper at same position)\n  candidates.sort((a, b) => {\n    if (a.msg_start !== b.msg_start) return a.msg_start - b.msg_start;\n    return b.depth - a.depth;\n  });\n\n  // Greedily select non-overlapping nodes, preferring deeper coverage.\n  // Clamp msg_end to toTurn to prevent deep nodes from extending\n  // past the requested range (e.g., into the fresh tail region).\n  const selected: SummaryNode[] = [];\n  let coveredUpTo = fromTurn - 1;\n\n  for (const node of candidates) {\n    if (node.msg_start > coveredUpTo) {\n      selected.push(node);\n      coveredUpTo = Math.min(node.msg_end, toTurn);\n      if (coveredUpTo >= toTurn) break;\n    }\n  }\n\n  // Re-sort selected by msg_start for chronological output\n  selected.sort((a, b) => a.msg_start - b.msg_start);\n  return selected;\n}\n\nfunction formatRangeLabel(node: SummaryNode, maxTurn: number): string {\n  const startPct = Math.round((node.msg_start / Math.max(1, maxTurn)) * 100);\n  const endPct = Math.round((node.msg_end / Math.max(1, maxTurn)) * 100);\n\n  if (startPct < 33) return `Early session (turns ${node.msg_start}-${node.msg_end})`;\n  if (endPct < 66) return `Mid session (turns ${node.msg_start}-${node.msg_end})`;\n  return `Later session (turns ${node.msg_start}-${node.msg_end})`;\n}\n"],"mappings":";AAiBO,SAAS,0BACd,KACA,SACA,WACA,QACQ;AACR,QAAM,UAAU,QAAQ,gBAAgB,SAAS;AACjD,MAAI,UAAU,EAAG,QAAO;AAExB,QAAM,WAAW,IAAI,YAAY,SAAS;AAC1C,MAAI,SAAS,WAAW,EAAG,QAAO;AAElC,QAAM,iBAAiB,KAAK,IAAI,GAAG,UAAU,OAAO,iBAAiB,CAAC;AACtE,QAAM,WAAqB,CAAC;AAC5B,MAAI,YAAY;AAGhB,MAAI,iBAAiB,GAAG;AACtB,UAAM,WAAW,mBAAmB,UAAU,GAAG,iBAAiB,CAAC;AACnE,eAAW,QAAQ,UAAU;AAC3B,YAAM,QAAQ,iBAAiB,MAAM,OAAO;AAC5C,YAAM,QAAQ,KAAK,KAAK,aAAa,KAAK,KAAK;AAAA,EAAO,KAAK,YAAY;AACvE,UAAI,YAAY,MAAM,SAAS,OAAO,YAAa;AACnD,eAAS,KAAK,KAAK;AACnB,mBAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAMA,QAAM,aAAa,SAChB;AAAA,IACC,CAAC,MAAM,EAAE,UAAU,KAAK,EAAE,WAAW,kBAAkB,EAAE,WAAW;AAAA,EACtE,EACC,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAE3C,aAAW,QAAQ,YAAY;AAC7B,UAAM,QAAQ,iBAAiB,KAAK,SAAS,IAAI,KAAK,OAAO;AAC7D,UAAM,QAAQ,KAAK,KAAK;AAAA,EAAQ,KAAK,YAAY;AACjD,QAAI,YAAY,MAAM,SAAS,OAAO,YAAa;AACnD,aAAS,KAAK,KAAK;AACnB,iBAAa,MAAM;AAAA,EACrB;AAEA,MAAI,SAAS,WAAW,EAAG,QAAO;AAElC,SAAO;AAAA;AAAA,EAAsC,SAAS,KAAK,MAAM,CAAC;AACpE;AAMA,SAAS,mBACP,UACA,UACA,QACe;AAEf,QAAM,aAAa,SAAS;AAAA,IAC1B,CAAC,MAAM,EAAE,aAAa,UAAU,EAAE,WAAW;AAAA,EAC/C;AAEA,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAGrC,aAAW,KAAK,CAAC,GAAG,MAAM;AACxB,QAAI,EAAE,cAAc,EAAE,UAAW,QAAO,EAAE,YAAY,EAAE;AACxD,WAAO,EAAE,QAAQ,EAAE;AAAA,EACrB,CAAC;AAKD,QAAM,WAA0B,CAAC;AACjC,MAAI,cAAc,WAAW;AAE7B,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,YAAY,aAAa;AAChC,eAAS,KAAK,IAAI;AAClB,oBAAc,KAAK,IAAI,KAAK,SAAS,MAAM;AAC3C,UAAI,eAAe,OAAQ;AAAA,IAC7B;AAAA,EACF;AAGA,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACjD,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAmB,SAAyB;AACpE,QAAM,WAAW,KAAK,MAAO,KAAK,YAAY,KAAK,IAAI,GAAG,OAAO,IAAK,GAAG;AACzE,QAAM,SAAS,KAAK,MAAO,KAAK,UAAU,KAAK,IAAI,GAAG,OAAO,IAAK,GAAG;AAErE,MAAI,WAAW,GAAI,QAAO,wBAAwB,KAAK,SAAS,IAAI,KAAK,OAAO;AAChF,MAAI,SAAS,GAAI,QAAO,sBAAsB,KAAK,SAAS,IAAI,KAAK,OAAO;AAC5E,SAAO,wBAAwB,KAAK,SAAS,IAAI,KAAK,OAAO;AAC/D;","names":[]}