@descryy/core 0.1.0

package/dist/store/reader.js

@@ -0,0 +1,269 @@
+/**
+ * Reads over the stored graph.
+ *
+ * Deliberately thin. This is not the query layer (plan Step 9) — it is the row
+ * access the query layer will be written against, and nothing here knows about
+ * scoring, budgets or traversal. Keeping the split means the query layer can be
+ * tested against an in-memory adjacency provider with no database at all, which
+ * is what stops 95% of the engine's tests needing SQLite and a worker.
+ *
+ * No row from `driver/` reaches a caller unconverted: SQLite has no booleans, no
+ * null-vs-undefined distinction and no nested values, so every read here maps
+ * columns back into IR shapes rather than handing out raw rows.
+ */
+import { createHash } from "node:crypto";
+import { canonicalJson, isEdgeType, isNodeType, } from "@descryy/ir";
+import { DERIVED_TABLES, EARNED_TABLES } from "./schema.js";
+const NODE_COLUMNS = "id, type, name, file_path, start_line, end_line, language, produced_by, resolution, attrs";
+const EDGE_COLUMNS = "id, source, target, type, resolution, confidence, produced_by, observed_by_run, attrs";
+const UNRESOLVED_REF_COLUMNS = "from_node_id, edge_type, raw_target, file_path, line, produced_by, reason, attrs";
+function toNode(row) {
+    if (!isNodeType(row.type)) {
+        // Only reachable if something wrote around the Normaliser, which is exactly
+        // the case worth failing loudly on rather than coercing.
+        throw new Error(`stored node ${row.id} has an unknown type: ${row.type}`);
+    }
+    const type = row.type;
+    return {
+        id: row.id,
+        type,
+        name: row.name,
+        file: row.file_path,
+        range: row.start_line === null || row.end_line === null
+            ? null
+            : { startLine: row.start_line, endLine: row.end_line },
+        language: row.language,
+        producedBy: row.produced_by,
+        resolution: row.resolution,
+        attrs: JSON.parse(row.attrs),
+    };
+}
+function toEdge(row) {
+    if (!isEdgeType(row.type)) {
+        throw new Error(`stored edge ${row.id} has an unknown type: ${row.type}`);
+    }
+    const type = row.type;
+    return {
+        from: row.source,
+        to: row.target,
+        type,
+        resolution: row.resolution,
+        confidence: row.confidence,
+        producedBy: row.produced_by,
+        ...(row.observed_by_run === null ? {} : { observedByRun: row.observed_by_run }),
+        ...(row.attrs === null ? {} : { attrs: JSON.parse(row.attrs) }),
+    };
+}
+function toUnresolvedRef(row) {
+    if (!isEdgeType(row.edge_type)) {
+        throw new Error(`stored unresolved ref on ${row.from_node_id} has an unknown edge type: ${row.edge_type}`);
+    }
+    const edgeType = row.edge_type;
+    return {
+        fromNodeId: row.from_node_id,
+        edgeType,
+        rawTarget: row.raw_target,
+        file: row.file_path,
+        line: row.line,
+        producedBy: row.produced_by,
+        reason: row.reason,
+        ...(row.attrs === null ? {} : { attrs: JSON.parse(row.attrs) }),
+    };
+}
+export function getNode(driver, id) {
+    const row = driver.prepare(`SELECT ${NODE_COLUMNS} FROM nodes WHERE id = ?`).get(id);
+    return row === undefined ? undefined : toNode(row);
+}
+/**
+ * Every node declared in any of `paths` — the diff-to-seeds step.
+ *
+ * A diff names files; scoping seeds on nodes. Nothing bridged the two until now,
+ * because every measurement so far started from node ids it had just built.
+ *
+ * **Which files miss is as important as which nodes hit.** A path present in the
+ * diff and absent from the graph is not an empty result — it is a file the
+ * analysis never read, and reporting its blast radius as "nothing affected"
+ * would put an unanalysed file in §20.2's *confirmed clean* category when it
+ * belongs in *not analysable*. So the misses come back alongside the hits and
+ * the caller cannot take one without the other.
+ *
+ * Paths are matched exactly. They are repo-relative by the Normaliser's rule, so
+ * a caller passing absolute paths gets zero hits and is told so by `missing`
+ * rather than by silence.
+ */
+export function nodesInFiles(driver, paths) {
+    const wanted = [...new Set(paths)].sort();
+    if (wanted.length === 0)
+        return { nodes: [], missing: [] };
+    const nodes = [];
+    const seen = new Set();
+    // Chunked because SQLite's default parameter ceiling is 999 and a large PR
+    // legitimately exceeds it. Splitting here rather than asking the caller to
+    // keeps the limit where it belongs — a property of the driver, not of a diff.
+    const CHUNK = 500;
+    for (let i = 0; i < wanted.length; i += CHUNK) {
+        const chunk = wanted.slice(i, i + CHUNK);
+        const rows = driver
+            .prepare(`SELECT ${NODE_COLUMNS} FROM nodes WHERE file_path IN (${chunk.map(() => "?").join(", ")})` +
+            ` ORDER BY id ASC`)
+            .all(...chunk);
+        for (const row of rows) {
+            if (seen.has(row.id))
+                continue;
+            seen.add(row.id);
+            nodes.push(toNode(row));
+        }
+    }
+    const hit = new Set(nodes.map((n) => n.file).filter((f) => f !== null));
+    return { nodes, missing: wanted.filter((p) => !hit.has(p)) };
+}
+/**
+ * Every node of one type, capped, with one row of headroom.
+ *
+ * `limit + 1` is fetched so the caller can tell "exactly the limit" from "the
+ * limit and more" without a second `COUNT(*)`. A set-property question answered
+ * over a silently truncated set is a fact computed from a sample, so the
+ * distinction has to be available.
+ */
+export function nodesOfType(driver, type, limit) {
+    const rows = driver
+        .prepare(`SELECT ${NODE_COLUMNS} FROM nodes WHERE type = ? ORDER BY id ASC LIMIT ${Math.max(1, Math.floor(limit)) + 1}`)
+        .all(type);
+    const truncated = rows.length > limit;
+    return { nodes: rows.slice(0, limit).map(toNode), truncated };
+}
+/**
+ * Nodes matching a name and/or a file — the "I know what it's called" lookup.
+ *
+ * Deliberately returns **every** match rather than a best one. Two functions in
+ * a repository can legitimately share a name, and picking one by a heuristic —
+ * shortest path, most edges, first row — is how a caller ends up reasoning
+ * confidently about the wrong symbol. Ambiguity is the caller's to report, so
+ * the reader hands it over intact.
+ *
+ * `repo` narrows to nodes minted by a run recorded against that repository —
+ * a subquery against `adapter_runs`, since `nodes` itself carries no `repo`
+ * column (only `run_id`). Added for `descry-runtime`'s graph correlator: a
+ * multi-repo session (frontend + backend merged into one store, per DEC-228)
+ * makes a same-named symbol in the wrong repository a real candidate for a
+ * bare `findNodes({ name })` call, and nothing before this filtered it out.
+ * Omitted, this behaves exactly as before — existing callers are unaffected.
+ */
+export function findNodes(driver, criteria) {
+    const clauses = [];
+    const params = [];
+    if (criteria.name !== undefined) {
+        clauses.push("name = ?");
+        params.push(criteria.name);
+    }
+    if (criteria.file !== undefined) {
+        clauses.push("file_path = ?");
+        params.push(criteria.file);
+    }
+    if (criteria.repo !== undefined) {
+        clauses.push("run_id IN (SELECT id FROM adapter_runs WHERE repo = ?)");
+        params.push(criteria.repo);
+    }
+    if (clauses.length === 0)
+        return [];
+    const limit = Math.max(1, Math.floor(criteria.limit ?? 50));
+    return driver
+        .prepare(`SELECT ${NODE_COLUMNS} FROM nodes WHERE ${clauses.join(" AND ")}` +
+        ` ORDER BY resolution DESC, id ASC LIMIT ${limit}`)
+        .all(...params)
+        .map(toNode);
+}
+/**
+ * Edges leaving a node, optionally filtered by type and capped.
+ *
+ * The cap is not optional politeness. The prior-art graphs on this machine have
+ * a max in-degree of 1,036 (`append`) — materialising every neighbour of a hub
+ * node during a traversal is how a 200-node budget turns into a 10,000-row read.
+ */
+export function outgoing(driver, id, options = {}) {
+    return adjacency(driver, "source", id, options);
+}
+export function incoming(driver, id, options = {}) {
+    return adjacency(driver, "target", id, options);
+}
+function adjacency(driver, column, id, options) {
+    const types = options.types;
+    const typeFilter = types === undefined || types.length === 0
+        ? ""
+        : ` AND type IN (${types.map(() => "?").join(", ")})`;
+    // Ranked before truncation, so a cap keeps the most trustworthy neighbours
+    // rather than whichever rows the index happened to reach first. `id` breaks
+    // ties so the result is stable across runs.
+    const sql = `SELECT ${EDGE_COLUMNS} FROM edges WHERE ${column} = ?${typeFilter}` +
+        ` ORDER BY resolution DESC, confidence DESC, id ASC` +
+        (options.limit === undefined ? "" : ` LIMIT ${Math.max(0, Math.floor(options.limit))}`);
+    return driver
+        .prepare(sql)
+        .all(id, ...(types ?? []))
+        .map(toEdge);
+}
+/**
+ * Refusal-ledger rows, for the question-grouping layer (DEC-243) to consume.
+ *
+ * `classified` (default `true`) restricts to `attrs IS NOT NULL` — rows with
+ * no `attrs` at all can never become a question (DEC-242: an unset
+ * `refusalClass` is never askable) and are always the majority of this table
+ * early in a producer's rollout — sherpa-frontend alone carries ~13,000. That
+ * filter is a real optimisation, not an approximation: it changes which rows
+ * are *materialised*, never which rows the grouper would have turned into a
+ * question. The unclassified count for disclosure is `counts(driver)
+ * .unresolvedRefs` minus this function's own row count, not recomputed here.
+ */
+export function unresolvedRefs(driver, options = {}) {
+    const classified = options.classified ?? true;
+    const where = classified ? "WHERE attrs IS NOT NULL" : "";
+    const limit = options.limit === undefined ? undefined : Math.max(1, Math.floor(options.limit));
+    const sql = `SELECT ${UNRESOLVED_REF_COLUMNS} FROM unresolved_refs ${where}` +
+        ` ORDER BY id ASC` +
+        (limit === undefined ? "" : ` LIMIT ${limit + 1}`);
+    const rows = driver.prepare(sql).all();
+    const truncated = limit !== undefined && rows.length > limit;
+    return { refs: (truncated ? rows.slice(0, limit) : rows).map(toUnresolvedRef), truncated };
+}
+export function counts(driver) {
+    const one = (sql) => driver.prepare(sql).get()?.n ?? 0;
+    return {
+        nodes: one("SELECT COUNT(*) AS n FROM nodes"),
+        edges: one("SELECT COUNT(*) AS n FROM edges"),
+        unresolvedRefs: one("SELECT COUNT(*) AS n FROM unresolved_refs"),
+        runs: one("SELECT COUNT(*) AS n FROM adapter_runs"),
+    };
+}
+/**
+ * A hash of the store's logical content, independent of insertion order.
+ *
+ * This is the instrument for the determinism proof: ingesting the same batches
+ * in a permuted order must produce the same hash. Without it, "the graph does
+ * not depend on adapter ordering" is an assertion nobody can check, and by the
+ * time a real ordering dependency shows up it presents as an unreproducible
+ * difference in impact scores.
+ *
+ * `written_at` is excluded — a wall-clock stamp is not logical content, and
+ * including it would make the proof untestable rather than making it stronger.
+ */
+export function contentHash(driver) {
+    const digest = createHash("sha256");
+    for (const table of [...DERIVED_TABLES, ...EARNED_TABLES].sort()) {
+        const columns = driver
+            .prepare(`SELECT name FROM pragma_table_info(?) ORDER BY name`)
+            .all(table)
+            .map((r) => r.name)
+            .filter((name) => name !== "written_at" && name !== "last_parsed_at");
+        if (columns.length === 0)
+            continue;
+        const select = columns.map((c) => `"${c}"`).join(", ");
+        const rows = driver
+            .prepare(`SELECT ${select} FROM "${table}" ORDER BY ${select}`)
+            .all();
+        digest.update(`${table}\n`);
+        for (const row of rows)
+            digest.update(`${canonicalJson(row)}\n`);
+    }
+    return digest.digest("hex");
+}
+//# sourceMappingURL=reader.js.map

