driftdetect-cortex 0.9.41

package/dist/retrieval/engine.d.ts

@@ -0,0 +1,112 @@
+/**
+ * Retrieval Engine
+ *
+ * Main orchestrator for memory retrieval.
+ * Gathers candidates from multiple sources, scores them,
+ * applies intent weighting, and fits to token budget.
+ */
+import type { Memory } from '../types/index.js';
+import type { IMemoryStorage } from '../storage/interface.js';
+import type { IEmbeddingProvider } from '../embeddings/interface.js';
+/**
+ * Intent types for retrieval
+ */
+export type Intent = 'add_feature' | 'fix_bug' | 'refactor' | 'security_audit' | 'understand_code' | 'add_test';
+/**
+ * Context for retrieval
+ */
+export interface RetrievalContext {
+    /** What the user is trying to do */
+    intent: Intent;
+    /** What they're working on */
+    focus: string;
+    /** Currently active file */
+    activeFile?: string;
+    /** Currently active function */
+    activeFunction?: string;
+    /** Recently accessed files */
+    recentFiles?: string[];
+    /** Relevant pattern IDs */
+    relevantPatterns?: string[];
+    /** Relevant constraint IDs */
+    relevantConstraints?: string[];
+    /** Call graph context (function IDs) */
+    callGraphContext?: string[];
+    /** Security context (sensitive areas) */
+    securityContext?: string[];
+    /** Maximum tokens to use */
+    maxTokens?: number;
+    /** Maximum memories to return */
+    maxMemories?: number;
+}
+/**
+ * Result of retrieval
+ */
+export interface RetrievalResult {
+    /** Retrieved memories with compression level */
+    memories: CompressedMemory[];
+    /** Total tokens used */
+    tokensUsed: number;
+    /** Total candidates considered */
+    totalCandidates: number;
+    /** Time taken in ms */
+    retrievalTime: number;
+}
+/**
+ * A memory with compression information
+ */
+export interface CompressedMemory {
+    /** The memory */
+    memory: Memory;
+    /** Compression level */
+    level: 'summary' | 'expanded' | 'full';
+    /** Token count at this level */
+    tokens: number;
+    /** Relevance score */
+    relevanceScore: number;
+}
+/**
+ * Retrieval engine
+ */
+export declare class RetrievalEngine {
+    private storage;
+    private embeddings;
+    private scorer;
+    private weighter;
+    private budgetManager;
+    private ranker;
+    constructor(storage: IMemoryStorage, embeddings: IEmbeddingProvider);
+    /**
+     * Retrieve memories for a context
+     */
+    retrieve(context: RetrievalContext): Promise<RetrievalResult>;
+    /**
+     * Gather candidates from multiple sources
+     */
+    private gatherCandidates;
+    /**
+     * Search by topic using embeddings
+     */
+    private searchByTopic;
+    /**
+     * Get memories linked to patterns
+     */
+    private getPatternMemories;
+    /**
+     * Get memories linked to constraints
+     */
+    private getConstraintMemories;
+    /**
+     * Get memories linked to files
+     */
+    private getFileMemories;
+    /**
+     * Get memories linked to functions
+     */
+    private getFunctionMemories;
+    /**
+     * Get security-related memories
+     */
+    private getSecurityMemories;
+}
+//# sourceMappingURL=engine.d.ts.map

