@openweave/weave-graph 0.2.0 → 0.2.1

package/dist/cjs/persistence.js

@@ -0,0 +1,215 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PersistenceManager = void 0;
+const weave_provider_1 = require("@openweave/weave-provider");
+const index_1 = require("./index");
+/**
+ * PersistenceManager
+ *
+ * Handles saving and loading graph snapshots through a pluggable
+ * IWeaveProvider. If no provider is injected, it falls back to the
+ * built-in JsonProvider (same behaviour as before, backward-compatible).
+ *
+ * Key convention: `graph:<chatId>` — namespaced so multiple subsystems can
+ * share a single provider without key collisions.
+ */
+class PersistenceManager {
+    /** Kept for backward-compat (`getDataDir` / `setDataDir` / constructor). */
+    dataDir;
+    provider;
+    /**
+     * @param dataDir  Root directory used by the default JsonProvider.
+     *                 Ignored when an explicit `provider` is supplied.
+     * @param provider Optional storage provider. Defaults to `JsonProvider(dataDir)`.
+     */
+    constructor(dataDir = "./weave-data", provider) {
+        this.dataDir = dataDir;
+        this.provider = provider ?? new weave_provider_1.JsonProvider(dataDir);
+    }
+    // ── Key helpers ───────────────────────────────────────────────────────────
+    graphKey(chatId) {
+        return `graph:${chatId}`;
+    }
+    /**
+     * Serialize a GraphSnapshot to a plain object (dates → ISO strings).
+     */
+    serialize(snapshot) {
+        return {
+            ...snapshot,
+            metadata: {
+                ...snapshot.metadata,
+                createdAt: snapshot.metadata.createdAt.toISOString(),
+                updatedAt: snapshot.metadata.updatedAt.toISOString(),
+            },
+            nodes: Object.fromEntries(Object.entries(snapshot.nodes).map(([id, node]) => [
+                id,
+                {
+                    ...node,
+                    createdAt: node.createdAt.toISOString(),
+                    updatedAt: node.updatedAt.toISOString(),
+                },
+            ])),
+            edges: Object.fromEntries(Object.entries(snapshot.edges).map(([id, edge]) => [
+                id,
+                {
+                    ...edge,
+                    createdAt: edge.createdAt.toISOString(),
+                    updatedAt: edge.updatedAt.toISOString(),
+                },
+            ])),
+        };
+    }
+    /**
+     * Deserialize a plain object back to a GraphSnapshot (ISO strings → dates).
+     */
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    deserialize(parsed) {
+        return {
+            ...parsed,
+            metadata: {
+                ...parsed.metadata,
+                createdAt: new Date(parsed.metadata.createdAt),
+                updatedAt: new Date(parsed.metadata.updatedAt),
+            },
+            nodes: Object.fromEntries(
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            Object.entries(parsed.nodes).map(([id, node]) => [
+                id,
+                { ...node, createdAt: new Date(node.createdAt), updatedAt: new Date(node.updatedAt) },
+            ])),
+            edges: Object.fromEntries(
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            Object.entries(parsed.edges).map(([id, edge]) => [
+                id,
+                { ...edge, createdAt: new Date(edge.createdAt), updatedAt: new Date(edge.updatedAt) },
+            ])),
+        };
+    }
+    // ── Public API ────────────────────────────────────────────────────────────
+    /**
+     * Ensure the data directory exists.
+     * Delegates to the OS mkdir so callers that relied on the old
+     * PersistenceManager behaviour continue to work unchanged.
+     */
+    async ensureDataDir() {
+        const { promises: fsp } = await Promise.resolve().then(() => __importStar(require('fs')));
+        await fsp.mkdir(this.dataDir, { recursive: true });
+    }
+    /**
+     * Save a graph snapshot via the configured provider.
+     */
+    async saveGraph(snapshot) {
+        await this.provider.set(this.graphKey(snapshot.metadata.chatId), this.serialize(snapshot));
+    }
+    /**
+     * Load a graph snapshot from the configured provider.
+     * Returns `null` if the snapshot does not exist.
+     */
+    async loadGraph(chatId) {
+        const raw = await this.provider.get(this.graphKey(chatId));
+        if (raw === null)
+            return null;
+        return this.deserialize(raw);
+    }
+    /**
+     * Load or create a graph manager for a chat session.
+     */
+    async loadOrCreateGraph(chatId, compressionThreshold) {
+        const snapshot = await this.loadGraph(chatId);
+        if (snapshot)
+            return index_1.ContextGraphManager.fromSnapshot(snapshot);
+        return new index_1.ContextGraphManager(chatId, compressionThreshold);
+    }
+    /**
+     * Check whether a graph exists in the provider.
+     */
+    async graphExists(chatId) {
+        return (await this.provider.get(this.graphKey(chatId))) !== null;
+    }
+    /**
+     * Delete a graph from the provider. No-op if it does not exist.
+     */
+    async deleteGraph(chatId) {
+        await this.provider.delete(this.graphKey(chatId));
+    }
+    /**
+     * List all saved chat sessions by querying the `graph:` namespace.
+     */
+    async listSessions() {
+        const keys = await this.provider.list("graph:");
+        const sessions = await Promise.all(keys.map(async (key) => {
+            const chatId = key.replace(/^graph:/, "");
+            const snapshot = await this.loadGraph(chatId);
+            if (!snapshot)
+                return null;
+            return {
+                chatId,
+                createdAt: snapshot.metadata.createdAt,
+                updatedAt: snapshot.metadata.updatedAt,
+                nodeCount: Object.keys(snapshot.nodes).length,
+                edgeCount: Object.keys(snapshot.edges).length,
+            };
+        }));
+        return sessions.filter((s) => s !== null);
+    }
+    /**
+     * Swap in a different provider at runtime (e.g. after migration).
+     */
+    setProvider(provider) {
+        this.provider = provider;
+    }
+    /** Returns the active provider (useful for tests / diagnostics). */
+    getProvider() {
+        return this.provider;
+    }
+    /**
+     * Change the data directory used by the default JsonProvider.
+     * Has no effect when an external provider was injected.
+     */
+    setDataDir(newDataDir) {
+        this.dataDir = newDataDir;
+        // Re-create the default provider so the new path takes effect
+        if (!(this.provider instanceof weave_provider_1.JsonProvider))
+            return;
+        this.provider = new weave_provider_1.JsonProvider(newDataDir);
+    }
+    /** Returns the configured data directory. */
+    getDataDir() {
+        return this.dataDir;
+    }
+}
+exports.PersistenceManager = PersistenceManager;
+//# sourceMappingURL=persistence.js.map

