@dreb/coding-agent 1.18.0 → 2.0.0

package/dist/core/search/metrics/bm25.js

@@ -1,32 +0,0 @@
-/**
- * BM25 metric — full-text search scoring via FTS5.
- */
-/**
- * Compute BM25 scores for a query using FTS5.
- * Returns a Map of chunkId → normalized score (0-1, higher = more relevant).
- */
-export function computeBm25Scores(db, query, limit) {
-    const scores = new Map();
-    try {
-        const results = db.ftsSearch(query, limit);
-        if (results.length === 0)
-            return scores;
-        // Find the maximum score for normalization
-        let maxScore = 0;
-        for (const r of results) {
-            if (r.score > maxScore)
-                maxScore = r.score;
-        }
-        // Normalize: top result → 1.0, others proportional
-        if (maxScore > 0) {
-            for (const r of results) {
-                scores.set(r.chunkId, r.score / maxScore);
-            }
-        }
-    }
-    catch {
-        // If FTS query fails, return empty map
-    }
-    return scores;
-}
-//# sourceMappingURL=bm25.js.map

package/dist/core/search/metrics/bm25.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bm25.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/bm25.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAkB,EAAE,KAAa,EAAE,KAAa,EAAuB;IACxG,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,IAAI,CAAC;QACJ,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAExC,2CAA2C;QAC3C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ;gBAAE,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC;QAC5C,CAAC;QAED,qDAAmD;QACnD,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YAClB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;YAC3C,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,uCAAuC;IACxC,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd","sourcesContent":["/**\n * BM25 metric — full-text search scoring via FTS5.\n */\n\nimport type { SearchDatabase } from \"../db.js\";\n\n/**\n * Compute BM25 scores for a query using FTS5.\n * Returns a Map of chunkId → normalized score (0-1, higher = more relevant).\n */\nexport function computeBm25Scores(db: SearchDatabase, query: string, limit: number): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tconst results = db.ftsSearch(query, limit);\n\t\tif (results.length === 0) return scores;\n\n\t\t// Find the maximum score for normalization\n\t\tlet maxScore = 0;\n\t\tfor (const r of results) {\n\t\t\tif (r.score > maxScore) maxScore = r.score;\n\t\t}\n\n\t\t// Normalize: top result → 1.0, others proportional\n\t\tif (maxScore > 0) {\n\t\t\tfor (const r of results) {\n\t\t\t\tscores.set(r.chunkId, r.score / maxScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If FTS query fails, return empty map\n\t}\n\n\treturn scores;\n}\n"]}

package/dist/core/search/metrics/git-recency.d.ts

@@ -1,14 +0,0 @@
-/**
- * Git recency metric — recently modified files score higher.
- *
- * Runs a single `git log` command to get last-modified timestamps for all
- * files, then applies linear decay scoring.
- */
-import type { StoredChunk } from "../types.js";
-/**
- * Compute git recency scores based on when files were last modified.
- * More recently modified files score higher.
- * Falls back gracefully if git is unavailable.
- */
-export declare function computeGitRecencyScores(projectRoot: string, chunks: StoredChunk[]): Promise<Map<number, number>>;
-//# sourceMappingURL=git-recency.d.ts.map

package/dist/core/search/metrics/git-recency.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"git-recency.d.ts","sourceRoot":"","sources":["../../../../src/core/search/metrics/git-recency.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAa/C;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC5C,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EAAE,GACnB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAyD9B","sourcesContent":["/**\n * Git recency metric — recently modified files score higher.\n *\n * Runs a single `git log` command to get last-modified timestamps for all\n * files, then applies linear decay scoring.\n */\n\nimport { execFile as execFileCb } from \"node:child_process\";\nimport { promisify } from \"node:util\";\nimport type { StoredChunk } from \"../types.js\";\n\nconst execFile = promisify(execFileCb);\n\n/** Timeout for the git command in milliseconds. */\nconst GIT_TIMEOUT_MS = 15000;\n\n/** Max buffer for git output (10 MB — sufficient for large repos). */\nconst GIT_MAX_BUFFER = 10 * 1024 * 1024;\n\n/** Default score for files where git info is unavailable. */\nconst NEUTRAL_SCORE = 0.5;\n\n/**\n * Compute git recency scores based on when files were last modified.\n * More recently modified files score higher.\n * Falls back gracefully if git is unavailable.\n */\nexport async function computeGitRecencyScores(\n\tprojectRoot: string,\n\tchunks: StoredChunk[],\n): Promise<Map<number, number>> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tif (chunks.length === 0) return scores;\n\n\t\t// Collect unique file paths\n\t\tconst uniquePaths = new Set<string>();\n\t\tfor (const chunk of chunks) {\n\t\t\tuniquePaths.add(chunk.filePath);\n\t\t}\n\n\t\t// Get last-modified timestamps in a single git call.\n\t\t// Output format: \"COMMIT <timestamp>\" lines followed by changed file names.\n\t\t// We take the first (most recent) timestamp seen for each file.\n\t\tconst fileTimestamps = await getFileTimestamps(projectRoot, uniquePaths);\n\n\t\t// If no timestamps found, assign neutral scores\n\t\tif (fileTimestamps.size === 0) {\n\t\t\tfor (const chunk of chunks) {\n\t\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t\t}\n\t\t\treturn scores;\n\t\t}\n\n\t\t// Find oldest and newest timestamps\n\t\tlet oldest = Infinity;\n\t\tlet newest = -Infinity;\n\t\tfor (const ts of fileTimestamps.values()) {\n\t\t\tif (ts < oldest) oldest = ts;\n\t\t\tif (ts > newest) newest = ts;\n\t\t}\n\n\t\tconst range = newest - oldest;\n\n\t\t// Assign scores to chunks\n\t\tfor (const chunk of chunks) {\n\t\t\tconst ts = fileTimestamps.get(chunk.filePath);\n\t\t\tif (ts === undefined) {\n\t\t\t\t// Not tracked by git → neutral score\n\t\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t\t} else if (range === 0) {\n\t\t\t\t// All files have the same timestamp\n\t\t\t\tscores.set(chunk.id, 1);\n\t\t\t} else {\n\t\t\t\t// Linear decay: newest → 1.0, oldest → 0.0\n\t\t\t\tscores.set(chunk.id, (ts - oldest) / range);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// Git unavailable entirely — assign neutral scores\n\t\tfor (const chunk of chunks) {\n\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t}\n\t}\n\n\treturn scores;\n}\n\n/**\n * Get last-modified timestamps for files using a single `git log` invocation.\n * Returns a Map of filePath → unix timestamp (seconds).\n */\nasync function getFileTimestamps(projectRoot: string, targetPaths: Set<string>): Promise<Map<string, number>> {\n\tconst fileTimestamps = new Map<string, number>();\n\n\ttry {\n\t\t// Single git call: list all commits with their timestamps and changed files.\n\t\t// --diff-filter=AMCR: only additions, modifications, copies, renames.\n\t\t// --name-only: list file names after each commit.\n\t\t// --format=\"COMMIT %at\": prefix each commit with its unix timestamp.\n\t\tconst { stdout: output } = await execFile(\n\t\t\t\"git\",\n\t\t\t[\"log\", \"--max-count=10000\", \"--format=COMMIT %at\", \"--name-only\", \"--diff-filter=AMCR\"],\n\t\t\t{\n\t\t\t\tcwd: projectRoot,\n\t\t\t\ttimeout: GIT_TIMEOUT_MS,\n\t\t\t\tencoding: \"utf-8\",\n\t\t\t\tmaxBuffer: GIT_MAX_BUFFER,\n\t\t\t},\n\t\t);\n\n\t\tlet currentTimestamp = 0;\n\t\tlet foundAll = false;\n\n\t\tfor (const line of output.split(\"\\n\")) {\n\t\t\tif (foundAll) break;\n\n\t\t\tif (line.startsWith(\"COMMIT \")) {\n\t\t\t\tcurrentTimestamp = Number.parseInt(line.slice(7), 10);\n\t\t\t\tif (Number.isNaN(currentTimestamp) || currentTimestamp <= 0) {\n\t\t\t\t\tcurrentTimestamp = 0;\n\t\t\t\t}\n\t\t\t} else if (line.trim() && currentTimestamp > 0) {\n\t\t\t\tconst filePath = line.trim();\n\t\t\t\t// Only record the first (most recent) timestamp per file\n\t\t\t\tif (targetPaths.has(filePath) && !fileTimestamps.has(filePath)) {\n\t\t\t\t\tfileTimestamps.set(filePath, currentTimestamp);\n\t\t\t\t\t// Early exit once we've found all target files\n\t\t\t\t\tif (fileTimestamps.size === targetPaths.size) {\n\t\t\t\t\t\tfoundAll = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// Git unavailable or failed — return empty map\n\t}\n\n\treturn fileTimestamps;\n}\n"]}

