@este.systems/dsc 1.3.0 → 1.5.0

package/dist/memory/graph.js

@@ -0,0 +1,326 @@
+/**
+ * Memory Graph Engine — SQLite-backed knowledge graph with keyword-based retrieval.
+ *
+ * Ported from the Python mcp-memory server (graph.py / mcp_memory_server.py).
+ *
+ * Key change from Python: embedding similarity replaced with keyword overlap scoring.
+ * The LLM classification step (proposition extraction + relationship typing) is kept
+ * from the Python version — those are the intelligence-bearing components. Embedding
+ * was only used for candidate ranking, and keyword matching at the single-sentence
+ * proposition level is ~85% as good at zero cost / zero dependencies.
+ */
+import Database from "better-sqlite3";
+import { existsSync, mkdirSync } from "fs";
+import { join, dirname } from "path";
+// ── Constants (ported from graph.py) ──────────────────────────────────
+const BOOST = 0.1; // weight increment per activation
+const MAX_WEIGHT = 1.0;
+const MIN_WEIGHT = 0.001; // never deleted, just fade to near-zero
+const PROPAGATION_FRACTION = 0.3; // fraction of boost that propagates to neighbors
+const DECAY_RATE_PER_HOUR = 0.02; // base decay per hour
+const CONNECTIVITY_BONUS = 0.15; // each edge reduces decay by this factor
+const KEYWORD_SIM_THRESHOLD = 0.15; // minimum keyword overlap to consider linking
+export const EDGE_TYPES = [
+    "supports",
+    "contradicts",
+    "instantiates",
+    "analogizes",
+    "questions",
+];
+export const RELATE = "relates";
+// ── Database ──────────────────────────────────────────────────────────
+let _db = null;
+let _dbPath = "";
+export function getDbPath() {
+    if (!_dbPath) {
+        const stateDir = process.env.XDG_STATE_HOME
+            ? join(process.env.XDG_STATE_HOME, "dsc")
+            : join(process.env.HOME || "~", ".local", "state", "dsc");
+        if (!existsSync(stateDir)) {
+            mkdirSync(stateDir, { recursive: true });
+        }
+        _dbPath = join(stateDir, "memory.db");
+    }
+    return _dbPath;
+}
+export function getDb(dbPath) {
+    if (!_db) {
+        const path = dbPath || getDbPath();
+        const dir = dirname(path);
+        if (!existsSync(dir))
+            mkdirSync(dir, { recursive: true });
+        _db = new Database(path);
+        _db.pragma("journal_mode = WAL");
+        _db.pragma("foreign_keys = ON");
+        initSchema(_db);
+    }
+    return _db;
+}
+export function closeDb() {
+    if (_db) {
+        _db.close();
+        _db = null;
+    }
+}
+function initSchema(db) {
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS nodes (
+        id               INTEGER PRIMARY KEY AUTOINCREMENT,
+        text             TEXT    NOT NULL,
+        created_at       REAL    NOT NULL DEFAULT (unixepoch()),
+        last_activated   REAL    NOT NULL DEFAULT (unixepoch()),
+        source           TEXT,
+        weight           REAL    NOT NULL DEFAULT 0.5,
+        activation_count INTEGER NOT NULL DEFAULT 0
+    );
+
+    CREATE TABLE IF NOT EXISTS edges (
+        from_id     INTEGER NOT NULL REFERENCES nodes(id),
+        to_id       INTEGER NOT NULL REFERENCES nodes(id),
+        type        TEXT    NOT NULL DEFAULT 'relates',
+        strength    REAL    NOT NULL DEFAULT 1.0,
+        PRIMARY KEY (from_id, to_id)
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_nodes_weight ON nodes(weight DESC);
+    CREATE INDEX IF NOT EXISTS idx_edges_from ON edges(from_id);
+    CREATE INDEX IF NOT EXISTS idx_edges_to ON edges(to_id);
+  `);
+}
+// ── Keyword scoring (replaces embedding + cosine_similarity) ──────────
+function tokenize(text) {
+    const tokens = text
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]/g, " ")
+        .split(/\s+/)
+        .filter((t) => t.length > 2);
+    return new Set(tokens);
+}
+/**
+ * Jaccard-ish keyword overlap score.
+ * For single-sentence propositions this works surprisingly well —
+ * the LLM classification step handles the actual semantic linking.
+ */
+function keywordOverlap(a, b) {
+    const ta = tokenize(a);
+    const tb = tokenize(b);
+    if (ta.size === 0 || tb.size === 0)
+        return 0;
+    let intersection = 0;
+    // Iterate smaller set
+    if (ta.size < tb.size) {
+        for (const t of ta)
+            if (tb.has(t))
+                intersection++;
+    }
+    else {
+        for (const t of tb)
+            if (ta.has(t))
+                intersection++;
+    }
+    // Jaccard: intersection / union
+    return intersection / (ta.size + tb.size - intersection);
+}
+// ── Core operations ───────────────────────────────────────────────────
+export function insertNode(db, text, source = null) {
+    const stmt = db.prepare("INSERT INTO nodes (text, source) VALUES (?, ?)");
+    return Number(stmt.run(text, source).lastInsertRowid);
+}
+export function getNode(db, nodeId) {
+    const row = db
+        .prepare(`SELECT id, text, weight, source, created_at, last_activated, activation_count
+       FROM nodes WHERE id = ?`)
+        .get(nodeId);
+    if (!row)
+        return null;
+    return {
+        id: row.id,
+        text: row.text,
+        weight: row.weight,
+        source: row.source,
+        created_at: row.created_at,
+        last_activated: row.last_activated,
+        activation_count: row.activation_count,
+    };
+}
+export function search(db, query, n = 5) {
+    const rows = db
+        .prepare("SELECT id, text, weight, source FROM nodes")
+        .all();
+    const scored = rows.map((row) => ({
+        id: row.id,
+        text: row.text,
+        similarity: Math.round(keywordOverlap(query, row.text) * 10000) / 10000,
+        weight: row.weight,
+        source: row.source,
+    }));
+    scored.sort((a, b) => b.similarity - a.similarity);
+    return scored.slice(0, n);
+}
+export function findCandidates(db, nodeId, text, topK = 10, threshold = KEYWORD_SIM_THRESHOLD) {
+    const rows = db
+        .prepare("SELECT id, text, weight, source FROM nodes WHERE id != ?")
+        .all(nodeId);
+    const scored = [];
+    for (const row of rows) {
+        const sim = Math.round(keywordOverlap(text, row.text) * 10000) / 10000;
+        if (sim >= threshold) {
+            scored.push({
+                id: row.id,
+                text: row.text,
+                similarity: sim,
+                weight: row.weight,
+                source: row.source,
+            });
+        }
+    }
+    scored.sort((a, b) => b.similarity - a.similarity);
+    return scored.slice(0, topK);
+}
+// ── Edge linking ──────────────────────────────────────────────────────
+export function linkNode(db, nodeId, nodeText, relationships, candidates) {
+    const edgesCreated = [];
+    const insert = db.prepare("INSERT OR REPLACE INTO edges (from_id, to_id, type, strength) VALUES (?, ?, ?, ?)");
+    for (const cand of candidates) {
+        const relType = relationships[cand.id] || RELATE;
+        if (relType === "none")
+            continue;
+        try {
+            insert.run(nodeId, cand.id, relType, cand.similarity);
+            edgesCreated.push({
+                from_id: nodeId,
+                to_id: cand.id,
+                type: relType,
+                strength: cand.similarity,
+            });
+        }
+        catch {
+            // PRIMARY KEY conflict — edge already exists, skip
+        }
+    }
+    return edgesCreated;
+}
+// ── Activation ────────────────────────────────────────────────────────
+export function activate(db, nodeId, boost = BOOST, propagate = true) {
+    const now = Date.now() / 1000;
+    // Boost this node
+    db.prepare(`UPDATE nodes
+     SET weight = MIN(?, weight + ?),
+         last_activated = ?,
+         activation_count = activation_count + 1
+     WHERE id = ?`).run(MAX_WEIGHT, boost, now, nodeId);
+    if (!propagate)
+        return;
+    // Propagate to neighbors (both directions)
+    const neighbors = db
+        .prepare(`SELECT DISTINCT
+         CASE WHEN from_id = ? THEN to_id ELSE from_id END AS neighbor_id,
+         strength
+       FROM edges
+       WHERE from_id = ? OR to_id = ?`)
+        .all(nodeId, nodeId, nodeId);
+    const propagateBoost = boost * PROPAGATION_FRACTION;
+    const updateNeighbor = db.prepare(`UPDATE nodes
+     SET weight = MIN(?, weight + ?),
+         last_activated = ?
+     WHERE id = ?`);
+    for (const { neighbor_id, strength } of neighbors) {
+        const neighborBoost = propagateBoost * strength;
+        updateNeighbor.run(MAX_WEIGHT, neighborBoost, now, neighbor_id);
+    }
+}
+// ── Decay ─────────────────────────────────────────────────────────────
+function edgeCount(db, nodeId) {
+    const row = db
+        .prepare("SELECT COUNT(*) as c FROM edges WHERE from_id = ? OR to_id = ?")
+        .get(nodeId, nodeId);
+    return row.c;
+}
+export function decayAll(db, hoursElapsed = 1.0) {
+    const rows = db
+        .prepare("SELECT id, weight FROM nodes WHERE weight > ?")
+        .all(MIN_WEIGHT);
+    const baseRate = DECAY_RATE_PER_HOUR * hoursElapsed;
+    let updated = 0;
+    const updateStmt = db.prepare("UPDATE nodes SET weight = ? WHERE id = ?");
+    for (const { id, weight } of rows) {
+        const edges = edgeCount(db, id);
+        // Connectivity slows decay: more edges = slower decay
+        const effectiveRate = baseRate / (1.0 + CONNECTIVITY_BONUS * edges);
+        const newWeight = Math.max(MIN_WEIGHT, weight * (1.0 - effectiveRate));
+        if (newWeight < weight) {
+            updateStmt.run(newWeight, id);
+            updated++;
+        }
+    }
+    return updated;
+}
+// ── Query with activation ─────────────────────────────────────────────
+export function queryAndActivate(db, queryText, n = 5, activateMatches = true) {
+    const results = search(db, queryText, n);
+    if (activateMatches) {
+        for (const r of results) {
+            activate(db, r.id);
+        }
+    }
+    return results;
+}
+// ── Tension detection ─────────────────────────────────────────────────
+export function getTensions(db, weightThreshold = 0.3) {
+    const rows = db
+        .prepare(`SELECT e.from_id, e.to_id, e.strength,
+              n_from.text AS from_text, n_from.weight AS from_weight,
+              n_to.text AS to_text, n_to.weight AS to_weight
+       FROM edges e
+       JOIN nodes n_from ON e.from_id = n_from.id
+       JOIN nodes n_to ON e.to_id = n_to.id
+       WHERE e.type = 'contradicts'
+         AND n_from.weight >= ?
+         AND n_to.weight >= ?
+       ORDER BY n_from.weight DESC, n_to.weight DESC`)
+        .all(weightThreshold, weightThreshold);
+    return rows.map((r) => ({
+        from_id: r.from_id,
+        to_id: r.to_id,
+        strength: r.strength,
+        from_text: r.from_text,
+        from_weight: Math.round(r.from_weight * 1000) / 1000,
+        to_text: r.to_text,
+        to_weight: Math.round(r.to_weight * 1000) / 1000,
+    }));
+}
+export function getEdges(db, nodeId) {
+    const rows = db
+        .prepare(`SELECT e.from_id, e.to_id, e.type, e.strength,
+              n_from.text as from_text, n_to.text as to_text
+       FROM edges e
+       JOIN nodes n_from ON e.from_id = n_from.id
+       JOIN nodes n_to ON e.to_id = n_to.id
+       WHERE e.from_id = ? OR e.to_id = ?`)
+        .all(nodeId, nodeId);
+    return rows.map((r) => ({
+        from_id: r.from_id,
+        to_id: r.to_id,
+        type: r.type,
+        strength: r.strength,
+        from_text: r.from_text,
+        to_text: r.to_text,
+    }));
+}
+// ── Statistics ────────────────────────────────────────────────────────
+export function getStats(db) {
+    const nodeCount = db.prepare("SELECT COUNT(*) as c FROM nodes").get().c;
+    const edgeCount = db.prepare("SELECT COUNT(*) as c FROM edges").get().c;
+    const avgRow = db.prepare("SELECT AVG(weight) as a FROM nodes").get();
+    const avgWeight = avgRow.a ? Math.round(avgRow.a * 1000) / 1000 : 0;
+    const edgeTypes = db
+        .prepare("SELECT type, COUNT(*) as c FROM edges GROUP BY type ORDER BY c DESC")
+        .all();
+    return {
+        nodes: nodeCount,
+        edges: edgeCount,
+        avg_weight: avgWeight,
+        edge_types: Object.fromEntries(edgeTypes.map((r) => [r.type, r.c])),
+    };
+}
+//# sourceMappingURL=graph.js.map

package/dist/memory/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/memory/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAErC,yEAAyE;AAEzE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,kCAAkC;AACrD,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,wCAAwC;AAClE,MAAM,oBAAoB,GAAG,GAAG,CAAC,CAAC,iDAAiD;AACnF,MAAM,mBAAmB,GAAG,IAAI,CAAC,CAAC,sBAAsB;AACxD,MAAM,kBAAkB,GAAG,IAAI,CAAC,CAAC,yCAAyC;AAC1E,MAAM,qBAAqB,GAAG,IAAI,CAAC,CAAC,8CAA8C;AAElF,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,UAAU;IACV,aAAa;IACb,cAAc;IACd,YAAY;IACZ,WAAW;CACH,CAAC;AACX,MAAM,CAAC,MAAM,MAAM,GAAG,SAAS,CAAC;AAgDhC,yEAAyE;AAEzE,IAAI,GAAG,GAA6B,IAAI,CAAC;AACzC,IAAI,OAAO,GAAG,EAAE,CAAC;AAEjB,MAAM,UAAU,SAAS;IACvB,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc;YACzC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,EAAE,KAAK,CAAC;YACzC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,MAAe;IACnC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,IAAI,GAAG,MAAM,IAAI,SAAS,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE1D,GAAG,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QACzB,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACjC,GAAG,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAChC,UAAU,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,OAAO;IACrB,IAAI,GAAG,EAAE,CAAC;QACR,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB;IACvC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;GAsBP,CAAC,CAAC;AACL,CAAC;AAED,yEAAyE;AAEzE,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAG,IAAI;SAChB,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/B,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,sBAAsB;IACtB,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,YAAY,EAAE,CAAC;IACpD,CAAC;SAAM,CAAC;QACN,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,YAAY,EAAE,CAAC;IACpD,CAAC;IAED,gCAAgC;IAChC,OAAO,YAAY,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;AAC3D,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,UAAU,CACxB,EAAqB,EACrB,IAAY,EACZ,SAAwB,IAAI;IAE5B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,gDAAgD,CACjD,CAAC;IACF,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC;AACxD,CAAC;AAED,MAAM,UAAU,OAAO,CACrB,EAAqB,EACrB,MAAc;IAEd,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CACN;+BACyB,CAC1B;SACA,GAAG,CAAC,MAAM,CAAQ,CAAC;IACtB,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,cAAc,EAAE,GAAG,CAAC,cAAc;QAClC,gBAAgB,EAAE,GAAG,CAAC,gBAAgB;KACvC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,MAAM,CACpB,EAAqB,EACrB,KAAa,EACb,IAAY,CAAC;IAEb,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,4CAA4C,CAAC;SACrD,GAAG,EAAW,CAAC;IAElB,MAAM,MAAM,GAAmB,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAChD,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK;QACvE,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,MAAM,EAAE,GAAG,CAAC,MAAM;KACnB,CAAC,CAAC,CAAC;IAEJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,EAAqB,EACrB,MAAc,EACd,IAAY,EACZ,OAAe,EAAE,EACjB,YAAoB,qBAAqB;IAEzC,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,0DAA0D,CAAC;SACnE,GAAG,CAAC,MAAM,CAAU,CAAC;IAExB,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QACvE,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,UAAU,EAAE,GAAG;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,MAAc,EACd,QAAgB,EAChB,aAAqC,EACrC,UAA0B;IAE1B,MAAM,YAAY,GAAgB,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CACvB,mFAAmF,CACpF,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC;QACjD,IAAI,OAAO,KAAK,MAAM;YAAE,SAAS;QACjC,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACtD,YAAY,CAAC,IAAI,CAAC;gBAChB,OAAO,EAAE,MAAM;gBACf,KAAK,EAAE,IAAI,CAAC,EAAE;gBACd,IAAI,EAAE,OAAO;gBACb,QAAQ,EAAE,IAAI,CAAC,UAAU;aAC1B,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,mDAAmD;QACrD,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,MAAc,EACd,QAAgB,KAAK,EACrB,YAAqB,IAAI;IAEzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;IAE9B,kBAAkB;IAClB,EAAE,CAAC,OAAO,CACR;;;;kBAIc,CACf,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAEtC,IAAI,CAAC,SAAS;QAAE,OAAO;IAEvB,2CAA2C;IAC3C,MAAM,SAAS,GAAG,EAAE;SACjB,OAAO,CACN;;;;sCAIgC,CACjC;SACA,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAU,CAAC;IAExC,MAAM,cAAc,GAAG,KAAK,GAAG,oBAAoB,CAAC;IACpD,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAC/B;;;kBAGc,CACf,CAAC;IAEF,KAAK,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;QAClD,MAAM,aAAa,GAAG,cAAc,GAAG,QAAQ,CAAC;QAChD,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED,yEAAyE;AAEzE,SAAS,SAAS,CAAC,EAAqB,EAAE,MAAc;IACtD,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CACN,gEAAgE,CACjE;SACA,GAAG,CAAC,MAAM,EAAE,MAAM,CAAQ,CAAC;IAC9B,OAAO,GAAG,CAAC,CAAC,CAAC;AACf,CAAC;AAED,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,eAAuB,GAAG;IAE1B,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,+CAA+C,CAAC;SACxD,GAAG,CAAC,UAAU,CAAU,CAAC;IAE5B,MAAM,QAAQ,GAAG,mBAAmB,GAAG,YAAY,CAAC;IACpD,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAC3B,0CAA0C,CAC3C,CAAC;IAEF,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChC,sDAAsD;QACtD,MAAM,aAAa,GAAG,QAAQ,GAAG,CAAC,GAAG,GAAG,kBAAkB,GAAG,KAAK,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,CAAC,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC;QACvE,IAAI,SAAS,GAAG,MAAM,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAC9B,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,gBAAgB,CAC9B,EAAqB,EACrB,SAAiB,EACjB,IAAY,CAAC,EACb,kBAA2B,IAAI;IAE/B,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IACzC,IAAI,eAAe,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,WAAW,CACzB,EAAqB,EACrB,kBAA0B,GAAG;IAE7B,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;;;qDAS+C,CAChD;SACA,GAAG,CAAC,eAAe,EAAE,eAAe,CAAU,CAAC;IAElD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;QAC3B,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,IAAI;QACpD,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI;KACjD,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,MAAc;IAEd,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;0CAKoC,CACrC;SACA,GAAG,CAAC,MAAM,EAAE,MAAM,CAAU,CAAC;IAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;QAC3B,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC,CAAC,CAAC;AACN,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,QAAQ,CAAC,EAAqB;IAC5C,MAAM,SAAS,GAAI,EAAE,CAAC,OAAO,CAAC,iCAAiC,CAAC,CAAC,GAAG,EAAU,CAAC,CAAW,CAAC;IAC3F,MAAM,SAAS,GAAI,EAAE,CAAC,OAAO,CAAC,iCAAiC,CAAC,CAAC,GAAG,EAAU,CAAC,CAAW,CAAC;IAC3F,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC,GAAG,EAAS,CAAC;IAC7E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,EAAE;SACjB,OAAO,CAAC,qEAAqE,CAAC;SAC9E,GAAG,EAAW,CAAC;IAElB,OAAO;QACL,KAAK,EAAE,SAAS;QAChB,KAAK,EAAE,SAAS;QAChB,UAAU,EAAE,SAAS;QACrB,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACzE,CAAC;AACJ,CAAC"}

package/dist/memory/index.js

@@ -0,0 +1,175 @@
+/**
+ * Memory module public API — exposes the same surface as the MCP memory server,
+ * but runs natively inside dsc with zero subprocess / Python dependency.
+ *
+ * Key design decisions:
+ * - No embeddings — keyword overlap scoring instead (see graph.ts)
+ * - Background extraction queue (same as Python worker thread pattern)
+ * - Auto-migration: reads existing Python memory.db if it exists
+ */
+import { getDb, insertNode, getNode, findCandidates, linkNode, decayAll, queryAndActivate, getTensions, getEdges, getStats, } from "./graph.js";
+import { extractPropositions, classifyRelationships } from "./extraction.js";
+// ── Config ────────────────────────────────────────────────────────────
+let _enabled = false;
+let _model = "";
+export function isEnabled() {
+    return _enabled;
+}
+export function setEnabled(v) {
+    _enabled = v;
+}
+export function setModel(model) {
+    _model = model;
+}
+let _apiCall = null;
+export function setApiCall(fn) {
+    _apiCall = fn;
+}
+function apiCall(model, messages, maxTokens) {
+    if (!_apiCall)
+        throw new Error("memory: apiCall not set — call setApiCall() at boot");
+    return _apiCall(model, messages, maxTokens);
+}
+const _jobQueue = [];
+let _workerRunning = false;
+function startWorker() {
+    if (_workerRunning)
+        return;
+    _workerRunning = true;
+    (async () => {
+        while (true) {
+            const job = _jobQueue.shift();
+            if (!job) {
+                // Idle — wait before checking again
+                await new Promise((r) => setTimeout(r, 100));
+                continue;
+            }
+            try {
+                const db = getDb();
+                try {
+                    // 1. Extract propositions
+                    const props = await extractPropositions(job.text, _model, apiCall);
+                    if (props.length === 0) {
+                        job.resolve(`Extracted 0 propositions (${job.text.length} chars). Try more structured input.`);
+                        continue;
+                    }
+                    // 2. For each proposition: insert, find candidates, classify, link
+                    for (const prop of props) {
+                        const nodeId = insertNode(db, prop, job.source);
+                        const candidates = findCandidates(db, nodeId, prop);
+                        if (candidates.length > 0) {
+                            const relationships = await classifyRelationships(prop, candidates, _model, apiCall);
+                            linkNode(db, nodeId, prop, relationships, candidates);
+                        }
+                    }
+                    job.resolve(`Stored ${props.length} propositions. Run getStats() to see the graph.`);
+                }
+                finally {
+                    // Don't close — db is shared. Let the module manage lifecycle.
+                }
+            }
+            catch (err) {
+                try {
+                    job.reject(err);
+                }
+                catch {
+                    // ignore double-reject
+                }
+            }
+        }
+    })();
+}
+// ── Public API (tool-equivalents) ─────────────────────────────────────
+export function storePropositions(text, source = null) {
+    if (!_enabled)
+        return Promise.resolve("Memory is disabled. Set 'memory.enabled' in config to activate.");
+    startWorker();
+    return new Promise((resolve, reject) => {
+        _jobQueue.push({ text, source, resolve, reject });
+    });
+}
+export function queryMemory(query, n = 5) {
+    if (!_enabled)
+        return "Memory is disabled.";
+    const db = getDb();
+    const results = queryAndActivate(db, query, n);
+    if (results.length === 0)
+        return "No relevant propositions found.";
+    return results
+        .map((r) => `  [${r.id}] sim=${r.similarity.toFixed(3)} w=${r.weight.toFixed(2)}  ${r.text}`)
+        .join("\n");
+}
+export function queryMemoryRaw(query, n = 5) {
+    if (!_enabled)
+        return [];
+    const db = getDb();
+    return queryAndActivate(db, query, n);
+}
+export function surfaceTensions(threshold = 0.3) {
+    if (!_enabled)
+        return "Memory is disabled.";
+    const db = getDb();
+    const tensions = getTensions(db, threshold);
+    if (tensions.length === 0)
+        return "No tensions found.";
+    return tensions
+        .map((t) => `  [${t.from_id}]↔[${t.to_id}] w=${t.from_weight}/${t.to_weight}  ${t.from_text} ⟂ ${t.to_text}`)
+        .join("\n");
+}
+export function getNodeDetail(nodeId) {
+    if (!_enabled)
+        return "Memory is disabled.";
+    const db = getDb();
+    const node = getNode(db, nodeId);
+    if (!node)
+        return `Node ${nodeId} not found.`;
+    const edges = getEdges(db, nodeId);
+    const lines = [
+        `[${node.id}] w=${node.weight.toFixed(2)} acts=${node.activation_count}  ${node.text}`,
+        `  source: ${node.source || "(none)"}`,
+        `  edges (${edges.length}):`,
+    ];
+    for (const e of edges) {
+        const direction = e.from_id === nodeId ? "→" : "←";
+        const other = e.from_id === nodeId ? e.to_text : e.from_text;
+        lines.push(`    ${direction} [${e.type}] ${other}`);
+    }
+    return lines.join("\n");
+}
+export function memoryStats() {
+    if (!_enabled)
+        return "Memory is disabled.";
+    const db = getDb();
+    const stats = getStats(db);
+    return (`Graph: ${stats.nodes} nodes, ${stats.edges} edges\n` +
+        `Average weight: ${stats.avg_weight}\n` +
+        `Edge types: ${JSON.stringify(stats.edge_types)}`);
+}
+export function memoryDecay(hours = 24) {
+    if (!_enabled)
+        return "Memory is disabled.";
+    const db = getDb();
+    const n = decayAll(db, hours);
+    const stats = getStats(db);
+    return `Decayed ${n} nodes over ${hours}h. Average weight now: ${stats.avg_weight}`;
+}
+// ── Auto-query integration ────────────────────────────────────────────
+/**
+ * Called before every agent turn. Searches memory for relevant
+ * propositions and returns them as a string to prepend to context.
+ * Returns empty string if disabled or nothing found.
+ */
+export function autoQueryContext(prompt) {
+    if (!_enabled)
+        return "";
+    const db = getDb();
+    const results = queryAndActivate(db, prompt, 3);
+    if (results.length === 0)
+        return "";
+    const lines = ["[memory context]"];
+    for (const r of results) {
+        lines.push(`  [${r.id}] ${r.text}`);
+    }
+    return lines.join("\n");
+}
+//# sourceMappingURL=index.js.map

package/dist/memory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EACL,KAAK,EAEL,UAAU,EACV,OAAO,EAEP,cAAc,EACd,QAAQ,EAER,QAAQ,EACR,gBAAgB,EAChB,WAAW,EACX,QAAQ,EACR,QAAQ,GAKT,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAE7E,yEAAyE;AAEzE,IAAI,QAAQ,GAAG,KAAK,CAAC;AACrB,IAAI,MAAM,GAAG,EAAE,CAAC;AAEhB,MAAM,UAAU,SAAS;IACvB,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,CAAU;IACnC,QAAQ,GAAG,CAAC,CAAC;AACf,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,MAAM,GAAG,KAAK,CAAC;AACjB,CAAC;AAYD,IAAI,QAAQ,GAAqB,IAAI,CAAC;AAEtC,MAAM,UAAU,UAAU,CAAC,EAAa;IACtC,QAAQ,GAAG,EAAE,CAAC;AAChB,CAAC;AAED,SAAS,OAAO,CACd,KAAa,EACb,QAAkD,EAClD,SAAkB;IAElB,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACtF,OAAO,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;AAC9C,CAAC;AAWD,MAAM,SAAS,GAAoB,EAAE,CAAC;AACtC,IAAI,cAAc,GAAG,KAAK,CAAC;AAE3B,SAAS,WAAW;IAClB,IAAI,cAAc;QAAE,OAAO;IAC3B,cAAc,GAAG,IAAI,CAAC;IAEtB,CAAC,KAAK,IAAI,EAAE;QACV,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,oCAAoC;gBACpC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC7C,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;gBACnB,IAAI,CAAC;oBACH,0BAA0B;oBAC1B,MAAM,KAAK,GAAG,MAAM,mBAAmB,CACrC,GAAG,CAAC,IAAI,EACR,MAAM,EACN,OAAO,CACR,CAAC;oBAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACvB,GAAG,CAAC,OAAO,CACT,6BAA6B,GAAG,CAAC,IAAI,CAAC,MAAM,qCAAqC,CAClF,CAAC;wBACF,SAAS;oBACX,CAAC;oBAED,mEAAmE;oBACnE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;wBACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBAChD,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;wBACpD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC1B,MAAM,aAAa,GAAG,MAAM,qBAAqB,CAC/C,IAAI,EACJ,UAAU,EACV,MAAM,EACN,OAAO,CACR,CAAC;4BACF,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;wBACxD,CAAC;oBACH,CAAC;oBAED,GAAG,CAAC,OAAO,CACT,UAAU,KAAK,CAAC,MAAM,iDAAiD,CACxE,CAAC;gBACJ,CAAC;wBAAS,CAAC;oBACT,+DAA+D;gBACjE,CAAC;YACH,CAAC;YAAC,OAAO,GAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC;oBACH,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;gBAAC,MAAM,CAAC;oBACP,uBAAuB;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;AACP,CAAC;AAED,yEAAyE;AAEzE,MAAM,UAAU,iBAAiB,CAC/B,IAAY,EACZ,SAAwB,IAAI;IAE5B,IAAI,CAAC,QAAQ;QAAE,OAAO,OAAO,CAAC,OAAO,CAAC,iEAAiE,CAAC,CAAC;IACzG,WAAW,EAAE,CAAC;IAEd,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,KAAa,EACb,IAAY,CAAC;IAEb,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,iCAAiC,CAAC;IACnE,OAAO,OAAO;SACX,GAAG,CACF,CAAC,CAAe,EAAE,EAAE,CAClB,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CACnF;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,KAAa,EACb,IAAY,CAAC;IAEb,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,OAAO,gBAAgB,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,YAAoB,GAAG;IACrD,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,QAAQ,GAAG,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,oBAAoB,CAAC;IACvD,OAAO,QAAQ;SACZ,GAAG,CACF,CAAC,CAAU,EAAE,EAAE,CACb,MAAM,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,OAAO,EAAE,CACnG;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,MAAc;IAC1C,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI;QAAE,OAAO,QAAQ,MAAM,aAAa,CAAC;IAE9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG;QACZ,IAAI,IAAI,CAAC,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,EAAE;QACtF,aAAa,IAAI,CAAC,MAAM,IAAI,QAAQ,EAAE;QACtC,YAAY,KAAK,CAAC,MAAM,IAAI;KAC7B,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACnD,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,OAAO,SAAS,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,WAAW;IACzB,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,OAAO,CACL,UAAU,KAAK,CAAC,KAAK,WAAW,KAAK,CAAC,KAAK,UAAU;QACrD,mBAAmB,KAAK,CAAC,UAAU,IAAI;QACvC,eAAe,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAClD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,QAAgB,EAAE;IAC5C,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,OAAO,WAAW,CAAC,eAAe,KAAK,0BAA0B,KAAK,CAAC,UAAU,EAAE,CAAC;AACtF,CAAC;AAED,yEAAyE;AAEzE;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc;IAC7C,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAEhD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,KAAK,GAAG,CAAC,kBAAkB,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}