package/dist/cjs/persistence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"persistence.js","sourceRoot":"","sources":["../../src/persistence.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,8DAAyE;AACzE,mCAA8C;AAM9C;;;;;;;;;GASG;AACH,MAAa,kBAAkB;IAC7B,4EAA4E;IACpE,OAAO,CAAS;IAChB,QAAQ,CAAqC;IAErD;;;;OAIG;IACH,YACE,UAAkB,cAAc,EAChC,QAA6C;QAE7C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,6BAAY,CAAqB,OAAO,CAAC,CAAC;IAC5E,CAAC;IAED,6EAA6E;IAErE,QAAQ,CAAC,MAAc;QAC7B,OAAO,SAAS,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,QAAuB;QACvC,OAAO;YACL,GAAG,QAAQ;YACX,QAAQ,EAAE;gBACR,GAAG,QAAQ,CAAC,QAAQ;gBACpB,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE;gBACpD,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE;aACrD;YACD,KAAK,EAAE,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;gBACjD,EAAE;gBACF;oBACE,GAAG,IAAI;oBACP,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE;oBACvC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE;iBACxC;aACF,CAAC,CACH;YACD,KAAK,EAAE,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;gBACjD,EAAE;gBACF;oBACE,GAAG,IAAI;oBACP,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE;oBACvC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE;iBACxC;aACF,CAAC,CACH;SACoB,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,8DAA8D;IACtD,WAAW,CAAC,MAAW;QAC7B,OAAO;YACL,GAAG,MAAM;YACT,QAAQ,EAAE;gBACR,GAAG,MAAM,CAAC,QAAQ;gBAClB,SAAS,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;gBAC9C,SAAS,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;aAC/C;YACD,KAAK,EAAE,MAAM,CAAC,WAAW;YACvB,8DAA8D;YAC9D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAgB,EAAE,EAAE,CAAC;gBAC9D,EAAE;gBACF,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;aACtF,CAAC,CACH;YACD,KAAK,EAAE,MAAM,CAAC,WAAW;YACvB,8DAA8D;YAC9D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAgB,EAAE,EAAE,CAAC;gBAC9D,EAAE;gBACF,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;aACtF,CAAC,CACH;SACF,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E;;;;OAIG;IACH,KAAK,CAAC,aAAa;QACjB,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,wDAAa,IAAI,GAAC,CAAC;QAC7C,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,QAAuB;QACrC,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7F,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,MAAc;QAC5B,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC9B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CACrB,MAAc,EACd,oBAA6B;QAE7B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,QAAQ;YAAE,OAAO,2BAAmB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAChE,OAAO,IAAI,2BAAmB,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,OAAO,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;IACnE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY;QAShB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,GAAG,CAChC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO;gBACL,MAAM;gBACN,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS;gBACtC,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS;gBACtC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM;gBAC7C,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM;aAC9C,CAAC;QACJ,CAAC,CAAC,CACH,CAAC;QACF,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IACxE,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAA4C;QACtD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,oEAAoE;IACpE,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,UAAkB;QAC3B,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC;QAC1B,8DAA8D;QAC9D,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,YAAY,6BAAY,CAAC;YAAE,OAAO;QACrD,IAAI,CAAC,QAAQ,GAAG,IAAI,6BAAY,CAAqB,UAAU,CAAC,CAAC;IACnE,CAAC;IAED,6CAA6C;IAC7C,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF;AAvMD,gDAuMC"}

