@sdd-method/maintain-cli 0.0.0-stage → 0.1.0

package/dist/lib/catalogue/graph-run.js

@@ -0,0 +1,64 @@
+/**
+ * Orchestrator for `sdd-cli catalogue graph` — loads the schema, the
+ * vendored rubric-coverage-map (the node/edge kind authority; the schema
+ * itself does not declare kind), and the catalogues directory, projects
+ * the graph (graph-projection.ts holds the derivation rule), writes the
+ * JSONL export, and prints the counts + digest so the figures are stated
+ * on every run, not discoverable after the fact.
+ *
+ * The export is regenerated on every invocation and is NOT committed
+ * (M-ADR 0205 §4.6): default output is `<catalogues-dir>-graph.jsonl`
+ * beside the catalogues directory, which adopter .gitignore entries cover.
+ * Tier is explicit, never inferred, same discipline as every other reader.
+ */
+import { existsSync } from "node:fs";
+import { writeFile } from "node:fs/promises";
+import { join, resolve } from "node:path";
+import { readCatalogueCsv } from "./csv-reader.js";
+import { loadCanonicalSchema } from "./schema-loader.js";
+import { defaultCataloguesDir, projectGraph, } from "./graph-projection.js";
+import { loadCatalogueKinds, loadRelationshipSemantics } from "./relationship-semantics.js";
+export * from "./relationship-semantics.js";
+// defaultCataloguesDir lives in graph-projection.ts (read-only), re-exported
+// here for existing importers. Read-only verbs must import it from there:
+// importing it from this module drags the graph WRITER into the verify-only
+// package's closure (build-persona-package's canary; the fdf9453 leak).
+export { defaultCataloguesDir };
+export async function runCatalogueGraph(inputs, write) {
+    const sddRoot = resolve(inputs.sddPath ?? process.cwd());
+    const tier = inputs.tier ?? "member";
+    const dir = resolve(sddRoot, inputs.cataloguesDir ?? defaultCataloguesDir(tier));
+    const outPath = inputs.out !== undefined
+        ? resolve(sddRoot, inputs.out)
+        : `${dir}-graph.jsonl`;
+    if (!existsSync(dir)) {
+        write(`catalogues directory not found at ${dir}\n` +
+            `  Run \`sdd-cli catalogue build\` (or aggregate) first — the graph ` +
+            `is derived from built catalogues, never authored.\n`);
+        return { exitCode: 2 };
+    }
+    const schema = await loadCanonicalSchema();
+    const kinds = await loadCatalogueKinds();
+    const semantics = await loadRelationshipSemantics();
+    const rowsByCatalogue = new Map();
+    for (const cat of schema.catalogues) {
+        const filePath = join(dir, `${cat.name}.csv`);
+        if (!existsSync(filePath))
+            continue;
+        const parsed = await readCatalogueCsv(filePath);
+        rowsByCatalogue.set(cat.name, parsed.rows);
+    }
+    const projection = projectGraph(schema, kinds, rowsByCatalogue, tier, semantics);
+    await writeFile(outPath, projection.text, "utf-8");
+    const c = projection.counts;
+    write(`graph projection (${tier} tier, schema ${schema.schemaVersion})\n`);
+    write(`  nodes: ${c.nodes}\n`);
+    write(`  edges: ${c.edges}\n`);
+    write(`  property records: ${c.properties}\n`);
+    write(`  omitted (external, resolves at aggregation): ${c.omittedExternal}\n`);
+    write(`  omitted (unresolved — mirrors FK findings): ${c.omittedUnresolved}\n`);
+    write(`  digest: sha256:${projection.digest}\n`);
+    write(`  wrote ${outPath}\n`);
+    return { exitCode: 0, counts: c, outPath };
+}
+//# sourceMappingURL=graph-run.js.map

package/dist/lib/catalogue/impact-run.js

