@agents-eco/agentic-memory 0.1.0

package/dist/embeddings/voyage.js

@@ -0,0 +1,78 @@
+/**
+ * Voyage AI embedding backend.
+ * Uses the Voyage API for high-quality neural embeddings.
+ *
+ * Models:
+ *   - voyage-3-lite (default): 512 dimensions, fast, cheap
+ *   - voyage-3: 1024 dimensions, higher quality
+ *   - voyage-3-large: 1024 dimensions, best quality
+ *   - voyage-code-3: optimized for code
+ *
+ * API docs: https://docs.voyageai.com/reference/embeddings-api
+ */
+export class VoyageEmbedding {
+    name = "voyage";
+    dimension;
+    apiKey;
+    model;
+    baseUrl;
+    constructor(apiKey, model = "voyage-3-lite", baseUrl) {
+        if (!apiKey) {
+            throw new Error("Voyage API key is required. Get one at https://dash.voyageai.com/");
+        }
+        this.apiKey = apiKey;
+        this.model = model;
+        this.baseUrl = baseUrl ?? "https://api.voyageai.com/v1";
+        // Set dimension based on model
+        switch (model) {
+            case "voyage-3-lite":
+                this.dimension = 512;
+                break;
+            case "voyage-3":
+            case "voyage-3-large":
+            case "voyage-code-3":
+                this.dimension = 1024;
+                break;
+            default:
+                this.dimension = 1024;
+        }
+    }
+    async embed(text) {
+        const results = await this.callApi([text]);
+        return results[0];
+    }
+    async embedBatch(texts) {
+        // Voyage supports up to 128 texts per batch
+        const batchSize = 128;
+        const allResults = [];
+        for (let i = 0; i < texts.length; i += batchSize) {
+            const batch = texts.slice(i, i + batchSize);
+            const results = await this.callApi(batch);
+            allResults.push(...results);
+        }
+        return allResults;
+    }
+    async callApi(input) {
+        const res = await fetch(`${this.baseUrl}/embeddings`, {
+            method: "POST",
+            headers: {
+                "Content-Type": "application/json",
+                "Authorization": `Bearer ${this.apiKey}`,
+            },
+            body: JSON.stringify({
+                model: this.model,
+                input,
+            }),
+        });
+        if (!res.ok) {
+            const errText = await res.text();
+            throw new Error(`Voyage API error (${res.status}): ${errText}`);
+        }
+        const data = await res.json();
+        // Sort by index to maintain order
+        return data.data
+            .sort((a, b) => a.index - b.index)
+            .map((d) => d.embedding);
+    }
+}
+//# sourceMappingURL=voyage.js.map

package/dist/embeddings/voyage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"voyage.js","sourceRoot":"","sources":["../../src/embeddings/voyage.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IACjB,IAAI,GAAG,QAAQ,CAAC;IAChB,SAAS,CAAS;IACnB,MAAM,CAAS;IACf,KAAK,CAAS;IACd,OAAO,CAAS;IAExB,YAAY,MAAc,EAAE,QAAgB,eAAe,EAAE,OAAgB;QAC3E,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,6BAA6B,CAAC;QAExD,+BAA+B;QAC/B,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,eAAe;gBAClB,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;gBACrB,MAAM;YACR,KAAK,UAAU,CAAC;YAChB,KAAK,gBAAgB,CAAC;YACtB,KAAK,eAAe;gBAClB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,MAAM;YACR;gBACE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,4CAA4C;QAC5C,MAAM,SAAS,GAAG,GAAG,CAAC;QACtB,MAAM,UAAU,GAAe,EAAE,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YAC5C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC1C,UAAU,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,KAAe;QACnC,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,aAAa,EAAE;YACpD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;aACzC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,KAAK;aACN,CAAC;SACH,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,CAAC,MAAM,MAAM,OAAO,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAG1B,CAAC;QAEF,kCAAkC;QAClC,OAAO,IAAI,CAAC,IAAI;aACb,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;CACF"}

