figjam-context-mcp 0.0.0-stage → 0.4.1

package/dist/lib/boardDiff.js

@@ -0,0 +1,285 @@
+import { STRUCTURAL_TYPES } from "./nodeTree.js";
+import { hashClusterNodes } from "./persistentCache.js";
+import { connectorArrow } from "./connectorGraph.js";
+/** Minimum member overlap (relative to the smaller cluster) to treat two clusters as the same. */
+const CLUSTER_MATCH_THRESHOLD = 0.5;
+/** Max entries rendered per section in summaryText. */
+const SUMMARY_SECTION_LIMIT = 8;
+export function diffBoards(baseline, current) {
+    const baselineNodes = contentNodesById(baseline);
+    const currentNodes = contentNodesById(current);
+    const addedNodeIds = [...currentNodes.keys()].filter((id) => !baselineNodes.has(id));
+    const removedNodeIds = [...baselineNodes.keys()].filter((id) => !currentNodes.has(id));
+    const editedNodeIds = [...currentNodes.keys()].filter((id) => {
+        const before = baselineNodes.get(id);
+        return before !== undefined && nodeContentChanged(before, currentNodes.get(id));
+    });
+    const clusterDiff = diffClusters(baseline, current);
+    const connectionDiff = diffConnections(baseline, current);
+    const tableCellChanges = diffTableCells(baselineNodes, currentNodes);
+    const stats = {
+        addedNodes: addedNodeIds.length,
+        removedNodes: removedNodeIds.length,
+        editedNodes: editedNodeIds.length,
+        newClusters: clusterDiff.newClusters.length,
+        removedClusters: clusterDiff.removedClusters.length,
+        modifiedClusters: clusterDiff.modifiedClusters.length,
+        unchangedClusters: clusterDiff.unchangedClusters,
+        addedConnections: connectionDiff.added.length,
+        removedConnections: connectionDiff.removed.length,
+    };
+    return {
+        stats,
+        newClusters: clusterDiff.newClusters,
+        removedClusters: clusterDiff.removedClusters,
+        modifiedClusters: clusterDiff.modifiedClusters,
+        addedConnections: connectionDiff.added,
+        removedConnections: connectionDiff.removed,
+        summaryText: buildSummaryText(baseline, current, stats, clusterDiff, connectionDiff),
+        tableCellChanges,
+    };
+}
+/** Leaf content nodes: everything except structural containers and connectors. */
+function contentNodesById(board) {
+    const map = new Map();
+    for (const node of board.nodes) {
+        if (!STRUCTURAL_TYPES.has(node.type) && node.type !== "CONNECTOR") {
+            map.set(node.id, node);
+        }
+    }
+    return map;
+}
+function nodeContentChanged(before, after) {
+    return (before.text ?? "") !== (after.text ?? "") ||
+        before.imageRef !== after.imageRef || before.name !== after.name || before.type !== after.type ||
+        before.rotation !== after.rotation ||
+        JSON.stringify(before.table?.cells) !== JSON.stringify(after.table?.cells) ||
+        (before.contentFingerprint !== undefined && after.contentFingerprint !== undefined &&
+            before.contentFingerprint !== after.contentFingerprint);
+}
+function diffTableCells(beforeNodes, afterNodes) {
+    const changes = [];
+    const tableIds = new Set([
+        ...[...beforeNodes.values()].filter((node) => node.table).map((node) => node.id),
+        ...[...afterNodes.values()].filter((node) => node.table).map((node) => node.id),
+    ]);
+    for (const tableNodeId of tableIds) {
+        const before = new Map((beforeNodes.get(tableNodeId)?.table?.cells ?? []).map((cell) => [cell.id, cell]));
+        const after = new Map((afterNodes.get(tableNodeId)?.table?.cells ?? []).map((cell) => [cell.id, cell]));
+        for (const cellId of new Set([...before.keys(), ...after.keys()])) {
+            const previous = before.get(cellId);
+            const current = after.get(cellId);
+            if (previous && current && previous.text === current.text && previous.row === current.row &&
+                previous.column === current.column)
+                continue;
+            changes.push({
+                tableNodeId, cellId,
+                changeType: !previous ? "added" : !current ? "removed" : "modified",
+                previousText: previous?.text, currentText: current?.text,
+                previousRow: previous?.row, previousColumn: previous?.column,
+                currentRow: current?.row, currentColumn: current?.column,
+            });
+        }
+    }
+    return changes;
+}
+/**
+ * Greedy best-overlap matching: cluster pairs are ranked by shared member
+ * count and matched one-to-one while the overlap covers at least half of
+ * the smaller cluster. Matched pairs with identical content hashes count as
+ * unchanged; everything unmatched is new (current side) or removed
+ * (baseline side).
+ */
+function diffClusters(baseline, current) {
+    const baselineNodesById = new Map(baseline.nodes.map((node) => [node.id, node]));
+    const currentNodesById = new Map(current.nodes.map((node) => [node.id, node]));
+    const pairs = [];
+    const previousByMember = new Map();
+    for (const prev of baseline.clusters) {
+        for (const id of new Set(prev.nodeIds)) {
+            const owners = previousByMember.get(id) ?? [];
+            owners.push(prev);
+            previousByMember.set(id, owners);
+        }
+    }
+    for (const cur of current.clusters) {
+        const overlaps = new Map();
+        for (const id of cur.nodeIds) {
+            for (const prev of previousByMember.get(id) ?? [])
+                overlaps.set(prev, (overlaps.get(prev) ?? 0) + 1);
+        }
+        for (const [prev, overlap] of overlaps) {
+            if (overlap / Math.min(prev.nodeIds.length, cur.nodeIds.length) >= CLUSTER_MATCH_THRESHOLD)
+                pairs.push({ prev, cur, overlap });
+        }
+    }
+    pairs.sort((a, b) => b.overlap - a.overlap);
+    const matchedPrev = new Set();
+    const matchedCur = new Set();
+    const modifiedClusters = [];
+    let unchangedClusters = 0;
+    for (const { prev, cur } of pairs) {
+        if (matchedPrev.has(prev.id) || matchedCur.has(cur.id)) {
+            continue;
+        }
+        matchedPrev.add(prev.id);
+        matchedCur.add(cur.id);
+        const prevMembers = membersOf(prev, baselineNodesById);
+        const curMembers = membersOf(cur, currentNodesById);
+        if (hashClusterNodes(prevMembers) === hashClusterNodes(curMembers)) {
+            unchangedClusters++;
+            continue;
+        }
+        const prevIds = new Set(prev.nodeIds);
+        const curIds = new Set(cur.nodeIds);
+        const sharedIds = cur.nodeIds.filter((id) => prevIds.has(id));
+        modifiedClusters.push({
+            label: cur.label,
+            previousLabel: prev.label,
+            addedNodeCount: cur.nodeIds.filter((id) => !prevIds.has(id)).length,
+            removedNodeCount: prev.nodeIds.filter((id) => !curIds.has(id)).length,
+            editedNodeCount: sharedIds.filter((id) => {
+                const before = baselineNodesById.get(id);
+                const after = currentNodesById.get(id);
+                return before !== undefined && after !== undefined && nodeContentChanged(before, after);
+            }).length,
+        });
+    }
+    return {
+        newClusters: current.clusters
+            .filter((cluster) => !matchedCur.has(cluster.id))
+            .map((cluster) => ({ label: cluster.label, summary: cluster.summary })),
+        removedClusters: baseline.clusters
+            .filter((cluster) => !matchedPrev.has(cluster.id))
+            .map((cluster) => ({ label: cluster.label, summary: cluster.summary })),
+        modifiedClusters,
+        unchangedClusters,
+    };
+}
+function membersOf(cluster, nodesById) {
+    return cluster.nodeIds
+        .map((id) => nodesById.get(id))
+        .filter((node) => node !== undefined);
+}
+/**
+ * Diffs connector edges as a multiset of (from, to, label) tuples.
+ *
+ * Connector IDs are deliberately ignored: replacing an arrow without changing
+ * its meaning is not a semantic board change. Multiplicity still matters,
+ * though — removing one of two parallel arrows must be reported.
+ */
+function diffConnections(baseline, current) {
+    const baselineEdges = groupEdgesByMeaning(baseline.connectorEdges ?? []);
+    const currentEdges = groupEdgesByMeaning(current.connectorEdges ?? []);
+    const keys = new Set([...baselineEdges.keys(), ...currentEdges.keys()]);
+    const added = [];
+    const removed = [];
+    const baselineLabel = edgeFormatter(baseline);
+    const currentLabel = edgeFormatter(current);
+    for (const key of keys) {
+        const before = baselineEdges.get(key) ?? [];
+        const after = currentEdges.get(key) ?? [];
+        for (let index = before.length; index < after.length; index++) {
+            added.push(currentLabel(after[index]));
+        }
+        for (let index = after.length; index < before.length; index++) {
+            removed.push(baselineLabel(before[index]));
+        }
+    }
+    return { added, removed };
+}
+function groupEdgesByMeaning(edges) {
+    const grouped = new Map();
+    for (const edge of edges) {
+        const direction = edge.direction ?? "forward";
+        const endpoints = direction === "reverse"
+            ? [edge.toNodeId, edge.fromNodeId]
+            : direction === "bidirectional" || direction === "undirected"
+                ? [edge.fromNodeId, edge.toNodeId].sort()
+                : [edge.fromNodeId, edge.toNodeId];
+        const key = JSON.stringify([endpoints, direction === "reverse" ? "forward" : direction, edge.label ?? ""]);
+        const matches = grouped.get(key) ?? [];
+        matches.push(edge);
+        grouped.set(key, matches);
+    }
+    return grouped;
+}
+/** Renders one edge with the owning clusters' labels (from its own snapshot). */
+function edgeFormatter(board) {
+    const owner = new Map();
+    const nodes = new Map(board.nodes.map(node => [node.id, node]));
+    for (const cluster of board.clusters)
+        for (const id of cluster.nodeIds)
+            owner.set(id, cluster);
+    return edge => {
+        const internal = owner.has(edge.fromNodeId) && owner.get(edge.fromNodeId) === owner.get(edge.toNodeId);
+        const label = (id) => {
+            const cluster = owner.get(id);
+            if (cluster && !internal)
+                return cluster.label;
+            const node = nodes.get(id);
+            const text = node?.text?.trim();
+            return text ? truncate(text, 40) : node?.name ?? id;
+        };
+        return `"${label(edge.fromNodeId)}" ${connectorArrow(edge)} "${label(edge.toNodeId)}"${edge.label ? ` — "${edge.label}"` : ""}`;
+    };
+}
+function buildSummaryText(baseline, current, stats, clusters, connections) {
+    const lines = [
+        `FigJam board ${current.fileKey} — changes from ${timestamp(baseline.createdAt)} to ${timestamp(current.createdAt)}:`,
+        "",
+    ];
+    if (stats.addedNodes + stats.removedNodes + stats.editedNodes === 0 &&
+        stats.newClusters + stats.removedClusters + stats.modifiedClusters === 0 &&
+        stats.addedConnections + stats.removedConnections === 0) {
+        lines.push("No changes — the board content is identical.");
+        return lines.join("\n");
+    }
+    if (clusters.newClusters.length > 0) {
+        lines.push(`New clusters (${clusters.newClusters.length}):`);
+        lines.push(...capped(clusters.newClusters, (c) => `- "${c.label}": ${firstSentence(c.summary)}`));
+    }
+    if (clusters.removedClusters.length > 0) {
+        lines.push(`Removed clusters (${clusters.removedClusters.length}):`);
+        lines.push(...capped(clusters.removedClusters, (c) => `- "${c.label}"`));
+    }
+    if (clusters.modifiedClusters.length > 0) {
+        lines.push(`Modified clusters (${clusters.modifiedClusters.length}):`);
+        lines.push(...capped(clusters.modifiedClusters, (c) => {
+            const renamed = c.previousLabel !== c.label ? ` (was "${c.previousLabel}")` : "";
+            const parts = [
+                c.addedNodeCount > 0 ? `+${c.addedNodeCount} nodes` : "",
+                c.removedNodeCount > 0 ? `-${c.removedNodeCount} nodes` : "",
+                c.editedNodeCount > 0 ? `${c.editedNodeCount} edited` : "",
+            ].filter(Boolean);
+            return `- "${c.label}"${renamed}: ${parts.join(", ") || "reorganized"}`;
+        }));
+    }
+    if (connections.added.length > 0 || connections.removed.length > 0) {
+        lines.push(`Connections: +${connections.added.length} / -${connections.removed.length}`);
+        lines.push(...capped(connections.added, (line) => `- new: ${line}`));
+        lines.push(...capped(connections.removed, (line) => `- removed: ${line}`));
+    }
+    lines.push(`Nodes: +${stats.addedNodes} added / -${stats.removedNodes} removed / ${stats.editedNodes} edited.`);
+    if (stats.unchangedClusters > 0) {
+        lines.push(`Unchanged clusters: ${stats.unchangedClusters}.`);
+    }
+    return lines.join("\n");
+}
+function capped(items, render) {
+    const lines = items.slice(0, SUMMARY_SECTION_LIMIT).map(render);
+    if (items.length > SUMMARY_SECTION_LIMIT) {
+        lines.push(`- … and ${items.length - SUMMARY_SECTION_LIMIT} more`);
+    }
+    return lines;
+}
+function timestamp(ms) {
+    return new Date(ms).toISOString().replace(/\.\d{3}Z$/, "Z");
+}
+function firstSentence(text) {
+    return text.split(/(?<=[.!?])\s+/)[0]?.trim() ?? "";
+}
+function truncate(text, maxLength) {
+    return text.length <= maxLength ? text : `${text.slice(0, maxLength - 1)}…`;
+}
+//# sourceMappingURL=boardDiff.js.map