package/dist/core/search/metrics/git-recency.js

@@ -1,123 +0,0 @@
-/**
- * Git recency metric — recently modified files score higher.
- *
- * Runs a single `git log` command to get last-modified timestamps for all
- * files, then applies linear decay scoring.
- */
-import { execFile as execFileCb } from "node:child_process";
-import { promisify } from "node:util";
-const execFile = promisify(execFileCb);
-/** Timeout for the git command in milliseconds. */
-const GIT_TIMEOUT_MS = 15000;
-/** Max buffer for git output (10 MB — sufficient for large repos). */
-const GIT_MAX_BUFFER = 10 * 1024 * 1024;
-/** Default score for files where git info is unavailable. */
-const NEUTRAL_SCORE = 0.5;
-/**
- * Compute git recency scores based on when files were last modified.
- * More recently modified files score higher.
- * Falls back gracefully if git is unavailable.
- */
-export async function computeGitRecencyScores(projectRoot, chunks) {
-    const scores = new Map();
-    try {
-        if (chunks.length === 0)
-            return scores;
-        // Collect unique file paths
-        const uniquePaths = new Set();
-        for (const chunk of chunks) {
-            uniquePaths.add(chunk.filePath);
-        }
-        // Get last-modified timestamps in a single git call.
-        // Output format: "COMMIT <timestamp>" lines followed by changed file names.
-        // We take the first (most recent) timestamp seen for each file.
-        const fileTimestamps = await getFileTimestamps(projectRoot, uniquePaths);
-        // If no timestamps found, assign neutral scores
-        if (fileTimestamps.size === 0) {
-            for (const chunk of chunks) {
-                scores.set(chunk.id, NEUTRAL_SCORE);
-            }
-            return scores;
-        }
-        // Find oldest and newest timestamps
-        let oldest = Infinity;
-        let newest = -Infinity;
-        for (const ts of fileTimestamps.values()) {
-            if (ts < oldest)
-                oldest = ts;
-            if (ts > newest)
-                newest = ts;
-        }
-        const range = newest - oldest;
-        // Assign scores to chunks
-        for (const chunk of chunks) {
-            const ts = fileTimestamps.get(chunk.filePath);
-            if (ts === undefined) {
-                // Not tracked by git → neutral score
-                scores.set(chunk.id, NEUTRAL_SCORE);
-            }
-            else if (range === 0) {
-                // All files have the same timestamp
-                scores.set(chunk.id, 1);
-            }
-            else {
-                // Linear decay: newest → 1.0, oldest → 0.0
-                scores.set(chunk.id, (ts - oldest) / range);
-            }
-        }
-    }
-    catch {
-        // Git unavailable entirely — assign neutral scores
-        for (const chunk of chunks) {
-            scores.set(chunk.id, NEUTRAL_SCORE);
-        }
-    }
-    return scores;
-}
-/**
- * Get last-modified timestamps for files using a single `git log` invocation.
- * Returns a Map of filePath → unix timestamp (seconds).
- */
-async function getFileTimestamps(projectRoot, targetPaths) {
-    const fileTimestamps = new Map();
-    try {
-        // Single git call: list all commits with their timestamps and changed files.
-        // --diff-filter=AMCR: only additions, modifications, copies, renames.
-        // --name-only: list file names after each commit.
-        // --format="COMMIT %at": prefix each commit with its unix timestamp.
-        const { stdout: output } = await execFile("git", ["log", "--max-count=10000", "--format=COMMIT %at", "--name-only", "--diff-filter=AMCR"], {
-            cwd: projectRoot,
-            timeout: GIT_TIMEOUT_MS,
-            encoding: "utf-8",
-            maxBuffer: GIT_MAX_BUFFER,
-        });
-        let currentTimestamp = 0;
-        let foundAll = false;
-        for (const line of output.split("\n")) {
-            if (foundAll)
-                break;
-            if (line.startsWith("COMMIT ")) {
-                currentTimestamp = Number.parseInt(line.slice(7), 10);
-                if (Number.isNaN(currentTimestamp) || currentTimestamp <= 0) {
-                    currentTimestamp = 0;
-                }
-            }
-            else if (line.trim() && currentTimestamp > 0) {
-                const filePath = line.trim();
-                // Only record the first (most recent) timestamp per file
-                if (targetPaths.has(filePath) && !fileTimestamps.has(filePath)) {
-                    fileTimestamps.set(filePath, currentTimestamp);
-                    // Early exit once we've found all target files
-                    if (fileTimestamps.size === targetPaths.size) {
-                        foundAll = true;
-                    }
-                }
-            }
-        }
-    }
-    catch {
-        // Git unavailable or failed — return empty map
-    }
-    return fileTimestamps;
-}
-//# sourceMappingURL=git-recency.js.map

