@project-ava-supernova/core 0.2.71

package/dist/memory/embedding-store.js

@@ -0,0 +1,109 @@
+import { readFile, writeFile, rename } from 'node:fs/promises';
+import { join } from 'node:path';
+import { logger } from '../core/logger.js';
+const STORE_VERSION = 1;
+const SAVE_DEBOUNCE_MS = 2000;
+/**
+ * Per-scope embedding store, persisted to `embeddings.json` ALONGSIDE (not
+ * inside) `graph.json`. Keeping vectors out of the graph means the 32MB graph
+ * isn't bloated to ~74MB and its frequent saves stay fast. Vectors are
+ * regenerable (the backfill rebuilds on corruption / model change), so a plain
+ * atomic write is enough — no locking.
+ */
+export class EmbeddingStore {
+    filePath;
+    tmpPath;
+    model;
+    data = { version: STORE_VERSION, model: '', dim: 0, vectors: {} };
+    loaded = false;
+    dirty = false;
+    saveTimer = null;
+    constructor(memDir, model) {
+        this.filePath = join(memDir, 'embeddings.json');
+        this.tmpPath = `${this.filePath}.tmp`;
+        this.model = model;
+        this.data.model = model;
+    }
+    async load() {
+        if (this.loaded)
+            return;
+        this.loaded = true;
+        try {
+            const raw = await readFile(this.filePath, 'utf-8');
+            const parsed = JSON.parse(raw);
+            if (parsed?.model === this.model && parsed.vectors) {
+                this.data = { version: STORE_VERSION, model: this.model, dim: parsed.dim ?? 0, vectors: parsed.vectors };
+            }
+            else {
+                // Model changed (or unreadable shape) — start fresh; backfill rebuilds.
+                logger.debug(`[embeddings] store model mismatch (${parsed?.model} ≠ ${this.model}) — resetting`);
+            }
+        }
+        catch {
+            // No file yet, or corrupt — start empty. Backfill will populate.
+        }
+    }
+    has(nodeId) {
+        return Array.isArray(this.data.vectors[nodeId]);
+    }
+    get(nodeId) {
+        return this.data.vectors[nodeId];
+    }
+    set(nodeId, vec) {
+        if (this.data.dim === 0)
+            this.data.dim = vec.length;
+        this.data.vectors[nodeId] = vec;
+        this.dirty = true;
+        this.scheduleSave();
+    }
+    delete(nodeId) {
+        if (this.data.vectors[nodeId]) {
+            delete this.data.vectors[nodeId];
+            this.dirty = true;
+            this.scheduleSave();
+        }
+    }
+    /** Set of node ids that already have a vector — the backfill diffs against this. */
+    embeddedIds() {
+        return new Set(Object.keys(this.data.vectors));
+    }
+    get size() {
+        return Object.keys(this.data.vectors).length;
+    }
+    get dim() {
+        return this.data.dim;
+    }
+    scheduleSave() {
+        if (this.saveTimer)
+            return;
+        this.saveTimer = setTimeout(() => {
+            this.saveTimer = null;
+            void this.save();
+        }, SAVE_DEBOUNCE_MS);
+        // Don't keep the process alive just for a debounced embedding save; clean
+        // shutdown paths call flush().
+        this.saveTimer.unref?.();
+    }
+    async save() {
+        if (!this.dirty)
+            return;
+        this.dirty = false;
+        try {
+            await writeFile(this.tmpPath, JSON.stringify(this.data));
+            await rename(this.tmpPath, this.filePath); // atomic swap
+        }
+        catch (err) {
+            logger.debug(`[embeddings] store save failed (will retry): ${err instanceof Error ? err.message : String(err)}`);
+            this.dirty = true; // keep dirty so a later set()/flush() retries
+        }
+    }
+    /** Flush any pending debounced write immediately (backfill batches, shutdown). */
+    async flush() {
+        if (this.saveTimer) {
+            clearTimeout(this.saveTimer);
+            this.saveTimer = null;
+        }
+        await this.save();
+    }
+}
+//# sourceMappingURL=embedding-store.js.map