package/dist/lib/boardDiff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boardDiff.js","sourceRoot":"","sources":["../../src/lib/boardDiff.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AA6DrD,kGAAkG;AAClG,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAEpC,uDAAuD;AACvD,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,MAAM,UAAU,UAAU,CAAC,QAAmB,EAAE,OAAkB;IAChE,MAAM,aAAa,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACjD,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAE/C,MAAM,YAAY,GAAG,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACrF,MAAM,cAAc,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvF,MAAM,aAAa,GAAG,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE;QAC3D,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,OAAO,MAAM,KAAK,SAAS,IAAI,kBAAkB,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACpD,MAAM,cAAc,GAAG,eAAe,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAG,cAAc,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;IAErE,MAAM,KAAK,GAAmB;QAC5B,UAAU,EAAE,YAAY,CAAC,MAAM;QAC/B,YAAY,EAAE,cAAc,CAAC,MAAM;QACnC,WAAW,EAAE,aAAa,CAAC,MAAM;QACjC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,MAAM;QAC3C,eAAe,EAAE,WAAW,CAAC,eAAe,CAAC,MAAM;QACnD,gBAAgB,EAAE,WAAW,CAAC,gBAAgB,CAAC,MAAM;QACrD,iBAAiB,EAAE,WAAW,CAAC,iBAAiB;QAChD,gBAAgB,EAAE,cAAc,CAAC,KAAK,CAAC,MAAM;QAC7C,kBAAkB,EAAE,cAAc,CAAC,OAAO,CAAC,MAAM;KAClD,CAAC;IAEF,OAAO;QACL,KAAK;QACL,WAAW,EAAE,WAAW,CAAC,WAAW;QACpC,eAAe,EAAE,WAAW,CAAC,eAAe;QAC5C,gBAAgB,EAAE,WAAW,CAAC,gBAAgB;QAC9C,gBAAgB,EAAE,cAAc,CAAC,KAAK;QACtC,kBAAkB,EAAE,cAAc,CAAC,OAAO;QAC1C,WAAW,EAAE,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC;QACpF,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,gBAAgB,CAAC,KAAgB;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAClE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAsB,EAAE,KAAqB;IACvE,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/C,MAAM,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;QAC9F,MAAM,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;QAClC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC;QAC1E,CAAC,MAAM,CAAC,kBAAkB,KAAK,SAAS,IAAI,KAAK,CAAC,kBAAkB,KAAK,SAAS;YAChF,MAAM,CAAC,kBAAkB,KAAK,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,cAAc,CACrB,WAAwC,EACxC,UAAuC;IAEvC,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;QACvB,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChF,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;KAChF,CAAC,CAAC;IACH,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1G,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACxG,KAAK,MAAM,MAAM,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAClE,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,QAAQ,IAAI,OAAO,IAAI,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC,GAAG,KAAK,OAAO,CAAC,GAAG;gBACrF,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;gBAAE,SAAS;YACjD,OAAO,CAAC,IAAI,CAAC;gBACX,WAAW,EAAE,MAAM;gBACnB,UAAU,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU;gBACnE,YAAY,EAAE,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI;gBACxD,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM;gBAC5D,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM;aACzD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AASD;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,QAAmB,EAAE,OAAkB;IAC3D,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAE/E,MAAM,KAAK,GAA0E,EAAE,CAAC;IACxF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;QACnD,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvG,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACvC,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,uBAAuB;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;QACjI,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IAE5C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,gBAAgB,GAA0B,EAAE,CAAC;IACnD,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,KAAK,EAAE,CAAC;QAClC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvD,SAAS;QACX,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEvB,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QACvD,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;QACpD,IAAI,gBAAgB,CAAC,WAAW,CAAC,KAAK,gBAAgB,CAAC,UAAU,CAAC,EAAE,CAAC;YACnE,iBAAiB,EAAE,CAAC;YACpB,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,gBAAgB,CAAC,IAAI,CAAC;YACpB,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,aAAa,EAAE,IAAI,CAAC,KAAK;YACzB,cAAc,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM;YACnE,gBAAgB,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM;YACrE,eAAe,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE;gBACvC,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvC,OAAO,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC1F,CAAC,CAAC,CAAC,MAAM;SACV,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,WAAW,EAAE,OAAO,CAAC,QAAQ;aAC1B,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aAChD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACzE,eAAe,EAAE,QAAQ,CAAC,QAAQ;aAC/B,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACzE,gBAAgB;QAChB,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAChB,OAAuB,EACvB,SAAsC;IAEtC,OAAO,OAAO,CAAC,OAAO;SACnB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC9B,MAAM,CAAC,CAAC,IAAI,EAA0B,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;AAClE,CAAC;AAOD;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,QAAmB,EAAE,OAAkB;IAC9D,MAAM,aAAa,GAAG,mBAAmB,CAAC,QAAQ,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;IACzE,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,aAAa,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,YAAY,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAE5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAE1C,KAAK,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9D,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9D,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAsB;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC9C,MAAM,SAAS,GAAG,SAAS,KAAK,SAAS;YACvC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC;YAClC,CAAC,CAAC,SAAS,KAAK,eAAe,IAAI,SAAS,KAAK,YAAY;gBAC3D,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE;gBACzC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3G,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,iFAAiF;AACjF,SAAS,aAAa,CAAC,KAAgB;IACrC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAChE,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ;QAAE,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,OAAO;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/F,OAAO,IAAI,CAAC,EAAE;QACZ,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvG,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE;YAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,IAAI,OAAO,IAAI,CAAC,QAAQ;gBAAE,OAAO,OAAO,CAAC,KAAK,CAAC;YAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC5D,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QACtD,CAAC,CAAC;QACF,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,cAAc,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAClI,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACvB,QAAmB,EACnB,OAAkB,EAClB,KAAqB,EACrB,QAA6B,EAC7B,WAAmC;IAEnC,MAAM,KAAK,GAAa;QACtB,gBAAgB,OAAO,CAAC,OAAO,mBAAmB,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG;QACrH,EAAE;KACH,CAAC;IAEF,IACE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,WAAW,KAAK,CAAC;QAC/D,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,gBAAgB,KAAK,CAAC;QACxE,KAAK,CAAC,gBAAgB,GAAG,KAAK,CAAC,kBAAkB,KAAK,CAAC,EACvD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAC3D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,WAAW,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CACR,GAAG,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,MAAM,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CACtF,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,qBAAqB,QAAQ,CAAC,eAAe,CAAC,MAAM,IAAI,CAAC,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,QAAQ,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,sBAAsB,QAAQ,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,CAAC;QACvE,KAAK,CAAC,IAAI,CACR,GAAG,MAAM,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACjF,MAAM,KAAK,GAAG;gBACZ,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,cAAc,QAAQ,CAAC,CAAC,CAAC,EAAE;gBACxD,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB,QAAQ,CAAC,CAAC,CAAC,EAAE;gBAC5D,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,eAAe,SAAS,CAAC,CAAC,CAAC,EAAE;aAC3D,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAClB,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;QAC1E,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IACD,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnE,KAAK,CAAC,IAAI,CAAC,iBAAiB,WAAW,CAAC,KAAK,CAAC,MAAM,OAAO,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QACzF,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,KAAK,CAAC,IAAI,CACR,WAAW,KAAK,CAAC,UAAU,aAAa,KAAK,CAAC,YAAY,cAAc,KAAK,CAAC,WAAW,UAAU,CACpG,CAAC;IACF,IAAI,KAAK,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,uBAAuB,KAAK,CAAC,iBAAiB,GAAG,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,MAAM,CAAI,KAAU,EAAE,MAA2B;IACxD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChE,IAAI,KAAK,CAAC,MAAM,GAAG,qBAAqB,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,MAAM,GAAG,qBAAqB,OAAO,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,EAAU;IAC3B,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACtD,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY,EAAE,SAAiB;IAC/C,OAAO,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC;AAC9E,CAAC"}