package/dist/core/search/metrics/git-recency.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"git-recency.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/git-recency.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,IAAI,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAGtC,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;AAEvC,mDAAmD;AACnD,MAAM,cAAc,GAAG,KAAK,CAAC;AAE7B,wEAAsE;AACtE,MAAM,cAAc,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAExC,6DAA6D;AAC7D,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC5C,WAAmB,EACnB,MAAqB,EACU;IAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,IAAI,CAAC;QACJ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEvC,4BAA4B;QAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;QAED,qDAAqD;QACrD,4EAA4E;QAC5E,gEAAgE;QAChE,MAAM,cAAc,GAAG,MAAM,iBAAiB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEzE,gDAAgD;QAChD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,MAAM,CAAC;QACf,CAAC;QAED,oCAAoC;QACpC,IAAI,MAAM,GAAG,QAAQ,CAAC;QACtB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;QACvB,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,EAAE,GAAG,MAAM;gBAAE,MAAM,GAAG,EAAE,CAAC;YAC7B,IAAI,EAAE,GAAG,MAAM;gBAAE,MAAM,GAAG,EAAE,CAAC;QAC9B,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;QAE9B,0BAA0B;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC9C,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACtB,uCAAqC;gBACrC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YACrC,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBACxB,oCAAoC;gBACpC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACP,+CAA2C;gBAC3C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC;YAC7C,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,qDAAmD;QACnD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd;AAED;;;GAGG;AACH,KAAK,UAAU,iBAAiB,CAAC,WAAmB,EAAE,WAAwB,EAAgC;IAC7G,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,IAAI,CAAC;QACJ,6EAA6E;QAC7E,sEAAsE;QACtE,kDAAkD;QAClD,qEAAqE;QACrE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,QAAQ,CACxC,KAAK,EACL,CAAC,KAAK,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,aAAa,EAAE,oBAAoB,CAAC,EACxF;YACC,GAAG,EAAE,WAAW;YAChB,OAAO,EAAE,cAAc;YACvB,QAAQ,EAAE,OAAO;YACjB,SAAS,EAAE,cAAc;SACzB,CACD,CAAC;QAEF,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,IAAI,QAAQ;gBAAE,MAAM;YAEpB,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;gBAChC,gBAAgB,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtD,IAAI,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,IAAI,CAAC,EAAE,CAAC;oBAC7D,gBAAgB,GAAG,CAAC,CAAC;gBACtB,CAAC;YACF,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;gBAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7B,yDAAyD;gBACzD,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAChE,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;oBAC/C,+CAA+C;oBAC/C,IAAI,cAAc,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,EAAE,CAAC;wBAC9C,QAAQ,GAAG,IAAI,CAAC;oBACjB,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,iDAA+C;IAChD,CAAC;IAED,OAAO,cAAc,CAAC;AAAA,CACtB","sourcesContent":["/**\n * Git recency metric — recently modified files score higher.\n *\n * Runs a single `git log` command to get last-modified timestamps for all\n * files, then applies linear decay scoring.\n */\n\nimport { execFile as execFileCb } from \"node:child_process\";\nimport { promisify } from \"node:util\";\nimport type { StoredChunk } from \"../types.js\";\n\nconst execFile = promisify(execFileCb);\n\n/** Timeout for the git command in milliseconds. */\nconst GIT_TIMEOUT_MS = 15000;\n\n/** Max buffer for git output (10 MB — sufficient for large repos). */\nconst GIT_MAX_BUFFER = 10 * 1024 * 1024;\n\n/** Default score for files where git info is unavailable. */\nconst NEUTRAL_SCORE = 0.5;\n\n/**\n * Compute git recency scores based on when files were last modified.\n * More recently modified files score higher.\n * Falls back gracefully if git is unavailable.\n */\nexport async function computeGitRecencyScores(\n\tprojectRoot: string,\n\tchunks: StoredChunk[],\n): Promise<Map<number, number>> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tif (chunks.length === 0) return scores;\n\n\t\t// Collect unique file paths\n\t\tconst uniquePaths = new Set<string>();\n\t\tfor (const chunk of chunks) {\n\t\t\tuniquePaths.add(chunk.filePath);\n\t\t}\n\n\t\t// Get last-modified timestamps in a single git call.\n\t\t// Output format: \"COMMIT <timestamp>\" lines followed by changed file names.\n\t\t// We take the first (most recent) timestamp seen for each file.\n\t\tconst fileTimestamps = await getFileTimestamps(projectRoot, uniquePaths);\n\n\t\t// If no timestamps found, assign neutral scores\n\t\tif (fileTimestamps.size === 0) {\n\t\t\tfor (const chunk of chunks) {\n\t\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t\t}\n\t\t\treturn scores;\n\t\t}\n\n\t\t// Find oldest and newest timestamps\n\t\tlet oldest = Infinity;\n\t\tlet newest = -Infinity;\n\t\tfor (const ts of fileTimestamps.values()) {\n\t\t\tif (ts < oldest) oldest = ts;\n\t\t\tif (ts > newest) newest = ts;\n\t\t}\n\n\t\tconst range = newest - oldest;\n\n\t\t// Assign scores to chunks\n\t\tfor (const chunk of chunks) {\n\t\t\tconst ts = fileTimestamps.get(chunk.filePath);\n\t\t\tif (ts === undefined) {\n\t\t\t\t// Not tracked by git → neutral score\n\t\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t\t} else if (range === 0) {\n\t\t\t\t// All files have the same timestamp\n\t\t\t\tscores.set(chunk.id, 1);\n\t\t\t} else {\n\t\t\t\t// Linear decay: newest → 1.0, oldest → 0.0\n\t\t\t\tscores.set(chunk.id, (ts - oldest) / range);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// Git unavailable entirely — assign neutral scores\n\t\tfor (const chunk of chunks) {\n\t\t\tscores.set(chunk.id, NEUTRAL_SCORE);\n\t\t}\n\t}\n\n\treturn scores;\n}\n\n/**\n * Get last-modified timestamps for files using a single `git log` invocation.\n * Returns a Map of filePath → unix timestamp (seconds).\n */\nasync function getFileTimestamps(projectRoot: string, targetPaths: Set<string>): Promise<Map<string, number>> {\n\tconst fileTimestamps = new Map<string, number>();\n\n\ttry {\n\t\t// Single git call: list all commits with their timestamps and changed files.\n\t\t// --diff-filter=AMCR: only additions, modifications, copies, renames.\n\t\t// --name-only: list file names after each commit.\n\t\t// --format=\"COMMIT %at\": prefix each commit with its unix timestamp.\n\t\tconst { stdout: output } = await execFile(\n\t\t\t\"git\",\n\t\t\t[\"log\", \"--max-count=10000\", \"--format=COMMIT %at\", \"--name-only\", \"--diff-filter=AMCR\"],\n\t\t\t{\n\t\t\t\tcwd: projectRoot,\n\t\t\t\ttimeout: GIT_TIMEOUT_MS,\n\t\t\t\tencoding: \"utf-8\",\n\t\t\t\tmaxBuffer: GIT_MAX_BUFFER,\n\t\t\t},\n\t\t);\n\n\t\tlet currentTimestamp = 0;\n\t\tlet foundAll = false;\n\n\t\tfor (const line of output.split(\"\\n\")) {\n\t\t\tif (foundAll) break;\n\n\t\t\tif (line.startsWith(\"COMMIT \")) {\n\t\t\t\tcurrentTimestamp = Number.parseInt(line.slice(7), 10);\n\t\t\t\tif (Number.isNaN(currentTimestamp) || currentTimestamp <= 0) {\n\t\t\t\t\tcurrentTimestamp = 0;\n\t\t\t\t}\n\t\t\t} else if (line.trim() && currentTimestamp > 0) {\n\t\t\t\tconst filePath = line.trim();\n\t\t\t\t// Only record the first (most recent) timestamp per file\n\t\t\t\tif (targetPaths.has(filePath) && !fileTimestamps.has(filePath)) {\n\t\t\t\t\tfileTimestamps.set(filePath, currentTimestamp);\n\t\t\t\t\t// Early exit once we've found all target files\n\t\t\t\t\tif (fileTimestamps.size === targetPaths.size) {\n\t\t\t\t\t\tfoundAll = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// Git unavailable or failed — return empty map\n\t}\n\n\treturn fileTimestamps;\n}\n"]}

package/dist/core/search/metrics/import-graph.d.ts

@@ -1,15 +0,0 @@
-/**
- * Import graph proximity metric.
- *
- * Files that import or are imported by high-scoring files get a boost.
- * Uses a simple 1-hop propagation from seed scores.
- */
-import type { SearchDatabase } from "../db.js";
-/**
- * Compute import graph proximity scores.
- * Files that import/are imported by high-scoring files get a boost.
- * Seed files also get a connectivity bonus based on how many of their
- * neighbors are in the seed set.
- */
-export declare function computeImportGraphScores(db: SearchDatabase, seedScores: Map<number, number>, fileIdToChunkIds: Map<number, number[]>): Map<number, number>;
-//# sourceMappingURL=import-graph.d.ts.map

