adaptive-memory-multi-model-router 1.9.5 → 2.0.0

package/dist/memory/memoryTree.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Memory Tree Hierarchy
+ *
+ * Canonicalizes data into ≤3k-token chunks, scores them,
+ * and builds hierarchical summary trees.
+ */
+export interface MemoryChunk {
+    id: string;
+    content: string;
+    score: number;
+    parentId?: string;
+    depth: number;
+    createdAt: number;
+    accessCount: number;
+}
+export interface TreeNode {
+    id: string;
+    chunks: MemoryChunk[];
+    summary: string;
+    children: TreeNode[];
+    depth: number;
+}
+export declare class MemoryTree {
+    private maxChunkSize;
+    private root;
+    private chunks;
+    private idCounter;
+    constructor(maxChunkSize?: number);
+    private createNode;
+    private generateId;
+    /**
+     * Add data to the memory tree
+     */
+    add(data: string): Promise<MemoryChunk[]>;
+    /**
+     * Split text into chunks of maxChunkSize
+     */
+    private chunk;
+    /**
+     * Score a chunk by relevance
+     */
+    private scoreChunk;
+    /**
+     * Insert chunk into tree hierarchy
+     */
+    private insertIntoTree;
+    private getAverageScore;
+    /**
+     * Update summaries for tree nodes
+     */
+    private updateSummaries;
+    private summarizeNode;
+    /**
+     * Search chunks by content
+     */
+    search(query: string): MemoryChunk[];
+    /**
+     * Get context for routing
+     */
+    getContext(maxTokens?: number): string;
+    /**
+     * Export as markdown for Obsidian
+     */
+    toMarkdown(): string;
+    /**
+     * Get tree stats
+     */
+    getStats(): {
+        totalChunks: number;
+        maxDepth: number;
+        rootChunks: number;
+        treeSize: number;
+    };
+    private getMaxDepth;
+}
+export default MemoryTree;

package/dist/memory/memoryTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryTree.d.ts","sourceRoot":"","sources":["../../src/memory/memoryTree.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,UAAU;IACrB,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,IAAI,CAAW;IACvB,OAAO,CAAC,MAAM,CAA2B;IACzC,OAAO,CAAC,SAAS,CAAS;gBAEd,YAAY,SAAO;IAO/B,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,UAAU;IAIlB;;OAEG;IACG,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAyB/C;;OAEG;IACH,OAAO,CAAC,KAAK;IAwBb;;OAEG;YACW,UAAU;IAUxB;;OAEG;IACH,OAAO,CAAC,cAAc;IA4BtB,OAAO,CAAC,eAAe;IAKvB;;OAEG;YACW,eAAe;IAI7B,OAAO,CAAC,aAAa;IASrB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE;IAcpC;;OAEG;IACH,UAAU,CAAC,SAAS,SAAO,GAAG,MAAM;IAcpC;;OAEG;IACH,UAAU,IAAI,MAAM;IAoBpB;;OAEG;IACH,QAAQ;;;;;;IASR,OAAO,CAAC,WAAW;CAIpB;AAED,eAAe,UAAU,CAAC"}

package/dist/memory/memoryTree.js

