sdlc-agent-4-enterprise-server 1.0.0

package/dist/engine/analyzers/similarity/DuplicateDetector.js

@@ -0,0 +1,163 @@
+/**
+ * KSA-168: Duplicate Detector — Find near-duplicate code using embedding similarity.
+ * Uses cosine similarity on body embeddings + Union-Find clustering.
+ */
+import { ClusterBuilder } from './ClusterBuilder.js';
+export class DuplicateDetector {
+    db;
+    minSimilarity;
+    minLines;
+    constructor(db, minSimilarity = 0.85, minLines = 5) {
+        this.db = db;
+        this.minSimilarity = minSimilarity;
+        this.minLines = minLines;
+    }
+    /** Find duplicate functions in the codebase. */
+    detect(options = {}) {
+        const t0 = performance.now();
+        // 1. Load body embeddings with symbol info
+        const embeddings = this.loadEmbeddings(options.filePath, options.module);
+        if (embeddings.length < 2) {
+            return { clusters: [], totalPairsScanned: 0, totalDuplicates: 0, scanDurationMs: 0 };
+        }
+        // 2. Compute pairwise similarities
+        const pairs = this.computeSimilarities(embeddings);
+        // 3. Build clusters using Union-Find
+        const clusters = this.buildClusters(pairs, embeddings);
+        const limit = options.limit ?? 20;
+        const topClusters = clusters.slice(0, limit);
+        const elapsed = performance.now() - t0;
+        return {
+            clusters: topClusters,
+            totalPairsScanned: (embeddings.length * (embeddings.length - 1)) / 2,
+            totalDuplicates: clusters.reduce((sum, c) => sum + c.members.length, 0),
+            scanDurationMs: Math.round(elapsed),
+        };
+    }
+    loadEmbeddings(filePath, module) {
+        let sql = `
+      SELECT be.symbol_id, be.chunk_index, be.embedding, be.token_count,
+             s.id, s.name, s.kind, s.start_line, s.end_line, f.relative_path as file_path
+      FROM body_embeddings be
+      JOIN symbols s ON s.id = be.symbol_id
+      JOIN files f ON f.id = s.file_id
+      WHERE be.chunk_index = 0
+        AND (s.end_line - s.start_line) >= ?
+    `;
+        const params = [this.minLines];
+        if (filePath) {
+            sql += ` AND f.relative_path LIKE ?`;
+            params.push(`%${filePath}%`);
+        }
+        if (module) {
+            sql += ` AND f.module = ?`;
+            params.push(module);
+        }
+        const rows = this.db.prepare(sql).all(...params);
+        return rows.map(row => ({
+            symbolId: row.symbol_id,
+            vector: deserializeVector(row.embedding),
+            info: {
+                id: row.symbol_id,
+                name: row.name,
+                kind: row.kind,
+                start_line: row.start_line,
+                end_line: row.end_line,
+                file_path: row.file_path,
+            },
+        }));
+    }
+    computeSimilarities(embeddings) {
+        const pairs = [];
+        for (let i = 0; i < embeddings.length; i++) {
+            for (let j = i + 1; j < embeddings.length; j++) {
+                const sim = cosineSimilarity(embeddings[i].vector, embeddings[j].vector);
+                if (sim >= this.minSimilarity) {
+                    pairs.push({
+                        symbolIdA: embeddings[i].symbolId,
+                        symbolIdB: embeddings[j].symbolId,
+                        nameA: embeddings[i].info.name,
+                        nameB: embeddings[j].info.name,
+                        filePathA: embeddings[i].info.file_path,
+                        filePathB: embeddings[j].info.file_path,
+                        similarity: sim,
+                    });
+                }
+            }
+        }
+        return pairs.sort((a, b) => b.similarity - a.similarity);
+    }
+    buildClusters(pairs, embeddings) {
+        const uf = new ClusterBuilder();
+        const infoMap = new Map(embeddings.map(e => [e.symbolId, e.info]));
+        const pairSims = new Map();
+        for (const pair of pairs) {
+            uf.union(pair.symbolIdA, pair.symbolIdB);
+            const key = [pair.symbolIdA, pair.symbolIdB].sort().join(':');
+            pairSims.set(key, pair.similarity);
+        }
+        const rawClusters = uf.getClusters();
+        const clusters = [];
+        for (const [root, memberIds] of rawClusters) {
+            const members = memberIds.map(id => {
+                const info = infoMap.get(id);
+                return {
+                    symbolId: id,
+                    name: info?.name ?? '<unknown>',
+                    filePath: info?.file_path ?? '',
+                    startLine: info?.start_line ?? 0,
+                    endLine: info?.end_line ?? 0,
+                    tokenCount: 0,
+                };
+            });
+            // Compute average similarity within cluster
+            let totalSim = 0;
+            let simCount = 0;
+            for (let i = 0; i < memberIds.length; i++) {
+                for (let j = i + 1; j < memberIds.length; j++) {
+                    const key = [memberIds[i], memberIds[j]].sort().join(':');
+                    const sim = pairSims.get(key);
+                    if (sim !== undefined) {
+                        totalSim += sim;
+                        simCount++;
+                    }
+                }
+            }
+            const avgSim = simCount > 0 ? totalSim / simCount : 0;
+            const suggestion = this.generateSuggestion(members);
+            clusters.push({
+                id: `cluster-${root}`,
+                members,
+                avgSimilarity: avgSim,
+                suggestion,
+            });
+        }
+        return clusters.sort((a, b) => b.avgSimilarity - a.avgSimilarity);
+    }
+    generateSuggestion(members) {
+        const files = new Set(members.map(m => m.filePath));
+        if (files.size === 1) {
+            return `Extract shared logic from ${members.length} similar functions in ${[...files][0]}`;
+        }
+        return `Consider extracting a shared utility from ${members.length} similar functions across ${files.size} files`;
+    }
+}
+/** Deserialize Float32Array from Buffer. */
+function deserializeVector(buf) {
+    const floats = new Float32Array(buf.buffer, buf.byteOffset, buf.byteLength / 4);
+    return Array.from(floats);
+}
+/** Cosine similarity between two vectors. */
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0, normA = 0, normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    return denom === 0 ? 0 : dot / denom;
+}
+//# sourceMappingURL=DuplicateDetector.js.map