package/dist/retrieval/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../../src/retrieval/engine.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAMrE;;GAEG;AACH,MAAM,MAAM,MAAM,GACd,aAAa,GACb,SAAS,GACT,UAAU,GACV,gBAAgB,GAChB,iBAAiB,GACjB,UAAU,CAAC;AAEf;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,oCAAoC;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,4BAA4B;IAC5B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gCAAgC;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8BAA8B;IAC9B,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,2BAA2B;IAC3B,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,8BAA8B;IAC9B,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC/B,wCAAwC;IACxC,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,yCAAyC;IACzC,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,4BAA4B;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iCAAiC;IACjC,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,gDAAgD;IAChD,QAAQ,EAAE,gBAAgB,EAAE,CAAC;IAC7B,wBAAwB;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,eAAe,EAAE,MAAM,CAAC;IACxB,uBAAuB;IACvB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,iBAAiB;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,wBAAwB;IACxB,KAAK,EAAE,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;IACvC,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,sBAAsB;IACtB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,UAAU,CAAqB;IACvC,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,QAAQ,CAAiB;IACjC,OAAO,CAAC,aAAa,CAAqB;IAC1C,OAAO,CAAC,MAAM,CAAe;gBAEjB,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,kBAAkB;IASnE;;OAEG;IACG,QAAQ,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;IAiCnE;;OAEG;YACW,gBAAgB;IAiC9B;;OAEG;YACW,aAAa;IAqB3B;;OAEG;YACW,kBAAkB;IAShC;;OAEG;YACW,qBAAqB;IASnC;;OAEG;YACW,eAAe;IAS7B;;OAEG;YACW,mBAAmB;IASjC;;OAEG;YACW,mBAAmB;CAQlC"}

package/dist/retrieval/engine.js

@@ -0,0 +1,159 @@
+/**
+ * Retrieval Engine
+ *
+ * Main orchestrator for memory retrieval.
+ * Gathers candidates from multiple sources, scores them,
+ * applies intent weighting, and fits to token budget.
+ */
+import { RelevanceScorer } from './scoring.js';
+import { IntentWeighter } from './weighting.js';
+import { TokenBudgetManager } from './budget.js';
+import { ResultRanker } from './ranking.js';
+/**
+ * Retrieval engine
+ */
+export class RetrievalEngine {
+    storage;
+    embeddings;
+    scorer;
+    weighter;
+    budgetManager;
+    ranker;
+    constructor(storage, embeddings) {
+        this.storage = storage;
+        this.embeddings = embeddings;
+        this.scorer = new RelevanceScorer();
+        this.weighter = new IntentWeighter();
+        this.budgetManager = new TokenBudgetManager();
+        this.ranker = new ResultRanker();
+    }
+    /**
+     * Retrieve memories for a context
+     */
+    async retrieve(context) {
+        const startTime = Date.now();
+        // 1. Gather candidates from multiple sources
+        const candidates = await this.gatherCandidates(context);
+        // 2. Score each candidate
+        const scored = candidates.map(memory => ({
+            memory,
+            score: this.scorer.score(memory, context),
+        }));
+        // 3. Apply intent weighting
+        const weighted = scored.map(({ memory, score }) => ({
+            memory,
+            score: score * this.weighter.getWeight(memory.type, context.intent),
+        }));
+        // 4. Rank results
+        const ranked = this.ranker.rank(weighted);
+        // 5. Apply token budget
+        const budget = context.maxTokens || 2000;
+        const compressed = this.budgetManager.fitToBudget(ranked, budget);
+        return {
+            memories: compressed,
+            tokensUsed: compressed.reduce((sum, m) => sum + m.tokens, 0),
+            totalCandidates: candidates.length,
+            retrievalTime: Date.now() - startTime,
+        };
+    }
+    /**
+     * Gather candidates from multiple sources
+     */
+    async gatherCandidates(context) {
+        const candidateSets = await Promise.all([
+            // Pattern-linked memories
+            this.getPatternMemories(context.relevantPatterns || []),
+            // Constraint-linked memories
+            this.getConstraintMemories(context.relevantConstraints || []),
+            // Topic-based (semantic search)
+            this.searchByTopic(context.focus),
+            // File-based
+            this.getFileMemories(context.recentFiles || []),
+            // Function-based (call graph)
+            this.getFunctionMemories(context.callGraphContext || []),
+            // Security-relevant
+            context.securityContext?.length
+                ? this.getSecurityMemories(context.securityContext)
+                : Promise.resolve([]),
+        ]);
+        // Flatten and deduplicate
+        const all = candidateSets.flat();
+        const seen = new Set();
+        return all.filter(m => {
+            if (seen.has(m.id))
+                return false;
+            seen.add(m.id);
+            return true;
+        });
+    }
+    /**
+     * Search by topic using embeddings
+     */
+    async searchByTopic(topic) {
+        try {
+            const embedding = await this.embeddings.embed(topic);
+            const results = await this.storage.similaritySearch(embedding, 20);
+            if (results.length > 0) {
+                return results;
+            }
+        }
+        catch {
+            // Similarity search failed
+        }
+        // Fallback to text-based search
+        const allMemories = await this.storage.search({ limit: 100 });
+        const topicLower = topic.toLowerCase();
+        return allMemories.filter(m => {
+            const searchText = `${m.summary} ${m.type} ${m.knowledge ?? ''} ${m.topic ?? ''}`.toLowerCase();
+            return searchText.includes(topicLower);
+        }).slice(0, 20);
+    }
+    /**
+     * Get memories linked to patterns
+     */
+    async getPatternMemories(patternIds) {
+        if (patternIds.length === 0)
+            return [];
+        const results = await Promise.all(patternIds.map(id => this.storage.findByPattern(id)));
+        return results.flat();
+    }
+    /**
+     * Get memories linked to constraints
+     */
+    async getConstraintMemories(constraintIds) {
+        if (constraintIds.length === 0)
+            return [];
+        const results = await Promise.all(constraintIds.map(id => this.storage.findByConstraint(id)));
+        return results.flat();
+    }
+    /**
+     * Get memories linked to files
+     */
+    async getFileMemories(files) {
+        if (files.length === 0)
+            return [];
+        const results = await Promise.all(files.map(f => this.storage.findByFile(f)));
+        return results.flat();
+    }
+    /**
+     * Get memories linked to functions
+     */
+    async getFunctionMemories(functionIds) {
+        if (functionIds.length === 0)
+            return [];
+        const results = await Promise.all(functionIds.map(id => this.storage.findByFunction(id)));
+        return results.flat();
+    }
+    /**
+     * Get security-related memories
+     */
+    async getSecurityMemories(context) {
+        // Get tribal memories with security-related topics
+        const tribal = await this.storage.search({
+            types: ['tribal'],
+            topics: ['security', 'auth', 'permission', ...context],
+        });
+        return tribal;
+    }
+}
+//# sourceMappingURL=engine.js.map