package/dist/core/search/metrics/import-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"import-graph.d.ts","sourceRoot":"","sources":["../../../../src/core/search/metrics/import-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAQ/C;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACvC,EAAE,EAAE,cAAc,EAClB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC/B,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACrC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAqGrB","sourcesContent":["/**\n * Import graph proximity metric.\n *\n * Files that import or are imported by high-scoring files get a boost.\n * Uses a simple 1-hop propagation from seed scores.\n */\n\nimport type { SearchDatabase } from \"../db.js\";\n\n/** Fraction of seed score propagated to neighbors. */\nconst PROPAGATION_FACTOR = 0.5;\n\n/** Fraction of propagated score given back to seed files with many connections. */\nconst SELF_BOOST_FACTOR = 0.25;\n\n/**\n * Compute import graph proximity scores.\n * Files that import/are imported by high-scoring files get a boost.\n * Seed files also get a connectivity bonus based on how many of their\n * neighbors are in the seed set.\n */\nexport function computeImportGraphScores(\n\tdb: SearchDatabase,\n\tseedScores: Map<number, number>,\n\tfileIdToChunkIds: Map<number, number[]>,\n): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tif (seedScores.size === 0) return scores;\n\n\t\t// Build fileId → filePath lookup and extension-stripped path index\n\t\tconst allFiles = db.getAllFiles();\n\t\tconst fileIdToPath = new Map<number, string>();\n\t\tconst pathToFileId = new Map<string, number>();\n\t\tconst strippedToFileId = new Map<string, number>();\n\n\t\tfor (const f of allFiles) {\n\t\t\tfileIdToPath.set(f.id, f.filePath);\n\t\t\tpathToFileId.set(f.filePath, f.id);\n\t\t\t// Also index without extension so import paths (which strip .js/.ts)\n\t\t\t// can match stored file paths (which keep the extension)\n\t\t\tconst stripped = stripExtension(f.filePath);\n\t\t\tif (!strippedToFileId.has(stripped)) {\n\t\t\t\tstrippedToFileId.set(stripped, f.id);\n\t\t\t}\n\t\t}\n\n\t\t/** Resolve an import target path to a fileId. Tries exact match first, then extension-stripped. */\n\t\tfunction resolveTarget(targetPath: string): number | undefined {\n\t\t\treturn pathToFileId.get(targetPath) ?? strippedToFileId.get(targetPath);\n\t\t}\n\n\t\t// Propagate scores to neighbors\n\t\tconst propagated = new Map<number, number>(); // fileId → accumulated propagated score\n\n\t\tfor (const [fileId, seedScore] of seedScores) {\n\t\t\tconst propagatedScore = seedScore * PROPAGATION_FACTOR;\n\t\t\tif (propagatedScore <= 0) continue;\n\n\t\t\tlet connectedSeedCount = 0;\n\n\t\t\t// Files this file imports\n\t\t\tconst importedPaths = db.getImportsFrom(fileId);\n\t\t\tfor (const targetPath of importedPaths) {\n\t\t\t\tconst targetFileId = resolveTarget(targetPath);\n\t\t\t\tif (targetFileId === undefined) continue;\n\n\t\t\t\tif (seedScores.has(targetFileId)) {\n\t\t\t\t\tconnectedSeedCount++;\n\t\t\t\t} else {\n\t\t\t\t\tpropagated.set(targetFileId, (propagated.get(targetFileId) ?? 0) + propagatedScore);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Files that import this file\n\t\t\tconst filePath = fileIdToPath.get(fileId);\n\t\t\tif (filePath) {\n\t\t\t\tconst importerIds = db.getImportersOf(filePath);\n\t\t\t\t// Also check extension-stripped variant\n\t\t\t\tconst stripped = stripExtension(filePath);\n\t\t\t\tconst strippedImporterIds = stripped !== filePath ? db.getImportersOf(stripped) : [];\n\t\t\t\tconst allImporterIds = new Set([...importerIds, ...strippedImporterIds]);\n\n\t\t\t\tfor (const importerFileId of allImporterIds) {\n\t\t\t\t\tif (seedScores.has(importerFileId)) {\n\t\t\t\t\t\tconnectedSeedCount++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpropagated.set(importerFileId, (propagated.get(importerFileId) ?? 0) + propagatedScore);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Self-boost: seed files with many connections to other seeds get a bonus\n\t\t\tif (connectedSeedCount > 0) {\n\t\t\t\tconst selfBoost = seedScore * SELF_BOOST_FACTOR * Math.min(connectedSeedCount / 3, 1);\n\t\t\t\tpropagated.set(fileId, (propagated.get(fileId) ?? 0) + selfBoost);\n\t\t\t}\n\t\t}\n\n\t\tif (propagated.size === 0) return scores;\n\n\t\t// Find max for normalization\n\t\tlet maxScore = 0;\n\t\tfor (const score of propagated.values()) {\n\t\t\tif (score > maxScore) maxScore = score;\n\t\t}\n\n\t\tif (maxScore <= 0) return scores;\n\n\t\t// Distribute to chunks and normalize\n\t\tfor (const [fileId, fileScore] of propagated) {\n\t\t\tconst chunkIds = fileIdToChunkIds.get(fileId);\n\t\t\tif (!chunkIds || chunkIds.length === 0) continue;\n\n\t\t\t// Distribute equally among chunks in this file\n\t\t\tconst perChunkScore = fileScore / maxScore / chunkIds.length;\n\t\t\tfor (const chunkId of chunkIds) {\n\t\t\t\tscores.set(chunkId, perChunkScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n\n/** Strip common source file extensions for path matching. */\nfunction stripExtension(filePath: string): string {\n\treturn filePath.replace(/\\.[jt]sx?$|\\.py$|\\.go$|\\.rs$|\\.java$|\\.c$|\\.h$|\\.cpp$|\\.hpp$|\\.cc$|\\.cxx$/, \"\");\n}\n"]}

package/dist/core/search/metrics/import-graph.js

@@ -1,115 +0,0 @@
-/**
- * Import graph proximity metric.
- *
- * Files that import or are imported by high-scoring files get a boost.
- * Uses a simple 1-hop propagation from seed scores.
- */
-/** Fraction of seed score propagated to neighbors. */
-const PROPAGATION_FACTOR = 0.5;
-/** Fraction of propagated score given back to seed files with many connections. */
-const SELF_BOOST_FACTOR = 0.25;
-/**
- * Compute import graph proximity scores.
- * Files that import/are imported by high-scoring files get a boost.
- * Seed files also get a connectivity bonus based on how many of their
- * neighbors are in the seed set.
- */
-export function computeImportGraphScores(db, seedScores, fileIdToChunkIds) {
-    const scores = new Map();
-    try {
-        if (seedScores.size === 0)
-            return scores;
-        // Build fileId → filePath lookup and extension-stripped path index
-        const allFiles = db.getAllFiles();
-        const fileIdToPath = new Map();
-        const pathToFileId = new Map();
-        const strippedToFileId = new Map();
-        for (const f of allFiles) {
-            fileIdToPath.set(f.id, f.filePath);
-            pathToFileId.set(f.filePath, f.id);
-            // Also index without extension so import paths (which strip .js/.ts)
-            // can match stored file paths (which keep the extension)
-            const stripped = stripExtension(f.filePath);
-            if (!strippedToFileId.has(stripped)) {
-                strippedToFileId.set(stripped, f.id);
-            }
-        }
-        /** Resolve an import target path to a fileId. Tries exact match first, then extension-stripped. */
-        function resolveTarget(targetPath) {
-            return pathToFileId.get(targetPath) ?? strippedToFileId.get(targetPath);
-        }
-        // Propagate scores to neighbors
-        const propagated = new Map(); // fileId → accumulated propagated score
-        for (const [fileId, seedScore] of seedScores) {
-            const propagatedScore = seedScore * PROPAGATION_FACTOR;
-            if (propagatedScore <= 0)
-                continue;
-            let connectedSeedCount = 0;
-            // Files this file imports
-            const importedPaths = db.getImportsFrom(fileId);
-            for (const targetPath of importedPaths) {
-                const targetFileId = resolveTarget(targetPath);
-                if (targetFileId === undefined)
-                    continue;
-                if (seedScores.has(targetFileId)) {
-                    connectedSeedCount++;
-                }
-                else {
-                    propagated.set(targetFileId, (propagated.get(targetFileId) ?? 0) + propagatedScore);
-                }
-            }
-            // Files that import this file
-            const filePath = fileIdToPath.get(fileId);
-            if (filePath) {
-                const importerIds = db.getImportersOf(filePath);
-                // Also check extension-stripped variant
-                const stripped = stripExtension(filePath);
-                const strippedImporterIds = stripped !== filePath ? db.getImportersOf(stripped) : [];
-                const allImporterIds = new Set([...importerIds, ...strippedImporterIds]);
-                for (const importerFileId of allImporterIds) {
-                    if (seedScores.has(importerFileId)) {
-                        connectedSeedCount++;
-                    }
-                    else {
-                        propagated.set(importerFileId, (propagated.get(importerFileId) ?? 0) + propagatedScore);
-                    }
-                }
-            }
-            // Self-boost: seed files with many connections to other seeds get a bonus
-            if (connectedSeedCount > 0) {
-                const selfBoost = seedScore * SELF_BOOST_FACTOR * Math.min(connectedSeedCount / 3, 1);
-                propagated.set(fileId, (propagated.get(fileId) ?? 0) + selfBoost);
-            }
-        }
-        if (propagated.size === 0)
-            return scores;
-        // Find max for normalization
-        let maxScore = 0;
-        for (const score of propagated.values()) {
-            if (score > maxScore)
-                maxScore = score;
-        }
-        if (maxScore <= 0)
-            return scores;
-        // Distribute to chunks and normalize
-        for (const [fileId, fileScore] of propagated) {
-            const chunkIds = fileIdToChunkIds.get(fileId);
-            if (!chunkIds || chunkIds.length === 0)
-                continue;
-            // Distribute equally among chunks in this file
-            const perChunkScore = fileScore / maxScore / chunkIds.length;
-            for (const chunkId of chunkIds) {
-                scores.set(chunkId, perChunkScore);
-            }
-        }
-    }
-    catch {
-        // If anything fails, return empty map
-    }
-    return scores;
-}
-/** Strip common source file extensions for path matching. */
-function stripExtension(filePath) {
-    return filePath.replace(/\.[jt]sx?$|\.py$|\.go$|\.rs$|\.java$|\.c$|\.h$|\.cpp$|\.hpp$|\.cc$|\.cxx$/, "");
-}
-//# sourceMappingURL=import-graph.js.map

