claude-local-docs 1.0.13 → 1.0.15

package/dist/code-search.js

@@ -0,0 +1,155 @@
+/**
+ * Code search pipeline — mirrors the doc search pipeline architecture.
+ * Vector search + BM25 → RRF fusion → cross-encoder rerank.
+ *
+ * TEI containers must be running — no fallback mode.
+ */
+import { sqlEscapeString } from "./types.js";
+import { embedCodeTexts } from "./code-indexer.js";
+import { rerank } from "./reranker.js";
+import { reciprocalRankFusion } from "./rrf.js";
+function buildFilter(options) {
+    if (!options)
+        return undefined;
+    const clauses = [];
+    if (options.filePath) {
+        clauses.push(`"filePath" = '${sqlEscapeString(options.filePath)}'`);
+    }
+    if (options.language) {
+        clauses.push(`language = '${sqlEscapeString(options.language)}'`);
+    }
+    if (options.entityType) {
+        clauses.push(`"entityType" = '${sqlEscapeString(options.entityType)}'`);
+    }
+    return clauses.length > 0 ? clauses.join(" AND ") : undefined;
+}
+/** Extract file-name-like tokens from a query for file-path boosting. */
+function extractFilePathTokens(query) {
+    const matches = query.match(/[\w.-]+\.(ts|tsx|js|jsx|vue|svelte|astro)/gi);
+    return matches ?? [];
+}
+function toRankedDoc(row) {
+    return {
+        id: row.id,
+        text: row.text,
+        filePath: row.filePath,
+        language: row.language,
+        entityType: row.entityType,
+        entityName: row.entityName,
+        signature: row.signature,
+        scopeChain: row.scopeChain,
+        lineStart: row.lineStart,
+        lineEnd: row.lineEnd,
+    };
+}
+export async function searchCode(query, store, options) {
+    const topK = options?.topK ?? 10;
+    const candidateCount = Math.max(50, topK * 3);
+    const filter = buildFilter(options);
+    // Step 1: Vector search via Qodo-Embed
+    const [queryVector] = await embedCodeTexts([query], "query");
+    const vectorHits = await store.vectorSearch(queryVector, candidateCount, filter);
+    const vectorRanked = vectorHits.map(toRankedDoc);
+    // Step 2: BM25 search via LanceDB native FTS
+    const ftsHits = await store.ftsSearch(query, candidateCount, filter);
+    const bm25Ranked = ftsHits.map(toRankedDoc);
+    // Step 3: RRF fusion with optional file-path boost as third signal
+    const rrfInputs = [];
+    if (vectorRanked.length > 0) {
+        rrfInputs.push({ docs: vectorRanked, weight: 0.7 });
+    }
+    if (bm25Ranked.length > 0) {
+        rrfInputs.push({ docs: bm25Ranked, weight: 1.0 });
+    }
+    // File-path boost: if query contains file references, rank matching results
+    const fileTokens = extractFilePathTokens(query);
+    if (fileTokens.length > 0) {
+        // Collect all unique candidates from vector + BM25
+        const allCandidates = new Map();
+        for (const doc of [...vectorRanked, ...bm25Ranked]) {
+            if (!allCandidates.has(doc.id))
+                allCandidates.set(doc.id, doc);
+        }
+        const filePathRanked = [];
+        for (const doc of allCandidates.values()) {
+            const fp = doc.filePath ?? "";
+            if (fileTokens.some(token => fp.endsWith(token) || fp.includes(token))) {
+                filePathRanked.push(doc);
+            }
+        }
+        if (filePathRanked.length > 0) {
+            rrfInputs.push({ docs: filePathRanked, weight: 0.5 });
+        }
+    }
+    if (rrfInputs.length === 0)
+        return [];
+    const fused = reciprocalRankFusion(rrfInputs);
+    // Step 4: Cross-encoder rerank top 50 candidates
+    const rerankCandidates = fused
+        .slice(0, 50)
+        .map((f) => ({ ...f }));
+    const rerankResults = await rerank(query, rerankCandidates);
+    const reranked = rerankResults.slice(0, topK);
+    // Step 5: Map back to CodeSearchResult
+    // Build lookup from fused results for extra fields
+    const fusedMap = new Map(fused.map(f => [f.id, f]));
+    const results = reranked.map((r) => {
+        const orig = fusedMap.get(r.id);
+        return {
+            score: Math.round(r.rerankerScore * 1000) / 1000,
+            filePath: (orig?.filePath ?? ""),
+            language: (orig?.language ?? "unknown"),
+            entityType: (orig?.entityType ?? "other"),
+            entityName: (orig?.entityName ?? ""),
+            signature: (orig?.signature ?? ""),
+            scopeChain: (() => {
+                try {
+                    return JSON.parse((orig?.scopeChain ?? "[]"));
+                }
+                catch {
+                    return [];
+                }
+            })(),
+            lineStart: (orig?.lineStart ?? 0),
+            lineEnd: (orig?.lineEnd ?? 0),
+            content: orig?.text ?? "",
+            chunkId: r.id,
+        };
+    });
+    // Step 5: Neighbor expansion — merge adjacent chunks from same file
+    return expandCodeWithNeighbors(results, store);
+}
+/**
+ * Expand code search results with adjacent chunks (id-1 and id+1) from the same file.
+ * Recovers context split across chunk boundaries (similar to doc search neighbor expansion).
+ */
+async function expandCodeWithNeighbors(results, store) {
+    const resultIds = new Set(results.map(r => r.chunkId));
+    const expanded = [];
+    for (const result of results) {
+        const parts = [];
+        // Try previous chunk
+        const prevId = result.chunkId - 1;
+        if (!resultIds.has(prevId)) {
+            const prev = await store.getChunkById(prevId);
+            if (prev && prev.filePath === result.filePath) {
+                parts.push(prev.text);
+            }
+        }
+        parts.push(result.content);
+        // Try next chunk
+        const nextId = result.chunkId + 1;
+        if (!resultIds.has(nextId)) {
+            const next = await store.getChunkById(nextId);
+            if (next && next.filePath === result.filePath) {
+                parts.push(next.text);
+            }
+        }
+        expanded.push({
+            ...result,
+            content: parts.length > 1 ? parts.join("\n\n") : result.content,
+        });
+    }
+    return expanded;
+}
+//# sourceMappingURL=code-search.js.map

