openlore 2.0.0

package/dist/core/analyzer/vector-index.d.ts

@@ -0,0 +1,92 @@
+/**
+ * VectorIndex
+ *
+ * Builds and queries a LanceDB vector index over the call graph functions.
+ * Each function is represented by a document combining its signature, docstring,
+ * file path, language, and topological metadata (fanIn/fanOut, hub, entry point).
+ *
+ * Storage: <outputDir>/vector-index/  (LanceDB database folder)
+ * Table name: "functions"
+ *
+ * Usage:
+ *   // Build (after openlore analyze --embed)
+ *   await VectorIndex.build(outputDir, nodes, signatures, hubIds, entryPointIds, embedSvc);
+ *
+ *   // Search
+ *   const results = await VectorIndex.search(outputDir, "authenticate user with JWT", embedSvc);
+ */
+import type { FunctionNode } from './call-graph.js';
+import type { FileSignatureMap } from './signature-extractor.js';
+import type { EmbeddingService } from './embedding-service.js';
+export interface FunctionRecord {
+    id: string;
+    name: string;
+    filePath: string;
+    className: string;
+    language: string;
+    signature: string;
+    docstring: string;
+    fanIn: number;
+    fanOut: number;
+    isHub: boolean;
+    isEntryPoint: boolean;
+    /** Concatenated text used for embedding */
+    text: string;
+    /** Embedding vector */
+    vector: number[];
+}
+export interface SearchResult {
+    record: Omit<FunctionRecord, 'vector'>;
+    /**
+     * Relevance score.  For hybrid search (default): RRF score, higher = more relevant.
+     * For dense-only search: cosine distance from LanceDB, lower = more similar.
+     */
+    score: number;
+}
+export declare class VectorIndex {
+    /**
+     * Build (or rebuild) the vector index from call graph nodes + signatures.
+     *
+     * When `incremental` is true and an existing index is found, only functions
+     * whose text has changed since the last build are re-embedded.  Unchanged
+     * functions reuse their cached vectors.  Pass `incremental: false` (or omit
+     * when no index exists) to do a full rebuild.
+     *
+     * Returns a summary of how many functions were embedded vs reused.
+     */
+    static build(outputDir: string, nodes: FunctionNode[], signatures: FileSignatureMap[], hubIds: Set<string>, entryPointIds: Set<string>, embedSvc: EmbeddingService, 
+    /** Optional map of filePath → source content for skeleton-based body indexing */
+    fileContents?: Map<string, string>, 
+    /** When true, reuse cached vectors for unchanged functions */
+    incremental?: boolean): Promise<{
+        embedded: number;
+        reused: number;
+    }>;
+    /**
+     * Hybrid search over the index: dense (ANN) + sparse (BM25) merged via RRF.
+     *
+     * Dense recall fetches top `limit*5` candidates from the vector index.
+     * Sparse recall scores the full corpus with BM25 (cached per session).
+     * Reciprocal Rank Fusion (RRF) combines both rankings into a single list.
+     *
+     * Set `hybrid: false` to use dense-only search (original behaviour).
+     * Returns up to `limit` results sorted by relevance (highest first).
+     */
+    static search(outputDir: string, query: string, embedSvc: EmbeddingService | null | undefined, opts?: {
+        limit?: number;
+        language?: string;
+        minFanIn?: number;
+        /** Enable hybrid dense+sparse retrieval via RRF (default: true when embedSvc available) */
+        hybrid?: boolean;
+    }): Promise<SearchResult[]>;
+    /**
+     * BM25-only search: used when no embedding service is available.
+     * Scores the full corpus with BM25 and returns the top `limit` results.
+     */
+    private static _bm25Only;
+    /**
+     * Returns true if a vector index has been built for this output directory.
+     */
+    static exists(outputDir: string): boolean;
+}
+//# sourceMappingURL=vector-index.d.ts.map