package/dist/retrieval/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/retrieval/engine.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAKH,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAqE5C;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,OAAO,CAAiB;IACxB,UAAU,CAAqB;IAC/B,MAAM,CAAkB;IACxB,QAAQ,CAAiB;IACzB,aAAa,CAAqB;IAClC,MAAM,CAAe;IAE7B,YAAY,OAAuB,EAAE,UAA8B;QACjE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,GAAG,IAAI,cAAc,EAAE,CAAC;QACrC,IAAI,CAAC,aAAa,GAAG,IAAI,kBAAkB,EAAE,CAAC;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,OAAyB;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,6CAA6C;QAC7C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAExD,0BAA0B;QAC1B,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvC,MAAM;YACN,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC;SAC1C,CAAC,CAAC,CAAC;QAEJ,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YAClD,MAAM;YACN,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC;SACpE,CAAC,CAAC,CAAC;QAEJ,kBAAkB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE1C,wBAAwB;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAElE,OAAO;YACL,QAAQ,EAAE,UAAU;YACpB,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5D,eAAe,EAAE,UAAU,CAAC,MAAM;YAClC,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACtC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAAC,OAAyB;QACtD,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACtC,0BAA0B;YAC1B,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;YAEvD,6BAA6B;YAC7B,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,mBAAmB,IAAI,EAAE,CAAC;YAE7D,gCAAgC;YAChC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC;YAEjC,aAAa;YACb,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;YAE/C,8BAA8B;YAC9B,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;YAExD,oBAAoB;YACpB,OAAO,CAAC,eAAe,EAAE,MAAM;gBAC7B,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,eAAe,CAAC;gBACnD,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;SACxB,CAAC,CAAC;QAEH,0BAA0B;QAC1B,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CAAC,KAAa;QACvC,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACrD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YACnE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,2BAA2B;QAC7B,CAAC;QAED,gCAAgC;QAChC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,IAAK,CAAS,CAAC,SAAS,IAAI,EAAE,IAAK,CAAS,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC;YAClH,OAAO,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAAC,UAAoB;QACnD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CACrD,CAAC;QACF,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,qBAAqB,CAAC,aAAuB;QACzD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1C,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAC3D,CAAC;QACF,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAAC,KAAe;QAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAC3C,CAAC;QACF,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAAC,WAAqB;QACrD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CACvD,CAAC;QACF,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAAC,OAAiB;QACjD,mDAAmD;QACnD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YACvC,KAAK,EAAE,CAAC,QAAQ,CAAC;YACjB,MAAM,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC;SACvD,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/retrieval/index.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Retrieval Engine
+ *
+ * Intent-aware memory retrieval with:
+ * - Multi-source candidate gathering
+ * - Relevance scoring
+ * - Intent-based weighting
+ * - Token budget management
+ * - Hierarchical compression
+ */
+export * from './engine.js';
+export * from './scoring.js';
+export * from './weighting.js';
+export * from './budget.js';
+export * from './compression.js';
+export * from './ranking.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/retrieval/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/retrieval/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC"}