package/dist/code-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-search.js","sourceRoot":"","sources":["../src/code-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG7C,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAwB,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAkB,MAAM,UAAU,CAAC;AAEhE,SAAS,WAAW,CAAC,OAIpB;IACC,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,iBAAiB,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,eAAe,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,OAAO,CAAC,IAAI,CAAC,mBAAmB,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAChE,CAAC;AAED,yEAAyE;AACzE,SAAS,qBAAqB,CAAC,KAAa;IAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,6CAA6C,CAAC,CAAC;IAC3E,OAAO,OAAO,IAAI,EAAE,CAAC;AACvB,CAAC;AAED,SAAS,WAAW,CAAC,GAAY;IAC/B,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,OAAO,EAAE,GAAG,CAAC,OAAO;KACrB,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAAa,EACb,KAAgB,EAChB,OAKC;IAED,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;IACjC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAEpC,uCAAuC;IACvC,MAAM,CAAC,WAAW,CAAC,GAAG,MAAM,cAAc,CAAC,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;IACjF,MAAM,YAAY,GAAgB,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAE9D,6CAA6C;IAC7C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;IACrE,MAAM,UAAU,GAAgB,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAEzD,mEAAmE;IACnE,MAAM,SAAS,GAA4C,EAAE,CAAC;IAC9D,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,4EAA4E;IAC5E,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,mDAAmD;QACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAqB,CAAC;QACnD,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,YAAY,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,cAAc,GAAgB,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAI,GAAG,CAAC,QAAmB,IAAI,EAAE,CAAC;YAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvE,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,KAAK,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAE9C,iDAAiD;IACjD,MAAM,gBAAgB,GAAsB,KAAK;SAC9C,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1B,MAAM,aAAa,GAAG,MAAM,MAAM,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAE9C,uCAAuC;IACvC,mDAAmD;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,IAAI;YAChD,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,IAAI,EAAE,CAAW;YAC1C,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAW;YACjD,UAAU,EAAE,CAAC,IAAI,EAAE,UAAU,IAAI,OAAO,CAAmB;YAC3D,UAAU,EAAE,CAAC,IAAI,EAAE,UAAU,IAAI,EAAE,CAAW;YAC9C,SAAS,EAAE,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAW;YAC5C,UAAU,EAAE,CAAC,GAAG,EAAE;gBAChB,IAAI,CAAC;oBAAC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,UAAU,IAAI,IAAI,CAAW,CAAa,CAAC;gBAAC,CAAC;gBAC5E,MAAM,CAAC;oBAAC,OAAO,EAAE,CAAC;gBAAC,CAAC;YACtB,CAAC,CAAC,EAAE;YACJ,SAAS,EAAE,CAAC,IAAI,EAAE,SAAS,IAAI,CAAC,CAAW;YAC3C,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,CAAW;YACvC,OAAO,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE;YACzB,OAAO,EAAE,CAAC,CAAC,EAAE;SACd,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,oEAAoE;IACpE,OAAO,uBAAuB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,uBAAuB,CACpC,OAA2B,EAC3B,KAAgB;IAEhB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAuB,EAAE,CAAC;IAExC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,qBAAqB;QACrB,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE3B,iBAAiB;QACjB,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,GAAG,MAAM;YACT,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO;SAChE,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/code-store.d.ts

