@openweave/weave-graph 0.2.0 → 0.2.1

package/dist/cjs/hebbian-weights.js

@@ -0,0 +1,152 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HebbianWeights = void 0;
+const DEFAULT_HEBBIAN_STRENGTH = 0.1;
+const DEFAULT_DECAY_RATE = 0.99;
+const DEFAULT_PRUNE_THRESHOLD = 0.05;
+const DEFAULT_MAX_WEIGHT = 5.0;
+// ---------------------------------------------------------------------------
+// HebbianWeights
+// ---------------------------------------------------------------------------
+/**
+ * HebbianWeights — Hebbian learning + temporal decay for graph edges.
+ *
+ * Models three neuronal behaviours:
+ *
+ * 1. **Strengthen** (`strengthen`): When two nodes are co-activated (both
+ *    appear in the same query result), every edge connecting them gains
+ *    `hebbianStrength` weight — "neurons that fire together, wire together."
+ *
+ * 2. **Decay** (`decay`): Every edge weight is multiplied by `decayRate`
+ *    each cycle. Edges not reinforced by co-activation gradually weaken.
+ *
+ * 3. **Prune** (`prune`): Edges whose weight drops below `pruneThreshold`
+ *    are deleted, keeping the graph clean and preventing stale connections
+ *    from accumulating indefinitely.
+ *
+ * @example
+ * ```ts
+ * const hebb = new HebbianWeights({ hebbianStrength: 0.1, decayRate: 0.99 });
+ * graph.setHebbianWeights(hebb);
+ *
+ * // queryNodesByLabel() auto-strengthens edges between co-activated nodes
+ * graph.queryNodesByLabel("TypeScript");
+ *
+ * // Run decay once per session cycle
+ * hebb.decay(graph);
+ *
+ * // Prune weak edges
+ * hebb.prune(graph);
+ * ```
+ */
+class HebbianWeights {
+    hebbianStrength;
+    decayRate;
+    pruneThreshold;
+    maxWeight;
+    constructor(options = {}) {
+        this.hebbianStrength = options.hebbianStrength ?? DEFAULT_HEBBIAN_STRENGTH;
+        this.decayRate = options.decayRate ?? DEFAULT_DECAY_RATE;
+        this.pruneThreshold = options.pruneThreshold ?? DEFAULT_PRUNE_THRESHOLD;
+        this.maxWeight = options.maxWeight ?? DEFAULT_MAX_WEIGHT;
+    }
+    /** Read-only view of the resolved configuration. */
+    get config() {
+        return {
+            hebbianStrength: this.hebbianStrength,
+            decayRate: this.decayRate,
+            pruneThreshold: this.pruneThreshold,
+            maxWeight: this.maxWeight,
+        };
+    }
+    // ------------------------------------------------------------------
+    // strengthen()
+    // ------------------------------------------------------------------
+    /**
+     * Strengthen a single edge by `hebbianStrength`, capped at `maxWeight`.
+     *
+     * Intended to be called for every edge that connects two nodes that were
+     * co-activated (both appeared in the same query result).
+     *
+     * @returns The updated edge, or `undefined` if the edge was not found.
+     */
+    strengthen(edgeId, graph) {
+        const edge = graph.getEdge(edgeId);
+        if (!edge)
+            return undefined;
+        const currentWeight = edge.weight ?? 1.0;
+        const newWeight = Math.min(currentWeight + this.hebbianStrength, this.maxWeight);
+        return graph.updateEdge(edgeId, { weight: newWeight });
+    }
+    /**
+     * Strengthen all edges that connect pairs of nodes within `nodeIds`.
+     *
+     * This is the batch form used by `ContextGraphManager` after a query:
+     * every edge whose `sourceId` AND `targetId` both appear in the result
+     * set gets strengthened once.
+     *
+     * @returns The list of edge ids that were strengthened.
+     */
+    strengthenCoActivated(nodeIds, graph) {
+        if (nodeIds.length < 2)
+            return [];
+        const nodeSet = new Set(nodeIds);
+        const strengthened = [];
+        for (const edge of graph.getAllEdges()) {
+            if (nodeSet.has(edge.sourceId) && nodeSet.has(edge.targetId)) {
+                this.strengthen(edge.id, graph);
+                strengthened.push(edge.id);
+            }
+        }
+        return strengthened;
+    }
+    // ------------------------------------------------------------------
+    // decay()
+    // ------------------------------------------------------------------
+    /**
+     * Apply temporal decay to every edge in the graph.
+     *
+     * Each edge weight is multiplied by `decayRate` (< 1.0).
+     * Edges reinforced by recent co-activation decay slower relative
+     * to their higher baseline weight.
+     *
+     * @returns The number of edges decayed.
+     */
+    decay(graph) {
+        const allEdges = graph.getAllEdges();
+        let count = 0;
+        for (const edge of allEdges) {
+            const current = edge.weight ?? 1.0;
+            const decayed = current * this.decayRate;
+            graph.updateEdge(edge.id, { weight: decayed });
+            count++;
+        }
+        return count;
+    }
+    // ------------------------------------------------------------------
+    // prune()
+    // ------------------------------------------------------------------
+    /**
+     * Delete all edges whose weight has fallen below `pruneThreshold`.
+     *
+     * Can be called after `decay()` to clean up stale connections.
+     *
+     * @param minWeight Override the instance's `pruneThreshold` for this call.
+     * @returns The number of edges deleted.
+     */
+    prune(graph, minWeight) {
+        const threshold = minWeight ?? this.pruneThreshold;
+        const toDelete = [];
+        for (const edge of graph.getAllEdges()) {
+            if ((edge.weight ?? 1.0) < threshold) {
+                toDelete.push(edge.id);
+            }
+        }
+        for (const id of toDelete) {
+            graph.deleteEdge(id);
+        }
+        return toDelete.length;
+    }
+}
+exports.HebbianWeights = HebbianWeights;
+//# sourceMappingURL=hebbian-weights.js.map