package/dist/memory/embedding-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-store.js","sourceRoot":"","sources":["../../src/memory/embedding-store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAa3C,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAE9B;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IACR,QAAQ,CAAS;IACjB,OAAO,CAAS;IAChB,KAAK,CAAS;IACvB,IAAI,GAAuB,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACtF,MAAM,GAAG,KAAK,CAAC;IACf,KAAK,GAAG,KAAK,CAAC;IACd,SAAS,GAAyC,IAAI,CAAC;IAE/D,YAAY,MAAc,EAAE,KAAa;QACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,QAAQ,MAAM,CAAC;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAuB,CAAC;YACrD,IAAI,MAAM,EAAE,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnD,IAAI,CAAC,IAAI,GAAG,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;YAC3G,CAAC;iBAAM,CAAC;gBACN,wEAAwE;gBACxE,MAAM,CAAC,KAAK,CAAC,sCAAsC,MAAM,EAAE,KAAK,MAAM,IAAI,CAAC,KAAK,eAAe,CAAC,CAAC;YACnG,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,iEAAiE;QACnE,CAAC;IACH,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,MAAc,EAAE,GAAa;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACpD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,MAAc;QACnB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,oFAAoF;IACpF,WAAW;QACT,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,IAAI,IAAI;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC/C,CAAC;IAED,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACvB,CAAC;IAEO,YAAY;QAClB,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAC3B,IAAI,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;YAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACrB,0EAA0E;QAC1E,+BAA+B;QAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACzD,MAAM,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,cAAc;QAC3D,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,gDAAgD,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,8CAA8C;QACnE,CAAC;IACH,CAAC;IAED,kFAAkF;IAClF,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACxB,CAAC;QACD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;CACF"}

package/dist/memory/graph-engine.d.ts

