cursor-recursive-rag 0.2.0-alpha.2 → 0.2.0

package/dist/services/recursiveRetrieval.d.ts

@@ -0,0 +1,122 @@
+/**
+ * Recursive Retrieval Controller
+ *
+ * Based on the Recursive Language Models paper (Zhang et al., 2024), this controller
+ * implements RLM-style iterative retrieval where the model can examine, filter, and
+ * recursively process context.
+ *
+ * Key features:
+ * - Complexity assessment to decide retrieval strategy
+ * - Iterative processing with action parsing
+ * - Cost tracking across iterations
+ * - Early termination on budget/iteration limits
+ * - Support for both simple and complex queries
+ */
+import type { EnhancedChunk } from '../types/memory.js';
+import type { EnhancedSearchOptions } from '../types/memory.js';
+import type { SearchResult } from '../types/index.js';
+import { type LLMService, type ExecutionStep } from './contextEnvironment.js';
+export interface RetrievalConfig {
+    initialRetrievalK: number;
+    maxIterations: number;
+    enableRecursiveSubCalls: boolean;
+    costBudget: number;
+    timeoutMs: number;
+    complexityThresholds: {
+        simpleMaxContext: number;
+        moderateMaxContext: number;
+    };
+    enableHybridScoring: boolean;
+}
+export declare const DEFAULT_RETRIEVAL_CONFIG: RetrievalConfig;
+export interface RetrieveOptions {
+    searchOptions?: Partial<EnhancedSearchOptions>;
+    forceStrategy?: 'direct' | 'recursive';
+    seedChunkIds?: string[];
+}
+export interface RetrievalResult {
+    chunks: EnhancedChunk[];
+    strategy: 'direct' | 'recursive';
+    iterations: number;
+    cost: number;
+    answer?: string;
+    executionLog?: ExecutionStep[];
+    complexity?: 'simple' | 'moderate' | 'complex';
+    terminationReason?: string;
+}
+export type ComplexityLevel = 'simple' | 'moderate' | 'complex';
+export interface RetrievalAction {
+    type: 'peek' | 'filter' | 'chunk' | 'subQuery' | 'store' | 'answer' | 'search';
+    params: Record<string, unknown>;
+    reasoning?: string;
+}
+interface VectorStoreInterface {
+    search(embedding: number[], options: {
+        topK: number;
+        filter?: Record<string, unknown>;
+    }): Promise<SearchResult[]>;
+    enhancedSearch?(embedding: number[], options: EnhancedSearchOptions): Promise<EnhancedChunk[]>;
+}
+interface EmbeddingsInterface {
+    embed(text: string): Promise<number[]>;
+}
+/**
+ * Recursive Retrieval Controller
+ *
+ * Orchestrates iterative retrieval with complexity assessment and action parsing.
+ */
+export declare class RecursiveRetrievalController {
+    private vectorStore;
+    private embeddings;
+    private llm;
+    private subLlm;
+    private config;
+    private hybridScorer;
+    constructor(vectorStore: VectorStoreInterface, embeddings: EmbeddingsInterface, llm: LLMService, subLlm?: LLMService, config?: Partial<RetrievalConfig>);
+    /**
+     * Execute recursive retrieval for a query
+     */
+    retrieve(query: string, options?: RetrieveOptions): Promise<RetrievalResult>;
+    /**
+     * Assess query complexity to decide strategy
+     * Based on RLM paper: "more complex problems exhibit degradation at shorter lengths"
+     */
+    assessComplexity(query: string, chunks: EnhancedChunk[]): ComplexityLevel;
+    /**
+     * Iterative RLM-style processing
+     */
+    private iterativeProcess;
+    /**
+     * Ask LLM what to do next
+     */
+    private getNextAction;
+    /**
+     * Execute a retrieval action
+     */
+    private executeAction;
+    /**
+     * Parse action from LLM response
+     */
+    private parseAction;
+    /**
+     * Collect relevant chunks from environment
+     */
+    private collectRelevantChunks;
+    /**
+     * Convert SearchResult[] to EnhancedChunk[]
+     */
+    private convertToEnhancedChunks;
+    /**
+     * Update configuration
+     */
+    updateConfig(config: Partial<RetrievalConfig>): void;
+    /**
+     * Get current configuration
+     */
+    getConfig(): RetrievalConfig;
+}
+export declare function createRecursiveRetrievalController(vectorStore: VectorStoreInterface, embeddings: EmbeddingsInterface, llm: LLMService, subLlm?: LLMService, config?: Partial<RetrievalConfig>): RecursiveRetrievalController;
+export declare function getRecursiveRetrievalController(vectorStore: VectorStoreInterface, embeddings: EmbeddingsInterface, llm: LLMService, subLlm?: LLMService, config?: Partial<RetrievalConfig>): RecursiveRetrievalController;
+export declare function resetRecursiveRetrievalController(): void;
+export {};
+//# sourceMappingURL=recursiveRetrieval.d.ts.map

