projscan 0.8.0 → 0.9.1

package/dist/core/indexCache.d.ts

@@ -1,11 +1,11 @@
 import type { CodeGraph } from './codeGraph.js';
 /**
  * Load a previously cached code graph, if present and valid. Returns undefined
- * when there's no cache or the cache is incompatible — caller should rebuild.
+ * when there's no cache or the cache is incompatible - caller should rebuild.
  */
 export declare function loadCachedGraph(rootPath: string): Promise<CodeGraph | undefined>;
 /**
- * Persist the graph. Creates .projscan-cache/ if needed. Swallows errors —
+ * Persist the graph. Creates .projscan-cache/ if needed. Swallows errors -
  * caching is best-effort, never blocks a run.
  */
 export declare function saveCachedGraph(rootPath: string, graph: CodeGraph): Promise<void>;

package/dist/core/indexCache.js

@@ -5,7 +5,7 @@ const CACHE_FILE = 'graph.json';
 const CACHE_VERSION = 1;
 /**
  * Load a previously cached code graph, if present and valid. Returns undefined
- * when there's no cache or the cache is incompatible — caller should rebuild.
+ * when there's no cache or the cache is incompatible - caller should rebuild.
  */
 export async function loadCachedGraph(rootPath) {
     const cachePath = path.join(rootPath, CACHE_DIR, CACHE_FILE);
@@ -38,7 +38,7 @@ export async function loadCachedGraph(rootPath) {
             parseReason: entry.parseReason,
         });
     }