package/dist/lib/cache.d.ts

@@ -0,0 +1,9 @@
+import type { BoardData } from "../types.js";
+export declare function setBoard(boardId: string, data: BoardData): void;
+export declare function getBoard(boardId: string): BoardData | undefined;
+/**
+ * Memory-first read with persistent fallback: after a restart the in-memory
+ * map is empty, but the last finished ingest is still on disk — load it,
+ * mark its cluster summaries as cache-sourced, and re-seed the memory map.
+ */
+export declare function getBoardOrRestore(boardId: string, snapshotId?: string): Promise<BoardData | undefined>;

package/dist/lib/cache.js

@@ -0,0 +1,63 @@
+import { readIntEnv } from "./env.js";
+import { readLatestBoard, readBoardSnapshot, hasLegacyBoard } from "./persistentCache.js";
+/**
+ * Simple in-memory store, keyed by boardId. setBoard writes/overwrites an
+ * entry produced by ingest_board; getBoard reads it back for
+ * get_board_context / answer_from_board. getBoardOrRestore additionally
+ * falls back to the persistent cache, so ingested boards survive server
+ * restarts without a manual re-ingest.
+ */
+const MAX_CACHED_BOARDS = readIntEnv("FIGJAM_MCP_MEMORY_CACHE_MAX_BOARDS", 10, 1);
+const boards = new Map();
+export function setBoard(boardId, data) {
+    // Map preserves insertion order. Re-inserting an existing board moves it to
+    // the most-recently-used end before the oldest entries are evicted.
+    boards.delete(boardId);
+    boards.set(boardId, data);
+    while (boards.size > MAX_CACHED_BOARDS) {
+        const oldestBoardId = boards.keys().next().value;
+        if (oldestBoardId === undefined) {
+            break;
+        }
+        boards.delete(oldestBoardId);
+    }
+}
+export function getBoard(boardId) {
+    const board = boards.get(boardId);
+    if (!board) {
+        return undefined;
+    }
+    boards.delete(boardId);
+    boards.set(boardId, board);
+    return board;
+}
+/**
+ * Memory-first read with persistent fallback: after a restart the in-memory
+ * map is empty, but the last finished ingest is still on disk — load it,
+ * mark its cluster summaries as cache-sourced, and re-seed the memory map.
+ */
+export async function getBoardOrRestore(boardId, snapshotId) {
+    const inMemory = getBoard(boardId);
+    if (inMemory && (!snapshotId || inMemory.snapshotId === snapshotId)) {
+        return inMemory;
+    }
+    const persisted = snapshotId ? await readBoardSnapshot(boardId, snapshotId) : await readLatestBoard(boardId);
+    if (!persisted) {
+        if (snapshotId)
+            throw new Error("Snapshot is no longer available. Start a new context query against the latest ingest.");
+        if (await hasLegacyBoard(boardId))
+            throw new Error("This board uses cache v3. Run ingest_board again to capture complete sources for cache v4; old files are preserved.");
+        return undefined;
+    }
+    const restored = {
+        ...persisted,
+        clusters: persisted.clusters.map((cluster) => ({
+            ...cluster,
+            cacheHit: true,
+        })),
+    };
+    if (!snapshotId)
+        setBoard(boardId, restored);
+    return restored;
+}
+//# sourceMappingURL=cache.js.map