package/dist/services/recursiveRetrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursiveRetrieval.d.ts","sourceRoot":"","sources":["../../src/services/recursiveRetrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAGL,KAAK,UAAU,EACf,KAAK,aAAa,EAKnB,MAAM,yBAAyB,CAAC;AAGjC,MAAM,WAAW,eAAe;IAC9B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,uBAAuB,EAAE,OAAO,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,oBAAoB,EAAE;QACpB,gBAAgB,EAAE,MAAM,CAAC;QACzB,kBAAkB,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF,mBAAmB,EAAE,OAAO,CAAC;CAC9B;AAED,eAAO,MAAM,wBAAwB,EAAE,eAWtC,CAAC;AAEF,MAAM,WAAW,eAAe;IAC9B,aAAa,CAAC,EAAE,OAAO,CAAC,qBAAqB,CAAC,CAAC;IAC/C,aAAa,CAAC,EAAE,QAAQ,GAAG,WAAW,CAAC;IACvC,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,QAAQ,EAAE,QAAQ,GAAG,WAAW,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,aAAa,EAAE,CAAC;IAC/B,UAAU,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;IAC/C,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC;IAC/E,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,UAAU,oBAAoB;IAC5B,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAClH,cAAc,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,qBAAqB,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;CAChG;AAED,UAAU,mBAAmB;IAC3B,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CACxC;AAED;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,OAAO,CAAC,WAAW,CAAuB;IAC1C,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,GAAG,CAAa;IACxB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,YAAY,CAAe;gBAGjC,WAAW,EAAE,oBAAoB,EACjC,UAAU,EAAE,mBAAmB,EAC/B,GAAG,EAAE,UAAU,EACf,MAAM,CAAC,EAAE,UAAU,EACnB,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC;IAanC;;OAEG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC;IAmFlF;;;OAGG;IACH,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,GAAG,eAAe;IAgCzE;;OAEG;YACW,gBAAgB;IAkE9B;;OAEG;YACW,aAAa;IAqD3B;;OAEG;YACW,aAAa;IAuE3B;;OAEG;IACH,OAAO,CAAC,WAAW;IAkDnB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAoB7B;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAsB/B;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI;IAOpD;;OAEG;IACH,SAAS,IAAI,eAAe;CAG7B;AAID,wBAAgB,kCAAkC,CAChD,WAAW,EAAE,oBAAoB,EACjC,UAAU,EAAE,mBAAmB,EAC/B,GAAG,EAAE,UAAU,EACf,MAAM,CAAC,EAAE,UAAU,EACnB,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,GAChC,4BAA4B,CAE9B;AAED,wBAAgB,+BAA+B,CAC7C,WAAW,EAAE,oBAAoB,EACjC,UAAU,EAAE,mBAAmB,EAC/B,GAAG,EAAE,UAAU,EACf,MAAM,CAAC,EAAE,UAAU,EACnB,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,GAChC,4BAA4B,CAK9B;AAED,wBAAgB,iCAAiC,IAAI,IAAI,CAExD"}

package/dist/services/recursiveRetrieval.js