package/dist/cjs/hebbian-weights.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hebbian-weights.js","sourceRoot":"","sources":["../../src/hebbian-weights.ts"],"names":[],"mappings":";;;AAiBA,MAAM,wBAAwB,GAAG,GAAG,CAAC;AACrC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAChC,MAAM,uBAAuB,GAAG,IAAI,CAAC;AACrC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAiB/B,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAa,cAAc;IACR,eAAe,CAAS;IACxB,SAAS,CAAS;IAClB,cAAc,CAAS;IACvB,SAAS,CAAS;IAEnC,YAAY,UAA0B,EAAE;QACtC,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,wBAAwB,CAAC;QAC3E,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;QACxE,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC;IAC3D,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM;QACR,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,eAAe;IACf,qEAAqE;IAErE;;;;;;;OAOG;IACH,UAAU,CAAC,MAAc,EAAE,KAAmB;QAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAE5B,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAEjF,OAAO,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;;;OAQG;IACH,qBAAqB,CAAC,OAAiB,EAAE,KAAmB;QAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACvC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAChC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,qEAAqE;IACrE,UAAU;IACV,qEAAqE;IAErE;;;;;;;;OAQG;IACH,KAAK,CAAC,KAAmB;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC;YACnC,MAAM,OAAO,GAAG,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;YACzC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;YAC/C,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,UAAU;IACV,qEAAqE;IAErE;;;;;;;OAOG;IACH,KAAK,CAAC,KAAmB,EAAE,SAAkB;QAC3C,MAAM,SAAS,GAAG,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC;QACnD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC;gBACrC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,QAAQ,CAAC,MAAM,CAAC;IACzB,CAAC;CACF;AA7HD,wCA6HC"}

package/dist/cjs/index.d.ts