package/dist/cjs/synaptic-engine.d.ts

@@ -0,0 +1,126 @@
+import { Edge, Node } from "./types.js";
+/**
+ * Minimal duck-typed interface for an embedding service.
+ * `EmbeddingService` from `@openweave/weave-embed` satisfies this interface
+ * directly — no import required, keeping weave-graph free of extra deps.
+ */
+export interface SynapticEmbeddingService {
+    /** Embed a single text string. Returns an object with an `embedding` vector. */
+    embed(text: string): Promise<{
+        embedding: number[];
+    }>;
+}
+export interface SynapticOptions {
+    /** Minimum similarity required to create a retroactive edge. Default: 0.72 */
+    threshold?: number;
+    /** Maximum number of retroactive edges created per new node. Default: 20 */
+    maxConnections?: number;
+    /**
+     * Optional embedding service for semantic (cosine) retroactive linking.
+     * When provided, `linkRetroactivelyEmbedding()` uses cosine similarity
+     * instead of Jaccard keyword overlap — enabling cross-vocabulary matching.
+     */
+    embeddingService?: SynapticEmbeddingService;
+}
+/**
+ * Minimal structural interface that ContextGraphManager satisfies.
+ * SynapticEngine only needs these two methods — no import of the full class.
+ */
+export interface SynapticGraph {
+    getAllNodes(): Node[];
+    addEdge(edge: Edge): Edge;
+}
+/**
+ * Tokenize a text string into a normalised set of meaningful tokens.
+ *
+ * - Splits camelCase / PascalCase boundaries before lowercasing
+ * - Splits on whitespace and common punctuation
+ * - Filters tokens shorter than 2 chars
+ * - Removes stop-words
+ *
+ * @example
+ * tokenize("TypeScript generics") → Set { "typescript", "generics" }
+ * tokenize("useContextManager")   → Set { "context", "manager" }
+ */
+export declare function tokenize(text: string): Set<string>;
+/**
+ * Jaccard similarity coefficient between two token sets.
+ * Returns 0 when both sets are empty.
+ *
+ * J(A,B) = |A ∩ B| / |A ∪ B|
+ */
+export declare function jaccardSimilarity(a: Set<string>, b: Set<string>): number;
+/**
+ * Cosine similarity between two dense embedding vectors.
+ * Returns a value in [−1, 1]. Returns 0 when either vector has zero magnitude.
+ *
+ * cos(θ) = (A · B) / (|A| × |B|)
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * SynapticEngine — retroactive keyword-based linking between nodes.
+ *
+ * When a new node enters the graph, `linkRetroactively()` scans **all**
+ * existing nodes — regardless of when they were created — and creates
+ * RELATES edges wherever the Jaccard similarity between tokenised
+ * labels/descriptions meets the configured threshold.
+ *
+ * This gives WeaveGraph its neuronal behaviour: new concepts automatically
+ * form connections with historically relevant knowledge.
+ *
+ * Produced edges carry `metadata.synapse = true` so callers can distinguish
+ * auto-generated synaptic edges from manually created ones.
+ *
+ * @example
+ * ```ts
+ * const engine = new SynapticEngine({ threshold: 0.72, maxConnections: 20 });
+ *
+ * // Inject into ContextGraphManager
+ * graph.setSynapticEngine(engine);
+ *
+ * // From now on, every addNode() triggers retroactive linking automatically
+ * graph.addNode(NodeBuilder.concept("TypeScript generics"));
+ * ```
+ */
+export declare class SynapticEngine {
+    private readonly threshold;
+    private readonly maxConnections;
+    private readonly embeddingService?;
+    constructor(options?: SynapticOptions);
+    /** Read-only view of the resolved configuration. */
+    get config(): Required<Omit<SynapticOptions, "embeddingService">> & {
+        hasEmbeddings: boolean;
+    };
+    /** Whether an embedding service is configured. */
+    get hasEmbeddingService(): boolean;
+    /**
+     * Scan all existing nodes in `graph` and create RELATES edges to `newNode`
+     * wherever the Jaccard similarity between their tokenised text meets the
+     * threshold. At most `maxConnections` edges are created, selecting the
+     * highest-similarity candidates first.
+     *
+     * The new node itself **must already exist** in the graph before calling
+     * this method (so that `addEdge` can reference a valid node id).
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    linkRetroactively(newNode: Node, graph: SynapticGraph): Edge[];
+    /**
+     * Embedding-based retroactive linking (async).
+     *
+     * Requires an `embeddingService` to have been provided at construction time.
+     * If none is configured, falls back to keyword-based Jaccard similarity
+     * (identical to `linkRetroactively()`).
+     *
+     * Produced edges carry:
+     * - `metadata.synapse: true`
+     * - `metadata.similarity: number` — cosine similarity score
+     * - `metadata.mode: "embedding"` (or `"keyword"` on fallback)
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    linkRetroactivelyEmbedding(newNode: Node, graph: SynapticGraph): Promise<Edge[]>;
+    /** Combine label + description into a single text fingerprint for a node. */
+    private _nodeText;
+}
+//# sourceMappingURL=synaptic-engine.d.ts.map

