gsd-pi 2.74.0-dev.2b524c3 → 2.74.0-dev.b741afb

package/packages/mcp-server/dist/readers/graph.js

@@ -0,0 +1,548 @@
+// GSD MCP Server — knowledge graph reader
+// Copyright (c) 2026 Jeremy McSpadden <jeremy@fluxlabs.net>
+/**
+ * Knowledge Graph for GSD projects.
+ *
+ * Parses .gsd/ artifacts (STATE.md, milestone ROADMAPs, slice PLANs,
+ * KNOWLEDGE.md) into a graph of nodes and edges. Parse errors in any
+ * single artifact are caught and never propagate — the artifact is skipped
+ * and the rest of the graph is returned.
+ *
+ * writeGraph() is atomic: writes to graph.tmp.json then renames to graph.json.
+ */
+import { readFileSync, writeFileSync, renameSync, existsSync, mkdirSync } from 'node:fs';
+import { join, resolve } from 'node:path';
+import { resolveGsdRoot, findMilestoneIds, resolveMilestoneDir, findSliceIds, resolveSliceDir } from './paths.js';
+// ---------------------------------------------------------------------------
+// Graph file paths
+// ---------------------------------------------------------------------------
+function graphsDir(gsdRoot) {
+    return join(gsdRoot, 'graphs');
+}
+function graphJsonPath(gsdRoot) {
+    return join(graphsDir(gsdRoot), 'graph.json');
+}
+function graphTmpPath(gsdRoot) {
+    return join(graphsDir(gsdRoot), 'graph.tmp.json');
+}
+function snapshotPath(gsdRoot) {
+    return join(graphsDir(gsdRoot), '.last-build-snapshot.json');
+}
+// ---------------------------------------------------------------------------
+// Parsers — each returns nodes/edges and never throws
+// ---------------------------------------------------------------------------
+/**
+ * Parse STATE.md for active milestone and phase concepts.
+ */
+function parseStateFile(gsdRoot, nodes, _edges) {
+    const statePath = join(gsdRoot, 'STATE.md');
+    if (!existsSync(statePath))
+        return;
+    let content;
+    try {
+        content = readFileSync(statePath, 'utf-8');
+    }
+    catch {
+        return;
+    }
+    // Extract active milestone
+    const activeMilestoneMatch = content.match(/\*\*Active Milestone:\*\*\s+([A-Z]\d+):\s+(.+)/i);
+    if (activeMilestoneMatch) {
+        const [, milestoneId, title] = activeMilestoneMatch;
+        const id = `milestone:${milestoneId}`;
+        if (!nodes.some((n) => n.id === id)) {
+            nodes.push({
+                id,
+                label: `${milestoneId}: ${title.trim()}`,
+                type: 'milestone',
+                description: `Active milestone: ${milestoneId}`,
+                confidence: 'EXTRACTED',
+                sourceFile: 'STATE.md',
+            });
+        }
+    }
+    // Extract phase as concept
+    const phaseMatch = content.match(/\*\*Phase:\*\*\s+(\S+)/i);
+    if (phaseMatch) {
+        const phase = phaseMatch[1].trim();
+        nodes.push({
+            id: `concept:phase:${phase}`,
+            label: `Phase: ${phase}`,
+            type: 'concept',
+            confidence: 'EXTRACTED',
+            sourceFile: 'STATE.md',
+        });
+    }
+}
+/**
+ * Parse KNOWLEDGE.md for rules, patterns, and lessons.
+ */
+function parseKnowledgeFile(gsdRoot, nodes, _edges) {
+    const knowledgePath = join(gsdRoot, 'KNOWLEDGE.md');
+    if (!existsSync(knowledgePath))
+        return;
+    let content;
+    try {
+        content = readFileSync(knowledgePath, 'utf-8');
+    }
+    catch {
+        return;
+    }
+    // Parse Rules table
+    const rulesMatch = content.match(/## Rules\s*\n([\s\S]*?)(?=\n## |$)/i);
+    if (rulesMatch) {
+        for (const line of rulesMatch[1].split('\n')) {
+            if (!line.includes('|'))
+                continue;
+            const cells = line.split('|').map((c) => c.trim()).filter(Boolean);
+            if (cells.length < 3)
+                continue;
+            if (cells[0].startsWith('#') || cells[0].startsWith('-'))
+                continue;
+            const id = cells[0];
+            if (!/^K\d+$/i.test(id))
+                continue;
+            nodes.push({
+                id: `rule:${id}`,
+                label: id,
+                type: 'rule',
+                description: cells[2] ?? '',
+                confidence: 'EXTRACTED',
+                sourceFile: 'KNOWLEDGE.md',
+            });
+        }
+    }
+    // Parse Patterns table
+    const patternsMatch = content.match(/## Patterns\s*\n([\s\S]*?)(?=\n## |$)/i);
+    if (patternsMatch) {
+        for (const line of patternsMatch[1].split('\n')) {
+            if (!line.includes('|'))
+                continue;
+            const cells = line.split('|').map((c) => c.trim()).filter(Boolean);
+            if (cells.length < 2)
+                continue;
+            if (cells[0].startsWith('#') || cells[0].startsWith('-'))
+                continue;
+            const id = cells[0];
+            if (!/^P\d+$/i.test(id))
+                continue;
+            nodes.push({
+                id: `pattern:${id}`,
+                label: id,
+                type: 'pattern',
+                description: cells[1] ?? '',
+                confidence: 'EXTRACTED',
+                sourceFile: 'KNOWLEDGE.md',
+            });
+        }
+    }
+    // Parse Lessons Learned table
+    const lessonsMatch = content.match(/## Lessons Learned\s*\n([\s\S]*?)(?=\n## |$)/i);
+    if (lessonsMatch) {
+        for (const line of lessonsMatch[1].split('\n')) {
+            if (!line.includes('|'))
+                continue;
+            const cells = line.split('|').map((c) => c.trim()).filter(Boolean);
+            if (cells.length < 2)
+                continue;
+            if (cells[0].startsWith('#') || cells[0].startsWith('-'))
+                continue;
+            const id = cells[0];
+            if (!/^L\d+$/i.test(id))
+                continue;
+            nodes.push({
+                id: `lesson:${id}`,
+                label: id,
+                type: 'lesson',
+                description: cells[1] ?? '',
+                confidence: 'EXTRACTED',
+                sourceFile: 'KNOWLEDGE.md',
+            });
+        }
+    }
+}
+/**
+ * Parse milestone ROADMAP.md files for milestones and slices.
+ */
+function parseMilestoneFiles(gsdRoot, nodes, edges) {
+    const milestoneIds = findMilestoneIds(gsdRoot);
+    for (const milestoneId of milestoneIds) {
+        try {
+            parseSingleMilestone(gsdRoot, milestoneId, nodes, edges);
+        }
+        catch {
+            // Skip this milestone on any error
+        }
+    }
+}
+function parseSingleMilestone(gsdRoot, milestoneId, nodes, edges) {
+    const mDir = resolveMilestoneDir(gsdRoot, milestoneId);
+    if (!mDir)
+        return;
+    const milestoneNodeId = `milestone:${milestoneId}`;
+    // Try to read the roadmap file
+    const roadmapPath = join(mDir, `${milestoneId}-ROADMAP.md`);
+    let roadmapContent = null;
+    if (existsSync(roadmapPath)) {
+        try {
+            roadmapContent = readFileSync(roadmapPath, 'utf-8');
+        }
+        catch {
+            // Skip
+        }
+    }
+    // Extract milestone title from roadmap
+    let milestoneTitle = milestoneId;
+    if (roadmapContent) {
+        const titleMatch = roadmapContent.match(/^#\s+[A-Z]\d+:\s+(.+)/m);
+        if (titleMatch)
+            milestoneTitle = `${milestoneId}: ${titleMatch[1].trim()}`;
+    }
+    // Ensure milestone node exists
+    if (!nodes.some((n) => n.id === milestoneNodeId)) {
+        nodes.push({
+            id: milestoneNodeId,
+            label: milestoneTitle,
+            type: 'milestone',
+            confidence: 'EXTRACTED',
+            sourceFile: roadmapContent ? `milestones/${milestoneId}/${milestoneId}-ROADMAP.md` : undefined,
+        });
+    }
+    // Parse slices from roadmap table or filesystem
+    const sliceIds = findSliceIds(gsdRoot, milestoneId);
+    for (const sliceId of sliceIds) {
+        try {
+            parseSingleSlice(gsdRoot, milestoneId, sliceId, milestoneNodeId, nodes, edges);
+        }
+        catch {
+            // Skip this slice on any error
+        }
+    }
+}
+function parseSingleSlice(gsdRoot, milestoneId, sliceId, milestoneNodeId, nodes, edges) {
+    const sDir = resolveSliceDir(gsdRoot, milestoneId, sliceId);
+    if (!sDir)
+        return;
+    const sliceNodeId = `slice:${milestoneId}:${sliceId}`;
+    // Try to read the slice plan
+    const planPath = join(sDir, `${sliceId}-PLAN.md`);
+    let sliceTitle = `${milestoneId}/${sliceId}`;
+    let planContent = null;
+    if (existsSync(planPath)) {
+        try {
+            planContent = readFileSync(planPath, 'utf-8');
+            const titleMatch = planContent.match(/^#\s+[A-Z]\d+:\s+(.+)/m);
+            if (titleMatch)
+                sliceTitle = `${sliceId}: ${titleMatch[1].trim()}`;
+        }
+        catch {
+            // Use default title
+        }
+    }
+    nodes.push({
+        id: sliceNodeId,
+        label: sliceTitle,
+        type: 'slice',
+        confidence: 'EXTRACTED',
+        sourceFile: planContent ? `milestones/${milestoneId}/slices/${sliceId}/${sliceId}-PLAN.md` : undefined,
+    });
+    // Edge: milestone contains slice
+    edges.push({
+        from: milestoneNodeId,
+        to: sliceNodeId,
+        type: 'contains',
+        confidence: 'EXTRACTED',
+    });
+    // Parse tasks from the slice plan
+    if (planContent) {
+        parseTasksFromPlan(planContent, milestoneId, sliceId, sliceNodeId, nodes, edges);
+    }
+}
+function parseTasksFromPlan(content, milestoneId, sliceId, sliceNodeId, nodes, edges) {
+    // Match lines like: - [ ] **T01: Title** — description
+    const taskPattern = /[-*]\s+\[[ x]\]\s+\*\*(T\d+):\s*([^*]+)\*\*/g;
+    let match;
+    while ((match = taskPattern.exec(content)) !== null) {
+        const [, taskId, taskTitle] = match;
+        const taskNodeId = `task:${milestoneId}:${sliceId}:${taskId}`;
+        nodes.push({
+            id: taskNodeId,
+            label: `${taskId}: ${taskTitle.trim()}`,
+            type: 'task',
+            confidence: 'EXTRACTED',
+        });
+        edges.push({
+            from: sliceNodeId,
+            to: taskNodeId,
+            type: 'contains',
+            confidence: 'EXTRACTED',
+        });
+    }
+}
+// ---------------------------------------------------------------------------
+// buildGraph
+// ---------------------------------------------------------------------------
+/**
+ * Build a KnowledgeGraph by parsing all .gsd/ artifacts.
+ *
+ * Parse errors in any single artifact are caught — the artifact is skipped
+ * and never causes buildGraph() to throw.
+ */
+export async function buildGraph(projectDir) {
+    const gsdRoot = resolveGsdRoot(resolve(projectDir));
+    const nodes = [];
+    const edges = [];
+    // Each parser is wrapped so a crash in one never stops others
+    const parsers = [
+        parseStateFile,
+        parseKnowledgeFile,
+        parseMilestoneFiles,
+    ];
+    for (const parser of parsers) {
+        try {
+            parser(gsdRoot, nodes, edges);
+        }
+        catch {
+            // Parsing error — skip this artifact, mark as ambiguous
+            nodes.push({
+                id: `error:${parser.name}:${Date.now()}`,
+                label: `Parse error in ${parser.name}`,
+                type: 'concept',
+                confidence: 'AMBIGUOUS',
+            });
+        }
+    }
+    // Deduplicate nodes by id (keep first occurrence)
+    const seen = new Set();
+    const dedupedNodes = nodes.filter((n) => {
+        if (seen.has(n.id))
+            return false;
+        seen.add(n.id);
+        return true;
+    });
+    return {
+        nodes: dedupedNodes,
+        edges,
+        builtAt: new Date().toISOString(),
+    };
+}
+// ---------------------------------------------------------------------------
+// writeGraph — atomic write via tmp + rename
+// ---------------------------------------------------------------------------
+/**
+ * Write the graph to .gsd/graphs/graph.json atomically.
+ *
+ * Writes to graph.tmp.json first, then renames to graph.json.
+ * Creates the graphs/ directory if it does not exist.
+ */
+export async function writeGraph(gsdRoot, graph) {
+    const dir = graphsDir(gsdRoot);
+    mkdirSync(dir, { recursive: true });
+    const tmp = graphTmpPath(gsdRoot);
+    const final = graphJsonPath(gsdRoot);
+    writeFileSync(tmp, JSON.stringify(graph, null, 2), 'utf-8');
+    renameSync(tmp, final);
+}
+// ---------------------------------------------------------------------------
+// writeSnapshot
+// ---------------------------------------------------------------------------
+/**
+ * Copy the current graph.json to .last-build-snapshot.json.
+ * Adds a snapshotAt timestamp to the copy.
+ */
+export async function writeSnapshot(gsdRoot) {
+    const src = graphJsonPath(gsdRoot);
+    if (!existsSync(src))
+        return;
+    const dir = graphsDir(gsdRoot);
+    mkdirSync(dir, { recursive: true });
+    const raw = readFileSync(src, 'utf-8');
+    let graph;
+    try {
+        graph = JSON.parse(raw);
+    }
+    catch {
+        return;
+    }
+    const snapshot = { ...graph, snapshotAt: new Date().toISOString() };
+    writeFileSync(snapshotPath(gsdRoot), JSON.stringify(snapshot, null, 2), 'utf-8');
+}
+// ---------------------------------------------------------------------------
+// graphStatus
+// ---------------------------------------------------------------------------
+/**
+ * Return status of the graph: whether it exists, its age, and whether it is stale.
+ * Stale means builtAt is older than 24 hours.
+ */
+export async function graphStatus(projectDir) {
+    const gsdRoot = resolveGsdRoot(resolve(projectDir));
+    const graphPath = graphJsonPath(gsdRoot);
+    if (!existsSync(graphPath)) {
+        return { exists: false };
+    }
+    try {
+        const raw = readFileSync(graphPath, 'utf-8');
+        const graph = JSON.parse(raw);
+        const builtAt = graph.builtAt;
+        const ageMs = Date.now() - new Date(builtAt).getTime();
+        const ageHours = ageMs / (1000 * 60 * 60);
+        const stale = ageHours > 24;
+        return {
+            exists: true,
+            lastBuild: builtAt,
+            nodeCount: graph.nodes.length,
+            edgeCount: graph.edges.length,
+            stale,
+            ageHours,
+        };
+    }
+    catch {
+        return { exists: false };
+    }
+}
+// ---------------------------------------------------------------------------
+// applyBudget — trim edges to stay within token budget
+// ---------------------------------------------------------------------------
+/**
+ * Given a set of seed node IDs and the full graph, apply BFS to collect
+ * reachable nodes and edges. Trims AMBIGUOUS edges first, then INFERRED,
+ * stopping when the estimated token count drops within budget.
+ *
+ * Budget is a rough token estimate: 1 node ≈ 20 tokens, 1 edge ≈ 10 tokens.
+ */
+function applyBudget(graph, seedIds, budget) {
+    // BFS to collect reachable nodes (start from seeds)
+    const reachable = new Set(seedIds);
+    const queue = [...seedIds];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        for (const edge of graph.edges) {
+            if (edge.from === current && !reachable.has(edge.to)) {
+                reachable.add(edge.to);
+                queue.push(edge.to);
+            }
+        }
+    }
+    let resultNodes = graph.nodes.filter((n) => reachable.has(n.id));
+    let resultEdges = graph.edges.filter((e) => reachable.has(e.from) && reachable.has(e.to));
+    // Estimate tokens and trim if over budget
+    // Trim AMBIGUOUS edges first, then INFERRED
+    const estimate = () => resultNodes.length * 20 + resultEdges.length * 10;
+    if (estimate() > budget) {
+        resultEdges = resultEdges.filter((e) => e.confidence !== 'AMBIGUOUS');
+    }
+    if (estimate() > budget) {
+        resultEdges = resultEdges.filter((e) => e.confidence !== 'INFERRED');
+    }
+    if (estimate() > budget) {
+        // Hard trim — keep only seed nodes and their EXTRACTED edges
+        const seedNodes = resultNodes.filter((n) => seedIds.has(n.id));
+        const seedEdges = resultEdges.filter((e) => seedIds.has(e.from) && e.confidence === 'EXTRACTED');
+        return { nodes: seedNodes, edges: seedEdges };
+    }
+    return { nodes: resultNodes, edges: resultEdges };
+}
+// ---------------------------------------------------------------------------
+// graphQuery
+// ---------------------------------------------------------------------------
+/**
+ * Query the graph for nodes matching a term (case-insensitive on label + description).
+ * BFS from seed nodes, applying budget trimming.
+ *
+ * Reads from the pre-built graph.json. Falls back to an empty result if no
+ * graph exists.
+ */
+export async function graphQuery(projectDir, term, budget = 4000) {
+    const gsdRoot = resolveGsdRoot(resolve(projectDir));
+    const graphPath = graphJsonPath(gsdRoot);
+    if (!existsSync(graphPath)) {
+        return { nodes: [], edges: [], term, budget };
+    }
+    let graph;
+    try {
+        const raw = readFileSync(graphPath, 'utf-8');
+        graph = JSON.parse(raw);
+    }
+    catch {
+        return { nodes: [], edges: [], term, budget };
+    }
+    if (!term || term.trim() === '') {
+        // Empty term — return empty result
+        return { nodes: [], edges: [], term, budget };
+    }
+    const lower = term.toLowerCase();
+    // Find seed nodes that match the term
+    const seedIds = new Set(graph.nodes
+        .filter((n) => {
+        const labelMatch = n.label.toLowerCase().includes(lower);
+        const descMatch = n.description?.toLowerCase().includes(lower) ?? false;
+        return labelMatch || descMatch;
+    })
+        .map((n) => n.id));
+    if (seedIds.size === 0) {
+        return { nodes: [], edges: [], term, budget };
+    }
+    const result = applyBudget(graph, seedIds, budget);
+    return { ...result, term, budget };
+}
+// ---------------------------------------------------------------------------
+// graphDiff
+// ---------------------------------------------------------------------------
+/**
+ * Compare the current graph.json with .last-build-snapshot.json.
+ * Returns added/removed/changed nodes and added/removed edges.
+ *
+ * If no snapshot exists, returns empty diff arrays.
+ */
+export async function graphDiff(projectDir) {
+    const gsdRoot = resolveGsdRoot(resolve(projectDir));
+    const empty = {
+        nodes: { added: [], removed: [], changed: [] },
+        edges: { added: [], removed: [] },
+    };
+    const graphPath = graphJsonPath(gsdRoot);
+    const snap = snapshotPath(gsdRoot);
+    if (!existsSync(graphPath))
+        return empty;
+    if (!existsSync(snap))
+        return empty;
+    let current;
+    let snapshot;
+    try {
+        current = JSON.parse(readFileSync(graphPath, 'utf-8'));
+    }
+    catch {
+        return empty;
+    }
+    try {
+        snapshot = JSON.parse(readFileSync(snap, 'utf-8'));
+    }
+    catch {
+        return empty;
+    }
+    const currentNodeIds = new Set(current.nodes.map((n) => n.id));
+    const snapshotNodeIds = new Set(snapshot.nodes.map((n) => n.id));
+    const added = current.nodes.filter((n) => !snapshotNodeIds.has(n.id)).map((n) => n.id);
+    const removed = snapshot.nodes.filter((n) => !currentNodeIds.has(n.id)).map((n) => n.id);
+    // Changed: same id but different label or description
+    const snapshotNodeMap = new Map(snapshot.nodes.map((n) => [n.id, n]));
+    const changed = current.nodes
+        .filter((n) => {
+        const snap = snapshotNodeMap.get(n.id);
+        if (!snap)
+            return false;
+        return n.label !== snap.label || n.description !== snap.description;
+    })
+        .map((n) => n.id);
+    // Edges — compare by string key "from->to:type"
+    const edgeKey = (e) => `${e.from}->${e.to}:${e.type}`;
+    const currentEdgeKeys = new Set(current.edges.map(edgeKey));
+    const snapshotEdgeKeys = new Set(snapshot.edges.map(edgeKey));
+    const edgesAdded = current.edges.filter((e) => !snapshotEdgeKeys.has(edgeKey(e))).map(edgeKey);
+    const edgesRemoved = snapshot.edges.filter((e) => !currentEdgeKeys.has(edgeKey(e))).map(edgeKey);
+    return {
+        nodes: { added, removed, changed },
+        edges: { added: edgesAdded, removed: edgesRemoved },
+    };
+}
+//# sourceMappingURL=graph.js.map

package/packages/mcp-server/dist/readers/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/readers/graph.ts"],"names":[],"mappings":"AAAA,0CAA0C;AAC1C,4DAA4D;AAE5D;;;;;;;;;GASG;AAEH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACzF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAyElH,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,SAAS,SAAS,CAAC,OAAe;IAChC,OAAO,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,aAAa,CAAC,OAAe;IACpC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,YAAY,CAAC,OAAe;IACnC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,YAAY,CAAC,OAAe;IACnC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAC/D,CAAC;AAED,8EAA8E;AAC9E,sDAAsD;AACtD,8EAA8E;AAE9E;;GAEG;AACH,SAAS,cAAc,CAAC,OAAe,EAAE,KAAkB,EAAE,MAAmB;IAC9E,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC5C,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO;IAEnC,IAAI,OAAe,CAAC;IACpB,IAAI,CAAC;QACH,OAAO,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IAED,2BAA2B;IAC3B,MAAM,oBAAoB,GAAG,OAAO,CAAC,KAAK,CAAC,iDAAiD,CAAC,CAAC;IAC9F,IAAI,oBAAoB,EAAE,CAAC;QACzB,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,GAAG,oBAAoB,CAAC;QACpD,MAAM,EAAE,GAAG,aAAa,WAAW,EAAE,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE;gBACF,KAAK,EAAE,GAAG,WAAW,KAAK,KAAK,CAAC,IAAI,EAAE,EAAE;gBACxC,IAAI,EAAE,WAAW;gBACjB,WAAW,EAAE,qBAAqB,WAAW,EAAE;gBAC/C,UAAU,EAAE,WAAW;gBACvB,UAAU,EAAE,UAAU;aACvB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC5D,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,iBAAiB,KAAK,EAAE;YAC5B,KAAK,EAAE,UAAU,KAAK,EAAE;YACxB,IAAI,EAAE,SAAS;YACf,UAAU,EAAE,WAAW;YACvB,UAAU,EAAE,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,OAAe,EAAE,KAAkB,EAAE,MAAmB;IAClF,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC;QAAE,OAAO;IAEvC,IAAI,OAAe,CAAC;IACpB,IAAI,CAAC;QACH,OAAO,GAAG,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IAED,oBAAoB;IACpB,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACxE,IAAI,UAAU,EAAE,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC/B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YACnE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAClC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,QAAQ,EAAE,EAAE;gBAChB,KAAK,EAAE,EAAE;gBACT,IAAI,EAAE,MAAM;gBACZ,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE;gBAC3B,UAAU,EAAE,WAAW;gBACvB,UAAU,EAAE,cAAc;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC9E,IAAI,aAAa,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC/B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YACnE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAClC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,WAAW,EAAE,EAAE;gBACnB,KAAK,EAAE,EAAE;gBACT,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE;gBAC3B,UAAU,EAAE,WAAW;gBACvB,UAAU,EAAE,cAAc;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACpF,IAAI,YAAY,EAAE,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC/B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YACnE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAClC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,UAAU,EAAE,EAAE;gBAClB,KAAK,EAAE,EAAE;gBACT,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE;gBAC3B,UAAU,EAAE,WAAW;gBACvB,UAAU,EAAE,cAAc;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC1B,OAAe,EACf,KAAkB,EAClB,KAAkB;IAElB,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAE/C,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,IAAI,CAAC;YACH,oBAAoB,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;QAAC,MAAM,CAAC;YACP,mCAAmC;QACrC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAC3B,OAAe,EACf,WAAmB,EACnB,KAAkB,EAClB,KAAkB;IAElB,MAAM,IAAI,GAAG,mBAAmB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACvD,IAAI,CAAC,IAAI;QAAE,OAAO;IAElB,MAAM,eAAe,GAAG,aAAa,WAAW,EAAE,CAAC;IAEnD,+BAA+B;IAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,WAAW,aAAa,CAAC,CAAC;IAC5D,IAAI,cAAc,GAAkB,IAAI,CAAC;IACzC,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;QAC5B,IAAI,CAAC;YACH,cAAc,GAAG,YAAY,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,IAAI,cAAc,GAAG,WAAW,CAAC;IACjC,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAClE,IAAI,UAAU;YAAE,cAAc,GAAG,GAAG,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;IAC7E,CAAC;IAED,+BAA+B;IAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,EAAE,CAAC;QACjD,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,eAAe;YACnB,KAAK,EAAE,cAAc;YACrB,IAAI,EAAE,WAAW;YACjB,UAAU,EAAE,WAAW;YACvB,UAAU,EAAE,cAAc,CAAC,CAAC,CAAC,cAAc,WAAW,IAAI,WAAW,aAAa,CAAC,CAAC,CAAC,SAAS;SAC/F,CAAC,CAAC;IACL,CAAC;IAED,gDAAgD;IAChD,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACpD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACjF,CAAC;QAAC,MAAM,CAAC;YACP,+BAA+B;QACjC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAe,EACf,WAAmB,EACnB,OAAe,EACf,eAAuB,EACvB,KAAkB,EAClB,KAAkB;IAElB,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAC5D,IAAI,CAAC,IAAI;QAAE,OAAO;IAElB,MAAM,WAAW,GAAG,SAAS,WAAW,IAAI,OAAO,EAAE,CAAC;IAEtD,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,OAAO,UAAU,CAAC,CAAC;IAClD,IAAI,UAAU,GAAG,GAAG,WAAW,IAAI,OAAO,EAAE,CAAC;IAC7C,IAAI,WAAW,GAAkB,IAAI,CAAC;IAEtC,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,WAAW,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9C,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;YAC/D,IAAI,UAAU;gBAAE,UAAU,GAAG,GAAG,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACrE,CAAC;QAAC,MAAM,CAAC;YACP,oBAAoB;QACtB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,WAAW;QACf,KAAK,EAAE,UAAU;QACjB,IAAI,EAAE,OAAO;QACb,UAAU,EAAE,WAAW;QACvB,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,cAAc,WAAW,WAAW,OAAO,IAAI,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS;KACvG,CAAC,CAAC;IAEH,iCAAiC;IACjC,KAAK,CAAC,IAAI,CAAC;QACT,IAAI,EAAE,eAAe;QACrB,EAAE,EAAE,WAAW;QACf,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,WAAW;KACxB,CAAC,CAAC;IAEH,kCAAkC;IAClC,IAAI,WAAW,EAAE,CAAC;QAChB,kBAAkB,CAAC,WAAW,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnF,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,OAAe,EACf,WAAmB,EACnB,OAAe,EACf,WAAmB,EACnB,KAAkB,EAClB,KAAkB;IAElB,uDAAuD;IACvD,MAAM,WAAW,GAAG,8CAA8C,CAAC;IACnE,IAAI,KAA6B,CAAC;IAElC,OAAO,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACpD,MAAM,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC;QACpC,MAAM,UAAU,GAAG,QAAQ,WAAW,IAAI,OAAO,IAAI,MAAM,EAAE,CAAC;QAE9D,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,UAAU;YACd,KAAK,EAAE,GAAG,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE,EAAE;YACvC,IAAI,EAAE,MAAM;YACZ,UAAU,EAAE,WAAW;SACxB,CAAC,CAAC;QAEH,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,WAAW;YACjB,EAAE,EAAE,UAAU;YACd,IAAI,EAAE,UAAU;YAChB,UAAU,EAAE,WAAW;SACxB,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,UAAkB;IACjD,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;IAEpD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,8DAA8D;IAC9D,MAAM,OAAO,GAA+D;QAC1E,cAAc;QACd,kBAAkB;QAClB,mBAAmB;KACpB,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,wDAAwD;YACxD,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,SAAS,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE;gBACxC,KAAK,EAAE,kBAAkB,MAAM,CAAC,IAAI,EAAE;gBACtC,IAAI,EAAE,SAAS;gBACf,UAAU,EAAE,WAAW;aACxB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,YAAY;QACnB,KAAK;QACL,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KAClC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,6CAA6C;AAC7C,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAAe,EAAE,KAAqB;IACrE,MAAM,GAAG,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAC/B,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEpC,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAErC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5D,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,OAAe;IACjD,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACnC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO;IAE7B,MAAM,GAAG,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAC/B,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEpC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACvC,IAAI,KAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IACD,MAAM,QAAQ,GAAG,EAAE,GAAG,KAAK,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;IAEpE,aAAa,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;AACnF,CAAC;AAED,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,UAAkB;IAClD,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAEzC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;QAEhD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,QAAQ,GAAG,EAAE,CAAC;QAE5B,OAAO;YACL,MAAM,EAAE,IAAI;YACZ,SAAS,EAAE,OAAO;YAClB,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;YAC7B,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;YAC7B,KAAK;YACL,QAAQ;SACT,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,uDAAuD;AACvD,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,WAAW,CAClB,KAAqB,EACrB,OAAoB,EACpB,MAAc;IAEd,oDAAoD;IACpD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAE3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,IAAI,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CACpD,CAAC;IAEF,0CAA0C;IAC1C,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,GAAW,EAAE,CAC5B,WAAW,CAAC,MAAM,GAAG,EAAE,GAAG,WAAW,CAAC,MAAM,GAAG,EAAE,CAAC;IAEpD,IAAI,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC;QACxB,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,WAAW,CAAC,CAAC;IACxE,CAAC;IACD,IAAI,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC;QACxB,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC;QACxB,6DAA6D;QAC7D,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,KAAK,WAAW,CAC3D,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AACpD,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,UAAkB,EAClB,IAAY,EACZ,MAAM,GAAG,IAAI;IAEb,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAEzC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAChD,CAAC;IAED,IAAI,KAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC7C,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAChD,CAAC;IAED,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAChC,mCAAmC;QACnC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAEjC,sCAAsC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,KAAK,CAAC,KAAK;SACR,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,CAAC,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QACxE,OAAO,UAAU,IAAI,SAAS,CAAC;IACjC,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACpB,CAAC;IAEF,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACnD,OAAO,EAAE,GAAG,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AACrC,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,UAAkB;IAChD,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;IACpD,MAAM,KAAK,GAAoB;QAC7B,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;QAC9C,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;KAClC,CAAC;IAEF,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IAEnC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,IAAI,OAAuB,CAAC;IAC5B,IAAI,QAAwB,CAAC;IAE7B,IAAI,CAAC;QACH,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAmB,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,CAAC;QACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAmB,CAAC;IACvE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvF,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEzF,sDAAsD;IACtD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,OAAO,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,CAAC;IACtE,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEpB,gDAAgD;IAChD,MAAM,OAAO,GAAG,CAAC,CAAY,EAAU,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACzE,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAE9D,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC/F,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAEjG,OAAO;QACL,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE;QAClC,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,EAAE;KACpD,CAAC;AACJ,CAAC","sourcesContent":["// GSD MCP Server — knowledge graph reader\n// Copyright (c) 2026 Jeremy McSpadden <jeremy@fluxlabs.net>\n\n/**\n * Knowledge Graph for GSD projects.\n *\n * Parses .gsd/ artifacts (STATE.md, milestone ROADMAPs, slice PLANs,\n * KNOWLEDGE.md) into a graph of nodes and edges. Parse errors in any\n * single artifact are caught and never propagate — the artifact is skipped\n * and the rest of the graph is returned.\n *\n * writeGraph() is atomic: writes to graph.tmp.json then renames to graph.json.\n */\n\nimport { readFileSync, writeFileSync, renameSync, existsSync, mkdirSync } from 'node:fs';\nimport { join, resolve } from 'node:path';\nimport { resolveGsdRoot, findMilestoneIds, resolveMilestoneDir, findSliceIds, resolveSliceDir } from './paths.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport type NodeType =\n  | 'milestone'\n  | 'slice'\n  | 'task'\n  | 'rule'\n  | 'pattern'\n  | 'lesson'\n  | 'concept';\n\nexport type EdgeType =\n  | 'contains'\n  | 'depends_on'\n  | 'relates_to'\n  | 'implements';\n\nexport type ConfidenceTier = 'EXTRACTED' | 'INFERRED' | 'AMBIGUOUS';\n\nexport interface GraphNode {\n  id: string;\n  label: string;\n  type: NodeType;\n  description?: string;\n  confidence: ConfidenceTier;\n  sourceFile?: string;\n}\n\nexport interface GraphEdge {\n  from: string;\n  to: string;\n  type: EdgeType;\n  confidence: ConfidenceTier;\n}\n\nexport interface KnowledgeGraph {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  builtAt: string;\n}\n\nexport interface GraphStatusResult {\n  exists: boolean;\n  lastBuild?: string;\n  nodeCount?: number;\n  edgeCount?: number;\n  stale?: boolean;\n  ageHours?: number;\n}\n\nexport interface GraphQueryResult {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  term: string;\n  budget: number;\n}\n\nexport interface GraphDiffResult {\n  nodes: {\n    added: string[];\n    removed: string[];\n    changed: string[];\n  };\n  edges: {\n    added: string[];\n    removed: string[];\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Graph file paths\n// ---------------------------------------------------------------------------\n\nfunction graphsDir(gsdRoot: string): string {\n  return join(gsdRoot, 'graphs');\n}\n\nfunction graphJsonPath(gsdRoot: string): string {\n  return join(graphsDir(gsdRoot), 'graph.json');\n}\n\nfunction graphTmpPath(gsdRoot: string): string {\n  return join(graphsDir(gsdRoot), 'graph.tmp.json');\n}\n\nfunction snapshotPath(gsdRoot: string): string {\n  return join(graphsDir(gsdRoot), '.last-build-snapshot.json');\n}\n\n// ---------------------------------------------------------------------------\n// Parsers — each returns nodes/edges and never throws\n// ---------------------------------------------------------------------------\n\n/**\n * Parse STATE.md for active milestone and phase concepts.\n */\nfunction parseStateFile(gsdRoot: string, nodes: GraphNode[], _edges: GraphEdge[]): void {\n  const statePath = join(gsdRoot, 'STATE.md');\n  if (!existsSync(statePath)) return;\n\n  let content: string;\n  try {\n    content = readFileSync(statePath, 'utf-8');\n  } catch {\n    return;\n  }\n\n  // Extract active milestone\n  const activeMilestoneMatch = content.match(/\\*\\*Active Milestone:\\*\\*\\s+([A-Z]\\d+):\\s+(.+)/i);\n  if (activeMilestoneMatch) {\n    const [, milestoneId, title] = activeMilestoneMatch;\n    const id = `milestone:${milestoneId}`;\n    if (!nodes.some((n) => n.id === id)) {\n      nodes.push({\n        id,\n        label: `${milestoneId}: ${title.trim()}`,\n        type: 'milestone',\n        description: `Active milestone: ${milestoneId}`,\n        confidence: 'EXTRACTED',\n        sourceFile: 'STATE.md',\n      });\n    }\n  }\n\n  // Extract phase as concept\n  const phaseMatch = content.match(/\\*\\*Phase:\\*\\*\\s+(\\S+)/i);\n  if (phaseMatch) {\n    const phase = phaseMatch[1].trim();\n    nodes.push({\n      id: `concept:phase:${phase}`,\n      label: `Phase: ${phase}`,\n      type: 'concept',\n      confidence: 'EXTRACTED',\n      sourceFile: 'STATE.md',\n    });\n  }\n}\n\n/**\n * Parse KNOWLEDGE.md for rules, patterns, and lessons.\n */\nfunction parseKnowledgeFile(gsdRoot: string, nodes: GraphNode[], _edges: GraphEdge[]): void {\n  const knowledgePath = join(gsdRoot, 'KNOWLEDGE.md');\n  if (!existsSync(knowledgePath)) return;\n\n  let content: string;\n  try {\n    content = readFileSync(knowledgePath, 'utf-8');\n  } catch {\n    return;\n  }\n\n  // Parse Rules table\n  const rulesMatch = content.match(/## Rules\\s*\\n([\\s\\S]*?)(?=\\n## |$)/i);\n  if (rulesMatch) {\n    for (const line of rulesMatch[1].split('\\n')) {\n      if (!line.includes('|')) continue;\n      const cells = line.split('|').map((c) => c.trim()).filter(Boolean);\n      if (cells.length < 3) continue;\n      if (cells[0].startsWith('#') || cells[0].startsWith('-')) continue;\n      const id = cells[0];\n      if (!/^K\\d+$/i.test(id)) continue;\n      nodes.push({\n        id: `rule:${id}`,\n        label: id,\n        type: 'rule',\n        description: cells[2] ?? '',\n        confidence: 'EXTRACTED',\n        sourceFile: 'KNOWLEDGE.md',\n      });\n    }\n  }\n\n  // Parse Patterns table\n  const patternsMatch = content.match(/## Patterns\\s*\\n([\\s\\S]*?)(?=\\n## |$)/i);\n  if (patternsMatch) {\n    for (const line of patternsMatch[1].split('\\n')) {\n      if (!line.includes('|')) continue;\n      const cells = line.split('|').map((c) => c.trim()).filter(Boolean);\n      if (cells.length < 2) continue;\n      if (cells[0].startsWith('#') || cells[0].startsWith('-')) continue;\n      const id = cells[0];\n      if (!/^P\\d+$/i.test(id)) continue;\n      nodes.push({\n        id: `pattern:${id}`,\n        label: id,\n        type: 'pattern',\n        description: cells[1] ?? '',\n        confidence: 'EXTRACTED',\n        sourceFile: 'KNOWLEDGE.md',\n      });\n    }\n  }\n\n  // Parse Lessons Learned table\n  const lessonsMatch = content.match(/## Lessons Learned\\s*\\n([\\s\\S]*?)(?=\\n## |$)/i);\n  if (lessonsMatch) {\n    for (const line of lessonsMatch[1].split('\\n')) {\n      if (!line.includes('|')) continue;\n      const cells = line.split('|').map((c) => c.trim()).filter(Boolean);\n      if (cells.length < 2) continue;\n      if (cells[0].startsWith('#') || cells[0].startsWith('-')) continue;\n      const id = cells[0];\n      if (!/^L\\d+$/i.test(id)) continue;\n      nodes.push({\n        id: `lesson:${id}`,\n        label: id,\n        type: 'lesson',\n        description: cells[1] ?? '',\n        confidence: 'EXTRACTED',\n        sourceFile: 'KNOWLEDGE.md',\n      });\n    }\n  }\n}\n\n/**\n * Parse milestone ROADMAP.md files for milestones and slices.\n */\nfunction parseMilestoneFiles(\n  gsdRoot: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n): void {\n  const milestoneIds = findMilestoneIds(gsdRoot);\n\n  for (const milestoneId of milestoneIds) {\n    try {\n      parseSingleMilestone(gsdRoot, milestoneId, nodes, edges);\n    } catch {\n      // Skip this milestone on any error\n    }\n  }\n}\n\nfunction parseSingleMilestone(\n  gsdRoot: string,\n  milestoneId: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n): void {\n  const mDir = resolveMilestoneDir(gsdRoot, milestoneId);\n  if (!mDir) return;\n\n  const milestoneNodeId = `milestone:${milestoneId}`;\n\n  // Try to read the roadmap file\n  const roadmapPath = join(mDir, `${milestoneId}-ROADMAP.md`);\n  let roadmapContent: string | null = null;\n  if (existsSync(roadmapPath)) {\n    try {\n      roadmapContent = readFileSync(roadmapPath, 'utf-8');\n    } catch {\n      // Skip\n    }\n  }\n\n  // Extract milestone title from roadmap\n  let milestoneTitle = milestoneId;\n  if (roadmapContent) {\n    const titleMatch = roadmapContent.match(/^#\\s+[A-Z]\\d+:\\s+(.+)/m);\n    if (titleMatch) milestoneTitle = `${milestoneId}: ${titleMatch[1].trim()}`;\n  }\n\n  // Ensure milestone node exists\n  if (!nodes.some((n) => n.id === milestoneNodeId)) {\n    nodes.push({\n      id: milestoneNodeId,\n      label: milestoneTitle,\n      type: 'milestone',\n      confidence: 'EXTRACTED',\n      sourceFile: roadmapContent ? `milestones/${milestoneId}/${milestoneId}-ROADMAP.md` : undefined,\n    });\n  }\n\n  // Parse slices from roadmap table or filesystem\n  const sliceIds = findSliceIds(gsdRoot, milestoneId);\n  for (const sliceId of sliceIds) {\n    try {\n      parseSingleSlice(gsdRoot, milestoneId, sliceId, milestoneNodeId, nodes, edges);\n    } catch {\n      // Skip this slice on any error\n    }\n  }\n}\n\nfunction parseSingleSlice(\n  gsdRoot: string,\n  milestoneId: string,\n  sliceId: string,\n  milestoneNodeId: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n): void {\n  const sDir = resolveSliceDir(gsdRoot, milestoneId, sliceId);\n  if (!sDir) return;\n\n  const sliceNodeId = `slice:${milestoneId}:${sliceId}`;\n\n  // Try to read the slice plan\n  const planPath = join(sDir, `${sliceId}-PLAN.md`);\n  let sliceTitle = `${milestoneId}/${sliceId}`;\n  let planContent: string | null = null;\n\n  if (existsSync(planPath)) {\n    try {\n      planContent = readFileSync(planPath, 'utf-8');\n      const titleMatch = planContent.match(/^#\\s+[A-Z]\\d+:\\s+(.+)/m);\n      if (titleMatch) sliceTitle = `${sliceId}: ${titleMatch[1].trim()}`;\n    } catch {\n      // Use default title\n    }\n  }\n\n  nodes.push({\n    id: sliceNodeId,\n    label: sliceTitle,\n    type: 'slice',\n    confidence: 'EXTRACTED',\n    sourceFile: planContent ? `milestones/${milestoneId}/slices/${sliceId}/${sliceId}-PLAN.md` : undefined,\n  });\n\n  // Edge: milestone contains slice\n  edges.push({\n    from: milestoneNodeId,\n    to: sliceNodeId,\n    type: 'contains',\n    confidence: 'EXTRACTED',\n  });\n\n  // Parse tasks from the slice plan\n  if (planContent) {\n    parseTasksFromPlan(planContent, milestoneId, sliceId, sliceNodeId, nodes, edges);\n  }\n}\n\nfunction parseTasksFromPlan(\n  content: string,\n  milestoneId: string,\n  sliceId: string,\n  sliceNodeId: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n): void {\n  // Match lines like: - [ ] **T01: Title** — description\n  const taskPattern = /[-*]\\s+\\[[ x]\\]\\s+\\*\\*(T\\d+):\\s*([^*]+)\\*\\*/g;\n  let match: RegExpExecArray | null;\n\n  while ((match = taskPattern.exec(content)) !== null) {\n    const [, taskId, taskTitle] = match;\n    const taskNodeId = `task:${milestoneId}:${sliceId}:${taskId}`;\n\n    nodes.push({\n      id: taskNodeId,\n      label: `${taskId}: ${taskTitle.trim()}`,\n      type: 'task',\n      confidence: 'EXTRACTED',\n    });\n\n    edges.push({\n      from: sliceNodeId,\n      to: taskNodeId,\n      type: 'contains',\n      confidence: 'EXTRACTED',\n    });\n  }\n}\n\n// ---------------------------------------------------------------------------\n// buildGraph\n// ---------------------------------------------------------------------------\n\n/**\n * Build a KnowledgeGraph by parsing all .gsd/ artifacts.\n *\n * Parse errors in any single artifact are caught — the artifact is skipped\n * and never causes buildGraph() to throw.\n */\nexport async function buildGraph(projectDir: string): Promise<KnowledgeGraph> {\n  const gsdRoot = resolveGsdRoot(resolve(projectDir));\n\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n\n  // Each parser is wrapped so a crash in one never stops others\n  const parsers: Array<(g: string, n: GraphNode[], e: GraphEdge[]) => void> = [\n    parseStateFile,\n    parseKnowledgeFile,\n    parseMilestoneFiles,\n  ];\n\n  for (const parser of parsers) {\n    try {\n      parser(gsdRoot, nodes, edges);\n    } catch {\n      // Parsing error — skip this artifact, mark as ambiguous\n      nodes.push({\n        id: `error:${parser.name}:${Date.now()}`,\n        label: `Parse error in ${parser.name}`,\n        type: 'concept',\n        confidence: 'AMBIGUOUS',\n      });\n    }\n  }\n\n  // Deduplicate nodes by id (keep first occurrence)\n  const seen = new Set<string>();\n  const dedupedNodes = nodes.filter((n) => {\n    if (seen.has(n.id)) return false;\n    seen.add(n.id);\n    return true;\n  });\n\n  return {\n    nodes: dedupedNodes,\n    edges,\n    builtAt: new Date().toISOString(),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// writeGraph — atomic write via tmp + rename\n// ---------------------------------------------------------------------------\n\n/**\n * Write the graph to .gsd/graphs/graph.json atomically.\n *\n * Writes to graph.tmp.json first, then renames to graph.json.\n * Creates the graphs/ directory if it does not exist.\n */\nexport async function writeGraph(gsdRoot: string, graph: KnowledgeGraph): Promise<void> {\n  const dir = graphsDir(gsdRoot);\n  mkdirSync(dir, { recursive: true });\n\n  const tmp = graphTmpPath(gsdRoot);\n  const final = graphJsonPath(gsdRoot);\n\n  writeFileSync(tmp, JSON.stringify(graph, null, 2), 'utf-8');\n  renameSync(tmp, final);\n}\n\n// ---------------------------------------------------------------------------\n// writeSnapshot\n// ---------------------------------------------------------------------------\n\n/**\n * Copy the current graph.json to .last-build-snapshot.json.\n * Adds a snapshotAt timestamp to the copy.\n */\nexport async function writeSnapshot(gsdRoot: string): Promise<void> {\n  const src = graphJsonPath(gsdRoot);\n  if (!existsSync(src)) return;\n\n  const dir = graphsDir(gsdRoot);\n  mkdirSync(dir, { recursive: true });\n\n  const raw = readFileSync(src, 'utf-8');\n  let graph: KnowledgeGraph;\n  try {\n    graph = JSON.parse(raw) as KnowledgeGraph;\n  } catch {\n    return;\n  }\n  const snapshot = { ...graph, snapshotAt: new Date().toISOString() };\n\n  writeFileSync(snapshotPath(gsdRoot), JSON.stringify(snapshot, null, 2), 'utf-8');\n}\n\n// ---------------------------------------------------------------------------\n// graphStatus\n// ---------------------------------------------------------------------------\n\n/**\n * Return status of the graph: whether it exists, its age, and whether it is stale.\n * Stale means builtAt is older than 24 hours.\n */\nexport async function graphStatus(projectDir: string): Promise<GraphStatusResult> {\n  const gsdRoot = resolveGsdRoot(resolve(projectDir));\n  const graphPath = graphJsonPath(gsdRoot);\n\n  if (!existsSync(graphPath)) {\n    return { exists: false };\n  }\n\n  try {\n    const raw = readFileSync(graphPath, 'utf-8');\n    const graph = JSON.parse(raw) as KnowledgeGraph;\n\n    const builtAt = graph.builtAt;\n    const ageMs = Date.now() - new Date(builtAt).getTime();\n    const ageHours = ageMs / (1000 * 60 * 60);\n    const stale = ageHours > 24;\n\n    return {\n      exists: true,\n      lastBuild: builtAt,\n      nodeCount: graph.nodes.length,\n      edgeCount: graph.edges.length,\n      stale,\n      ageHours,\n    };\n  } catch {\n    return { exists: false };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// applyBudget — trim edges to stay within token budget\n// ---------------------------------------------------------------------------\n\n/**\n * Given a set of seed node IDs and the full graph, apply BFS to collect\n * reachable nodes and edges. Trims AMBIGUOUS edges first, then INFERRED,\n * stopping when the estimated token count drops within budget.\n *\n * Budget is a rough token estimate: 1 node ≈ 20 tokens, 1 edge ≈ 10 tokens.\n */\nfunction applyBudget(\n  graph: KnowledgeGraph,\n  seedIds: Set<string>,\n  budget: number,\n): { nodes: GraphNode[]; edges: GraphEdge[] } {\n  // BFS to collect reachable nodes (start from seeds)\n  const reachable = new Set<string>(seedIds);\n  const queue = [...seedIds];\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    for (const edge of graph.edges) {\n      if (edge.from === current && !reachable.has(edge.to)) {\n        reachable.add(edge.to);\n        queue.push(edge.to);\n      }\n    }\n  }\n\n  let resultNodes = graph.nodes.filter((n) => reachable.has(n.id));\n  let resultEdges = graph.edges.filter(\n    (e) => reachable.has(e.from) && reachable.has(e.to),\n  );\n\n  // Estimate tokens and trim if over budget\n  // Trim AMBIGUOUS edges first, then INFERRED\n  const estimate = (): number =>\n    resultNodes.length * 20 + resultEdges.length * 10;\n\n  if (estimate() > budget) {\n    resultEdges = resultEdges.filter((e) => e.confidence !== 'AMBIGUOUS');\n  }\n  if (estimate() > budget) {\n    resultEdges = resultEdges.filter((e) => e.confidence !== 'INFERRED');\n  }\n  if (estimate() > budget) {\n    // Hard trim — keep only seed nodes and their EXTRACTED edges\n    const seedNodes = resultNodes.filter((n) => seedIds.has(n.id));\n    const seedEdges = resultEdges.filter(\n      (e) => seedIds.has(e.from) && e.confidence === 'EXTRACTED',\n    );\n    return { nodes: seedNodes, edges: seedEdges };\n  }\n\n  return { nodes: resultNodes, edges: resultEdges };\n}\n\n// ---------------------------------------------------------------------------\n// graphQuery\n// ---------------------------------------------------------------------------\n\n/**\n * Query the graph for nodes matching a term (case-insensitive on label + description).\n * BFS from seed nodes, applying budget trimming.\n *\n * Reads from the pre-built graph.json. Falls back to an empty result if no\n * graph exists.\n */\nexport async function graphQuery(\n  projectDir: string,\n  term: string,\n  budget = 4000,\n): Promise<GraphQueryResult> {\n  const gsdRoot = resolveGsdRoot(resolve(projectDir));\n  const graphPath = graphJsonPath(gsdRoot);\n\n  if (!existsSync(graphPath)) {\n    return { nodes: [], edges: [], term, budget };\n  }\n\n  let graph: KnowledgeGraph;\n  try {\n    const raw = readFileSync(graphPath, 'utf-8');\n    graph = JSON.parse(raw) as KnowledgeGraph;\n  } catch {\n    return { nodes: [], edges: [], term, budget };\n  }\n\n  if (!term || term.trim() === '') {\n    // Empty term — return empty result\n    return { nodes: [], edges: [], term, budget };\n  }\n\n  const lower = term.toLowerCase();\n\n  // Find seed nodes that match the term\n  const seedIds = new Set<string>(\n    graph.nodes\n      .filter((n) => {\n        const labelMatch = n.label.toLowerCase().includes(lower);\n        const descMatch = n.description?.toLowerCase().includes(lower) ?? false;\n        return labelMatch || descMatch;\n      })\n      .map((n) => n.id),\n  );\n\n  if (seedIds.size === 0) {\n    return { nodes: [], edges: [], term, budget };\n  }\n\n  const result = applyBudget(graph, seedIds, budget);\n  return { ...result, term, budget };\n}\n\n// ---------------------------------------------------------------------------\n// graphDiff\n// ---------------------------------------------------------------------------\n\n/**\n * Compare the current graph.json with .last-build-snapshot.json.\n * Returns added/removed/changed nodes and added/removed edges.\n *\n * If no snapshot exists, returns empty diff arrays.\n */\nexport async function graphDiff(projectDir: string): Promise<GraphDiffResult> {\n  const gsdRoot = resolveGsdRoot(resolve(projectDir));\n  const empty: GraphDiffResult = {\n    nodes: { added: [], removed: [], changed: [] },\n    edges: { added: [], removed: [] },\n  };\n\n  const graphPath = graphJsonPath(gsdRoot);\n  const snap = snapshotPath(gsdRoot);\n\n  if (!existsSync(graphPath)) return empty;\n  if (!existsSync(snap)) return empty;\n\n  let current: KnowledgeGraph;\n  let snapshot: KnowledgeGraph;\n\n  try {\n    current = JSON.parse(readFileSync(graphPath, 'utf-8')) as KnowledgeGraph;\n  } catch {\n    return empty;\n  }\n\n  try {\n    snapshot = JSON.parse(readFileSync(snap, 'utf-8')) as KnowledgeGraph;\n  } catch {\n    return empty;\n  }\n\n  const currentNodeIds = new Set(current.nodes.map((n) => n.id));\n  const snapshotNodeIds = new Set(snapshot.nodes.map((n) => n.id));\n\n  const added = current.nodes.filter((n) => !snapshotNodeIds.has(n.id)).map((n) => n.id);\n  const removed = snapshot.nodes.filter((n) => !currentNodeIds.has(n.id)).map((n) => n.id);\n\n  // Changed: same id but different label or description\n  const snapshotNodeMap = new Map(snapshot.nodes.map((n) => [n.id, n]));\n  const changed = current.nodes\n    .filter((n) => {\n      const snap = snapshotNodeMap.get(n.id);\n      if (!snap) return false;\n      return n.label !== snap.label || n.description !== snap.description;\n    })\n    .map((n) => n.id);\n\n  // Edges — compare by string key \"from->to:type\"\n  const edgeKey = (e: GraphEdge): string => `${e.from}->${e.to}:${e.type}`;\n  const currentEdgeKeys = new Set(current.edges.map(edgeKey));\n  const snapshotEdgeKeys = new Set(snapshot.edges.map(edgeKey));\n\n  const edgesAdded = current.edges.filter((e) => !snapshotEdgeKeys.has(edgeKey(e))).map(edgeKey);\n  const edgesRemoved = snapshot.edges.filter((e) => !currentEdgeKeys.has(edgeKey(e))).map(edgeKey);\n\n  return {\n    nodes: { added, removed, changed },\n    edges: { added: edgesAdded, removed: edgesRemoved },\n  };\n}\n"]}

package/packages/mcp-server/dist/readers/index.d.ts

@@ -11,4 +11,6 @@ export { readKnowledge } from './knowledge.js';
 export type { KnowledgeResult, KnowledgeEntry } from './knowledge.js';
 export { runDoctorLite } from './doctor-lite.js';
 export type { DoctorResult, DoctorIssue } from './doctor-lite.js';
+export { buildGraph, writeGraph, writeSnapshot, graphStatus, graphQuery, graphDiff } from './graph.js';
+export type { NodeType, EdgeType, ConfidenceTier, GraphNode, GraphEdge, KnowledgeGraph, GraphStatusResult, GraphQueryResult, GraphDiffResult, } from './graph.js';
 //# sourceMappingURL=index.d.ts.map

package/packages/mcp-server/dist/readers/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/readers/index.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,YAAY,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/readers/index.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,YAAY,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvG,YAAY,EACV,QAAQ,EACR,QAAQ,EACR,cAAc,EACd,SAAS,EACT,SAAS,EACT,cAAc,EACd,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,GAChB,MAAM,YAAY,CAAC"}

package/packages/mcp-server/dist/readers/index.js

@@ -7,4 +7,5 @@ export { readHistory } from './metrics.js';
 export { readCaptures } from './captures.js';
 export { readKnowledge } from './knowledge.js';
 export { runDoctorLite } from './doctor-lite.js';
+export { buildGraph, writeGraph, writeSnapshot, graphStatus, graphQuery, graphDiff } from './graph.js';
 //# sourceMappingURL=index.js.map

package/packages/mcp-server/dist/readers/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/readers/index.ts"],"names":[],"mappings":"AAAA,yCAAyC;AACzC,4DAA4D;AAE5D,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAE/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC","sourcesContent":["// GSD MCP Server — readers barrel export\n// Copyright (c) 2026 Jeremy McSpadden <jeremy@fluxlabs.net>\n\nexport { resolveGsdRoot, resolveRootFile } from './paths.js';\nexport { readProgress } from './state.js';\nexport type { ProgressResult } from './state.js';\nexport { readRoadmap } from './roadmap.js';\nexport type { RoadmapResult, MilestoneInfo, SliceInfo, TaskInfo } from './roadmap.js';\nexport { readHistory } from './metrics.js';\nexport type { HistoryResult, MetricsUnit } from './metrics.js';\nexport { readCaptures } from './captures.js';\nexport type { CapturesResult, CaptureEntry } from './captures.js';\nexport { readKnowledge } from './knowledge.js';\nexport type { KnowledgeResult, KnowledgeEntry } from './knowledge.js';\nexport { runDoctorLite } from './doctor-lite.js';\nexport type { DoctorResult, DoctorIssue } from './doctor-lite.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/readers/index.ts"],"names":[],"mappings":"AAAA,yCAAyC;AACzC,4DAA4D;AAE5D,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAE/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC","sourcesContent":["// GSD MCP Server — readers barrel export\n// Copyright (c) 2026 Jeremy McSpadden <jeremy@fluxlabs.net>\n\nexport { resolveGsdRoot, resolveRootFile } from './paths.js';\nexport { readProgress } from './state.js';\nexport type { ProgressResult } from './state.js';\nexport { readRoadmap } from './roadmap.js';\nexport type { RoadmapResult, MilestoneInfo, SliceInfo, TaskInfo } from './roadmap.js';\nexport { readHistory } from './metrics.js';\nexport type { HistoryResult, MetricsUnit } from './metrics.js';\nexport { readCaptures } from './captures.js';\nexport type { CapturesResult, CaptureEntry } from './captures.js';\nexport { readKnowledge } from './knowledge.js';\nexport type { KnowledgeResult, KnowledgeEntry } from './knowledge.js';\nexport { runDoctorLite } from './doctor-lite.js';\nexport type { DoctorResult, DoctorIssue } from './doctor-lite.js';\nexport { buildGraph, writeGraph, writeSnapshot, graphStatus, graphQuery, graphDiff } from './graph.js';\nexport type {\n  NodeType,\n  EdgeType,\n  ConfidenceTier,\n  GraphNode,\n  GraphEdge,\n  KnowledgeGraph,\n  GraphStatusResult,\n  GraphQueryResult,\n  GraphDiffResult,\n} from './graph.js';\n"]}