package/dist/lib/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/lib/cache.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACtC,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAE1F;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAG,UAAU,CAAC,oCAAoC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAClF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;AAE5C,MAAM,UAAU,QAAQ,CAAC,OAAe,EAAE,IAAe;IACvD,4EAA4E;IAC5E,oEAAoE;IACpE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC1B,OAAO,MAAM,CAAC,IAAI,GAAG,iBAAiB,EAAE,CAAC;QACvC,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAA2B,CAAC;QACvE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,MAAM;QACR,CAAC;QACD,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,OAAe;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAC3B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,OAAe,EAAE,UAAmB;IAC1E,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IACnC,IAAI,QAAQ,IAAI,CAAC,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU,KAAK,UAAU,CAAC,EAAE,CAAC;QACpE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,OAAO,CAAC,CAAC;IAC7G,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,IAAI,UAAU;YAAE,MAAM,IAAI,KAAK,CAAC,uFAAuF,CAAC,CAAC;QACzH,IAAI,MAAM,cAAc,CAAC,OAAO,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qHAAqH,CAAC,CAAC;QAC1K,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,QAAQ,GAAc;QAC1B,GAAG,SAAS;QACZ,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC7C,GAAG,OAAO;YACV,QAAQ,EAAE,IAAI;SACf,CAAC,CAAC;KACJ,CAAC;IACF,IAAI,CAAC,UAAU;QAAE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC7C,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/lib/connectorGraph.d.ts