@@ -0,0 +1,228 @@
+/**
+ * Transitive impact analysis — `sdd-cli catalogue impact` (M-ADR 0206 §4.6).
+ *
+ * Impact traverses the graph-projection edge set BY DECLARED SEMANTICS: every
+ * relationship carries an impact-flow token in the rubric-coverage-map
+ * (M-ADR 0206 §4.1) naming which endpoint RECEIVES impact — `toward-source`
+ * (dependency shape: a change at the target propagates to the source),
+ * `toward-target` (membership shape: a part's change reaches its whole),
+ * `both` (realisation), `none` (xref, lineage records, attributes). One
+ * relationship (`service_event`) resolves its flow per row from a named
+ * column (§4.2). The closure is the set of nodes impact can reach from the
+ * seed along declared propagation directions, computed by recursive SQL
+ * (`WITH RECURSIVE`) on the Phase A engine.
+ *
+ * THE CO-DIRECTIONALITY INVARIANT (§4.4, a condition of 0206's acceptance):
+ * the Phase C mirror-dedup heuristic is retired because under the declared
+ * tokens every true-mirror pair propagates the SAME direction. That premise
+ * is exercised, not assumed: buildImpactPropagation asserts that no node
+ * pair receives propagation in BOTH directions from two DIFFERENT
+ * single-direction relationship types, and fails loudly naming the pair and
+ * types. A single relationship declaring `both` is deliberate bidirectional
+ * coupling and is exempt; a self-referential type contributing both
+ * directions from different rows (a hierarchy cycle) is likewise exempt.
+ * A future token edit that would silently bring the undirected flood back
+ * trips this assertion instead.
+ *
+ * Cycle discipline: the recursion carries NO depth column — recursive UNION
+ * deduplicates whole rows, and a depth column makes every lap of a cycle a
+ * "new" row: the query that looks more informative is the query that never
+ * terminates. As a bare id-set the closure saturates and stops.
+ */
+import { existsSync } from "node:fs";
+import { join, resolve } from "node:path";
+import { readCatalogueCsv } from "./csv-reader.js";
+import { loadCanonicalSchema } from "./schema-loader.js";
+import { loadCatalogueKinds, loadRelationshipSemantics, } from "./relationship-semantics.js";
+import { defaultCataloguesDir, projectGraph, } from "./graph-projection.js";
+function resolveFlow(edge, semantics) {
+    const decl = edge.type.includes(".")
+        ? semantics.entityFks.get(edge.type)
+        : semantics.edges.get(edge.type);
+    if (decl === undefined) {
+        throw new Error(`impact: relationship ${edge.type} has no declaration in the ` +
+            `rubric-coverage-map (M-ADR 0206) — sync the vendored map.`);
+    }
+    if (decl.impactFlow !== undefined)
+        return decl.impactFlow;
+    const by = decl.impactFlowBy;
+    const value = (edge.properties?.[by.column] ?? "").trim();
+    const flow = by.values[value];
+    if (flow === undefined) {
+        throw new Error(`impact: ${edge.type} resolves flow by column '${by.column}' but row ` +
+            `value '${value}' is not in the declared map — extend the ` +
+            `declaration or fix the row.`);
+    }
+    return flow;
+}
+/**
+ * Resolve every declared edge into propagation steps per its flow, and
+ * exercise the §4.4 co-directionality invariant.
+ */
+export function buildImpactPropagation(edges, semantics) {
+    const out = [];
+    const byFlow = new Map();
+    let flowNone = 0;
+    const pairs = new Map();
+    const notePair = (from, to, type) => {
+        const [a, b] = from < to ? [from, to] : [to, from];
+        const key = `${a}␟${b}`;
+        let rec = pairs.get(key);
+        if (rec === undefined) {
+            rec = { ab: new Set(), ba: new Set() };
+            pairs.set(key, rec);
+        }
+        (from === a ? rec.ab : rec.ba).add(type);
+    };
+    for (const e of edges) {
+        const flow = resolveFlow(e, semantics);
+        byFlow.set(flow, (byFlow.get(flow) ?? 0) + 1);
+        if (flow === "none") {
+            flowNone += 1;
+            continue;
+        }
+        if (flow === "toward-source" || flow === "both") {
+            out.push({ from: e.target, to: e.source, type: e.type });
+            notePair(e.target, e.source, e.type);
+        }
+        if (flow === "toward-target" || flow === "both") {
+            out.push({ from: e.source, to: e.target, type: e.type });
+            notePair(e.source, e.target, e.type);
+        }
+    }
+    // §4.4 invariant, refined on measured data (2026-08-06): a pair fails only
+    // when one type contributes EXCLUSIVELY a→b against another contributing
+    // EXCLUSIVELY b→a. A type that itself spans both directions on the pair —
+    // opposing role-rows of a role-conditional relationship (a service that
+    // publishes AND consumes the same event: five real pairs on the reverse
+    // estate, one service, all session-broadcast shaped), a self-referential
+    // hierarchy cycle, or a declared `both` flow — has DECLARED that pair
+    // bidirectional, so other types aligning with either direction are
+    // consistent with declarations, not drift. The flipped-token flood shape
+    // (two single-direction declarations opposing) still fails, loudly.
+    for (const [key, rec] of pairs) {
+        const abOnly = [...rec.ab].filter((t) => !rec.ba.has(t));
+        const baOnly = [...rec.ba].filter((t) => !rec.ab.has(t));
+        if (abOnly.length > 0 && baOnly.length > 0) {
+            const [a, b] = key.split("␟");
+            throw new Error(`impact: counter-directional reciprocal pair (M-ADR 0206 §4.4): ` +
+                `${abOnly[0]} propagates ${a} -> ${b} while ${baOnly[0]} propagates ` +
+                `${b} -> ${a}, and neither declares the pair bidirectional. The ` +
+                `declared tokens have re-created an undirected pair; fix the ` +
+                `classification before trusting any closure.`);
+        }
+    }
+    return { edges: out, flowNone, byFlow };
+}
+function sqlStringLiteral(value) {
+    return `'${value.replace(/'/g, "''")}'`;
+}
+/**
+ * Closure of `seed` over resolved propagation edges, on the engine.
+ * Exported for the fixture controls; the verb goes through runCatalogueImpact.
+ */
+export async function computeImpactClosure(propagation, seed) {
+    const { DuckDBInstance } = await import("@duckdb/node-api");
+    const instance = await DuckDBInstance.create(":memory:");
+    const conn = await instance.connect();
+    try {
+        await conn.run(`CREATE TABLE prop (f VARCHAR, t VARCHAR);`);
+        const CHUNK = 500;
+        for (let i = 0; i < propagation.length; i += CHUNK) {
+            const tuples = propagation
+                .slice(i, i + CHUNK)
+                .map((e) => `(${sqlStringLiteral(e.from)}, ${sqlStringLiteral(e.to)})`)
+                .join(",\n");
+            await conn.run(`INSERT INTO prop VALUES\n${tuples};`);
+        }
+        const seedLit = sqlStringLiteral(seed);
+        // CYCLE GUARD: the recursion carries NO depth column, deliberately.
+        // Recursive UNION deduplicates whole rows; a depth column makes every
+        // lap around a cycle a "new" row (same id, bigger depth), so the query
+        // that looks more informative is the query that never terminates — the
+        // catalogue graph is not a DAG. As a bare id-set the closure saturates
+        // and stops.
+        const reader = await conn.runAndReadAll(`WITH RECURSIVE reach(id) AS (\n` +
+            `  SELECT t FROM prop WHERE f = ${seedLit}\n` +
+            `  UNION\n` +
+            `  SELECT p.t FROM prop p JOIN reach r ON p.f = r.id\n` +
+            `)\n` +
+            `SELECT DISTINCT id FROM reach WHERE id <> ${seedLit} ORDER BY id;`);
+        return reader.getRows().map((row) => String(row[0]));
+    }
+    finally {
+        conn.disconnectSync();
+    }
+}
+export async function runCatalogueImpact(inputs, write) {
+    const sddRoot = resolve(inputs.sddPath ?? process.cwd());
+    const tier = inputs.tier ?? "member";
+    const dir = resolve(sddRoot, inputs.cataloguesDir ?? defaultCataloguesDir(tier));
+    if (!existsSync(dir)) {
+        write(`catalogues directory not found at ${dir}\n` +
+            `  Run \`sdd-cli catalogue build\` (or aggregate) first.\n`);
+        return { exitCode: 2 };
+    }
+    const schema = await loadCanonicalSchema();
+    const kinds = await loadCatalogueKinds();
+    const semantics = await loadRelationshipSemantics();
+    const rowsByCatalogue = new Map();
+    for (const cat of schema.catalogues) {
+        const filePath = join(dir, `${cat.name}.csv`);
+        if (!existsSync(filePath))
+            continue;
+        rowsByCatalogue.set(cat.name, (await readCatalogueCsv(filePath)).rows);
+    }
+    const projection = projectGraph(schema, kinds, rowsByCatalogue, tier);
+    const lines = projection.text.trimEnd().split("\n");
+    const nodeIds = new Set();
+    const edges = [];
+    for (const line of lines) {
+        const o = JSON.parse(line);
+        if (o.t === "node")
+            nodeIds.add(o.id);
+        else if (o.t === "edge")
+            edges.push({
+                source: o.source,
+                target: o.target,
+                type: o.type,
+                ...(o.properties !== undefined ? { properties: o.properties } : {}),
+            });
+    }
+    if (!nodeIds.has(inputs.of)) {
+        write(`node not found in the projection: ${inputs.of}\n` +
+            `  Node ids have the form "<catalogue>/<id>", e.g. contracts/orders-api.\n`);
+        return { exitCode: 2 };
+    }
+    const prop = buildImpactPropagation(edges, semantics);
+    const closure = await computeImpactClosure(prop.edges, inputs.of);
+    const byCatalogue = new Map();
+    for (const id of closure) {
+        const cat = id.slice(0, id.indexOf("/"));
+        byCatalogue.set(cat, (byCatalogue.get(cat) ?? 0) + 1);
+    }
+    write(`impact closure of ${inputs.of} (${tier} tier, schema ${schema.schemaVersion})\n`);
+    // Required stated lines (M-ADR 0206 §4.6): what the number means, and what
+    // was traversed under each declared flow — visible per run, not
+    // discoverable from the code.
+    write(`  semantics: change impact over classified relationships (M-ADR 0206) —\n` +
+        `    each relationship traversed per its declared impact-flow; the\n` +
+        `    co-directionality invariant is asserted on every run\n`);
+    const flowCounts = [...prop.byFlow.entries()]
+        .sort()
+        .map(([f, n]) => `${f}=${n}`)
+        .join("  ");
+    write(`  declared edges by resolved flow: ${flowCounts}\n`);
+    write(`  reachable nodes: ${closure.length}\n`);
+    for (const [cat, n] of [...byCatalogue.entries()].sort()) {
+        write(`    ${cat}: ${n}\n`);
+    }
+    for (const id of closure) {
+        write(`  ${id}\n`);
+    }
+    return {
+        exitCode: 0,
+        result: { seed: inputs.of, closure, byCatalogue },
+    };
+}
+//# sourceMappingURL=impact-run.js.map