package/dist/cjs/synaptic-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"synaptic-engine.d.ts","sourceRoot":"","sources":["../../src/synaptic-engine.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAOxC;;;;GAIG;AACH,MAAM,WAAW,wBAAwB;IACvC,gFAAgF;IAChF,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;CACvD;AAED,MAAM,WAAW,eAAe;IAC9B,8EAA8E;IAC9E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,4EAA4E;IAC5E,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,wBAAwB,CAAC;CAC7C;AAuBD;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,WAAW,IAAI,IAAI,EAAE,CAAC;IACtB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;CAC3B;AAMD;;;;;;;;;;;GAWG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAYlD;AAMD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAQxE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYjE;AAMD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IACxC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAA2B;gBAEjD,OAAO,GAAE,eAAoB;IAMzC,oDAAoD;IACpD,IAAI,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,eAAe,EAAE,kBAAkB,CAAC,CAAC,GAAG;QAAE,aAAa,EAAE,OAAO,CAAA;KAAE,CAM7F;IAED,kDAAkD;IAClD,IAAI,mBAAmB,IAAI,OAAO,CAEjC;IAED;;;;;;;;;;OAUG;IACH,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,GAAG,IAAI,EAAE;IAoC9D;;;;;;;;;;;;;OAaG;IACG,0BAA0B,CAC9B,OAAO,EAAE,IAAI,EACb,KAAK,EAAE,aAAa,GACnB,OAAO,CAAC,IAAI,EAAE,CAAC;IAkDlB,6EAA6E;IAC7E,OAAO,CAAC,SAAS;CAGlB"}