package/dist/engine/analyzers/similarity/DuplicateDetector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DuplicateDetector.js","sourceRoot":"","sources":["../../../../src/engine/analyzers/similarity/DuplicateDetector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAmBrD,MAAM,OAAO,iBAAiB;IACpB,EAAE,CAAoB;IACtB,aAAa,CAAS;IACtB,QAAQ,CAAS;IAEzB,YAAY,EAAqB,EAAE,gBAAwB,IAAI,EAAE,WAAmB,CAAC;QACnF,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,gDAAgD;IAChD,MAAM,CAAC,UAAkE,EAAE;QACzE,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAE7B,2CAA2C;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACzE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;QACvF,CAAC;QAED,mCAAmC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAEnD,qCAAqC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAEvD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAE7C,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,OAAO;YACL,QAAQ,EAAE,WAAW;YACrB,iBAAiB,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YACpE,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YACvE,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;SACpC,CAAC;IACJ,CAAC;IAEO,cAAc,CAAC,QAAiB,EAAE,MAAe;QACvD,IAAI,GAAG,GAAG;;;;;;;;KAQT,CAAC;QACF,MAAM,MAAM,GAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE1C,IAAI,QAAQ,EAAE,CAAC;YACb,GAAG,IAAI,6BAA6B,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,GAAG,IAAI,mBAAmB,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoC,CAAC;QAEpF,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtB,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,MAAM,EAAE,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC;YACxC,IAAI,EAAE;gBACJ,EAAE,EAAE,GAAG,CAAC,SAAS;gBACjB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,SAAS,EAAE,GAAG,CAAC,SAAS;aACzB;SACF,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,mBAAmB,CACzB,UAA0E;QAE1E,MAAM,KAAK,GAAqB,EAAE,CAAC;QAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACzE,IAAI,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC;wBACT,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ;wBACjC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ;wBACjC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;wBAC9B,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;wBAC9B,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS;wBACvC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS;wBACvC,UAAU,EAAE,GAAG;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAC3D,CAAC;IAEO,aAAa,CACnB,KAAuB,EACvB,UAA0E;QAE1E,MAAM,EAAE,GAAG,IAAI,cAAc,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACzC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9D,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,WAAW,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QAExC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAoB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAClD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO;oBACL,QAAQ,EAAE,EAAE;oBACZ,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,WAAW;oBAC/B,QAAQ,EAAE,IAAI,EAAE,SAAS,IAAI,EAAE;oBAC/B,SAAS,EAAE,IAAI,EAAE,UAAU,IAAI,CAAC;oBAChC,OAAO,EAAE,IAAI,EAAE,QAAQ,IAAI,CAAC;oBAC5B,UAAU,EAAE,CAAC;iBACd,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,4CAA4C;YAC5C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,MAAM,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC1D,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC9B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;wBACtB,QAAQ,IAAI,GAAG,CAAC;wBAChB,QAAQ,EAAE,CAAC;oBACb,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAEpD,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,WAAW,IAAI,EAAE;gBACrB,OAAO;gBACP,aAAa,EAAE,MAAM;gBACrB,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IACpE,CAAC;IAEO,kBAAkB,CAAC,OAAwB;QACjD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,6BAA6B,OAAO,CAAC,MAAM,yBAAyB,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7F,CAAC;QACD,OAAO,6CAA6C,OAAO,CAAC,MAAM,6BAA6B,KAAK,CAAC,IAAI,QAAQ,CAAC;IACpH,CAAC;CACF;AAED,4CAA4C;AAC5C,SAAS,iBAAiB,CAAC,GAAW;IACpC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAChF,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,6CAA6C;AAC7C,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC"}

