@mcp-graph-workflow/mcp-graph 5.6.0 → 5.7.0

package/dist/core/rag/citation-mapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"citation-mapper.d.ts","sourceRoot":"","sources":["../../../src/core/rag/citation-mapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAGlE,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAID;;;GAGG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,QAAQ,EAAE,CAahE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,YAAY,CAoBvE"}

package/dist/core/rag/citation-mapper.js

@@ -0,0 +1,45 @@
+/**
+ * Citation Mapper — maps search results to citations with source traceability.
+ *
+ * Each chunk in the assembled context gets a [N] citation marker,
+ * enabling users to trace information back to its source.
+ */
+import { generateId } from "../utils/id.js";
+const MAX_SNIPPET_LENGTH = 400;
+/**
+ * Create citations from ranked results.
+ * Each result gets a position-based citation (1-indexed).
+ */
+export function mapCitations(results) {
+    return results.map((r, i) => ({
+        id: generateId("cite"),
+        chunkId: r.id,
+        sourceType: r.sourceType,
+        sourceId: r.sourceId,
+        title: r.title,
+        snippet: r.content.length > MAX_SNIPPET_LENGTH
+            ? r.content.slice(0, MAX_SNIPPET_LENGTH)
+            : r.content,
+        relevanceScore: r.score,
+        position: i + 1,
+    }));
+}
+/**
+ * Build a cited context: assembled text with [N] markers + citation list + source breakdown.
+ */
+export function buildCitedContext(results) {
+    if (results.length === 0) {
+        return { assembledText: "", citations: [], sourceBreakdown: {} };
+    }
+    const citations = mapCitations(results);
+    const sourceBreakdown = {};
+    const textParts = [];
+    for (let i = 0; i < results.length; i++) {
+        const r = results[i];
+        textParts.push(`[${i + 1}] ${r.content}`);
+        sourceBreakdown[r.sourceType] = (sourceBreakdown[r.sourceType] ?? 0) + 1;
+    }
+    const assembledText = textParts.join("\n\n");
+    return { assembledText, citations, sourceBreakdown };
+}
+//# sourceMappingURL=citation-mapper.js.map

package/dist/core/rag/citation-mapper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"citation-mapper.js","sourceRoot":"","sources":["../../../src/core/rag/citation-mapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAmB5C,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,OAAuB;IAClD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC;QACtB,OAAO,EAAE,CAAC,CAAC,EAAE;QACb,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,kBAAkB;YAC5C,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;YACxC,CAAC,CAAC,CAAC,CAAC,OAAO;QACb,cAAc,EAAE,CAAC,CAAC,KAAK;QACvB,QAAQ,EAAE,CAAC,GAAG,CAAC;KAChB,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAuB;IACvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,aAAa,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;IACnE,CAAC;IAED,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,eAAe,GAA2B,EAAE,CAAC;IAEnD,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAE1C,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,aAAa,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAE7C,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC;AACvD,CAAC"}

package/dist/core/rag/enrichment-pipeline.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Enrichment Pipeline — enriches text chunks with keywords, entities, and summaries
+ * before indexation into the knowledge store.
+ *
+ * Transforms raw TextChunks into EnrichedChunks with:
+ * - TF-IDF-based keyword extraction (top-N terms)
+ * - Regex-based entity detection (PascalCase, camelCase, file paths)
+ * - Auto-generated summary (first sentence or markdown heading)
+ * - Parent-child chunk linking for later chunk stitching
+ */
+import type { TextChunk } from "./chunk-text.js";
+export interface EnrichedChunk extends TextChunk {
+    /** Top-N keywords extracted via TF-IDF term frequency */
+    keywords: string[];
+    /** Detected entities: class names, function names, file paths */
+    entities: string[];
+    /** Auto-generated summary (first sentence or heading) */
+    summary: string;
+    /** Source type discriminator */
+    sourceType: string;
+    /** Reference to parent chunk index for chunk stitching */
+    parentChunkIndex?: number;
+}
+/**
+ * Extract top-N keywords from text using term frequency scoring.
+ * Uses the project tokenizer (handles PT + EN, strips stopwords).
+ */
+export declare function extractKeywords(text: string, topN?: number): string[];
+/**
+ * Extract named entities from text using regex patterns.
+ * Detects PascalCase types, camelCase functions, and file paths.
+ */
+export declare function extractEntities(text: string): string[];
+/**
+ * Generate a short summary from chunk content.
+ * Prefers markdown heading if present, otherwise first sentence.
+ */
+export declare function generateSummary(text: string): string;
+/**
+ * Enrich a single text chunk with keywords, entities, summary, and source metadata.
+ */
+export declare function enrichChunk(chunk: TextChunk, sourceType: string, parentChunkIndex?: number): EnrichedChunk;
+/**
+ * Enrich multiple chunks from the same document.
+ * Applies parent-child linking for multi-chunk documents.
+ */
+export declare function enrichChunks(chunks: TextChunk[], sourceType: string): EnrichedChunk[];
+//# sourceMappingURL=enrichment-pipeline.d.ts.map