package/dist/cjs/synaptic-engine.js

@@ -0,0 +1,243 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SynapticEngine = void 0;
+exports.tokenize = tokenize;
+exports.jaccardSimilarity = jaccardSimilarity;
+exports.cosineSimilarity = cosineSimilarity;
+const edge_js_1 = require("./edge.js");
+const DEFAULT_THRESHOLD = 0.72;
+const DEFAULT_MAX_CONNECTIONS = 20;
+// ---------------------------------------------------------------------------
+// Stop-words (excluded from tokenization)
+// ---------------------------------------------------------------------------
+const STOP_WORDS = new Set([
+    "a", "an", "the", "is", "are", "was", "were", "be", "been", "being",
+    "have", "has", "had", "do", "does", "did", "will", "would", "could",
+    "should", "may", "might", "shall", "can", "need", "dare", "ought",
+    "for", "and", "nor", "but", "or", "yet", "so", "in", "on", "at",
+    "to", "of", "by", "up", "as", "if", "it", "its", "with", "this",
+    "that", "from", "not", "no", "vs", "via", "than", "then", "use",
+    "using", "used",
+]);
+// ---------------------------------------------------------------------------
+// Tokenizer
+// ---------------------------------------------------------------------------
+/**
+ * Tokenize a text string into a normalised set of meaningful tokens.
+ *
+ * - Splits camelCase / PascalCase boundaries before lowercasing
+ * - Splits on whitespace and common punctuation
+ * - Filters tokens shorter than 2 chars
+ * - Removes stop-words
+ *
+ * @example
+ * tokenize("TypeScript generics") → Set { "typescript", "generics" }
+ * tokenize("useContextManager")   → Set { "context", "manager" }
+ */
+function tokenize(text) {
+    // Split camelCase: "useContext" → "use Context"
+    const expanded = text
+        .replace(/([a-z])([A-Z])/g, "$1 $2")
+        .replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2");
+    const tokens = expanded
+        .toLowerCase()
+        .split(/[\s\-_/\\.,;:()[\]{}'"!?@#$%^&*+=<>|~`]+/)
+        .filter((t) => t.length >= 2 && !STOP_WORDS.has(t));
+    return new Set(tokens);
+}
+// ---------------------------------------------------------------------------
+// Similarity
+// ---------------------------------------------------------------------------
+/**
+ * Jaccard similarity coefficient between two token sets.
+ * Returns 0 when both sets are empty.
+ *
+ * J(A,B) = |A ∩ B| / |A ∪ B|
+ */
+function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let intersectionSize = 0;
+    for (const token of a) {
+        if (b.has(token))
+            intersectionSize++;
+    }
+    const unionSize = a.size + b.size - intersectionSize;
+    return intersectionSize / unionSize;
+}
+/**
+ * Cosine similarity between two dense embedding vectors.
+ * Returns a value in [−1, 1]. Returns 0 when either vector has zero magnitude.
+ *
+ * cos(θ) = (A · B) / (|A| × |B|)
+ */
+function cosineSimilarity(a, b) {
+    if (a.length === 0 || b.length === 0)
+        return 0;
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    return denom === 0 ? 0 : dot / denom;
+}
+// ---------------------------------------------------------------------------
+// SynapticEngine
+// ---------------------------------------------------------------------------
+/**
+ * SynapticEngine — retroactive keyword-based linking between nodes.
+ *
+ * When a new node enters the graph, `linkRetroactively()` scans **all**
+ * existing nodes — regardless of when they were created — and creates
+ * RELATES edges wherever the Jaccard similarity between tokenised
+ * labels/descriptions meets the configured threshold.
+ *
+ * This gives WeaveGraph its neuronal behaviour: new concepts automatically
+ * form connections with historically relevant knowledge.
+ *
+ * Produced edges carry `metadata.synapse = true` so callers can distinguish
+ * auto-generated synaptic edges from manually created ones.
+ *
+ * @example
+ * ```ts
+ * const engine = new SynapticEngine({ threshold: 0.72, maxConnections: 20 });
+ *
+ * // Inject into ContextGraphManager
+ * graph.setSynapticEngine(engine);
+ *
+ * // From now on, every addNode() triggers retroactive linking automatically
+ * graph.addNode(NodeBuilder.concept("TypeScript generics"));
+ * ```
+ */
+class SynapticEngine {
+    threshold;
+    maxConnections;
+    embeddingService;
+    constructor(options = {}) {
+        this.threshold = options.threshold ?? DEFAULT_THRESHOLD;
+        this.maxConnections = options.maxConnections ?? DEFAULT_MAX_CONNECTIONS;
+        this.embeddingService = options.embeddingService;
+    }
+    /** Read-only view of the resolved configuration. */
+    get config() {
+        return {
+            threshold: this.threshold,
+            maxConnections: this.maxConnections,
+            hasEmbeddings: this.embeddingService !== undefined,
+        };
+    }
+    /** Whether an embedding service is configured. */
+    get hasEmbeddingService() {
+        return this.embeddingService !== undefined;
+    }
+    /**
+     * Scan all existing nodes in `graph` and create RELATES edges to `newNode`
+     * wherever the Jaccard similarity between their tokenised text meets the
+     * threshold. At most `maxConnections` edges are created, selecting the
+     * highest-similarity candidates first.
+     *
+     * The new node itself **must already exist** in the graph before calling
+     * this method (so that `addEdge` can reference a valid node id).
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    linkRetroactively(newNode, graph) {
+        const existing = graph.getAllNodes().filter((n) => n.id !== newNode.id);
+        if (existing.length === 0)
+            return [];
+        const newTokens = tokenize(this._nodeText(newNode));
+        if (newTokens.size === 0)
+            return [];
+        // Score every existing node
+        const candidates = [];
+        for (const node of existing) {
+            const tokens = tokenize(this._nodeText(node));
+            const score = jaccardSimilarity(newTokens, tokens);
+            if (score >= this.threshold) {
+                candidates.push({ node, score });
+            }
+        }
+        // Select top-maxConnections by descending similarity
+        candidates.sort((a, b) => b.score - a.score);
+        const selected = candidates.slice(0, this.maxConnections);
+        const created = [];
+        for (const { node, score } of selected) {
+            const base = edge_js_1.EdgeBuilder.relates(newNode.id, node.id, score);
+            const synapticEdge = {
+                ...base,
+                weight: score,
+                metadata: { synapse: true, similarity: score, mode: "keyword" },
+            };
+            graph.addEdge(synapticEdge);
+            created.push(synapticEdge);
+        }
+        return created;
+    }
+    /**
+     * Embedding-based retroactive linking (async).
+     *
+     * Requires an `embeddingService` to have been provided at construction time.
+     * If none is configured, falls back to keyword-based Jaccard similarity
+     * (identical to `linkRetroactively()`).
+     *
+     * Produced edges carry:
+     * - `metadata.synapse: true`
+     * - `metadata.similarity: number` — cosine similarity score
+     * - `metadata.mode: "embedding"` (or `"keyword"` on fallback)
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    async linkRetroactivelyEmbedding(newNode, graph) {
+        // No embedding service — fall back to keyword path
+        if (!this.embeddingService) {
+            return this.linkRetroactively(newNode, graph);
+        }
+        const existing = graph.getAllNodes().filter((n) => n.id !== newNode.id);
+        if (existing.length === 0)
+            return [];
+        const newText = this._nodeText(newNode);
+        if (newText.trim().length === 0)
+            return [];
+        // Embed new node + all existing nodes concurrently
+        const [newEmbed, ...existingEmbeds] = await Promise.all([
+            this.embeddingService.embed(newText),
+            ...existing.map((n) => this.embeddingService.embed(this._nodeText(n))),
+        ]);
+        // Score every existing node via cosine similarity
+        const candidates = [];
+        for (let i = 0; i < existing.length; i++) {
+            const score = cosineSimilarity(newEmbed.embedding, existingEmbeds[i].embedding);
+            if (score >= this.threshold) {
+                candidates.push({ node: existing[i], score });
+            }
+        }
+        // Select top-maxConnections by descending similarity
+        candidates.sort((a, b) => b.score - a.score);
+        const selected = candidates.slice(0, this.maxConnections);
+        const created = [];
+        for (const { node, score } of selected) {
+            const base = edge_js_1.EdgeBuilder.relates(newNode.id, node.id, score);
+            const synapticEdge = {
+                ...base,
+                weight: score,
+                metadata: { synapse: true, similarity: score, mode: "embedding" },
+            };
+            graph.addEdge(synapticEdge);
+            created.push(synapticEdge);
+        }
+        return created;
+    }
+    // ------------------------------------------------------------------
+    // Private helpers
+    // ------------------------------------------------------------------
+    /** Combine label + description into a single text fingerprint for a node. */
+    _nodeText(node) {
+        return [node.label, node.description ?? ""].join(" ").trim();
+    }
+}
+exports.SynapticEngine = SynapticEngine;
+//# sourceMappingURL=synaptic-engine.js.map

package/dist/cjs/synaptic-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"synaptic-engine.js","sourceRoot":"","sources":["../../src/synaptic-engine.ts"],"names":[],"mappings":";;;AA4EA,4BAYC;AAYD,8CAQC;AAQD,4CAYC;AA/HD,uCAAwC;AA6BxC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,8EAA8E;AAC9E,0CAA0C;AAC1C,8EAA8E;AAE9E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IAC/D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAC/D,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;IAC/D,OAAO,EAAE,MAAM;CAChB,CAAC,CAAC;AAeH,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAgB,QAAQ,CAAC,IAAY;IACnC,gDAAgD;IAChD,MAAM,QAAQ,GAAG,IAAI;SAClB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,QAAQ;SACpB,WAAW,EAAE;SACb,KAAK,CAAC,0CAA0C,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,gBAAgB,EAAE,CAAC;IACvC,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC;IACrD,OAAO,gBAAgB,GAAG,SAAS,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,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,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,cAAc;IACR,SAAS,CAAS;IAClB,cAAc,CAAS;IACvB,gBAAgB,CAA4B;IAE7D,YAAY,UAA2B,EAAE;QACvC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,iBAAiB,CAAC;QACxD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;QACxE,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IACnD,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM;QACR,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,aAAa,EAAE,IAAI,CAAC,gBAAgB,KAAK,SAAS;SACnD,CAAC;IACJ,CAAC;IAED,kDAAkD;IAClD,IAAI,mBAAmB;QACrB,OAAO,IAAI,CAAC,gBAAgB,KAAK,SAAS,CAAC;IAC7C,CAAC;IAED;;;;;;;;;;OAUG;IACH,iBAAiB,CAAC,OAAa,EAAE,KAAoB;QACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC;QACxE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QACpD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEpC,4BAA4B;QAC5B,MAAM,UAAU,GAAyC,EAAE,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACnD,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,qBAAW,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAS;gBACzB,GAAG,IAAI;gBACP,MAAM,EAAE,KAAK;gBACb,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE;aAChE,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,0BAA0B,CAC9B,OAAa,EACb,KAAoB;QAEpB,mDAAmD;QACnD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC;QACxE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE3C,mDAAmD;QACnD,MAAM,CAAC,QAAQ,EAAE,GAAG,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACtD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC;YACpC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;SACxE,CAAC,CAAC;QAEH,kDAAkD;QAClD,MAAM,UAAU,GAAyC,EAAE,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAChF,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,qBAAW,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAS;gBACzB,GAAG,IAAI;gBACP,MAAM,EAAE,KAAK;gBACb,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE;aAClE,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,qEAAqE;IACrE,kBAAkB;IAClB,qEAAqE;IAErE,6EAA6E;IACrE,SAAS,CAAC,IAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/D,CAAC;CACF;AA/ID,wCA+IC"}