@@ -0,0 +1,443 @@
+/**
+ * Recursive Retrieval Controller
+ *
+ * Based on the Recursive Language Models paper (Zhang et al., 2024), this controller
+ * implements RLM-style iterative retrieval where the model can examine, filter, and
+ * recursively process context.
+ *
+ * Key features:
+ * - Complexity assessment to decide retrieval strategy
+ * - Iterative processing with action parsing
+ * - Cost tracking across iterations
+ * - Early termination on budget/iteration limits
+ * - Support for both simple and complex queries
+ */
+import { createContextEnvironment, BudgetExceededError, LimitExceededError, TimeoutError, } from './contextEnvironment.js';
+import { getHybridScorer } from './hybridScorer.js';
+export const DEFAULT_RETRIEVAL_CONFIG = {
+    initialRetrievalK: 20,
+    maxIterations: 10,
+    enableRecursiveSubCalls: true,
+    costBudget: 0.50,
+    timeoutMs: 120000,
+    complexityThresholds: {
+        simpleMaxContext: 50000,
+        moderateMaxContext: 200000,
+    },
+    enableHybridScoring: true,
+};
+/**
+ * Recursive Retrieval Controller
+ *
+ * Orchestrates iterative retrieval with complexity assessment and action parsing.
+ */
+export class RecursiveRetrievalController {
+    vectorStore;
+    embeddings;
+    llm;
+    subLlm;
+    config;
+    hybridScorer;
+    constructor(vectorStore, embeddings, llm, subLlm, config) {
+        this.vectorStore = vectorStore;
+        this.embeddings = embeddings;
+        this.llm = llm;
+        this.subLlm = subLlm ?? llm;
+        this.config = {
+            ...DEFAULT_RETRIEVAL_CONFIG,
+            ...config,
+        };
+        this.hybridScorer = getHybridScorer();
+    }
+    /**
+     * Execute recursive retrieval for a query
+     */
+    async retrieve(query, options) {
+        // Step 1: Initial retrieval
+        const embedding = await this.embeddings.embed(query);
+        const searchOptions = {
+            topK: this.config.initialRetrievalK,
+            ...options?.searchOptions,
+        };
+        const rawResults = await this.vectorStore.search(embedding, searchOptions);
+        // Convert SearchResult[] to EnhancedChunk[]
+        const initialChunks = this.convertToEnhancedChunks(rawResults);
+        // Apply hybrid scoring if enabled
+        let scoredChunks = initialChunks;
+        if (this.config.enableHybridScoring && initialChunks.length > 0) {
+            const searchResultInputs = rawResults.map(r => ({
+                id: r.id,
+                content: r.content,
+                score: r.score,
+                metadata: r.metadata,
+            }));
+            const scoredResults = await this.hybridScorer.scoreResults(searchResultInputs, query, { seedChunkIds: options?.seedChunkIds });
+            // Re-order chunks based on hybrid scores
+            const idToScore = new Map(scoredResults.map(r => [r.id, r.finalScore]));
+            scoredChunks = [...initialChunks].sort((a, b) => {
+                const scoreA = idToScore.get(a.id) ?? 0;
+                const scoreB = idToScore.get(b.id) ?? 0;
+                return scoreB - scoreA;
+            });
+        }
+        // Step 2: Check for forced strategy
+        if (options?.forceStrategy === 'direct') {
+            return {
+                chunks: scoredChunks,
+                strategy: 'direct',
+                iterations: 1,
+                cost: 0,
+                complexity: 'simple',
+            };
+        }
+        // Step 3: Assess complexity
+        const complexity = this.assessComplexity(query, scoredChunks);
+        if (options?.forceStrategy === 'recursive') {
+            // Force recursive even for simple queries
+        }
+        else if (complexity === 'simple') {
+            return {
+                chunks: scoredChunks,
+                strategy: 'direct',
+                iterations: 1,
+                cost: 0,
+                complexity,
+            };
+        }
+        // Step 4: Complex query - use RLM-style processing
+        const envConfig = {
+            maxIterations: this.config.maxIterations,
+            costBudget: this.config.costBudget,
+            timeoutMs: this.config.timeoutMs,
+            enableAsyncSubCalls: this.config.enableRecursiveSubCalls,
+        };
+        const env = createContextEnvironment(envConfig);
+        env.loadContext(scoredChunks);
+        const result = await this.iterativeProcess(query, env);
+        return {
+            ...result,
+            complexity,
+        };
+    }
+    /**
+     * Assess query complexity to decide strategy
+     * Based on RLM paper: "more complex problems exhibit degradation at shorter lengths"
+     */
+    assessComplexity(query, chunks) {
+        const totalContext = chunks.reduce((sum, c) => sum + c.content.length, 0);
+        // Check query patterns that indicate complexity
+        const aggregationKeywords = /how many|count|list all|compare|summarize|aggregate|total|average/i;
+        const multiHopKeywords = /because|therefore|which.*then|after.*when|relationship|connected|related/i;
+        const analysisKeywords = /analyze|evaluate|assess|review|investigate|examine/i;
+        const isAggregation = aggregationKeywords.test(query);
+        const isMultiHop = multiHopKeywords.test(query);
+        const isAnalysis = analysisKeywords.test(query);
+        // Small context and simple query
+        if (totalContext < this.config.complexityThresholds.simpleMaxContext) {
+            if (!isAggregation && !isMultiHop && !isAnalysis) {
+                return 'simple';
+            }
+            return 'moderate';
+        }
+        // Medium context
+        if (totalContext < this.config.complexityThresholds.moderateMaxContext) {
+            if (isAggregation || isMultiHop || isAnalysis) {
+                return 'complex';
+            }
+            return 'moderate';
+        }
+        // Large context is always complex
+        return 'complex';
+    }
+    /**
+     * Iterative RLM-style processing
+     */
+    async iterativeProcess(query, env) {
+        let iteration = 0;
+        let answer;
+        let terminationReason;
+        while (iteration < this.config.maxIterations) {
+            iteration++;
+            env.markIteration(iteration);
+            // Check termination conditions
+            const termCheck = env.shouldTerminate();
+            if (termCheck.terminate) {
+                terminationReason = termCheck.reason;
+                break;
+            }
+            try {
+                // Get next action from LLM
+                const action = await this.getNextAction(query, env, iteration);
+                if (action.type === 'answer') {
+                    answer = action.params.value;
+                    terminationReason = 'Answer found';
+                    break;
+                }
+                // Execute the action
+                await this.executeAction(action, env, query);
+            }
+            catch (error) {
+                if (error instanceof BudgetExceededError) {
+                    terminationReason = 'Budget exceeded';
+                    break;
+                }
+                if (error instanceof LimitExceededError) {
+                    terminationReason = 'Sub-call limit exceeded';
+                    break;
+                }
+                if (error instanceof TimeoutError) {
+                    terminationReason = 'Timeout';
+                    break;
+                }
+                throw error;
+            }
+        }
+        if (!terminationReason && iteration >= this.config.maxIterations) {
+            terminationReason = 'Max iterations reached';
+        }
+        // Collect relevant chunks from the environment
+        const relevantChunks = this.collectRelevantChunks(env);
+        return {
+            chunks: relevantChunks,
+            strategy: 'recursive',
+            iterations: iteration,
+            cost: env.getTotalCost(),
+            answer,
+            executionLog: env.getExecutionLog(),
+            terminationReason,
+        };
+    }
+    /**
+     * Ask LLM what to do next
+     */
+    async getNextAction(query, env, iteration) {
+        const prompt = `You are processing a query using a context environment. Your goal is to find relevant information efficiently.
+
+## Query
+${query}
+
+${env.getStateDescription()}
+
+## Chunk Summary
+${env.getChunkSummary()}
+
+## Iteration ${iteration}
+
+Based on the query and current state, decide your next action. Available actions:
+
+1. **peek** - Look at specific chunks to understand content
+   \`{"type": "peek", "params": {"variable": "context", "start": 0, "end": 3}}\`
+
+2. **filter** - Filter chunks by keyword/pattern to narrow down
+   \`{"type": "filter", "params": {"variable": "context", "pattern": "error|exception", "output": "errors"}}\`
+
+3. **subQuery** - Ask a focused question about a subset of context
+   \`{"type": "subQuery", "params": {"query": "What error handling patterns are used?", "variable": "context"}}\`
+
+4. **store** - Store intermediate findings
+   \`{"type": "store", "params": {"variable": "findings", "value": "..."}}\`
+
+5. **answer** - Provide final answer if you have enough information
+   \`{"type": "answer", "params": {"value": "The answer based on the context is..."}}\`
+
+Respond with ONLY a JSON action:
+\`\`\`json
+{
+  "type": "...",
+  "params": { ... },
+  "reasoning": "brief explanation"
+}
+\`\`\`
+
+Be efficient - filter first before examining everything. Use subQuery for semantic understanding.`;
+        const response = await this.llm.invoke(prompt, {
+            maxTokens: 1000,
+            temperature: 0.2,
+        });
+        return this.parseAction(response);
+    }
+    /**
+     * Execute a retrieval action
+     */
+    async executeAction(action, env, query) {
+        switch (action.type) {
+            case 'peek': {
+                const variable = action.params.variable ?? 'context';
+                const start = action.params.start;
+                const end = action.params.end;
+                const peekResult = env.peek(variable, start, end);
+                env.store('_lastPeek', peekResult);
+                break;
+            }
+            case 'filter': {
+                const variable = action.params.variable ?? 'context';
+                const pattern = action.params.pattern;
+                const output = action.params.output ?? 'filtered';
+                const count = env.filterAndStore(variable, pattern, output);
+                env.store('_lastFilterCount', count);
+                break;
+            }
+            case 'chunk': {
+                const variable = action.params.variable ?? 'context';
+                const size = action.params.size ?? 5;
+                const batches = env.chunk(variable, size);
+                for (let i = 0; i < batches.length; i++) {
+                    env.loadContext(batches[i], `batch_${i}`);
+                }
+                env.store('_batchCount', batches.length);
+                break;
+            }
+            case 'subQuery': {
+                const subQuery = action.params.query;
+                const variable = action.params.variable ?? 'context';
+                const chunks = env.getChunks(variable);
+                if (chunks.length > 0) {
+                    const response = await env.subQuery(this.subLlm, subQuery, chunks);
+                    const outputVar = action.params.output ?? '_lastSubQuery';
+                    env.store(outputVar, response);
+                }
+                break;
+            }
+            case 'store': {
+                const variable = action.params.variable;
+                const value = action.params.value;
+                env.store(variable, value);
+                break;
+            }
+            case 'search': {
+                // Additional search with different parameters
+                const searchQuery = action.params.query ?? query;
+                const embedding = await this.embeddings.embed(searchQuery);
+                const topK = action.params.topK ?? 10;
+                const results = await this.vectorStore.search(embedding, { topK });
+                const chunks = this.convertToEnhancedChunks(results);
+                const outputVar = action.params.output ?? 'additionalResults';
+                env.loadContext(chunks, outputVar);
+                break;
+            }
+        }
+    }
+    /**
+     * Parse action from LLM response
+     */
+    parseAction(response) {
+        // Try to extract JSON from response
+        const jsonMatch = response.match(/```json\s*([\s\S]*?)\s*```/);
+        const jsonStr = jsonMatch ? jsonMatch[1] : response;
+        try {
+            // Try direct JSON parse
+            const action = JSON.parse(jsonStr.trim());
+            // Validate action type
+            const validTypes = ['peek', 'filter', 'chunk', 'subQuery', 'store', 'answer', 'search'];
+            if (!validTypes.includes(action.type)) {
+                // Default to answer if we can't parse
+                return {
+                    type: 'answer',
+                    params: { value: response },
+                    reasoning: 'Could not parse valid action',
+                };
+            }
+            return {
+                type: action.type,
+                params: action.params || {},
+                reasoning: action.reasoning,
+            };
+        }
+        catch {
+            // Try to find JSON object in response
+            const objectMatch = response.match(/\{[\s\S]*\}/);
+            if (objectMatch) {
+                try {
+                    const action = JSON.parse(objectMatch[0]);
+                    return {
+                        type: action.type || 'answer',
+                        params: action.params || { value: response },
+                        reasoning: action.reasoning,
+                    };
+                }
+                catch {
+                    // Fall through to default
+                }
+            }
+            // Default: treat entire response as answer
+            return {
+                type: 'answer',
+                params: { value: response },
+                reasoning: 'Could not parse action JSON',
+            };
+        }
+    }
+    /**
+     * Collect relevant chunks from environment
+     */
+    collectRelevantChunks(env) {
+        const allChunks = [];
+        const seenIds = new Set();
+        // Collect from all chunk variables
+        for (const varName of env.listVariables()) {
+            if (varName.startsWith('_'))
+                continue; // Skip internal variables
+            const chunks = env.getChunks(varName);
+            for (const chunk of chunks) {
+                if (!seenIds.has(chunk.id)) {
+                    seenIds.add(chunk.id);
+                    allChunks.push(chunk);
+                }
+            }
+        }
+        return allChunks;
+    }
+    /**
+     * Convert SearchResult[] to EnhancedChunk[]
+     */
+    convertToEnhancedChunks(results) {
+        return results.map(r => ({
+            id: r.id,
+            content: r.content,
+            embedding: [],
+            source: r.metadata?.source || 'unknown',
+            metadata: r.metadata,
+            createdAt: r.metadata?.createdAt ? new Date(r.metadata.createdAt) : new Date(),
+            updatedAt: r.metadata?.updatedAt ? new Date(r.metadata.updatedAt) : new Date(),
+            lastAccessedAt: r.metadata?.lastAccessedAt ? new Date(r.metadata.lastAccessedAt) : null,
+            accessCount: r.metadata?.accessCount || 0,
+            importance: r.metadata?.importance || 0.5,
+            decayScore: r.metadata?.decayScore || 1.0,
+            isArchived: r.metadata?.isArchived || false,
+            chunkType: r.metadata?.chunkType || 'documentation',
+            relatedChunkIds: r.metadata?.relatedChunkIds || [],
+            entities: r.metadata?.entities || [],
+            sourceConversationId: r.metadata?.sourceConversationId,
+            sourceMessageIndex: r.metadata?.sourceMessageIndex,
+        }));
+    }
+    /**
+     * Update configuration
+     */
+    updateConfig(config) {
+        this.config = {
+            ...this.config,
+            ...config,
+        };
+    }
+    /**
+     * Get current configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+let instance = null;
+export function createRecursiveRetrievalController(vectorStore, embeddings, llm, subLlm, config) {
+    return new RecursiveRetrievalController(vectorStore, embeddings, llm, subLlm, config);
+}
+export function getRecursiveRetrievalController(vectorStore, embeddings, llm, subLlm, config) {
+    if (!instance) {
+        instance = new RecursiveRetrievalController(vectorStore, embeddings, llm, subLlm, config);
+    }
+    return instance;
+}
+export function resetRecursiveRetrievalController() {
+    instance = null;
+}
+//# sourceMappingURL=recursiveRetrieval.js.map

package/dist/services/recursiveRetrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursiveRetrieval.js","sourceRoot":"","sources":["../../src/services/recursiveRetrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,OAAO,EAEL,wBAAwB,EAIxB,mBAAmB,EACnB,kBAAkB,EAClB,YAAY,GACb,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAgB,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAelE,MAAM,CAAC,MAAM,wBAAwB,GAAoB;IACvD,iBAAiB,EAAE,EAAE;IACrB,aAAa,EAAE,EAAE;IACjB,uBAAuB,EAAE,IAAI;IAC7B,UAAU,EAAE,IAAI;IAChB,SAAS,EAAE,MAAM;IACjB,oBAAoB,EAAE;QACpB,gBAAgB,EAAE,KAAK;QACvB,kBAAkB,EAAE,MAAM;KAC3B;IACD,mBAAmB,EAAE,IAAI;CAC1B,CAAC;AAoCF;;;;GAIG;AACH,MAAM,OAAO,4BAA4B;IAC/B,WAAW,CAAuB;IAClC,UAAU,CAAsB;IAChC,GAAG,CAAa;IAChB,MAAM,CAAa;IACnB,MAAM,CAAkB;IACxB,YAAY,CAAe;IAEnC,YACE,WAAiC,EACjC,UAA+B,EAC/B,GAAe,EACf,MAAmB,EACnB,MAAiC;QAEjC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,GAAG,CAAC;QAC5B,IAAI,CAAC,MAAM,GAAG;YACZ,GAAG,wBAAwB;YAC3B,GAAG,MAAM;SACV,CAAC;QACF,IAAI,CAAC,YAAY,GAAG,eAAe,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,OAAyB;QACrD,4BAA4B;QAC5B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG;YACpB,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,iBAAiB;YACnC,GAAG,OAAO,EAAE,aAAa;SAC1B,CAAC;QAEF,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QAE3E,4CAA4C;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAE/D,kCAAkC;QAClC,IAAI,YAAY,GAAG,aAAa,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChE,MAAM,kBAAkB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,QAAQ,EAAE,CAAC,CAAC,QAAQ;aACrB,CAAC,CAAC,CAAC;YAEJ,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CACxD,kBAAkB,EAClB,KAAK,EACL,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,CACxC,CAAC;YAEF,yCAAyC;YACzC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxE,YAAY,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACxC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACxC,OAAO,MAAM,GAAG,MAAM,CAAC;YACzB,CAAC,CAAC,CAAC;QACL,CAAC;QAED,oCAAoC;QACpC,IAAI,OAAO,EAAE,aAAa,KAAK,QAAQ,EAAE,CAAC;YACxC,OAAO;gBACL,MAAM,EAAE,YAAY;gBACpB,QAAQ,EAAE,QAAQ;gBAClB,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,CAAC;gBACP,UAAU,EAAE,QAAQ;aACrB,CAAC;QACJ,CAAC;QAED,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAE9D,IAAI,OAAO,EAAE,aAAa,KAAK,WAAW,EAAE,CAAC;YAC3C,0CAA0C;QAC5C,CAAC;aAAM,IAAI,UAAU,KAAK,QAAQ,EAAE,CAAC;YACnC,OAAO;gBACL,MAAM,EAAE,YAAY;gBACpB,QAAQ,EAAE,QAAQ;gBAClB,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,CAAC;gBACP,UAAU;aACX,CAAC;QACJ,CAAC;QAED,mDAAmD;QACnD,MAAM,SAAS,GAA+B;YAC5C,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACxC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU;YAClC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;YAChC,mBAAmB,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB;SACzD,CAAC;QAEF,MAAM,GAAG,GAAG,wBAAwB,CAAC,SAAS,CAAC,CAAC;QAChD,GAAG,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QAE9B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEvD,OAAO;YACL,GAAG,MAAM;YACT,UAAU;SACX,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,KAAa,EAAE,MAAuB;QACrD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAE1E,gDAAgD;QAChD,MAAM,mBAAmB,GAAG,oEAAoE,CAAC;QACjG,MAAM,gBAAgB,GAAG,2EAA2E,CAAC;QACrG,MAAM,gBAAgB,GAAG,qDAAqD,CAAC;QAE/E,MAAM,aAAa,GAAG,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhD,iCAAiC;QACjC,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,gBAAgB,EAAE,CAAC;YACrE,IAAI,CAAC,aAAa,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;gBACjD,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,iBAAiB;QACjB,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,kBAAkB,EAAE,CAAC;YACvE,IAAI,aAAa,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;gBAC9C,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,kCAAkC;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,KAAa,EACb,GAAuB;QAEvB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,MAA0B,CAAC;QAC/B,IAAI,iBAAqC,CAAC;QAE1C,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;YAC7C,SAAS,EAAE,CAAC;YACZ,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAE7B,+BAA+B;YAC/B,MAAM,SAAS,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;gBACxB,iBAAiB,GAAG,SAAS,CAAC,MAAM,CAAC;gBACrC,MAAM;YACR,CAAC;YAED,IAAI,CAAC;gBACH,2BAA2B;gBAC3B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;gBAE/D,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAC7B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAe,CAAC;oBACvC,iBAAiB,GAAG,cAAc,CAAC;oBACnC,MAAM;gBACR,CAAC;gBAED,qBAAqB;gBACrB,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC/C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,mBAAmB,EAAE,CAAC;oBACzC,iBAAiB,GAAG,iBAAiB,CAAC;oBACtC,MAAM;gBACR,CAAC;gBACD,IAAI,KAAK,YAAY,kBAAkB,EAAE,CAAC;oBACxC,iBAAiB,GAAG,yBAAyB,CAAC;oBAC9C,MAAM;gBACR,CAAC;gBACD,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;oBAClC,iBAAiB,GAAG,SAAS,CAAC;oBAC9B,MAAM;gBACR,CAAC;gBACD,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,CAAC,iBAAiB,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;YACjE,iBAAiB,GAAG,wBAAwB,CAAC;QAC/C,CAAC;QAED,+CAA+C;QAC/C,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAEvD,OAAO;YACL,MAAM,EAAE,cAAc;YACtB,QAAQ,EAAE,WAAW;YACrB,UAAU,EAAE,SAAS;YACrB,IAAI,EAAE,GAAG,CAAC,YAAY,EAAE;YACxB,MAAM;YACN,YAAY,EAAE,GAAG,CAAC,eAAe,EAAE;YACnC,iBAAiB;SAClB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CACzB,KAAa,EACb,GAAuB,EACvB,SAAiB;QAEjB,MAAM,MAAM,GAAG;;;EAGjB,KAAK;;EAEL,GAAG,CAAC,mBAAmB,EAAE;;;EAGzB,GAAG,CAAC,eAAe,EAAE;;eAER,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;;;;kGA4B0E,CAAC;QAE/F,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE;YAC7C,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,GAAG;SACjB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CACzB,MAAuB,EACvB,GAAuB,EACvB,KAAa;QAEb,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,QAAQ,GAAI,MAAM,CAAC,MAAM,CAAC,QAAmB,IAAI,SAAS,CAAC;gBACjE,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAA2B,CAAC;gBACxD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAyB,CAAC;gBACpD,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;gBAClD,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBACnC,MAAM;YACR,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,QAAQ,GAAI,MAAM,CAAC,MAAM,CAAC,QAAmB,IAAI,SAAS,CAAC;gBACjE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,OAAiB,CAAC;gBAChD,MAAM,MAAM,GAAI,MAAM,CAAC,MAAM,CAAC,MAAiB,IAAI,UAAU,CAAC;gBAC9D,MAAM,KAAK,GAAG,GAAG,CAAC,cAAc,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC5D,GAAG,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAC;gBACrC,MAAM;YACR,CAAC;YAED,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,QAAQ,GAAI,MAAM,CAAC,MAAM,CAAC,QAAmB,IAAI,SAAS,CAAC;gBACjE,MAAM,IAAI,GAAI,MAAM,CAAC,MAAM,CAAC,IAAe,IAAI,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACxC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;gBAC5C,CAAC;gBACD,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBACzC,MAAM;YACR,CAAC;YAED,KAAK,UAAU,CAAC,CAAC,CAAC;gBAChB,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,KAAe,CAAC;gBAC/C,MAAM,QAAQ,GAAI,MAAM,CAAC,MAAM,CAAC,QAAmB,IAAI,SAAS,CAAC;gBACjE,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;gBAEvC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;oBACnE,MAAM,SAAS,GAAI,MAAM,CAAC,MAAM,CAAC,MAAiB,IAAI,eAAe,CAAC;oBACtE,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBACjC,CAAC;gBACD,MAAM;YACR,CAAC;YAED,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,QAAkB,CAAC;gBAClD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBAClC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBAC3B,MAAM;YACR,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,8CAA8C;gBAC9C,MAAM,WAAW,GAAI,MAAM,CAAC,MAAM,CAAC,KAAgB,IAAI,KAAK,CAAC;gBAC7D,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC3D,MAAM,IAAI,GAAI,MAAM,CAAC,MAAM,CAAC,IAAe,IAAI,EAAE,CAAC;gBAElD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;gBAErD,MAAM,SAAS,GAAI,MAAM,CAAC,MAAM,CAAC,MAAiB,IAAI,mBAAmB,CAAC;gBAC1E,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBACnC,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,QAAgB;QAClC,oCAAoC;QACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAEpD,IAAI,CAAC;YACH,wBAAwB;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;YAE1C,uBAAuB;YACvB,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxF,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,sCAAsC;gBACtC,OAAO;oBACL,IAAI,EAAE,QAAQ;oBACd,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE;oBAC3B,SAAS,EAAE,8BAA8B;iBAC1C,CAAC;YACJ,CAAC;YAED,OAAO;gBACL,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE;gBAC3B,SAAS,EAAE,MAAM,CAAC,SAAS;aAC5B,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,sCAAsC;YACtC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAClD,IAAI,WAAW,EAAE,CAAC;gBAChB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1C,OAAO;wBACL,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,QAAQ;wBAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE;wBAC5C,SAAS,EAAE,MAAM,CAAC,SAAS;qBAC5B,CAAC;gBACJ,CAAC;gBAAC,MAAM,CAAC;oBACP,0BAA0B;gBAC5B,CAAC;YACH,CAAC;YAED,2CAA2C;YAC3C,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE;gBAC3B,SAAS,EAAE,6BAA6B;aACzC,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,GAAuB;QACnD,MAAM,SAAS,GAAoB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,mCAAmC;QACnC,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC;YAC1C,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,0BAA0B;YAEjE,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACtC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACtB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,OAAuB;QACrD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,SAAS,EAAE,EAAE;YACb,MAAM,EAAG,CAAC,CAAC,QAAQ,EAAE,MAAiB,IAAI,SAAS;YACnD,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,SAAS,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;YACxF,SAAS,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;YACxF,cAAc,EAAE,CAAC,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAwB,CAAC,CAAC,CAAC,CAAC,IAAI;YACjG,WAAW,EAAG,CAAC,CAAC,QAAQ,EAAE,WAAsB,IAAI,CAAC;YACrD,UAAU,EAAG,CAAC,CAAC,QAAQ,EAAE,UAAqB,IAAI,GAAG;YACrD,UAAU,EAAG,CAAC,CAAC,QAAQ,EAAE,UAAqB,IAAI,GAAG;YACrD,UAAU,EAAG,CAAC,CAAC,QAAQ,EAAE,UAAsB,IAAI,KAAK;YACxD,SAAS,EAAG,CAAC,CAAC,QAAQ,EAAE,SAAwC,IAAI,eAAe;YACnF,eAAe,EAAG,CAAC,CAAC,QAAQ,EAAE,eAA4B,IAAI,EAAE;YAChE,QAAQ,EAAG,CAAC,CAAC,QAAQ,EAAE,QAAsC,IAAI,EAAE;YACnE,oBAAoB,EAAE,CAAC,CAAC,QAAQ,EAAE,oBAA0C;YAC5E,kBAAkB,EAAE,CAAC,CAAC,QAAQ,EAAE,kBAAwC;SACzE,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAgC;QAC3C,IAAI,CAAC,MAAM,GAAG;YACZ,GAAG,IAAI,CAAC,MAAM;YACd,GAAG,MAAM;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF;AAED,IAAI,QAAQ,GAAwC,IAAI,CAAC;AAEzD,MAAM,UAAU,kCAAkC,CAChD,WAAiC,EACjC,UAA+B,EAC/B,GAAe,EACf,MAAmB,EACnB,MAAiC;IAEjC,OAAO,IAAI,4BAA4B,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACxF,CAAC;AAED,MAAM,UAAU,+BAA+B,CAC7C,WAAiC,EACjC,UAA+B,EAC/B,GAAe,EACf,MAAmB,EACnB,MAAiC;IAEjC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,QAAQ,GAAG,IAAI,4BAA4B,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,iCAAiC;IAC/C,QAAQ,GAAG,IAAI,CAAC;AAClB,CAAC"}

package/dist/services/relationshipGraph.d.ts

@@ -0,0 +1,77 @@
+import { type GraphTraversalOptions, type GraphTraversalResult, type Contradiction, type PotentialContradiction, type GraphStats, type FindRelatedOptions, type RelatedChunk, type RelationshipBatch, type RelationshipBatchResult } from '../types/relationships.js';
+import { ChunkType, RelationshipType } from '../types/memory.js';
+import { MemoryMetadataStore } from './memoryMetadataStore.js';
+/**
+ * Graph operations for relationship-based retrieval
+ *
+ * This service provides graph traversal, contradiction detection, and
+ * relationship management capabilities for the knowledge base.
+ */
+export declare class RelationshipGraph {
+    private metadataStore;
+    constructor(metadataStore?: MemoryMetadataStore);
+    /**
+     * Add a relationship between two chunks
+     */
+    addRelationship(fromId: string, toId: string, type: RelationshipType, options?: {
+        strength?: number;
+        bidirectional?: boolean;
+        metadata?: Record<string, unknown>;
+    }): void;
+    /**
+     * Add multiple relationships in a batch
+     */
+    addRelationshipBatch(batch: RelationshipBatch): RelationshipBatchResult;
+    /**
+     * Remove a relationship between two chunks
+     */
+    removeRelationship(fromId: string, toId: string, type: RelationshipType): void;
+    /**
+     * Traverse the graph from a starting chunk using BFS
+     */
+    traverse(startChunkId: string, options?: Partial<GraphTraversalOptions>): GraphTraversalResult;
+    /**
+     * Find all chunks related to a given chunk
+     */
+    findRelated(chunkId: string, options?: FindRelatedOptions): RelatedChunk[];
+    /**
+     * Find known contradictions for a chunk
+     */
+    findContradictions(chunkId: string): Contradiction[];
+    /**
+     * Detect potential contradictions for a new chunk based on similarity and temporal factors
+     */
+    detectPotentialContradictions(newChunkId: string, newChunkType: ChunkType, newChunkCreatedAt: Date, similarChunks: Array<{
+        id: string;
+        similarity: number;
+        chunkType: ChunkType;
+        createdAt: string;
+    }>): PotentialContradiction[];
+    /**
+     * Mark a chunk as superseding another
+     */
+    markSupersedes(newChunkId: string, oldChunkId: string, strength?: number): void;
+    /**
+     * Mark two chunks as contradicting each other
+     */
+    markContradiction(chunkId1: string, chunkId2: string, strength?: number, metadata?: Record<string, unknown>): void;
+    /**
+     * Find all chunks that supersede a given chunk (chain of updates)
+     */
+    findSupersessionChain(chunkId: string): string[];
+    /**
+     * Get the latest version in a supersession chain
+     */
+    getLatestVersion(chunkId: string): string;
+    /**
+     * Get graph statistics
+     */
+    getStats(): GraphStats;
+    /**
+     * Find strongly connected components (clusters of related knowledge)
+     */
+    findClusters(minClusterSize?: number): string[][];
+}
+export declare function getRelationshipGraph(metadataStore?: MemoryMetadataStore): RelationshipGraph;
+export declare function resetRelationshipGraph(): void;
+//# sourceMappingURL=relationshipGraph.d.ts.map

package/dist/services/relationshipGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationshipGraph.d.ts","sourceRoot":"","sources":["../../src/services/relationshipGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,qBAAqB,EAE1B,KAAK,oBAAoB,EACzB,KAAK,aAAa,EAClB,KAAK,sBAAsB,EAC3B,KAAK,UAAU,EACf,KAAK,kBAAkB,EACvB,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,uBAAuB,EAK7B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,mBAAmB,EAA0B,MAAM,0BAA0B,CAAC;AAEvF;;;;;GAKG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,aAAa,CAAsB;gBAE/B,aAAa,CAAC,EAAE,mBAAmB;IAI/C;;OAEG;IACH,eAAe,CACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,gBAAgB,EACtB,OAAO,CAAC,EAAE;QACR,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,aAAa,CAAC,EAAE,OAAO,CAAC;QACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,GACA,IAAI;IAwBP;;OAEG;IACH,oBAAoB,CAAC,KAAK,EAAE,iBAAiB,GAAG,uBAAuB;IA6BvE;;OAEG;IACH,kBAAkB,CAChB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,gBAAgB,GACrB,IAAI;IASP;;OAEG;IACH,QAAQ,CACN,YAAY,EAAE,MAAM,EACpB,OAAO,GAAE,OAAO,CAAC,qBAAqB,CAAM,GAC3C,oBAAoB;IAmFvB;;OAEG;IACH,WAAW,CACT,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,kBAAuB,GAC/B,YAAY,EAAE;IA+DjB;;OAEG;IACH,kBAAkB,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,EAAE;IAoCpD;;OAEG;IACH,6BAA6B,CAC3B,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,SAAS,EACvB,iBAAiB,EAAE,IAAI,EACvB,aAAa,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,SAAS,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,GAChG,sBAAsB,EAAE;IAiD3B;;OAEG;IACH,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,IAAI;IASpF;;OAEG;IACH,iBAAiB,CACf,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,GAAE,MAAY,EACtB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,IAAI;IAWP;;OAEG;IACH,qBAAqB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE;IAqBhD;;OAEG;IACH,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAKzC;;OAEG;IACH,QAAQ,IAAI,UAAU;IA2DtB;;OAEG;IACH,YAAY,CAAC,cAAc,GAAE,MAAU,GAAG,MAAM,EAAE,EAAE;CAiCrD;AAID,wBAAgB,oBAAoB,CAAC,aAAa,CAAC,EAAE,mBAAmB,GAAG,iBAAiB,CAK3F;AAED,wBAAgB,sBAAsB,IAAI,IAAI,CAE7C"}