@jafreck/lore 0.3.6 → 0.3.8

package/dist/server/tools/structure.d.ts

@@ -0,0 +1,77 @@
+/**
+ * @module lore-server/tools/structure
+ *
+ * MCP tool: detect structural anomalies in the codebase at the directory level.
+ *
+ * Analyses:
+ *   - **cycles**: Directory-level import cycles via Tarjan's SCC.
+ *   - **layers**: Topological layering violations via Kahn's algorithm.
+ *   - **outliers**: Anomalous cross-directory couplings by edge-count statistics.
+ */
+import type { Database } from '../../db/read-only.js';
+export declare const toolDef: {
+    readonly name: "lore_structure";
+    readonly description: string;
+    readonly inputSchema: {
+        readonly type: "object";
+        readonly properties: {
+            readonly analysis: {
+                readonly type: "string";
+                readonly enum: readonly ["cycles", "layers", "outliers", "all"];
+                readonly description: string;
+            };
+            readonly depth: {
+                readonly type: "number";
+                readonly description: string;
+                readonly minimum: 1;
+                readonly maximum: 10;
+            };
+            readonly branch: {
+                readonly type: "string";
+                readonly description: "Optional branch name to filter file_imports by source file branch.";
+            };
+            readonly limit: {
+                readonly type: "number";
+                readonly description: "Maximum number of results per analysis (default 20).";
+                readonly minimum: 1;
+                readonly maximum: 500;
+            };
+        };
+        readonly required: readonly string[];
+    };
+};
+type AnalysisMode = 'cycles' | 'layers' | 'outliers' | 'all';
+export interface StructureArgs {
+    analysis?: AnalysisMode;
+    depth?: number;
+    branch?: string;
+    limit?: number;
+}
+export interface StructureCycle {
+    directories: string[];
+    edge_count: number;
+}
+export interface LayerViolation {
+    from_dir: string;
+    to_dir: string;
+    from_rank: number;
+    to_rank: number;
+    edge_count: number;
+    sample_files: string[];
+}
+export interface OutlierEdge {
+    from_dir: string;
+    to_dir: string;
+    edge_count: number;
+    reverse_edge_count: number;
+    sample_files: string[];
+}
+export interface StructureResult {
+    cycles?: StructureCycle[];
+    layer_violations?: LayerViolation[];
+    outliers?: OutlierEdge[];
+}
+/** Analyse directory-level structural anomalies in the codebase. */
+export declare function handler(db: Database.Database, args: StructureArgs): StructureResult;
+export {};
+//# sourceMappingURL=structure.d.ts.map

package/dist/server/tools/structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structure.d.ts","sourceRoot":"","sources":["../../../src/server/tools/structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAItD,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;2BA2CA,SAAS,MAAM,EAAE;;CAE3B,CAAC;AAIX,KAAK,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,UAAU,GAAG,KAAK,CAAC;AAE7D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAC1B,gBAAgB,CAAC,EAAE,cAAc,EAAE,CAAC;IACpC,QAAQ,CAAC,EAAE,WAAW,EAAE,CAAC;CAC1B;AAwSD,oEAAoE;AACpE,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,aAAa,GAAG,eAAe,CAqBnF"}

package/dist/server/tools/structure.js