@@ -0,0 +1,39 @@
+/**
+ * LanceDB "code" table management for codebase indexing.
+ * Follows the same patterns as src/store.ts (DocStore) but operates
+ * on per-file code chunks instead of per-library doc chunks.
+ */
+import type { CodeRow, CodeMetadata } from "./types.js";
+export declare class CodeStore {
+    private docsDir;
+    private dbPath;
+    private metadataPath;
+    private metadata;
+    private nextId;
+    private projectRoot;
+    private dbInstance;
+    private tableInstance;
+    constructor(projectRoot: string);
+    private ensureDir;
+    private static readonly CURRENT_SCHEMA_VERSION;
+    private getTable;
+    addFile(filePath: string, language: string, sha256: string, chunks: Omit<CodeRow, "id">[], options?: {
+        skipMetadataSave?: boolean;
+    }): Promise<{
+        chunkCount: number;
+        indexSize: number;
+    }>;
+    removeFile(filePath: string): Promise<void>;
+    removeStaleFiles(currentFiles: Set<string>): Promise<string[]>;
+    vectorSearch(queryVector: number[], limit: number, filter?: string): Promise<(CodeRow & {
+        _distance?: number;
+    })[]>;
+    ftsSearch(query: string, limit: number, filter?: string): Promise<CodeRow[]>;
+    createFtsIndex(): Promise<void>;
+    loadMetadata(): Promise<CodeMetadata>;
+    saveMetadata(metadata: CodeMetadata): Promise<void>;
+    getFileHash(filePath: string): Promise<string | undefined>;
+    getChunkById(chunkId: number): Promise<CodeRow | undefined>;
+    isEmpty(): Promise<boolean>;
+    getDocsDir(): string;
+}

package/dist/code-store.js