@@ -0,0 +1,145 @@
+/**
+ * MemoryGraph — the core graph engine for Memory v3.
+ *
+ * Manages a directed graph of MemoryNodes connected by typed MemoryEdges.
+ * Every operation (add, update, recall, decay, forget) goes through this
+ * class. It owns persistence to disk (graph.json) and exposes a clean API
+ * that MemoryManager wraps for backwards compatibility.
+ *
+ * Design principles:
+ *   - Local-first: reads/writes disk, never requires network
+ *   - Lazy decay: confidence decay is calculated on read, persisted on save
+ *   - Edge-aware recall: follows typed edges to find contextually related nodes
+ *   - Self-pruning: principled forgetting keeps the graph lean
+ *   - Training-ready: every node+edge is a potential training example
+ */
+import type { MemoryNode, MemoryEdge, EdgeType, MemoryGraphStore, GraphRecallOptions, ScoredNode, MemoryCategory, ConfidenceSource, ArchiveReason, NodeSource } from './types.js';
+import { CONFIDENCE_REINFORCEMENT } from './types.js';
+export declare class MemoryGraph {
+    readonly baseDir: string;
+    private store;
+    private tfidfIndex;
+    private dirty;
+    private readonly graphPath;
+    constructor(baseDir: string);
+    load(): Promise<void>;
+    save(): Promise<void>;
+    /** Force save even if not dirty (e.g., after migration). */
+    forceSave(): Promise<void>;
+    /** Get all active (non-archived) nodes. */
+    getActiveNodes(): MemoryNode[];
+    /** Get all nodes including archived. */
+    getAllNodes(): MemoryNode[];
+    /** Get a node by ID. */
+    getNode(id: string): MemoryNode | null;
+    /** Add a new node to the graph. Returns the created node. */
+    addNode(opts: {
+        content: string;
+        category: MemoryCategory;
+        scope: 'global' | 'project';
+        layer?: string;
+        confidence?: number;
+        confidenceSource?: ConfidenceSource;
+        source?: NodeSource;
+        tags?: string[];
+        branch?: string | null;
+        directoryScope?: string | null;
+        sourceSessionId?: string | null;
+    }): MemoryNode;
+    /**
+     * Insert a memory, or reinforce the closest near-duplicate in place. This is
+     * what MemoryManager.saveEntry calls so explicit + auto-extracted saves land
+     * in the GRAPH — the source of truth getEntries()/the dashboard read from —
+     * not only the legacy v2 store. Near-identical content (>=0.92 similarity,
+     * same category) updates the existing node instead of creating a duplicate.
+     */
+    upsertNode(opts: {
+        content: string;
+        category: MemoryCategory;
+        scope: 'global' | 'project';
+        layer?: string;
+        tags?: string[];
+        branch?: string | null;
+        directoryScope?: string | null;
+        confidenceSource?: ConfidenceSource;
+        source?: NodeSource;
+    }): MemoryNode;
+    /** Update fields on an existing node. */
+    updateNode(id: string, patch: Partial<MemoryNode>): MemoryNode | null;
+    /** Archive a node (move to cold storage conceptually). */
+    archiveNode(id: string, reason: ArchiveReason): boolean;
+    /** Restore an archived node. */
+    restoreNode(id: string): boolean;
+    /** Hard-delete a node and all its edges. */
+    deleteNode(id: string): boolean;
+    /** Total active node count. */
+    get nodeCount(): number;
+    /** Get all edges. */
+    getAllEdges(): MemoryEdge[];
+    /** Get edges originating from a node. */
+    getEdgesFrom(nodeId: string, type?: EdgeType): MemoryEdge[];
+    /** Get edges pointing to a node. */
+    getEdgesTo(nodeId: string, type?: EdgeType): MemoryEdge[];
+    /** Add an edge between two nodes. */
+    addEdge(opts: {
+        fromNodeId: string;
+        toNodeId: string;
+        type: EdgeType;
+        weight?: number;
+        metadata?: Record<string, unknown>;
+    }): MemoryEdge | null;
+    /** Remove an edge by ID. */
+    removeEdge(id: string): boolean;
+    /** Get all nodes connected to a given node (any edge direction), up to depth. */
+    getConnectedNodes(nodeId: string, maxDepth?: number): MemoryNode[];
+    /** Traverse a chain of edges of a specific type starting from a node. */
+    traverseChain(startNodeId: string, edgeType: EdgeType, maxDepth?: number): MemoryNode[];
+    /** Reinforce a node's confidence (called on recall, confirmation, edge addition, etc). */
+    reinforceNode(nodeId: string, event: keyof typeof CONFIDENCE_REINFORCEMENT): void;
+    /** Calculate current confidence after decay (lazy — computed on read). */
+    getEffectiveConfidence(node: MemoryNode): number;
+    /** Apply confidence decay to all nodes. Returns count of decayed + archived. */
+    applyDecay(): {
+        decayed: number;
+        archived: number;
+    };
+    /** Graph-based recall with TF-IDF + confidence + recency + mode weighting. */
+    recall(opts: GraphRecallOptions): ScoredNode[];
+    /** Find nodes similar to the given content. Used for dedup + contradiction. */
+    findSimilar(content: string, opts?: {
+        category?: MemoryCategory;
+        minSimilarity?: number;
+        excludeIds?: Set<string>;
+    }): Array<{
+        node: MemoryNode;
+        similarity: number;
+    }>;
+    /** Check if adding this content would contradict an existing node.
+     *  Returns the contradicting node if found, null otherwise. */
+    detectContradiction(content: string, category: MemoryCategory): MemoryNode | null;
+    /** Check if content is a near-duplicate of an existing node. */
+    detectDuplicate(content: string, category: MemoryCategory): MemoryNode | null;
+    /** Run the forgetting pass. Archives nodes that meet any forgetting criteria. */
+    runForgettingPass(): {
+        archived: number;
+        reasons: Record<string, number>;
+    };
+    /** Get a hash of the current graph state (for project brain staleness check). */
+    getGraphHash(): string;
+    /** Get store stats. */
+    getStats(): {
+        activeNodes: number;
+        archivedNodes: number;
+        edges: number;
+        avgConfidence: number;
+        categories: Record<string, number>;
+    };
+    /** Get the raw store (for migration, export, etc). */
+    getRawStore(): MemoryGraphStore;
+    /** Set the raw store (for migration). */
+    setRawStore(store: MemoryGraphStore): void;
+    private ensureTfIdfIndex;
+    private rebuildTfIdfIndex;
+    private invalidateTfIdf;
+}
+//# sourceMappingURL=graph-engine.d.ts.map