@@ -1,141 +1,196 @@
+"use strict";
 /**
- * Memory Tree Hierarchy (Optimized v2)
- * 
- * Improvements:
- * - LRU cache for recent chunks
- * - Faster search with index
- * - Lower memory footprint
+ * Memory Tree Hierarchy
+ *
+ * Canonicalizes data into ≤3k-token chunks, scores them,
+ * and builds hierarchical summary trees.
  */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MemoryTree = void 0;
 class MemoryTree {
-  constructor(maxChunkSize = 3000) {
-    this.maxChunkSize = maxChunkSize;
-    this.root = { id: 'root', chunks: [], summary: '', children: [], depth: 0 };
-    this.chunks = new Map();
-    this.idCounter = 0;
-    this.index = new Map(); // Fast lookup index
-    this.lru = []; // LRU cache for recent chunks
-    this.maxLruSize = 100;
-  }
-
-  generateId() { return `chunk_${Date.now()}_${this.idCounter++}`; }
-
-  async add(data) {
-    const texts = this.chunk(data);
-    const added = [];
-    for (const text of texts) {
-      const chunk = { 
-        id: this.generateId(), 
-        content: text, 
-        score: 0.5, 
-        depth: 0, 
-        createdAt: Date.now(), 
-        accessCount: 0 
-      };
-      this.chunks.set(chunk.id, chunk);
-      this.indexChunk(chunk);
-      this.root.chunks.push(chunk);
-      added.push(chunk);
+    maxChunkSize;
+    root;
+    chunks;
+    idCounter;
+    constructor(maxChunkSize = 3000) {
+        this.maxChunkSize = maxChunkSize;
+        this.root = this.createNode('root');
+        this.chunks = new Map();
+        this.idCounter = 0;
     }
-    return added;
-  }
-
-  // Index a chunk for fast search
-  indexChunk(chunk) {
-    const words = chunk.content.toLowerCase().split(/\s+/);
-    for (const word of words) {
-      // Strip punctuation for better matching
-      const clean = word.replace(/[^a-z0-9-]/g, '');
-      if (clean.length >= 3) { // Skip very short words
-        if (!this.index.has(clean)) this.index.set(clean, new Set());
-        this.index.get(clean).add(chunk.id);
-      }
+    createNode(id, depth = 0) {
+        return { id, chunks: [], summary: '', children: [], depth };
     }
-  }
-
-  chunk(text) {
-    const chunks = [], words = text.split(/\s+/);
-    let current = [], size = 0;
-    for (const word of words) {
-      size += word.length + 1;
-      if (size > this.maxChunkSize) { 
-        chunks.push(current.join(' ')); 
-        current = [word]; 
-        size = word.length + 1; 
-      } else { 
-        current.push(word); 
-      }
+    generateId() {
+        return `chunk_${Date.now()}_${this.idCounter++}`;
     }
-    if (current.length) chunks.push(current.join(' '));
-    return chunks;
-  }
-
-  // Fast indexed search
-  search(query) {
-    const words = query.toLowerCase().split(/\s+/);
-    let candidateIds = null;
-    
-    for (const word of words) {
-      const clean = word.replace(/[^a-z0-9-]/g, '');
-      if (clean.length < 3) continue;
-      // Try exact match first, then substring match
-      let ids = this.index.get(clean);
-      if (!ids) {
-        // Substring matching: find index keys containing this word
-        for (const [key, val] of this.index) {
-          if (key.includes(clean) || clean.includes(key)) {
-            ids = val;
-            break;
-          }
+    /**
+     * Add data to the memory tree
+     */
+    async add(data) {
+        const textChunks = this.chunk(data);
+        const addedChunks = [];
+        for (const text of textChunks) {
+            const score = await this.scoreChunk(text);
+            const chunk = {
+                id: this.generateId(),
+                content: text,
+                score,
+                depth: 0,
+                createdAt: Date.now(),
+                accessCount: 0
+            };
+            this.chunks.set(chunk.id, chunk);
+            this.root.chunks.push(chunk);
+            this.insertIntoTree(chunk);
+            addedChunks.push(chunk);
         }
-      }
-      if (ids) {
-        if (!candidateIds) candidateIds = new Set(ids);
-        else candidateIds = new Set([...candidateIds].filter(id => ids.has(id)));
-      }
+        await this.updateSummaries();
+        return addedChunks;
     }
-    
-    if (!candidateIds) return []; // No matches
-    
-    // Update LRU and return chunks
-    const results = [];
-    for (const id of candidateIds) {
-      const chunk = this.chunks.get(id);
-      if (chunk) {
-        this.updateLRU(chunk);
-        chunk.accessCount++;
-        results.push(chunk);
-      }
+    /**
+     * Split text into chunks of maxChunkSize
+     */
+    chunk(text) {
+        const chunks = [];
+        const words = text.split(/\s+/);
+        let current = [];
+        let currentSize = 0;
+        for (const word of words) {
+            currentSize += word.length + 1;
+            if (currentSize > this.maxChunkSize) {
+                chunks.push(current.join(' '));
+                current = [word];
+                currentSize = word.length + 1;
+            }
+            else {
+                current.push(word);
+            }
+        }
+        if (current.length > 0) {
+            chunks.push(current.join(' '));
+        }
+        return chunks;
+    }
+    /**
+     * Score a chunk by relevance
+     */
+    async scoreChunk(content) {
+        // Simple scoring: length + unique words ratio
+        const words = content.split(/\s+/);
+        const uniqueWords = new Set(words.map(w => w.toLowerCase()));
+        const uniqueRatio = uniqueWords.size / words.length;
+        // Base score + bonus for high unique ratio
+        return Math.min(1, (content.length / this.maxChunkSize) * uniqueRatio * 1.5);
+    }
+    /**
+     * Insert chunk into tree hierarchy
+     */
+    insertIntoTree(chunk) {
+        let parent = this.root;
+        while (parent.children.length > 0 && chunk.score < 0.5) {
+            // Find best matching child
+            let bestChild = parent.children[0];
+            let bestScore = 0;
+            for (const child of parent.children) {
+                const avgScore = this.getAverageScore(child);
+                if (avgScore > bestScore && avgScore >= chunk.score) {
+                    bestScore = avgScore;
+                    bestChild = child;
+                }
+            }
+            if (bestScore >= chunk.score) {
+                parent = bestChild;
+                chunk.depth = parent.depth + 1;
+                chunk.parentId = parent.id;
+            }
+            else {
+                break;
+            }
+        }
+        parent.chunks.push(chunk);
+    }
+    getAverageScore(node) {
+        if (node.chunks.length === 0)
+            return 0;
+        return node.chunks.reduce((sum, c) => sum + c.score, 0) / node.chunks.length;
+    }
+    /**
+     * Update summaries for tree nodes
+     */
+    async updateSummaries() {
+        this.summarizeNode(this.root);
+    }
+    summarizeNode(node) {
+        const allContent = node.chunks.map(c => c.content).join(' ');
+        node.summary = allContent.slice(0, 200) + (allContent.length > 200 ? '...' : '');
+        for (const child of node.children) {
+            this.summarizeNode(child);
+        }
+    }
+    /**
+     * Search chunks by content
+     */
+    search(query) {
+        const results = [];
+        const queryLower = query.toLowerCase();
+        for (const chunk of this.chunks.values()) {
+            if (chunk.content.toLowerCase().includes(queryLower)) {
+                chunk.accessCount++;
+                results.push(chunk);
+            }
+        }
+        return results.sort((a, b) => b.score - a.score);
+    }
+    /**
+     * Get context for routing
+     */
+    getContext(maxTokens = 3000) {
+        const allChunks = Array.from(this.chunks.values())
+            .sort((a, b) => b.score - a.score)
+            .slice(0, 10);
+        let context = allChunks.map(c => c.content).join('\n\n');
+        if (context.length > maxTokens) {
+            context = context.slice(0, maxTokens) + '...';
+        }
+        return context;
+    }
+    /**
+     * Export as markdown for Obsidian
+     */
+    toMarkdown() {
+        const lines = ['# Memory Tree\n'];
+        const traverse = (node, prefix = '') => {
+            for (const chunk of node.chunks) {
+                lines.push(`${prefix}## ${chunk.id} (score: ${chunk.score.toFixed(2)})`);
+                lines.push(chunk.content);
+                lines.push('');
+            }
+            for (const child of node.children) {
+                lines.push(`${prefix}### ${child.id}`);
+                traverse(child, prefix + '#');
+            }
+        };
+        traverse(this.root);
+        return lines.join('\n');
+    }
+    /**
+     * Get tree stats
+     */
+    getStats() {
+        return {
+            totalChunks: this.chunks.size,
+            maxDepth: this.getMaxDepth(this.root),
+            rootChunks: this.root.chunks.length,
+            treeSize: JSON.stringify(this.root).length
+        };
     }
-    return results;
-  }
-  
-  updateLRU(chunk) {
-    this.lru = this.lru.filter(c => c.id !== chunk.id);
-    this.lru.unshift(chunk);
-    if (this.lru.length > this.maxLruSize) {
-      this.lru.pop();
+    getMaxDepth(node) {
+        if (node.children.length === 0)
+            return node.depth;
+        return Math.max(...node.children.map(c => this.getMaxDepth(c)));
     }
-  }
-
-  getContext(maxTokens = 3000) { 
-    // Use LRU for context (most recent first)
-    const context = this.lru.map(c => c.content).join('\n\n');
-    return context.slice(0, maxTokens); 
-  }
-  
-  toMarkdown() { 
-    return '# Memory Tree\n' + this.lru.map(c => `## ${c.id}\n${c.content}`).join('\n'); 
-  }
-  
-  getStats() {
-    return {
-      totalChunks: this.chunks.size,
-      maxDepth: 0,
-      rootChunks: this.root.chunks.length,
-      indexSize: this.index.size,
-      lruSize: this.lru.length
-    };
-  }
 }
-
-module.exports = { MemoryTree };
+exports.MemoryTree = MemoryTree;
+exports.default = MemoryTree;
+//# sourceMappingURL=memoryTree.js.map

package/dist/memory/memoryTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryTree.js","sourceRoot":"","sources":["../../src/memory/memoryTree.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAoBH,MAAa,UAAU;IACb,YAAY,CAAS;IACrB,IAAI,CAAW;IACf,MAAM,CAA2B;IACjC,SAAS,CAAS;IAE1B,YAAY,YAAY,GAAG,IAAI;QAC7B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAEO,UAAU,CAAC,EAAU,EAAE,KAAK,GAAG,CAAC;QACtC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;IAC9D,CAAC;IAEO,UAAU;QAChB,OAAO,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,IAAY;QACpB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,WAAW,GAAkB,EAAE,CAAC;QAEtC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAgB;gBACzB,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE;gBACrB,OAAO,EAAE,IAAI;gBACb,KAAK;gBACL,KAAK,EAAE,CAAC;gBACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,WAAW,EAAE,CAAC;aACf,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,IAAY;QACxB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,OAAO,GAAa,EAAE,CAAC;QAC3B,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,WAAW,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;gBACjB,WAAW,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,OAAe;QACtC,8CAA8C;QAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAEpD,2CAA2C;QAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,WAAW,GAAG,GAAG,CAAC,CAAC;IAC/E,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAkB;QACvC,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;YACvD,2BAA2B;YAC3B,IAAI,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;gBAC7C,IAAI,QAAQ,GAAG,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBACpD,SAAS,GAAG,QAAQ,CAAC;oBACrB,SAAS,GAAG,KAAK,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,IAAI,SAAS,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC7B,MAAM,GAAG,SAAS,CAAC;gBACnB,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;gBAC/B,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEO,eAAe,CAAC,IAAc;QACpC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC/E,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe;QAC3B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAEO,aAAa,CAAC,IAAc;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7D,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEjF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAa;QAClB,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACrD,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,SAAS,GAAG,IAAI;QACzB,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;aAC/C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAEhB,IAAI,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzD,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YAC/B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC;QAChD,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,MAAM,KAAK,GAAa,CAAC,iBAAiB,CAAC,CAAC;QAE5C,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;YAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,MAAM,KAAK,CAAC,EAAE,YAAY,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,OAAO,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC;YAChC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YAC7B,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YACrC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM;YACnC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;SAC3C,CAAC;IACJ,CAAC;IAEO,WAAW,CAAC,IAAc;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;CACF;AAtND,gCAsNC;AAED,kBAAe,UAAU,CAAC"}

package/dist/memory/obsidianVault.d.ts

@@ -0,0 +1,71 @@
+/**
+ * Obsidian Vault Integration
+ *
+ * Stores routing decisions and context as markdown files
+ * compatible with Obsidian note-taking app.
+ */
+export interface VaultConfig {
+    path: string;
+    autoSave: boolean;
+    maxFileAge: number;
+}
+export interface RoutingDecision {
+    id: string;
+    timestamp: number;
+    prompt: string;
+    context: any;
+    selectedProvider: string;
+    selectedModel: string;
+    reasoning: string;
+    cost: number;
+    latency: number;
+}
+export declare class ObsidianVault {
+    private config;
+    private decisions;
+    constructor(config?: Partial<VaultConfig>);
+    private ensureDirectory;
+    /**
+     * Save a routing decision
+     */
+    saveDecision(decision: RoutingDecision): Promise<string>;
+    /**
+     * Format decision as markdown
+     */
+    private formatDecisionAsMarkdown;
+    /**
+     * Escape markdown special characters
+     */
+    private escapeMarkdown;
+    /**
+     * Update the vault index
+     */
+    private updateIndex;
+    /**
+     * Get recent decisions
+     */
+    getRecentDecisions(count?: number): RoutingDecision[];
+    /**
+     * Search decisions
+     */
+    searchDecisions(query: string): RoutingDecision[];
+    /**
+     * Export all decisions
+     */
+    exportAll(filepath: string): Promise<void>;
+    /**
+     * Get vault statistics
+     */
+    getStats(): {
+        totalDecisions: number;
+        vaultPath: string;
+        fileCount: number;
+        totalSize: number;
+    };
+    private getDirectorySize;
+    /**
+     * Clean old files
+     */
+    cleanOldFiles(): Promise<number>;
+}
+export default ObsidianVault;

package/dist/memory/obsidianVault.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"obsidianVault.d.ts","sourceRoot":"","sources":["../../src/memory/obsidianVault.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,GAAG,CAAC;IACb,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,SAAS,CAAoB;gBAEzB,MAAM,GAAE,OAAO,CAAC,WAAW,CAAM;IAU7C,OAAO,CAAC,eAAe;IAMvB;;OAEG;IACG,YAAY,CAAC,QAAQ,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAe9D;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAiChC;;OAEG;IACH,OAAO,CAAC,cAAc;IAQtB;;OAEG;YACW,WAAW;IAsBzB;;OAEG;IACH,kBAAkB,CAAC,KAAK,SAAK,GAAG,eAAe,EAAE;IAIjD;;OAEG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,EAAE;IASjD;;OAEG;IACG,SAAS,CAAC,QAAQ,EAAE,MAAM;IAQhC;;OAEG;IACH,QAAQ;;;;;;IASR,OAAO,CAAC,gBAAgB;IAkBxB;;OAEG;IACG,aAAa;CAoBpB;AAED,eAAe,aAAa,CAAC"}