package/dist/engine/analyzers/similarity/GitMiner.d.ts

@@ -0,0 +1,27 @@
+/**
+ * KSA-168: Git Miner — Semantic search over git commit history.
+ * Parses git log, stores commit metadata, enables text-based search.
+ */
+import Database from 'better-sqlite3';
+import type { GitCommitResult, GitIndexSummary } from './types.js';
+export declare class GitMiner {
+    private db;
+    private repoPath;
+    private maxCommits;
+    constructor(db: Database.Database, repoPath: string, maxCommits?: number);
+    /** Index git commits (incremental by default). */
+    indexHistory(force?: boolean): GitIndexSummary;
+    /** Search commits by text query (FTS on message + files). */
+    search(query: string, options?: {
+        author?: string;
+        file?: string;
+        limit?: number;
+        since?: string;
+    }): GitCommitResult[];
+    /** Get indexing summary. */
+    getSummary(): GitIndexSummary;
+    private parseGitLog;
+    private parseLogOutput;
+    private getLastIndexedHash;
+    private ensureSchema;
+}

package/dist/engine/analyzers/similarity/GitMiner.js

@@ -0,0 +1,184 @@
+/**
+ * KSA-168: Git Miner — Semantic search over git commit history.
+ * Parses git log, stores commit metadata, enables text-based search.
+ */
+import { execSync } from 'child_process';
+export class GitMiner {
+    db;
+    repoPath;
+    maxCommits;
+    constructor(db, repoPath, maxCommits = 10000) {
+        this.db = db;
+        this.repoPath = repoPath;
+        this.maxCommits = maxCommits;
+        this.ensureSchema();
+    }
+    /** Index git commits (incremental by default). */
+    indexHistory(force = false) {
+        const lastHash = force ? null : this.getLastIndexedHash();
+        const commits = this.parseGitLog(lastHash);
+        if (commits.length === 0) {
+            return this.getSummary();
+        }
+        const insert = this.db.prepare(`
+      INSERT OR IGNORE INTO git_commits (hash, author, date, message, files_changed, insertions, deletions)
+      VALUES (?, ?, ?, ?, ?, ?, ?)
+    `);
+        const transaction = this.db.transaction((items) => {
+            for (const commit of items) {
+                insert.run(commit.hash, commit.author, commit.date, commit.message, JSON.stringify(commit.filesChanged), commit.insertions, commit.deletions);
+            }
+        });
+        transaction(commits);
+        // Update metadata
+        if (commits.length > 0) {
+            this.db.prepare(`INSERT OR REPLACE INTO git_index_meta (key, value) VALUES ('last_indexed_hash', ?)`).run(commits[0].hash);
+            this.db.prepare(`INSERT OR REPLACE INTO git_index_meta (key, value) VALUES ('last_indexed_at', datetime('now'))`).run();
+        }
+        return this.getSummary();
+    }
+    /** Search commits by text query (FTS on message + files). */
+    search(query, options = {}) {
+        const limit = options.limit ?? 10;
+        let sql = `SELECT hash, author, date, message, files_changed, insertions, deletions FROM git_commits WHERE 1=1`;
+        const params = [];
+        if (query) {
+            sql += ` AND (message LIKE ? OR files_changed LIKE ?)`;
+            params.push(`%${query}%`, `%${query}%`);
+        }
+        if (options.author) {
+            sql += ` AND author LIKE ?`;
+            params.push(`%${options.author}%`);
+        }
+        if (options.file) {
+            sql += ` AND files_changed LIKE ?`;
+            params.push(`%${options.file}%`);
+        }
+        if (options.since) {
+            sql += ` AND date >= ?`;
+            params.push(options.since);
+        }
+        sql += ` ORDER BY date DESC LIMIT ?`;
+        params.push(limit);
+        const rows = this.db.prepare(sql).all(...params);
+        return rows.map((row, idx) => ({
+            hash: row.hash,
+            author: row.author,
+            date: row.date,
+            message: row.message,
+            filesChanged: JSON.parse(row.files_changed),
+            insertions: row.insertions,
+            deletions: row.deletions,
+            score: 1.0 - (idx * 0.05), // Simple rank-based score
+        }));
+    }
+    /** Get indexing summary. */
+    getSummary() {
+        const countRow = this.db.prepare('SELECT COUNT(*) as count FROM git_commits').get();
+        const lastHashRow = this.db.prepare(`SELECT value FROM git_index_meta WHERE key = 'last_indexed_hash'`).get();
+        const lastTimeRow = this.db.prepare(`SELECT value FROM git_index_meta WHERE key = 'last_indexed_at'`).get();
+        return {
+            totalCommits: countRow.count,
+            indexed: countRow.count,
+            lastHash: lastHashRow?.value ?? null,
+            lastIndexedAt: lastTimeRow?.value ?? null,
+        };
+    }
+    parseGitLog(sinceHash) {
+        try {
+            let cmd = `git log --format="%H|%an|%aI|%s" --numstat`;
+            if (sinceHash) {
+                cmd += ` ${sinceHash}..HEAD`;
+            }
+            else {
+                cmd += ` -n ${this.maxCommits}`;
+            }
+            const output = execSync(cmd, {
+                cwd: this.repoPath,
+                encoding: 'utf-8',
+                maxBuffer: 50 * 1024 * 1024,
+                timeout: 30000,
+            });
+            return this.parseLogOutput(output);
+        }
+        catch (err) {
+            console.error('[git-miner] Failed to parse git log:', err);
+            return [];
+        }
+    }
+    parseLogOutput(output) {
+        const commits = [];
+        const lines = output.split('\n');
+        let current = null;
+        for (const line of lines) {
+            if (!line.trim()) {
+                if (current) {
+                    commits.push(current);
+                    current = null;
+                }
+                continue;
+            }
+            // Header line: hash|author|date|message
+            const headerMatch = line.match(/^([0-9a-f]{40})\|(.+?)\|(.+?)\|(.+)$/);
+            if (headerMatch) {
+                if (current)
+                    commits.push(current);
+                current = {
+                    hash: headerMatch[1],
+                    author: headerMatch[2],
+                    date: headerMatch[3],
+                    message: headerMatch[4],
+                    filesChanged: [],
+                    insertions: 0,
+                    deletions: 0,
+                };
+                continue;
+            }
+            // Numstat line: insertions\tdeletions\tfilename
+            if (current) {
+                const statMatch = line.match(/^(\d+|-)\t(\d+|-)\t(.+)$/);
+                if (statMatch) {
+                    const ins = statMatch[1] === '-' ? 0 : parseInt(statMatch[1], 10);
+                    const del = statMatch[2] === '-' ? 0 : parseInt(statMatch[2], 10);
+                    current.insertions += ins;
+                    current.deletions += del;
+                    current.filesChanged.push(statMatch[3]);
+                }
+            }
+        }
+        if (current)
+            commits.push(current);
+        return commits;
+    }
+    getLastIndexedHash() {
+        try {
+            const row = this.db.prepare(`SELECT value FROM git_index_meta WHERE key = 'last_indexed_hash'`).get();
+            return row?.value ?? null;
+        }
+        catch {
+            return null;
+        }
+    }
+    ensureSchema() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS git_commits (
+        hash TEXT PRIMARY KEY,
+        author TEXT NOT NULL,
+        date TEXT NOT NULL,
+        message TEXT NOT NULL,
+        files_changed TEXT NOT NULL DEFAULT '[]',
+        insertions INTEGER DEFAULT 0,
+        deletions INTEGER DEFAULT 0
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_git_date ON git_commits(date);
+      CREATE INDEX IF NOT EXISTS idx_git_author ON git_commits(author);
+
+      CREATE TABLE IF NOT EXISTS git_index_meta (
+        key TEXT PRIMARY KEY,
+        value TEXT NOT NULL
+      );
+    `);
+    }
+}
+//# sourceMappingURL=GitMiner.js.map

package/dist/engine/analyzers/similarity/GitMiner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GitMiner.js","sourceRoot":"","sources":["../../../../src/engine/analyzers/similarity/GitMiner.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAIzC,MAAM,OAAO,QAAQ;IACX,EAAE,CAAoB;IACtB,QAAQ,CAAS;IACjB,UAAU,CAAS;IAE3B,YAAY,EAAqB,EAAE,QAAgB,EAAE,aAAqB,KAAK;QAC7E,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,kDAAkD;IAClD,YAAY,CAAC,QAAiB,KAAK;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,KAAkB,EAAE,EAAE;YAC7D,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,CACR,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,OAAO,EACd,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,EACnC,MAAM,CAAC,UAAU,EACjB,MAAM,CAAC,SAAS,CACjB,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;QACH,WAAW,CAAC,OAAO,CAAC,CAAC;QAErB,kBAAkB;QAClB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CACb,oFAAoF,CACrF,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CACb,gGAAgG,CACjG,CAAC,GAAG,EAAE,CAAC;QACV,CAAC;QAED,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC3B,CAAC;IAED,6DAA6D;IAC7D,MAAM,CAAC,KAAa,EAAE,UAA8E,EAAE;QACpG,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;QAClC,IAAI,GAAG,GAAG,qGAAqG,CAAC;QAChH,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,KAAK,EAAE,CAAC;YACV,GAAG,IAAI,+CAA+C,CAAC;YACvD,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;QAC1C,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,GAAG,IAAI,oBAAoB,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;YACjB,GAAG,IAAI,2BAA2B,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,GAAG,IAAI,gBAAgB,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QAED,GAAG,IAAI,6BAA6B,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAG7C,CAAC;QAEH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YAC7B,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC;YAC3C,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,KAAK,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,0BAA0B;SACtD,CAAC,CAAC,CAAC;IACN,CAAC;IAED,4BAA4B;IAC5B,UAAU;QACR,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,EAAuB,CAAC;QACzG,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACjC,kEAAkE,CACnE,CAAC,GAAG,EAAmC,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACjC,gEAAgE,CACjE,CAAC,GAAG,EAAmC,CAAC;QAEzC,OAAO;YACL,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,QAAQ,EAAE,WAAW,EAAE,KAAK,IAAI,IAAI;YACpC,aAAa,EAAE,WAAW,EAAE,KAAK,IAAI,IAAI;SAC1C,CAAC;IACJ,CAAC;IAEO,WAAW,CAAC,SAAwB;QAC1C,IAAI,CAAC;YACH,IAAI,GAAG,GAAG,4CAA4C,CAAC;YACvD,IAAI,SAAS,EAAE,CAAC;gBACd,GAAG,IAAI,IAAI,SAAS,QAAQ,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,GAAG,IAAI,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,CAAC;YAED,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE;gBAC3B,GAAG,EAAE,IAAI,CAAC,QAAQ;gBAClB,QAAQ,EAAE,OAAO;gBACjB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;gBAC3B,OAAO,EAAE,KAAK;aACf,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,sCAAsC,EAAE,GAAG,CAAC,CAAC;YAC3D,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,cAAc,CAAC,MAAc;QACnC,MAAM,OAAO,GAAgB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,OAAO,GAAqB,IAAI,CAAC;QAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjB,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACtB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;gBACD,SAAS;YACX,CAAC;YAED,wCAAwC;YACxC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;YACvE,IAAI,WAAW,EAAE,CAAC;gBAChB,IAAI,OAAO;oBAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,OAAO,GAAG;oBACR,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;oBACpB,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;oBACtB,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;oBACpB,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;oBACvB,YAAY,EAAE,EAAE;oBAChB,UAAU,EAAE,CAAC;oBACb,SAAS,EAAE,CAAC;iBACb,CAAC;gBACF,SAAS;YACX,CAAC;YAED,gDAAgD;YAChD,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBACzD,IAAI,SAAS,EAAE,CAAC;oBACd,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAClE,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAClE,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;oBAC1B,OAAO,CAAC,SAAS,IAAI,GAAG,CAAC;oBACzB,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,OAAO;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,kBAAkB;QACxB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACzB,kEAAkE,CACnE,CAAC,GAAG,EAAmC,CAAC;YACzC,OAAO,GAAG,EAAE,KAAK,IAAI,IAAI,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,YAAY;QAClB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;KAkBZ,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/engine/analyzers/similarity/SimilarityTools.d.ts

@@ -0,0 +1,125 @@
+/**
+ * KSA-168: MCP Tool registrations for similarity & mining tools.
+ */
+import Database from 'better-sqlite3';
+export declare const SIMILARITY_TOOL_DEFINITIONS: ({
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            file_path: {
+                type: string;
+                description: string;
+            };
+            module: {
+                type: string;
+                description: string;
+            };
+            min_similarity: {
+                type: string;
+                description: string;
+            };
+            limit: {
+                type: string;
+                description: string;
+            };
+            min_confidence?: undefined;
+            query?: undefined;
+            author?: undefined;
+            file?: undefined;
+            since?: undefined;
+            force?: undefined;
+        };
+        required?: undefined;
+    };
+} | {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            file_path: {
+                type: string;
+                description: string;
+            };
+            module: {
+                type: string;
+                description: string;
+            };
+            min_confidence: {
+                type: string;
+                description: string;
+            };
+            limit: {
+                type: string;
+                description: string;
+            };
+            min_similarity?: undefined;
+            query?: undefined;
+            author?: undefined;
+            file?: undefined;
+            since?: undefined;
+            force?: undefined;
+        };
+        required?: undefined;
+    };
+} | {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            query: {
+                type: string;
+                description: string;
+            };
+            author: {
+                type: string;
+                description: string;
+            };
+            file: {
+                type: string;
+                description: string;
+            };
+            since: {
+                type: string;
+                description: string;
+            };
+            limit: {
+                type: string;
+                description: string;
+            };
+            file_path?: undefined;
+            module?: undefined;
+            min_similarity?: undefined;
+            min_confidence?: undefined;
+            force?: undefined;
+        };
+        required: string[];
+    };
+} | {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            force: {
+                type: string;
+                description: string;
+            };
+            file_path?: undefined;
+            module?: undefined;
+            min_similarity?: undefined;
+            limit?: undefined;
+            min_confidence?: undefined;
+            query?: undefined;
+            author?: undefined;
+            file?: undefined;
+            since?: undefined;
+        };
+        required?: undefined;
+    };
+})[];
+/** Dispatch a similarity/mining tool call. */
+export declare function handleSimilarityTool(name: string, args: Record<string, unknown>, db: Database.Database, workspacePath: string): string | null;

package/dist/engine/analyzers/similarity/SimilarityTools.js

@@ -0,0 +1,156 @@
+/**
+ * KSA-168: MCP Tool registrations for similarity & mining tools.
+ */
+import { DuplicateDetector } from './DuplicateDetector.js';
+import { DeadCodeDetector } from './DeadCodeDetector.js';
+import { GitMiner } from './GitMiner.js';
+export const SIMILARITY_TOOL_DEFINITIONS = [
+    {
+        name: 'find_duplicates',
+        description: 'Find near-duplicate functions using embedding similarity. Groups similar code into clusters with refactoring suggestions.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                file_path: { type: 'string', description: 'Filter by file path' },
+                module: { type: 'string', description: 'Filter by module name' },
+                min_similarity: { type: 'number', description: 'Minimum similarity threshold (default: 0.85)' },
+                limit: { type: 'number', description: 'Max clusters to return (default: 20)' },
+            },
+        },
+    },
+    {
+        name: 'find_dead_code',
+        description: 'Find potentially dead/unreachable code using call graph reachability analysis from entry points.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                file_path: { type: 'string', description: 'Filter by file path' },
+                module: { type: 'string', description: 'Filter by module name' },
+                min_confidence: { type: 'number', description: 'Minimum confidence threshold 0-100 (default: 60)' },
+                limit: { type: 'number', description: 'Max results (default: 50)' },
+            },
+        },
+    },
+    {
+        name: 'git_search',
+        description: 'Search git commit history by message, author, or file. Returns matching commits with metadata.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                query: { type: 'string', description: 'Search query (matches message and file names)' },
+                author: { type: 'string', description: 'Filter by author name' },
+                file: { type: 'string', description: 'Filter by file path' },
+                since: { type: 'string', description: 'Only commits after this date (ISO format)' },
+                limit: { type: 'number', description: 'Max results (default: 10)' },
+            },
+            required: ['query'],
+        },
+    },
+    {
+        name: 'git_index',
+        description: 'Index git commit history for searching. Incremental by default.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                force: { type: 'boolean', description: 'Force full re-index (default: false)' },
+            },
+        },
+    },
+];
+/** Dispatch a similarity/mining tool call. */
+export function handleSimilarityTool(name, args, db, workspacePath) {
+    switch (name) {
+        case 'find_duplicates':
+            return handleFindDuplicates(args, db);
+        case 'find_dead_code':
+            return handleFindDeadCode(args, db);
+        case 'git_search':
+            return handleGitSearch(args, db, workspacePath);
+        case 'git_index':
+            return handleGitIndex(args, db, workspacePath);
+        default:
+            return null;
+    }
+}
+function handleFindDuplicates(args, db) {
+    const minSimilarity = args.min_similarity ?? 0.85;
+    const detector = new DuplicateDetector(db, minSimilarity);
+    const report = detector.detect({
+        filePath: args.file_path,
+        module: args.module,
+        limit: args.limit,
+    });
+    if (report.clusters.length === 0) {
+        return `No duplicate code found (scanned ${report.totalPairsScanned} pairs in ${report.scanDurationMs}ms).`;
+    }
+    const lines = [
+        `Found ${report.clusters.length} duplicate clusters (${report.totalDuplicates} functions) in ${report.scanDurationMs}ms:\n`,
+    ];
+    for (const cluster of report.clusters) {
+        lines.push(`�� ${cluster.id} (avg similarity: ${(cluster.avgSimilarity * 100).toFixed(1)}%)`);
+        lines.push(`   💡 ${cluster.suggestion}`);
+        for (const member of cluster.members) {
+            lines.push(`   - ${member.name} — ${member.filePath}:${member.startLine}`);
+        }
+        lines.push('');
+    }
+    return lines.join('\n');
+}
+function handleFindDeadCode(args, db) {
+    const minConfidence = args.min_confidence ?? 60;
+    const detector = new DeadCodeDetector(db, minConfidence);
+    const report = detector.detect({
+        filePath: args.file_path,
+        module: args.module,
+        limit: args.limit,
+    });
+    if (report.candidates.length === 0) {
+        return `No dead code found (${report.totalFunctions} functions, ${report.reachableCount} reachable).`;
+    }
+    const lines = [
+        `Found ${report.candidates.length} potentially dead functions ` +
+            `(${report.unreachableCount}/${report.totalFunctions} unreachable, ${report.scanDurationMs}ms):\n`,
+    ];
+    for (const candidate of report.candidates) {
+        const conf = candidate.confidence >= 80 ? '🔴' : candidate.confidence >= 60 ? '🟡' : '⚪';
+        lines.push(`${conf} ${candidate.name} (${candidate.kind}) — confidence: ${candidate.confidence}%`);
+        lines.push(`   ${candidate.filePath}:${candidate.startLine}`);
+        lines.push(`   Reasons: ${candidate.reasons.join(', ')}`);
+    }
+    return lines.join('\n');
+}
+function handleGitSearch(args, db, workspacePath) {
+    const query = args.query;
+    if (!query)
+        return 'Parameter "query" is required.';
+    const miner = new GitMiner(db, workspacePath);
+    const results = miner.search(query, {
+        author: args.author,
+        file: args.file,
+        since: args.since,
+        limit: args.limit,
+    });
+    if (results.length === 0)
+        return `No commits found matching "${query}".`;
+    const lines = [`Found ${results.length} commits matching "${query}":\n`];
+    for (const commit of results) {
+        lines.push(`${commit.hash.slice(0, 8)} | ${commit.date.slice(0, 10)} | ${commit.author}`);
+        lines.push(`  ${commit.message}`);
+        lines.push(`  Files: ${commit.filesChanged.slice(0, 5).join(', ')}${commit.filesChanged.length > 5 ? ` (+${commit.filesChanged.length - 5} more)` : ''}`);
+        lines.push(`  +${commit.insertions} -${commit.deletions}`);
+        lines.push('');
+    }
+    return lines.join('\n');
+}
+function handleGitIndex(args, db, workspacePath) {
+    const force = args.force ?? false;
+    const miner = new GitMiner(db, workspacePath);
+    const summary = miner.indexHistory(force);
+    return [
+        `Git history indexed:`,
+        `  Total commits: ${summary.totalCommits}`,
+        `  Last hash: ${summary.lastHash?.slice(0, 8) ?? 'none'}`,
+        `  Last indexed: ${summary.lastIndexedAt ?? 'never'}`,
+    ].join('\n');
+}
+//# sourceMappingURL=SimilarityTools.js.map