package/dist/store/reader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reader.js","sourceRoot":"","sources":["../../src/store/reader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EACL,aAAa,EACb,UAAU,EACV,UAAU,GAOX,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAsC5D,MAAM,YAAY,GAChB,2FAA2F,CAAC;AAC9F,MAAM,YAAY,GAChB,uFAAuF,CAAC;AAC1F,MAAM,sBAAsB,GAC1B,kFAAkF,CAAC;AAErF,SAAS,MAAM,CAAC,GAAY;IAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,4EAA4E;QAC5E,yDAAyD;QACzD,MAAM,IAAI,KAAK,CAAC,eAAe,GAAG,CAAC,EAAE,yBAAyB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,IAAI,GAAa,GAAG,CAAC,IAAI,CAAC;IAChC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI;QACJ,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,SAAS;QACnB,KAAK,EACH,GAAG,CAAC,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI;YAC9C,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,QAAQ,EAAE;QAC1D,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,UAAU,EAAE,GAAG,CAAC,UAA6B;QAC7C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAA4B;KACxD,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,GAAY;IAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,eAAe,GAAG,CAAC,EAAE,yBAAyB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,IAAI,GAAa,GAAG,CAAC,IAAI,CAAC;IAChC,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,MAAM;QAChB,EAAE,EAAE,GAAG,CAAC,MAAM;QACd,IAAI;QACJ,UAAU,EAAE,GAAG,CAAC,UAA6B;QAC7C,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,GAAG,CAAC,GAAG,CAAC,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC;QAC/E,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAA4B,EAAE,CAAC;KAC3F,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,GAAqB;IAC5C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,CAAC,YAAY,8BAA8B,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IAC7G,CAAC;IACD,MAAM,QAAQ,GAAa,GAAG,CAAC,SAAS,CAAC;IACzC,OAAO;QACL,UAAU,EAAE,GAAG,CAAC,YAAY;QAC5B,QAAQ;QACR,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,IAAI,EAAE,GAAG,CAAC,SAAS;QACnB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAA4B,EAAE,CAAC;KAC3F,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAiB,EAAE,EAAU;IACnD,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAU,UAAU,YAAY,0BAA0B,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9F,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAiB,EACjB,KAAwB;IAExB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAE3D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,2EAA2E;IAC3E,2EAA2E;IAC3E,8EAA8E;IAC9E,MAAM,KAAK,GAAG,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM;aAChB,OAAO,CACN,UAAU,YAAY,mCAAmC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YACzF,kBAAkB,CACrB;aACA,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IACrF,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,MAAiB,EACjB,IAAc,EACd,KAAa;IAEb,MAAM,IAAI,GAAG,MAAM;SAChB,OAAO,CACN,UAAU,YAAY,oDACpB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CACnC,EAAE,CACH;SACA,GAAG,CAAC,IAAI,CAAC,CAAC;IACb,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC;AAChE,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,SAAS,CACvB,MAAiB,EACjB,QAKC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;QACvE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5D,OAAO,MAAM;SACV,OAAO,CACN,UAAU,YAAY,qBAAqB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;QAChE,2CAA2C,KAAK,EAAE,CACrD;SACA,GAAG,CAAC,GAAG,MAAM,CAAC;SACd,GAAG,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CACtB,MAAiB,EACjB,EAAU,EACV,UAA2D,EAAE;IAE7D,OAAO,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,QAAQ,CACtB,MAAiB,EACjB,EAAU,EACV,UAA2D,EAAE;IAE7D,OAAO,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,SAAS,CAChB,MAAiB,EACjB,MAA2B,EAC3B,EAAU,EACV,OAAwD;IAExD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,UAAU,GACd,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QACvC,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,iBAAiB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAC1D,2EAA2E;IAC3E,4EAA4E;IAC5E,4CAA4C;IAC5C,MAAM,GAAG,GACP,UAAU,YAAY,qBAAqB,MAAM,OAAO,UAAU,EAAE;QACpE,oDAAoD;QACpD,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAE1F,OAAO,MAAM;SACV,OAAO,CAAU,GAAG,CAAC;SACrB,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;SACzB,GAAG,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAiB,EACjB,UAAsE,EAAE;IAExE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,IAAI,CAAC;IAC9C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/F,MAAM,GAAG,GACP,UAAU,sBAAsB,yBAAyB,KAAK,EAAE;QAChE,kBAAkB;QAClB,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;IAErD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAmB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IACzD,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IAC7D,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,SAAS,EAAE,CAAC;AAC7F,CAAC;AASD,MAAM,UAAU,MAAM,CAAC,MAAiB;IACtC,MAAM,GAAG,GAAG,CAAC,GAAW,EAAU,EAAE,CAClC,MAAM,CAAC,OAAO,CAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IACnD,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,iCAAiC,CAAC;QAC7C,KAAK,EAAE,GAAG,CAAC,iCAAiC,CAAC;QAC7C,cAAc,EAAE,GAAG,CAAC,2CAA2C,CAAC;QAChE,IAAI,EAAE,GAAG,CAAC,wCAAwC,CAAC;KACpD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,WAAW,CAAC,MAAiB;IAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAEpC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,GAAG,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACjE,MAAM,OAAO,GAAG,MAAM;aACnB,OAAO,CAAmB,qDAAqD,CAAC;aAChF,GAAG,CAAC,KAAK,CAAC;aACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;aAClB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,gBAAgB,CAAC,CAAC;QACxE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEnC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,MAAM;aAChB,OAAO,CAA0B,UAAU,MAAM,UAAU,KAAK,cAAc,MAAM,EAAE,CAAC;aACvF,GAAG,EAAE,CAAC;QAET,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,MAAM,CAAC,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC"}