package/dist/retrieval/index.js

@@ -0,0 +1,17 @@
+/**
+ * Retrieval Engine
+ *
+ * Intent-aware memory retrieval with:
+ * - Multi-source candidate gathering
+ * - Relevance scoring
+ * - Intent-based weighting
+ * - Token budget management
+ * - Hierarchical compression
+ */
+export * from './engine.js';
+export * from './scoring.js';
+export * from './weighting.js';
+export * from './budget.js';
+export * from './compression.js';
+export * from './ranking.js';
+//# sourceMappingURL=index.js.map

package/dist/retrieval/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/retrieval/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC"}

package/dist/retrieval/ranking.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Result Ranking
+ *
+ * Ranks scored memories for final output.
+ * Applies diversity bonus to avoid redundant results.
+ */
+import type { Memory } from '../types/index.js';
+/**
+ * Scored memory
+ */
+export interface ScoredMemory {
+    memory: Memory;
+    score: number;
+}
+/**
+ * Result ranker
+ */
+export declare class ResultRanker {
+    /**
+     * Rank scored memories
+     */
+    rank(scored: ScoredMemory[]): ScoredMemory[];
+    /**
+     * Apply diversity bonus to avoid redundant results
+     */
+    private applyDiversityBonus;
+}
+//# sourceMappingURL=ranking.d.ts.map

package/dist/retrieval/ranking.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranking.d.ts","sourceRoot":"","sources":["../../src/retrieval/ranking.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,qBAAa,YAAY;IACvB;;OAEG;IACH,IAAI,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE;IAQ5C;;OAEG;IACH,OAAO,CAAC,mBAAmB;CAuB5B"}

package/dist/retrieval/ranking.js

@@ -0,0 +1,42 @@
+/**
+ * Result Ranking
+ *
+ * Ranks scored memories for final output.
+ * Applies diversity bonus to avoid redundant results.
+ */
+/**
+ * Result ranker
+ */
+export class ResultRanker {
+    /**
+     * Rank scored memories
+     */
+    rank(scored) {
+        // Sort by score descending
+        const sorted = [...scored].sort((a, b) => b.score - a.score);
+        // Apply diversity bonus
+        return this.applyDiversityBonus(sorted);
+    }
+    /**
+     * Apply diversity bonus to avoid redundant results
+     */
+    applyDiversityBonus(sorted) {
+        const result = [];
+        const seenTypes = new Map();
+        for (const item of sorted) {
+            const type = item.memory.type;
+            const typeCount = seenTypes.get(type) || 0;
+            // Penalize repeated types
+            const diversityPenalty = Math.pow(0.9, typeCount);
+            const adjustedScore = item.score * diversityPenalty;
+            result.push({
+                memory: item.memory,
+                score: adjustedScore,
+            });
+            seenTypes.set(type, typeCount + 1);
+        }
+        // Re-sort after diversity adjustment
+        return result.sort((a, b) => b.score - a.score);
+    }
+}
+//# sourceMappingURL=ranking.js.map