package/dist/core/rag/enrichment-pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"enrichment-pipeline.d.ts","sourceRoot":"","sources":["../../../src/core/rag/enrichment-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAIjD,MAAM,WAAW,aAAc,SAAQ,SAAS;IAC9C,yDAAyD;IACzD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,iEAAiE;IACjE,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,yDAAyD;IACzD,OAAO,EAAE,MAAM,CAAC;IAChB,gCAAgC;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAKD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE,MAAsB,GAAG,MAAM,EAAE,CAepF;AAcD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAwBtD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CA0BpD;AAED;;GAEG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,EAChB,UAAU,EAAE,MAAM,EAClB,gBAAgB,CAAC,EAAE,MAAM,GACxB,aAAa,CAoBf;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,SAAS,EAAE,EACnB,UAAU,EAAE,MAAM,GACjB,aAAa,EAAE,CASjB"}

package/dist/core/rag/enrichment-pipeline.js

@@ -0,0 +1,127 @@
+/**
+ * Enrichment Pipeline — enriches text chunks with keywords, entities, and summaries
+ * before indexation into the knowledge store.
+ *
+ * Transforms raw TextChunks into EnrichedChunks with:
+ * - TF-IDF-based keyword extraction (top-N terms)
+ * - Regex-based entity detection (PascalCase, camelCase, file paths)
+ * - Auto-generated summary (first sentence or markdown heading)
+ * - Parent-child chunk linking for later chunk stitching
+ */
+import { tokenize } from "../search/tokenizer.js";
+import { logger } from "../utils/logger.js";
+const MAX_SUMMARY_LENGTH = 200;
+const DEFAULT_TOP_N = 5;
+/**
+ * Extract top-N keywords from text using term frequency scoring.
+ * Uses the project tokenizer (handles PT + EN, strips stopwords).
+ */
+export function extractKeywords(text, topN = DEFAULT_TOP_N) {
+    const tokens = tokenize(text);
+    if (tokens.length === 0)
+        return [];
+    // Count term frequencies
+    const freq = new Map();
+    for (const token of tokens) {
+        freq.set(token, (freq.get(token) ?? 0) + 1);
+    }
+    // Sort by frequency descending, then alphabetically for stability
+    const sorted = Array.from(freq.entries())
+        .sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]));
+    return sorted.slice(0, topN).map(([term]) => term);
+}
+// ── Entity detection patterns ──────────────────────────────
+/** PascalCase: at least two words joined (e.g., GraphNode, SqliteStore) */
+// eslint-disable-next-line security/detect-unsafe-regex -- bounded pattern, safe for short identifiers
+const PASCAL_CASE_RE = /\b([A-Z][a-z]+(?:[A-Z][a-z0-9]*)+)\b/g;
+/** camelCase: starts lowercase, has at least one uppercase (e.g., findNextTask) */
+const CAMEL_CASE_RE = /\b([a-z][a-zA-Z0-9]*[A-Z][a-zA-Z0-9]*)\b/g;
+/** File paths: src/... or similar path patterns ending in common extensions */
+const FILE_PATH_RE = /\b((?:src|lib|dist|test|tests)\/[\w\-./]+\.(?:ts|js|tsx|jsx|json|md|sql))\b/g;
+/**
+ * Extract named entities from text using regex patterns.
+ * Detects PascalCase types, camelCase functions, and file paths.
+ */
+export function extractEntities(text) {
+    const entities = new Set();
+    let match;
+    // PascalCase (reset lastIndex before each scan)
+    PASCAL_CASE_RE.lastIndex = 0;
+    while ((match = PASCAL_CASE_RE.exec(text)) !== null) {
+        entities.add(match[1]);
+    }
+    // camelCase
+    CAMEL_CASE_RE.lastIndex = 0;
+    while ((match = CAMEL_CASE_RE.exec(text)) !== null) {
+        entities.add(match[1]);
+    }
+    // File paths
+    FILE_PATH_RE.lastIndex = 0;
+    while ((match = FILE_PATH_RE.exec(text)) !== null) {
+        entities.add(match[1]);
+    }
+    return Array.from(entities);
+}
+/**
+ * Generate a short summary from chunk content.
+ * Prefers markdown heading if present, otherwise first sentence.
+ */
+export function generateSummary(text) {
+    const trimmed = text.trim();
+    if (!trimmed)
+        return "";
+    // Check for markdown heading
+    const headingMatch = trimmed.match(/^#{1,6}\s+(.+)/m);
+    if (headingMatch) {
+        const heading = headingMatch[1].trim();
+        return heading.length > MAX_SUMMARY_LENGTH
+            ? heading.slice(0, MAX_SUMMARY_LENGTH)
+            : heading;
+    }
+    // First sentence (ends with . ! or ?)
+    const sentenceMatch = trimmed.match(/^[^.!?]+[.!?]/);
+    if (sentenceMatch) {
+        const sentence = sentenceMatch[0].trim();
+        return sentence.length > MAX_SUMMARY_LENGTH
+            ? sentence.slice(0, MAX_SUMMARY_LENGTH)
+            : sentence;
+    }
+    // Fallback: truncate to MAX_SUMMARY_LENGTH
+    return trimmed.length > MAX_SUMMARY_LENGTH
+        ? trimmed.slice(0, MAX_SUMMARY_LENGTH)
+        : trimmed;
+}
+/**
+ * Enrich a single text chunk with keywords, entities, summary, and source metadata.
+ */
+export function enrichChunk(chunk, sourceType, parentChunkIndex) {
+    const keywords = extractKeywords(chunk.content);
+    const entities = extractEntities(chunk.content);
+    const summary = generateSummary(chunk.content);
+    logger.debug("Chunk enriched", {
+        index: chunk.index,
+        sourceType,
+        keywordCount: keywords.length,
+        entityCount: entities.length,
+    });
+    return {
+        ...chunk,
+        keywords,
+        entities,
+        summary,
+        sourceType,
+        parentChunkIndex,
+    };
+}
+/**
+ * Enrich multiple chunks from the same document.
+ * Applies parent-child linking for multi-chunk documents.
+ */
+export function enrichChunks(chunks, sourceType) {
+    if (chunks.length <= 1) {
+        return chunks.map((c) => enrichChunk(c, sourceType));
+    }
+    // For multi-chunk documents, first chunk (index 0) is the "parent" reference
+    return chunks.map((c, i) => enrichChunk(c, sourceType, i === 0 ? undefined : 0));
+}
+//# sourceMappingURL=enrichment-pipeline.js.map

package/dist/core/rag/enrichment-pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"enrichment-pipeline.js","sourceRoot":"","sources":["../../../src/core/rag/enrichment-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAe5C,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,OAAe,aAAa;IACxE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,yBAAyB;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,kEAAkE;IAClE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;SACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,8DAA8D;AAE9D,2EAA2E;AAC3E,uGAAuG;AACvG,MAAM,cAAc,GAAG,uCAAuC,CAAC;AAE/D,mFAAmF;AACnF,MAAM,aAAa,GAAG,2CAA2C,CAAC;AAElE,+EAA+E;AAC/E,MAAM,YAAY,GAAG,8EAA8E,CAAC;AAEpG;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,IAAI,KAA6B,CAAC;IAElC,gDAAgD;IAChD,cAAc,CAAC,SAAS,GAAG,CAAC,CAAC;IAC7B,OAAO,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACpD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,YAAY;IACZ,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC;IAC5B,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,aAAa;IACb,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC;IAC3B,OAAO,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAClD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,6BAA6B;IAC7B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACtD,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,OAAO,OAAO,CAAC,MAAM,GAAG,kBAAkB;YACxC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;YACtC,CAAC,CAAC,OAAO,CAAC;IACd,CAAC;IAED,sCAAsC;IACtC,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrD,IAAI,aAAa,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,OAAO,QAAQ,CAAC,MAAM,GAAG,kBAAkB;YACzC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;YACvC,CAAC,CAAC,QAAQ,CAAC;IACf,CAAC;IAED,2CAA2C;IAC3C,OAAO,OAAO,CAAC,MAAM,GAAG,kBAAkB;QACxC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;QACtC,CAAC,CAAC,OAAO,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CACzB,KAAgB,EAChB,UAAkB,EAClB,gBAAyB;IAEzB,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAE/C,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAAE;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,UAAU;QACV,YAAY,EAAE,QAAQ,CAAC,MAAM;QAC7B,WAAW,EAAE,QAAQ,CAAC,MAAM;KAC7B,CAAC,CAAC;IAEH,OAAO;QACL,GAAG,KAAK;QACR,QAAQ;QACR,QAAQ;QACR,OAAO;QACP,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAmB,EACnB,UAAkB;IAElB,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,6EAA6E;IAC7E,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzB,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CACpD,CAAC;AACJ,CAAC"}

package/dist/core/rag/post-retrieval.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Post-Retrieval Pipeline — processes search results after initial retrieval.
+ *
+ * Pipeline stages:
+ * 1. Deduplication — remove results with identical content
+ * 2. Reranking — boost results with higher query keyword overlap
+ * 3. Chunk stitching — merge adjacent chunks from the same source
+ * 4. Limit — enforce maxResults
+ */
+import type { RankedResult } from "./multi-strategy-retrieval.js";
+export interface PostRetrievalOptions {
+    query: string;
+    results: RankedResult[];
+    maxResults: number;
+    chunkMeta?: Map<string, number>;
+}
+export interface PostRetrievalResult {
+    results: RankedResult[];
+    deduplicated: number;
+    stitchedChunks: number;
+}
+/**
+ * Remove results with identical content, keeping the highest-scored one.
+ */
+export declare function deduplicateResults(results: RankedResult[]): RankedResult[];
+/**
+ * Rerank results by keyword overlap with the query.
+ * Combines original score with keyword overlap boost.
+ */
+export declare function rerankByKeywordOverlap(results: RankedResult[], query: string): RankedResult[];
+/**
+ * Merge adjacent chunks from the same source document.
+ * Chunks are considered adjacent if their chunk indices differ by 1.
+ */
+export declare function stitchAdjacentChunks(results: RankedResult[], chunkMeta: Map<string, number>): RankedResult[];
+/**
+ * Full post-retrieval pipeline.
+ */
+export declare function postRetrievalPipeline(options: PostRetrievalOptions): PostRetrievalResult;
+//# sourceMappingURL=post-retrieval.d.ts.map

package/dist/core/rag/post-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"post-retrieval.d.ts","sourceRoot":"","sources":["../../../src/core/rag/post-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAIlE,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAY1E;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,GACZ,YAAY,EAAE,CAchB;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,YAAY,EAAE,EACvB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC7B,YAAY,EAAE,CAmDhB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,oBAAoB,GAAG,mBAAmB,CA2BxF"}

package/dist/core/rag/post-retrieval.js

@@ -0,0 +1,119 @@
+/**
+ * Post-Retrieval Pipeline — processes search results after initial retrieval.
+ *
+ * Pipeline stages:
+ * 1. Deduplication — remove results with identical content
+ * 2. Reranking — boost results with higher query keyword overlap
+ * 3. Chunk stitching — merge adjacent chunks from the same source
+ * 4. Limit — enforce maxResults
+ */
+import { tokenize } from "../search/tokenizer.js";
+import { logger } from "../utils/logger.js";
+/**
+ * Remove results with identical content, keeping the highest-scored one.
+ */
+export function deduplicateResults(results) {
+    const seen = new Map();
+    for (const result of results) {
+        const key = result.content.trim().toLowerCase();
+        const existing = seen.get(key);
+        if (!existing || result.score > existing.score) {
+            seen.set(key, result);
+        }
+    }
+    return Array.from(seen.values()).sort((a, b) => b.score - a.score);
+}
+/**
+ * Rerank results by keyword overlap with the query.
+ * Combines original score with keyword overlap boost.
+ */
+export function rerankByKeywordOverlap(results, query) {
+    const queryTokens = new Set(tokenize(query));
+    if (queryTokens.size === 0)
+        return results;
+    const scored = results.map((r) => {
+        const contentTokens = tokenize(r.content);
+        const overlap = contentTokens.filter((t) => queryTokens.has(t)).length;
+        const overlapRatio = contentTokens.length > 0 ? overlap / queryTokens.size : 0;
+        // Combine: 70% original score + 30% keyword overlap
+        const combinedScore = r.score * 0.7 + overlapRatio * 0.3;
+        return { ...r, score: Math.round(combinedScore * 10000) / 10000 };
+    });
+    return scored.sort((a, b) => b.score - a.score);
+}
+/**
+ * Merge adjacent chunks from the same source document.
+ * Chunks are considered adjacent if their chunk indices differ by 1.
+ */
+export function stitchAdjacentChunks(results, chunkMeta) {
+    if (results.length <= 1 || chunkMeta.size === 0)
+        return results;
+    // Group by sourceId
+    const groups = new Map();
+    const ungrouped = [];
+    for (const r of results) {
+        const chunkIdx = chunkMeta.get(r.id);
+        if (chunkIdx === undefined) {
+            ungrouped.push(r);
+            continue;
+        }
+        const group = groups.get(r.sourceId) ?? [];
+        group.push(r);
+        groups.set(r.sourceId, group);
+    }
+    const stitched = [];
+    for (const [_sourceId, group] of groups) {
+        // Sort by chunk index
+        group.sort((a, b) => (chunkMeta.get(a.id) ?? 0) - (chunkMeta.get(b.id) ?? 0));
+        let current = group[0];
+        let currentIdx = chunkMeta.get(current.id) ?? 0;
+        for (let i = 1; i < group.length; i++) {
+            const next = group[i];
+            const nextIdx = chunkMeta.get(next.id) ?? 0;
+            if (nextIdx === currentIdx + 1) {
+                // Stitch: merge content, keep higher score
+                current = {
+                    ...current,
+                    content: current.content + "\n\n" + next.content,
+                    score: Math.max(current.score, next.score),
+                    strategies: [...new Set([...current.strategies, ...next.strategies])],
+                };
+                currentIdx = nextIdx;
+            }
+            else {
+                stitched.push(current);
+                current = next;
+                currentIdx = nextIdx;
+            }
+        }
+        stitched.push(current);
+    }
+    const final = [...stitched, ...ungrouped].sort((a, b) => b.score - a.score);
+    return final;
+}
+/**
+ * Full post-retrieval pipeline.
+ */
+export function postRetrievalPipeline(options) {
+    const { query, results, maxResults, chunkMeta } = options;
+    // Stage 1: Deduplication
+    const deduped = deduplicateResults(results);
+    const deduplicated = results.length - deduped.length;
+    // Stage 2: Reranking
+    const reranked = rerankByKeywordOverlap(deduped, query);
+    // Stage 3: Chunk stitching (if metadata available)
+    const stitched = chunkMeta
+        ? stitchAdjacentChunks(reranked, chunkMeta)
+        : reranked;
+    const stitchedChunks = reranked.length - stitched.length;
+    // Stage 4: Limit
+    const limited = stitched.slice(0, maxResults);
+    logger.debug("Post-retrieval pipeline complete", {
+        input: results.length,
+        deduplicated,
+        stitchedChunks,
+        output: limited.length,
+    });
+    return { results: limited, deduplicated, stitchedChunks };
+}
+//# sourceMappingURL=post-retrieval.js.map

package/dist/core/rag/post-retrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"post-retrieval.js","sourceRoot":"","sources":["../../../src/core/rag/post-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAe5C;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAuB;IACxD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAwB,CAAC;IAE7C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CACpC,OAAuB,EACvB,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAE3C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACvE,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,oDAAoD;QACpD,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG,YAAY,GAAG,GAAG,CAAC;QACzD,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAuB,EACvB,SAA8B;IAE9B,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAEhE,oBAAoB;IACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,MAAM,SAAS,GAAmB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,QAAQ,GAAmB,EAAE,CAAC;IAEpC,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACxC,sBAAsB;QACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE9E,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAE5C,IAAI,OAAO,KAAK,UAAU,GAAG,CAAC,EAAE,CAAC;gBAC/B,2CAA2C;gBAC3C,OAAO,GAAG;oBACR,GAAG,OAAO;oBACV,OAAO,EAAE,OAAO,CAAC,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO;oBAChD,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC;oBAC1C,UAAU,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;iBACtE,CAAC;gBACF,UAAU,GAAG,OAAO,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,OAAO,GAAG,IAAI,CAAC;gBACf,UAAU,GAAG,OAAO,CAAC;YACvB,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5E,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAA6B;IACjE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAE1D,yBAAyB;IACzB,MAAM,OAAO,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAErD,qBAAqB;IACrB,MAAM,QAAQ,GAAG,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAExD,mDAAmD;IACnD,MAAM,QAAQ,GAAG,SAAS;QACxB,CAAC,CAAC,oBAAoB,CAAC,QAAQ,EAAE,SAAS,CAAC;QAC3C,CAAC,CAAC,QAAQ,CAAC;IACb,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEzD,iBAAiB;IACjB,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAE9C,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE;QAC/C,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,YAAY;QACZ,cAAc;QACd,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AAC5D,CAAC"}

package/dist/core/rag/query-cache.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Query Cache — in-memory cache for RAG search results.
+ *
+ * Features:
+ * - TTL-based expiration
+ * - LRU eviction when maxSize exceeded
+ * - Query normalization (case-insensitive, trimmed)
+ * - Hit/miss statistics
+ * - Bulk invalidation (e.g., when knowledge store changes)
+ */
+import type { RankedResult } from "./multi-strategy-retrieval.js";
+export interface CacheOptions {
+    ttlMs: number;
+    maxSize: number;
+}
+export interface CacheStats {
+    size: number;
+    hits: number;
+    misses: number;
+    evictions: number;
+}
+/**
+ * In-memory query cache with TTL and LRU eviction.
+ */
+export declare class QueryCache {
+    private entries;
+    private ttlMs;
+    private maxSize;
+    private hits;
+    private misses;
+    private evictions;
+    constructor(options: CacheOptions);
+    /**
+     * Retrieve cached results for a query, or undefined if miss/expired.
+     */
+    get(query: string): RankedResult[] | undefined;
+    /**
+     * Store results for a query.
+     */
+    set(query: string, results: RankedResult[]): void;
+    /**
+     * Invalidate all cached entries.
+     */
+    invalidateAll(): void;
+    /**
+     * Get cache statistics.
+     */
+    getStats(): CacheStats;
+    /**
+     * Evict the oldest (by creation time) entry.
+     */
+    private evictOldest;
+}
+//# sourceMappingURL=query-cache.d.ts.map

package/dist/core/rag/query-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-cache.d.ts","sourceRoot":"","sources":["../../../src/core/rag/query-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAGlE,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;CACjB;AAQD,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB;AASD;;GAEG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,SAAS,CAAa;gBAElB,OAAO,EAAE,YAAY;IAKjC;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,EAAE,GAAG,SAAS;IAqB9C;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,IAAI;IAejD;;OAEG;IACH,aAAa,IAAI,IAAI;IAMrB;;OAEG;IACH,QAAQ,IAAI,UAAU;IAStB;;OAEG;IACH,OAAO,CAAC,WAAW;CAgBpB"}

package/dist/core/rag/query-cache.js

@@ -0,0 +1,104 @@
+/**
+ * Query Cache — in-memory cache for RAG search results.
+ *
+ * Features:
+ * - TTL-based expiration
+ * - LRU eviction when maxSize exceeded
+ * - Query normalization (case-insensitive, trimmed)
+ * - Hit/miss statistics
+ * - Bulk invalidation (e.g., when knowledge store changes)
+ */
+import { logger } from "../utils/logger.js";
+/**
+ * Normalize query for consistent cache keys.
+ */
+function normalizeKey(query) {
+    return query.trim().toLowerCase();
+}
+/**
+ * In-memory query cache with TTL and LRU eviction.
+ */
+export class QueryCache {
+    entries = new Map();
+    ttlMs;
+    maxSize;
+    hits = 0;
+    misses = 0;
+    evictions = 0;
+    constructor(options) {
+        this.ttlMs = options.ttlMs;
+        this.maxSize = options.maxSize;
+    }
+    /**
+     * Retrieve cached results for a query, or undefined if miss/expired.
+     */
+    get(query) {
+        const key = normalizeKey(query);
+        const entry = this.entries.get(key);
+        if (!entry) {
+            this.misses++;
+            return undefined;
+        }
+        // Check TTL
+        if (Date.now() - entry.createdAt > this.ttlMs) {
+            this.entries.delete(key);
+            this.misses++;
+            return undefined;
+        }
+        entry.lastAccessedAt = Date.now();
+        this.hits++;
+        return entry.results;
+    }
+    /**
+     * Store results for a query.
+     */
+    set(query, results) {
+        const key = normalizeKey(query);
+        // Evict if at capacity
+        if (this.entries.size >= this.maxSize && !this.entries.has(key)) {
+            this.evictOldest();
+        }
+        this.entries.set(key, {
+            results,
+            createdAt: Date.now(),
+            lastAccessedAt: Date.now(),
+        });
+    }
+    /**
+     * Invalidate all cached entries.
+     */
+    invalidateAll() {
+        const count = this.entries.size;
+        this.entries.clear();
+        logger.debug("Query cache invalidated", { entriesCleared: count });
+    }
+    /**
+     * Get cache statistics.
+     */
+    getStats() {
+        return {
+            size: this.entries.size,
+            hits: this.hits,
+            misses: this.misses,
+            evictions: this.evictions,
+        };
+    }
+    /**
+     * Evict the oldest (by creation time) entry.
+     */
+    evictOldest() {
+        let oldestKey;
+        let oldestTime = Infinity;
+        for (const [key, entry] of this.entries) {
+            if (entry.createdAt < oldestTime) {
+                oldestTime = entry.createdAt;
+                oldestKey = key;
+            }
+        }
+        if (oldestKey) {
+            this.entries.delete(oldestKey);
+            this.evictions++;
+        }
+    }
+}
+//# sourceMappingURL=query-cache.js.map

package/dist/core/rag/query-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-cache.js","sourceRoot":"","sources":["../../../src/core/rag/query-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAoB5C;;GAEG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,UAAU;IACb,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC7C,KAAK,CAAS;IACd,OAAO,CAAS;IAChB,IAAI,GAAW,CAAC,CAAC;IACjB,MAAM,GAAW,CAAC,CAAC;IACnB,SAAS,GAAW,CAAC,CAAC;IAE9B,YAAY,OAAqB;QAC/B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa;QACf,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEpC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,YAAY;QACZ,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,OAAO,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa,EAAE,OAAuB;QACxC,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAEhC,uBAAuB;QACvB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAChE,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;YACpB,OAAO;YACP,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,cAAc,EAAE,IAAI,CAAC,GAAG,EAAE;SAC3B,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,aAAa;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,MAAM,CAAC,KAAK,CAAC,yBAAyB,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;IACrE,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,IAAI,SAA6B,CAAC;QAClC,IAAI,UAAU,GAAG,QAAQ,CAAC;QAE1B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,SAAS,GAAG,UAAU,EAAE,CAAC;gBACjC,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC;gBAC7B,SAAS,GAAG,GAAG,CAAC;YAClB,CAAC;QACH,CAAC;QAED,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;CACF"}

package/dist/core/rag/query-understanding.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Query Understanding — preprocesses user queries before retrieval.
+ *
+ * Provides:
+ * - Intent detection (search, how_to, status, debug, compare, history)
+ * - Entity extraction (PascalCase, camelCase from query)
+ * - Source type filtering (detect "in the PRD", "in code", etc.)
+ * - Query expansion with related terms
+ * - Query rewriting for FTS5 optimization
+ */
+export type QueryIntent = "search" | "how_to" | "status" | "debug" | "compare" | "history";
+export interface UnderstandingResult {
+    originalQuery: string;
+    rewrittenQuery: string;
+    entities: string[];
+    intent: QueryIntent;
+    expandedTerms: string[];
+    sourceTypeFilter: string[];
+}
+/**
+ * Detect the intent of a query from keyword patterns.
+ */
+export declare function detectIntent(query: string): QueryIntent;
+/**
+ * Detect source type filters from query content.
+ */
+export declare function detectSourceFilter(query: string): string[];
+/**
+ * Expand query tokens with related technical terms.
+ */
+export declare function expandQuery(query: string): string[];
+/**
+ * Full query understanding pipeline.
+ * Analyzes a natural language query and returns structured understanding.
+ */
+export declare function understandQuery(query: string): UnderstandingResult;
+//# sourceMappingURL=query-understanding.d.ts.map

package/dist/core/rag/query-understanding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-understanding.d.ts","sourceRoot":"","sources":["../../../src/core/rag/query-understanding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC;AAE3F,MAAM,WAAW,mBAAmB;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,WAAW,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B;AAYD;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAKvD;AAiBD;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAQ1D;AAmBD;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAYnD;AAUD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,mBAAmB,CAuBlE"}