package/dist/graph.d.ts

@@ -0,0 +1,42 @@
+import type { MemoryNode, MemoryNodeType, MemoryEdge, MemoryRelation, SearchResult, SearchOptions, EmbeddingBackend } from "./types.js";
+/**
+ * In-memory graph structure for agent memory.
+ * Supports node/edge CRUD, graph traversal, and hybrid search (keyword + vector + recency).
+ */
+export declare class Graph {
+    private nodes;
+    private edges;
+    /** Adjacency list: nodeId -> Set of edgeIds */
+    private adjacency;
+    private embedding;
+    constructor(embedding?: EmbeddingBackend);
+    setEmbeddingBackend(backend: EmbeddingBackend): void;
+    addNode(content: string, type: MemoryNodeType, importance?: number, metadata?: Record<string, unknown>): Promise<MemoryNode>;
+    getNode(id: string): MemoryNode | undefined;
+    removeNode(id: string): boolean;
+    /** Reinforce a node — increases access count and updates lastAccessed */
+    reinforceNode(id: string, importanceBoost?: number): void;
+    /** Apply decay to all nodes based on time since last access */
+    applyDecay(decayRate: number, minImportance: number): string[];
+    getAllNodes(): MemoryNode[];
+    getNodeCount(): number;
+    addEdge(sourceId: string, targetId: string, relation: MemoryRelation, weight?: number, metadata?: Record<string, unknown>): MemoryEdge | null;
+    findEdge(sourceId: string, targetId: string, relation?: MemoryRelation): MemoryEdge | undefined;
+    /** Get all neighbors of a node */
+    getNeighbors(nodeId: string, relation?: MemoryRelation): MemoryNode[];
+    /** Get edges connected to a node */
+    getEdgesForNode(nodeId: string): MemoryEdge[];
+    getAllEdges(): MemoryEdge[];
+    getEdgeCount(): number;
+    /** BFS traversal from a starting node, up to maxDepth */
+    traverse(startId: string, maxDepth?: number): MemoryNode[];
+    search(query: string, options?: SearchOptions): Promise<SearchResult[]>;
+    private vectorSearch;
+    private keywordSearch;
+    getState(): {
+        nodes: MemoryNode[];
+        edges: MemoryEdge[];
+    };
+    loadState(nodes: MemoryNode[], edges: MemoryEdge[]): void;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,UAAU,EACV,cAAc,EACd,UAAU,EACV,cAAc,EAEd,YAAY,EACZ,aAAa,EACb,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAEpB;;;GAGG;AACH,qBAAa,KAAK;IAChB,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,KAAK,CAAsC;IACnD,+CAA+C;IAC/C,OAAO,CAAC,SAAS,CAAuC;IACxD,OAAO,CAAC,SAAS,CAAiC;gBAEtC,SAAS,CAAC,EAAE,gBAAgB;IAIxC,mBAAmB,CAAC,OAAO,EAAE,gBAAgB,GAAG,IAAI;IAM9C,OAAO,CACX,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,cAAc,EACpB,UAAU,GAAE,MAAY,EACxB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACrC,OAAO,CAAC,UAAU,CAAC;IA6BtB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAI3C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAsB/B,yEAAyE;IACzE,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,eAAe,GAAE,MAAa,GAAG,IAAI;IAQ/D,+DAA+D;IAC/D,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,EAAE;IAkB9D,WAAW,IAAI,UAAU,EAAE;IAI3B,YAAY,IAAI,MAAM;IAMtB,OAAO,CACL,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,cAAc,EACxB,MAAM,GAAE,MAAY,EACpB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACrC,UAAU,GAAG,IAAI;IA2BpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,UAAU,GAAG,SAAS;IAiB/F,kCAAkC;IAClC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,UAAU,EAAE;IAiBrE,oCAAoC;IACpC,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE;IAQ7C,WAAW,IAAI,UAAU,EAAE;IAI3B,YAAY,IAAI,MAAM;IAMtB,yDAAyD;IACzD,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,UAAU,EAAE;IA6BvD,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;YAmEnE,YAAY;IAoB1B,OAAO,CAAC,aAAa;IAmBrB,QAAQ,IAAI;QAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QAAC,KAAK,EAAE,UAAU,EAAE,CAAA;KAAE;IAOxD,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI;CAgB1D"}

package/dist/graph.js

@@ -0,0 +1,322 @@
+import { randomUUID } from "node:crypto";
+/**
+ * In-memory graph structure for agent memory.
+ * Supports node/edge CRUD, graph traversal, and hybrid search (keyword + vector + recency).
+ */
+export class Graph {
+    nodes = new Map();
+    edges = new Map();
+    /** Adjacency list: nodeId -> Set of edgeIds */
+    adjacency = new Map();
+    embedding = null;
+    constructor(embedding) {
+        this.embedding = embedding ?? null;
+    }
+    setEmbeddingBackend(backend) {
+        this.embedding = backend;
+    }
+    // ── Node Operations ─────────────────────────────────
+    async addNode(content, type, importance = 0.5, metadata = {}) {
+        const now = new Date().toISOString();
+        let embedding;
+        if (this.embedding) {
+            try {
+                embedding = await this.embedding.embed(content);
+            }
+            catch {
+                // Embedding failure is non-fatal
+            }
+        }
+        const node = {
+            id: randomUUID(),
+            content,
+            type,
+            embedding,
+            importance: Math.max(0, Math.min(1, importance)),
+            accessCount: 0,
+            lastAccessed: now,
+            createdAt: now,
+            metadata,
+        };
+        this.nodes.set(node.id, node);
+        this.adjacency.set(node.id, new Set());
+        return node;
+    }
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    removeNode(id) {
+        if (!this.nodes.has(id))
+            return false;
+        // Remove all edges connected to this node
+        const edgeIds = this.adjacency.get(id);
+        if (edgeIds) {
+            for (const edgeId of edgeIds) {
+                const edge = this.edges.get(edgeId);
+                if (edge) {
+                    // Remove from the other node's adjacency
+                    const otherId = edge.source === id ? edge.target : edge.source;
+                    this.adjacency.get(otherId)?.delete(edgeId);
+                    this.edges.delete(edgeId);
+                }
+            }
+        }
+        this.adjacency.delete(id);
+        this.nodes.delete(id);
+        return true;
+    }
+    /** Reinforce a node — increases access count and updates lastAccessed */
+    reinforceNode(id, importanceBoost = 0.05) {
+        const node = this.nodes.get(id);
+        if (!node)
+            return;
+        node.accessCount++;
+        node.lastAccessed = new Date().toISOString();
+        node.importance = Math.min(1, node.importance + importanceBoost);
+    }
+    /** Apply decay to all nodes based on time since last access */
+    applyDecay(decayRate, minImportance) {
+        const now = Date.now();
+        const removed = [];
+        for (const [id, node] of this.nodes) {
+            const hoursSinceAccess = (now - new Date(node.lastAccessed).getTime()) / (1000 * 60 * 60);
+            const decay = decayRate * hoursSinceAccess;
+            node.importance = Math.max(0, node.importance - decay);
+            if (node.importance < minImportance && node.accessCount < 3) {
+                this.removeNode(id);
+                removed.push(id);
+            }
+        }
+        return removed;
+    }
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    getNodeCount() {
+        return this.nodes.size;
+    }
+    // ── Edge Operations ─────────────────────────────────
+    addEdge(sourceId, targetId, relation, weight = 0.5, metadata = {}) {
+        if (!this.nodes.has(sourceId) || !this.nodes.has(targetId))
+            return null;
+        // Check for duplicate edge
+        const existing = this.findEdge(sourceId, targetId, relation);
+        if (existing) {
+            // Reinforce existing edge
+            existing.weight = Math.min(1, existing.weight + 0.1);
+            return existing;
+        }
+        const edge = {
+            id: randomUUID(),
+            source: sourceId,
+            target: targetId,
+            relation,
+            weight: Math.max(0, Math.min(1, weight)),
+            createdAt: new Date().toISOString(),
+            metadata,
+        };
+        this.edges.set(edge.id, edge);
+        this.adjacency.get(sourceId)?.add(edge.id);
+        this.adjacency.get(targetId)?.add(edge.id);
+        return edge;
+    }
+    findEdge(sourceId, targetId, relation) {
+        const edgeIds = this.adjacency.get(sourceId);
+        if (!edgeIds)
+            return undefined;
+        for (const edgeId of edgeIds) {
+            const edge = this.edges.get(edgeId);
+            if (!edge)
+                continue;
+            if ((edge.source === sourceId && edge.target === targetId) ||
+                (edge.source === targetId && edge.target === sourceId)) {
+                if (!relation || edge.relation === relation)
+                    return edge;
+            }
+        }
+        return undefined;
+    }
+    /** Get all neighbors of a node */
+    getNeighbors(nodeId, relation) {
+        const edgeIds = this.adjacency.get(nodeId);
+        if (!edgeIds)
+            return [];
+        const neighbors = [];
+        for (const edgeId of edgeIds) {
+            const edge = this.edges.get(edgeId);
+            if (!edge)
+                continue;
+            if (relation && edge.relation !== relation)
+                continue;
+            const neighborId = edge.source === nodeId ? edge.target : edge.source;
+            const neighbor = this.nodes.get(neighborId);
+            if (neighbor)
+                neighbors.push(neighbor);
+        }
+        return neighbors;
+    }
+    /** Get edges connected to a node */
+    getEdgesForNode(nodeId) {
+        const edgeIds = this.adjacency.get(nodeId);
+        if (!edgeIds)
+            return [];
+        return Array.from(edgeIds)
+            .map((id) => this.edges.get(id))
+            .filter((e) => e !== undefined);
+    }
+    getAllEdges() {
+        return Array.from(this.edges.values());
+    }
+    getEdgeCount() {
+        return this.edges.size;
+    }
+    // ── Graph Traversal ─────────────────────────────────
+    /** BFS traversal from a starting node, up to maxDepth */
+    traverse(startId, maxDepth = 2) {
+        const visited = new Set();
+        const result = [];
+        const queue = [{ id: startId, depth: 0 }];
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (visited.has(id) || depth > maxDepth)
+                continue;
+            visited.add(id);
+            const node = this.nodes.get(id);
+            if (node) {
+                result.push(node);
+                if (depth < maxDepth) {
+                    const neighbors = this.getNeighbors(id);
+                    for (const n of neighbors) {
+                        if (!visited.has(n.id)) {
+                            queue.push({ id: n.id, depth: depth + 1 });
+                        }
+                    }
+                }
+            }
+        }
+        return result;
+    }
+    // ── Search ──────────────────────────────────────────
+    async search(query, options = {}) {
+        const { limit = 5, types, minScore = 0.0, includeRelated = false, traversalDepth = 1, method = "hybrid", } = options;
+        let results = [];
+        // Filter nodes by type if specified
+        let candidates = Array.from(this.nodes.values());
+        if (types && types.length > 0) {
+            candidates = candidates.filter((n) => types.includes(n.type));
+        }
+        if (method === "vector" || method === "hybrid") {
+            const vectorResults = await this.vectorSearch(query, candidates);
+            results.push(...vectorResults);
+        }
+        if (method === "keyword" || method === "hybrid") {
+            const keywordResults = this.keywordSearch(query, candidates);
+            results.push(...keywordResults);
+        }
+        // Add recency bonus
+        const now = Date.now();
+        for (const r of results) {
+            const hoursSince = (now - new Date(r.node.lastAccessed).getTime()) / (1000 * 60 * 60);
+            const recencyBonus = Math.max(0, 0.2 - hoursSince * 0.01);
+            r.score += recencyBonus;
+            // Importance bonus
+            r.score += r.node.importance * 0.15;
+        }
+        // Deduplicate by node ID, keeping highest score
+        const deduped = new Map();
+        for (const r of results) {
+            const existing = deduped.get(r.node.id);
+            if (!existing || r.score > existing.score) {
+                deduped.set(r.node.id, r);
+            }
+        }
+        let sorted = Array.from(deduped.values())
+            .filter((r) => r.score >= minScore)
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit);
+        // Attach related nodes via graph traversal
+        if (includeRelated) {
+            for (const r of sorted) {
+                r.related = this.traverse(r.node.id, traversalDepth).filter((n) => n.id !== r.node.id);
+            }
+        }
+        // Reinforce accessed nodes
+        for (const r of sorted) {
+            this.reinforceNode(r.node.id, 0.02);
+        }
+        return sorted;
+    }
+    async vectorSearch(query, candidates) {
+        if (!this.embedding)
+            return [];
+        const withEmbeddings = candidates.filter((n) => n.embedding && n.embedding.length > 0);
+        if (withEmbeddings.length === 0)
+            return [];
+        let queryEmbedding;
+        try {
+            queryEmbedding = await this.embedding.embed(query);
+        }
+        catch {
+            return [];
+        }
+        return withEmbeddings.map((node) => ({
+            node,
+            score: cosineSimilarity(queryEmbedding, node.embedding),
+            method: "vector",
+        }));
+    }
+    keywordSearch(query, candidates) {
+        const queryWords = query.toLowerCase().split(/\s+/).filter((w) => w.length > 2);
+        if (queryWords.length === 0)
+            return [];
+        return candidates
+            .map((node) => {
+            const text = node.content.toLowerCase();
+            let matches = 0;
+            for (const word of queryWords) {
+                if (text.includes(word))
+                    matches++;
+            }
+            const score = queryWords.length > 0 ? matches / queryWords.length : 0;
+            return { node, score: score * 0.8, method: "keyword" };
+        })
+            .filter((r) => r.score > 0);
+    }
+    // ── Serialization ───────────────────────────────────
+    getState() {
+        return {
+            nodes: Array.from(this.nodes.values()),
+            edges: Array.from(this.edges.values()),
+        };
+    }
+    loadState(nodes, edges) {
+        this.nodes.clear();
+        this.edges.clear();
+        this.adjacency.clear();
+        for (const node of nodes) {
+            this.nodes.set(node.id, node);
+            this.adjacency.set(node.id, new Set());
+        }
+        for (const edge of edges) {
+            this.edges.set(edge.id, edge);
+            this.adjacency.get(edge.source)?.add(edge.id);
+            this.adjacency.get(edge.target)?.add(edge.id);
+        }
+    }
+}
+// ── Utilities ───────────────────────────────────────────
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    return denom === 0 ? 0 : dot / denom;
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAYzC;;;GAGG;AACH,MAAM,OAAO,KAAK;IACR,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC3C,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IACnD,+CAA+C;IACvC,SAAS,GAA6B,IAAI,GAAG,EAAE,CAAC;IAChD,SAAS,GAA4B,IAAI,CAAC;IAElD,YAAY,SAA4B;QACtC,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,mBAAmB,CAAC,OAAyB;QAC3C,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;IAC3B,CAAC;IAED,uDAAuD;IAEvD,KAAK,CAAC,OAAO,CACX,OAAe,EACf,IAAoB,EACpB,aAAqB,GAAG,EACxB,WAAoC,EAAE;QAEtC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,IAAI,SAA+B,CAAC;QAEpC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC;gBACH,SAAS,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,iCAAiC;YACnC,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,UAAU,EAAE;YAChB,OAAO;YACP,IAAI;YACJ,SAAS;YACT,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChD,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,GAAG;YACd,QAAQ;SACT,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAEtC,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,IAAI,EAAE,CAAC;oBACT,yCAAyC;oBACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAC/D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC5C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yEAAyE;IACzE,aAAa,CAAC,EAAU,EAAE,kBAA0B,IAAI;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC7C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC,CAAC;IACnE,CAAC;IAED,+DAA+D;IAC/D,UAAU,CAAC,SAAiB,EAAE,aAAqB;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAC1F,MAAM,KAAK,GAAG,SAAS,GAAG,gBAAgB,CAAC;YAC3C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC;YAEvD,IAAI,IAAI,CAAC,UAAU,GAAG,aAAa,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC5D,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,uDAAuD;IAEvD,OAAO,CACL,QAAgB,EAChB,QAAgB,EAChB,QAAwB,EACxB,SAAiB,GAAG,EACpB,WAAoC,EAAE;QAEtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAExE,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC7D,IAAI,QAAQ,EAAE,CAAC;YACb,0BAA0B;YAC1B,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;YACrD,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,UAAU,EAAE;YAChB,MAAM,EAAE,QAAQ;YAChB,MAAM,EAAE,QAAQ;YAChB,QAAQ;YACR,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACxC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,QAAQ;SACT,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,QAAgB,EAAE,QAAgB,EAAE,QAAyB;QACpE,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IACE,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC;gBACtD,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,EACtD,CAAC;gBACD,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBAAE,OAAO,IAAI,CAAC;YAC3D,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,kCAAkC;IAClC,YAAY,CAAC,MAAc,EAAE,QAAyB;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IAAI,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBAAE,SAAS;YAErD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACtE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,QAAQ;gBAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,oCAAoC;IACpC,eAAe,CAAC,MAAc;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;aACvB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAC/B,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACrD,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,uDAAuD;IAEvD,yDAAyD;IACzD,QAAQ,CAAC,OAAe,EAAE,WAAmB,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACrC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAClD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;wBAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;4BACvB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,uDAAuD;IAEvD,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,UAAyB,EAAE;QACrD,MAAM,EACJ,KAAK,GAAG,CAAC,EACT,KAAK,EACL,QAAQ,GAAG,GAAG,EACd,cAAc,GAAG,KAAK,EACtB,cAAc,GAAG,CAAC,EAClB,MAAM,GAAG,QAAQ,GAClB,GAAG,OAAO,CAAC;QAEZ,IAAI,OAAO,GAAmB,EAAE,CAAC;QAEjC,oCAAoC;QACpC,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC/C,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YACjE,OAAO,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YAChD,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAC7D,OAAO,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;QAClC,CAAC;QAED,oBAAoB;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,UAAU,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACtF,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,UAAU,GAAG,IAAI,CAAC,CAAC;YAC1D,CAAC,CAAC,KAAK,IAAI,YAAY,CAAC;YACxB,mBAAmB;YACnB,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACtC,CAAC;QAED,gDAAgD;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;aACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC;aAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAEnB,2CAA2C;QAC3C,IAAI,cAAc,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzF,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,KAAa,EAAE,UAAwB;QAChE,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAE/B,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE3C,IAAI,cAAwB,CAAC;QAC7B,IAAI,CAAC;YACH,cAAc,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACnC,IAAI;YACJ,KAAK,EAAE,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,SAAU,CAAC;YACxD,MAAM,EAAE,QAAiB;SAC1B,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,aAAa,CAAC,KAAa,EAAE,UAAwB;QAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvC,OAAO,UAAU;aACd,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YACxC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,OAAO,EAAE,CAAC;YACrC,CAAC;YACD,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,MAAM,EAAE,SAAkB,EAAE,CAAC;QAClE,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,uDAAuD;IAEvD,QAAQ;QACN,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACvC,CAAC;IACJ,CAAC;IAED,SAAS,CAAC,KAAmB,EAAE,KAAmB;QAChD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;CACF;AAED,2DAA2D;AAE3D,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,9 @@
+export { AgenticMemory } from "./manager.js";
+export { ShortTermMemory } from "./stm.js";
+export { LongTermMemory } from "./ltm.js";
+export { Graph } from "./graph.js";
+export { LocalEmbedding } from "./embeddings/local.js";
+export { VoyageEmbedding } from "./embeddings/voyage.js";
+export { LocalStorage } from "./storage/local.js";
+export type { AgenticMemoryConfig, STMConfig, LTMConfig, MemoryNode, MemoryNodeType, MemoryEdge, MemoryRelation, MemoryGraph, STMEntry, SearchResult, SearchOptions, EmbeddingBackend, StorageBackend, SerializedGraph, SerializedNode, SerializedEdge, } from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAG7C,OAAO,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAGnC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,YAAY,EAEV,mBAAmB,EACnB,SAAS,EACT,SAAS,EAET,UAAU,EACV,cAAc,EACd,UAAU,EACV,cAAc,EACd,WAAW,EAEX,QAAQ,EAER,YAAY,EACZ,aAAa,EAEb,gBAAgB,EAChB,cAAc,EAEd,eAAe,EACf,cAAc,EACd,cAAc,GACf,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,12 @@
+// ── Core ────────────────────────────────────────────────
+export { AgenticMemory } from "./manager.js";
+// ── Components ──────────────────────────────────────────
+export { ShortTermMemory } from "./stm.js";
+export { LongTermMemory } from "./ltm.js";
+export { Graph } from "./graph.js";
+// ── Embedding Backends ──────────────────────────────────
+export { LocalEmbedding } from "./embeddings/local.js";
+export { VoyageEmbedding } from "./embeddings/voyage.js";
+// ── Storage Backends ────────────────────────────────────
+export { LocalStorage } from "./storage/local.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,2DAA2D;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE7C,2DAA2D;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,2DAA2D;AAC3D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAEzD,2DAA2D;AAC3D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/ltm.d.ts