package/dist/core/search/metrics/import-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"import-graph.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/import-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,sDAAsD;AACtD,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,mFAAmF;AACnF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAE/B;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CACvC,EAAkB,EAClB,UAA+B,EAC/B,gBAAuC,EACjB;IACtB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,IAAI,CAAC;QACJ,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEzC,qEAAmE;QACnE,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC1B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YACnC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACnC,qEAAqE;YACrE,yDAAyD;YACzD,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACrC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACtC,CAAC;QACF,CAAC;QAED,mGAAmG;QACnG,SAAS,aAAa,CAAC,UAAkB,EAAsB;YAC9D,OAAO,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAAA,CACxE;QAED,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,0CAAwC;QAEtF,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;YAC9C,MAAM,eAAe,GAAG,SAAS,GAAG,kBAAkB,CAAC;YACvD,IAAI,eAAe,IAAI,CAAC;gBAAE,SAAS;YAEnC,IAAI,kBAAkB,GAAG,CAAC,CAAC;YAE3B,0BAA0B;YAC1B,MAAM,aAAa,GAAG,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAChD,KAAK,MAAM,UAAU,IAAI,aAAa,EAAE,CAAC;gBACxC,MAAM,YAAY,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;gBAC/C,IAAI,YAAY,KAAK,SAAS;oBAAE,SAAS;gBAEzC,IAAI,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAClC,kBAAkB,EAAE,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACP,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC;gBACrF,CAAC;YACF,CAAC;YAED,8BAA8B;YAC9B,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACd,MAAM,WAAW,GAAG,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;gBAChD,wCAAwC;gBACxC,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;gBAC1C,MAAM,mBAAmB,GAAG,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,mBAAmB,CAAC,CAAC,CAAC;gBAEzE,KAAK,MAAM,cAAc,IAAI,cAAc,EAAE,CAAC;oBAC7C,IAAI,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;wBACpC,kBAAkB,EAAE,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACP,UAAU,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC;oBACzF,CAAC;gBACF,CAAC;YACF,CAAC;YAED,0EAA0E;YAC1E,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,SAAS,GAAG,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtF,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;YACnE,CAAC;QACF,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEzC,6BAA6B;QAC7B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,GAAG,QAAQ;gBAAE,QAAQ,GAAG,KAAK,CAAC;QACxC,CAAC;QAED,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,MAAM,CAAC;QAEjC,qCAAqC;QACrC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;YAC9C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEjD,+CAA+C;YAC/C,MAAM,aAAa,GAAG,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC7D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAChC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YACpC,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,sCAAsC;IACvC,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd;AAED,6DAA6D;AAC7D,SAAS,cAAc,CAAC,QAAgB,EAAU;IACjD,OAAO,QAAQ,CAAC,OAAO,CAAC,2EAA2E,EAAE,EAAE,CAAC,CAAC;AAAA,CACzG","sourcesContent":["/**\n * Import graph proximity metric.\n *\n * Files that import or are imported by high-scoring files get a boost.\n * Uses a simple 1-hop propagation from seed scores.\n */\n\nimport type { SearchDatabase } from \"../db.js\";\n\n/** Fraction of seed score propagated to neighbors. */\nconst PROPAGATION_FACTOR = 0.5;\n\n/** Fraction of propagated score given back to seed files with many connections. */\nconst SELF_BOOST_FACTOR = 0.25;\n\n/**\n * Compute import graph proximity scores.\n * Files that import/are imported by high-scoring files get a boost.\n * Seed files also get a connectivity bonus based on how many of their\n * neighbors are in the seed set.\n */\nexport function computeImportGraphScores(\n\tdb: SearchDatabase,\n\tseedScores: Map<number, number>,\n\tfileIdToChunkIds: Map<number, number[]>,\n): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tif (seedScores.size === 0) return scores;\n\n\t\t// Build fileId → filePath lookup and extension-stripped path index\n\t\tconst allFiles = db.getAllFiles();\n\t\tconst fileIdToPath = new Map<number, string>();\n\t\tconst pathToFileId = new Map<string, number>();\n\t\tconst strippedToFileId = new Map<string, number>();\n\n\t\tfor (const f of allFiles) {\n\t\t\tfileIdToPath.set(f.id, f.filePath);\n\t\t\tpathToFileId.set(f.filePath, f.id);\n\t\t\t// Also index without extension so import paths (which strip .js/.ts)\n\t\t\t// can match stored file paths (which keep the extension)\n\t\t\tconst stripped = stripExtension(f.filePath);\n\t\t\tif (!strippedToFileId.has(stripped)) {\n\t\t\t\tstrippedToFileId.set(stripped, f.id);\n\t\t\t}\n\t\t}\n\n\t\t/** Resolve an import target path to a fileId. Tries exact match first, then extension-stripped. */\n\t\tfunction resolveTarget(targetPath: string): number | undefined {\n\t\t\treturn pathToFileId.get(targetPath) ?? strippedToFileId.get(targetPath);\n\t\t}\n\n\t\t// Propagate scores to neighbors\n\t\tconst propagated = new Map<number, number>(); // fileId → accumulated propagated score\n\n\t\tfor (const [fileId, seedScore] of seedScores) {\n\t\t\tconst propagatedScore = seedScore * PROPAGATION_FACTOR;\n\t\t\tif (propagatedScore <= 0) continue;\n\n\t\t\tlet connectedSeedCount = 0;\n\n\t\t\t// Files this file imports\n\t\t\tconst importedPaths = db.getImportsFrom(fileId);\n\t\t\tfor (const targetPath of importedPaths) {\n\t\t\t\tconst targetFileId = resolveTarget(targetPath);\n\t\t\t\tif (targetFileId === undefined) continue;\n\n\t\t\t\tif (seedScores.has(targetFileId)) {\n\t\t\t\t\tconnectedSeedCount++;\n\t\t\t\t} else {\n\t\t\t\t\tpropagated.set(targetFileId, (propagated.get(targetFileId) ?? 0) + propagatedScore);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Files that import this file\n\t\t\tconst filePath = fileIdToPath.get(fileId);\n\t\t\tif (filePath) {\n\t\t\t\tconst importerIds = db.getImportersOf(filePath);\n\t\t\t\t// Also check extension-stripped variant\n\t\t\t\tconst stripped = stripExtension(filePath);\n\t\t\t\tconst strippedImporterIds = stripped !== filePath ? db.getImportersOf(stripped) : [];\n\t\t\t\tconst allImporterIds = new Set([...importerIds, ...strippedImporterIds]);\n\n\t\t\t\tfor (const importerFileId of allImporterIds) {\n\t\t\t\t\tif (seedScores.has(importerFileId)) {\n\t\t\t\t\t\tconnectedSeedCount++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpropagated.set(importerFileId, (propagated.get(importerFileId) ?? 0) + propagatedScore);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Self-boost: seed files with many connections to other seeds get a bonus\n\t\t\tif (connectedSeedCount > 0) {\n\t\t\t\tconst selfBoost = seedScore * SELF_BOOST_FACTOR * Math.min(connectedSeedCount / 3, 1);\n\t\t\t\tpropagated.set(fileId, (propagated.get(fileId) ?? 0) + selfBoost);\n\t\t\t}\n\t\t}\n\n\t\tif (propagated.size === 0) return scores;\n\n\t\t// Find max for normalization\n\t\tlet maxScore = 0;\n\t\tfor (const score of propagated.values()) {\n\t\t\tif (score > maxScore) maxScore = score;\n\t\t}\n\n\t\tif (maxScore <= 0) return scores;\n\n\t\t// Distribute to chunks and normalize\n\t\tfor (const [fileId, fileScore] of propagated) {\n\t\t\tconst chunkIds = fileIdToChunkIds.get(fileId);\n\t\t\tif (!chunkIds || chunkIds.length === 0) continue;\n\n\t\t\t// Distribute equally among chunks in this file\n\t\t\tconst perChunkScore = fileScore / maxScore / chunkIds.length;\n\t\t\tfor (const chunkId of chunkIds) {\n\t\t\t\tscores.set(chunkId, perChunkScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n\n/** Strip common source file extensions for path matching. */\nfunction stripExtension(filePath: string): string {\n\treturn filePath.replace(/\\.[jt]sx?$|\\.py$|\\.go$|\\.rs$|\\.java$|\\.c$|\\.h$|\\.cpp$|\\.hpp$|\\.cc$|\\.cxx$/, \"\");\n}\n"]}