package/dist/memory/graph-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-engine.d.ts","sourceRoot":"","sources":["../../src/memory/graph-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAQH,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,QAAQ,EACR,gBAAgB,EAChB,kBAAkB,EAClB,UAAU,EACV,cAAc,EAEd,gBAAgB,EAChB,aAAa,EACb,UAAU,EACX,MAAM,YAAY,CAAC;AACpB,OAAO,EAML,wBAAwB,EACzB,MAAM,YAAY,CAAC;AAuBpB,qBAAa,WAAW;IAOV,QAAQ,CAAC,OAAO,EAAE,MAAM;IANpC,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,UAAU,CAA2B;IAC7C,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAGd,OAAO,EAAE,MAAM;IAU9B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAoBrB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAa3B,4DAA4D;IACtD,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC;IAShC,2CAA2C;IAC3C,cAAc,IAAI,UAAU,EAAE;IAI9B,wCAAwC;IACxC,WAAW,IAAI,UAAU,EAAE;IAI3B,wBAAwB;IACxB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IAItC,6DAA6D;IAC7D,OAAO,CAAC,IAAI,EAAE;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,cAAc,CAAC;QACzB,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAC;QAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;QACpC,MAAM,CAAC,EAAE,UAAU,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACvB,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC/B,eAAe,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACjC,GAAG,UAAU;IAmCd;;;;;;OAMG;IACH,UAAU,CAAC,IAAI,EAAE;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,cAAc,CAAC;QACzB,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAC;QAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACvB,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC/B,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;QACpC,MAAM,CAAC,EAAE,UAAU,CAAC;KACrB,GAAG,UAAU;IAyBd,yCAAyC;IACzC,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,UAAU,GAAG,IAAI;IAWrE,0DAA0D;IAC1D,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,GAAG,OAAO;IAcvD,gCAAgC;IAChC,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAahC,4CAA4C;IAC5C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAc/B,+BAA+B;IAC/B,IAAI,SAAS,IAAI,MAAM,CAEtB;IAMD,qBAAqB;IACrB,WAAW,IAAI,UAAU,EAAE;IAI3B,yCAAyC;IACzC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,UAAU,EAAE;IAM3D,oCAAoC;IACpC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,UAAU,EAAE;IAMzD,qCAAqC;IACrC,OAAO,CAAC,IAAI,EAAE;QACZ,UAAU,EAAE,MAAM,CAAC;QACnB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,QAAQ,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,GAAG,UAAU,GAAG,IAAI;IAkCrB,4BAA4B;IAC5B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQ/B,iFAAiF;IACjF,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG,UAAU,EAAE;IA+B7D,yEAAyE;IACzE,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,SAAI,GAAG,UAAU,EAAE;IAoBlF,0FAA0F;IAC1F,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,OAAO,wBAAwB,GAAG,IAAI;IAajF,0EAA0E;IAC1E,sBAAsB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM;IAOhD,gFAAgF;IAChF,UAAU,IAAI;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IA6BnD,8EAA8E;IAC9E,MAAM,CAAC,IAAI,EAAE,kBAAkB,GAAG,UAAU,EAAE;IA2G9C,+EAA+E;IAC/E,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAClC,QAAQ,CAAC,EAAE,cAAc,CAAC;QAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;KAC1B,GAAG,KAAK,CAAC;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IA0BnD;mEAC+D;IAC/D,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,GAAG,UAAU,GAAG,IAAI;IAoBjF,gEAAgE;IAChE,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,GAAG,UAAU,GAAG,IAAI;IAY7E,iFAAiF;IACjF,iBAAiB,IAAI;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE;IA2D1E,iFAAiF;IACjF,YAAY,IAAI,MAAM;IAKtB,uBAAuB;IACvB,QAAQ,IAAI;QACV,WAAW,EAAE,MAAM,CAAC;QACpB,aAAa,EAAE,MAAM,CAAC;QACtB,KAAK,EAAE,MAAM,CAAC;QACd,aAAa,EAAE,MAAM,CAAC;QACtB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACpC;IAoBD,sDAAsD;IACtD,WAAW,IAAI,gBAAgB;IAI/B,yCAAyC;IACzC,WAAW,CAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI;IAQ1C,OAAO,CAAC,gBAAgB;IAKxB,OAAO,CAAC,iBAAiB;IAazB,OAAO,CAAC,eAAe;CAGxB"}