package/dist/retrieval/ranking.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranking.js","sourceRoot":"","sources":["../../src/retrieval/ranking.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAYH;;GAEG;AACH,MAAM,OAAO,YAAY;IACvB;;OAEG;IACH,IAAI,CAAC,MAAsB;QACzB,2BAA2B;QAC3B,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE7D,wBAAwB;QACxB,OAAO,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,MAAsB;QAChD,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YAC9B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE3C,0BAA0B;YAC1B,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,GAAG,gBAAgB,CAAC;YAEpD,MAAM,CAAC,IAAI,CAAC;gBACV,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,KAAK,EAAE,aAAa;aACrB,CAAC,CAAC;YAEH,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,qCAAqC;QACrC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;CACF"}

package/dist/retrieval/scoring.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Relevance Scoring
+ *
+ * Scores memories based on relevance to the current context.
+ * Considers confidence, recency, access patterns, and topic match.
+ */
+import type { Memory } from '../types/index.js';
+import type { RetrievalContext } from './engine.js';
+/**
+ * Relevance scorer
+ */
+export declare class RelevanceScorer {
+    /**
+     * Score a memory's relevance to a context
+     */
+    score(memory: Memory, context: RetrievalContext): number;
+    /**
+     * Score based on importance
+     */
+    private importanceScore;
+    /**
+     * Score based on recency
+     */
+    private recencyScore;
+    /**
+     * Score based on access frequency
+     */
+    private accessScore;
+    /**
+     * Score based on topic match
+     */
+    private topicMatchScore;
+    /**
+     * Calculate Jaccard similarity between two sets
+     */
+    private jaccardSimilarity;
+}
+//# sourceMappingURL=scoring.d.ts.map

package/dist/retrieval/scoring.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../src/retrieval/scoring.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpD;;GAEG;AACH,qBAAa,eAAe;IAC1B;;OAEG;IACH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,GAAG,MAAM;IAqBxD;;OAEG;IACH,OAAO,CAAC,eAAe;IAUvB;;OAEG;IACH,OAAO,CAAC,YAAY;IAQpB;;OAEG;IACH,OAAO,CAAC,WAAW;IAKnB;;OAEG;IACH,OAAO,CAAC,eAAe;IAsCvB;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAO1B"}

package/dist/retrieval/scoring.js

@@ -0,0 +1,101 @@
+/**
+ * Relevance Scoring
+ *
+ * Scores memories based on relevance to the current context.
+ * Considers confidence, recency, access patterns, and topic match.
+ */
+/**
+ * Relevance scorer
+ */
+export class RelevanceScorer {
+    /**
+     * Score a memory's relevance to a context
+     */
+    score(memory, context) {
+        let score = 0;
+        // Base confidence score (0-1)
+        score += memory.confidence * 0.3;
+        // Importance multiplier
+        score += this.importanceScore(memory.importance) * 0.2;
+        // Recency score (0-1)
+        score += this.recencyScore(memory.createdAt) * 0.15;
+        // Access frequency score (0-1)
+        score += this.accessScore(memory.accessCount) * 0.1;
+        // Topic match score (0-1)
+        score += this.topicMatchScore(memory, context.focus) * 0.25;
+        return Math.min(1.0, score);
+    }
+    /**
+     * Score based on importance
+     */
+    importanceScore(importance) {
+        switch (importance) {
+            case 'critical': return 1.0;
+            case 'high': return 0.8;
+            case 'normal': return 0.5;
+            case 'low': return 0.2;
+            default: return 0.5;
+        }
+    }
+    /**
+     * Score based on recency
+     */
+    recencyScore(createdAt) {
+        const age = Date.now() - new Date(createdAt).getTime();
+        const daysOld = age / (1000 * 60 * 60 * 24);
+        // Exponential decay with 30-day half-life
+        return Math.exp(-daysOld / 30);
+    }
+    /**
+     * Score based on access frequency
+     */
+    accessScore(accessCount) {
+        // Logarithmic scaling
+        return Math.min(1.0, Math.log10(accessCount + 1) / 2);
+    }
+    /**
+     * Score based on topic match
+     */
+    topicMatchScore(memory, focus) {
+        // Handle empty or whitespace-only focus
+        if (!focus || !focus.trim()) {
+            return 0;
+        }
+        const focusLower = focus.toLowerCase();
+        const focusWords = new Set(focusLower.split(/\s+/).filter(w => w.length > 0));
+        // Handle empty focus words
+        if (focusWords.size === 0) {
+            return 0;
+        }
+        // Check summary (handle undefined/null)
+        let summaryMatch = 0;
+        if (memory.summary) {
+            const summaryWords = new Set(memory.summary.toLowerCase().split(/\s+/));
+            summaryMatch = this.jaccardSimilarity(focusWords, summaryWords);
+        }
+        // Check topic if available
+        let topicMatch = 0;
+        if ('topic' in memory && memory.topic) {
+            const topicWords = new Set(memory.topic.toLowerCase().split(/\s+/));
+            topicMatch = this.jaccardSimilarity(focusWords, topicWords);
+        }
+        // Check knowledge if available
+        let knowledgeMatch = 0;
+        if ('knowledge' in memory && memory.knowledge) {
+            const knowledgeWords = new Set(memory.knowledge.toLowerCase().split(/\s+/).slice(0, 50));
+            knowledgeMatch = this.jaccardSimilarity(focusWords, knowledgeWords);
+        }
+        return Math.max(summaryMatch, topicMatch, knowledgeMatch);
+    }
+    /**
+     * Calculate Jaccard similarity between two sets
+     */
+    jaccardSimilarity(a, b) {
+        const intersection = new Set([...a].filter(x => b.has(x)));
+        const union = new Set([...a, ...b]);
+        if (union.size === 0)
+            return 0;
+        return intersection.size / union.size;
+    }
+}
+//# sourceMappingURL=scoring.js.map