@@ -0,0 +1,309 @@
+/**
+ * @module lore-server/tools/structure
+ *
+ * MCP tool: detect structural anomalies in the codebase at the directory level.
+ *
+ * Analyses:
+ *   - **cycles**: Directory-level import cycles via Tarjan's SCC.
+ *   - **layers**: Topological layering violations via Kahn's algorithm.
+ *   - **outliers**: Anomalous cross-directory couplings by edge-count statistics.
+ */
+// ─── Tool definition ──────────────────────────────────────────────────────────
+export const toolDef = {
+    name: 'lore_structure',
+    description: 'Detect structural anomalies in the codebase at the directory level. ' +
+        'Aggregates file-level imports into directory-level edges and runs: ' +
+        "(A) Tarjan's SCC for import cycle detection, " +
+        "(B) Kahn's topological sort for layering violation detection, " +
+        '(C) outlier detection for anomalous cross-directory couplings. ' +
+        'Set `analysis` to "cycles", "layers", "outliers", or "all" (default). ' +
+        'Use `depth` to control directory aggregation depth (default 2). ' +
+        'Use `branch` to filter by source branch.',
+    inputSchema: {
+        type: 'object',
+        properties: {
+            analysis: {
+                type: 'string',
+                enum: ['cycles', 'layers', 'outliers', 'all'],
+                description: 'Which analysis to run. "cycles" detects directory-level import cycles, ' +
+                    '"layers" detects topological layering violations, ' +
+                    '"outliers" detects anomalous cross-directory couplings, ' +
+                    '"all" runs all three. Default: "all".',
+            },
+            depth: {
+                type: 'number',
+                description: 'Directory aggregation depth. Controls how many path segments from the repo root ' +
+                    'are used to group files into directories (e.g., depth=2 maps src/server/tools/graph.ts ' +
+                    'to src/server). Default: 2.',
+                minimum: 1,
+                maximum: 10,
+            },
+            branch: {
+                type: 'string',
+                description: 'Optional branch name to filter file_imports by source file branch.',
+            },
+            limit: {
+                type: 'number',
+                description: 'Maximum number of results per analysis (default 20).',
+                minimum: 1,
+                maximum: 500,
+            },
+        },
+        required: [],
+    },
+};
+/**
+ * Truncate a file path to the given depth of directory segments.
+ * E.g., depth=2: "src/server/tools/graph.ts" → "src/server"
+ */
+function dirPrefix(filePath, depth) {
+    const segments = filePath.split('/');
+    // Take min(depth, segments.length - 1) to exclude the filename
+    const dirSegments = segments.slice(0, Math.min(depth, segments.length - 1));
+    return dirSegments.length > 0 ? dirSegments.join('/') : '.';
+}
+/**
+ * Build a directory-level graph by aggregating file_imports edges.
+ * Each file is mapped to its directory prefix at the given depth,
+ * and edges between distinct directories are deduplicated with counts.
+ */
+function buildDirGraph(db, depth, branch) {
+    const conditions = ['fi.resolved_id IS NOT NULL'];
+    const params = [];
+    if (branch !== undefined) {
+        conditions.push('f_src.branch = ?');
+        params.push(branch);
+    }
+    const whereClause = conditions.join(' AND ');
+    const rows = db.prepare(`SELECT f_src.path AS src_path, f_dst.path AS dst_path
+       FROM file_imports fi
+       JOIN files f_src ON f_src.id = fi.file_id
+       JOIN files f_dst ON f_dst.id = fi.resolved_id
+      WHERE ${whereClause}`).all(...params);
+    const directories = new Set();
+    const adjacency = new Map();
+    for (const { src_path, dst_path } of rows) {
+        const srcDir = dirPrefix(src_path, depth);
+        const dstDir = dirPrefix(dst_path, depth);
+        directories.add(srcDir);
+        directories.add(dstDir);
+        // Skip self-loops at the directory level
+        if (srcDir === dstDir)
+            continue;
+        let targets = adjacency.get(srcDir);
+        if (!targets) {
+            targets = new Map();
+            adjacency.set(srcDir, targets);
+        }
+        let edge = targets.get(dstDir);
+        if (!edge) {
+            edge = { from_dir: srcDir, to_dir: dstDir, count: 0, sample_files: [] };
+            targets.set(dstDir, edge);
+        }
+        edge.count++;
+        if (edge.sample_files.length < 3) {
+            const sample = `${src_path} → ${dst_path}`;
+            if (!edge.sample_files.includes(sample)) {
+                edge.sample_files.push(sample);
+            }
+        }
+    }
+    return { directories, adjacency };
+}
+// ─── Analysis A: Tarjan's SCC for directory-level cycles ──────────────────────
+function detectDirCycles(graph, limit) {
+    let index = 0;
+    const indices = new Map();
+    const lowlink = new Map();
+    const onStack = new Map();
+    const stack = [];
+    const sccs = [];
+    function strongConnect(v) {
+        indices.set(v, index);
+        lowlink.set(v, index);
+        index++;
+        stack.push(v);
+        onStack.set(v, true);
+        const targets = graph.adjacency.get(v);
+        if (targets) {
+            for (const w of targets.keys()) {
+                if (!indices.has(w)) {
+                    strongConnect(w);
+                    lowlink.set(v, Math.min(lowlink.get(v), lowlink.get(w)));
+                }
+                else if (onStack.get(w)) {
+                    lowlink.set(v, Math.min(lowlink.get(v), indices.get(w)));
+                }
+            }
+        }
+        if (lowlink.get(v) === indices.get(v)) {
+            const scc = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.set(w, false);
+                scc.push(w);
+            } while (w !== v);
+            if (scc.length > 1) {
+                sccs.push(scc);
+            }
+            else {
+                // Single-node SCC: only a cycle if there's a self-loop
+                const selfTargets = graph.adjacency.get(scc[0]);
+                if (selfTargets?.has(scc[0])) {
+                    sccs.push(scc);
+                }
+            }
+        }
+    }
+    for (const dir of graph.directories) {
+        if (!indices.has(dir)) {
+            strongConnect(dir);
+        }
+    }
+    // Convert SCCs to StructureCycle with edge counts
+    const cycles = sccs
+        .map((scc) => {
+        const sccSet = new Set(scc);
+        let edgeCount = 0;
+        for (const dir of scc) {
+            const targets = graph.adjacency.get(dir);
+            if (targets) {
+                for (const [target, edge] of targets) {
+                    if (sccSet.has(target)) {
+                        edgeCount += edge.count;
+                    }
+                }
+            }
+        }
+        return { directories: scc.sort(), edge_count: edgeCount };
+    })
+        .sort((a, b) => b.edge_count - a.edge_count)
+        .slice(0, limit);
+    return cycles;
+}
+// ─── Analysis B: DFS-based layering violations ───────────────────────────────
+function detectLayerViolations(graph, limit) {
+    // Assign layers using DFS finish time.  Nodes that finish earlier are more
+    // foundational (deeper in the dependency chain).  Back-edges — edges from a
+    // node to an ancestor still on the DFS stack — represent layering violations
+    // where a downstream directory imports an upstream one.
+    const visited = new Set();
+    const onStack = new Set();
+    const finishRank = new Map();
+    const violations = [];
+    let finishTimer = 0;
+    // Compute traditional in-degree (how many dirs import this one) so we can
+    // seed the DFS from source nodes (entry points imported by nobody).
+    const inDeg = new Map();
+    for (const dir of graph.directories)
+        inDeg.set(dir, 0);
+    for (const targets of graph.adjacency.values()) {
+        for (const dst of targets.keys()) {
+            inDeg.set(dst, (inDeg.get(dst) ?? 0) + 1);
+        }
+    }
+    // Sort so source nodes (low in-degree) are visited first for determinism.
+    const sorted = [...graph.directories].sort((a, b) => (inDeg.get(a) ?? 0) - (inDeg.get(b) ?? 0) || a.localeCompare(b));
+    function dfs(v) {
+        visited.add(v);
+        onStack.add(v);
+        const targets = graph.adjacency.get(v);
+        if (targets) {
+            for (const [w, edge] of targets) {
+                if (!visited.has(w)) {
+                    dfs(w);
+                }
+                else if (onStack.has(w)) {
+                    // Back-edge: v → w where w is an ancestor on the current path.
+                    violations.push({
+                        from_dir: v,
+                        to_dir: w,
+                        from_rank: -1, // patched after DFS completes
+                        to_rank: -1,
+                        edge_count: edge.count,
+                        sample_files: edge.sample_files,
+                    });
+                }
+            }
+        }
+        onStack.delete(v);
+        finishRank.set(v, finishTimer++);
+    }
+    for (const dir of sorted) {
+        if (!visited.has(dir)) {
+            dfs(dir);
+        }
+    }
+    // Patch ranks using finish times (lower = more foundational).
+    for (const v of violations) {
+        v.from_rank = finishRank.get(v.from_dir) ?? -1;
+        v.to_rank = finishRank.get(v.to_dir) ?? -1;
+    }
+    return violations
+        .sort((a, b) => b.edge_count - a.edge_count)
+        .slice(0, limit);
+}
+// ─── Analysis C: Outlier detection ────────────────────────────────────────────
+function detectOutliers(graph, limit) {
+    // Collect all directed edges with their counts
+    const allEdges = [];
+    for (const targets of graph.adjacency.values()) {
+        for (const edge of targets.values()) {
+            allEdges.push(edge);
+        }
+    }
+    if (allEdges.length === 0)
+        return [];
+    // Compute mean edge count
+    const totalCount = allEdges.reduce((sum, e) => sum + e.count, 0);
+    const mean = totalCount / allEdges.length;
+    // Compute standard deviation
+    const variance = allEdges.reduce((sum, e) => sum + (e.count - mean) ** 2, 0) / allEdges.length;
+    const stddev = Math.sqrt(variance);
+    // Outliers are edges with unusually low edge counts.
+    // Threshold: count < mean - 1*stddev, but at least count == 1 to be meaningful.
+    // If stddev is 0 (all edges same count), no outliers.
+    const threshold = stddev > 0 ? Math.max(1, mean - stddev) : 0;
+    if (threshold === 0)
+        return [];
+    const outliers = [];
+    for (const edge of allEdges) {
+        if (edge.count >= threshold)
+            continue;
+        // Look up reverse edge count
+        const reverseTargets = graph.adjacency.get(edge.to_dir);
+        const reverseEdge = reverseTargets?.get(edge.from_dir);
+        const reverseCount = reverseEdge?.count ?? 0;
+        outliers.push({
+            from_dir: edge.from_dir,
+            to_dir: edge.to_dir,
+            edge_count: edge.count,
+            reverse_edge_count: reverseCount,
+            sample_files: edge.sample_files,
+        });
+    }
+    return outliers
+        .sort((a, b) => a.edge_count - b.edge_count)
+        .slice(0, limit);
+}
+// ─── Handler ──────────────────────────────────────────────────────────────────
+/** Analyse directory-level structural anomalies in the codebase. */
+export function handler(db, args) {
+    const analysis = args.analysis ?? 'all';
+    const depth = Math.max(1, Math.min(args.depth ?? 2, 10));
+    const limit = Math.max(1, Math.min(args.limit ?? 20, 500));
+    const graph = buildDirGraph(db, depth, args.branch);
+    const result = {};
+    if (analysis === 'cycles' || analysis === 'all') {
+        result.cycles = detectDirCycles(graph, limit);
+    }
+    if (analysis === 'layers' || analysis === 'all') {
+        result.layer_violations = detectLayerViolations(graph, limit);
+    }
+    if (analysis === 'outliers' || analysis === 'all') {
+        result.outliers = detectOutliers(graph, limit);
+    }
+    return result;
+}
+//# sourceMappingURL=structure.js.map