@@ -0,0 +1,206 @@
+/**
+ * LanceDB "code" table management for codebase indexing.
+ * Follows the same patterns as src/store.ts (DocStore) but operates
+ * on per-file code chunks instead of per-library doc chunks.
+ */
+import { readFile, writeFile, mkdir } from "node:fs/promises";
+import { join } from "node:path";
+import { sqlEscapeString } from "./types.js";
+export class CodeStore {
+    docsDir;
+    dbPath;
+    metadataPath;
+    metadata = null;
+    nextId = 1;
+    projectRoot;
+    dbInstance = null;
+    tableInstance = null;
+    constructor(projectRoot) {
+        this.projectRoot = projectRoot;
+        this.docsDir = join(projectRoot, ".claude", "docs");
+        this.dbPath = join(this.docsDir, "lancedb");
+        this.metadataPath = join(this.docsDir, ".code-metadata.json");
+    }
+    async ensureDir() {
+        await mkdir(this.docsDir, { recursive: true });
+    }
+    static CURRENT_SCHEMA_VERSION = 2;
+    async getTable() {
+        if (this.tableInstance)
+            return this.tableInstance;
+        const lancedb = await import("@lancedb/lancedb");
+        if (!this.dbInstance) {
+            this.dbInstance = await lancedb.connect(this.dbPath);
+        }
+        // Check schema version — drop old table if outdated
+        const metadata = await this.loadMetadata();
+        if (metadata.files.length > 0 && (metadata.schemaVersion ?? 1) < CodeStore.CURRENT_SCHEMA_VERSION) {
+            try {
+                await this.dbInstance.dropTable("code");
+            }
+            catch { /* table may not exist */ }
+            this.tableInstance = null;
+            // Clear files list to force full reindex
+            metadata.files = [];
+            metadata.schemaVersion = CodeStore.CURRENT_SCHEMA_VERSION;
+            await this.saveMetadata(metadata);
+            return null;
+        }
+        try {
+            this.tableInstance = await this.dbInstance.openTable("code");
+            // Find max existing ID
+            const rows = await this.tableInstance.query().select(["id"]).toArray();
+            if (rows.length > 0) {
+                this.nextId = Math.max(...rows.map((r) => r.id)) + 1;
+            }
+        }
+        catch {
+            // Table doesn't exist yet — will be created on first insert
+            this.tableInstance = null;
+        }
+        return this.tableInstance;
+    }
+    async addFile(filePath, language, sha256, chunks, options) {
+        await this.ensureDir();
+        const lancedb = await import("@lancedb/lancedb");
+        if (!this.dbInstance) {
+            this.dbInstance = await lancedb.connect(this.dbPath);
+        }
+        // Get or create table (before assigning IDs so nextId is up-to-date)
+        let table = await this.getTable();
+        // Assign IDs
+        const rows = chunks.map((chunk) => ({
+            ...chunk,
+            id: this.nextId++,
+        }));
+        if (table) {
+            // Delete existing rows for this file, then add new ones
+            await table.delete(`"filePath" = '${sqlEscapeString(filePath)}'`);
+            if (rows.length > 0) {
+                await table.add(rows);
+            }
+        }
+        else {
+            // Create table with first batch of rows
+            if (rows.length > 0) {
+                table = await this.dbInstance.createTable("code", rows);
+                this.tableInstance = table;
+            }
+        }
+        // Update file metadata
+        const metadata = await this.loadMetadata();
+        const existing = metadata.files.findIndex(f => f.filePath === filePath);
+        const fileMeta = {
+            filePath,
+            sha256,
+            language,
+            chunkCount: rows.length,
+            indexedAt: new Date().toISOString(),
+        };
+        if (existing >= 0) {
+            metadata.files[existing] = fileMeta;
+        }
+        else {
+            metadata.files.push(fileMeta);
+        }
+        if (!options?.skipMetadataSave) {
+            await this.saveMetadata(metadata);
+        }
+        const totalRows = table ? (await table.countRows()) : 0;
+        return { chunkCount: rows.length, indexSize: totalRows };
+    }
+    async removeFile(filePath) {
+        const table = await this.getTable();
+        if (table) {
+            await table.delete(`"filePath" = '${sqlEscapeString(filePath)}'`);
+        }
+        const metadata = await this.loadMetadata();
+        metadata.files = metadata.files.filter(f => f.filePath !== filePath);
+        await this.saveMetadata(metadata);
+    }
+    async removeStaleFiles(currentFiles) {
+        const metadata = await this.loadMetadata();
+        const stale = metadata.files.filter(f => !currentFiles.has(f.filePath));
+        const table = await this.getTable();
+        if (table && stale.length > 0) {
+            const escaped = stale.map(f => `'${sqlEscapeString(f.filePath)}'`).join(", ");
+            await table.delete(`"filePath" IN (${escaped})`);
+        }
+        if (stale.length > 0) {
+            metadata.files = metadata.files.filter(f => currentFiles.has(f.filePath));
+            await this.saveMetadata(metadata);
+        }
+        return stale.map(f => f.filePath);
+    }
+    async vectorSearch(queryVector, limit, filter) {
+        const table = await this.getTable();
+        if (!table)
+            return [];
+        let query = table.vectorSearch(queryVector).limit(limit);
+        if (filter) {
+            query = query.where(filter);
+        }
+        return await query.toArray();
+    }
+    async ftsSearch(query, limit, filter) {
+        const table = await this.getTable();
+        if (!table)
+            return [];
+        try {
+            let q = table.query().fullTextSearch(query, { columns: ["text"] }).limit(limit);
+            if (filter) {
+                q = q.where(filter);
+            }
+            return await q.toArray();
+        }
+        catch {
+            return [];
+        }
+    }
+    async createFtsIndex() {
+        const table = await this.getTable();
+        if (!table)
+            return;
+        const lancedb = await import("@lancedb/lancedb");
+        await table.createIndex("text", {
+            config: lancedb.Index.fts({ stem: true, lowercase: true, removeStopWords: true }),
+            replace: true,
+        });
+    }
+    async loadMetadata() {
+        if (this.metadata)
+            return this.metadata;
+        try {
+            const data = await readFile(this.metadataPath, "utf-8");
+            this.metadata = JSON.parse(data);
+        }
+        catch {
+            this.metadata = { projectRoot: this.projectRoot, files: [], schemaVersion: CodeStore.CURRENT_SCHEMA_VERSION };
+        }
+        return this.metadata;
+    }
+    async saveMetadata(metadata) {
+        await this.ensureDir();
+        this.metadata = metadata;
+        await writeFile(this.metadataPath, JSON.stringify(metadata, null, 2));
+    }
+    async getFileHash(filePath) {
+        const metadata = await this.loadMetadata();
+        return metadata.files.find(f => f.filePath === filePath)?.sha256;
+    }
+    async getChunkById(chunkId) {
+        const table = await this.getTable();
+        if (!table)
+            return undefined;
+        const rows = await table.query().where(`id = ${chunkId}`).toArray();
+        return rows[0];
+    }
+    async isEmpty() {
+        const table = await this.getTable();
+        return !table;
+    }
+    getDocsDir() {
+        return this.docsDir;
+    }
+}
+//# sourceMappingURL=code-store.js.map