package/dist/retrieval/scoring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../src/retrieval/scoring.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH;;GAEG;AACH,MAAM,OAAO,eAAe;IAC1B;;OAEG;IACH,KAAK,CAAC,MAAc,EAAE,OAAyB;QAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,8BAA8B;QAC9B,KAAK,IAAI,MAAM,CAAC,UAAU,GAAG,GAAG,CAAC;QAEjC,wBAAwB;QACxB,KAAK,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC;QAEvD,sBAAsB;QACtB,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;QAEpD,+BAA+B;QAC/B,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;QAEpD,0BAA0B;QAC1B,KAAK,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAE5D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,UAAkB;QACxC,QAAQ,UAAU,EAAE,CAAC;YACnB,KAAK,UAAU,CAAC,CAAC,OAAO,GAAG,CAAC;YAC5B,KAAK,MAAM,CAAC,CAAC,OAAO,GAAG,CAAC;YACxB,KAAK,QAAQ,CAAC,CAAC,OAAO,GAAG,CAAC;YAC1B,KAAK,KAAK,CAAC,CAAC,OAAO,GAAG,CAAC;YACvB,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,SAAiB;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QACvD,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAE5C,0CAA0C;QAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,WAAmB;QACrC,sBAAsB;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,MAAc,EAAE,KAAa;QACnD,wCAAwC;QACxC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,2BAA2B;QAC3B,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,wCAAwC;QACxC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAClE,CAAC;QAED,2BAA2B;QAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpE,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAC9D,CAAC;QAED,+BAA+B;QAC/B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,WAAW,IAAI,MAAM,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YAC9C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACzF,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAc,EAAE,CAAc;QACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACxC,CAAC;CACF"}

package/dist/retrieval/weighting.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Intent Weighting
+ *
+ * Different intents weight different memory types differently.
+ * For example, security audits weight tribal knowledge higher
+ * because security gotchas are critical.
+ */
+import type { MemoryType } from '../types/index.js';
+import type { Intent } from './engine.js';
+/**
+ * Intent weighter
+ */
+export declare class IntentWeighter {
+    /**
+     * Get the weight for a memory type given an intent
+     */
+    getWeight(memoryType: MemoryType, intent: Intent): number;
+    /**
+     * Get all weights for an intent
+     */
+    getWeightsForIntent(intent: Intent): Record<MemoryType, number>;
+}
+//# sourceMappingURL=weighting.d.ts.map

package/dist/retrieval/weighting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"weighting.d.ts","sourceRoot":"","sources":["../../src/retrieval/weighting.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AA0E1C;;GAEG;AACH,qBAAa,cAAc;IACzB;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAIzD;;OAEG;IACH,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC;CAGhE"}