@@ -0,0 +1,60 @@
+import type { LTMConfig, MemoryNode, MemoryNodeType, MemoryRelation, MemoryEdge, SearchResult, SearchOptions, EmbeddingBackend } from "./types.js";
+/**
+ * Long-Term Memory (LTM) — persistent graph-based memory.
+ *
+ * Stores memories as nodes in a graph with typed relationships.
+ * Supports decay (forgetting), reinforcement (remembering), and
+ * hybrid search (vector + keyword + graph traversal).
+ */
+export declare class LongTermMemory {
+    private graph;
+    private config;
+    constructor(config?: Partial<LTMConfig>, embedding?: EmbeddingBackend);
+    setEmbeddingBackend(backend: EmbeddingBackend): void;
+    /** Add a memory to LTM */
+    add(content: string, type: MemoryNodeType, importance?: number, metadata?: Record<string, unknown>): Promise<MemoryNode>;
+    /** Create a relationship between two memories */
+    link(sourceId: string, targetId: string, relation: MemoryRelation, weight?: number): MemoryEdge | null;
+    /** Store a fact — semantic memory with entity extraction */
+    addFact(content: string, entities?: string[], importance?: number): Promise<{
+        node: MemoryNode;
+        entityNodes: MemoryNode[];
+    }>;
+    /** Store an episode — episodic memory from a conversation turn */
+    addEpisode(content: string, importance?: number, previousEpisodeId?: string): Promise<MemoryNode>;
+    /** Store an observation */
+    addObservation(content: string, importance?: number): Promise<MemoryNode>;
+    /** Store a goal */
+    addGoal(content: string, importance?: number): Promise<MemoryNode>;
+    /** Search LTM with hybrid search */
+    search(query: string, options?: SearchOptions): Promise<SearchResult[]>;
+    /** Get a specific memory by ID */
+    get(id: string): MemoryNode | undefined;
+    /** Get all memories of a specific type */
+    getByType(type: MemoryNodeType): MemoryNode[];
+    /** Get related memories via graph traversal */
+    getRelated(nodeId: string, depth?: number): MemoryNode[];
+    /** Get neighbors of a node with a specific relation */
+    getNeighbors(nodeId: string, relation?: MemoryRelation): MemoryNode[];
+    /** Find an entity node by name (case-insensitive) */
+    findEntity(name: string): MemoryNode | undefined;
+    /** Apply decay to all memories */
+    decay(): string[];
+    /** Reinforce a memory (accessed/recalled) */
+    reinforce(id: string, boost?: number): void;
+    /** Remove a memory */
+    remove(id: string): boolean;
+    /** Get graph statistics */
+    stats(): {
+        nodes: number;
+        edges: number;
+        byType: Record<string, number>;
+    };
+    getState(): {
+        nodes: MemoryNode[];
+        edges: MemoryEdge[];
+    };
+    loadState(nodes: MemoryNode[], edges: MemoryEdge[]): void;
+    private pruneWeakest;
+}
+//# sourceMappingURL=ltm.d.ts.map