@@ -0,0 +1,32 @@
+import type { Cluster, ClusterRelation, ConnectorEdge, NormalizedNode, RefinedCluster } from "../types.js";
+/**
+ * Connector arrows are excluded from geometric clustering (they deliberately
+ * span between groups), but they carry the board's semantic structure:
+ * "A leads to B". This module extracts them as a graph and aggregates them
+ * to cluster-level relations that get_board_context / answer_from_board can
+ * hand to the LLM as relationship context.
+ */
+/**
+ * Pulls all fully attached connector arrows out of the flattened node list.
+ * Connectors dangling in empty space (missing either endpoint) are skipped —
+ * without both endpoints there is no relation to express.
+ */
+export declare function extractConnectorEdges(nodes: NormalizedNode[]): ConnectorEdge[];
+export declare function connectorArrow(edge: ConnectorEdge): string;
+/** Node-level evidence retains internal arrows that the cluster overview omits. */
+export declare function formatNodeConnections(edges: ConnectorEdge[], nodes: NormalizedNode[], selectedNodeIds?: ReadonlySet<string>): string[];
+/**
+ * Aggregates node-level connector edges into directed cluster-to-cluster
+ * relations. Internal edges remain available in the node graph and evidence;
+ * this overview only renders connections between clusters. Parallel edges
+ * between the same cluster pair are merged, collecting their unique labels. Sorted by
+ * edgeCount so the strongest relations come first.
+ */
+export declare function buildClusterRelations(edges: ConnectorEdge[], clusters: Cluster[]): ClusterRelation[];
+/**
+ * Renders cluster relations as compact human/LLM-readable lines, e.g.
+ * `"User interviews" → "Problem framing" — "informs" (2 connectors)`.
+ * Relations pointing at clusters missing from `clusters` (e.g. filtered out
+ * by a topic) are skipped.
+ */
+export declare function formatClusterRelations(relations: ClusterRelation[], clusters: RefinedCluster[]): string[];