package/dist/core/search/metrics/path-match.d.ts

@@ -1,13 +0,0 @@
-/**
- * Path/filename similarity metric.
- *
- * Tokenizes query and file paths, computes a recall-oriented overlap score
- * (what fraction of query tokens appear in the path).
- */
-import type { StoredChunk } from "../types.js";
-/**
- * Compute path/filename similarity scores.
- * Tokenizes query and file paths, returns Jaccard-like overlap score.
- */
-export declare function computePathMatchScores(query: string, chunks: StoredChunk[]): Map<number, number>;
-//# sourceMappingURL=path-match.d.ts.map

package/dist/core/search/metrics/path-match.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"path-match.d.ts","sourceRoot":"","sources":["../../../../src/core/search/metrics/path-match.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG/C;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA+ChG","sourcesContent":["/**\n * Path/filename similarity metric.\n *\n * Tokenizes query and file paths, computes a recall-oriented overlap score\n * (what fraction of query tokens appear in the path).\n */\n\nimport type { StoredChunk } from \"../types.js\";\nimport { tokenize } from \"./tokenize.js\";\n\n/**\n * Compute path/filename similarity scores.\n * Tokenizes query and file paths, returns Jaccard-like overlap score.\n */\nexport function computePathMatchScores(query: string, chunks: StoredChunk[]): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tconst queryTokens = tokenize(query);\n\t\tif (queryTokens.length === 0) return scores;\n\n\t\tconst querySet = new Set(queryTokens);\n\n\t\t// Cache path tokens per file path (many chunks share the same file)\n\t\tconst pathTokenCache = new Map<string, Set<string>>();\n\n\t\tlet maxScore = 0;\n\n\t\tfor (const chunk of chunks) {\n\t\t\tlet pathTokenSet = pathTokenCache.get(chunk.filePath);\n\t\t\tif (!pathTokenSet) {\n\t\t\t\tpathTokenSet = new Set(tokenize(chunk.filePath));\n\t\t\t\tpathTokenCache.set(chunk.filePath, pathTokenSet);\n\t\t\t}\n\n\t\t\t// Score = |intersection| / |query tokens| (recall-oriented)\n\t\t\tlet intersection = 0;\n\t\t\tfor (const qt of querySet) {\n\t\t\t\tif (pathTokenSet.has(qt)) {\n\t\t\t\t\tintersection++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst score = intersection / queryTokens.length;\n\t\t\tif (score > 0) {\n\t\t\t\tscores.set(chunk.id, score);\n\t\t\t\tif (score > maxScore) maxScore = score;\n\t\t\t}\n\t\t}\n\n\t\t// Normalize to 0-1 (divide by max if not already bounded)\n\t\tif (maxScore > 0 && maxScore !== 1) {\n\t\t\tfor (const [id, score] of scores) {\n\t\t\t\tscores.set(id, score / maxScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n"]}

package/dist/core/search/metrics/path-match.js

@@ -1,54 +0,0 @@
-/**
- * Path/filename similarity metric.
- *
- * Tokenizes query and file paths, computes a recall-oriented overlap score
- * (what fraction of query tokens appear in the path).
- */
-import { tokenize } from "./tokenize.js";
-/**
- * Compute path/filename similarity scores.
- * Tokenizes query and file paths, returns Jaccard-like overlap score.
- */
-export function computePathMatchScores(query, chunks) {
-    const scores = new Map();
-    try {
-        const queryTokens = tokenize(query);
-        if (queryTokens.length === 0)
-            return scores;
-        const querySet = new Set(queryTokens);
-        // Cache path tokens per file path (many chunks share the same file)
-        const pathTokenCache = new Map();
-        let maxScore = 0;
-        for (const chunk of chunks) {
-            let pathTokenSet = pathTokenCache.get(chunk.filePath);
-            if (!pathTokenSet) {
-                pathTokenSet = new Set(tokenize(chunk.filePath));
-                pathTokenCache.set(chunk.filePath, pathTokenSet);
-            }
-            // Score = |intersection| / |query tokens| (recall-oriented)
-            let intersection = 0;
-            for (const qt of querySet) {
-                if (pathTokenSet.has(qt)) {
-                    intersection++;
-                }
-            }
-            const score = intersection / queryTokens.length;
-            if (score > 0) {
-                scores.set(chunk.id, score);
-                if (score > maxScore)
-                    maxScore = score;
-            }
-        }
-        // Normalize to 0-1 (divide by max if not already bounded)
-        if (maxScore > 0 && maxScore !== 1) {
-            for (const [id, score] of scores) {
-                scores.set(id, score / maxScore);
-            }
-        }
-    }
-    catch {
-        // If anything fails, return empty map
-    }
-    return scores;
-}
-//# sourceMappingURL=path-match.js.map

