@mneme-ai/core 2.24.0 → 2.25.0

package/dist/codegraph/drift.js

@@ -0,0 +1,126 @@
+/**
+ * v2.25.0 — Drift sentinel for LIVING SOUL codegraph.
+ *
+ * Compares the persisted snapshot against the current working tree and
+ * emits one DriftEvent per broken edge:
+ *   - file deleted (src or dst missing)
+ *   - file renamed (symbol moved to another path)
+ *   - edge stale (file mtime > builtAt by > N hours)
+ *
+ * Pure-IO; no daemon required. The daemon can call this on every tick
+ * + fan-out severity ≥ "high" events to the notifier so the user gets
+ * a heads-up before the AI starts editing the wrong file.
+ */
+import { existsSync, statSync } from "node:fs";
+import { resolve } from "node:path";
+import { recordDrift } from "./store.js";
+const STALE_HOURS = 24;
+/** Scan the graph against the current working tree. */
+export function detectDrift(graph, opts = {}) {
+    const events = [];
+    const now = Date.now();
+    const builtAtMs = Date.parse(graph.builtAt);
+    const staleThreshold = STALE_HOURS * 3600 * 1000;
+    // Cache file existence + mtime
+    const fileMeta = new Map();
+    function fileOf(path) {
+        let m = fileMeta.get(path);
+        if (m)
+            return m;
+        const abs = resolve(graph.repoRoot, path);
+        if (!existsSync(abs)) {
+            m = { exists: false, mtime: 0 };
+        }
+        else {
+            try {
+                const st = statSync(abs);
+                m = { exists: true, mtime: st.mtimeMs };
+            }
+            catch {
+                m = { exists: false, mtime: 0 };
+            }
+        }
+        fileMeta.set(path, m);
+        return m;
+    }
+    let brokenEdges = 0;
+    let staleEdges = 0;
+    let missingFiles = 0;
+    const missingPathSet = new Set();
+    for (const edge of graph.edges.values()) {
+        const src = graph.nodes.get(edge.src);
+        const dst = graph.nodes.get(edge.dst);
+        if (!src || !dst)
+            continue;
+        // Skip edges to external deps; we can't trivially check existence.
+        if (dst.kind !== "external") {
+            const dstMeta = fileOf(dst.path);
+            if (!dstMeta.exists) {
+                brokenEdges++;
+                if (!missingPathSet.has(dst.path)) {
+                    missingFiles++;
+                    missingPathSet.add(dst.path);
+                }
+                const ev = {
+                    at: new Date().toISOString(),
+                    edgeId: edge.id,
+                    kind: edge.kind === "imports" ? "dst-missing" : "file-deleted",
+                    reason: `dst file ${dst.path} no longer exists (edge.kind=${edge.kind})`,
+                    severity: edge.kind === "imports" ? "high" : "medium",
+                };
+                events.push(ev);
+                continue;
+            }
+        }
+        const srcMeta = fileOf(src.path);
+        if (!srcMeta.exists) {
+            brokenEdges++;
+            if (!missingPathSet.has(src.path)) {
+                missingFiles++;
+                missingPathSet.add(src.path);
+            }
+            events.push({
+                at: new Date().toISOString(),
+                edgeId: edge.id,
+                kind: "src-missing",
+                reason: `src file ${src.path} no longer exists`,
+                severity: "high",
+            });
+            continue;
+        }
+        // Edge-stale check (only flag if mtime > builtAt by > 24h)
+        if (now - builtAtMs > staleThreshold && srcMeta.mtime > builtAtMs + staleThreshold) {
+            staleEdges++;
+            events.push({
+                at: new Date().toISOString(),
+                edgeId: edge.id,
+                kind: "edge-stale",
+                reason: `src file ${src.path} changed > ${STALE_HOURS}h after graph was built`,
+                severity: "low",
+            });
+        }
+    }
+    if (opts.record) {
+        for (const ev of events)
+            recordDrift(graph.repoRoot, ev);
+    }
+    return { events, brokenEdges, staleEdges, missingFiles };
+}
+/** Filter edges that would BREAK if a file is renamed/deleted. */
+export function edgesTouchedBy(graph, paths) {
+    const pathSet = new Set(paths.map((p) => p.replace(/\\/g, "/")));
+    const out = [];
+    for (const e of graph.edges.values()) {
+        const s = graph.nodes.get(e.src);
+        const d = graph.nodes.get(e.dst);
+        if (s && pathSet.has(s.path)) {
+            out.push(e);
+            continue;
+        }
+        if (d && pathSet.has(d.path)) {
+            out.push(e);
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=drift.js.map

package/dist/codegraph/drift.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drift.js","sourceRoot":"","sources":["../../src/codegraph/drift.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGpC,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,MAAM,WAAW,GAAG,EAAE,CAAC;AASvB,uDAAuD;AACvD,MAAM,UAAU,WAAW,CAAC,KAAgB,EAAE,OAA6B,EAAE;IAC3E,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,cAAc,GAAG,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC;IAEjD,+BAA+B;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8C,CAAC;IACvE,SAAS,MAAM,CAAC,IAAY;QAC1B,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAChB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACzB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1C,CAAC;YAAC,MAAM,CAAC;gBAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAAC,CAAC;QAC9C,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACtB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;YAAE,SAAS;QAE3B,mEAAmE;QACnE,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;gBACpB,WAAW,EAAE,CAAC;gBACd,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAC,YAAY,EAAE,CAAC;oBAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAAC,CAAC;gBACpF,MAAM,EAAE,GAAe;oBACrB,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;oBAC5B,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc;oBAC9D,MAAM,EAAE,YAAY,GAAG,CAAC,IAAI,gCAAgC,IAAI,CAAC,IAAI,GAAG;oBACxE,QAAQ,EAAE,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;iBACtD,CAAC;gBACF,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChB,SAAS;YACX,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACpB,WAAW,EAAE,CAAC;YACd,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAC,YAAY,EAAE,CAAC;gBAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAAC,CAAC;YACpF,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAC5B,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI,EAAE,aAAa;gBACnB,MAAM,EAAE,YAAY,GAAG,CAAC,IAAI,mBAAmB;gBAC/C,QAAQ,EAAE,MAAM;aACjB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,2DAA2D;QAC3D,IAAI,GAAG,GAAG,SAAS,GAAG,cAAc,IAAI,OAAO,CAAC,KAAK,GAAG,SAAS,GAAG,cAAc,EAAE,CAAC;YACnF,UAAU,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAC5B,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI,EAAE,YAAY;gBAClB,MAAM,EAAE,YAAY,GAAG,CAAC,IAAI,cAAc,WAAW,yBAAyB;gBAC9E,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,MAAM;YAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC;AAC3D,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,cAAc,CAAC,KAAgB,EAAE,KAAe;IAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACxD,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAChD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/codegraph/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * v2.25.0 — LIVING SOUL CODEGRAPH public surface.
+ */
+export * from "./types.js";
+export { buildGraph, graphSignature } from "./builder.js";
+export { writeSnapshot, readSnapshot, chainEdges, verifyChain, recordDrift, readDriftEvents, } from "./store.js";
+export { merkleRoot, leafHash, rootsMatch, __EMPTY_ROOT_SENTINEL } from "./merkle.js";
+export { query, neighbours, markVaccineWarning } from "./query.js";
+export { detectDrift, edgesTouchedBy } from "./drift.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/codegraph/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EACL,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EACpD,WAAW,EAAE,eAAe,GAC7B,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACtF,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC"}

package/dist/codegraph/index.js

@@ -0,0 +1,10 @@
+/**
+ * v2.25.0 — LIVING SOUL CODEGRAPH public surface.
+ */
+export * from "./types.js";
+export { buildGraph, graphSignature } from "./builder.js";
+export { writeSnapshot, readSnapshot, chainEdges, verifyChain, recordDrift, readDriftEvents, } from "./store.js";
+export { merkleRoot, leafHash, rootsMatch, __EMPTY_ROOT_SENTINEL } from "./merkle.js";
+export { query, neighbours, markVaccineWarning } from "./query.js";
+export { detectDrift, edgesTouchedBy } from "./drift.js";
+//# sourceMappingURL=index.js.map

package/dist/codegraph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/codegraph/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EACL,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EACpD,WAAW,EAAE,eAAe,GAC7B,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACtF,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC"}

package/dist/codegraph/merkle.d.ts

@@ -0,0 +1,40 @@
+/**
+ * v2.25.0 — Merkle root over the LIVING SOUL codegraph.
+ *
+ * Why: CodeGraph (the competitor) requires full re-index per machine.
+ * Mneme stores each edge with an HMAC link, then builds a Merkle tree
+ * over the canonical edge list. Two machines compare their root (32
+ * bytes); identical → graphs match without transmitting the full graph.
+ * Different → drill down via tree level until you find the divergent
+ * subtree. Cross-machine sync cost ≈ O(log N) instead of O(N).
+ *
+ * The tree is binary; leaves are SHA-256 of canonical edge JSON; inner
+ * nodes are SHA-256 of left || right concatenated. Empty graphs return
+ * a fixed sentinel hash.
+ */
+import type { CodeEdge } from "./types.js";
+/** Leaf hash for one edge (canonical JSON, sha256).
+ *
+ * Strips:
+ *   - hmac      — chain-position; varies per-position even with same content
+ *   - lastSeen  — wall-clock; varies across rebuilds of same structure
+ *
+ * So the leaf hash represents the STRUCTURAL identity of the edge
+ * (src, dst, kind, confidence, vendor attribution, vaccine warnings) —
+ * not the snapshot timestamp. This makes the Merkle root deterministic
+ * across rebuilds (and across machines for the same commit). */
+export declare function leafHash(edge: CodeEdge): string;
+/** Compute the Merkle root over a sorted edge list. */
+export declare function merkleRoot(edges: CodeEdge[]): string;
+/**
+ * Compare two Merkle roots. Identical roots = identical edge sets.
+ * Different roots = at least one edge differs.
+ *
+ * For partial-sync diagnostics, callers can drill into subtrees by
+ * exchanging the layer-1 hashes; this primitive returns the top-level
+ * verdict only.
+ */
+export declare function rootsMatch(a: string, b: string): boolean;
+/** Test-only sentinel. */
+export declare const __EMPTY_ROOT_SENTINEL: string;
+//# sourceMappingURL=merkle.d.ts.map

package/dist/codegraph/merkle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merkle.d.ts","sourceRoot":"","sources":["../../src/codegraph/merkle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAS3C;;;;;;;;;gEASgE;AAChE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAI/C;AAED,uDAAuD;AACvD,wBAAgB,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAepD;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAExD;AAED,0BAA0B;AAC1B,eAAO,MAAM,qBAAqB,QAAa,CAAC"}

package/dist/codegraph/merkle.js

@@ -0,0 +1,68 @@
+/**
+ * v2.25.0 — Merkle root over the LIVING SOUL codegraph.
+ *
+ * Why: CodeGraph (the competitor) requires full re-index per machine.
+ * Mneme stores each edge with an HMAC link, then builds a Merkle tree
+ * over the canonical edge list. Two machines compare their root (32
+ * bytes); identical → graphs match without transmitting the full graph.
+ * Different → drill down via tree level until you find the divergent
+ * subtree. Cross-machine sync cost ≈ O(log N) instead of O(N).
+ *
+ * The tree is binary; leaves are SHA-256 of canonical edge JSON; inner
+ * nodes are SHA-256 of left || right concatenated. Empty graphs return
+ * a fixed sentinel hash.
+ */
+import { createHash } from "node:crypto";
+import { canon } from "./types.js";
+const EMPTY_ROOT = "e".repeat(64);
+function sha(buf) {
+    return createHash("sha256").update(buf).digest("hex");
+}
+/** Leaf hash for one edge (canonical JSON, sha256).
+ *
+ * Strips:
+ *   - hmac      — chain-position; varies per-position even with same content
+ *   - lastSeen  — wall-clock; varies across rebuilds of same structure
+ *
+ * So the leaf hash represents the STRUCTURAL identity of the edge
+ * (src, dst, kind, confidence, vendor attribution, vaccine warnings) —
+ * not the snapshot timestamp. This makes the Merkle root deterministic
+ * across rebuilds (and across machines for the same commit). */
+export function leafHash(edge) {
+    const { hmac: _h, lastSeen: _t, ...stable } = edge;
+    void _h;
+    void _t;
+    return sha(canon(stable));
+}
+/** Compute the Merkle root over a sorted edge list. */
+export function merkleRoot(edges) {
+    if (edges.length === 0)
+        return EMPTY_ROOT;
+    // Sort by id for deterministic ordering across machines.
+    const sorted = [...edges].sort((a, b) => a.id.localeCompare(b.id));
+    let layer = sorted.map(leafHash);
+    while (layer.length > 1) {
+        const next = [];
+        for (let i = 0; i < layer.length; i += 2) {
+            const left = layer[i];
+            const right = i + 1 < layer.length ? layer[i + 1] : left; // duplicate last for odd count
+            next.push(sha(left + right));
+        }
+        layer = next;
+    }
+    return layer[0];
+}
+/**
+ * Compare two Merkle roots. Identical roots = identical edge sets.
+ * Different roots = at least one edge differs.
+ *
+ * For partial-sync diagnostics, callers can drill into subtrees by
+ * exchanging the layer-1 hashes; this primitive returns the top-level
+ * verdict only.
+ */
+export function rootsMatch(a, b) {
+    return a === b && a !== EMPTY_ROOT;
+}
+/** Test-only sentinel. */
+export const __EMPTY_ROOT_SENTINEL = EMPTY_ROOT;
+//# sourceMappingURL=merkle.js.map

package/dist/codegraph/merkle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merkle.js","sourceRoot":"","sources":["../../src/codegraph/merkle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAElC,SAAS,GAAG,CAAC,GAAW;IACtB,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;;;;gEASgE;AAChE,MAAM,UAAU,QAAQ,CAAC,IAAc;IACrC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC;IACnD,KAAK,EAAE,CAAC;IAAC,KAAK,EAAE,CAAC;IACjB,OAAO,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,UAAU,CAAC,KAAiB;IAC1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IAC1C,yDAAyD;IACzD,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,+BAA+B;YAC1F,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,KAAK,GAAG,IAAI,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC;AACrC,CAAC;AAED,0BAA0B;AAC1B,MAAM,CAAC,MAAM,qBAAqB,GAAG,UAAU,CAAC"}

package/dist/codegraph/query.d.ts

@@ -0,0 +1,14 @@
+/**
+ * v2.25.0 — Query API for LIVING SOUL codegraph.
+ */
+import type { CodeGraph, CodeEdge, CodeNode, QueryOptions, QueryResult } from "./types.js";
+export declare function query(graph: CodeGraph, opts: QueryOptions): QueryResult;
+/** Find all incoming and outgoing edges for a node. */
+export declare function neighbours(graph: CodeGraph, nodeId: string): {
+    incoming: CodeEdge[];
+    outgoing: CodeEdge[];
+    node: CodeNode | null;
+};
+/** Mark an edge as a vaccine warning (e.g. an AI hallucinated this edge). */
+export declare function markVaccineWarning(graph: CodeGraph, edgeId: string, reason: string): boolean;
+//# sourceMappingURL=query.d.ts.map

package/dist/codegraph/query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../../src/codegraph/query.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE3F,wBAAgB,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,GAAG,WAAW,CA8BvE;AAED,uDAAuD;AACvD,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG;IAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAA;CAAE,CASlI;AAED,6EAA6E;AAC7E,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAM5F"}

package/dist/codegraph/query.js

@@ -0,0 +1,56 @@
+/**
+ * v2.25.0 — Query API for LIVING SOUL codegraph.
+ */
+export function query(graph, opts) {
+    let nodes = [...graph.nodes.values()];
+    let edges = [...graph.edges.values()];
+    if (opts.kind)
+        nodes = nodes.filter((n) => n.kind === opts.kind);
+    if (opts.pathContains) {
+        const p = opts.pathContains;
+        nodes = nodes.filter((n) => n.path.includes(p));
+    }
+    if (opts.symbol) {
+        const s = opts.symbol;
+        nodes = nodes.filter((n) => (n.symbol ?? "").toLowerCase().includes(s.toLowerCase()));
+    }
+    if (opts.srcIds) {
+        const set = new Set(opts.srcIds);
+        edges = edges.filter((e) => set.has(e.src));
+    }
+    if (opts.dstIds) {
+        const set = new Set(opts.dstIds);
+        edges = edges.filter((e) => set.has(e.dst));
+    }
+    if (opts.edgeKinds) {
+        const set = new Set(opts.edgeKinds);
+        edges = edges.filter((e) => set.has(e.kind));
+    }
+    if (opts.warningsOnly) {
+        edges = edges.filter((e) => e.vaccineWarning === true);
+    }
+    return { nodes, edges };
+}
+/** Find all incoming and outgoing edges for a node. */
+export function neighbours(graph, nodeId) {
+    const node = graph.nodes.get(nodeId) ?? null;
+    const incoming = [];
+    const outgoing = [];
+    for (const e of graph.edges.values()) {
+        if (e.dst === nodeId)
+            incoming.push(e);
+        if (e.src === nodeId)
+            outgoing.push(e);
+    }
+    return { node, incoming, outgoing };
+}
+/** Mark an edge as a vaccine warning (e.g. an AI hallucinated this edge). */
+export function markVaccineWarning(graph, edgeId, reason) {
+    const e = graph.edges.get(edgeId);
+    if (!e)
+        return false;
+    e.vaccineWarning = true;
+    e.warningReason = reason;
+    return true;
+}
+//# sourceMappingURL=query.js.map

package/dist/codegraph/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/codegraph/query.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH,MAAM,UAAU,KAAK,CAAC,KAAgB,EAAE,IAAkB;IACxD,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAEtC,IAAI,IAAI,CAAC,IAAI;QAAE,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;IACjE,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;QAC5B,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACxF,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,IAAI,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,UAAU,CAAC,KAAgB,EAAE,MAAc;IACzD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IAC7C,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,CAAC,GAAG,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,GAAG,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AACtC,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,kBAAkB,CAAC,KAAgB,EAAE,MAAc,EAAE,MAAc;IACjF,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACrB,CAAC,CAAC,cAAc,GAAG,IAAI,CAAC;IACxB,CAAC,CAAC,aAAa,GAAG,MAAM,CAAC;IACzB,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/codegraph/store.d.ts

@@ -0,0 +1,37 @@
+/**
+ * v2.25.0 — HMAC-chained storage for LIVING SOUL codegraph.
+ *
+ * Every edge gets an `hmac` field linking it to the previous edge in
+ * append order. Tampering with ANY edge (deleting / modifying /
+ * inserting) breaks the chain at that point. Receivers verify by
+ * re-deriving the chain from the canonical edge bodies.
+ *
+ * Storage layout:
+ *   .mneme/codegraph/
+ *     nodes.jsonl       — append-only nodes
+ *     edges.jsonl       — append-only HMAC-chained edges
+ *     state.json        — { commit, builtAt, merkleRoot, stats }
+ *     drift.jsonl       — append-only drift events
+ */
+import type { CodeEdge, CodeGraph, DriftEvent } from "./types.js";
+/** Build HMAC-chained edges in-place — sets edge.hmac. */
+export declare function chainEdges(edges: CodeEdge[]): void;
+/** Verify the chain integrity of an edge list. */
+export declare function verifyChain(edges: CodeEdge[]): {
+    ok: true;
+} | {
+    ok: false;
+    firstBadIdx: number;
+    reason: string;
+};
+/** Write a full snapshot atomically. */
+export declare function writeSnapshot(repoRoot: string, graph: CodeGraph): {
+    dir: string;
+};
+/** Read the persisted snapshot. Returns null if no graph has been built. */
+export declare function readSnapshot(repoRoot: string): CodeGraph | null;
+/** Append a drift event to the ledger. */
+export declare function recordDrift(repoRoot: string, event: DriftEvent): void;
+/** Read recent drift events. */
+export declare function readDriftEvents(repoRoot: string, limit?: number): DriftEvent[];
+//# sourceMappingURL=store.d.ts.map

package/dist/codegraph/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/codegraph/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AASH,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAY,UAAU,EAAE,MAAM,YAAY,CAAC;AAqB5E,0DAA0D;AAC1D,wBAAgB,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAQlD;AAED,kDAAkD;AAClD,wBAAgB,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAYhH;AAED,wCAAwC;AACxC,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,GAAG;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,CAiBjF;AAED,4EAA4E;AAC5E,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CA+B/D;AAED,0CAA0C;AAC1C,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAGrE;AAED,gCAAgC;AAChC,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,UAAU,EAAE,CAU1E"}

package/dist/codegraph/store.js

@@ -0,0 +1,133 @@
+/**
+ * v2.25.0 — HMAC-chained storage for LIVING SOUL codegraph.
+ *
+ * Every edge gets an `hmac` field linking it to the previous edge in
+ * append order. Tampering with ANY edge (deleting / modifying /
+ * inserting) breaks the chain at that point. Receivers verify by
+ * re-deriving the chain from the canonical edge bodies.
+ *
+ * Storage layout:
+ *   .mneme/codegraph/
+ *     nodes.jsonl       — append-only nodes
+ *     edges.jsonl       — append-only HMAC-chained edges
+ *     state.json        — { commit, builtAt, merkleRoot, stats }
+ *     drift.jsonl       — append-only drift events
+ */
+import { existsSync, mkdirSync, writeFileSync, readFileSync, appendFileSync, } from "node:fs";
+import { join } from "node:path";
+import { createHmac } from "node:crypto";
+import { canon } from "./types.js";
+const HMAC_KEY = process.env["MNEME_CODEGRAPH_KEY"] ?? "mneme-codegraph-v1";
+const CHAIN_SEED = "0".repeat(64);
+function dirOf(repoRoot) {
+    return join(repoRoot, ".mneme", "codegraph");
+}
+function ensureDir(repoRoot) {
+    const d = dirOf(repoRoot);
+    if (!existsSync(d))
+        mkdirSync(d, { recursive: true });
+    return d;
+}
+/** Compute the next chain link. */
+function nextLink(prev, body) {
+    return createHmac("sha256", HMAC_KEY).update(prev + "|" + canon(body)).digest("hex").slice(0, 32);
+}
+/** Build HMAC-chained edges in-place — sets edge.hmac. */
+export function chainEdges(edges) {
+    let prev = CHAIN_SEED;
+    for (const e of edges) {
+        const { hmac: _h, ...stable } = e;
+        void _h;
+        prev = nextLink(prev, stable);
+        e.hmac = prev;
+    }
+}
+/** Verify the chain integrity of an edge list. */
+export function verifyChain(edges) {
+    let prev = CHAIN_SEED;
+    for (let i = 0; i < edges.length; i++) {
+        const e = edges[i];
+        const { hmac, ...stable } = e;
+        const expected = nextLink(prev, stable);
+        if (expected !== hmac) {
+            return { ok: false, firstBadIdx: i, reason: `chain break at index ${i}: edge.id=${e.id}` };
+        }
+        prev = hmac;
+    }
+    return { ok: true };
+}
+/** Write a full snapshot atomically. */
+export function writeSnapshot(repoRoot, graph) {
+    const d = ensureDir(repoRoot);
+    const nodes = [...graph.nodes.values()];
+    const edges = [...graph.edges.values()];
+    // edges must be chained before write
+    // (the builder is expected to have done this already; we re-chain to be safe)
+    chainEdges(edges);
+    writeFileSync(join(d, "nodes.jsonl"), nodes.map((n) => JSON.stringify(n)).join("\n") + (nodes.length ? "\n" : ""));
+    writeFileSync(join(d, "edges.jsonl"), edges.map((e) => JSON.stringify(e)).join("\n") + (edges.length ? "\n" : ""));
+    writeFileSync(join(d, "state.json"), JSON.stringify({
+        repoRoot: graph.repoRoot,
+        commit: graph.commit,
+        builtAt: graph.builtAt,
+        merkleRoot: graph.merkleRoot,
+        stats: graph.stats,
+    }, null, 2) + "\n");
+    return { dir: d };
+}
+/** Read the persisted snapshot. Returns null if no graph has been built. */
+export function readSnapshot(repoRoot) {
+    const d = dirOf(repoRoot);
+    if (!existsSync(join(d, "state.json")))
+        return null;
+    const state = JSON.parse(readFileSync(join(d, "state.json"), "utf8"));
+    const nodesRaw = existsSync(join(d, "nodes.jsonl")) ? readFileSync(join(d, "nodes.jsonl"), "utf8").split("\n").filter(Boolean) : [];
+    const edgesRaw = existsSync(join(d, "edges.jsonl")) ? readFileSync(join(d, "edges.jsonl"), "utf8").split("\n").filter(Boolean) : [];
+    const nodes = new Map();
+    for (const line of nodesRaw) {
+        try {
+            const n = JSON.parse(line);
+            nodes.set(n.id, n);
+        }
+        catch { /* skip malformed */ }
+    }
+    const edges = new Map();
+    for (const line of edgesRaw) {
+        try {
+            const e = JSON.parse(line);
+            edges.set(e.id, e);
+        }
+        catch { /* skip */ }
+    }
+    return {
+        repoRoot,
+        commit: state.commit,
+        builtAt: state.builtAt,
+        nodes,
+        edges,
+        merkleRoot: state.merkleRoot,
+        stats: state.stats,
+    };
+}
+/** Append a drift event to the ledger. */
+export function recordDrift(repoRoot, event) {
+    const d = ensureDir(repoRoot);
+    appendFileSync(join(d, "drift.jsonl"), JSON.stringify(event) + "\n");
+}
+/** Read recent drift events. */
+export function readDriftEvents(repoRoot, limit = 50) {
+    const d = dirOf(repoRoot);
+    const p = join(d, "drift.jsonl");
+    if (!existsSync(p))
+        return [];
+    const lines = readFileSync(p, "utf8").split("\n").filter(Boolean);
+    const out = [];
+    for (const l of lines.slice(-limit)) {
+        try {
+            out.push(JSON.parse(l));
+        }
+        catch { /* skip */ }
+    }
+    return out;
+}
+//# sourceMappingURL=store.js.map

package/dist/codegraph/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/codegraph/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EACL,UAAU,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAClD,cAAc,GACf,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,IAAI,oBAAoB,CAAC;AAC5E,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAElC,SAAS,KAAK,CAAC,QAAgB;IAC7B,OAAO,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,SAAS,CAAC,QAAgB;IACjC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1B,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,SAAS,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mCAAmC;AACnC,SAAS,QAAQ,CAAC,IAAY,EAAE,IAAa;IAC3C,OAAO,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACpG,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,UAAU,CAAC,KAAiB;IAC1C,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,CAAC,CAAC;QAClC,KAAK,EAAE,CAAC;QACR,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,WAAW,CAAC,KAAiB;IAC3C,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACxC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,wBAAwB,CAAC,aAAa,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;QAC7F,CAAC;QACD,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,KAAgB;IAC9D,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,qCAAqC;IACrC,8EAA8E;IAC9E,UAAU,CAAC,KAAK,CAAC,CAAC;IAClB,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnH,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnH,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC;QAClD,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;KACnB,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACpB,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AACpB,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,MAAM,CAAC,CAEnE,CAAC;IACF,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpI,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpI,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAa,CAAC;YACvC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC,CAAC,oBAAoB,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAa,CAAC;YACvC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;IACxB,CAAC;IACD,OAAO;QACL,QAAQ;QACR,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,KAAK;QACL,KAAK;QACL,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,WAAW,CAAC,QAAgB,EAAE,KAAiB;IAC7D,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC9B,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;AACvE,CAAC;AAED,gCAAgC;AAChC,MAAM,UAAU,eAAe,CAAC,QAAgB,EAAE,KAAK,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACjC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAe,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}