-    // Derived indexes are rebuilt on load — cheap compared to re-parsing.
+    // Derived indexes are rebuilt on load - cheap compared to re-parsing.
     // Return a partial graph the caller will rehydrate via buildCodeGraph.
     return {
         files,
@@ -49,7 +49,7 @@ export async function loadCachedGraph(rootPath) {
     };
 }
 /**
- * Persist the graph. Creates .projscan-cache/ if needed. Swallows errors —
+ * Persist the graph. Creates .projscan-cache/ if needed. Swallows errors -
  * caching is best-effort, never blocks a run.
  */
 export async function saveCachedGraph(rootPath, graph) {
@@ -82,7 +82,7 @@ export async function saveCachedGraph(rootPath, graph) {
         await fs.writeFile(gitignorePath, '*\n', 'utf-8');
     }
     catch {
-        // ignore — cache is best-effort
+        // ignore - cache is best-effort
     }
 }
 export async function invalidateCache(rootPath) {

package/dist/core/outdatedDetector.d.ts

@@ -1,6 +1,6 @@
 import type { OutdatedReport } from '../types.js';
 /**
- * Offline outdated check — compares the version declared in package.json
+ * Offline outdated check - compares the version declared in package.json
  * to the version installed under node_modules/<pkg>/package.json.
  *
  * Does not hit the npm registry. `latest` is filled in only when a node_modules

package/dist/core/outdatedDetector.js

@@ -2,7 +2,7 @@ import fs from 'node:fs/promises';
 import path from 'node:path';
 import { drift as semverDrift } from '../utils/semver.js';
 /**
- * Offline outdated check — compares the version declared in package.json
+ * Offline outdated check - compares the version declared in package.json
  * to the version installed under node_modules/<pkg>/package.json.
  *
  * Does not hit the npm registry. `latest` is filled in only when a node_modules

package/dist/core/searchIndex.js

@@ -5,7 +5,7 @@ import path from 'node:path';
  *
  * We index three fields per file with different weights:
  *   - content (body tokens, BM25 baseline)
- *   - symbols (export names — most informative for code search)
+ *   - symbols (export names - most informative for code search)
  *   - path (file path tokens)
  *
  * Scoring:
@@ -191,7 +191,7 @@ export function tokenize(input) {
             .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2');
         const parts = camelSplit.split(/[_\s]+/).filter(Boolean);
         for (const part of parts) {
-            // Split embedded digits from letters — e.g. "v1api" → "v", "1", "api"
+            // Split embedded digits from letters - e.g. "v1api" → "v", "1", "api"
             const subparts = part.split(/(\d+)/).filter(Boolean);
             for (const sp of subparts) {
                 const lower = sp.toLowerCase();

package/dist/core/semanticSearch.d.ts

@@ -0,0 +1,53 @@
+import type { FileEntry } from '../types.js';
+export interface SemanticEntry {
+    relativePath: string;
+    contentHash: string;
+    mtimeMs: number;
+    vector: Float32Array;
+}
+export interface SemanticIndex {
+    model: string;
+    dim: number;
+    entries: Map<string, SemanticEntry>;
+}
+export interface BuildOptions {
+    model?: string;
+    rebuild?: boolean;
+    onProgress?: (done: number, total: number, message?: string) => void;
+    onFirstLoad?: (message: string) => void;
+}
+export interface SemanticHit {
+    file: string;
+    score: number;
+}
+/**
+ * Build (or refresh) a semantic index. Reuses cached embeddings for files
+ * whose mtime AND content hash match - both guards are necessary because
+ * git checkouts can preserve mtime while swapping content.
+ *
+ * Returns null if the peer dep isn't available.
+ */
+export declare function buildSemanticIndex(rootPath: string, files: FileEntry[], options?: BuildOptions): Promise<SemanticIndex | null>;
+/**
+ * Query a semantic index. Returns top-K files by cosine similarity.
+ * Returns an empty array if no files are indexed.
+ */
+export declare function semanticSearch(index: SemanticIndex, query: string, options?: {
+    limit?: number;
+    onFirstLoad?: (m: string) => void;
+}): Promise<SemanticHit[]>;
+/**
+ * Reciprocal Rank Fusion (RRF) combines two ranked lists into one. Well-
+ * established way to merge lexical (BM25) and semantic results without
+ * needing to calibrate scale between the two scoring systems.
+ *
+ *   score(doc) = sum over lists L of 1 / (k + rank_L(doc))
+ *
+ * k = 60 is the standard constant.
+ */
+export declare function reciprocalRankFusion(lists: Array<Array<{
+    file: string;
+}>>, k?: number): Array<{
+    file: string;
+    score: number;
+}>;

package/dist/core/semanticSearch.js

@@ -0,0 +1,217 @@
+import fs from 'node:fs/promises';
+import path from 'node:path';
+import crypto from 'node:crypto';
+import { embedBatch, embedText, cosineSimilarity, isSemanticAvailable, DEFAULT_MODEL, EMBEDDING_DIM, } from './embeddings.js';
+/**
+ * File-level semantic search over source files.
+ *
+ * v1 design decisions:
+ *   - One embedding per file. Sub-file (per-export, per-function) chunking
+ *     is a bigger project; file-level is sufficient to answer "which file
+ *     implements X?"
+ *   - Input text is the first 4KB of the file (captures most semantic
+ *     signal without blowing the context window of small embedding models).
+ *   - Path is prepended as a weak signal: `<file>\n\n<content>`.
+ *   - Cache persisted to .projscan-cache/embeddings.bin, keyed by
+ *     (model, file mtime, content hash). Invalidates on any of those changing.
+ */
+const CACHE_DIR = '.projscan-cache';
+const CACHE_FILE = 'embeddings.bin';
+const CACHE_VERSION = 1;
+const MAX_FILE_BYTES_FOR_EMBED = 4 * 1024;
+const MAX_FILE_SIZE = 512 * 1024;
+const INDEXABLE_EXTS = new Set([
+    '.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs', '.mts', '.cts',
+    '.py', '.go', '.rb', '.java', '.rs', '.php',
+    '.md', '.mdx',
+]);
+/**
+ * Build (or refresh) a semantic index. Reuses cached embeddings for files
+ * whose mtime AND content hash match - both guards are necessary because
+ * git checkouts can preserve mtime while swapping content.
+ *
+ * Returns null if the peer dep isn't available.
+ */
+export async function buildSemanticIndex(rootPath, files, options = {}) {
+    const available = await isSemanticAvailable();
+    if (!available)
+        return null;
+    const model = options.model ?? DEFAULT_MODEL;
+    const cached = options.rebuild ? null : await loadCache(rootPath, model);
+    const entries = cached?.entries ?? new Map();
+    const indexable = files.filter((f) => INDEXABLE_EXTS.has(f.extension) && f.sizeBytes <= MAX_FILE_SIZE);
+    // Determine which files still need embedding
+    const toEmbed = [];
+    const keep = new Set();
+    for (const file of indexable) {
+        const abs = path.isAbsolute(file.absolutePath)
+            ? file.absolutePath
+            : path.resolve(rootPath, file.relativePath);
+        let content;
+        try {
+            content = await fs.readFile(abs, 'utf-8');
+        }
+        catch {
+            continue;
+        }
+        const text = `${file.relativePath}\n\n${content.slice(0, MAX_FILE_BYTES_FOR_EMBED)}`;
+        const hash = sha256(text);
+        const existing = entries.get(file.relativePath);
+        let mtimeMs = 0;
+        try {
+            const stat = await fs.stat(abs);
+            mtimeMs = stat.mtimeMs;
+        }
+        catch {
+            // ignore
+        }
+        if (existing && existing.contentHash === hash && existing.mtimeMs === mtimeMs) {
+            keep.add(file.relativePath);
+            continue;
+        }
+        toEmbed.push({ file, hash, text });
+        keep.add(file.relativePath);
+    }
+    // Drop cached entries for files that no longer exist
+    for (const key of [...entries.keys()]) {
+        if (!keep.has(key))
+            entries.delete(key);
+    }
+    if (toEmbed.length === 0) {
+        return { model, dim: cached?.dim ?? EMBEDDING_DIM, entries };
+    }
+    options.onProgress?.(0, toEmbed.length, 'embedding files');
+    // Batch embeddings in chunks of 32 to cap peak memory
+    const BATCH = 32;
+    for (let i = 0; i < toEmbed.length; i += BATCH) {
+        const slice = toEmbed.slice(i, i + BATCH);
+        const vectors = await embedBatch(slice.map((s) => s.text), { model, onFirstLoad: options.onFirstLoad });
+        if (!vectors) {
+            // Peer loaded at start of the build but embedBatch now returns null.
+            // This is rare (module unloaded, OOM, etc.); log to stderr so operators
+            // can diagnose instead of silently losing the semantic capability.
+            process.stderr.write(`[projscan] semantic index build aborted at batch ${Math.floor(i / BATCH) + 1}/${Math.ceil(toEmbed.length / BATCH)} (peer dep became unavailable)\n`);
+            return null;
+        }
+        for (let j = 0; j < slice.length; j++) {
+            const s = slice[j];
+            const abs = path.isAbsolute(s.file.absolutePath)
+                ? s.file.absolutePath
+                : path.resolve(rootPath, s.file.relativePath);
+            let mtimeMs = 0;
+            try {
+                mtimeMs = (await fs.stat(abs)).mtimeMs;
+            }
+            catch {
+                // ignore
+            }
+            entries.set(s.file.relativePath, {
+                relativePath: s.file.relativePath,
+                contentHash: s.hash,
+                mtimeMs,
+                vector: vectors[j],
+            });
+        }
+        options.onProgress?.(Math.min(i + BATCH, toEmbed.length), toEmbed.length);
+    }
+    const index = {
+        model,
+        dim: EMBEDDING_DIM,
+        entries,
+    };
+    await saveCache(rootPath, index).catch(() => {
+        // best-effort - don't fail the search if cache write fails
+    });
+    return index;
+}
+/**
+ * Query a semantic index. Returns top-K files by cosine similarity.
+ * Returns an empty array if no files are indexed.
+ */
+export async function semanticSearch(index, query, options = {}) {
+    if (index.entries.size === 0)
+        return [];
+    const vector = await embedText(query, { model: index.model, onFirstLoad: options.onFirstLoad });
+    if (!vector)
+        return [];
+    const limit = Math.max(1, Math.min(500, options.limit ?? 20));
+    const scored = [];
+    for (const entry of index.entries.values()) {
+        const score = cosineSimilarity(vector, entry.vector);
+        scored.push({ file: entry.relativePath, score: Math.round(score * 1000) / 1000 });
+    }
+    scored.sort((a, b) => b.score - a.score);
+    return scored.slice(0, limit);
+}
+async function loadCache(rootPath, expectedModel) {
+    const cachePath = path.join(rootPath, CACHE_DIR, CACHE_FILE);
+    let raw;
+    try {
+        raw = await fs.readFile(cachePath, 'utf-8');
+    }
+    catch {
+        return null;
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(raw);
+    }
+    catch {
+        return null;
+    }
+    if (parsed.version !== CACHE_VERSION || parsed.model !== expectedModel)
+        return null;
+    const entries = new Map();
+    for (const e of parsed.entries) {
+        entries.set(e.relativePath, {
+            relativePath: e.relativePath,
+            contentHash: e.contentHash,
+            mtimeMs: e.mtimeMs,
+            vector: new Float32Array(e.vector),
+        });
+    }
+    return { model: parsed.model, dim: parsed.dim, entries };
+}
+async function saveCache(rootPath, index) {
+    const dir = path.join(rootPath, CACHE_DIR);
+    await fs.mkdir(dir, { recursive: true });
+    const payload = {
+        version: CACHE_VERSION,
+        model: index.model,
+        dim: index.dim,
+        entries: [...index.entries.values()].map((e) => ({
+            relativePath: e.relativePath,
+            contentHash: e.contentHash,
+            mtimeMs: e.mtimeMs,
+            vector: [...e.vector],
+        })),
+    };
+    await fs.writeFile(path.join(dir, CACHE_FILE), JSON.stringify(payload), 'utf-8');
+}
+function sha256(s) {
+    return crypto.createHash('sha256').update(s).digest('hex').slice(0, 16);
+}
+// ── Hybrid ranking ────────────────────────────────────────
+/**
+ * Reciprocal Rank Fusion (RRF) combines two ranked lists into one. Well-
+ * established way to merge lexical (BM25) and semantic results without
+ * needing to calibrate scale between the two scoring systems.
+ *
+ *   score(doc) = sum over lists L of 1 / (k + rank_L(doc))
+ *
+ * k = 60 is the standard constant.
+ */
+export function reciprocalRankFusion(lists, k = 60) {
+    const scores = new Map();
+    for (const list of lists) {
+        for (let rank = 0; rank < list.length; rank++) {
+            const file = list[rank].file;
+            const contribution = 1 / (k + rank + 1);
+            scores.set(file, (scores.get(file) ?? 0) + contribution);
+        }
+    }
+    return [...scores.entries()]
+        .map(([file, score]) => ({ file, score: Math.round(score * 10000) / 10000 }))
+        .sort((a, b) => b.score - a.score);
+}
+//# sourceMappingURL=semanticSearch.js.map

package/dist/core/semanticSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semanticSearch.js","sourceRoot":"","sources":["../../src/core/semanticSearch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAClC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAM,MAAM,aAAa,CAAC;AAEjC,OAAO,EACL,UAAU,EACV,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,aAAa,EACb,aAAa,GACd,MAAM,iBAAiB,CAAC;AAEzB;;;;;;;;;;;;GAYG;AAEH,MAAM,SAAS,GAAG,iBAAiB,CAAC;AACpC,MAAM,UAAU,GAAG,gBAAgB,CAAC;AACpC,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,MAAM,wBAAwB,GAAG,CAAC,GAAG,IAAI,CAAC;AAC1C,MAAM,aAAa,GAAG,GAAG,GAAG,IAAI,CAAC;AAEjC,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;IAC7B,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAC5D,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM;IAC3C,KAAK,EAAE,MAAM;CACd,CAAC,CAAC;AA2BH;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAAgB,EAChB,KAAkB,EAClB,UAAwB,EAAE;IAE1B,MAAM,SAAS,GAAG,MAAM,mBAAmB,EAAE,CAAC;IAC9C,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACzE,MAAM,OAAO,GAAG,MAAM,EAAE,OAAO,IAAI,IAAI,GAAG,EAAyB,CAAC;IAEpE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,aAAa,CACvE,CAAC;IAEF,6CAA6C;IAC7C,MAAM,OAAO,GAA2D,EAAE,CAAC;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC;YAC5C,CAAC,CAAC,IAAI,CAAC,YAAY;YACnB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAC9C,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,EAAE,CAAC;QACrF,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEhD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,KAAK,IAAI,IAAI,QAAQ,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;YAC9E,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC9B,CAAC;IAED,qDAAqD;IACrD,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,aAAa,EAAE,OAAO,EAAE,CAAC;IAC/D,CAAC;IAED,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAE3D,sDAAsD;IACtD,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,MAAM,UAAU,CAC9B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EACxB,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAC5C,CAAC;QACF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,qEAAqE;YACrE,wEAAwE;YACxE,mEAAmE;YACnE,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,oDAAoD,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,kCAAkC,CACrJ,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;gBAC9C,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY;gBACrB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChD,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,CAAC;gBACH,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YACzC,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,EAAE;gBAC/B,YAAY,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY;gBACjC,WAAW,EAAE,CAAC,CAAC,IAAI;gBACnB,OAAO;gBACP,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;aACnB,CAAC,CAAC;QACL,CAAC;QACD,OAAO,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,KAAK,GAAkB;QAC3B,KAAK;QACL,GAAG,EAAE,aAAa;QAClB,OAAO;KACR,CAAC;IAEF,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE;QAC1C,2DAA2D;IAC7D,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,KAAoB,EACpB,KAAa,EACb,UAAiE,EAAE;IAEnE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAChG,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;IACpF,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAgBD,KAAK,UAAU,SAAS,CAAC,QAAgB,EAAE,aAAqB;IAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAC7D,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAoB,CAAC;IACzB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAiB,CAAC;IAC3C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,CAAC,OAAO,KAAK,aAAa,IAAI,MAAM,CAAC,KAAK,KAAK,aAAa;QAAE,OAAO,IAAI,CAAC;IAEpF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE;YAC1B,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;SACnC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC;AAC3D,CAAC;AAED,KAAK,UAAU,SAAS,CAAC,QAAgB,EAAE,KAAoB;IAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC3C,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACzC,MAAM,OAAO,GAAiB;QAC5B,OAAO,EAAE,aAAa;QACtB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/C,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;SACtB,CAAC,CAAC;KACJ,CAAC;IACF,MAAM,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;AACnF,CAAC;AAED,SAAS,MAAM,CAAC,CAAS;IACvB,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,6DAA6D;AAE7D;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAqC,EACrC,CAAC,GAAG,EAAE;IAEN,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;YAC7B,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SACzB,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;SAC5E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACvC,CAAC"}

package/dist/core/upgradePreview.js

@@ -31,7 +31,7 @@ export async function previewUpgrade(rootPath, pkgName, files) {
     if (!installed) {
         return {
             available: false,
-            reason: `Package "${pkgName}" not installed — run npm install and retry`,
+            reason: `Package "${pkgName}" not installed - run npm install and retry`,
             name: pkgName,
             declared: declaredVersions,
             installed: null,

package/dist/fixes/prettierFix.js

@@ -34,7 +34,7 @@ export const prettierFix = {
         }
         catch (err) {
             if (err instanceof Error && 'code' in err && err.code === 'ENOENT') {
-                return; // No package.json — nothing to update
+                return; // No package.json - nothing to update
             }
             throw err; // Re-throw JSON parse errors or unexpected failures
         }

package/dist/fixes/testFix.js

@@ -30,7 +30,7 @@ export const testFix = {
         }
         catch (err) {
             if (err instanceof Error && 'code' in err && err.code === 'ENOENT') {
-                return; // No package.json — nothing to update
+                return; // No package.json - nothing to update
             }
             throw err; // Re-throw JSON parse errors or unexpected failures
         }

package/dist/index.d.ts

@@ -19,6 +19,8 @@ export { paginate, encodeCursor, decodeCursor, listChecksum, readPageParams } fr
 export { toContentBlocks } from './mcp/chunker.js';
 export { emitProgress, withProgress } from './mcp/progress.js';
 export { buildSearchIndex, search, tokenize, expandQuery, attachExcerpts, } from './core/searchIndex.js';
+export { isSemanticAvailable, embedText, embedBatch, cosineSimilarity, DEFAULT_MODEL, EMBEDDING_DIM, } from './core/embeddings.js';
+export { buildSemanticIndex, semanticSearch, reciprocalRankFusion, } from './core/semanticSearch.js';
 export { findDependencyLines } from './utils/packageJsonLocator.js';
 export { parse as parseSemver, compare as compareSemver, drift as semverDrift } from './utils/semver.js';
 export { walkFiles } from './utils/fileWalker.js';

package/dist/index.js

@@ -19,6 +19,8 @@ export { paginate, encodeCursor, decodeCursor, listChecksum, readPageParams } fr
 export { toContentBlocks } from './mcp/chunker.js';
 export { emitProgress, withProgress } from './mcp/progress.js';
 export { buildSearchIndex, search, tokenize, expandQuery, attachExcerpts, } from './core/searchIndex.js';
+export { isSemanticAvailable, embedText, embedBatch, cosineSimilarity, DEFAULT_MODEL, EMBEDDING_DIM, } from './core/embeddings.js';
+export { buildSemanticIndex, semanticSearch, reciprocalRankFusion, } from './core/semanticSearch.js';
 export { findDependencyLines } from './utils/packageJsonLocator.js';
 export { parse as parseSemver, compare as compareSemver, drift as semverDrift } from './utils/semver.js';
 export { walkFiles } from './utils/fileWalker.js';

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC9E,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvG,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,qBAAqB,EACrB,mBAAmB,EACnB,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACzF,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzG,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EACL,gBAAgB,EAChB,MAAM,EACN,QAAQ,EACR,WAAW,EACX,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,OAAO,IAAI,aAAa,EAAE,KAAK,IAAI,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACzG,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC9E,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvG,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,qBAAqB,EACrB,mBAAmB,EACnB,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACzF,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzG,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EACL,gBAAgB,EAChB,MAAM,EACN,QAAQ,EACR,WAAW,EACX,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,mBAAmB,EACnB,SAAS,EACT,UAAU,EACV,gBAAgB,EAChB,aAAa,EACb,aAAa,GACd,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,oBAAoB,GACrB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,OAAO,IAAI,aAAa,EAAE,KAAK,IAAI,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACzG,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/mcp/chunker.d.ts

@@ -8,7 +8,7 @@
  *     emit chunk blocks each containing a slice of the array.
  *   - Otherwise, emit a single block.
  *
- * Chunk size defaults to 20 records per block — small enough to be a
+ * Chunk size defaults to 20 records per block - small enough to be a
  * meaningful streaming unit, big enough to avoid pathological block counts.
  */
 export interface ContentBlock {

package/dist/mcp/chunker.js

@@ -8,7 +8,7 @@
  *     emit chunk blocks each containing a slice of the array.
  *   - Otherwise, emit a single block.
  *
- * Chunk size defaults to 20 records per block — small enough to be a
+ * Chunk size defaults to 20 records per block - small enough to be a
  * meaningful streaming unit, big enough to avoid pathological block counts.
  */
 const DEFAULT_CHUNK_SIZE = 20;

package/dist/mcp/pagination.d.ts

@@ -19,7 +19,7 @@ export interface Page<T> {
 }
 /**
  * Slice an array into a page. `checksum` should be a cheap identifier of
- * the result-set shape (e.g., `items.length`) — if it mismatches a cursor's
+ * the result-set shape (e.g., `items.length`) - if it mismatches a cursor's
  * captured checksum we treat the page as fresh (offset=0) rather than risk
  * returning stale offsets.
  */
@@ -31,7 +31,7 @@ interface DecodedCursor {
 export declare function encodeCursor(cursor: DecodedCursor): string;
 export declare function decodeCursor(cursor?: string): DecodedCursor | null;
 /**
- * Compute a lightweight checksum for a list. Deliberately weak — we want
+ * Compute a lightweight checksum for a list. Deliberately weak - we want
  * cursor invalidation on shape changes (length) but not on micro-changes
  * within items (scores that shift slightly between runs). Agents already
  * handle eventual consistency.

package/dist/mcp/pagination.js

@@ -12,7 +12,7 @@ const DEFAULT_PAGE_SIZE = 50;
 const MAX_PAGE_SIZE = 500;
 /**
  * Slice an array into a page. `checksum` should be a cheap identifier of
- * the result-set shape (e.g., `items.length`) — if it mismatches a cursor's
+ * the result-set shape (e.g., `items.length`) - if it mismatches a cursor's
  * captured checksum we treat the page as fresh (offset=0) rather than risk
  * returning stale offsets.
  */
@@ -49,7 +49,7 @@ export function decodeCursor(cursor) {
     }
 }
 /**
- * Compute a lightweight checksum for a list. Deliberately weak — we want
+ * Compute a lightweight checksum for a list. Deliberately weak - we want
  * cursor invalidation on shape changes (length) but not on micro-changes
  * within items (scores that shift slightly between runs). Agents already
  * handle eventual consistency.

package/dist/mcp/progress.d.ts

@@ -3,11 +3,12 @@
  *
  * Per MCP spec, a client that wants progress sets `_meta.progressToken` on
  * the tool-call request. We capture it at dispatch time and expose a
- * `notify(progress, total?)` callback to the tool handler via the rootPath
- * extension — which is awkward but keeps the handler signature unchanged
- * for tools that don't care.
+ * `notify(progress, total?, message?)` callback to the tool handler via an
+ * AsyncLocalStorage context - which means concurrent tool calls get their
+ * own isolated emitters (the naive module-level-variable approach had tools
+ * clobbering each other's progress streams under pipelined requests).
  *
- * The notification wire format (MCP 2024-11-05 + 2025-03-26):
+ * Wire format (MCP 2024-11-05 + 2025-03-26):
  *   { "jsonrpc": "2.0", "method": "notifications/progress",
  *     "params": { "progressToken": <token>, "progress": <n>, "total"?: <n>, "message"?: "..." } }
  */

package/dist/mcp/progress.js

@@ -1,39 +1,16 @@
-/**
- * Progress notification plumbing for long-running MCP tools.
- *
- * Per MCP spec, a client that wants progress sets `_meta.progressToken` on
- * the tool-call request. We capture it at dispatch time and expose a
- * `notify(progress, total?)` callback to the tool handler via the rootPath
- * extension — which is awkward but keeps the handler signature unchanged
- * for tools that don't care.
- *
- * The notification wire format (MCP 2024-11-05 + 2025-03-26):
- *   { "jsonrpc": "2.0", "method": "notifications/progress",
- *     "params": { "progressToken": <token>, "progress": <n>, "total"?: <n>, "message"?: "..." } }
- */
+import { AsyncLocalStorage } from 'node:async_hooks';
 const NOOP = () => { };
-/**
- * AsyncLocalStorage-style context. We stash the current emitter on a
- * module-level WeakMap keyed by a symbol to survive `await` points.
- * Simpler than pulling in `node:async_hooks`.
- */
-const emitters = new Map();
+// AsyncLocalStorage isolates the emitter per async context. Each tools/call
+// dispatch starts a fresh context via `withProgress`, so concurrent tool
+// calls never see each other's emitters.
+const storage = new AsyncLocalStorage();
 export function withProgress(emit, fn) {
     if (!emit)
         return fn();
-    const key = Symbol('progress');
-    emitters.set(key, emit);
-    currentKey = key;
-    return fn().finally(() => {
-        emitters.delete(key);
-        currentKey = null;
-    });
+    return storage.run(emit, fn);
 }
-let currentKey = null;
 export function emitProgress(progress, total, message) {
-    if (!currentKey)
-        return;
-    const emit = emitters.get(currentKey);
+    const emit = storage.getStore();
     if (!emit)
         return;
     try {

package/dist/mcp/progress.js.map

@@ -1 +1 @@
-{"version":3,"file":"progress.js","sourceRoot":"","sources":["../../src/mcp/progress.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,MAAM,IAAI,GAAoB,GAAG,EAAE,GAAE,CAAC,CAAC;AAEvC;;;;GAIG;AACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAC;AAEpD,MAAM,UAAU,YAAY,CAC1B,IAAiC,EACjC,EAAoB;IAEpB,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,CAAC;IACvB,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACxB,UAAU,GAAG,GAAG,CAAC;IACjB,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;QACvB,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,UAAU,GAAG,IAAI,CAAC;IACpB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,IAAI,UAAU,GAAkB,IAAI,CAAC;AAErC,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,KAAc,EAAE,OAAgB;IAC7E,IAAI,CAAC,UAAU;QAAE,OAAO;IACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,CAAC;QACH,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,2DAA2D;IAC7D,CAAC;AACH,CAAC;AAED,OAAO,EAAE,IAAI,EAAE,CAAC"}
+{"version":3,"file":"progress.js","sourceRoot":"","sources":["../../src/mcp/progress.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAmBrD,MAAM,IAAI,GAAoB,GAAG,EAAE,GAAE,CAAC,CAAC;AAEvC,4EAA4E;AAC5E,yEAAyE;AACzE,yCAAyC;AACzC,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAmB,CAAC;AAEzD,MAAM,UAAU,YAAY,CAC1B,IAAiC,EACjC,EAAoB;IAEpB,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,CAAC;IACvB,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,KAAc,EAAE,OAAgB;IAC7E,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,CAAC;QACH,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,2DAA2D;IAC7D,CAAC;AACH,CAAC;AAED,OAAO,EAAE,IAAI,EAAE,CAAC"}

package/dist/mcp/prompts.js

@@ -53,10 +53,10 @@ async function prioritizeRefactoringPrompt(args, rootPath) {
             const ownership = h.busFactorOne && h.primaryAuthor
                 ? ` [BUS FACTOR 1: ${h.primaryAuthor}]`
                 : '';
-            return `${i + 1}. ${h.relativePath} — risk ${h.riskScore.toFixed(1)} (${reasons})${ownership}`;
+            return `${i + 1}. ${h.relativePath} - risk ${h.riskScore.toFixed(1)} (${reasons})${ownership}`;
         })
             .join('\n')
-        : '(no hotspots available — project may not be a git repository)';
+        : '(no hotspots available - project may not be a git repository)';
     const topIssues = issues
         .slice(0, 15)
         .map((issue) => `- [${issue.severity}] ${issue.title}`)
@@ -104,7 +104,7 @@ async function investigateFilePrompt(args, rootPath) {
         'Explain in order:',
         '1. What this file does and how it fits in the codebase.',
         '2. What is risky about it right now (cite evidence from the report).',
-        '3. Concrete next actions — questions to ask, tests to add, or refactors to attempt.',
+        '3. Concrete next actions - questions to ask, tests to add, or refactors to attempt.',
         '4. Who to involve (based on ownership, if available).',
     ].join('\n');
     return {

package/dist/mcp/server.js

@@ -32,7 +32,7 @@ export function createMcpServer(rootPath, options = {}) {
     let initialized = false;
     async function dispatch(request) {
         const id = request.id ?? null;
-        // Notifications (no id) — no response expected.
+        // Notifications (no id) - no response expected.
         const isNotification = request.id === undefined || request.id === null;
         try {
             switch (request.method) {

package/dist/mcp/tokenBudget.d.ts

@@ -2,7 +2,7 @@
  * Rough token estimator and record-aware truncator for MCP tool output.
  *
  * Uses the widely-used "~4 chars per token" heuristic. Good enough for
- * prioritization — absolute accuracy is not required.
+ * prioritization - absolute accuracy is not required.
  */
 export declare const CHARS_PER_TOKEN = 4;
 export declare function estimateTokens(value: string): number;

package/dist/mcp/tokenBudget.js

@@ -2,7 +2,7 @@
  * Rough token estimator and record-aware truncator for MCP tool output.
  *
  * Uses the widely-used "~4 chars per token" heuristic. Good enough for
- * prioritization — absolute accuracy is not required.
+ * prioritization - absolute accuracy is not required.
  */
 export const CHARS_PER_TOKEN = 4;
 export function estimateTokens(value) {
@@ -55,7 +55,7 @@ function safeStringify(value) {
     }
 }
 /**
- * Find top-level array field names — our convention is that MCP results
+ * Find top-level array field names - our convention is that MCP results
  * expose a primary array (hotspots, entries, findings, files) worth
  * trimming before scalar fields.
  */