causantic 0.2.0 → 0.3.0

package/dist/retrieval/chain-assembler.js

@@ -0,0 +1,126 @@
+/**
+ * Chain assembler for episodic retrieval.
+ *
+ * Combines search (for seed finding) with chain walking (for narrative construction).
+ * Used by the `recall` and `predict` MCP tools.
+ *
+ * Pipeline:
+ * 1. Run searchContext() to get seeds and query embedding
+ * 2. Walk chains from seeds (backward for recall, forward for predict)
+ * 3. Select best chain by median per-node score
+ * 4. If no chain qualifies (all seeds orphaned), fall back to search results
+ */
+import { approximateTokens } from '../utils/token-counter.js';
+import { searchContext } from './search-assembler.js';
+import { walkChains, selectBestChain } from './chain-walker.js';
+/**
+ * Recall: find seeds → walk backward → reverse for chronological narrative.
+ */
+export async function recallContext(request) {
+    return runEpisodicPipeline(request, 'backward');
+}
+/**
+ * Predict: find seeds → walk forward → output in traversal order.
+ */
+export async function predictContext(request) {
+    return runEpisodicPipeline(request, 'forward');
+}
+/**
+ * Core episodic pipeline shared by recall and predict.
+ */
+async function runEpisodicPipeline(request, direction) {
+    const startTime = Date.now();
+    const { query, currentSessionId, projectFilter, maxTokens = 20000, vectorSearchLimit } = request;
+    // 1. Search for seeds
+    const searchRequest = {
+        query,
+        currentSessionId,
+        projectFilter,
+        maxTokens,
+        vectorSearchLimit,
+    };
+    const searchResult = await searchContext(searchRequest);
+    if (searchResult.seedIds.length === 0) {
+        return {
+            text: searchResult.text,
+            tokenCount: searchResult.tokenCount,
+            chunks: searchResult.chunks.map((c) => ({
+                id: c.id,
+                sessionSlug: c.sessionSlug,
+                weight: c.weight,
+                preview: c.preview,
+            })),
+            mode: 'search-fallback',
+            chainLength: 0,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // 2. Walk chains from seeds
+    const chains = await walkChains(searchResult.seedIds, {
+        direction,
+        tokenBudget: maxTokens,
+        queryEmbedding: searchResult.queryEmbedding,
+    });
+    // 3. Select best chain
+    const bestChain = selectBestChain(chains);
+    if (!bestChain) {
+        // Fallback to search results
+        return {
+            text: searchResult.text,
+            tokenCount: searchResult.tokenCount,
+            chunks: searchResult.chunks.map((c) => ({
+                id: c.id,
+                sessionSlug: c.sessionSlug,
+                weight: c.weight,
+                preview: c.preview,
+            })),
+            mode: 'search-fallback',
+            chainLength: 0,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // 4. Format chain as narrative
+    const formatted = formatChain(bestChain, direction);
+    return {
+        text: formatted.text,
+        tokenCount: formatted.tokenCount,
+        chunks: formatted.chunks,
+        mode: 'chain',
+        chainLength: bestChain.chunkIds.length,
+        durationMs: Date.now() - startTime,
+    };
+}
+/**
+ * Format a chain as ordered narrative.
+ * Backward chains are reversed for chronological output (problem → solution).
+ */
+function formatChain(chain, direction) {
+    // Backward chains need reversal for chronological order
+    const orderedChunks = direction === 'backward' ? [...chain.chunks].reverse() : chain.chunks;
+    const orderedIds = direction === 'backward' ? [...chain.chunkIds].reverse() : chain.chunkIds;
+    const parts = [];
+    const resultChunks = [];
+    let totalTokens = 0;
+    for (let i = 0; i < orderedChunks.length; i++) {
+        const chunk = orderedChunks[i];
+        const chunkTokens = chunk.approxTokens || approximateTokens(chunk.content);
+        parts.push(formatChunkForOutput(chunk, chunk.content, i + 1, orderedChunks.length));
+        totalTokens += chunkTokens;
+        resultChunks.push({
+            id: orderedIds[i],
+            sessionSlug: chunk.sessionSlug,
+            weight: chain.medianScore,
+            preview: chunk.content.slice(0, 100) + (chunk.content.length > 100 ? '...' : ''),
+        });
+    }
+    return {
+        text: parts.join('\n\n---\n\n'),
+        tokenCount: totalTokens,
+        chunks: resultChunks,
+    };
+}
+function formatChunkForOutput(chunk, content, position, total) {
+    const date = new Date(chunk.startTime).toLocaleDateString();
+    return `[${position}/${total} | Session: ${chunk.sessionSlug} | Date: ${date}]\n${content}`;
+}
+//# sourceMappingURL=chain-assembler.js.map

package/dist/retrieval/chain-assembler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-assembler.js","sourceRoot":"","sources":["../../src/retrieval/chain-assembler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAsB,MAAM,uBAAuB,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,eAAe,EAAc,MAAM,mBAAmB,CAAC;AA0C5E;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,OAAwB;IAC1D,OAAO,mBAAmB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,OAAwB;IAC3D,OAAO,mBAAmB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,mBAAmB,CAChC,OAAwB,EACxB,SAAiC;IAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,MAAM,EAAE,KAAK,EAAE,gBAAgB,EAAE,aAAa,EAAE,SAAS,GAAG,KAAK,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC;IAEjG,sBAAsB;IACtB,MAAM,aAAa,GAAkB;QACnC,KAAK;QACL,gBAAgB;QAChB,aAAa;QACb,SAAS;QACT,iBAAiB;KAClB,CAAC;IAEF,MAAM,YAAY,GAAG,MAAM,aAAa,CAAC,aAAa,CAAC,CAAC;IAExD,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,OAAO;YACL,IAAI,EAAE,YAAY,CAAC,IAAI;YACvB,UAAU,EAAE,YAAY,CAAC,UAAU;YACnC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtC,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,OAAO,EAAE,CAAC,CAAC,OAAO;aACnB,CAAC,CAAC;YACH,IAAI,EAAE,iBAAiB;YACvB,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,4BAA4B;IAC5B,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE;QACpD,SAAS;QACT,WAAW,EAAE,SAAS;QACtB,cAAc,EAAE,YAAY,CAAC,cAAc;KAC5C,CAAC,CAAC;IAEH,uBAAuB;IACvB,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAE1C,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,6BAA6B;QAC7B,OAAO;YACL,IAAI,EAAE,YAAY,CAAC,IAAI;YACvB,UAAU,EAAE,YAAY,CAAC,UAAU;YACnC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtC,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,OAAO,EAAE,CAAC,CAAC,OAAO;aACnB,CAAC,CAAC;YACH,IAAI,EAAE,iBAAiB;YACvB,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,+BAA+B;IAC/B,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAEpD,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,IAAI,EAAE,OAAO;QACb,WAAW,EAAE,SAAS,CAAC,QAAQ,CAAC,MAAM;QACtC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAClB,KAAY,EACZ,SAAiC;IAWjC,wDAAwD;IACxD,MAAM,aAAa,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAC5F,MAAM,UAAU,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;IAE7F,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,YAAY,GAKb,EAAE,CAAC;IACR,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,YAAY,IAAI,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAE3E,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;QACpF,WAAW,IAAI,WAAW,CAAC;QAC3B,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;YACjB,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,MAAM,EAAE,KAAK,CAAC,WAAW;YACzB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;SACjF,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;QAC/B,UAAU,EAAE,WAAW;QACvB,MAAM,EAAE,YAAY;KACrB,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAC3B,KAAkB,EAClB,OAAe,EACf,QAAgB,EAChB,KAAa;IAEb,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,kBAAkB,EAAE,CAAC;IAC5D,OAAO,IAAI,QAAQ,IAAI,KAAK,eAAe,KAAK,CAAC,WAAW,YAAY,IAAI,MAAM,OAAO,EAAE,CAAC;AAC9F,CAAC"}

package/dist/retrieval/chain-walker.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Chain walker for episodic retrieval.
+ *
+ * Walks the causal graph from seed chunks, building ordered narrative chains.
+ * Each chain is scored by aggregate cosine similarity per token.
+ */
+import type { StoredChunk } from '../storage/types.js';
+/**
+ * Options for chain walking.
+ */
+export interface ChainWalkerOptions {
+    /** Walk direction: backward = recall, forward = predict */
+    direction: 'forward' | 'backward';
+    /** Maximum tokens across all chains */
+    tokenBudget: number;
+    /** Query embedding for scoring nodes */
+    queryEmbedding: number[];
+    /** Maximum depth (hops) per chain. Default: 50. */
+    maxDepth?: number;
+}
+/**
+ * A chain of ordered chunks from graph traversal.
+ */
+export interface Chain {
+    /** Chunk IDs in traversal order */
+    chunkIds: string[];
+    /** Resolved chunks */
+    chunks: StoredChunk[];
+    /** Per-node cosine similarity scores (parallel to chunkIds) */
+    nodeScores: number[];
+    /** Sum of cosine similarity scores for all nodes */
+    score: number;
+    /** Total token count across all chunks */
+    tokenCount: number;
+    /** Median per-node similarity (robust to outliers on short chains) */
+    medianScore: number;
+}
+/**
+ * Walk causal chains from seed chunks.
+ *
+ * For each seed, traverses the graph following directed edges.
+ * Each branch path produces a separate chain.
+ * A global visited set prevents cycles.
+ * A running token tally stops traversal when the budget is hit.
+ *
+ * @param seedIds - Starting chunk IDs
+ * @param options - Walk options
+ * @returns Array of chains (one per seed that yielded results)
+ */
+export declare function walkChains(seedIds: string[], options: ChainWalkerOptions): Promise<Chain[]>;
+/**
+ * Select the best chain from a set of candidates.
+ * Returns the chain with the highest median per-node score among chains with >= 2 chunks.
+ * Returns null if no qualifying chain exists.
+ */
+export declare function selectBestChain(chains: Chain[]): Chain | null;
+//# sourceMappingURL=chain-walker.d.ts.map

package/dist/retrieval/chain-walker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-walker.d.ts","sourceRoot":"","sources":["../../src/retrieval/chain-walker.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,KAAK,EAAE,WAAW,EAAc,MAAM,qBAAqB,CAAC;AAEnE;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,2DAA2D;IAC3D,SAAS,EAAE,SAAS,GAAG,UAAU,CAAC;IAClC,uCAAuC;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,wCAAwC;IACxC,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,mDAAmD;IACnD,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,KAAK;IACpB,mCAAmC;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,sBAAsB;IACtB,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,+DAA+D;IAC/D,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,oDAAoD;IACpD,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,UAAU,CAC9B,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,EAAE,kBAAkB,GAC1B,OAAO,CAAC,KAAK,EAAE,CAAC,CA0BlB;AA+ED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,GAAG,IAAI,CAM7D"}

package/dist/retrieval/chain-walker.js

@@ -0,0 +1,121 @@
+/**
+ * Chain walker for episodic retrieval.
+ *
+ * Walks the causal graph from seed chunks, building ordered narrative chains.
+ * Each chain is scored by aggregate cosine similarity per token.
+ */
+import { getForwardEdges, getBackwardEdges } from '../storage/edge-store.js';
+import { getChunkById } from '../storage/chunk-store.js';
+import { vectorStore } from '../storage/vector-store.js';
+import { angularDistance } from '../utils/angular-distance.js';
+/**
+ * Walk causal chains from seed chunks.
+ *
+ * For each seed, traverses the graph following directed edges.
+ * Each branch path produces a separate chain.
+ * A global visited set prevents cycles.
+ * A running token tally stops traversal when the budget is hit.
+ *
+ * @param seedIds - Starting chunk IDs
+ * @param options - Walk options
+ * @returns Array of chains (one per seed that yielded results)
+ */
+export async function walkChains(seedIds, options) {
+    const { direction, tokenBudget, queryEmbedding, maxDepth = 50 } = options;
+    const visited = new Set();
+    let globalTokens = 0;
+    const chains = [];
+    for (const seedId of seedIds) {
+        if (visited.has(seedId) || globalTokens >= tokenBudget)
+            break;
+        const chain = await walkSingleChain(seedId, direction, queryEmbedding, tokenBudget - globalTokens, maxDepth, visited);
+        if (chain && chain.chunkIds.length > 0) {
+            chains.push(chain);
+            globalTokens += chain.tokenCount;
+        }
+    }
+    return chains;
+}
+/**
+ * Walk a single chain from a seed, following edges in one direction.
+ */
+async function walkSingleChain(seedId, direction, queryEmbedding, remainingBudget, maxDepth, visited) {
+    const chunkIds = [];
+    const chunks = [];
+    const nodeScores = [];
+    let score = 0;
+    let tokenCount = 0;
+    let currentId = seedId;
+    let depth = 0;
+    while (currentId && depth < maxDepth && tokenCount < remainingBudget) {
+        if (visited.has(currentId))
+            break;
+        visited.add(currentId);
+        const chunk = getChunkById(currentId);
+        if (!chunk)
+            break;
+        // Score this node
+        const nodeScore = await scoreNode(currentId, queryEmbedding);
+        const chunkTokens = chunk.approxTokens || 100;
+        if (tokenCount + chunkTokens > remainingBudget && chunkIds.length > 0)
+            break;
+        chunkIds.push(currentId);
+        chunks.push(chunk);
+        nodeScores.push(nodeScore);
+        score += nodeScore;
+        tokenCount += chunkTokens;
+        depth++;
+        // Follow edges in the given direction
+        const edges = direction === 'forward' ? getForwardEdges(currentId) : getBackwardEdges(currentId);
+        // Pick the first unvisited neighbor
+        currentId = null;
+        for (const edge of edges) {
+            const nextId = direction === 'forward' ? edge.targetChunkId : edge.sourceChunkId;
+            if (!visited.has(nextId)) {
+                currentId = nextId;
+                break;
+            }
+        }
+    }
+    if (chunkIds.length === 0)
+        return null;
+    return {
+        chunkIds,
+        chunks,
+        nodeScores,
+        score,
+        tokenCount,
+        medianScore: median(nodeScores),
+    };
+}
+/**
+ * Score a node by cosine similarity to the query embedding.
+ * Returns 1 - angularDistance (so 1 = perfect match, 0 = orthogonal).
+ */
+async function scoreNode(chunkId, queryEmbedding) {
+    const chunkEmbedding = await vectorStore.get(chunkId);
+    if (!chunkEmbedding)
+        return 0;
+    return 1 - angularDistance(queryEmbedding, chunkEmbedding);
+}
+/**
+ * Select the best chain from a set of candidates.
+ * Returns the chain with the highest median per-node score among chains with >= 2 chunks.
+ * Returns null if no qualifying chain exists.
+ */
+export function selectBestChain(chains) {
+    const qualifying = chains.filter((c) => c.chunkIds.length >= 2);
+    if (qualifying.length === 0)
+        return null;
+    qualifying.sort((a, b) => b.medianScore - a.medianScore);
+    return qualifying[0];
+}
+/** Compute median of a sorted-copy of values. Returns 0 for empty arrays. */
+function median(values) {
+    if (values.length === 0)
+        return 0;
+    const sorted = [...values].sort((a, b) => a - b);
+    const mid = Math.floor(sorted.length / 2);
+    return sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+}
+//# sourceMappingURL=chain-walker.js.map

package/dist/retrieval/chain-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-walker.js","sourceRoot":"","sources":["../../src/retrieval/chain-walker.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAmC/D;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,OAAiB,EACjB,OAA2B;IAE3B,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,cAAc,EAAE,QAAQ,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;IAE1E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,MAAM,GAAY,EAAE,CAAC;IAE3B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,YAAY,IAAI,WAAW;YAAE,MAAM;QAE9D,MAAM,KAAK,GAAG,MAAM,eAAe,CACjC,MAAM,EACN,SAAS,EACT,cAAc,EACd,WAAW,GAAG,YAAY,EAC1B,QAAQ,EACR,OAAO,CACR,CAAC;QAEF,IAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,YAAY,IAAI,KAAK,CAAC,UAAU,CAAC;QACnC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,eAAe,CAC5B,MAAc,EACd,SAAiC,EACjC,cAAwB,EACxB,eAAuB,EACvB,QAAgB,EAChB,OAAoB;IAEpB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,IAAI,SAAS,GAAkB,MAAM,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,SAAS,IAAI,KAAK,GAAG,QAAQ,IAAI,UAAU,GAAG,eAAe,EAAE,CAAC;QACrE,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM;QAClC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEvB,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK;YAAE,MAAM;QAElB,kBAAkB;QAClB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC;QAE9C,IAAI,UAAU,GAAG,WAAW,GAAG,eAAe,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM;QAE7E,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3B,KAAK,IAAI,SAAS,CAAC;QACnB,UAAU,IAAI,WAAW,CAAC;QAC1B,KAAK,EAAE,CAAC;QAER,sCAAsC;QACtC,MAAM,KAAK,GACT,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAErF,oCAAoC;QACpC,SAAS,GAAG,IAAI,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAW,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;YACzF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,SAAS,GAAG,MAAM,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,OAAO;QACL,QAAQ;QACR,MAAM;QACN,UAAU;QACV,KAAK;QACL,UAAU;QACV,WAAW,EAAE,MAAM,CAAC,UAAU,CAAC;KAChC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,SAAS,CAAC,OAAe,EAAE,cAAwB;IAChE,MAAM,cAAc,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACtD,IAAI,CAAC,cAAc;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,CAAC,GAAG,eAAe,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,MAAe;IAC7C,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAChE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACzD,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,6EAA6E;AAC7E,SAAS,MAAM,CAAC,MAAgB;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACrF,CAAC"}

package/dist/retrieval/cluster-expander.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cluster-expander.d.ts","sourceRoot":"","sources":["../../src/retrieval/cluster-expander.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAE3C,MAAM,WAAW,sBAAsB;IACrC,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,yBAAyB,EAAE,sBAIvC,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,UAAU,EAAE,EAClB,MAAM,GAAE,sBAAkD,EAC1D,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAChC,UAAU,EAAE,CAkEd"}
+{"version":3,"file":"cluster-expander.d.ts","sourceRoot":"","sources":["../../src/retrieval/cluster-expander.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAE3C,MAAM,WAAW,sBAAsB;IACrC,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,yBAAyB,EAAE,sBAIvC,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,UAAU,EAAE,EAClB,MAAM,GAAE,sBAAkD,EAC1D,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAChC,UAAU,EAAE,CAoEd"}

package/dist/retrieval/cluster-expander.js

@@ -4,7 +4,7 @@
  * Expands search results by finding sibling chunks within the same HDBSCAN clusters.
  * This surfaces topically related chunks that neither vector nor keyword search found.
  */
-import { getChunkClusterAssignments, getClusterChunkIds, } from '../storage/cluster-store.js';
+import { getChunkClusterAssignments, getClusterChunkIds } from '../storage/cluster-store.js';
 import { vectorStore } from '../storage/vector-store.js';
 export const DEFAULT_CLUSTER_EXPANSION = {
     maxClusters: 3,
@@ -26,7 +26,7 @@ export const DEFAULT_CLUSTER_EXPANSION = {
 export function expandViaClusters(hits, config = DEFAULT_CLUSTER_EXPANSION, projectFilter) {
     if (hits.length === 0)
         return [];
-    const existingIds = new Set(hits.map(h => h.chunkId));
+    const existingIds = new Set(hits.map((h) => h.chunkId));
     const siblingItems = [];
     // Build project filter set
     const projectSet = projectFilter
@@ -65,7 +65,7 @@ export function expandViaClusters(hits, config = DEFAULT_CLUSTER_EXPANSION, proj
                 }
                 // Look up this sibling's distance in the cluster for scoring
                 const siblingAssignments = getChunkClusterAssignments(siblingId);
-                const siblingAssignment = siblingAssignments.find(a => a.clusterId === assignment.clusterId);
+                const siblingAssignment = siblingAssignments.find((a) => a.clusterId === assignment.clusterId);
                 const distance = siblingAssignment?.distance ?? 0.5;
                 // Score: best hit score * boost * (1 - distance)
                 const score = hit.score * config.boostFactor * (1 - distance);

package/dist/retrieval/cluster-expander.js.map

@@ -1 +1 @@
-{"version":3,"file":"cluster-expander.js","sourceRoot":"","sources":["../../src/retrieval/cluster-expander.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAYzD,MAAM,CAAC,MAAM,yBAAyB,GAA2B;IAC/D,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,GAAG;CACjB,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAkB,EAClB,SAAiC,yBAAyB,EAC1D,aAAiC;IAEjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACtD,MAAM,YAAY,GAAiB,EAAE,CAAC;IAEtC,2BAA2B;IAC3B,MAAM,UAAU,GAAG,aAAa;QAC9B,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QACzE,CAAC,CAAC,IAAI,CAAC;IAET,4DAA4D;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,YAAY,IAAI,MAAM,CAAC,WAAW;YAAE,MAAM;QAE9C,8DAA8D;QAC9D,MAAM,WAAW,GAAG,0BAA0B,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEvC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,YAAY,IAAI,MAAM,CAAC,WAAW;gBAAE,MAAM;YAC9C,IAAI,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;gBAAE,SAAS;YAEzD,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAC3C,YAAY,EAAE,CAAC;YAEf,oCAAoC;YACpC,MAAM,eAAe,GAAG,kBAAkB,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACjE,IAAI,aAAa,GAAG,CAAC,CAAC;YAEtB,KAAK,MAAM,SAAS,IAAI,eAAe,EAAE,CAAC;gBACxC,IAAI,aAAa,IAAI,MAAM,CAAC,WAAW;oBAAE,MAAM;gBAC/C,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAEzC,8BAA8B;gBAC9B,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,OAAO,GAAG,WAAW,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;oBACvD,IAAI,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;wBAAE,SAAS;gBACrD,CAAC;gBAED,6DAA6D;gBAC7D,MAAM,kBAAkB,GAAG,0BAA0B,CAAC,SAAS,CAAC,CAAC;gBACjE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC7F,MAAM,QAAQ,GAAG,iBAAiB,EAAE,QAAQ,IAAI,GAAG,CAAC;gBAEpD,iDAAiD;gBACjD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;gBAE9D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACd,YAAY,CAAC,IAAI,CAAC;wBAChB,OAAO,EAAE,SAAS;wBAClB,KAAK;wBACL,MAAM,EAAE,SAAS;qBAClB,CAAC,CAAC;oBACH,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC3B,aAAa,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,YAAY,CAAC,CAAC;AACpC,CAAC"}
+{"version":3,"file":"cluster-expander.js","sourceRoot":"","sources":["../../src/retrieval/cluster-expander.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAC7F,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAYzD,MAAM,CAAC,MAAM,yBAAyB,GAA2B;IAC/D,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,GAAG;CACjB,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAkB,EAClB,SAAiC,yBAAyB,EAC1D,aAAiC;IAEjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACxD,MAAM,YAAY,GAAiB,EAAE,CAAC;IAEtC,2BAA2B;IAC3B,MAAM,UAAU,GAAG,aAAa;QAC9B,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QACzE,CAAC,CAAC,IAAI,CAAC;IAET,4DAA4D;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,YAAY,IAAI,MAAM,CAAC,WAAW;YAAE,MAAM;QAE9C,8DAA8D;QAC9D,MAAM,WAAW,GAAG,0BAA0B,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEvC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,YAAY,IAAI,MAAM,CAAC,WAAW;gBAAE,MAAM;YAC9C,IAAI,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;gBAAE,SAAS;YAEzD,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAC3C,YAAY,EAAE,CAAC;YAEf,oCAAoC;YACpC,MAAM,eAAe,GAAG,kBAAkB,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACjE,IAAI,aAAa,GAAG,CAAC,CAAC;YAEtB,KAAK,MAAM,SAAS,IAAI,eAAe,EAAE,CAAC;gBACxC,IAAI,aAAa,IAAI,MAAM,CAAC,WAAW;oBAAE,MAAM;gBAC/C,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAEzC,8BAA8B;gBAC9B,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,OAAO,GAAG,WAAW,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;oBACvD,IAAI,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;wBAAE,SAAS;gBACrD,CAAC;gBAED,6DAA6D;gBAC7D,MAAM,kBAAkB,GAAG,0BAA0B,CAAC,SAAS,CAAC,CAAC;gBACjE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,IAAI,CAC/C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,SAAS,CAC5C,CAAC;gBACF,MAAM,QAAQ,GAAG,iBAAiB,EAAE,QAAQ,IAAI,GAAG,CAAC;gBAEpD,iDAAiD;gBACjD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;gBAE9D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACd,YAAY,CAAC,IAAI,CAAC;wBAChB,OAAO,EAAE,SAAS;wBAClB,KAAK;wBACL,MAAM,EAAE,SAAS;qBAClB,CAAC,CAAC;oBACH,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC3B,aAAa,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,YAAY,CAAC,CAAC;AACpC,CAAC"}

package/dist/retrieval/context-assembler.d.ts

@@ -1,44 +1,29 @@
 /**
  * Context assembly for memory retrieval.
- * Combines vector search with graph traversal to assemble relevant context.
- */
-/**
- * Retrieval mode determines traversal direction and ranking.
- */
-export type RetrievalMode = 'recall' | 'explain' | 'predict';
-/**
- * Range hint for retrieval - lets Claude choose appropriate decay model.
- * - 'short': Recent context (15min hold) - best for immediate follow-ups
- * - 'long': Distant context (60min hold) - best for cross-session/historical
- * - 'auto': System decides based on query characteristics
+ *
+ * Delegates to specialized modules:
+ * - searchContext() for pure semantic search (no graph)
+ * - recallContext() for episodic recall (backward chain walking)
+ * - predictContext() for episodic prediction (forward chain walking)
  */
-export type RetrievalRange = 'short' | 'long' | 'auto';
+export type { SearchRequest, SearchResponse } from './search-assembler.js';
+export type { EpisodicRequest, EpisodicResponse } from './chain-assembler.js';
 /**
- * Request for context retrieval.
+ * Request for context retrieval (backward compat).
  */
 export interface RetrievalRequest {
     /** Query text to find relevant context for */
     query: string;
     /** Current session ID (optional, for recency boost) */
     currentSessionId?: string;
-    /** Project slug for clock lookup (optional, enables vector clock decay) */
-    projectSlug?: string;
     /** Filter results to specific project(s). Omit to search all projects. */
     projectFilter?: string | string[];
-    /** Query time for decay calculation (default: now) */
-    queryTime?: number;
     /** Maximum tokens in response */
     maxTokens?: number;
     /** Retrieval mode */
-    mode: RetrievalMode;
-    /** Range hint: 'short' for recent, 'long' for historical, 'auto' to decide */
-    range?: RetrievalRange;
+    mode: 'recall' | 'predict' | 'search';
     /** Number of vector search results to start from */
     vectorSearchLimit?: number;
-    /** Skip graph traversal (for benchmarking vector-only retrieval) */
-    skipGraph?: boolean;
-    /** Skip cluster expansion (for benchmarking vector-only retrieval) */
-    skipClusters?: boolean;
 }
 /**
  * Retrieval response with assembled context.
@@ -54,32 +39,24 @@ export interface RetrievalResponse {
         sessionSlug: string;
         weight: number;
         preview: string;
-        source?: 'vector' | 'keyword' | 'cluster' | 'graph';
+        source?: 'vector' | 'keyword' | 'cluster';
     }>;
     /** Total chunks considered */
     totalConsidered: number;
     /** Time taken in milliseconds */
     durationMs: number;
-    /** Number of chunks boosted by graph agreement (found by both vector and graph) */
-    graphBoosted: number;
 }
 /**
  * Assemble context from memory based on a query.
- *
- * Pipeline: embed → [vector search, keyword search] → RRF fusion → cluster expansion
- *           → graph traverse → combine → dedupe → recency → budget
+ * Delegates to searchContext (pure search, no graph).
  */
 export declare function assembleContext(request: RetrievalRequest): Promise<RetrievalResponse>;
 /**
- * Recall: retrieve context relevant to a query.
+ * Recall: episodic retrieval walking backward through causal chains.
  */
 export declare function recall(query: string, options?: Partial<RetrievalRequest>): Promise<RetrievalResponse>;
 /**
- * Explain: retrieve context that explains how we got to current state.
- */
-export declare function explain(topic: string, options?: Partial<RetrievalRequest>): Promise<RetrievalResponse>;
-/**
- * Predict: retrieve context that might be relevant next.
+ * Predict: episodic retrieval walking forward through causal chains.
  */
 export declare function predict(context: string, options?: Partial<RetrievalRequest>): Promise<RetrievalResponse>;
 /**

package/dist/retrieval/context-assembler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"context-assembler.d.ts","sourceRoot":"","sources":["../../src/retrieval/context-assembler.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAkBH;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;AAE7D;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,uDAAuD;IACvD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,2EAA2E;IAC3E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,0EAA0E;IAC1E,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAClC,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iCAAiC;IACjC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qBAAqB;IACrB,IAAI,EAAE,aAAa,CAAC;IACpB,8EAA8E;IAC9E,KAAK,CAAC,EAAE,cAAc,CAAC;IACvB,oDAAoD;IACpD,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,oEAAoE;IACpE,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,sEAAsE;IACtE,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,MAAM,EAAE,KAAK,CAAC;QACZ,EAAE,EAAE,MAAM,CAAC;QACX,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,MAAM,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC;KACrD,CAAC,CAAC;IACH,8BAA8B;IAC9B,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,mFAAmF;IACnF,YAAY,EAAE,MAAM,CAAC;CACtB;AAiCD;;;;;GAKG;AACH,wBAAsB,eAAe,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAgM3F;AAyGD;;GAEG;AACH,wBAAsB,MAAM,CAC1B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACtC,OAAO,CAAC,iBAAiB,CAAC,CAM5B;AAED;;GAEG;AACH,wBAAsB,OAAO,CAC3B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACtC,OAAO,CAAC,iBAAiB,CAAC,CAM5B;AAED;;GAEG;AACH,wBAAsB,OAAO,CAC3B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACtC,OAAO,CAAC,iBAAiB,CAAC,CAM5B;AAED;;GAEG;AACH,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAKtD"}
+{"version":3,"file":"context-assembler.d.ts","sourceRoot":"","sources":["../../src/retrieval/context-assembler.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC3E,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAE9E;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,uDAAuD;IACvD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,0EAA0E;IAC1E,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAClC,iCAAiC;IACjC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qBAAqB;IACrB,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAC;IACtC,oDAAoD;IACpD,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,MAAM,EAAE,KAAK,CAAC;QACZ,EAAE,EAAE,MAAM,CAAC;QACX,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,MAAM,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;KAC3C,CAAC,CAAC;IACH,8BAA8B;IAC9B,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAsB,eAAe,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAU3F;AAED;;GAEG;AACH,wBAAsB,MAAM,CAC1B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACtC,OAAO,CAAC,iBAAiB,CAAC,CAU5B;AAED;;GAEG;AACH,wBAAsB,OAAO,CAC3B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACtC,OAAO,CAAC,iBAAiB,CAAC,CAU5B;AAED;;GAEG;AACH,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAEtD"}