@miller-tech/uap 1.10.0 → 1.11.0

package/dist/memory/semantic-edge-graph.js

@@ -1,168 +0,0 @@
-/**
- * Semantic Edge Graph Module for UAP
- *
- * Implements a knowledge graph with semantic edges for efficient memory retrieval.
- */
-const DEFAULT_CONFIG = {
-    maxEdgesPerNode: 50,
-    similarityThreshold: 0.7,
-    decayRate: 0.95,
-};
-/**
- * Semantic Edge Graph
- * A knowledge graph with semantic connections between nodes
- */
-export class SemanticEdgeGraph {
-    config;
-    nodes = new Map();
-    edges = new Map();
-    constructor(config = {}) {
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    /**
-     * Add a node to the graph
-     */
-    addNode(node) {
-        this.nodes.set(node.id, node);
-        if (!this.edges.has(node.id)) {
-            this.edges.set(node.id, []);
-        }
-    }
-    /**
-     * Add an edge between nodes
-     */
-    addEdge(source, target, type, weight = 1.0) {
-        if (!this.nodes.has(source) || !this.nodes.has(target)) {
-            throw new Error(`Nodes ${source} and ${target} must exist`);
-        }
-        const edge = {
-            source,
-            target,
-            type,
-            weight,
-            metadata: {},
-        };
-        // Add edge to both nodes' adjacency lists (undirected)
-        this.addEdgeToAdjacency(source, target, edge);
-        this.addEdgeToAdjacency(target, source, { ...edge, source: target, target });
-    }
-    addEdgeToAdjacency(nodeId, targetId, edge) {
-        const adj = this.edges.get(nodeId) || [];
-        // Remove existing edge if it exists
-        const filtered = adj.filter((e) => e.target !== targetId);
-        // Add new edge
-        filtered.push(edge);
-        // Sort by weight and limit
-        filtered.sort((a, b) => b.weight - a.weight);
-        if (filtered.length > this.config.maxEdgesPerNode) {
-            filtered.length = this.config.maxEdgesPerNode;
-        }
-        this.edges.set(nodeId, filtered);
-    }
-    /**
-     * Get neighbors of a node
-     */
-    getNeighbors(nodeId, limit) {
-        const adj = this.edges.get(nodeId) || [];
-        if (limit) {
-            return adj.slice(0, limit).map((e) => ({ nodeId: e.target, edge: e }));
-        }
-        return adj.map((e) => ({ nodeId: e.target, edge: e }));
-    }
-    /**
-     * Get all nodes
-     */
-    getAllNodes() {
-        return Array.from(this.nodes.values());
-    }
-    /**
-     * Get a node by ID
-     */
-    getNode(nodeId) {
-        return this.nodes.get(nodeId) || null;
-    }
-    /**
-     * Find similar nodes by content
-     */
-    findSimilar(nodeId, threshold = 0.7) {
-        const node = this.nodes.get(nodeId);
-        if (!node || !node.embedding) {
-            return [];
-        }
-        const results = [];
-        for (const [id, otherNode] of this.nodes) {
-            if (id === nodeId || !otherNode.embedding)
-                continue;
-            const similarity = this.cosineSimilarity(node.embedding, otherNode.embedding);
-            if (similarity >= threshold) {
-                results.push({ node: otherNode, similarity });
-            }
-        }
-        return results.sort((a, b) => b.similarity - a.similarity);
-    }
-    /**
-     * Find shortest path between nodes
-     */
-    findPath(start, end) {
-        if (!this.nodes.has(start) || !this.nodes.has(end)) {
-            return null;
-        }
-        const visited = new Set();
-        const queue = [{ node: start, path: [start] }];
-        while (queue.length > 0) {
-            const { node, path } = queue.shift();
-            if (node === end) {
-                return path;
-            }
-            if (visited.has(node))
-                continue;
-            visited.add(node);
-            const neighbors = this.getNeighbors(node);
-            for (const { nodeId: neighborId } of neighbors) {
-                if (!visited.has(neighborId)) {
-                    queue.push({ node: neighborId, path: [...path, neighborId] });
-                }
-            }
-        }
-        return null;
-    }
-    /**
-     * Calculate cosine similarity between vectors
-     */
-    cosineSimilarity(a, b) {
-        if (a.length !== b.length || a.length === 0)
-            return 0;
-        let dotProduct = 0;
-        let normA = 0;
-        let normB = 0;
-        for (let i = 0; i < a.length; i++) {
-            dotProduct += a[i] * b[i];
-            normA += a[i] * a[i];
-            normB += b[i] * b[i];
-        }
-        return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
-    }
-    /**
-     * Get graph statistics
-     */
-    getStats() {
-        const nodeCount = this.nodes.size;
-        let edgeCount = 0;
-        for (const adj of this.edges.values()) {
-            edgeCount += adj.length;
-        }
-        return {
-            nodeCount,
-            edgeCount,
-            avgEdgesPerNode: nodeCount > 0 ? edgeCount / nodeCount : 0,
-        };
-    }
-    /**
-     * Clear the graph
-     */
-    clear() {
-        this.nodes.clear();
-        this.edges.clear();
-    }
-}
-//# sourceMappingURL=semantic-edge-graph.js.map

package/dist/memory/semantic-edge-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"semantic-edge-graph.js","sourceRoot":"","sources":["../../src/memory/semantic-edge-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAwBH,MAAM,cAAc,GAA4B;IAC9C,eAAe,EAAE,EAAE;IACnB,mBAAmB,EAAE,GAAG;IACxB,SAAS,EAAE,IAAI;CAChB,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACpB,MAAM,CAA0B;IAChC,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAEpD,YAAY,SAA2C,EAAE;QACvD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,IAAY,EAAE,SAAiB,GAAG;QACxE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,QAAQ,MAAM,aAAa,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,IAAI,GAAc;YACtB,MAAM;YACN,MAAM;YACN,IAAI;YACJ,MAAM;YACN,QAAQ,EAAE,EAAE;SACb,CAAC;QAEF,uDAAuD;QACvD,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/E,CAAC;IAEO,kBAAkB,CAAC,MAAc,EAAE,QAAgB,EAAE,IAAe;QAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAEzC,oCAAoC;QACpC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAE1D,eAAe;QACf,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpB,2BAA2B;QAC3B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE7C,IAAI,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAClD,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;QAChD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc,EAAE,KAAc;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAEzC,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,WAAW,CACT,MAAc,EACd,YAAoB,GAAG;QAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,OAAO,GAAmD,EAAE,CAAC;QAEnE,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,EAAE,KAAK,MAAM,IAAI,CAAC,SAAS,CAAC,SAAS;gBAAE,SAAS;YAEpD,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;YAC9E,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAa,EAAE,GAAW;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA4C,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAExF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEtC,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAC1C,KAAK,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,UAAU,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,QAAQ;QAKN,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC;QAC1B,CAAC;QAED,OAAO;YACL,SAAS;YACT,SAAS;YACT,eAAe,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;SAC3D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACF"}

package/dist/memory/semantic-retrieval.d.ts

@@ -1,70 +0,0 @@
-/**
- * Semantic Retrieval Module for UAP
- *
- * Implements semantic search over memory entries using embeddings.
- */
-export interface MemoryEntry {
-    id: string;
-    content: string;
-    type: string;
-    timestamp: string;
-    importance?: number;
-    embedding?: number[];
-}
-export interface SemanticRetrievalConfig {
-    minScore: number;
-    topK: number;
-    embeddingModel: string;
-}
-/**
- * Semantic Retrieval Manager
- * Provides semantic search capabilities for memory entries
- */
-export declare class SemanticRetrieval {
-    private config;
-    private memoryIndex;
-    private embeddingService;
-    constructor(config?: Partial<SemanticRetrievalConfig>);
-    /**
-     * Index a memory entry
-     */
-    addEntry(entry: MemoryEntry): Promise<void>;
-    /**
-     * Index multiple entries
-     */
-    addEntries(entries: MemoryEntry[]): Promise<void>;
-    /**
-     * Remove an entry from the index
-     */
-    removeEntry(id: string): boolean;
-    /**
-     * Search for similar entries
-     */
-    search(query: string, options?: {
-        limit?: number;
-        minScore?: number;
-    }): Promise<Array<{
-        entry: MemoryEntry;
-        score: number;
-    }>>;
-    /**
-     * Get an entry by ID
-     */
-    getEntry(id: string): MemoryEntry | null;
-    /**
-     * Get all indexed entries
-     */
-    getAllEntries(): MemoryEntry[];
-    /**
-     * Get index statistics
-     */
-    getStats(): {
-        indexedCount: number;
-        hasEmbeddings: number;
-    };
-    /**
-     * Clear the index
-     */
-    clear(): void;
-}
-//# sourceMappingURL=semantic-retrieval.d.ts.map

package/dist/memory/semantic-retrieval.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"semantic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/semantic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;CACxB;AAQD;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,WAAW,CAAuC;IAC1D,OAAO,CAAC,gBAAgB,CAAyB;gBAErC,MAAM,GAAE,OAAO,CAAC,uBAAuB,CAAM;IAIzD;;OAEG;IACG,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAajD;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIhC;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAO,GAClD,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA+BxD;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAIxC;;OAEG;IACH,aAAa,IAAI,WAAW,EAAE;IAI9B;;OAEG;IACH,QAAQ,IAAI;QACV,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,CAAC;KACvB;IAaD;;OAEG;IACH,KAAK,IAAI,IAAI;CAGd"}