package/dist/code-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-store.js","sourceRoot":"","sources":["../src/code-store.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG7C,MAAM,OAAO,SAAS;IACZ,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,YAAY,CAAS;IACrB,QAAQ,GAAwB,IAAI,CAAC;IACrC,MAAM,GAAW,CAAC,CAAC;IACnB,WAAW,CAAS;IACpB,UAAU,GAAQ,IAAI,CAAC;IACvB,aAAa,GAAQ,IAAI,CAAC;IAElC,YAAY,WAAmB;QAC7B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,qBAAqB,CAAC,CAAC;IAChE,CAAC;IAEO,KAAK,CAAC,SAAS;QACrB,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACjD,CAAC;IAEO,MAAM,CAAU,sBAAsB,GAAG,CAAC,CAAC;IAE3C,KAAK,CAAC,QAAQ;QACpB,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC;QAClD,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAEjD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvD,CAAC;QAED,oDAAoD;QACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC3C,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,sBAAsB,EAAE,CAAC;YAClG,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC1C,CAAC;YAAC,MAAM,CAAC,CAAC,yBAAyB,CAAC,CAAC;YACrC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAC1B,yCAAyC;YACzC,QAAQ,CAAC,KAAK,GAAG,EAAE,CAAC;YACpB,QAAQ,CAAC,aAAa,GAAG,SAAS,CAAC,sBAAsB,CAAC;YAC1D,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC;YACH,IAAI,CAAC,aAAa,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC7D,uBAAuB;YACvB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,4DAA4D;YAC5D,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC5B,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,OAAO,CACX,QAAgB,EAChB,QAAgB,EAChB,MAAc,EACd,MAA6B,EAC7B,OAAwC;QAExC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAEjD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvD,CAAC;QAED,qEAAqE;QACrE,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QAElC,aAAa;QACb,MAAM,IAAI,GAAc,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC7C,GAAG,KAAK;YACR,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE;SAClB,CAAC,CAAC,CAAC;QAEJ,IAAI,KAAK,EAAE,CAAC;YACV,wDAAwD;YACxD,MAAM,KAAK,CAAC,MAAM,CAAC,iBAAiB,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAClE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wCAAwC;YACxC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAwB;YACpC,QAAQ;YACR,MAAM;YACN,QAAQ;YACR,UAAU,EAAE,IAAI,CAAC,MAAM;YACvB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;QACF,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,gBAAgB,EAAE,CAAC;YAC/B,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;IAC3D,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,QAAgB;QAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,KAAK,CAAC,MAAM,CAAC,iBAAiB,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC3C,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACrE,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,YAAyB;QAC9C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAExE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9E,MAAM,KAAK,CAAC,MAAM,CAAC,kBAAkB,OAAO,GAAG,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1E,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,YAAY,CAChB,WAAqB,EACrB,KAAa,EACb,MAAe;QAEf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QAEtB,IAAI,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACzD,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,KAAa,EAAE,KAAa,EAAE,MAAe;QAC3D,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,IAAI,CAAC;YACH,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAChF,IAAI,MAAM,EAAE,CAAC;gBACX,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;YACD,OAAO,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;QACjD,MAAM,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE;YAC9B,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;YACjF,OAAO,EAAE,IAAI;SACd,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACxC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAiB,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,QAAQ,GAAG,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,EAAE,aAAa,EAAE,SAAS,CAAC,sBAAsB,EAAE,CAAC;QAChH,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,QAAsB;QACvC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,QAAgB;QAChC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC3C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,EAAE,MAAM,CAAC;IACnE,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,OAAe;QAChC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACpE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,OAAO;QACX,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC;IAChB,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC"}

