@nac3/forge-cli 0.2.0-alpha.8 → 0.2.1-alpha.60

package/dist/semantic_graph/store.js

@@ -0,0 +1,360 @@
+/**
+ * Yujin Forge -- semantic graph LOCAL store (per-project SQLite).
+ *
+ * One DB file per project at
+ *   ~/.yujin-forge/projects/<slug>/semantic_graph.db
+ *
+ * Schema mirrors the D1 schema in
+ *   packages/hito4-server/sql/0009_semantic_graph.sql
+ * with one exception: locally we still keep user_handle as a column,
+ * but it defaults to '' (single-user local install). That lets the
+ * hybrid sync code (slice 181) mirror rows up to D1 without column
+ * remapping.
+ *
+ * Per Pablo (2026-06-07): "el semantic graph es por proyecto.
+ * Cambio de proyecto, redescubro el grafo." Switch project = new DB
+ * file. No cross-project recall.
+ *
+ * Per Pablo (2026-06-07): "Tus recomendaciones a todo... confirmado
+ * slices." -> better-sqlite3 (sync API, fast, well-supported on
+ * Win/Mac/Linux Node 18+), local default, opt-in sync.
+ *
+ * ASCII-only.
+ */
+import Database from 'better-sqlite3';
+import { promises as fs } from 'node:fs';
+import * as path from 'node:path';
+import * as os from 'node:os';
+import { RELEVANT_DEFAULT_LIMIT, } from './types.js';
+const FILE_NAME = 'semantic_graph.db';
+const LOCAL_USER_HANDLE = ''; /* single-user local install */
+/* Notes on lifecycle:
+ *  - We deliberately do NOT cache open Database handles. SQLite
+ *    file opens are sub-ms; the previous attempt at a process-wide
+ *    cache caused Windows EBUSY in tests that rm the tmp dir
+ *    without knowing they had to close the handle first.
+ *  - Journal mode is DELETE (not WAL) so there are no lingering
+ *    -wal / -shm sidecar files after the handle closes. Our access
+ *    pattern (one writer at a time, low QPS) doesn't benefit from
+ *    WAL concurrency anyway.
+ */
+function configRoot() {
+    if (process.env['YUJIN_FORGE_HOME'])
+        return process.env['YUJIN_FORGE_HOME'];
+    if (process.env['YF_CONFIG_DIR'])
+        return process.env['YF_CONFIG_DIR'];
+    const xdg = process.env['XDG_CONFIG_HOME'];
+    if (xdg && process.platform === 'linux')
+        return path.join(xdg, 'yujin-forge');
+    return path.join(os.homedir(), '.yujin-forge');
+}
+function projectDir(project_slug) {
+    if (!project_slug || project_slug.includes('..') || /[/\\]/.test(project_slug)) {
+        throw new Error('semantic_graph: invalid project_slug ' + JSON.stringify(project_slug));
+    }
+    return path.join(configRoot(), 'projects', project_slug);
+}
+function fileFor(project_slug) {
+    return path.join(projectDir(project_slug), FILE_NAME);
+}
+async function ensureDir(project_slug) {
+    await fs.mkdir(projectDir(project_slug), { recursive: true });
+}
+async function open(project_slug) {
+    await ensureDir(project_slug);
+    const db = new Database(fileFor(project_slug));
+    db.pragma('journal_mode = DELETE');
+    db.pragma('synchronous = NORMAL');
+    db.pragma('foreign_keys = ON');
+    applySchema(db);
+    return db;
+}
+function withDb(project_slug, fn) {
+    return open(project_slug).then((db) => {
+        try {
+            return fn(db);
+        }
+        finally {
+            db.close();
+        }
+    });
+}
+function applySchema(db) {
+    /* Field-for-field mirror of packages/hito4-server/sql/0009_semantic_graph.sql */
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS semantic_graph_nodes (
+      user_handle   TEXT NOT NULL,
+      project_slug  TEXT NOT NULL DEFAULT '',
+      id            TEXT NOT NULL,
+      kind          TEXT NOT NULL,
+      name          TEXT NOT NULL,
+      version       TEXT,
+      source        TEXT NOT NULL,
+      purpose       TEXT NOT NULL,
+      solves        TEXT NOT NULL,
+      do_not_invent TEXT NOT NULL,
+      api_surface   TEXT NOT NULL,
+      confidence    TEXT NOT NULL,
+      weight        REAL NOT NULL DEFAULT 0.5,
+      added_at      TEXT NOT NULL,
+      updated_at    TEXT NOT NULL,
+      PRIMARY KEY (user_handle, project_slug, id)
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_sg_nodes_kind
+      ON semantic_graph_nodes (user_handle, project_slug, kind);
+
+    CREATE INDEX IF NOT EXISTS idx_sg_nodes_confidence
+      ON semantic_graph_nodes (user_handle, project_slug, confidence);
+
+    CREATE INDEX IF NOT EXISTS idx_sg_nodes_updated
+      ON semantic_graph_nodes (user_handle, project_slug, updated_at);
+
+    CREATE TABLE IF NOT EXISTS semantic_graph_edges (
+      user_handle  TEXT NOT NULL,
+      project_slug TEXT NOT NULL DEFAULT '',
+      id           TEXT NOT NULL,
+      kind         TEXT NOT NULL,
+      from_id      TEXT NOT NULL,
+      to_id        TEXT NOT NULL,
+      weight       REAL NOT NULL DEFAULT 0.5,
+      source       TEXT NOT NULL,
+      created_at   TEXT NOT NULL,
+      PRIMARY KEY (user_handle, project_slug, id)
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_sg_edges_from
+      ON semantic_graph_edges (user_handle, project_slug, from_id);
+
+    CREATE INDEX IF NOT EXISTS idx_sg_edges_to
+      ON semantic_graph_edges (user_handle, project_slug, to_id);
+
+    CREATE INDEX IF NOT EXISTS idx_sg_edges_kind
+      ON semantic_graph_edges (user_handle, project_slug, kind);
+  `);
+}
+export async function upsertNodes(project_slug, nodes) {
+    if (nodes.length === 0)
+        return { inserted: 0, updated: 0 };
+    return withDb(project_slug, (db) => {
+        const exists = db.prepare('SELECT 1 FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ? AND id = ?');
+        const ins = db.prepare(`
+    INSERT INTO semantic_graph_nodes
+      (user_handle, project_slug, id, kind, name, version, source, purpose, solves,
+       do_not_invent, api_surface, confidence, weight, added_at, updated_at)
+    VALUES (@u, @p, @id, @kind, @name, @version, @source, @purpose, @solves,
+            @do_not_invent, @api_surface, @confidence, @weight, @added_at, @updated_at)
+    ON CONFLICT(user_handle, project_slug, id) DO UPDATE SET
+      kind          = excluded.kind,
+      name          = excluded.name,
+      version       = excluded.version,
+      source        = excluded.source,
+      purpose       = excluded.purpose,
+      solves        = excluded.solves,
+      do_not_invent = excluded.do_not_invent,
+      api_surface   = excluded.api_surface,
+      confidence    = excluded.confidence,
+      weight        = excluded.weight,
+      updated_at    = excluded.updated_at
+  `);
+        let inserted = 0, updated = 0;
+        const tx = db.transaction((rows) => {
+            for (const n of rows) {
+                const found = exists.get(LOCAL_USER_HANDLE, project_slug, n.id);
+                if (found)
+                    updated++;
+                else
+                    inserted++;
+                ins.run({
+                    u: LOCAL_USER_HANDLE, p: project_slug,
+                    id: n.id,
+                    kind: n.kind,
+                    name: n.name,
+                    version: n.version ?? null,
+                    source: n.source,
+                    purpose: n.purpose.slice(0, 200),
+                    solves: JSON.stringify(n.solves ?? []),
+                    do_not_invent: JSON.stringify(n.do_not_invent ?? []),
+                    api_surface: JSON.stringify(n.api_surface ?? []),
+                    confidence: n.confidence,
+                    weight: n.weight,
+                    added_at: n.added_at,
+                    updated_at: n.updated_at,
+                });
+            }
+        });
+        tx(nodes);
+        return { inserted, updated };
+    });
+}
+export async function upsertEdges(project_slug, edges) {
+    if (edges.length === 0)
+        return { inserted: 0, updated: 0 };
+    return withDb(project_slug, (db) => {
+        const exists = db.prepare('SELECT 1 FROM semantic_graph_edges WHERE user_handle = ? AND project_slug = ? AND id = ?');
+        const ins = db.prepare(`
+    INSERT INTO semantic_graph_edges
+      (user_handle, project_slug, id, kind, from_id, to_id, weight, source, created_at)
+    VALUES (@u, @p, @id, @kind, @from, @to, @weight, @source, @created)
+    ON CONFLICT(user_handle, project_slug, id) DO UPDATE SET
+      kind   = excluded.kind,
+      from_id = excluded.from_id,
+      to_id   = excluded.to_id,
+      weight  = excluded.weight,
+      source  = excluded.source
+  `);
+        let inserted = 0, updated = 0;
+        const tx = db.transaction((rows) => {
+            for (const e of rows) {
+                const found = exists.get(LOCAL_USER_HANDLE, project_slug, e.id);
+                if (found)
+                    updated++;
+                else
+                    inserted++;
+                ins.run({
+                    u: LOCAL_USER_HANDLE, p: project_slug,
+                    id: e.id, kind: e.kind, from: e.from_id, to: e.to_id,
+                    weight: e.weight, source: e.source, created: e.created_at,
+                });
+            }
+        });
+        tx(edges);
+        return { inserted, updated };
+    });
+}
+const CONF_RANK = { claimed: 0, auto: 1, verified: 2 };
+export async function listRelevant(project_slug, q) {
+    return withDb(project_slug, (db) => {
+        const limit = q.limit ?? RELEVANT_DEFAULT_LIMIT;
+        const wheres = ['user_handle = ?', 'project_slug = ?'];
+        const params = [LOCAL_USER_HANDLE, project_slug];
+        if (q.kinds && q.kinds.length > 0) {
+            wheres.push('kind IN (' + q.kinds.map(() => '?').join(',') + ')');
+            params.push(...q.kinds);
+        }
+        if (q.text && q.text.trim().length > 0) {
+            const like = '%' + q.text.toLowerCase() + '%';
+            wheres.push('(lower(name) LIKE ? OR lower(purpose) LIKE ? OR lower(solves) LIKE ?)');
+            params.push(like, like, like);
+        }
+        const rows = db.prepare('SELECT * FROM semantic_graph_nodes WHERE ' + wheres.join(' AND ')
+            + ' ORDER BY weight DESC, updated_at DESC LIMIT ?').all(...params, limit * 4); /* over-fetch then filter on confidence */
+        const floor = CONF_RANK[q.min_confidence ?? 'claimed'] ?? 0;
+        const out = [];
+        for (const r of rows) {
+            if ((CONF_RANK[r.confidence] ?? 0) < floor)
+                continue;
+            out.push(rowToNode(r));
+            if (out.length >= limit)
+                break;
+        }
+        return out;
+    });
+}
+export async function getNode(project_slug, id) {
+    return withDb(project_slug, (db) => {
+        const r = db.prepare('SELECT * FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ? AND id = ?').get(LOCAL_USER_HANDLE, project_slug, id);
+        return r ? rowToNode(r) : null;
+    });
+}
+export async function listEdgesFrom(project_slug, from_id) {
+    return withDb(project_slug, (db) => {
+        const rows = db.prepare('SELECT * FROM semantic_graph_edges WHERE user_handle = ? AND project_slug = ? AND from_id = ?').all(LOCAL_USER_HANDLE, project_slug, from_id);
+        return rows.map(rowToEdge);
+    });
+}
+/** GRAPH-2 (dogfood 2026-06-10) -- list ALL edges of a project.
+ *  Hasta hoy solo habia listEdgesFrom(from_id): para dibujar el
+ *  grafo completo el LLM tenia que leer el .db con sqlite a mano
+ *  (lento). Este es el read que respalda yujin.graph.list-edges. */
+export async function listAllEdges(project_slug) {
+    return withDb(project_slug, (db) => {
+        const rows = db.prepare('SELECT * FROM semantic_graph_edges WHERE user_handle = ? AND project_slug = ?').all(LOCAL_USER_HANDLE, project_slug);
+        return rows.map(rowToEdge);
+    });
+}
+export async function summarize(project_slug) {
+    return withDb(project_slug, (db) => {
+        const node_count = db.prepare('SELECT COUNT(*) AS n FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ?').get(LOCAL_USER_HANDLE, project_slug).n;
+        const edge_count = db.prepare('SELECT COUNT(*) AS n FROM semantic_graph_edges WHERE user_handle = ? AND project_slug = ?').get(LOCAL_USER_HANDLE, project_slug).n;
+        const by_kind_rows = db.prepare('SELECT kind, COUNT(*) AS n FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ? GROUP BY kind').all(LOCAL_USER_HANDLE, project_slug);
+        const by_kind = { library: 0, protocol: 0, component: 0, module: 0 };
+        for (const r of by_kind_rows)
+            by_kind[r.kind] = r.n;
+        const last = db.prepare('SELECT MAX(updated_at) AS t FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ?').get(LOCAL_USER_HANDLE, project_slug).t;
+        return {
+            user_handle: LOCAL_USER_HANDLE,
+            project_slug, node_count, edge_count, by_kind,
+            last_updated: last,
+        };
+    });
+}
+/** GRAPH (dogfood 2026-06-10) -- delete edges whose from_id or
+ *  to_id does not match an existing node ("dangling"). A laxy
+ *  import scanner can emit edges to ids that were never registered
+ *  as nodes (libs of workspace sub-packages, or junk parsed from
+ *  comments/strings). Returns how many were removed. Idempotent. */
+export async function pruneDanglingEdges(project_slug) {
+    return withDb(project_slug, (db) => {
+        const r = db.prepare(`
+      DELETE FROM semantic_graph_edges
+      WHERE user_handle = ? AND project_slug = ?
+        AND (
+          from_id NOT IN (SELECT id FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ?)
+          OR to_id NOT IN (SELECT id FROM semantic_graph_nodes WHERE user_handle = ? AND project_slug = ?)
+        )
+    `).run(LOCAL_USER_HANDLE, project_slug, LOCAL_USER_HANDLE, project_slug, LOCAL_USER_HANDLE, project_slug);
+        return { removed: r.changes };
+    });
+}
+/** Wipe both tables for a project (yf graph forget). */
+export async function forgetGraph(project_slug) {
+    try {
+        await fs.unlink(fileFor(project_slug));
+    }
+    catch (err) {
+        const code = err instanceof Error && 'code' in err ? err.code : undefined;
+        if (code !== 'ENOENT')
+            throw err;
+    }
+    /* In DELETE journal mode these sidecars are usually absent already,
+     * but leftovers from a crashed run can linger -- best-effort. */
+    for (const ext of ['-journal', '-wal', '-shm']) {
+        try {
+            await fs.unlink(fileFor(project_slug) + ext);
+        }
+        catch { /* ignore */ }
+    }
+}
+function rowToNode(r) {
+    return {
+        id: r.id, kind: r.kind, name: r.name,
+        ...(r.version != null ? { version: r.version } : {}),
+        source: r.source, purpose: r.purpose,
+        solves: safeArr(r.solves),
+        do_not_invent: safeArr(r.do_not_invent),
+        api_surface: safeArr(r.api_surface),
+        confidence: r.confidence, weight: r.weight,
+        added_at: r.added_at, updated_at: r.updated_at,
+    };
+}
+function rowToEdge(r) {
+    return {
+        id: r.id, kind: r.kind, from_id: r.from_id, to_id: r.to_id,
+        weight: r.weight, source: r.source, created_at: r.created_at,
+    };
+}
+function safeArr(s) {
+    try {
+        const v = JSON.parse(s);
+        return Array.isArray(v) ? v.filter((x) => typeof x === 'string') : [];
+    }
+    catch {
+        return [];
+    }
+}
+/** Test seam preserved for compatibility -- the store no longer
+ *  caches open handles, so this is a no-op. Existing tests still
+ *  call it (and harmlessly so). */
+export function _closeAllForTest() { }
+//# sourceMappingURL=store.js.map

package/dist/semantic_graph/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/semantic_graph/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,EAEe,sBAAsB,GAC3C,MAAM,YAAY,CAAC;AAEpB,MAAM,SAAS,GAAG,mBAAmB,CAAC;AACtC,MAAM,iBAAiB,GAAG,EAAE,CAAC,CAAG,+BAA+B;AAE/D;;;;;;;;;GASG;AAEH,SAAS,UAAU;IACjB,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC;QAAE,OAAO,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAC5E,IAAI,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC;QAAI,OAAO,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACxE,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAC3C,IAAI,GAAG,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IAC9E,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,cAAc,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,UAAU,CAAC,YAAoB;IACtC,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;QAC/E,MAAM,IAAI,KAAK,CAAC,uCAAuC,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,OAAO,CAAC,YAAoB;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,SAAS,CAAC,CAAC;AACxD,CAAC;AAED,KAAK,UAAU,SAAS,CAAC,YAAoB;IAC3C,MAAM,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,KAAK,UAAU,IAAI,CAAC,YAAoB;IACtC,MAAM,SAAS,CAAC,YAAY,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;IAC/C,EAAE,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;IACnC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;IAClC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;IAC/B,WAAW,CAAC,EAAE,CAAC,CAAC;IAChB,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,MAAM,CAAI,YAAoB,EAAE,EAAgC;IACvE,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;QACpC,IAAI,CAAC;YAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;gBACd,CAAC;YAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAAC,CAAC;IACzB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,EAAqB;IACxC,iFAAiF;IACjF,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDP,CAAC,CAAC;AACL,CAAC;AAOD,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,YAAoB,EAAE,KAAkB;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC3D,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACnC,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CACvB,0FAA0F,CAC3F,CAAC;QACF,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;;GAkBtB,CAAC,CAAC;QACH,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,IAAiB,EAAE,EAAE;YAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAChE,IAAI,KAAK;oBAAE,OAAO,EAAE,CAAC;;oBAAM,QAAQ,EAAE,CAAC;gBACtC,GAAG,CAAC,GAAG,CAAC;oBACN,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY;oBACrC,EAAE,EAAW,CAAC,CAAC,EAAE;oBACjB,IAAI,EAAS,CAAC,CAAC,IAAI;oBACnB,IAAI,EAAS,CAAC,CAAC,IAAI;oBACnB,OAAO,EAAM,CAAC,CAAC,OAAO,IAAI,IAAI;oBAC9B,MAAM,EAAO,CAAC,CAAC,MAAM;oBACrB,OAAO,EAAM,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;oBACpC,MAAM,EAAS,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC;oBAC7C,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa,IAAI,EAAE,CAAC;oBACpD,WAAW,EAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,IAAI,EAAE,CAAC;oBAClD,UAAU,EAAG,CAAC,CAAC,UAAU;oBACzB,MAAM,EAAO,CAAC,CAAC,MAAM;oBACrB,QAAQ,EAAK,CAAC,CAAC,QAAQ;oBACvB,UAAU,EAAG,CAAC,CAAC,UAAU;iBAC1B,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,KAAK,CAAC,CAAC;QACV,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,YAAoB,EAAE,KAAkB;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC3D,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACnC,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CACvB,0FAA0F,CAC3F,CAAC;QACF,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;GAUtB,CAAC,CAAC;QACH,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,IAAiB,EAAE,EAAE;YAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAChE,IAAI,KAAK;oBAAE,OAAO,EAAE,CAAC;;oBAAM,QAAQ,EAAE,CAAC;gBACtC,GAAG,CAAC,GAAG,CAAC;oBACN,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY;oBACrC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK;oBACpD,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,UAAU;iBAC1D,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,KAAK,CAAC,CAAC;QACV,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC;AAYD,MAAM,SAAS,GAA2B,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AAE/E,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,YAAoB,EAAE,CAAgB;IACvE,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACnC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,sBAAsB,CAAC;QAChD,MAAM,MAAM,GAAa,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACjE,MAAM,MAAM,GAAc,CAAC,iBAAiB,EAAE,YAAY,CAAC,CAAC;QAC5D,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAClE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,uEAAuE,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,2CAA2C,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;cAChE,gDAAgD,CACnD,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,GAAG,CAAC,CAAiB,CAAC,CAAG,0CAA0C;QACzF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,cAAc,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAgB,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK;gBAAE,SAAS;YACrD,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACjC,CAAC;QACD,OAAO,GAAG,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,YAAoB,EAAE,EAAU;IAC5D,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACjC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAClB,0FAA0F,CAC3F,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,EAAE,CAA2B,CAAC;QACrE,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,YAAoB,EAAE,OAAe;IACvE,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,+FAA+F,CAChG,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,OAAO,CAAiB,CAAC;QAChE,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;oEAGoE;AACpE,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,YAAoB;IACrD,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,+EAA+E,CAChF,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAAiB,CAAC;QACvD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,YAAoB;IAClD,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACjC,MAAM,UAAU,GAAI,EAAE,CAAC,OAAO,CAC5B,2FAA2F,CAC5F,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAAmB,CAAC,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAI,EAAE,CAAC,OAAO,CAC5B,2FAA2F,CAC5F,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAAmB,CAAC,CAAC,CAAC;QAC3D,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAC7B,+GAA+G,CAChH,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAA8C,CAAC;QACpF,MAAM,OAAO,GAAkC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACpG,KAAK,MAAM,CAAC,IAAI,YAAY;YAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,IAAI,GAAI,EAAE,CAAC,OAAO,CACtB,kGAAkG,CACnG,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAA0B,CAAC,CAAC,CAAC;QAClE,OAAO;YACL,WAAW,EAAG,iBAAiB;YAC/B,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO;YAC7C,YAAY,EAAE,IAAI;SACnB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;oEAIoE;AACpE,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,YAAoB;IAC3D,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE;QACjC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOpB,CAAC,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,iBAAiB,EAAE,YAAY,CAAC,CAAC;QAC1G,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,wDAAwD;AACxD,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,YAAoB;IACpD,IAAI,CAAC;QAAC,MAAM,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;IAAC,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpE,MAAM,IAAI,GAAG,GAAG,YAAY,KAAK,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,CAAE,GAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QACrG,IAAI,IAAI,KAAK,QAAQ;YAAE,MAAM,GAAG,CAAC;IACnC,CAAC;IACD;qEACiE;IACjE,KAAK,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC;YAAC,MAAM,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAgBD,SAAS,SAAS,CAAC,CAAa;IAC9B,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI;QACpC,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpD,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO;QACpC,MAAM,EAAS,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAChC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC;QACvC,WAAW,EAAI,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC;QACrC,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM;QAC1C,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAa;IAC9B,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK;QAC1D,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU;KAC7D,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAAC,CAAC;IAChH,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACtB,CAAC;AAED;;mCAEmC;AACnC,MAAM,UAAU,gBAAgB,KAAuB,CAAC"}

package/dist/semantic_graph/types.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Yujin Forge -- semantic graph local types.
+ *
+ * Mirrors the D1 schema in
+ *   packages/hito4-server/sql/0009_semantic_graph.sql
+ * field-for-field. Both stores hold the SAME shape; the local store
+ * is the new default (BYOK / offline-first) + the worker store is
+ * the opt-in sync target (graph sync --on).
+ *
+ * Per Pablo (2026-06-07): "el semantic graph es por proyecto. Cambio
+ * de proyecto, redescubro el grafo." Switch project = new DB file.
+ *
+ * ASCII-only.
+ */
+export type GraphNodeKind = 'library' | 'protocol' | 'component' | 'module';
+export type GraphEdgeKind = 'uses' | 'depends_on' | 'replaces' | 'implements' | 'solved_by';
+export type GraphConfidence = 'verified' | 'auto' | 'claimed';
+export interface GraphNode {
+    /** Stable id within (user_handle, project_slug). Example: 'lib:react@19', 'protocol:nac3' */
+    id: string;
+    kind: GraphNodeKind;
+    name: string;
+    version?: string;
+    /** Where the node came from. 'package.json' | 'manual' | 'llm-claim' | 'ast' | 'npm-registry' */
+    source: string;
+    /** <= 200 chars; trimmed by the store. */
+    purpose: string;
+    /** Imperative tags this node "solves". */
+    solves: string[];
+    /** Imperative DO-NOT-INVENT statements rendered into the system prompt. */
+    do_not_invent: string[];
+    /** Entry-point strings ("import { X } from 'pkg'", "tag:<nac3-foo>", etc.). */
+    api_surface: string[];
+    confidence: GraphConfidence;
+    /** [0..1] -- higher = more reliable / load-bearing. */
+    weight: number;
+    added_at: string;
+    updated_at: string;
+}
+export interface GraphEdge {
+    id: string;
+    kind: GraphEdgeKind;
+    from_id: string;
+    to_id: string;
+    weight: number;
+    source: string;
+    created_at: string;
+}
+export interface GraphSummary {
+    user_handle: string;
+    project_slug: string;
+    node_count: number;
+    edge_count: number;
+    by_kind: Record<GraphNodeKind, number>;
+    last_updated: string | null;
+}
+/** Default cap for a single relevance query (mirrors HITO4 behaviour). */
+export declare const RELEVANT_DEFAULT_LIMIT = 20;
+//# sourceMappingURL=types.d.ts.map

package/dist/semantic_graph/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/semantic_graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ,CAAC;AAE5E,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,YAAY,GAAG,UAAU,GAAG,YAAY,GAAG,WAAW,CAAC;AAE5F,MAAM,MAAM,eAAe,GAAG,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;AAE9D,MAAM,WAAW,SAAS;IACxB,6FAA6F;IAC7F,EAAE,EAAa,MAAM,CAAC;IACtB,IAAI,EAAW,aAAa,CAAC;IAC7B,IAAI,EAAW,MAAM,CAAC;IACtB,OAAO,CAAC,EAAO,MAAM,CAAC;IACtB,iGAAiG;IACjG,MAAM,EAAS,MAAM,CAAC;IACtB,0CAA0C;IAC1C,OAAO,EAAQ,MAAM,CAAC;IACtB,0CAA0C;IAC1C,MAAM,EAAS,MAAM,EAAE,CAAC;IACxB,2EAA2E;IAC3E,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,+EAA+E;IAC/E,WAAW,EAAI,MAAM,EAAE,CAAC;IACxB,UAAU,EAAK,eAAe,CAAC;IAC/B,uDAAuD;IACvD,MAAM,EAAS,MAAM,CAAC;IACtB,QAAQ,EAAO,MAAM,CAAC;IACtB,UAAU,EAAK,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAU,MAAM,CAAC;IACnB,IAAI,EAAQ,aAAa,CAAC;IAC1B,OAAO,EAAK,MAAM,CAAC;IACnB,KAAK,EAAO,MAAM,CAAC;IACnB,MAAM,EAAM,MAAM,CAAC;IACnB,MAAM,EAAM,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAG,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAI,MAAM,CAAC;IACrB,UAAU,EAAI,MAAM,CAAC;IACrB,OAAO,EAAO,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IAC5C,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED,0EAA0E;AAC1E,eAAO,MAAM,sBAAsB,KAAK,CAAC"}

package/dist/semantic_graph/types.js

@@ -0,0 +1,17 @@
+/**
+ * Yujin Forge -- semantic graph local types.
+ *
+ * Mirrors the D1 schema in
+ *   packages/hito4-server/sql/0009_semantic_graph.sql
+ * field-for-field. Both stores hold the SAME shape; the local store
+ * is the new default (BYOK / offline-first) + the worker store is
+ * the opt-in sync target (graph sync --on).
+ *
+ * Per Pablo (2026-06-07): "el semantic graph es por proyecto. Cambio
+ * de proyecto, redescubro el grafo." Switch project = new DB file.
+ *
+ * ASCII-only.
+ */
+/** Default cap for a single relevance query (mirrors HITO4 behaviour). */
+export const RELEVANT_DEFAULT_LIMIT = 20;
+//# sourceMappingURL=types.js.map

package/dist/semantic_graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/semantic_graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAkDH,0EAA0E;AAC1E,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC"}

package/dist/support/github_dispatcher.d.ts

@@ -0,0 +1,36 @@
+import { type SupportReport } from './reports.js';
+/** Hash a report into a stable fingerprint so re-occurrences
+ *  cluster. Uses message + first two non-empty stack lines. */
+export declare function fingerprintReport(r: SupportReport): string;
+export interface DispatchOptions {
+    /** Owner/repo slug, e.g. "yujinapp/yujin-forge". Inferred from
+     *  git remote when omitted. */
+    repo_slug?: string;
+    /** Limit how many fingerprints to push in a single run (rate
+     *  limiting). Default 10. */
+    max_fingerprints_per_run?: number;
+    /** Dry-run: build payloads but do not call gh. Returns the
+     *  payloads for inspection. */
+    dry_run?: boolean;
+}
+export interface DispatchResult {
+    ok: boolean;
+    opened: Array<{
+        fingerprint: string;
+        issue_number: number;
+        title: string;
+    }>;
+    commented: Array<{
+        fingerprint: string;
+        issue_number: number;
+        new_occurrences: number;
+    }>;
+    skipped_no_gh: boolean;
+    dry_run: boolean;
+    cursor_advanced_to: string;
+    errors: string[];
+}
+/** Main entry point. Walks reports, dedups by fingerprint, opens
+ *  / comments on GitHub. */
+export declare function dispatchSupportReportsToGithub(opts?: DispatchOptions): Promise<DispatchResult>;
+//# sourceMappingURL=github_dispatcher.d.ts.map

package/dist/support/github_dispatcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"github_dispatcher.d.ts","sourceRoot":"","sources":["../../src/support/github_dispatcher.ts"],"names":[],"mappings":"AA6BA,OAAO,EAAe,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAmC/D;+DAC+D;AAC/D,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAI1D;AAkFD,MAAM,WAAW,eAAe;IAC9B;mCAC+B;IAC/B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;iCAC6B;IAC7B,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC;mCAC+B;IAC/B,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,OAAO,CAAC;IACZ,MAAM,EAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC5E,SAAS,EAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACzF,aAAa,EAAE,OAAO,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAuBD;4BAC4B;AAC5B,wBAAsB,8BAA8B,CAAC,IAAI,GAAE,eAAoB,GAAG,OAAO,CAAC,cAAc,CAAC,CA6HxG"}