package/dist/store/schema.d.ts

@@ -0,0 +1,87 @@
+/**
+ * The graph schema.
+ *
+ * Held as a TypeScript constant rather than a `.sql` file on disk. Reading a
+ * sibling `.sql` at runtime resolves to `src/` under Node's type stripping and
+ * `dist/` after `tsc`, so it needs an asset-copy build step and then behaves
+ * differently in tests than in production — the same class of trap the build
+ * plan flags for the traversal worker entrypoint. A constant has neither
+ * problem and costs nothing but syntax highlighting.
+ *
+ * ## Five corrections to the written schema
+ *
+ * Architecture §24.1 and blueprint §0.8 both describe this schema, and both need
+ * amending. Each is recorded here because the docs are the shared reference and
+ * a silent divergence is worse than either version.
+ *
+ * 1. **No `properties` table.** §11.8 names `nodes`/`edges`/`properties`, but
+ *    §24.1 and blueprint §0.8 both use a JSON column instead. An entity-
+ *    attribute-value table turns every node read into a join and defeats the
+ *    adjacency performance target that §11.8's own traversal decision rests on.
+ *    Language-specific detail lives in the `attrs` JSON column, which nothing
+ *    above the IR reads.
+ *
+ * 2. **No `edges.weight`.** Blueprint §0.8 lists it. But `EdgeWeight` in §12.4
+ *    is tuning config keyed by edge *type*, not a per-row value — storing it per
+ *    row would let 30,000 copies of one tunable drift apart. The single genuine
+ *    per-edge quantity, `CHANGES_WITH`'s co-change count, lives in `attrs`.
+ *
+ * 3. **No `edges.language`.** Both §24.1 and blueprint §0.8 declare it, and
+ *    `IREdge` has no such field — nothing in the IR could ever populate it. A
+ *    column no producer can fill is a column every reader must special-case.
+ *
+ * 4. **`nodes.language` is nullable.** §24.1 declares it `NOT NULL`. DEC-014
+ *    establishes that `API_ENDPOINT` — the cross-language join node — belongs to
+ *    no language, and XL-2 asserts it carries none. `NOT NULL` makes the join
+ *    node unstorable.
+ *
+ * 5. **Composite adjacency indices.** Blueprint §0.8 indexes `edges(source)` and
+ *    `edges(target)`. Every traversal hop filters by edge type as well, and the
+ *    prior-art measurement on this machine found a max in-degree of 1,036 — so
+ *    a single-column index means scanning a thousand rows to keep four.
+ *    `edges(source, type)` and `edges(target, type)` are the real access paths.
+ *
+ * ## Derived vs earned — DEC-017
+ *
+ * The partition is expressed in `DERIVED_TABLES` / `EARNED_TABLES` below rather
+ * than left as prose, because the only thing that makes DEC-017 real is that
+ * `dropDerived()` can be tested to leave the earned side untouched.
+ */
+/**
+ * Bumped when the IR itself changes shape, not when an adapter changes.
+ *
+ * DEC-017: on mismatch, refuse to read, drop derived, rebuild, migrate earned.
+ * A stored graph is derived data and is never the source of truth.
+ */
+export declare const IR_SCHEMA_VERSION = 4;
+/**
+ * The tag on every node id, derived from the constant rather than restated.
+ *
+ * A graph tagged otherwise is not ours, and the whole point of the tag is to say
+ * so out loud instead of silently failing to match. Restating it here as a
+ * literal would let the store keep validating the previous scheme after an id
+ * change — the exact failure the tag exists to prevent.
+ */
+export declare const NODE_ID_SCHEME: string;
+/**
+ * Regenerable from source. Dropping these loses time, never information.
+ */
+export declare const DERIVED_TABLES: readonly ["nodes", "edges", "unresolved_refs", "file_hashes", "embeddings", "adapter_runs"];
+/**
+ * Cannot be regenerated: a run that witnessed an edge fire is gone once the
+ * process exits, and a human's correction of a wrong edge is not in the source
+ * at all. These survive every rebuild.
+ */
+export declare const EARNED_TABLES: readonly ["observed_edges", "edge_corrections", "incident_links", "pr_scopes"];
+export type DerivedTable = (typeof DERIVED_TABLES)[number];
+export type EarnedTable = (typeof EARNED_TABLES)[number];
+/**
+ * Children before parents. Stated explicitly rather than derived by reversing
+ * `DERIVED_TABLES`: `PRAGMA foreign_keys` cannot be changed inside a
+ * transaction, so a drop in the wrong order either fails or leans on cascade
+ * behaviour to rescue it. Neither should be left to the order someone happened
+ * to list the tables in.
+ */
+export declare const DERIVED_DROP_ORDER: readonly ["embeddings", "unresolved_refs", "edges", "nodes", "file_hashes", "adapter_runs"];
+export declare const SCHEMA_SQL = "\n-- ---------------------------------------------------------------------------\n-- graph_meta \u2014 identity of the store itself. Read before anything else.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS graph_meta (\n  key   TEXT PRIMARY KEY,\n  value TEXT NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- adapter_runs \u2014 one row per accepted IRBatch. \u00A724.1's adapter registry state\n-- and DEC-015's invalidation key are the same thing, so they are one table.\n--\n-- id is derived (hash of producer + repo + commit + source files), never an\n-- autoincrement rowid: re-ingesting an identical batch must reuse the same row,\n-- or idempotence is impossible to state.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS adapter_runs (\n  id                 TEXT PRIMARY KEY,\n  repo               TEXT    NOT NULL,\n  -- The identity scope workspace-scoped ids in this batch were computed under\n  -- (DEC-054). NULL means \"this repository alone\". Recorded because the scope is\n  -- configuration: once it changes, no node id in this run can be re-derived from\n  -- the row itself, and a workspace typo is otherwise invisible after the fact.\n  workspace          TEXT,\n  commit_sha         TEXT    NOT NULL,\n  adapter_id         TEXT    NOT NULL,   -- the part before '@'\n  adapter_version    TEXT    NOT NULL,   -- the part after '@'\n  produced_by        TEXT    NOT NULL,   -- adapter_id@adapter_version, as written on every row\n  reached_resolution INTEGER NOT NULL,\n  source_files       TEXT    NOT NULL,   -- JSON array; the invalidation key (DEC-015)\n  file_count         INTEGER NOT NULL,\n  written_at         INTEGER NOT NULL\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_runs_adapter ON adapter_runs(adapter_id);\nCREATE INDEX IF NOT EXISTS idx_runs_producer ON adapter_runs(produced_by);\n\n-- ---------------------------------------------------------------------------\n-- nodes\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS nodes (\n  id          TEXT PRIMARY KEY,\n  type        TEXT    NOT NULL,\n  name        TEXT    NOT NULL,\n  file_path   TEXT,                      -- null for fileless types (DEC-014)\n  start_line  INTEGER,\n  end_line    INTEGER,\n  language    TEXT,                      -- correction 4: nullable\n  produced_by TEXT    NOT NULL,\n  resolution  INTEGER NOT NULL,\n  attrs       TEXT    NOT NULL,          -- JSON; correction 1\n  run_id      TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);\nCREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);\nCREATE INDEX IF NOT EXISTS idx_nodes_file ON nodes(file_path);\nCREATE INDEX IF NOT EXISTS idx_nodes_resolution ON nodes(resolution);\nCREATE INDEX IF NOT EXISTS idx_nodes_run ON nodes(run_id);\n\n-- ---------------------------------------------------------------------------\n-- edges. Primary key is hash(from, to, type) per DEC-012, so two adapters\n-- finding the same relationship collide by construction \u2014 which is what makes\n-- a merge policy statable at all. 30% of prior-art edges were exact\n-- duplicates, so this is load-bearing rather than tidy.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS edges (\n  id              TEXT PRIMARY KEY,\n  source          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  target          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  type            TEXT    NOT NULL,\n  resolution      INTEGER NOT NULL,\n  confidence      REAL    NOT NULL,\n  produced_by     TEXT    NOT NULL,\n  observed_by_run TEXT,                  -- present exactly when resolution = 4\n  attrs           TEXT,                  -- JSON or null; corrections 1 and 2\n  run_id          TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE,\n  CHECK (resolution BETWEEN 0 AND 4),\n  CHECK (confidence BETWEEN 0.0 AND 1.0),\n  CHECK ((resolution = 4) = (observed_by_run IS NOT NULL))\n) STRICT;\n\n-- Correction 5: the real access paths. Every hop filters by type.\nCREATE INDEX IF NOT EXISTS idx_edges_source_type ON edges(source, type);\nCREATE INDEX IF NOT EXISTS idx_edges_target_type ON edges(target, type);\nCREATE INDEX IF NOT EXISTS idx_edges_resolution ON edges(resolution);\nCREATE INDEX IF NOT EXISTS idx_edges_run ON edges(run_id);\n\n-- ---------------------------------------------------------------------------\n-- unresolved_refs \u2014 DEC-016. What an adapter saw but could not resolve.\n--\n-- Not edges, because a name-matched guess is a false claim under \u00A711B.1. Not\n-- discarded either, because then \u00A711B.6 recall has no denominator and \u00A720.2's\n-- \"not analysable\" category has nothing to count. On the prior-art graphs this\n-- is 52-60% of everything emitted.\n-- ---------------------------------------------------------------------------\n-- id is a content hash, never an autoincrement rowid: an insertion-order key\n-- would make the permuted-ingest determinism proof impossible to state, and two\n-- byte-identical references are the same reference.\nCREATE TABLE IF NOT EXISTS unresolved_refs (\n  id           TEXT PRIMARY KEY,\n  from_node_id TEXT NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  edge_type    TEXT NOT NULL,\n  raw_target   TEXT NOT NULL,\n  file_path    TEXT,\n  line         INTEGER,\n  produced_by  TEXT NOT NULL,\n  reason       TEXT NOT NULL,\n  -- DEC-242's attrs.blockedBy/attrs.refusalClass live here, JSON or null --\n  -- same optional-attrs treatment as edges (correction 2), and deliberately\n  -- excluded from id's content hash below: this is classification of a\n  -- refusal, not part of what makes two refusals the same refusal. Added in\n  -- schema version 3 -- DEC-017 governs what that bump costs an existing\n  -- store (drop derived, rebuild; earned tables untouched).\n  attrs        TEXT,\n  run_id       TEXT NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_unresolved_from ON unresolved_refs(from_node_id);\nCREATE INDEX IF NOT EXISTS idx_unresolved_target ON unresolved_refs(raw_target);\nCREATE INDEX IF NOT EXISTS idx_unresolved_run ON unresolved_refs(run_id);\n\n-- ---------------------------------------------------------------------------\n-- file_hashes \u2014 \u00A711.14 rebuild acceleration. Layer 1 change detection is\n-- defined against this table and v2.1 never declared it.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS file_hashes (\n  file_path      TEXT PRIMARY KEY,\n  hash           TEXT    NOT NULL,\n  last_parsed_at INTEGER NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- embeddings \u2014 pointer table only. No vector extension is loaded in this build;\n-- \u00A78.2 keeps vectors in pgvector hosted or a local extension, and a column of\n-- serialised floats with no index would be a scan, not a search.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS embeddings (\n  node_id          TEXT PRIMARY KEY REFERENCES nodes(id) ON DELETE CASCADE,\n  vector_reference TEXT NOT NULL,\n  model_version    TEXT NOT NULL\n) STRICT;\n\n-- ===========================================================================\n-- EARNED \u2014 DEC-017. Never dropped. No REFERENCES into the derived tables:\n-- a foreign key would cascade these away with the graph they describe, which\n-- is precisely the outcome the partition exists to prevent.\n-- ===========================================================================\n\n-- R4 evidence. An edge witnessed firing during a live run (\u00A711B.3). This is the\n-- product's core moat and cannot be recomputed from source at any price.\nCREATE TABLE IF NOT EXISTS observed_edges (\n  edge_id     TEXT NOT NULL,\n  run_id      TEXT NOT NULL,\n  from_node_id TEXT NOT NULL,\n  to_node_id  TEXT NOT NULL,\n  edge_type   TEXT NOT NULL,\n  commit_sha  TEXT NOT NULL,\n  observed_at INTEGER NOT NULL,\n  PRIMARY KEY (edge_id, run_id)\n) STRICT;\n\n-- \u00A711B.5. A human said an edge was wrong, or runtime contradicted it. Feeding\n-- this back is how precision improves; losing it repeats the same false claim.\nCREATE TABLE IF NOT EXISTS edge_corrections (\n  edge_id      TEXT PRIMARY KEY,\n  verdict      TEXT    NOT NULL,         -- 'wrong' | 'right'\n  reason       TEXT    NOT NULL,\n  corrected_at INTEGER NOT NULL\n) STRICT;\n\n-- \u00A714.2. One pull request's computed scope, and it is EARNED rather than derived\n-- for a reason that is easy to get backwards.\n--\n-- Everything else on the derived side can be regenerated from source because the\n-- source is what produced it. A PR scope cannot: it was computed against a graph\n-- at one commit, and that graph moves. Recomputing it later answers a DIFFERENT\n-- question and returns a plausible answer to it \u2014 so dropping this table does\n-- not lose time, it loses the COMPARISON BASIS. Overlap scoring between two PRs\n-- is only meaningful when both scopes were computed against the same graph, and\n-- nothing in a recomputed row would say that it was not.\n--\n-- graph_commit_sha is therefore not decoration: it is the field that makes two\n-- rows comparable or not, and a reader that ignores it will happily overlap a\n-- scope from last week with one from today and report a number.\n--\n-- scope_json holds the node id set. Kept opaque here on purpose: the shape of a\n-- scope is the scoping layer's business, and a column per dimension would need\n-- a migration every time that layer learns something. What the store guarantees\n-- is that the bytes come back unchanged with the commit they were computed at.\nCREATE TABLE IF NOT EXISTS pr_scopes (\n  pr_id            TEXT    NOT NULL,\n  repo             TEXT    NOT NULL,\n  -- The head commit of the PR itself.\n  head_sha         TEXT    NOT NULL,\n  -- The commit the GRAPH was at when this scope was computed. Two scopes are\n  -- comparable only when these agree.\n  graph_commit_sha TEXT    NOT NULL,\n  scope_json       TEXT    NOT NULL,\n  node_count       INTEGER NOT NULL,\n  computed_at      INTEGER NOT NULL,\n  PRIMARY KEY (repo, pr_id, graph_commit_sha)\n) STRICT;\n\n-- The access path for overlap scoring: every scope computed against one graph.\n-- Without it, comparing N PRs scans the whole table N times.\nCREATE INDEX IF NOT EXISTS idx_pr_scopes_graph ON pr_scopes(repo, graph_commit_sha);\n\n-- Incident and fix-pattern links. Accumulated from real failures over time.\nCREATE TABLE IF NOT EXISTS incident_links (\n  incident_node_id TEXT NOT NULL,\n  target_node_id   TEXT NOT NULL,\n  kind             TEXT NOT NULL,\n  created_at       INTEGER NOT NULL,\n  PRIMARY KEY (incident_node_id, target_node_id, kind)\n) STRICT;\n";
+//# sourceMappingURL=schema.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/store/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;AAIH;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC;;;;;;;GAOG;AACH,eAAO,MAAM,cAAc,QAAkC,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,cAAc,6FAOjB,CAAC;AAEX;;;;GAIG;AACH,eAAO,MAAM,aAAa,gFAKhB,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3D,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AAEzD;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,6FAOa,CAAC;AAE7C,eAAO,MAAM,UAAU,43VAyNtB,CAAC"}