@@ -0,0 +1,193 @@
+import { Node, Edge, NodeType, EdgeType, GraphSnapshot } from "./types";
+import { SynapticEngine } from "./synaptic-engine";
+import { HebbianWeights } from "./hebbian-weights";
+/**
+ * ContextGraphManager
+ * Main interface for managing the WeaveGraph
+ * Handles node/edge operations, queries, and persistence metadata
+ */
+export declare class ContextGraphManager {
+    private nodes;
+    private edges;
+    private edgesBySource;
+    private edgesByTarget;
+    private nodesByLabel;
+    private chatId;
+    private compressionThreshold;
+    private version;
+    private createdAt;
+    private updatedAt;
+    private synapticEngine?;
+    private hebbianWeights?;
+    constructor(chatId: string, compressionThreshold?: number);
+    /**
+     * Attach a SynapticEngine to this graph. Once set, every subsequent
+     * `addNode()` call will automatically trigger retroactive linking.
+     */
+    setSynapticEngine(engine: SynapticEngine): void;
+    /**
+     * Attach a HebbianWeights instance to this graph. Once set,
+     * `queryNodesByLabel()` and `queryNodesByType()` will automatically
+     * strengthen edges between co-activated result nodes.
+     */
+    setHebbianWeights(hw: HebbianWeights): void;
+    /**
+     * Add a node to the graph.
+     * If a SynapticEngine is attached, retroactive linking is performed
+     * immediately after the node is indexed.
+     */
+    addNode(node: Node): Node;
+    /**
+     * Add a node to the graph and run embedding-based retroactive linking
+     * (async). If the attached SynapticEngine has an `embeddingService`,
+     * cosine similarity is used instead of Jaccard keyword overlap.
+     *
+     * If no SynapticEngine is attached, behaves identically to `addNode()`.
+     * If a SynapticEngine is attached but has no embedding service, the
+     * keyword-based path runs (same as `addNode()`).
+     *
+     * @returns The added node.
+     */
+    addNodeAsync(node: Node): Promise<Node>;
+    /**
+     * Get a node by ID
+     */
+    getNode(nodeId: string): Node | undefined;
+    /**
+     * Update an existing node
+     */
+    updateNode(nodeId: string, updates: Partial<Node>): Node | undefined;
+    /**
+     * Delete a node (and all related edges)
+     */
+    deleteNode(nodeId: string): boolean;
+    /**
+     * Add an edge to the graph
+     */
+    addEdge(edge: Edge): Edge;
+    /**
+     * Get an edge by ID
+     */
+    getEdge(edgeId: string): Edge | undefined;
+    /**
+     * Update an existing edge
+     */
+    updateEdge(edgeId: string, updates: Partial<Edge>): Edge | undefined;
+    /**
+     * Delete an edge
+     */
+    deleteEdge(edgeId: string): boolean;
+    /**
+     * Get all edges from a source node
+     */
+    getEdgesFromNode(nodeId: string): Edge[];
+    /**
+     * Get all edges to a target node
+     */
+    getEdgesToNode(nodeId: string): Edge[];
+    /**
+     * Query nodes by label (keyword search)
+     * Returns nodes where the label contains the query string
+     */
+    queryNodesByLabel(query: string): Node[];
+    /**
+     * Query nodes by type
+     */
+    queryNodesByType(type: NodeType): Node[];
+    /**
+     * Query edges by type
+     */
+    queryEdgesByType(type: EdgeType): Edge[];
+    /**
+     * Get graph statistics
+     */
+    getStats(): {
+        totalNodes: number;
+        totalEdges: number;
+        nodesByType: {
+            [k: string]: number;
+        };
+        edgesByType: {
+            [k: string]: number;
+        };
+        chatId: string;
+        createdAt: Date;
+        updatedAt: Date;
+    };
+    /**
+     * Snapshot the graph for serialization
+     */
+    snapshot(): GraphSnapshot;
+    /**
+     * Restore graph from snapshot
+     */
+    static fromSnapshot(snapshot: GraphSnapshot): ContextGraphManager;
+    /**
+     * Get the current window size percentage
+     * Calculates actual context window usage based on node and edge sizes
+     */
+    getContextWindowUsage(): number;
+    /**
+     * Get estimated context size in bytes
+     */
+    getContextSize(): number;
+    /**
+     * Check if compression threshold has been reached
+     */
+    shouldCompress(): boolean;
+    /**
+     * Compress the graph by archiving low-frequency nodes
+     * Returns compression statistics
+     */
+    compress(targetReductionPercentage?: number): {
+        archivedNodeCount: number;
+        archiveStats: {
+            archivedNodeCount: number;
+            archivedEdgeCount: number;
+        };
+        newContextSize: number;
+        contextUsagePercentage: number;
+    };
+    /**
+     * Suppress an error node and create a correction
+     */
+    suppressError(errorNodeId: string, correctionLabel: string, correctionDescription?: string): {
+        correctionNode: Node;
+        correctionEdge: Edge;
+    };
+    /**
+     * Get all error nodes that have been corrected
+     */
+    getCorrectedErrors(): Map<string, {
+        error: Node;
+        corrections: Node[];
+    }>;
+    /**
+     * Get all error nodes that haven't been corrected yet
+     */
+    getUncorrectedErrors(): Node[];
+    /**
+     * Get all nodes
+     */
+    getAllNodes(): Node[];
+    /**
+     * Get all edges
+     */
+    getAllEdges(): Edge[];
+    /**
+     * Clear the entire graph
+     */
+    clear(): void;
+}
+export type { Node, Edge, GraphSnapshot, QueryResult } from "./types";
+export { NodeType, EdgeType } from "./types";
+export { PersistenceManager } from "./persistence";
+export { NodeBuilder } from "./node";
+export { EdgeBuilder } from "./edge";
+export { CompressionManager, ErrorSuppression } from "./compression";
+export type { CompressionStats } from "./compression";
+export { SynapticEngine, tokenize, jaccardSimilarity, cosineSimilarity } from "./synaptic-engine";
+export type { SynapticOptions, SynapticGraph, SynapticEmbeddingService } from "./synaptic-engine";
+export { HebbianWeights } from "./hebbian-weights";
+export type { HebbianOptions, HebbianGraph } from "./hebbian-weights";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAIxE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;;;GAIG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,KAAK,CAAoB;IACjC,OAAO,CAAC,KAAK,CAAoB;IACjC,OAAO,CAAC,aAAa,CAA2B;IAChD,OAAO,CAAC,aAAa,CAA2B;IAChD,OAAO,CAAC,YAAY,CAA2B;IAC/C,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,oBAAoB,CAAgB;IAC5C,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,SAAS,CAAO;IACxB,OAAO,CAAC,SAAS,CAAO;IACxB,OAAO,CAAC,cAAc,CAAC,CAAiB;IACxC,OAAO,CAAC,cAAc,CAAC,CAAiB;gBAE5B,MAAM,EAAE,MAAM,EAAE,oBAAoB,CAAC,EAAE,MAAM;IAczD;;;OAGG;IACH,iBAAiB,CAAC,MAAM,EAAE,cAAc,GAAG,IAAI;IAI/C;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,EAAE,cAAc,GAAG,IAAI;IAI3C;;;;OAIG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAoBzB;;;;;;;;;;OAUG;IACG,YAAY,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAoB7C;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIzC;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,SAAS;IAUpE;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IA8BnC;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAkBzB;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIzC;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,SAAS;IAUpE;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAYnC;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE;IAOxC;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE;IAOtC;;;OAGG;IACH,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE;IA0BxC;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,EAAE;IAcxC;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,EAAE;IAIxC;;OAEG;IACH,QAAQ;;;;;;;;;;;;;IAuBR;;OAEG;IACH,QAAQ,IAAI,aAAa;IAczB;;OAEG;IACH,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,aAAa,GAAG,mBAAmB;IAoBjE;;;OAGG;IACH,qBAAqB,IAAI,MAAM;IAQ/B;;OAEG;IACH,cAAc,IAAI,MAAM;IAOxB;;OAEG;IACH,cAAc,IAAI,OAAO;IAIzB;;;OAGG;IACH,QAAQ,CAAC,yBAAyB,GAAE,MAAY;;;;;;;;;IAuBhD;;OAEG;IACH,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,qBAAqB,CAAC,EAAE,MAAM;;;;IAuB1F;;OAEG;IACH,kBAAkB;;;;IAIlB;;OAEG;IACH,oBAAoB,IAAI,IAAI,EAAE;IAI9B;;OAEG;IACH,WAAW,IAAI,IAAI,EAAE;IAIrB;;OAEG;IACH,WAAW,IAAI,IAAI,EAAE;IAIrB;;OAEG;IACH,KAAK,IAAI,IAAI;CAQd;AAGD,YAAY,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AACtE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACrE,YAAY,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAClG,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,mBAAmB,CAAC;AAClG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}