package/dist/server/tools/structure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"structure.js","sourceRoot":"","sources":["../../../src/server/tools/structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,iFAAiF;AAEjF,MAAM,CAAC,MAAM,OAAO,GAAG;IACrB,IAAI,EAAE,gBAAgB;IACtB,WAAW,EACT,sEAAsE;QACtE,qEAAqE;QACrE,+CAA+C;QAC/C,gEAAgE;QAChE,iEAAiE;QACjE,wEAAwE;QACxE,kEAAkE;QAClE,0CAA0C;IAC5C,WAAW,EAAE;QACX,IAAI,EAAE,QAAiB;QACvB,UAAU,EAAE;YACV,QAAQ,EAAE;gBACR,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAU;gBACtD,WAAW,EACT,yEAAyE;oBACzE,oDAAoD;oBACpD,0DAA0D;oBAC1D,uCAAuC;aAC1C;YACD,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,kFAAkF;oBAClF,yFAAyF;oBACzF,6BAA6B;gBAC/B,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,EAAE;aACZ;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,oEAAoE;aAClF;YACD,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,sDAAsD;gBACnE,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,GAAG;aACb;SACF;QACD,QAAQ,EAAE,EAAuB;KAClC;CACO,CAAC;AAyDX;;;GAGG;AACH,SAAS,SAAS,CAAC,QAAgB,EAAE,KAAa;IAChD,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACrC,+DAA+D;IAC/D,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5E,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,EAAqB,EAAE,KAAa,EAAE,MAAe;IAC1E,MAAM,UAAU,GAAa,CAAC,4BAA4B,CAAC,CAAC;IAC5D,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAE7C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;;cAIU,WAAW,EAAE,CACxB,CAAC,GAAG,CAAC,GAAG,MAAM,CAAkD,CAAC;IAElE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgC,CAAC;IAE1D,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAE1C,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxB,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAExB,yCAAyC;QACzC,IAAI,MAAM,KAAK,MAAM;YAAE,SAAS;QAEhC,IAAI,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACpB,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;YACxE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,GAAG,QAAQ,MAAM,QAAQ,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;AACpC,CAAC;AAED,iFAAiF;AAEjF,SAAS,eAAe,CAAC,KAAe,EAAE,KAAa;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,aAAa,CAAC,CAAS;QAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAErB,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,aAAa,CAAC,CAAC,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC7D,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC7D,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,IAAI,CAAS,CAAC;YACd,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAElB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,uDAAuD;gBACvD,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;oBAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,aAAa,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,MAAM,GAAqB,IAAI;SAClC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACX,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;oBACrC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBACvB,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,WAAW,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IAC5D,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEnB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAEhF,SAAS,qBAAqB,CAAC,KAAe,EAAE,KAAa;IAC3D,2EAA2E;IAC3E,4EAA4E;IAC5E,6EAA6E;IAC7E,wDAAwD;IAExD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,0EAA0E;IAC1E,oEAAoE;IACpE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW;QAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/C,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAC1E,CAAC;IAEF,SAAS,GAAG,CAAC,CAAS;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;gBAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,GAAG,CAAC,CAAC,CAAC,CAAC;gBACT,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,+DAA+D;oBAC/D,UAAU,CAAC,IAAI,CAAC;wBACd,QAAQ,EAAE,CAAC;wBACX,MAAM,EAAE,CAAC;wBACT,SAAS,EAAE,CAAC,CAAC,EAAE,8BAA8B;wBAC7C,OAAO,EAAE,CAAC,CAAC;wBACX,UAAU,EAAE,IAAI,CAAC,KAAK;wBACtB,YAAY,EAAE,IAAI,CAAC,YAAY;qBAChC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,GAAG,CAAC,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,UAAU;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,iFAAiF;AAEjF,SAAS,cAAc,CAAC,KAAe,EAAE,KAAa;IACpD,+CAA+C;IAC/C,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,0BAA0B;IAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;IAE1C,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEnC,qDAAqD;IACrD,gFAAgF;IAChF,sDAAsD;IACtD,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE/B,MAAM,QAAQ,GAAkB,EAAE,CAAC;IAEnC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS;YAAE,SAAS;QAEtC,6BAA6B;QAC7B,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,WAAW,GAAG,cAAc,EAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,WAAW,EAAE,KAAK,IAAI,CAAC,CAAC;QAE7C,QAAQ,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,KAAK;YACtB,kBAAkB,EAAE,YAAY;YAChC,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ;SACZ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,iFAAiF;AAEjF,oEAAoE;AACpE,MAAM,UAAU,OAAO,CAAC,EAAqB,EAAE,IAAmB;IAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAE3D,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,MAAM,GAAoB,EAAE,CAAC;IAEnC,IAAI,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QAChD,MAAM,CAAC,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QAChD,MAAM,CAAC,gBAAgB,GAAG,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChE,CAAC;IAED,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QAClD,MAAM,CAAC,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/server/tools/test-map.d.ts

@@ -18,6 +18,10 @@ export declare const toolDef: {
                 readonly type: "string";
                 readonly description: "Optional branch to constrain mappings.";
             };
+            readonly line: {
+                readonly type: "number";
+                readonly description: "Optional source line number. When provided, returns per-test coverage mappings for that line.";
+            };
         };
         readonly required: readonly ["source_path"];
     };