package/dist/lib/connectorGraph.js

@@ -0,0 +1,121 @@
+/**
+ * Connector arrows are excluded from geometric clustering (they deliberately
+ * span between groups), but they carry the board's semantic structure:
+ * "A leads to B". This module extracts them as a graph and aggregates them
+ * to cluster-level relations that get_board_context / answer_from_board can
+ * hand to the LLM as relationship context.
+ */
+/**
+ * Pulls all fully attached connector arrows out of the flattened node list.
+ * Connectors dangling in empty space (missing either endpoint) are skipped —
+ * without both endpoints there is no relation to express.
+ */
+export function extractConnectorEdges(nodes) {
+    // Canvas endpoints are coordinate anchors, not claims about a document or page.
+    const nonContentIds = new Set(nodes
+        .filter(node => ["DOCUMENT", "CANVAS", "PAGE"].includes(node.type))
+        .map(node => node.id));
+    // Normalization retains page ancestry, but omits the outer document itself.
+    for (const node of nodes) {
+        if ((node.type === "CANVAS" || node.type === "PAGE") && node.parentId)
+            nonContentIds.add(node.parentId);
+    }
+    return nodes
+        .filter((node) => node.type === "CONNECTOR" && Boolean(node.connectorStartId) && Boolean(node.connectorEndId)
+        && !nonContentIds.has(node.connectorStartId) && !nonContentIds.has(node.connectorEndId))
+        .map((node) => ({
+        connectorId: node.id,
+        fromNodeId: node.connectorStartId,
+        toNodeId: node.connectorEndId,
+        label: node.text?.trim() || undefined,
+        direction: connectorDirection(node),
+    }));
+}
+function connectorDirection(node) {
+    // Historical fixtures/caches lack cap metadata and used start → end.
+    if (node.connectorStartArrowhead === undefined && node.connectorEndArrowhead === undefined) {
+        return "forward";
+    }
+    const hasArrow = (cap) => Boolean(cap?.startsWith("ARROW_") || cap === "TRIANGLE_FILLED" || cap === "LINE_ARROW");
+    const start = hasArrow(node.connectorStartArrowhead);
+    const end = hasArrow(node.connectorEndArrowhead);
+    return start && end ? "bidirectional" : start ? "reverse" : end ? "forward" : "undirected";
+}
+export function connectorArrow(edge) {
+    return edge.direction === "reverse" ? "←" : edge.direction === "bidirectional" ? "↔" :
+        edge.direction === "undirected" ? "—" : "→";
+}
+/** Node-level evidence retains internal arrows that the cluster overview omits. */
+export function formatNodeConnections(edges, nodes, selectedNodeIds) {
+    const byId = new Map(nodes.map((node) => [node.id, node]));
+    const label = (id) => {
+        const node = byId.get(id);
+        const text = node?.text?.trim() || node?.name || id;
+        return `${id} (${text.length > 120 ? `${text.slice(0, 119)}…` : text})`;
+    };
+    return edges
+        .filter((edge) => !selectedNodeIds || selectedNodeIds.has(edge.fromNodeId) || selectedNodeIds.has(edge.toNodeId))
+        .map((edge) => `${label(edge.fromNodeId)} ${connectorArrow(edge)} ${label(edge.toNodeId)}${edge.label ? ` — ${edge.label}` : ""}`);
+}
+/**
+ * Aggregates node-level connector edges into directed cluster-to-cluster
+ * relations. Internal edges remain available in the node graph and evidence;
+ * this overview only renders connections between clusters. Parallel edges
+ * between the same cluster pair are merged, collecting their unique labels. Sorted by
+ * edgeCount so the strongest relations come first.
+ */
+export function buildClusterRelations(edges, clusters) {
+    const clusterOfNode = new Map();
+    for (const cluster of clusters) {
+        for (const nodeId of cluster.nodeIds) {
+            clusterOfNode.set(nodeId, cluster.id);
+        }
+    }
+    const relations = new Map();
+    for (const edge of edges) {
+        if (edge.direction === "undirected")
+            continue;
+        const pairs = edge.direction === "reverse"
+            ? [[edge.toNodeId, edge.fromNodeId]]
+            : edge.direction === "bidirectional"
+                ? [[edge.fromNodeId, edge.toNodeId], [edge.toNodeId, edge.fromNodeId]]
+                : [[edge.fromNodeId, edge.toNodeId]];
+        for (const [fromId, toId] of pairs) {
+            const from = clusterOfNode.get(fromId);
+            const to = clusterOfNode.get(toId);
+            if (!from || !to || from === to) {
+                continue;
+            }
+            const key = `${from}->${to}`;
+            const relation = relations.get(key) ?? {
+                fromClusterId: from,
+                toClusterId: to,
+                labels: [],
+                edgeCount: 0,
+            };
+            relation.edgeCount++;
+            if (edge.label && !relation.labels.includes(edge.label)) {
+                relation.labels.push(edge.label);
+            }
+            relations.set(key, relation);
+        }
+    }
+    return [...relations.values()].sort((a, b) => b.edgeCount - a.edgeCount);
+}
+/**
+ * Renders cluster relations as compact human/LLM-readable lines, e.g.
+ * `"User interviews" → "Problem framing" — "informs" (2 connectors)`.
+ * Relations pointing at clusters missing from `clusters` (e.g. filtered out
+ * by a topic) are skipped.
+ */
+export function formatClusterRelations(relations, clusters) {
+    const labelOf = new Map(clusters.map((cluster) => [cluster.id, cluster.label]));
+    return relations
+        .filter((rel) => labelOf.has(rel.fromClusterId) && labelOf.has(rel.toClusterId))
+        .map((rel) => {
+        const labels = rel.labels.length > 0 ? ` — "${rel.labels.join('", "')}"` : "";
+        const count = rel.edgeCount > 1 ? ` (${rel.edgeCount} connectors)` : "";
+        return `- "${labelOf.get(rel.fromClusterId)}" → "${labelOf.get(rel.toClusterId)}"${labels}${count}`;
+    });
+}
+//# sourceMappingURL=connectorGraph.js.map