package/dist/core/search/metrics/path-match.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"path-match.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/path-match.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa,EAAE,MAAqB,EAAuB;IACjG,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,IAAI,CAAC;QACJ,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE5C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;QAEtC,oEAAoE;QACpE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEtD,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,IAAI,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,CAAC,YAAY,EAAE,CAAC;gBACnB,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACjD,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAClD,CAAC;YAED,4DAA4D;YAC5D,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,YAAY,EAAE,CAAC;gBAChB,CAAC;YACF,CAAC;YAED,MAAM,KAAK,GAAG,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;YAChD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC5B,IAAI,KAAK,GAAG,QAAQ;oBAAE,QAAQ,GAAG,KAAK,CAAC;YACxC,CAAC;QACF,CAAC;QAED,0DAA0D;QAC1D,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC;YAClC,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,sCAAsC;IACvC,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd","sourcesContent":["/**\n * Path/filename similarity metric.\n *\n * Tokenizes query and file paths, computes a recall-oriented overlap score\n * (what fraction of query tokens appear in the path).\n */\n\nimport type { StoredChunk } from \"../types.js\";\nimport { tokenize } from \"./tokenize.js\";\n\n/**\n * Compute path/filename similarity scores.\n * Tokenizes query and file paths, returns Jaccard-like overlap score.\n */\nexport function computePathMatchScores(query: string, chunks: StoredChunk[]): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tconst queryTokens = tokenize(query);\n\t\tif (queryTokens.length === 0) return scores;\n\n\t\tconst querySet = new Set(queryTokens);\n\n\t\t// Cache path tokens per file path (many chunks share the same file)\n\t\tconst pathTokenCache = new Map<string, Set<string>>();\n\n\t\tlet maxScore = 0;\n\n\t\tfor (const chunk of chunks) {\n\t\t\tlet pathTokenSet = pathTokenCache.get(chunk.filePath);\n\t\t\tif (!pathTokenSet) {\n\t\t\t\tpathTokenSet = new Set(tokenize(chunk.filePath));\n\t\t\t\tpathTokenCache.set(chunk.filePath, pathTokenSet);\n\t\t\t}\n\n\t\t\t// Score = |intersection| / |query tokens| (recall-oriented)\n\t\t\tlet intersection = 0;\n\t\t\tfor (const qt of querySet) {\n\t\t\t\tif (pathTokenSet.has(qt)) {\n\t\t\t\t\tintersection++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst score = intersection / queryTokens.length;\n\t\t\tif (score > 0) {\n\t\t\t\tscores.set(chunk.id, score);\n\t\t\t\tif (score > maxScore) maxScore = score;\n\t\t\t}\n\t\t}\n\n\t\t// Normalize to 0-1 (divide by max if not already bounded)\n\t\tif (maxScore > 0 && maxScore !== 1) {\n\t\t\tfor (const [id, score] of scores) {\n\t\t\t\tscores.set(id, score / maxScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n"]}

package/dist/core/search/metrics/symbol-match.d.ts

@@ -1,12 +0,0 @@
-/**
- * Symbol name match metric.
- *
- * Compares query terms against symbol names (function/class/etc names)
- * using tokenized overlap with bonuses for exact substring matches.
- */
-/**
- * Compute symbol name match scores.
- * Compares query terms against symbol names (function/class/etc names).
- */
-export declare function computeSymbolMatchScores(query: string, symbols: Map<number, string[]>): Map<number, number>;
-//# sourceMappingURL=symbol-match.d.ts.map

package/dist/core/search/metrics/symbol-match.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"symbol-match.d.ts","sourceRoot":"","sources":["../../../../src/core/search/metrics/symbol-match.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;GAGG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAyD3G","sourcesContent":["/**\n * Symbol name match metric.\n *\n * Compares query terms against symbol names (function/class/etc names)\n * using tokenized overlap with bonuses for exact substring matches.\n */\n\nimport { tokenize } from \"./tokenize.js\";\n\n/**\n * Compute symbol name match scores.\n * Compares query terms against symbol names (function/class/etc names).\n */\nexport function computeSymbolMatchScores(query: string, symbols: Map<number, string[]>): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tconst queryTokens = tokenize(query);\n\t\tif (queryTokens.length === 0) return scores;\n\n\t\tconst queryLower = query.toLowerCase();\n\n\t\tlet maxScore = 0;\n\n\t\tfor (const [chunkId, symbolNames] of symbols) {\n\t\t\tlet bestScore = 0;\n\n\t\t\tfor (const symbolName of symbolNames) {\n\t\t\t\tconst symbolTokens = new Set(tokenize(symbolName));\n\t\t\t\tconst symbolLower = symbolName.toLowerCase();\n\n\t\t\t\t// Token overlap: fraction of query tokens found in symbol\n\t\t\t\tlet matchCount = 0;\n\t\t\t\tfor (const qt of queryTokens) {\n\t\t\t\t\tif (symbolTokens.has(qt)) {\n\t\t\t\t\t\tmatchCount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tlet score = matchCount / queryTokens.length;\n\n\t\t\t\t// Bonus for exact substring match of query in symbol name\n\t\t\t\tif (symbolLower.includes(queryLower)) {\n\t\t\t\t\tscore = Math.min(1, score + 0.3);\n\t\t\t\t}\n\t\t\t\t// Bonus for exact substring match of symbol in query\n\t\t\t\telse if (queryLower.includes(symbolLower) && symbolLower.length >= 3) {\n\t\t\t\t\tscore = Math.min(1, score + 0.2);\n\t\t\t\t}\n\n\t\t\t\tif (score > bestScore) bestScore = score;\n\t\t\t}\n\n\t\t\tif (bestScore > 0) {\n\t\t\t\tscores.set(chunkId, bestScore);\n\t\t\t\tif (bestScore > maxScore) maxScore = bestScore;\n\t\t\t}\n\t\t}\n\n\t\t// Normalize to 0-1\n\t\tif (maxScore > 0 && maxScore !== 1) {\n\t\t\tfor (const [id, score] of scores) {\n\t\t\t\tscores.set(id, score / maxScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n"]}

package/dist/core/search/metrics/symbol-match.js

@@ -1,62 +0,0 @@
-/**
- * Symbol name match metric.
- *
- * Compares query terms against symbol names (function/class/etc names)
- * using tokenized overlap with bonuses for exact substring matches.
- */
-import { tokenize } from "./tokenize.js";
-/**
- * Compute symbol name match scores.
- * Compares query terms against symbol names (function/class/etc names).
- */
-export function computeSymbolMatchScores(query, symbols) {
-    const scores = new Map();
-    try {
-        const queryTokens = tokenize(query);
-        if (queryTokens.length === 0)
-            return scores;
-        const queryLower = query.toLowerCase();
-        let maxScore = 0;
-        for (const [chunkId, symbolNames] of symbols) {
-            let bestScore = 0;
-            for (const symbolName of symbolNames) {
-                const symbolTokens = new Set(tokenize(symbolName));
-                const symbolLower = symbolName.toLowerCase();
-                // Token overlap: fraction of query tokens found in symbol
-                let matchCount = 0;
-                for (const qt of queryTokens) {
-                    if (symbolTokens.has(qt)) {
-                        matchCount++;
-                    }
-                }
-                let score = matchCount / queryTokens.length;
-                // Bonus for exact substring match of query in symbol name
-                if (symbolLower.includes(queryLower)) {
-                    score = Math.min(1, score + 0.3);
-                }
-                // Bonus for exact substring match of symbol in query
-                else if (queryLower.includes(symbolLower) && symbolLower.length >= 3) {
-                    score = Math.min(1, score + 0.2);
-                }
-                if (score > bestScore)
-                    bestScore = score;
-            }
-            if (bestScore > 0) {
-                scores.set(chunkId, bestScore);
-                if (bestScore > maxScore)
-                    maxScore = bestScore;
-            }
-        }
-        // Normalize to 0-1
-        if (maxScore > 0 && maxScore !== 1) {
-            for (const [id, score] of scores) {
-                scores.set(id, score / maxScore);
-            }
-        }
-    }
-    catch {
-        // If anything fails, return empty map
-    }
-    return scores;
-}
-//# sourceMappingURL=symbol-match.js.map