package/dist/ltm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ltm.d.ts","sourceRoot":"","sources":["../src/ltm.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,SAAS,EACT,UAAU,EACV,cAAc,EACd,cAAc,EACd,UAAU,EACV,YAAY,EACZ,aAAa,EACb,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAQpB;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,MAAM,CAAY;gBAEd,MAAM,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC,EAAE,gBAAgB;IAKrE,mBAAmB,CAAC,OAAO,EAAE,gBAAgB,GAAG,IAAI;IAMpD,0BAA0B;IACpB,GAAG,CACP,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,cAAc,EACpB,UAAU,GAAE,MAAY,EACxB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACrC,OAAO,CAAC,UAAU,CAAC;IAStB,iDAAiD;IACjD,IAAI,CACF,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,cAAc,EACxB,MAAM,GAAE,MAAY,GACnB,UAAU,GAAG,IAAI;IAIpB,4DAA4D;IACtD,OAAO,CACX,OAAO,EAAE,MAAM,EACf,QAAQ,GAAE,MAAM,EAAO,EACvB,UAAU,GAAE,MAAY,GACvB,OAAO,CAAC;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,WAAW,EAAE,UAAU,EAAE,CAAA;KAAE,CAAC;IAqB3D,kEAAkE;IAC5D,UAAU,CACd,OAAO,EAAE,MAAM,EACf,UAAU,GAAE,MAAY,EACxB,iBAAiB,CAAC,EAAE,MAAM,GACzB,OAAO,CAAC,UAAU,CAAC;IAUtB,2BAA2B;IACrB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,GAAE,MAAY,GAAG,OAAO,CAAC,UAAU,CAAC;IAIpF,mBAAmB;IACb,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,GAAE,MAAY,GAAG,OAAO,CAAC,UAAU,CAAC;IAM7E,oCAAoC;IAC9B,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAI7E,kCAAkC;IAClC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAIvC,0CAA0C;IAC1C,SAAS,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,EAAE;IAI7C,+CAA+C;IAC/C,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAU,GAAG,UAAU,EAAE;IAI3D,uDAAuD;IACvD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,UAAU,EAAE;IAIrE,qDAAqD;IACrD,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAShD,kCAAkC;IAClC,KAAK,IAAI,MAAM,EAAE;IAIjB,6CAA6C;IAC7C,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,GAAE,MAAa,GAAG,IAAI;IAIjD,sBAAsB;IACtB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI3B,2BAA2B;IAC3B,KAAK,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE;IAezE,QAAQ,IAAI;QAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QAAC,KAAK,EAAE,UAAU,EAAE,CAAA;KAAE;IAIxD,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI;IAMzD,OAAO,CAAC,YAAY;CASrB"}