package/dist/lib/connectorGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connectorGraph.js","sourceRoot":"","sources":["../../src/lib/connectorGraph.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAuB;IAC3D,gFAAgF;IAChF,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK;SAChC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAClE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,4EAA4E;IAC5E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;YAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1G,CAAC;IACD,OAAO,KAAK;SACT,MAAM,CACL,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC;WACxF,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,cAAe,CAAC,CAC5F;SACA,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,WAAW,EAAE,IAAI,CAAC,EAAE;QACpB,UAAU,EAAE,IAAI,CAAC,gBAAiB;QAClC,QAAQ,EAAE,IAAI,CAAC,cAAe;QAC9B,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,SAAS;QACrC,SAAS,EAAE,kBAAkB,CAAC,IAAI,CAAC;KACpC,CAAC,CAAC,CAAC;AACR,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAoB;IAC9C,qEAAqE;IACrE,IAAI,IAAI,CAAC,uBAAuB,KAAK,SAAS,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS,EAAE,CAAC;QAC3F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,GAAuB,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,QAAQ,CAAC,IAAI,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK,YAAY,CAAC,CAAC;IACtI,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACjD,OAAO,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC;AAC7F,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,IAAmB;IAChD,OAAO,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpF,IAAI,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,qBAAqB,CACnC,KAAsB,EACtB,KAAuB,EACvB,eAAqC;IAErC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QACpD,OAAO,GAAG,EAAE,KAAK,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IAC1E,CAAC,CAAC;IACF,OAAO,KAAK;SACT,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,eAAe,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAChH,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACvI,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAsB,EACtB,QAAmB;IAEnB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAA2B,CAAC;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,SAAS,KAAK,YAAY;YAAE,SAAS;QAC9C,MAAM,KAAK,GAA4B,IAAI,CAAC,SAAS,KAAK,SAAS;YACjE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACpC,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,eAAe;gBAClC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;gBACtE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;gBAChC,SAAS;YACX,CAAC;YAED,MAAM,GAAG,GAAG,GAAG,IAAI,KAAK,EAAE,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI;gBACrC,aAAa,EAAE,IAAI;gBACnB,WAAW,EAAE,EAAE;gBACf,MAAM,EAAE,EAAE;gBACV,SAAS,EAAE,CAAC;aACb,CAAC;YACF,QAAQ,CAAC,SAAS,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAA4B,EAC5B,QAA0B;IAE1B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEhF,OAAO,SAAS;SACb,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;SAC/E,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACX,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,OAAO,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;IACtG,CAAC,CAAC,CAAC;AACP,CAAC"}

package/dist/lib/docStructureMapper.d.ts

@@ -0,0 +1,24 @@
+import type { DocStructureHint, RefinedCluster } from "../types.js";
+/**
+ * Maps clusters onto the phases of a documentation framework — deterministic
+ * keyword scoring against each cluster's label and summary, no extra LLM
+ * call. The label/summary text produced by the vision/text step is
+ * descriptive enough for that, and the "unclear" fallback keeps mismatches
+ * honest.
+ *
+ * Built-in frameworks live in FRAMEWORKS; callers can also pass a free-form
+ * phase list (customPhases on ingest_board), whose keywords are derived from
+ * the phase names themselves.
+ */
+export interface PhaseDefinition {
+    name: string;
+    /** Lowercase keyword signals matched against label (2×) and summary (1×). */
+    keywords: string[];
+}
+/**
+ * Assigns each cluster a phase from the active framework. Order of
+ * precedence: customPhases (free-form names) > built-in framework for the
+ * hint > no-op for "freeform". Clusters with no keyword hits — or a tie
+ * between phases — get "unclear".
+ */
+export declare function mapClustersToPhases(clusters: RefinedCluster[], hint: DocStructureHint, customPhases?: string[]): RefinedCluster[];