package/dist/memory/semantic-retrieval.js

@@ -1,112 +0,0 @@
-/**
- * Semantic Retrieval Module for UAP
- *
- * Implements semantic search over memory entries using embeddings.
- */
-import { getEmbeddingService } from './embeddings.js';
-const DEFAULT_CONFIG = {
-    minScore: 0.5,
-    topK: 10,
-    embeddingModel: 'default',
-};
-/**
- * Semantic Retrieval Manager
- * Provides semantic search capabilities for memory entries
- */
-export class SemanticRetrieval {
-    config;
-    memoryIndex = new Map();
-    embeddingService = getEmbeddingService();
-    constructor(config = {}) {
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    /**
-     * Index a memory entry
-     */
-    async addEntry(entry) {
-        // Generate embedding if not provided
-        if (!entry.embedding) {
-            try {
-                entry.embedding = await this.embeddingService.embed(entry.content);
-            }
-            catch (error) {
-                console.warn('Failed to embed content:', error);
-            }
-        }
-        this.memoryIndex.set(entry.id, entry);
-    }
-    /**
-     * Index multiple entries
-     */
-    async addEntries(entries) {
-        await Promise.all(entries.map((e) => this.addEntry(e)));
-    }
-    /**
-     * Remove an entry from the index
-     */
-    removeEntry(id) {
-        return this.memoryIndex.delete(id);
-    }
-    /**
-     * Search for similar entries
-     */
-    async search(query, options = {}) {
-        const limit = options.limit || this.config.topK;
-        const minScore = options.minScore ?? this.config.minScore;
-        // Embed the query
-        let queryEmbedding;
-        try {
-            queryEmbedding = await this.embeddingService.embed(query);
-        }
-        catch (error) {
-            console.warn('Failed to embed query:', error);
-            return [];
-        }
-        // Search index
-        const results = [];
-        for (const entry of this.memoryIndex.values()) {
-            if (!entry.embedding)
-                continue;
-            const score = this.embeddingService.cosineSimilarity(queryEmbedding, entry.embedding);
-            if (score >= minScore) {
-                results.push({ entry, score });
-            }
-        }
-        // Sort by score and limit
-        results.sort((a, b) => b.score - a.score);
-        return results.slice(0, limit);
-    }
-    /**
-     * Get an entry by ID
-     */
-    getEntry(id) {
-        return this.memoryIndex.get(id) || null;
-    }
-    /**
-     * Get all indexed entries
-     */
-    getAllEntries() {
-        return Array.from(this.memoryIndex.values());
-    }
-    /**
-     * Get index statistics
-     */
-    getStats() {
-        let hasEmbeddings = 0;
-        for (const entry of this.memoryIndex.values()) {
-            if (entry.embedding)
-                hasEmbeddings++;
-        }
-        return {
-            indexedCount: this.memoryIndex.size,
-            hasEmbeddings,
-        };
-    }
-    /**
-     * Clear the index
-     */
-    clear() {
-        this.memoryIndex.clear();
-    }
-}
-//# sourceMappingURL=semantic-retrieval.js.map

package/dist/memory/semantic-retrieval.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"semantic-retrieval.js","sourceRoot":"","sources":["../../src/memory/semantic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAiBtD,MAAM,cAAc,GAA4B;IAC9C,QAAQ,EAAE,GAAG;IACb,IAAI,EAAE,EAAE;IACR,cAAc,EAAE,SAAS;CAC1B,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACpB,MAAM,CAA0B;IAChC,WAAW,GAA6B,IAAI,GAAG,EAAE,CAAC;IAClD,gBAAgB,GAAG,mBAAmB,EAAE,CAAC;IAEjD,YAAY,SAA2C,EAAE;QACvD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,qCAAqC;QACrC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC;gBACH,KAAK,CAAC,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACrE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,0BAA0B,EAAE,KAAK,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAAsB;QACrC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,EAAU;QACpB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,UAAiD,EAAE;QAEnD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAE1D,kBAAkB;QAClB,IAAI,cAAwB,CAAC;QAC7B,IAAI,CAAC;YACH,cAAc,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,eAAe;QACf,MAAM,OAAO,GAAiD,EAAE,CAAC;QAEjE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,CAAC,SAAS;gBAAE,SAAS;YAE/B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,cAAc,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAEtF,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACtB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,QAAQ;QAIN,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,IAAI,KAAK,CAAC,SAAS;gBAAE,aAAa,EAAE,CAAC;QACvC,CAAC;QAED,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YACnC,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACF"}

package/dist/memory/short-term/factory.d.ts

@@ -1,26 +0,0 @@
-import type { AgentContextConfig } from '../../types/index.js';
-export interface ShortTermMemoryBackend {
-    store(type: 'action' | 'observation' | 'thought' | 'goal', content: string, importance?: number): Promise<void>;
-    storeBatch?(entries: Array<{
-        type: 'action' | 'observation' | 'thought' | 'goal';
-        content: string;
-        timestamp?: string;
-        importance?: number;
-    }>): Promise<void>;
-    getRecent(limit?: number): Promise<Array<{
-        timestamp: string;
-        type: string;
-        content: string;
-        importance?: number;
-    }>>;
-    query(searchTerm: string, limit?: number): Promise<Array<{
-        timestamp: string;
-        type: string;
-        content: string;
-        importance?: number;
-    }>>;
-    clear(): Promise<void>;
-    close?(): Promise<void>;
-}
-export declare function createShortTermMemory(config: AgentContextConfig): Promise<ShortTermMemoryBackend | null>;
-//# sourceMappingURL=factory.d.ts.map

package/dist/memory/short-term/factory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"factory.d.ts","sourceRoot":"","sources":["../../../src/memory/short-term/factory.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,MAAM,WAAW,sBAAsB;IACrC,KAAK,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS,GAAG,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAChH,UAAU,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS,GAAG,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9J,SAAS,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IACrH,KAAK,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IACrI,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACzB;AAED,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,kBAAkB,GACzB,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,CA0BxC"}

package/dist/memory/short-term/factory.js

@@ -1,28 +0,0 @@
-import { IndexedDBShortTermMemory } from './indexeddb.js';
-import { SQLiteShortTermMemory } from './sqlite.js';
-export async function createShortTermMemory(config) {
-    if (!config.memory?.shortTerm?.enabled) {
-        return null;
-    }
-    const shortTerm = config.memory.shortTerm;
-    // Auto-detect environment
-    // @ts-ignore - window is available in browser but not in Node.js
-    const isWeb = typeof window !== 'undefined' && !shortTerm.forceDesktop;
-    if (isWeb) {
-        // Use IndexedDB for web environments
-        return new IndexedDBShortTermMemory({
-            dbName: shortTerm.webDatabase || 'agent_context_memory',
-            projectId: config.project.name,
-            maxEntries: shortTerm.maxEntries,
-        });
-    }
-    else {
-        // Use SQLite for desktop/CLI environments
-        return new SQLiteShortTermMemory({
-            dbPath: shortTerm.path || './agents/data/memory/short_term.db',
-            projectId: config.project.name,
-            maxEntries: shortTerm.maxEntries,
-        });
-    }
-}
-//# sourceMappingURL=factory.js.map

package/dist/memory/short-term/factory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"factory.js","sourceRoot":"","sources":["../../../src/memory/short-term/factory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAYpD,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,MAA0B;IAE1B,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;IAE1C,0BAA0B;IAC1B,iEAAiE;IACjE,MAAM,KAAK,GAAG,OAAO,MAAM,KAAK,WAAW,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC;IAEvE,IAAI,KAAK,EAAE,CAAC;QACV,qCAAqC;QACrC,OAAO,IAAI,wBAAwB,CAAC;YAClC,MAAM,EAAE,SAAS,CAAC,WAAW,IAAI,sBAAsB;YACvD,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI;YAC9B,UAAU,EAAE,SAAS,CAAC,UAAU;SACjC,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,0CAA0C;QAC1C,OAAO,IAAI,qBAAqB,CAAC;YAC/B,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,oCAAoC;YAC9D,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI;YAC9B,UAAU,EAAE,SAAS,CAAC,UAAU;SACjC,CAAC,CAAC;IACL,CAAC;AACH,CAAC"}

package/dist/memory/short-term/indexeddb.d.ts

@@ -1,25 +0,0 @@
-interface ShortTermMemory {
-    id?: number;
-    timestamp: string;
-    type: 'action' | 'observation' | 'thought' | 'goal';
-    content: string;
-    projectId?: string;
-}
-export declare class IndexedDBShortTermMemory {
-    private db;
-    private projectId;
-    private maxEntries;
-    constructor(config: {
-        dbName: string;
-        projectId?: string;
-        maxEntries?: number;
-    });
-    store(type: ShortTermMemory['type'], content: string, _importance?: number): Promise<void>;
-    getRecent(limit?: number): Promise<ShortTermMemory[]>;
-    query(searchTerm: string, limit?: number): Promise<ShortTermMemory[]>;
-    private prune;
-    clear(): Promise<void>;
-    close(): Promise<void>;
-}
-export {};
-//# sourceMappingURL=indexeddb.d.ts.map

package/dist/memory/short-term/indexeddb.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"indexeddb.d.ts","sourceRoot":"","sources":["../../../src/memory/short-term/indexeddb.ts"],"names":[],"mappings":"AAGA,UAAU,eAAe;IACvB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS,GAAG,MAAM,CAAC;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAaD,qBAAa,wBAAwB;IACnC,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAS;gBAEf,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE;IAMzE,KAAK,CAAC,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAW1F,SAAS,CAAC,KAAK,SAAK,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IASjD,KAAK,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;YAOzD,KAAK;IAab,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}

package/dist/memory/short-term/indexeddb.js

@@ -1,64 +0,0 @@
-/* eslint-disable @typescript-eslint/no-explicit-any */
-import Dexie from 'dexie';
-class AgentContextDB extends Dexie {
-    memories;
-    constructor(dbName) {
-        super(dbName);
-        this.version(1).stores({
-            memories: '++id, timestamp, type, projectId',
-        });
-    }
-}
-export class IndexedDBShortTermMemory {
-    db;
-    projectId;
-    maxEntries;
-    constructor(config) {
-        this.db = new AgentContextDB(config.dbName);
-        this.projectId = config.projectId || 'default';
-        this.maxEntries = config.maxEntries || 50;
-    }
-    async store(type, content, _importance) {
-        await this.db.memories.add({
-            timestamp: new Date().toISOString(),
-            type,
-            content,
-            projectId: this.projectId,
-        });
-        // Auto-prune if exceeds maxEntries
-        await this.prune();
-    }
-    async getRecent(limit = 50) {
-        return this.db.memories
-            .where('projectId')
-            .equals(this.projectId)
-            .reverse()
-            .limit(limit)
-            .toArray();
-    }
-    async query(searchTerm, limit = 10) {
-        const all = await this.getRecent(this.maxEntries);
-        return all
-            .filter((m) => m.content.toLowerCase().includes(searchTerm.toLowerCase()))
-            .slice(0, limit);
-    }
-    async prune() {
-        const count = await this.db.memories.where('projectId').equals(this.projectId).count();
-        if (count > this.maxEntries) {
-            const toDelete = count - this.maxEntries;
-            const oldest = await this.db.memories
-                .where('projectId')
-                .equals(this.projectId)
-                .limit(toDelete)
-                .toArray();
-            await this.db.memories.bulkDelete(oldest.map((m) => m.id));
-        }
-    }
-    async clear() {
-        await this.db.memories.where('projectId').equals(this.projectId).delete();
-    }
-    async close() {
-        await this.db.close();
-    }
-}
-//# sourceMappingURL=indexeddb.js.map

package/dist/memory/short-term/indexeddb.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"indexeddb.js","sourceRoot":"","sources":["../../../src/memory/short-term/indexeddb.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,KAAK,MAAM,OAAO,CAAC;AAU1B,MAAM,cAAe,SAAS,KAAa;IACzC,QAAQ,CAAM;IAEd,YAAY,MAAc;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACrB,QAAQ,EAAE,kCAAkC;SAC7C,CAAC,CAAC;IACL,CAAC;CACF;AAED,MAAM,OAAO,wBAAwB;IAC3B,EAAE,CAAiB;IACnB,SAAS,CAAS;IAClB,UAAU,CAAS;IAE3B,YAAY,MAAmE;QAC7E,IAAI,CAAC,EAAE,GAAG,IAAI,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,SAAS,CAAC;QAC/C,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAA6B,EAAE,OAAe,EAAE,WAAoB;QAC9E,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;YACzB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,IAAI;YACJ,OAAO;YACP,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC,CAAC;QACH,mCAAmC;QACnC,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,EAAE;QACxB,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ;aACpB,KAAK,CAAC,WAAW,CAAC;aAClB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;aACtB,OAAO,EAAE;aACT,KAAK,CAAC,KAAK,CAAC;aACZ,OAAO,EAAE,CAAC;IACf,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,UAAkB,EAAE,KAAK,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClD,OAAO,GAAG;aACP,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;aACzE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAEO,KAAK,CAAC,KAAK;QACjB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,CAAC;QACvF,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ;iBAClC,KAAK,CAAC,WAAW,CAAC;iBAClB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;iBACtB,KAAK,CAAC,QAAQ,CAAC;iBACf,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAG,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,CAAC;IAC5E,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/memory/smart-consolidator.d.ts

@@ -1,53 +0,0 @@
-/**
- * Smart Consolidator Module for UAP
- *
- * Implements intelligent memory consolidation based on relevance, recency, and patterns.
- */
-export interface MemoryEntry {
-    id: string;
-    content: string;
-    type: string;
-    timestamp: string;
-    importance?: number;
-}
-export interface ConsolidationConfig {
-    minEntriesToConsolidate: number;
-    maxTokensPerSummary: number;
-    similarityThreshold: number;
-    priorityBy: 'importance' | 'recency' | 'relevance';
-}
-/**
- * Smart Consolidator
- * Intelligently consolidates related memories into summaries
- */
-export declare class SmartConsolidator {
-    private config;
-    constructor(config?: Partial<ConsolidationConfig>);
-    /**
-     * Consolidate a batch of memories into summaries
-     */
-    consolidate(memories: MemoryEntry[]): Array<{
-        summary: string;
-        sourceIds: string[];
-    }>;
-    /**
-     * Get consolidation recommendations for a batch of memories
-     */
-    getRecommendations(memories: MemoryEntry[]): Array<{
-        ids: string[];
-        reason: string;
-    }>;
-    /**
-     * Group similar memories together
-     */
-    private groupSimilarMemories;
-    /**
-     * Check if two pieces of content are similar
-     */
-    private areSimilar;
-    /**
-     * Generate a summary from multiple memories
-     */
-    private generateSummary;
-}
-//# sourceMappingURL=smart-consolidator.d.ts.map

package/dist/memory/smart-consolidator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"smart-consolidator.d.ts","sourceRoot":"","sources":["../../src/memory/smart-consolidator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,mBAAmB;IAClC,uBAAuB,EAAE,MAAM,CAAC;IAChC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,UAAU,EAAE,YAAY,GAAG,SAAS,GAAG,WAAW,CAAC;CACpD;AASD;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAAsB;gBAExB,MAAM,GAAE,OAAO,CAAC,mBAAmB,CAAM;IAIrD;;OAEG;IACH,WAAW,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA8BrF;;OAEG;IACH,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAgBrF;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAyB5B;;OAEG;IACH,OAAO,CAAC,UAAU;IAoBlB;;OAEG;IACH,OAAO,CAAC,eAAe;CAkCxB"}