@@ -25,6 +29,7 @@ export declare const toolDef: {
 export interface TestMapArgs {
     source_path: string;
     branch?: string;
+    line?: number;
 }
 export interface TestMapResult {
     source_path: string;
@@ -32,6 +37,8 @@ export interface TestMapResult {
     mappings: Array<{
         test_path: string;
         confidence: string;
+        line?: number;
+        test_name?: string | null;
     }>;
 }
 export declare function handler(db: Database.Database, args: TestMapArgs): TestMapResult;

package/dist/server/tools/test-map.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"test-map.d.ts","sourceRoot":"","sources":["../../../src/server/tools/test-map.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGtD,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;CAkBV,CAAC;AAEX,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,QAAQ,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC5D;AAED,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,WAAW,GAAG,aAAa,CAM/E"}
+{"version":3,"file":"test-map.d.ts","sourceRoot":"","sources":["../../../src/server/tools/test-map.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGtD,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;CAuBV,CAAC;AAEX,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,QAAQ,EAAE,KAAK,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;QACnB,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KAC3B,CAAC,CAAC;CACJ;AAED,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,WAAW,GAAG,aAAa,CAoB/E"}

package/dist/server/tools/test-map.js

@@ -3,7 +3,7 @@
  *
  * MCP tool: query mapped tests for a source file.
  */
-import { listTestMappingsBySourcePath } from '../../db/read-only.js';
+import { listTestMappingsBySourcePath, listTestsByLine } from '../../db/read-only.js';
 export const toolDef = {
     name: 'lore_test_map',
     description: 'Return mapped test files (with confidence values) for a given source file path.',
@@ -18,11 +18,28 @@ export const toolDef = {
                 type: 'string',
                 description: 'Optional branch to constrain mappings.',
             },
+            line: {
+                type: 'number',
+                description: 'Optional source line number. When provided, returns per-test coverage mappings for that line.',
+            },
         },
         required: ['source_path'],
     },
 };
 export function handler(db, args) {
+    if (args.line != null) {
+        const rows = listTestsByLine(db, args.source_path, args.line);
+        return {
+            source_path: args.source_path,
+            branch: args.branch ?? null,
+            mappings: rows.map((r) => ({
+                test_path: r.test_file,
+                confidence: 'per_test_coverage',
+                line: args.line,
+                test_name: r.test_name,
+            })),
+        };
+    }
     return {
         source_path: args.source_path,
         branch: args.branch ?? null,

package/dist/server/tools/test-map.js.map

@@ -1 +1 @@
-{"version":3,"file":"test-map.js","sourceRoot":"","sources":["../../../src/server/tools/test-map.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AAErE,MAAM,CAAC,MAAM,OAAO,GAAG;IACrB,IAAI,EAAE,eAAe;IACrB,WAAW,EACT,iFAAiF;IACnF,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,oDAAoD;aAClE;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,wCAAwC;aACtD;SACF;QACD,QAAQ,EAAE,CAAC,aAAa,CAAC;KAC1B;CACO,CAAC;AAaX,MAAM,UAAU,OAAO,CAAC,EAAqB,EAAE,IAAiB;IAC9D,OAAO;QACL,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;QAC3B,QAAQ,EAAE,4BAA4B,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC;KAC1E,CAAC;AACJ,CAAC"}
+{"version":3,"file":"test-map.js","sourceRoot":"","sources":["../../../src/server/tools/test-map.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,4BAA4B,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAEtF,MAAM,CAAC,MAAM,OAAO,GAAG;IACrB,IAAI,EAAE,eAAe;IACrB,WAAW,EACT,iFAAiF;IACnF,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,oDAAoD;aAClE;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,wCAAwC;aACtD;YACD,IAAI,EAAE;gBACJ,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,+FAA+F;aAClG;SACF;QACD,QAAQ,EAAE,CAAC,aAAa,CAAC;KAC1B;CACO,CAAC;AAmBX,MAAM,UAAU,OAAO,CAAC,EAAqB,EAAE,IAAiB;IAC9D,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,OAAO;YACL,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;YAC3B,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACzB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,UAAU,EAAE,mBAA4B;gBACxC,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,SAAS,EAAE,CAAC,CAAC,SAAS;aACvB,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED,OAAO;QACL,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;QAC3B,QAAQ,EAAE,4BAA4B,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC;KAC1E,CAAC;AACJ,CAAC"}

package/dist/server/tools/trace.d.ts

@@ -0,0 +1,84 @@
+/**
+ * @module lore-server/tools/trace
+ *
+ * MCP tool: trace an execution path from an entry point and return an ordered
+ * call sequence with source code inlined — a self-contained reasoning bundle
+ * for LLM agents.
+ *
+ * Entry modes:
+ *   1. Symbol ID:   `from=symbolId`
+ *   2. Symbol name: `from_name="handleCreateUser"`
+ *   3. Point-to-point: `from` + `to` (BFS shortest path)
+ */
+import type { Database } from '../../db/read-only.js';
+export declare const toolDef: {
+    readonly name: "lore_trace";
+    readonly description: string;
+    readonly inputSchema: {
+        readonly type: "object";
+        readonly properties: {
+            readonly from: {
+                readonly type: "number";
+                readonly description: "Symbol ID to start the trace from (forward trace).";
+            };
+            readonly from_name: {
+                readonly type: "string";
+                readonly description: "Symbol name to start the trace from (resolved via lore_lookup). Use when you don't have the ID.";
+            };
+            readonly to: {
+                readonly type: "number";
+                readonly description: "Optional target symbol ID. When provided, returns the shortest call path from `from` to `to` instead of a full forward trace.";
+            };
+            readonly to_name: {
+                readonly type: "string";
+                readonly description: "Optional target symbol name. Resolved via lore_lookup.";
+            };
+            readonly depth: {
+                readonly type: "number";
+                readonly description: "Max call depth to trace (default 5, max 10).";
+                readonly minimum: 1;
+                readonly maximum: 10;
+            };
+            readonly max_source_lines: {
+                readonly type: "number";
+                readonly description: "Max source lines per step (default 50). Larger functions are truncated with a comment indicating remaining lines.";
+            };
+            readonly branch: {
+                readonly type: "string";
+                readonly description: "Optional branch name to filter symbols.";
+            };
+        };
+    };
+};
+export interface TraceArgs {
+    from?: number;
+    from_name?: string;
+    to?: number;
+    to_name?: string;
+    depth?: number;
+    max_source_lines?: number;
+    branch?: string;
+}
+export interface TraceStep {
+    depth: number;
+    symbol_id: number;
+    name: string;
+    kind: string;
+    file_path: string;
+    start_line: number;
+    end_line: number;
+    signature?: string;
+    source: string;
+    call_line?: number;
+    resolution_method?: string;
+    cyclomatic?: number;
+    coverage_percent?: number;
+}
+export interface TraceResult {
+    entry: string;
+    steps: TraceStep[];
+    truncated: boolean;
+    total_nodes: number;
+}
+export declare function handler(db: Database.Database, args: TraceArgs): TraceResult;
+//# sourceMappingURL=trace.d.ts.map

package/dist/server/tools/trace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace.d.ts","sourceRoot":"","sources":["../../../src/server/tools/trace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAKtD,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4CV,CAAC;AAIX,MAAM,WAAW,SAAS;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAkUD,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,GAAG,WAAW,CAyC3E"}