package/dist/core/search/metrics/symbol-match.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"symbol-match.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/symbol-match.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAa,EAAE,OAA8B,EAAuB;IAC5G,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,IAAI,CAAC;QACJ,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE5C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,IAAI,OAAO,EAAE,CAAC;YAC9C,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACtC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;gBACnD,MAAM,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;gBAE7C,0DAA0D;gBAC1D,IAAI,UAAU,GAAG,CAAC,CAAC;gBACnB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;oBAC9B,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC1B,UAAU,EAAE,CAAC;oBACd,CAAC;gBACF,CAAC;gBAED,IAAI,KAAK,GAAG,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC;gBAE5C,0DAA0D;gBAC1D,IAAI,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;oBACtC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;gBAClC,CAAC;gBACD,qDAAqD;qBAChD,IAAI,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACtE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;gBAClC,CAAC;gBAED,IAAI,KAAK,GAAG,SAAS;oBAAE,SAAS,GAAG,KAAK,CAAC;YAC1C,CAAC;YAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;gBAC/B,IAAI,SAAS,GAAG,QAAQ;oBAAE,QAAQ,GAAG,SAAS,CAAC;YAChD,CAAC;QACF,CAAC;QAED,mBAAmB;QACnB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC;YAClC,CAAC;QACF,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,sCAAsC;IACvC,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd","sourcesContent":["/**\n * Symbol name match metric.\n *\n * Compares query terms against symbol names (function/class/etc names)\n * using tokenized overlap with bonuses for exact substring matches.\n */\n\nimport { tokenize } from \"./tokenize.js\";\n\n/**\n * Compute symbol name match scores.\n * Compares query terms against symbol names (function/class/etc names).\n */\nexport function computeSymbolMatchScores(query: string, symbols: Map<number, string[]>): Map<number, number> {\n\tconst scores = new Map<number, number>();\n\n\ttry {\n\t\tconst queryTokens = tokenize(query);\n\t\tif (queryTokens.length === 0) return scores;\n\n\t\tconst queryLower = query.toLowerCase();\n\n\t\tlet maxScore = 0;\n\n\t\tfor (const [chunkId, symbolNames] of symbols) {\n\t\t\tlet bestScore = 0;\n\n\t\t\tfor (const symbolName of symbolNames) {\n\t\t\t\tconst symbolTokens = new Set(tokenize(symbolName));\n\t\t\t\tconst symbolLower = symbolName.toLowerCase();\n\n\t\t\t\t// Token overlap: fraction of query tokens found in symbol\n\t\t\t\tlet matchCount = 0;\n\t\t\t\tfor (const qt of queryTokens) {\n\t\t\t\t\tif (symbolTokens.has(qt)) {\n\t\t\t\t\t\tmatchCount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tlet score = matchCount / queryTokens.length;\n\n\t\t\t\t// Bonus for exact substring match of query in symbol name\n\t\t\t\tif (symbolLower.includes(queryLower)) {\n\t\t\t\t\tscore = Math.min(1, score + 0.3);\n\t\t\t\t}\n\t\t\t\t// Bonus for exact substring match of symbol in query\n\t\t\t\telse if (queryLower.includes(symbolLower) && symbolLower.length >= 3) {\n\t\t\t\t\tscore = Math.min(1, score + 0.2);\n\t\t\t\t}\n\n\t\t\t\tif (score > bestScore) bestScore = score;\n\t\t\t}\n\n\t\t\tif (bestScore > 0) {\n\t\t\t\tscores.set(chunkId, bestScore);\n\t\t\t\tif (bestScore > maxScore) maxScore = bestScore;\n\t\t\t}\n\t\t}\n\n\t\t// Normalize to 0-1\n\t\tif (maxScore > 0 && maxScore !== 1) {\n\t\t\tfor (const [id, score] of scores) {\n\t\t\t\tscores.set(id, score / maxScore);\n\t\t\t}\n\t\t}\n\t} catch {\n\t\t// If anything fails, return empty map\n\t}\n\n\treturn scores;\n}\n"]}

package/dist/core/search/metrics/tokenize.d.ts

@@ -1,12 +0,0 @@
-/**
- * Shared tokenizer for path-match and symbol-match metrics.
- *
- * Splits text on common code boundaries (spaces, path separators, dots,
- * dashes, underscores, camelCase) and normalizes to lowercase.
- */
-/**
- * Tokenize text by splitting on spaces, `/`, `\`, `.`, `-`, `_`, and
- * camelCase boundaries. Returns unique, lowercase tokens ≥ 2 chars.
- */
-export declare function tokenize(text: string): string[];
-//# sourceMappingURL=tokenize.d.ts.map

package/dist/core/search/metrics/tokenize.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tokenize.d.ts","sourceRoot":"","sources":["../../../../src/core/search/metrics/tokenize.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAoB/C","sourcesContent":["/**\n * Shared tokenizer for path-match and symbol-match metrics.\n *\n * Splits text on common code boundaries (spaces, path separators, dots,\n * dashes, underscores, camelCase) and normalizes to lowercase.\n */\n\n/**\n * Tokenize text by splitting on spaces, `/`, `\\`, `.`, `-`, `_`, and\n * camelCase boundaries. Returns unique, lowercase tokens ≥ 2 chars.\n */\nexport function tokenize(text: string): string[] {\n\t// Insert a space before uppercase letters that follow lowercase letters (camelCase)\n\t// or before uppercase letters followed by lowercase (e.g., \"XMLParser\" → \"XML Parser\")\n\tconst spaced = text.replace(/([a-z])([A-Z])/g, \"$1 $2\").replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\");\n\n\t// Split on common delimiters\n\tconst parts = spaced.split(/[\\s/\\\\.\\-_]+/);\n\n\t// Lowercase, deduplicate, filter short tokens\n\tconst seen = new Set<string>();\n\tconst tokens: string[] = [];\n\tfor (const part of parts) {\n\t\tconst lower = part.toLowerCase();\n\t\tif (lower.length >= 2 && !seen.has(lower)) {\n\t\t\tseen.add(lower);\n\t\t\ttokens.push(lower);\n\t\t}\n\t}\n\n\treturn tokens;\n}\n"]}

package/dist/core/search/metrics/tokenize.js

@@ -1,29 +0,0 @@
-/**
- * Shared tokenizer for path-match and symbol-match metrics.
- *
- * Splits text on common code boundaries (spaces, path separators, dots,
- * dashes, underscores, camelCase) and normalizes to lowercase.
- */
-/**
- * Tokenize text by splitting on spaces, `/`, `\`, `.`, `-`, `_`, and
- * camelCase boundaries. Returns unique, lowercase tokens ≥ 2 chars.
- */
-export function tokenize(text) {
-    // Insert a space before uppercase letters that follow lowercase letters (camelCase)
-    // or before uppercase letters followed by lowercase (e.g., "XMLParser" → "XML Parser")
-    const spaced = text.replace(/([a-z])([A-Z])/g, "$1 $2").replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2");
-    // Split on common delimiters
-    const parts = spaced.split(/[\s/\\.\-_]+/);
-    // Lowercase, deduplicate, filter short tokens
-    const seen = new Set();
-    const tokens = [];
-    for (const part of parts) {
-        const lower = part.toLowerCase();
-        if (lower.length >= 2 && !seen.has(lower)) {
-            seen.add(lower);
-            tokens.push(lower);
-        }
-    }
-    return tokens;
-}
-//# sourceMappingURL=tokenize.js.map

package/dist/core/search/metrics/tokenize.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tokenize.js","sourceRoot":"","sources":["../../../../src/core/search/metrics/tokenize.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAY;IAChD,oFAAoF;IACpF,yFAAuF;IACvF,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAElG,6BAA6B;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAE3C,8CAA8C;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd","sourcesContent":["/**\n * Shared tokenizer for path-match and symbol-match metrics.\n *\n * Splits text on common code boundaries (spaces, path separators, dots,\n * dashes, underscores, camelCase) and normalizes to lowercase.\n */\n\n/**\n * Tokenize text by splitting on spaces, `/`, `\\`, `.`, `-`, `_`, and\n * camelCase boundaries. Returns unique, lowercase tokens ≥ 2 chars.\n */\nexport function tokenize(text: string): string[] {\n\t// Insert a space before uppercase letters that follow lowercase letters (camelCase)\n\t// or before uppercase letters followed by lowercase (e.g., \"XMLParser\" → \"XML Parser\")\n\tconst spaced = text.replace(/([a-z])([A-Z])/g, \"$1 $2\").replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\");\n\n\t// Split on common delimiters\n\tconst parts = spaced.split(/[\\s/\\\\.\\-_]+/);\n\n\t// Lowercase, deduplicate, filter short tokens\n\tconst seen = new Set<string>();\n\tconst tokens: string[] = [];\n\tfor (const part of parts) {\n\t\tconst lower = part.toLowerCase();\n\t\tif (lower.length >= 2 && !seen.has(lower)) {\n\t\t\tseen.add(lower);\n\t\t\ttokens.push(lower);\n\t\t}\n\t}\n\n\treturn tokens;\n}\n"]}