package/dist/core/analyzer/vector-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-index.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/vector-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAO/D,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,OAAO,CAAC;IACf,YAAY,EAAE,OAAO,CAAC;IACtB,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,uBAAuB;IACvB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IACvC;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAuKD,qBAAa,WAAW;IACtB;;;;;;;;;OASG;WACU,KAAK,CAChB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,EAAE,EACrB,UAAU,EAAE,gBAAgB,EAAE,EAC9B,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,EACnB,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,EAC1B,QAAQ,EAAE,gBAAgB;IAC1B,iFAAiF;IACjF,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAClC,8DAA8D;IAC9D,WAAW,UAAQ,GAClB,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAsIhD;;;;;;;;;OASG;WACU,MAAM,CACjB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,gBAAgB,GAAG,IAAI,GAAG,SAAS,EAC7C,IAAI,GAAE;QACJ,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,2FAA2F;QAC3F,MAAM,CAAC,EAAE,OAAO,CAAC;KACb,GACL,OAAO,CAAC,YAAY,EAAE,CAAC;IAuH1B;;;OAGG;mBACkB,SAAS;IAoD9B;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;CAG1C"}

package/dist/core/analyzer/vector-index.js

@@ -0,0 +1,451 @@
+/**
+ * VectorIndex
+ *
+ * Builds and queries a LanceDB vector index over the call graph functions.
+ * Each function is represented by a document combining its signature, docstring,
+ * file path, language, and topological metadata (fanIn/fanOut, hub, entry point).
+ *
+ * Storage: <outputDir>/vector-index/  (LanceDB database folder)
+ * Table name: "functions"
+ *
+ * Usage:
+ *   // Build (after openlore analyze --embed)
+ *   await VectorIndex.build(outputDir, nodes, signatures, hubIds, entryPointIds, embedSvc);
+ *
+ *   // Search
+ *   const results = await VectorIndex.search(outputDir, "authenticate user with JWT", embedSvc);
+ */
+import { existsSync } from 'node:fs';
+import { join } from 'node:path';
+import { getSkeletonContent, isSkeletonWorthIncluding } from './code-shaper.js';
+// ============================================================================
+// CONSTANTS
+// ============================================================================
+const DB_FOLDER = 'vector-index';
+const TABLE_NAME = 'functions';
+/** Convert a raw LanceDB row to a FunctionRecord (without the vector field). */
+function rowToRecord(row) {
+    return {
+        id: row.id,
+        name: row.name,
+        filePath: row.filePath,
+        className: row.className,
+        language: row.language,
+        signature: row.signature,
+        docstring: row.docstring,
+        fanIn: row.fanIn,
+        fanOut: row.fanOut,
+        isHub: row.isHub,
+        isEntryPoint: row.isEntryPoint,
+        text: row.text,
+    };
+}
+function tokenize(text) {
+    // Split on non-alphanumeric, keep tokens longer than 1 char
+    return text.toLowerCase().split(/[^a-z0-9]+/).filter(t => t.length > 1);
+}
+function buildBm25Corpus(records) {
+    const docs = [];
+    const df = new Map();
+    let totalLen = 0;
+    for (const r of records) {
+        const tokens = tokenize(r.text);
+        const tfMap = new Map();
+        for (const t of tokens)
+            tfMap.set(t, (tfMap.get(t) ?? 0) + 1);
+        docs.push({ id: r.id, tfMap, length: tokens.length });
+        totalLen += tokens.length;
+        for (const t of tfMap.keys())
+            df.set(t, (df.get(t) ?? 0) + 1);
+    }
+    return { docs, df, avgLength: docs.length > 0 ? totalLen / docs.length : 1, N: docs.length };
+}
+const BM25_K1 = 1.2;
+const BM25_B = 0.75;
+function bm25Score(corpus, queryTokens, docIdx) {
+    const doc = corpus.docs[docIdx];
+    let score = 0;
+    for (const q of queryTokens) {
+        const df = corpus.df.get(q) ?? 0;
+        if (df === 0)
+            continue;
+        const idf = Math.log((corpus.N - df + 0.5) / (df + 0.5) + 1);
+        const tf = doc.tfMap.get(q) ?? 0;
+        const tfNorm = (tf * (BM25_K1 + 1)) /
+            (tf + BM25_K1 * (1 - BM25_B + BM25_B * (doc.length / corpus.avgLength)));
+        score += idf * tfNorm;
+    }
+    return score;
+}
+/**
+ * Reciprocal Rank Fusion: merges two ranked lists into a single relevance score.
+ * k=60 is the standard parameter (Cormack et al., 2009).
+ */
+function rrfScore(rankDense, rankSparse, k = 60) {
+    return 1 / (k + rankDense + 1) + 1 / (k + rankSparse + 1);
+}
+// Module-level BM25 corpus cache: avoids a full table scan on every search call
+// when the index hasn't changed.  Keyed by dbPath; invalidated when row count changes.
+const _bm25Cache = new Map();
+// ============================================================================
+// HELPERS
+// ============================================================================
+/**
+ * Build the text to embed for a function.
+ * Combines language, path, qualified name, signature, docstring, and skeleton body.
+ */
+function buildText(node, signature, docstring, fileContents) {
+    const qualifiedName = node.className
+        ? `${node.className}.${node.name}`
+        : node.name;
+    const parts = [`[${node.language}] ${node.filePath} ${qualifiedName}`];
+    if (signature)
+        parts.push(signature);
+    if (docstring)
+        parts.push(docstring);
+    // Append skeleton body when file contents are available.
+    // The skeleton strips noise (logs, comments) while preserving business-logic signals
+    // (variable names, control flow, calls, return/throw). Only included when it provides
+    // meaningful reduction over the raw body (≥20% smaller).
+    if (fileContents && node.startIndex < node.endIndex) {
+        const src = fileContents.get(node.filePath);
+        if (src) {
+            const body = src.slice(node.startIndex, node.endIndex);
+            if (body.trim()) {
+                const skeleton = getSkeletonContent(body, node.language);
+                if (isSkeletonWorthIncluding(body, skeleton)) {
+                    parts.push(skeleton);
+                }
+            }
+        }
+    }
+    return parts.join('\n');
+}
+/**
+ * Build a lookup map: filePath → entries[] from FileSignatureMap[]
+ */
+function buildSignatureIndex(signatures) {
+    const index = new Map();
+    for (const fsm of signatures) {
+        index.set(fsm.path, fsm.entries);
+    }
+    return index;
+}
+/**
+ * Find the best matching signature entry for a FunctionNode.
+ */
+function findSignatureEntry(node, sigIndex) {
+    const entries = sigIndex.get(node.filePath) ?? [];
+    const match = entries.find(e => e.name === node.name);
+    if (!match)
+        return { signature: '', docstring: '' };
+    return {
+        signature: match.signature ?? '',
+        docstring: match.docstring ?? '',
+    };
+}
+// ============================================================================
+// VECTOR INDEX
+// ============================================================================
+export class VectorIndex {
+    /**
+     * Build (or rebuild) the vector index from call graph nodes + signatures.
+     *
+     * When `incremental` is true and an existing index is found, only functions
+     * whose text has changed since the last build are re-embedded.  Unchanged
+     * functions reuse their cached vectors.  Pass `incremental: false` (or omit
+     * when no index exists) to do a full rebuild.
+     *
+     * Returns a summary of how many functions were embedded vs reused.
+     */
+    static async build(outputDir, nodes, signatures, hubIds, entryPointIds, embedSvc, 
+    /** Optional map of filePath → source content for skeleton-based body indexing */
+    fileContents, 
+    /** When true, reuse cached vectors for unchanged functions */
+    incremental = false) {
+        const { connect } = await import('@lancedb/lancedb');
+        if (nodes.length === 0) {
+            throw new Error('No functions to index');
+        }
+        const sigIndex = buildSignatureIndex(signatures);
+        // Build candidate records (without vectors)
+        const nodeIds = new Set(nodes.map(n => n.id));
+        const candidates = nodes.map(node => {
+            const cgDoc = node.docstring ?? '';
+            const cgSig = node.signature ?? '';
+            // Always check regex index as fallback — CG may miss docstrings when
+            // startIndex points inside an export_statement (past the `export` keyword),
+            // causing extractDocstringBefore to scan into the export keyword instead of
+            // reaching the JSDoc block above it.
+            const { signature: regexSig, docstring: regexDoc } = findSignatureEntry(node, sigIndex);
+            const signature = cgSig || regexSig;
+            const docstring = cgDoc || regexDoc;
+            return {
+                id: node.id,
+                name: node.name,
+                filePath: node.filePath,
+                className: node.className ?? '',
+                language: node.language,
+                signature,
+                docstring,
+                fanIn: node.fanIn,
+                fanOut: node.fanOut,
+                isHub: hubIds.has(node.id),
+                isEntryPoint: entryPointIds.has(node.id),
+                text: buildText(node, signature, docstring, fileContents),
+            };
+        });
+        // Also index signature entries that have no call graph node (constants, type aliases, etc.)
+        for (const fsm of signatures) {
+            for (const entry of fsm.entries) {
+                const syntheticId = `${fsm.path}::${entry.name}`;
+                if (nodeIds.has(syntheticId))
+                    continue; // already covered by call graph
+                // Skip if any call graph node from this file matches the name
+                if (nodes.some(n => n.filePath === fsm.path && n.name === entry.name))
+                    continue;
+                const sig = entry.signature ?? '';
+                const doc = entry.docstring ?? '';
+                candidates.push({
+                    id: syntheticId,
+                    name: entry.name,
+                    filePath: fsm.path,
+                    className: '',
+                    language: fsm.language,
+                    signature: sig,
+                    docstring: doc,
+                    fanIn: 0,
+                    fanOut: 0,
+                    isHub: false,
+                    isEntryPoint: false,
+                    text: `[${fsm.language}] ${fsm.path} ${entry.name}\n${sig}${doc ? '\n' + doc : ''}`,
+                });
+            }
+        }
+        // ── Incremental cache lookup ─────────────────────────────────────────────
+        const dbPath = join(outputDir, DB_FOLDER);
+        let cachedVectors = new Map(); // id → vector
+        if (incremental && VectorIndex.exists(outputDir)) {
+            try {
+                const db = await connect(dbPath);
+                const table = await db.openTable(TABLE_NAME);
+                // Full table scan to load existing vectors
+                const existing = await table.query().toArray();
+                for (const row of existing) {
+                    const id = row.id;
+                    const text = row.text;
+                    // Convert Arrow typed arrays (Float32Array etc.) to plain number[]
+                    // so LanceDB can re-infer the schema when writing back
+                    const vector = Array.from(row.vector);
+                    // Cache the vector keyed by "id::text" so a text change invalidates it
+                    cachedVectors.set(`${id}::${text}`, vector);
+                }
+            }
+            catch {
+                // Existing index unreadable — fall back to full build
+                cachedVectors = new Map();
+            }
+        }
+        // ── Split into cached vs needs-embedding ────────────────────────────────
+        const toEmbed = [];
+        const toEmbedIdx = []; // index into `candidates`
+        const cachedIdx = [];
+        for (let i = 0; i < candidates.length; i++) {
+            const r = candidates[i];
+            const cacheKey = `${r.id}::${r.text}`;
+            if (cachedVectors.has(cacheKey)) {
+                cachedIdx.push(i);
+            }
+            else {
+                toEmbed.push(r);
+                toEmbedIdx.push(i);
+            }
+        }
+        // ── Embed only changed / new functions ───────────────────────────────────
+        let newVectors = [];
+        if (toEmbed.length > 0) {
+            newVectors = await embedSvc.embed(toEmbed.map(r => r.text));
+            if (newVectors.length !== toEmbed.length) {
+                throw new Error(`Embedding count mismatch: expected ${toEmbed.length}, got ${newVectors.length}`);
+            }
+        }
+        // ── Assemble final records ───────────────────────────────────────────────
+        const fullRecords = new Array(candidates.length);
+        for (let i = 0; i < cachedIdx.length; i++) {
+            const idx = cachedIdx[i];
+            const r = candidates[idx];
+            fullRecords[idx] = { ...r, vector: cachedVectors.get(`${r.id}::${r.text}`) };
+        }
+        for (let i = 0; i < toEmbedIdx.length; i++) {
+            const idx = toEmbedIdx[i];
+            fullRecords[idx] = { ...candidates[idx], vector: newVectors[i] };
+        }
+        // ── Write table ──────────────────────────────────────────────────────────
+        const db = await connect(dbPath);
+        await db.createTable(TABLE_NAME, fullRecords, { mode: 'overwrite' });
+        return { embedded: toEmbed.length, reused: cachedIdx.length };
+    }
+    /**
+     * Hybrid search over the index: dense (ANN) + sparse (BM25) merged via RRF.
+     *
+     * Dense recall fetches top `limit*5` candidates from the vector index.
+     * Sparse recall scores the full corpus with BM25 (cached per session).
+     * Reciprocal Rank Fusion (RRF) combines both rankings into a single list.
+     *
+     * Set `hybrid: false` to use dense-only search (original behaviour).
+     * Returns up to `limit` results sorted by relevance (highest first).
+     */
+    static async search(outputDir, query, embedSvc, opts = {}) {
+        const { connect } = await import('@lancedb/lancedb');
+        const { limit = 10, language, minFanIn, hybrid = true } = opts;
+        if (!VectorIndex.exists(outputDir)) {
+            throw new Error('Vector index not found. Run "openlore analyze --embed" first.');
+        }
+        const dbPath = join(outputDir, DB_FOLDER);
+        const db = await connect(dbPath);
+        const table = await db.openTable(TABLE_NAME);
+        // ── BM25-only path (no embedding service available) ───────────────────────
+        if (!embedSvc) {
+            return VectorIndex._bm25Only(table, dbPath, query, limit, language, minFanIn);
+        }
+        // ── Dense recall ──────────────────────────────────────────────────────────
+        let queryVector;
+        try {
+            [queryVector] = await embedSvc.embed([query]);
+        }
+        catch {
+            // Embedding server unreachable — fall back to BM25
+            return VectorIndex._bm25Only(table, dbPath, query, limit, language, minFanIn);
+        }
+        if (!queryVector)
+            throw new Error('Failed to embed query');
+        const denseFetch = hybrid ? Math.min(limit * 5, 500) : Math.min(limit * 10, 1000);
+        const denseRows = await table.query().nearestTo(queryVector).limit(denseFetch).toArray();
+        const passesFilters = (row) => {
+            if (language && row.language !== language)
+                return false;
+            if (minFanIn !== undefined && minFanIn > 0 && row.fanIn < minFanIn)
+                return false;
+            return true;
+        };
+        // ── Dense-only path ───────────────────────────────────────────────────────
+        if (!hybrid) {
+            return denseRows
+                .filter(passesFilters)
+                .slice(0, limit)
+                .map(row => ({ record: rowToRecord(row), score: row._distance }));
+        }
+        // ── Sparse recall (BM25 over full corpus) ─────────────────────────────────
+        let cachedEntry = _bm25Cache.get(dbPath);
+        let allRows;
+        if (!cachedEntry) {
+            allRows = await table.query().toArray();
+            const corpus = buildBm25Corpus(allRows.map(r => ({ id: r.id, text: r.text })));
+            cachedEntry = { corpus, rowCount: allRows.length };
+            _bm25Cache.set(dbPath, cachedEntry);
+        }
+        else {
+            // Lightweight cache validation: re-scan only if row count has changed
+            allRows = await table.query().toArray();
+            if (allRows.length !== cachedEntry.rowCount) {
+                const corpus = buildBm25Corpus(allRows.map(r => ({ id: r.id, text: r.text })));
+                cachedEntry = { corpus, rowCount: allRows.length };
+                _bm25Cache.set(dbPath, cachedEntry);
+            }
+        }
+        const { corpus } = cachedEntry;
+        const queryTokens = tokenize(query);
+        // Score all corpus documents with BM25
+        const sparseScored = corpus.docs
+            .map((_, i) => ({ idx: i, score: bm25Score(corpus, queryTokens, i) }))
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit * 5);
+        // Build id→row map from allRows for sparse candidates
+        const rowById = new Map(allRows.map(r => [r.id, r]));
+        // ── RRF merge ────────────────────────────────────────────────────────────
+        const rrfMap = new Map();
+        denseRows.forEach((row, rank) => {
+            const id = row.id;
+            const entry = rrfMap.get(id) ?? { row, score: 0 };
+            entry.score += rrfScore(rank, Infinity); // sparse rank = Infinity if not in sparse list
+            rrfMap.set(id, entry);
+        });
+        sparseScored.forEach(({ idx, score: bm25 }, rank) => {
+            if (bm25 === 0)
+                return; // no BM25 signal — skip
+            const id = corpus.docs[idx].id;
+            const row = rowById.get(id);
+            if (!row)
+                return;
+            const entry = rrfMap.get(id) ?? { row, score: 0 };
+            entry.score += 1 / (60 + rank + 1);
+            rrfMap.set(id, entry);
+        });
+        // Fix dense ranks now that we know the full picture
+        // Re-compute proper RRF scores with both ranks available
+        const denseRankById = new Map(denseRows.map((r, i) => [r.id, i]));
+        const sparseRankById = new Map(sparseScored.map(({ idx }, i) => [corpus.docs[idx].id, i]));
+        const merged = [...rrfMap.values()].map(({ row }) => {
+            const id = row.id;
+            const dr = denseRankById.get(id) ?? Infinity;
+            const sr = sparseRankById.get(id) ?? Infinity;
+            return { row, score: rrfScore(dr, sr) };
+        });
+        return merged
+            .sort((a, b) => b.score - a.score)
+            .filter(({ row }) => passesFilters(row))
+            .slice(0, limit)
+            .map(({ row, score }) => ({ record: rowToRecord(row), score }));
+    }
+    /**
+     * BM25-only search: used when no embedding service is available.
+     * Scores the full corpus with BM25 and returns the top `limit` results.
+     */
+    static async _bm25Only(table, dbPath, query, limit, language, minFanIn) {
+        let cachedEntry = _bm25Cache.get(dbPath);
+        let allRows;
+        if (!cachedEntry) {
+            allRows = await table.query().toArray();
+            const corpus = buildBm25Corpus(allRows.map(r => ({ id: r.id, text: r.text })));
+            cachedEntry = { corpus, rowCount: allRows.length };
+            _bm25Cache.set(dbPath, cachedEntry);
+        }
+        else {
+            allRows = await table.query().toArray();
+            if (allRows.length !== cachedEntry.rowCount) {
+                const corpus = buildBm25Corpus(allRows.map(r => ({ id: r.id, text: r.text })));
+                cachedEntry = { corpus, rowCount: allRows.length };
+                _bm25Cache.set(dbPath, cachedEntry);
+            }
+        }
+        const { corpus } = cachedEntry;
+        const queryTokens = tokenize(query);
+        const rowById = new Map(allRows.map(r => [r.id, r]));
+        return corpus.docs
+            .map((_, i) => ({ idx: i, score: bm25Score(corpus, queryTokens, i) }))
+            .filter(({ score }) => score > 0)
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit * 3) // oversample before filtering
+            .map(({ idx, score }) => {
+            const row = rowById.get(corpus.docs[idx].id);
+            return row ? { row, score } : null;
+        })
+            .filter((x) => x !== null)
+            .filter(({ row }) => {
+            if (language && row.language !== language)
+                return false;
+            if (minFanIn !== undefined && minFanIn > 0 && row.fanIn < minFanIn)
+                return false;
+            return true;
+        })
+            .slice(0, limit)
+            .map(({ row, score }) => ({ record: rowToRecord(row), score }));
+    }
+    /**
+     * Returns true if a vector index has been built for this output directory.
+     */
+    static exists(outputDir) {
+        return existsSync(join(outputDir, DB_FOLDER));
+    }
+}
+//# sourceMappingURL=vector-index.js.map