package/dist/code.test.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Code search integration tests — requires TEI containers running (:39281, :39282, :39283).
+ * Indexes this project's own source code and tests semantic search against it.
+ *
+ * Run: npm run test:code
+ */
+export {};

package/dist/code.test.js

@@ -0,0 +1,197 @@
+/**
+ * Code search integration tests — requires TEI containers running (:39281, :39282, :39283).
+ * Indexes this project's own source code and tests semantic search against it.
+ *
+ * Run: npm run test:code
+ */
+import { describe, it, before, after } from "node:test";
+import assert from "node:assert/strict";
+import { mkdtemp, readFile } from "node:fs/promises";
+import { tmpdir } from "node:os";
+import { join } from "node:path";
+import { CodeStore } from "./code-store.js";
+import { indexCodeFile } from "./code-indexer.js";
+import { searchCode } from "./code-search.js";
+import { walkProjectFiles, computeFileHash } from "./file-walker.js";
+const PROJECT_ROOT = join(import.meta.dirname, "..");
+describe("Code search pipeline (self-codebase)", { timeout: 600_000 }, () => {
+    let tempDir;
+    let codeStore;
+    let indexedFileCount;
+    let totalChunks;
+    before(async () => {
+        tempDir = await mkdtemp(join(tmpdir(), "code-search-test-"));
+        codeStore = new CodeStore(tempDir);
+        // Walk this project's own src/ files (exclude test files to avoid self-reference noise)
+        const files = await walkProjectFiles({
+            projectRoot: PROJECT_ROOT,
+            includePaths: ["src/**"],
+            excludePaths: ["src/*.test.ts"],
+        });
+        indexedFileCount = files.length;
+        console.log(`  Found ${files.length} source files to index`);
+        assert.ok(files.length >= 8, `Expected >=8 src files, got ${files.length}`);
+        totalChunks = 0;
+        for (const f of files) {
+            const source = await readFile(f.absolutePath, "utf-8");
+            const sha256 = await computeFileHash(f.absolutePath);
+            const chunks = await indexCodeFile(source, f.relativePath, f.language);
+            await codeStore.addFile(f.relativePath, f.language, sha256, chunks);
+            totalChunks += chunks.length;
+            console.log(`  ${f.relativePath}: ${chunks.length} chunks`);
+        }
+        // Build FTS index
+        await codeStore.createFtsIndex();
+        console.log(`  FTS index built — ${totalChunks} total chunks across ${indexedFileCount} files`);
+    });
+    after(() => {
+        // Force exit — LanceDB native bindings hold file locks and keep event loop alive
+        setTimeout(() => process.exit(0), 200);
+    });
+    // --- Concept-based search tests ---
+    it("finds RRF fusion logic by concept", async () => {
+        const results = await searchCode("reciprocal rank fusion", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasRrf = results.some(r => r.filePath.includes("rrf") || r.content.includes("reciprocalRankFusion") || r.content.includes("rrfScore"));
+        assert.ok(hasRrf, "Should find RRF-related code");
+        console.log(`  'reciprocal rank fusion' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds LanceDB table management by concept", async () => {
+        const results = await searchCode("LanceDB table management", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasStore = results.some(r => r.filePath.includes("store") || r.content.includes("LanceDB") || r.content.includes("openTable") || r.content.includes("createTable"));
+        assert.ok(hasStore, "Should find LanceDB store code");
+        console.log(`  'LanceDB table management' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds heading-based markdown chunking", async () => {
+        const results = await searchCode("heading based markdown chunking", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasChunker = results.some(r => r.content.includes("chunkMarkdown") || r.content.includes("headingStack") || r.content.includes("splitWithOverlap"));
+        assert.ok(hasChunker, "Should find markdown chunking code");
+        console.log(`  'heading based markdown chunking' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds cross-encoder reranking", async () => {
+        const results = await searchCode("cross encoder reranking", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasReranker = results.some(r => r.filePath.includes("reranker") || r.content.includes("rerank") || r.content.includes("rerankerScore"));
+        assert.ok(hasReranker, "Should find reranker code");
+        console.log(`  'cross encoder reranking' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds file walker / gitignore logic", async () => {
+        const results = await searchCode("walk project files gitignore", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasWalker = results.some(r => r.filePath.includes("file-walker") || r.content.includes("walkProjectFiles") || r.content.includes("gitignore"));
+        assert.ok(hasWalker, "Should find file walker code");
+        console.log(`  'walk project files gitignore' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds DocStore class by name", async () => {
+        const results = await searchCode("DocStore class", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasDocStore = results.some(r => r.entityName === "DocStore" || r.content.includes("class DocStore"));
+        assert.ok(hasDocStore, "Should find DocStore class");
+        console.log(`  'DocStore class' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds AST parsing / tree-sitter code", async () => {
+        const results = await searchCode("tree sitter AST parsing", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasTreeSitter = results.some(r => r.content.includes("tree-sitter") || r.content.includes("Parser") || r.content.includes("rootNode"));
+        assert.ok(hasTreeSitter, "Should find tree-sitter AST code");
+        console.log(`  'tree sitter AST parsing' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    it("finds npm doc discovery logic", async () => {
+        const results = await searchCode("npm package documentation discovery", codeStore, { topK: 5 });
+        assert.ok(results.length > 0, "Expected at least 1 result");
+        const hasDiscovery = results.some(r => r.filePath.includes("discovery") || r.content.includes("npmRegistry") || r.content.includes("llms.txt") || r.content.includes("probeUrl"));
+        assert.ok(hasDiscovery, "Should find doc discovery code");
+        console.log(`  'npm package documentation discovery' → top: ${results[0].filePath}:${results[0].lineStart} (${results[0].entityName})`);
+    });
+    // --- Neighbor expansion tests ---
+    it("returns expanded content with neighbor chunks", async () => {
+        const results = await searchCode("reciprocal rank fusion", codeStore, { topK: 3 });
+        assert.ok(results.length > 0, "Expected results");
+        // At least one result should have neighbor content (longer than a single chunk)
+        // This is probabilistic — in a small codebase some results may not have adjacent chunks
+        console.log(`  Neighbor expansion: top result content length = ${results[0].content.length} chars`);
+    });
+    // --- Structure validation tests ---
+    it("returns results with valid CodeSearchResult structure", async () => {
+        const results = await searchCode("embed texts", codeStore, { topK: 3 });
+        for (const r of results) {
+            assert.equal(typeof r.score, "number");
+            assert.equal(typeof r.filePath, "string");
+            assert.equal(typeof r.language, "string");
+            assert.equal(typeof r.entityType, "string");
+            assert.equal(typeof r.entityName, "string");
+            assert.ok(Array.isArray(r.scopeChain));
+            assert.equal(typeof r.lineStart, "number");
+            assert.equal(typeof r.lineEnd, "number");
+            assert.equal(typeof r.content, "string");
+            assert.equal(typeof r.chunkId, "number");
+            assert.ok(r.content.length > 0);
+            assert.ok(r.lineStart >= 1, "lineStart should be 1-based");
+            assert.ok(r.lineEnd >= r.lineStart, "lineEnd >= lineStart");
+        }
+    });
+    it("returns scores in descending order", async () => {
+        const results = await searchCode("search pipeline", codeStore, { topK: 10 });
+        assert.ok(results.length > 1, "Expected multiple results");
+        for (let i = 1; i < results.length; i++) {
+            assert.ok(results[i - 1].score >= results[i].score, `Not sorted at [${i}]`);
+        }
+    });
+    // --- Filter tests ---
+    it("filters by language", async () => {
+        const results = await searchCode("function", codeStore, { language: "typescript", topK: 10 });
+        assert.ok(results.length > 0, "Expected results");
+        for (const r of results) {
+            assert.equal(r.language, "typescript");
+        }
+    });
+    it("filters by filePath", async () => {
+        const results = await searchCode("search", codeStore, { filePath: "src/search.ts", topK: 10 });
+        for (const r of results) {
+            assert.equal(r.filePath, "src/search.ts");
+        }
+    });
+    it("filters by entityType", async () => {
+        const results = await searchCode("store management", codeStore, { entityType: "class", topK: 10 });
+        // entityType filter may return 0 results if no classes match the query well
+        // Just verify that any returned results have the correct type
+        for (const r of results) {
+            assert.equal(r.entityType, "class");
+        }
+    });
+    // --- Metadata tests ---
+    it("tracks file metadata correctly", async () => {
+        const metadata = await codeStore.loadMetadata();
+        assert.ok(metadata.files.length > 0, "Should have indexed file metadata");
+        assert.equal(metadata.files.length, indexedFileCount);
+        for (const f of metadata.files) {
+            assert.ok(f.filePath.startsWith("src/"), `filePath should start with src/: ${f.filePath}`);
+            assert.equal(f.sha256.length, 64, "SHA-256 hex should be 64 chars");
+            assert.ok(f.chunkCount > 0, `chunkCount should be > 0 for ${f.filePath}`);
+            assert.ok(f.language === "typescript" || f.language === "javascript");
+            assert.ok(f.indexedAt, "indexedAt should be set");
+        }
+    });
+    it("getFileHash returns correct hash for indexed files", async () => {
+        const hash = await codeStore.getFileHash("src/rrf.ts");
+        assert.ok(hash, "Should have hash for src/rrf.ts");
+        assert.equal(hash.length, 64);
+        const missing = await codeStore.getFileHash("src/nonexistent.ts");
+        assert.equal(missing, undefined, "Should return undefined for non-indexed file");
+    });
+    it("getChunkById returns a valid chunk", async () => {
+        // Use a known chunk ID (first chunk should be id=1)
+        const chunk = await codeStore.getChunkById(1);
+        assert.ok(chunk, "Should find chunk with id 1");
+        assert.equal(chunk.id, 1);
+        assert.ok(chunk.text.length > 0);
+        assert.ok(chunk.filePath.startsWith("src/"));
+    });
+    it("isEmpty returns false after indexing", async () => {
+        const empty = await codeStore.isEmpty();
+        assert.equal(empty, false, "Store should not be empty after indexing");
+    });
+});
+//# sourceMappingURL=code.test.js.map