package/dist/core/analyzer/vector-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-index.js","sourceRoot":"","sources":["../../../src/core/analyzer/vector-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAIjC,OAAO,EAAE,kBAAkB,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAC;AAiChF,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,MAAM,SAAS,GAAG,cAAc,CAAC;AACjC,MAAM,UAAU,GAAG,WAAW,CAAC;AAE/B,gFAAgF;AAChF,SAAS,WAAW,CAAC,GAA4B;IAC/C,OAAO;QACL,EAAE,EAAW,GAAG,CAAC,EAAY;QAC7B,IAAI,EAAS,GAAG,CAAC,IAAc;QAC/B,QAAQ,EAAK,GAAG,CAAC,QAAkB;QACnC,SAAS,EAAI,GAAG,CAAC,SAAmB;QACpC,QAAQ,EAAK,GAAG,CAAC,QAAkB;QACnC,SAAS,EAAI,GAAG,CAAC,SAAmB;QACpC,SAAS,EAAI,GAAG,CAAC,SAAmB;QACpC,KAAK,EAAQ,GAAG,CAAC,KAAe;QAChC,MAAM,EAAO,GAAG,CAAC,MAAgB;QACjC,KAAK,EAAQ,GAAG,CAAC,KAAgB;QACjC,YAAY,EAAE,GAAG,CAAC,YAAuB;QACzC,IAAI,EAAS,GAAG,CAAC,IAAc;KAChC,CAAC;AACJ,CAAC;AAcD,SAAS,QAAQ,CAAC,IAAY;IAC5B,4DAA4D;IAC5D,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,eAAe,CAAC,OAA4C;IACnE,MAAM,IAAI,GAAuB,EAAE,CAAC;IACpC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACtD,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE;YAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;AAC/F,CAAC;AAED,MAAM,OAAO,GAAG,GAAG,CAAC;AACpB,MAAM,MAAM,GAAI,IAAI,CAAC;AAErB,SAAS,SAAS,CAAC,MAAkB,EAAE,WAAqB,EAAE,MAAc;IAC1E,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,MAAM,GACV,CAAC,EAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACpB,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3E,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,SAAiB,EAAE,UAAkB,EAAE,CAAC,GAAG,EAAE;IAC7D,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,gFAAgF;AAChF,uFAAuF;AACvF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoD,CAAC;AAE/E,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,SAAS,CAChB,IAAkB,EAClB,SAAiB,EACjB,SAAiB,EACjB,YAAkC;IAElC,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS;QAClC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE;QAClC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAEd,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,aAAa,EAAE,CAAC,CAAC;IACvE,IAAI,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrC,IAAI,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAErC,yDAAyD;IACzD,qFAAqF;IACrF,sFAAsF;IACtF,yDAAyD;IACzD,IAAI,YAAY,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpD,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,GAAG,EAAE,CAAC;YACR,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvD,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAChB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzD,IAAI,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC1B,UAA8B;IAE9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC7D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,IAAkB,EAClB,QAAkD;IAElD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAClD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IACpD,OAAO;QACL,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,EAAE;QAChC,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,EAAE;KACjC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,eAAe;AACf,+EAA+E;AAE/E,MAAM,OAAO,WAAW;IACtB;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,CAChB,SAAiB,EACjB,KAAqB,EACrB,UAA8B,EAC9B,MAAmB,EACnB,aAA0B,EAC1B,QAA0B;IAC1B,iFAAiF;IACjF,YAAkC;IAClC,8DAA8D;IAC9D,WAAW,GAAG,KAAK;QAEnB,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAErD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3C,CAAC;QAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAEjD,4CAA4C;QAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAqC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACpE,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;YACnC,qEAAqE;YACrE,4EAA4E;YAC5E,4EAA4E;YAC5E,qCAAqC;YACrC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACxF,MAAM,SAAS,GAAG,KAAK,IAAI,QAAQ,CAAC;YACpC,MAAM,SAAS,GAAG,KAAK,IAAI,QAAQ,CAAC;YACpC,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;gBAC/B,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,SAAS;gBACT,SAAS;gBACT,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,YAAY,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC;aAC1D,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,4FAA4F;QAC5F,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;gBAChC,MAAM,WAAW,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBACjD,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC;oBAAE,SAAS,CAAC,gCAAgC;gBACxE,8DAA8D;gBAC9D,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAChF,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;gBAClC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;gBAClC,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,WAAW;oBACf,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,QAAQ,EAAE,GAAG,CAAC,IAAI;oBAClB,SAAS,EAAE,EAAE;oBACb,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,SAAS,EAAE,GAAG;oBACd,SAAS,EAAE,GAAG;oBACd,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,CAAC;oBACT,KAAK,EAAE,KAAK;oBACZ,YAAY,EAAE,KAAK;oBACnB,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;iBACpF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,cAAc;QAE/D,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBAC7C,2CAA2C;gBAC3C,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;gBAC/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;oBAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,EAAY,CAAC;oBAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAc,CAAC;oBAChC,mEAAmE;oBACnE,uDAAuD;oBACvD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAA2B,CAAC,CAAC;oBAC3D,uEAAuE;oBACvE,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,sDAAsD;gBACtD,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,UAAU,GAAa,EAAE,CAAC,CAAC,0BAA0B;QAC3D,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,IAAI,UAAU,GAAe,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,UAAU,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5D,IAAI,UAAU,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CACb,sCAAsC,OAAO,CAAC,MAAM,SAAS,UAAU,CAAC,MAAM,EAAE,CACjF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,MAAM,WAAW,GAAqB,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YAC1B,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAE,EAAE,CAAC;QAChF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,CAAC;QAED,4EAA4E;QAC5E,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,WAAmD,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;QAE7G,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC;IAChE,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CACjB,SAAiB,EACjB,KAAa,EACb,QAA6C,EAC7C,OAMI,EAAE;QAEN,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAErD,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;QAE/D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;QACnF,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE7C,6EAA6E;QAC7E,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAChF,CAAC;QAED,6EAA6E;QAC7E,IAAI,WAAqB,CAAC;QAC1B,IAAI,CAAC;YACH,CAAC,WAAW,CAAC,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAChD,CAAC;QAAC,MAAM,CAAC;YACP,mDAAmD;YACnD,OAAO,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAChF,CAAC;QACD,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAE3D,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;QAClF,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;QAEzF,MAAM,aAAa,GAAG,CAAC,GAA4B,EAAW,EAAE;YAC9D,IAAI,QAAQ,IAAK,GAAG,CAAC,QAAmB,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACpE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,CAAC,IAAK,GAAG,CAAC,KAAgB,GAAG,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAC7F,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,6EAA6E;QAC7E,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,SAAS;iBACb,MAAM,CAAC,aAAa,CAAC;iBACrB,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;iBACf,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,SAAmB,EAAE,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,6EAA6E;QAC7E,IAAI,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,OAAkC,CAAC;QAEvC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,eAAe,CAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAY,EAAE,IAAI,EAAE,CAAC,CAAC,IAAc,EAAE,CAAC,CAAC,CACnE,CAAC;YACF,WAAW,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,sEAAsE;YACtE,OAAO,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC,QAAQ,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,eAAe,CAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAY,EAAE,IAAI,EAAE,CAAC,CAAC,IAAc,EAAE,CAAC,CAAC,CACnE,CAAC;gBACF,WAAW,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,MAAM,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC;QAC/B,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEpC,uCAAuC;QACvC,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACrE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAEvB,sDAAsD;QACtD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,4EAA4E;QAC5E,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2D,CAAC;QAElF,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,EAAY,CAAC;YAC5B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAClD,KAAK,CAAC,KAAK,IAAI,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,+CAA+C;YACxF,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE;YAClD,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO,CAAC,wBAAwB;YAChD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG;gBAAE,OAAO;YACjB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAClD,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,oDAAoD;QACpD,yDAAyD;QACzD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3F,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;YAClD,MAAM,EAAE,GAAG,GAAG,CAAC,EAAY,CAAC;YAC5B,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;YAC7C,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;YAC9C,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM;aACV,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;aACvC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,KAAK,CAAC,SAAS,CAC5B,KAAqE,EACrE,MAAc,EACd,KAAa,EACb,KAAa,EACb,QAAiB,EACjB,QAAiB;QAEjB,IAAI,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,OAAkC,CAAC;QAEvC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,eAAe,CAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAY,EAAE,IAAI,EAAE,CAAC,CAAC,IAAc,EAAE,CAAC,CAAC,CACnE,CAAC;YACF,WAAW,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC,QAAQ,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,eAAe,CAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAY,EAAE,IAAI,EAAE,CAAC,CAAC,IAAc,EAAE,CAAC,CAAC,CACnE,CAAC;gBACF,WAAW,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,MAAM,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC;QAC/B,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,OAAO,MAAM,CAAC,IAAI;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACrE,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;aAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,8BAA8B;aAClD,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE;YACtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACrC,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAwD,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC;aAC/E,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;YAClB,IAAI,QAAQ,IAAK,GAAG,CAAC,QAAmB,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACpE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,CAAC,IAAK,GAAG,CAAC,KAAgB,GAAG,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAC7F,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,SAAiB;QAC7B,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;IAChD,CAAC;CACF"}

package/dist/core/decisions/consolidator.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Decision consolidator
+ *
+ * Calls LLM to merge/resolve draft decisions from a session into a clean set.
+ * Resolves contradictions and collapses superseded decisions.
+ */
+import type { LLMService } from '../services/llm-service.js';
+import type { PendingDecision, DecisionStore, SpecMap } from '../../types/index.js';
+export interface ConsolidateResult {
+    decisions: PendingDecision[];
+    supersededIds: string[];
+}
+export declare function consolidateDrafts(store: DecisionStore, llm: LLMService, specMap?: SpecMap): Promise<ConsolidateResult>;
+//# sourceMappingURL=consolidator.d.ts.map

package/dist/core/decisions/consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../../src/core/decisions/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,OAAO,EAAiB,MAAM,sBAAsB,CAAC;AAkFnG,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,eAAe,EAAE,CAAC;IAC7B,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,wBAAsB,iBAAiB,CACrC,KAAK,EAAE,aAAa,EACpB,GAAG,EAAE,UAAU,EACf,OAAO,CAAC,EAAE,OAAO,GAChB,OAAO,CAAC,iBAAiB,CAAC,CAiF5B"}