@ybotok/loam 0.1.0-beta.3 → 0.2.0-alpha.1

package/dist/core/diff/semantic.js

@@ -0,0 +1,243 @@
+/**
+ * The diff computation: join the base fleet (`./base-state.ts`) against the
+ * working tree (`./current-state.ts`) and say, per service, what changed in
+ * FLEET-MEANINGFUL terms — requirements by identity and digest, operations
+ * and messages by their join tokens, cross-service joins by tuple — with the
+ * current consumers of every removal named (`./victims.ts`).
+ *
+ * Two disciplines rule every branch here. Removal is graded against who still
+ * depends on it: a removal nobody names is a warning, a removal the fleet
+ * still joins to is an error and sets `breaking`. And "nobody could look" is
+ * never "nothing changed": an unreadable artifact on EITHER side suspends
+ * that subject's axis — recorded in `unreadable[]`, counted in the summary,
+ * carried into the exit code by the command — instead of letting an
+ * unreadable base read as everything-added or an unreadable working file
+ * read as everything-removed.
+ */
+import { requirementDigest } from "../document/spec.js";
+import { consumerJoinChanges } from "./victims.js";
+/** Severity is a fact about the code, not a call-site choice — one table, no drift. */
+const DIFF_SEVERITY = {
+    "diff.service-added": "ok",
+    "diff.service-removed": "warn",
+    "diff.requirement-added": "ok",
+    "diff.requirement-removed": "warn",
+    "diff.requirement-modified": "ok",
+    "diff.op-added": "ok",
+    "diff.op-removed": "warn",
+    "diff.op-removed-consumed": "error",
+    "diff.op-deprecated": "warn",
+    "diff.message-added": "ok",
+    "diff.message-removed": "warn",
+    "diff.message-removed-consumed": "error",
+    "diff.consumer-added": "ok",
+    "diff.consumer-removed": "ok",
+};
+function found(code, message, details) {
+    const carry = details !== undefined && details.length > 0;
+    return { severity: DIFF_SEVERITY[code], code, message, ...(carry ? { details } : {}) };
+}
+/** A side the service does not exist on: absence everywhere, honestly. */
+const ABSENT = { kind: "absent" };
+const emptyState = (id) => ({ id, dir: "", spec: ABSENT, archSpec: ABSENT, openapi: ABSENT, asyncapi: ABSENT });
+/**
+ * Guard one axis pair: record unreadable sides on the sink and say whether
+ * the axis may be compared at all. Reading one good side against a suspended
+ * one would grade absence it never proved.
+ */
+function comparable(sink, axis, pair) {
+    for (const side of ["base", "current"]) {
+        const state = pair[side];
+        if (state.kind === "unreadable")
+            sink.unreadable.push({ side, axis, path: state.path, error: state.error });
+    }
+    return pair.base.kind !== "unreadable" && pair.current.kind !== "unreadable";
+}
+const valueOr = (axis) => (axis.kind === "read" ? axis.value : []);
+/** Identity: `Requirement-ID:` when authored, the heading otherwise — the same join `loam rebase` pins against. */
+const reqKey = (r) => (r.id !== undefined ? `id:${r.id}` : `name:${r.name}`);
+const reqLabel = (r) => (r.id !== undefined ? `${r.name} [${r.id}]` : r.name);
+/** First declaration wins a duplicated key — the same arbitrary-but-stated pick every join on these axes makes. */
+function firstWins(items, key) {
+    const map = new Map();
+    for (const item of items)
+        if (!map.has(key(item)))
+            map.set(key(item), item);
+    return map;
+}
+/** Entry comparator by map key — explicit, because the default sort stringifies whole entries. */
+const byKey = (a, b) => (a[0] < b[0] ? -1 : 1);
+function requirementsDiff(sink, pair) {
+    // v1 diffs spec.md's requirements only; arch.spec.md is read for the
+    // Consumes: join but its requirement inventory is deferred (the two axes
+    // are separate namespaces, and diffing both doubles the surface). Both
+    // pairs are guarded BEFORE the early return, so a service whose two spec
+    // files are both unreadable reports both suspensions, not just the first.
+    const specComparable = comparable(sink, "spec", { base: pair.base.spec, current: pair.current.spec });
+    comparable(sink, "archSpec", { base: pair.base.archSpec, current: pair.current.archSpec });
+    if (!specComparable)
+        return;
+    const base = firstWins(valueOr(pair.base.spec), reqKey);
+    const current = firstWins(valueOr(pair.current.spec), reqKey);
+    for (const [key, r] of [...current].sort(byKey)) {
+        const before = base.get(key);
+        if (before === undefined)
+            sink.findings.push(found("diff.requirement-added", `living requirement added since base: '${reqLabel(r)}'`));
+        else if (requirementDigest(before) !== requirementDigest(r)) {
+            sink.findings.push(found("diff.requirement-modified", `living requirement modified since base: '${reqLabel(r)}'`));
+        }
+    }
+    for (const [key, r] of [...base].sort(byKey)) {
+        if (!current.has(key))
+            sink.findings.push(found("diff.requirement-removed", `living requirement removed since base: '${reqLabel(r)}'`));
+    }
+}
+async function opsDiff(sink, pair, victims) {
+    if (!comparable(sink, "openapi", { base: pair.base.openapi, current: pair.current.openapi }))
+        return;
+    const base = firstWins(valueOr(pair.base.openapi), (op) => op.id);
+    const current = firstWins(valueOr(pair.current.openapi), (op) => op.id);
+    for (const [id, op] of [...current].sort(byKey)) {
+        const before = base.get(id);
+        if (before === undefined) {
+            sink.findings.push(found("diff.op-added", `operation '${id}' added since base (${op.method.toUpperCase()} ${op.path})`));
+        }
+        else if (!before.deprecated && op.deprecated) {
+            const scan = await victims.opConsumers(sink.id, id);
+            // Three honest phrasings — never a confident negative over a scan that skipped an unreadable consumer document.
+            const stance = scan.victims.length > 0 ? `${scan.victims.length} current consumer(s) still name it`
+                : scan.suspended.length > 0 ? "whether current consumers name it could not be fully answered"
+                    : "no current consumer names it";
+            sink.findings.push(found("diff.op-deprecated", `operation '${id}' is deprecated since base — ${stance}`, [...scan.victims, ...scan.suspended]));
+        }
+    }
+    for (const [id] of [...base].sort(byKey)) {
+        if (current.has(id))
+            continue;
+        const scan = await victims.opConsumers(sink.id, id);
+        if (scan.victims.length > 0) {
+            sink.findings.push(found("diff.op-removed-consumed", `operation '${id}' was removed since base and the current fleet still names it — these joins break`, [...scan.victims, ...scan.suspended]));
+        }
+        else if (scan.suspended.length > 0) {
+            // "Nobody could be scanned" is not "nobody names it" — the consumer's own
+            // unreadable[] entry already carries the run to exit 1; this message must
+            // not assert a negative the scan never proved.
+            sink.findings.push(found("diff.op-removed", `operation '${id}' was removed since base; whether the current fleet still names it could NOT be fully answered — ${scan.suspended.length} consumer document(s) were not scannable`, scan.suspended));
+        }
+        else {
+            sink.findings.push(found("diff.op-removed", `operation '${id}' was removed since base; no current landscape edge or living requirement names it`));
+        }
+    }
+}
+async function messagesDiff(sink, pair, victims) {
+    if (!comparable(sink, "asyncapi", { base: pair.base.asyncapi, current: pair.current.asyncapi }))
+        return;
+    const base = firstWins(valueOr(pair.base.asyncapi), (m) => m.name);
+    const current = firstWins(valueOr(pair.current.asyncapi), (m) => m.name);
+    for (const [name] of [...current].sort(byKey)) {
+        if (!base.has(name))
+            sink.findings.push(found("diff.message-added", `message '${name}' added since base`));
+    }
+    for (const [name] of [...base].sort(byKey)) {
+        if (current.has(name))
+            continue;
+        // Fleet-global join: a name another current service still declares is not
+        // orphaned (positive evidence only — an unreadable contract never vouches).
+        const elsewhere = victims.declarers(name).filter((d) => d !== sink.id);
+        if (elsewhere.length > 0) {
+            sink.findings.push(found("diff.message-removed", `message '${name}' was removed since base; still declared by ${elsewhere.join(", ")}`));
+            continue;
+        }
+        const scan = await victims.messageConsumers(sink.id, name);
+        if (scan.victims.length > 0) {
+            sink.findings.push(found("diff.message-removed-consumed", `message '${name}' was removed since base and the current fleet still consumes it — these joins break`, [...scan.victims, ...scan.suspended]));
+        }
+        else if (scan.suspended.length > 0) {
+            sink.findings.push(found("diff.message-removed", `message '${name}' was removed since base; whether anything still consumes it could NOT be fully answered — ${scan.suspended.length} consumer document(s) were not scannable`, scan.suspended));
+        }
+        else {
+            sink.findings.push(found("diff.message-removed", `message '${name}' was removed since base; nothing currently consumes it`));
+        }
+    }
+}
+/** The graded join changes (`victims.ts`) as findings on each PROVIDER — the service whose surface the join lands on. */
+function consumerFindings(input) {
+    const changes = consumerJoinChanges({
+        base: input.base.services,
+        baseAmbiguous: new Set(input.base.ambiguous.keys()),
+        current: input.current.services,
+        currentAmbiguous: new Set(input.current.ambiguous.keys()),
+    });
+    const byProvider = new Map();
+    for (const { t, change } of changes) {
+        const what = t.kind === "op" ? `operation '${t.token}'` : `message '${t.token}'`;
+        const message = change === "added"
+            ? `${t.consumer}'s living requirements now name this service's ${what} — a cross-service join appeared since base`
+            : `${t.consumer}'s living requirements no longer name this service's ${what} — a cross-service join went away`;
+        // The call sits directly in the push — assigned to a `const x = found(…)`
+        // it reads as an arrow-function DECLARATION to the stable-code collector,
+        // and both consumer codes silently leave the guarded set.
+        byProvider.set(t.provider, [
+            ...(byProvider.get(t.provider) ?? []),
+            found(change === "added" ? "diff.consumer-added" : "diff.consumer-removed", message),
+        ]);
+    }
+    return byProvider;
+}
+async function diffService(unit) {
+    const sink = { id: unit.id, change: "unchanged", findings: [], unreadable: [] };
+    if (unit.base === undefined)
+        sink.findings.push(found("diff.service-added", `service '${unit.id}' added since base`));
+    if (unit.current === undefined && unit.base !== undefined) {
+        sink.findings.push(found("diff.service-removed", `service '${unit.id}' (${unit.base.dir}) is gone from the working tree`));
+    }
+    const pair = { base: unit.base ?? emptyState(unit.id), current: unit.current ?? emptyState(unit.id) };
+    requirementsDiff(sink, pair);
+    await opsDiff(sink, pair, unit.victims);
+    await messagesDiff(sink, pair, unit.victims);
+    return sink;
+}
+export async function computeDiff(input) {
+    const sides = [input.base.services, input.base.ambiguous, input.current.services, input.current.ambiguous];
+    const ids = [...new Set(sides.flatMap((side) => [...side.keys()]))].sort();
+    const joins = consumerFindings({ base: input.base, current: input.current });
+    const services = [];
+    // Sequential on purpose: the report's order IS the contract (identical
+    // states must emit identical bytes), the work per service is in-memory
+    // joins, and the one expensive read — the victim index's landscape — is
+    // memoised behind its first ask, so a fan-out would buy nothing.
+    for (const id of ids) {
+        const claimants = [...(input.base.ambiguous.get(id) ?? []), ...(input.current.ambiguous.get(id) ?? [])];
+        if (claimants.length > 0) {
+            // An id two directories claim — either side — has no single state to
+            // diff; the whole subject suspends (containment), and the live walk's
+            // `subsystem.name-collision` names the same defect for validate.
+            services.push({ id, change: "changed", findings: [], unreadable: [], ambiguous: claimants });
+            continue;
+        }
+        const sink = await diffService({ id, base: input.base.services.get(id), current: input.current.services.get(id), victims: input.victims });
+        sink.findings.push(...(joins.get(id) ?? []));
+        if (input.base.services.has(id) && !input.current.services.has(id))
+            sink.change = "removed";
+        else if (!input.base.services.has(id))
+            sink.change = "added";
+        else
+            sink.change = sink.findings.length > 0 || sink.unreadable.length > 0 ? "changed" : "unchanged";
+        services.push(sink);
+    }
+    const all = services.flatMap((s) => s.findings);
+    const count = (codes) => all.filter(codes).length;
+    return {
+        services,
+        breaking: all.some((f) => f.severity === "error"),
+        summary: {
+            added: count((f) => f.code.endsWith("-added")),
+            removed: count((f) => f.code.endsWith("-removed") || f.code.endsWith("-removed-consumed")),
+            modified: count((f) => f.code === "diff.requirement-modified"),
+            deprecated: count((f) => f.code === "diff.op-deprecated"),
+            unreadable: services.reduce((n, s) => n + s.unreadable.length, 0) +
+                services.filter((s) => s.ambiguous !== undefined).length,
+        },
+    };
+}
+//# sourceMappingURL=semantic.js.map

package/dist/core/diff/semantic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.js","sourceRoot":"","sources":["../../../src/core/diff/semantic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EAAE,iBAAiB,EAAoB,MAAM,qBAAqB,CAAC;AAI1E,OAAO,EAAE,mBAAmB,EAAoB,MAAM,cAAc,CAAC;AAqCrE,uFAAuF;AACvF,MAAM,aAAa,GAA+B;IAChD,oBAAoB,EAAE,IAAI;IAC1B,sBAAsB,EAAE,MAAM;IAC9B,wBAAwB,EAAE,IAAI;IAC9B,0BAA0B,EAAE,MAAM;IAClC,2BAA2B,EAAE,IAAI;IACjC,eAAe,EAAE,IAAI;IACrB,iBAAiB,EAAE,MAAM;IACzB,0BAA0B,EAAE,OAAO;IACnC,oBAAoB,EAAE,MAAM;IAC5B,oBAAoB,EAAE,IAAI;IAC1B,sBAAsB,EAAE,MAAM;IAC9B,+BAA+B,EAAE,OAAO;IACxC,qBAAqB,EAAE,IAAI;IAC3B,uBAAuB,EAAE,IAAI;CAC9B,CAAC;AAEF,SAAS,KAAK,CAAC,IAAc,EAAE,OAAe,EAAE,OAAkB;IAChE,MAAM,KAAK,GAAG,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1D,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACzF,CAAC;AA2BD,0EAA0E;AAC1E,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAW,CAAC;AAC3C,MAAM,UAAU,GAAG,CAAC,EAAU,EAAgB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;AAEtI;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAiB,EAAE,IAA6B,EAAE,IAA+D;IACnI,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,SAAS,CAAU,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAC9G,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,YAAY,CAAC;AAC/E,CAAC;AAED,MAAM,OAAO,GAAG,CAAI,IAAoB,EAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE3F,mHAAmH;AACnH,MAAM,MAAM,GAAG,CAAC,CAAc,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAClG,MAAM,QAAQ,GAAG,CAAC,CAAc,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAEnG,mHAAmH;AACnH,SAAS,SAAS,CAAI,KAAU,EAAE,GAAwB;IACxD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kGAAkG;AAClG,MAAM,KAAK,GAAG,CAAI,CAAc,EAAE,CAAc,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEpF,SAAS,gBAAgB,CAAC,IAAiB,EAAE,IAAmD;IAC9F,qEAAqE;IACrE,yEAAyE;IACzE,uEAAuE;IACvE,yEAAyE;IACzE,0EAA0E;IAC1E,MAAM,cAAc,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACtG,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3F,IAAI,CAAC,cAAc;QAAE,OAAO;IAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;IAC9D,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE,yCAAyC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;aAClI,IAAI,iBAAiB,CAAC,MAAM,CAAC,KAAK,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,2BAA2B,EAAE,4CAA4C,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,0BAA0B,EAAE,2CAA2C,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1I,CAAC;AACH,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,IAAiB,EAAE,IAAmD,EAAE,OAAoB;IACjH,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAAE,OAAO;IACrG,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACxE,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,cAAc,EAAE,uBAAuB,EAAE,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3H,CAAC;aAAM,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACpD,gHAAgH;YAChH,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,oCAAoC;gBACjG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,+DAA+D;oBAC7F,CAAC,CAAC,8BAA8B,CAAC;YACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,EAAE,cAAc,EAAE,gCAAgC,MAAM,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClJ,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC9B,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,0BAA0B,EAAE,cAAc,EAAE,mFAAmF,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACnM,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,0EAA0E;YAC1E,0EAA0E;YAC1E,+CAA+C;YAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,cAAc,EAAE,oGAAoG,IAAI,CAAC,SAAS,CAAC,MAAM,0CAA0C,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QACpP,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,cAAc,EAAE,oFAAoF,CAAC,CAAC,CAAC;QACrJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,KAAK,UAAU,YAAY,CAAC,IAAiB,EAAE,IAAmD,EAAE,OAAoB;IACtH,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QAAE,OAAO;IACxG,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,EAAE,YAAY,IAAI,oBAAoB,CAAC,CAAC,CAAC;IAC7G,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAChC,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;QACvE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,YAAY,IAAI,+CAA+C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACzI,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,EAAE,YAAY,IAAI,sFAAsF,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3M,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,YAAY,IAAI,8FAA8F,IAAI,CAAC,SAAS,CAAC,MAAM,0CAA0C,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QACnP,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,YAAY,IAAI,yDAAyD,CAAC,CAAC,CAAC;QAC/H,CAAC;IACH,CAAC;AACH,CAAC;AAED,yHAAyH;AACzH,SAAS,gBAAgB,CAAC,KAAiD;IACzE,MAAM,OAAO,GAAG,mBAAmB,CAAC;QAClC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ;QACzB,aAAa,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACnD,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ;QAC/B,gBAAgB,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;KAC1D,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;IAChD,KAAK,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,KAAK,GAAG,CAAC;QACjF,MAAM,OAAO,GAAG,MAAM,KAAK,OAAO;YAChC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,kDAAkD,IAAI,6CAA6C;YAClH,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,wDAAwD,IAAI,mCAAmC,CAAC;QACjH,0EAA0E;QAC1E,0EAA0E;QAC1E,0DAA0D;QAC1D,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE;YACzB,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,uBAAuB,EAAE,OAAO,CAAC;SACrF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,KAAK,UAAU,WAAW,CAAC,IAAuF;IAChH,MAAM,IAAI,GAAgB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC7F,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;QAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,EAAE,YAAY,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC;IACtH,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC1D,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,YAAY,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,iCAAiC,CAAC,CAAC,CAAC;IAC7H,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IACtG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,MAAM,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAuE;IACvG,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC3G,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3E,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,uEAAuE;IACvE,uEAAuE;IACvE,wEAAwE;IACxE,iEAAiE;IACjE,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,qEAAqE;YACrE,sEAAsE;YACtE,iEAAiE;YACjE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;YAC7F,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QAC3I,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACvF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;;YACxD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;QACpG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,CAAC,KAA8B,EAAU,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACnF,OAAO;QACL,QAAQ;QACR,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC;QACjD,OAAO,EAAE;YACP,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC9C,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;YAC1F,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,2BAA2B,CAAC;YAC9D,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC;YACzD,UAAU,EACR,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;gBACrD,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,MAAM;SAC3D;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * The diff computation: join the base fleet (`./base-state.ts`) against the\n * working tree (`./current-state.ts`) and say, per service, what changed in\n * FLEET-MEANINGFUL terms — requirements by identity and digest, operations\n * and messages by their join tokens, cross-service joins by tuple — with the\n * current consumers of every removal named (`./victims.ts`).\n *\n * Two disciplines rule every branch here. Removal is graded against who still\n * depends on it: a removal nobody names is a warning, a removal the fleet\n * still joins to is an error and sets `breaking`. And \"nobody could look\" is\n * never \"nothing changed\": an unreadable artifact on EITHER side suspends\n * that subject's axis — recorded in `unreadable[]`, counted in the summary,\n * carried into the exit code by the command — instead of letting an\n * unreadable base read as everything-added or an unreadable working file\n * read as everything-removed.\n */\nimport { requirementDigest, type Requirement } from \"../document/spec.js\";\nimport type { Severity, Finding } from \"../vocabulary/report.js\";\nimport type { AxisState, BaseFleet, ServiceState } from \"./base-state.js\";\nimport type { CurrentFleet } from \"./current-state.js\";\nimport { consumerJoinChanges, type VictimIndex } from \"./victims.js\";\n\n/**\n * The stable finding codes `loam diff` emits. Codes are the machine contract;\n * prose may be reworded, these may not. Documented (backticked) in the\n * generated AGENTS.md's diff section — codes-drift enforces that.\n */\nexport type DiffCode =\n  /** A `services/<id>/` directory exists now that did not at the base ref. */\n  | \"diff.service-added\"\n  /** A service present at the base ref is gone from the working tree. */\n  | \"diff.service-removed\"\n  /** A living requirement (by `Requirement-ID:`, else heading) not present at base. */\n  | \"diff.requirement-added\"\n  /** A base requirement no longer in the living spec. */\n  | \"diff.requirement-removed\"\n  /** Same requirement identity on both sides, `requirementDigest` moved — rebase pins never move it. */\n  | \"diff.requirement-modified\"\n  /** An operationId in the living contract absent at base. */\n  | \"diff.op-added\"\n  /** A base operationId gone from the living contract, and no current consumer names it. */\n  | \"diff.op-removed\"\n  /** Removed since base AND the current fleet still names it — landscape edge or foreign living requirement; details list the victims. Sets `breaking`. */\n  | \"diff.op-removed-consumed\"\n  /** `deprecated: true` introduced since base; details name the current consumers. */\n  | \"diff.op-deprecated\"\n  /** An AsyncAPI message name absent at base. */\n  | \"diff.message-added\"\n  /** A base message gone, nothing currently consumes it (or another service still declares it — the details say). */\n  | \"diff.message-removed\"\n  /** Removed since base AND still consumed — a `Consumes:` line or a consumes-edge; details list the victims. Sets `breaking`. */\n  | \"diff.message-removed-consumed\"\n  /** A cross-service join appeared since base: another service's living requirement now names this service's operation or message. */\n  | \"diff.consumer-added\"\n  /** A cross-service join present at base is gone. */\n  | \"diff.consumer-removed\";\n\n/** Severity is a fact about the code, not a call-site choice — one table, no drift. */\nconst DIFF_SEVERITY: Record<DiffCode, Severity> = {\n  \"diff.service-added\": \"ok\",\n  \"diff.service-removed\": \"warn\",\n  \"diff.requirement-added\": \"ok\",\n  \"diff.requirement-removed\": \"warn\",\n  \"diff.requirement-modified\": \"ok\",\n  \"diff.op-added\": \"ok\",\n  \"diff.op-removed\": \"warn\",\n  \"diff.op-removed-consumed\": \"error\",\n  \"diff.op-deprecated\": \"warn\",\n  \"diff.message-added\": \"ok\",\n  \"diff.message-removed\": \"warn\",\n  \"diff.message-removed-consumed\": \"error\",\n  \"diff.consumer-added\": \"ok\",\n  \"diff.consumer-removed\": \"ok\",\n};\n\nfunction found(code: DiffCode, message: string, details?: string[]): Finding {\n  const carry = details !== undefined && details.length > 0;\n  return { severity: DIFF_SEVERITY[code], code, message, ...(carry ? { details } : {}) };\n}\n\n/** One suspended axis: which side could not be read, and why. */\nexport interface UnreadableEntry {\n  side: \"base\" | \"current\";\n  axis: \"spec\" | \"archSpec\" | \"openapi\" | \"asyncapi\";\n  path: string;\n  error: string;\n}\n\nexport interface ServiceDiff {\n  id: string;\n  change: \"added\" | \"removed\" | \"changed\" | \"unchanged\";\n  findings: Finding[];\n  unreadable: UnreadableEntry[];\n  /** Directories claiming this id when more than one does, on either side — every finding suspended. */\n  ambiguous?: string[];\n}\n\nexport interface FleetDiff {\n  services: ServiceDiff[];\n  /** True iff any error-severity finding — a removal the fleet still consumes. */\n  breaking: boolean;\n  /** `unreadable` counts suspended axes plus ambiguous base identities: places nobody could look. */\n  summary: { added: number; removed: number; modified: number; deprecated: number; unreadable: number };\n}\n\n/** A side the service does not exist on: absence everywhere, honestly. */\nconst ABSENT = { kind: \"absent\" } as const;\nconst emptyState = (id: string): ServiceState => ({ id, dir: \"\", spec: ABSENT, archSpec: ABSENT, openapi: ABSENT, asyncapi: ABSENT });\n\n/**\n * Guard one axis pair: record unreadable sides on the sink and say whether\n * the axis may be compared at all. Reading one good side against a suspended\n * one would grade absence it never proved.\n */\nfunction comparable(sink: ServiceDiff, axis: UnreadableEntry[\"axis\"], pair: { base: AxisState<unknown>; current: AxisState<unknown> }): boolean {\n  for (const side of [\"base\", \"current\"] as const) {\n    const state = pair[side];\n    if (state.kind === \"unreadable\") sink.unreadable.push({ side, axis, path: state.path, error: state.error });\n  }\n  return pair.base.kind !== \"unreadable\" && pair.current.kind !== \"unreadable\";\n}\n\nconst valueOr = <T>(axis: AxisState<T[]>): T[] => (axis.kind === \"read\" ? axis.value : []);\n\n/** Identity: `Requirement-ID:` when authored, the heading otherwise — the same join `loam rebase` pins against. */\nconst reqKey = (r: Requirement): string => (r.id !== undefined ? `id:${r.id}` : `name:${r.name}`);\nconst reqLabel = (r: Requirement): string => (r.id !== undefined ? `${r.name} [${r.id}]` : r.name);\n\n/** First declaration wins a duplicated key — the same arbitrary-but-stated pick every join on these axes makes. */\nfunction firstWins<T>(items: T[], key: (item: T) => string): Map<string, T> {\n  const map = new Map<string, T>();\n  for (const item of items) if (!map.has(key(item))) map.set(key(item), item);\n  return map;\n}\n\n/** Entry comparator by map key — explicit, because the default sort stringifies whole entries. */\nconst byKey = <T>(a: [string, T], b: [string, T]): number => (a[0] < b[0] ? -1 : 1);\n\nfunction requirementsDiff(sink: ServiceDiff, pair: { base: ServiceState; current: ServiceState }): void {\n  // v1 diffs spec.md's requirements only; arch.spec.md is read for the\n  // Consumes: join but its requirement inventory is deferred (the two axes\n  // are separate namespaces, and diffing both doubles the surface). Both\n  // pairs are guarded BEFORE the early return, so a service whose two spec\n  // files are both unreadable reports both suspensions, not just the first.\n  const specComparable = comparable(sink, \"spec\", { base: pair.base.spec, current: pair.current.spec });\n  comparable(sink, \"archSpec\", { base: pair.base.archSpec, current: pair.current.archSpec });\n  if (!specComparable) return;\n  const base = firstWins(valueOr(pair.base.spec), reqKey);\n  const current = firstWins(valueOr(pair.current.spec), reqKey);\n  for (const [key, r] of [...current].sort(byKey)) {\n    const before = base.get(key);\n    if (before === undefined) sink.findings.push(found(\"diff.requirement-added\", `living requirement added since base: '${reqLabel(r)}'`));\n    else if (requirementDigest(before) !== requirementDigest(r)) {\n      sink.findings.push(found(\"diff.requirement-modified\", `living requirement modified since base: '${reqLabel(r)}'`));\n    }\n  }\n  for (const [key, r] of [...base].sort(byKey)) {\n    if (!current.has(key)) sink.findings.push(found(\"diff.requirement-removed\", `living requirement removed since base: '${reqLabel(r)}'`));\n  }\n}\n\nasync function opsDiff(sink: ServiceDiff, pair: { base: ServiceState; current: ServiceState }, victims: VictimIndex): Promise<void> {\n  if (!comparable(sink, \"openapi\", { base: pair.base.openapi, current: pair.current.openapi })) return;\n  const base = firstWins(valueOr(pair.base.openapi), (op) => op.id);\n  const current = firstWins(valueOr(pair.current.openapi), (op) => op.id);\n  for (const [id, op] of [...current].sort(byKey)) {\n    const before = base.get(id);\n    if (before === undefined) {\n      sink.findings.push(found(\"diff.op-added\", `operation '${id}' added since base (${op.method.toUpperCase()} ${op.path})`));\n    } else if (!before.deprecated && op.deprecated) {\n      const scan = await victims.opConsumers(sink.id, id);\n      // Three honest phrasings — never a confident negative over a scan that skipped an unreadable consumer document.\n      const stance = scan.victims.length > 0 ? `${scan.victims.length} current consumer(s) still name it`\n        : scan.suspended.length > 0 ? \"whether current consumers name it could not be fully answered\"\n        : \"no current consumer names it\";\n      sink.findings.push(found(\"diff.op-deprecated\", `operation '${id}' is deprecated since base — ${stance}`, [...scan.victims, ...scan.suspended]));\n    }\n  }\n  for (const [id] of [...base].sort(byKey)) {\n    if (current.has(id)) continue;\n    const scan = await victims.opConsumers(sink.id, id);\n    if (scan.victims.length > 0) {\n      sink.findings.push(found(\"diff.op-removed-consumed\", `operation '${id}' was removed since base and the current fleet still names it — these joins break`, [...scan.victims, ...scan.suspended]));\n    } else if (scan.suspended.length > 0) {\n      // \"Nobody could be scanned\" is not \"nobody names it\" — the consumer's own\n      // unreadable[] entry already carries the run to exit 1; this message must\n      // not assert a negative the scan never proved.\n      sink.findings.push(found(\"diff.op-removed\", `operation '${id}' was removed since base; whether the current fleet still names it could NOT be fully answered — ${scan.suspended.length} consumer document(s) were not scannable`, scan.suspended));\n    } else {\n      sink.findings.push(found(\"diff.op-removed\", `operation '${id}' was removed since base; no current landscape edge or living requirement names it`));\n    }\n  }\n}\n\nasync function messagesDiff(sink: ServiceDiff, pair: { base: ServiceState; current: ServiceState }, victims: VictimIndex): Promise<void> {\n  if (!comparable(sink, \"asyncapi\", { base: pair.base.asyncapi, current: pair.current.asyncapi })) return;\n  const base = firstWins(valueOr(pair.base.asyncapi), (m) => m.name);\n  const current = firstWins(valueOr(pair.current.asyncapi), (m) => m.name);\n  for (const [name] of [...current].sort(byKey)) {\n    if (!base.has(name)) sink.findings.push(found(\"diff.message-added\", `message '${name}' added since base`));\n  }\n  for (const [name] of [...base].sort(byKey)) {\n    if (current.has(name)) continue;\n    // Fleet-global join: a name another current service still declares is not\n    // orphaned (positive evidence only — an unreadable contract never vouches).\n    const elsewhere = victims.declarers(name).filter((d) => d !== sink.id);\n    if (elsewhere.length > 0) {\n      sink.findings.push(found(\"diff.message-removed\", `message '${name}' was removed since base; still declared by ${elsewhere.join(\", \")}`));\n      continue;\n    }\n    const scan = await victims.messageConsumers(sink.id, name);\n    if (scan.victims.length > 0) {\n      sink.findings.push(found(\"diff.message-removed-consumed\", `message '${name}' was removed since base and the current fleet still consumes it — these joins break`, [...scan.victims, ...scan.suspended]));\n    } else if (scan.suspended.length > 0) {\n      sink.findings.push(found(\"diff.message-removed\", `message '${name}' was removed since base; whether anything still consumes it could NOT be fully answered — ${scan.suspended.length} consumer document(s) were not scannable`, scan.suspended));\n    } else {\n      sink.findings.push(found(\"diff.message-removed\", `message '${name}' was removed since base; nothing currently consumes it`));\n    }\n  }\n}\n\n/** The graded join changes (`victims.ts`) as findings on each PROVIDER — the service whose surface the join lands on. */\nfunction consumerFindings(input: { base: BaseFleet; current: CurrentFleet }): Map<string, Finding[]> {\n  const changes = consumerJoinChanges({\n    base: input.base.services,\n    baseAmbiguous: new Set(input.base.ambiguous.keys()),\n    current: input.current.services,\n    currentAmbiguous: new Set(input.current.ambiguous.keys()),\n  });\n  const byProvider = new Map<string, Finding[]>();\n  for (const { t, change } of changes) {\n    const what = t.kind === \"op\" ? `operation '${t.token}'` : `message '${t.token}'`;\n    const message = change === \"added\"\n      ? `${t.consumer}'s living requirements now name this service's ${what} — a cross-service join appeared since base`\n      : `${t.consumer}'s living requirements no longer name this service's ${what} — a cross-service join went away`;\n    // The call sits directly in the push — assigned to a `const x = found(…)`\n    // it reads as an arrow-function DECLARATION to the stable-code collector,\n    // and both consumer codes silently leave the guarded set.\n    byProvider.set(t.provider, [\n      ...(byProvider.get(t.provider) ?? []),\n      found(change === \"added\" ? \"diff.consumer-added\" : \"diff.consumer-removed\", message),\n    ]);\n  }\n  return byProvider;\n}\n\nasync function diffService(unit: { id: string; base?: ServiceState; current?: ServiceState; victims: VictimIndex }): Promise<ServiceDiff> {\n  const sink: ServiceDiff = { id: unit.id, change: \"unchanged\", findings: [], unreadable: [] };\n  if (unit.base === undefined) sink.findings.push(found(\"diff.service-added\", `service '${unit.id}' added since base`));\n  if (unit.current === undefined && unit.base !== undefined) {\n    sink.findings.push(found(\"diff.service-removed\", `service '${unit.id}' (${unit.base.dir}) is gone from the working tree`));\n  }\n  const pair = { base: unit.base ?? emptyState(unit.id), current: unit.current ?? emptyState(unit.id) };\n  requirementsDiff(sink, pair);\n  await opsDiff(sink, pair, unit.victims);\n  await messagesDiff(sink, pair, unit.victims);\n  return sink;\n}\n\nexport async function computeDiff(input: { base: BaseFleet; current: CurrentFleet; victims: VictimIndex }): Promise<FleetDiff> {\n  const sides = [input.base.services, input.base.ambiguous, input.current.services, input.current.ambiguous];\n  const ids = [...new Set(sides.flatMap((side) => [...side.keys()]))].sort();\n  const joins = consumerFindings({ base: input.base, current: input.current });\n  const services: ServiceDiff[] = [];\n  // Sequential on purpose: the report's order IS the contract (identical\n  // states must emit identical bytes), the work per service is in-memory\n  // joins, and the one expensive read — the victim index's landscape — is\n  // memoised behind its first ask, so a fan-out would buy nothing.\n  for (const id of ids) {\n    const claimants = [...(input.base.ambiguous.get(id) ?? []), ...(input.current.ambiguous.get(id) ?? [])];\n    if (claimants.length > 0) {\n      // An id two directories claim — either side — has no single state to\n      // diff; the whole subject suspends (containment), and the live walk's\n      // `subsystem.name-collision` names the same defect for validate.\n      services.push({ id, change: \"changed\", findings: [], unreadable: [], ambiguous: claimants });\n      continue;\n    }\n    const sink = await diffService({ id, base: input.base.services.get(id), current: input.current.services.get(id), victims: input.victims });\n    sink.findings.push(...(joins.get(id) ?? []));\n    if (input.base.services.has(id) && !input.current.services.has(id)) sink.change = \"removed\";\n    else if (!input.base.services.has(id)) sink.change = \"added\";\n    else sink.change = sink.findings.length > 0 || sink.unreadable.length > 0 ? \"changed\" : \"unchanged\";\n    services.push(sink);\n  }\n  const all = services.flatMap((s) => s.findings);\n  const count = (codes: (f: Finding) => boolean): number => all.filter(codes).length;\n  return {\n    services,\n    breaking: all.some((f) => f.severity === \"error\"),\n    summary: {\n      added: count((f) => f.code.endsWith(\"-added\")),\n      removed: count((f) => f.code.endsWith(\"-removed\") || f.code.endsWith(\"-removed-consumed\")),\n      modified: count((f) => f.code === \"diff.requirement-modified\"),\n      deprecated: count((f) => f.code === \"diff.op-deprecated\"),\n      unreadable:\n        services.reduce((n, s) => n + s.unreadable.length, 0) +\n        services.filter((s) => s.ambiguous !== undefined).length,\n    },\n  };\n}\n"]}

package/dist/core/diff/victims.js

@@ -0,0 +1,247 @@
+/**
+ * Who, in the CURRENT fleet, still depends on a thing the diff says was
+ * removed or deprecated — the joins that turn "an operation left the
+ * contract" into "and these named consumers break".
+ *
+ * THREE SOURCES answer that, and only the first two are copies of anything.
+ *
+ * The first two are deliberately a SECOND copy of the consumer join the
+ * coherence gate asks, built on the same shared primitives, and both copies
+ * say so:
+ *
+ *  - the operation half mirrors `core/coherence/lookups.ts`'s
+ *    `edgeConsumers`/`requirementConsumers` (landscape edges with
+ *    `metadata { op }` resolved through `serviceResolver` WITH the enumerated
+ *    fleet — the container lesson recorded there — plus other services'
+ *    living `Operations:` lines, spec.md only, exactly as that module scans);
+ *  - the message half mirrors `core/coherence/events/lookups.ts`'s
+ *    `messageConsumers` (every `consumes` edge naming the message except one
+ *    INTO the provider, plus other services' `Consumes:` lines over BOTH spec
+ *    axes — the outbox requirement lives in arch.spec.md as often as in
+ *    spec.md, that module's lesson).
+ *
+ * The copies cannot be one module today: coherence's lookups are closures
+ * over a feature's `DeltaScope` and its lazy caches; this one is an index
+ * over an already-read fleet. Rule 13 (docs/DESIGN.md) governs — a THIRD
+ * copy of this join forces the shared extraction, and whoever changes the
+ * victim strings or the scan rules in either module owes the other the same
+ * change. The victim string spellings are kept byte-compatible with the
+ * coherence findings on purpose, so a reader meets one vocabulary.
+ *
+ * The THIRD source is not a copy and does not fall under that rule: the fleet's
+ * USE CASES, joined in `core/usecases/operations.ts`. A hop of a
+ * capability-tagged `dynamic view` that the model attributes to the operation
+ * being removed is a business flow that stops working, and saying so — "step 4
+ * of Checkout breaks" — is the only one of the three that names a consequence a
+ * human weighs rather than a document they then have to open. It has its own
+ * module because it asks a different question of a different reader (an
+ * attribution over the whole `architecture/` PROJECT, not a scan of one
+ * landscape file), and because the attributed/contested distinction it turns on
+ * belongs beside `attributeStep`, not beside a requirement scan. Coherence has
+ * no equivalent to keep in step with, so nothing here owes it a mirror.
+ */
+import { existsSync } from "node:fs";
+import {} from "../c4/likec4.js";
+import { serviceResolver } from "../c4/resolve/service.js";
+import { landscapePath } from "../repo/paths.js";
+import { readUseCases } from "../usecases/fleet.js";
+import { hopsConsuming, hopsExercising } from "../usecases/operations.js";
+/** The requirements one current service contributes to a scan, per axis rule. */
+function reqsOf(state, axes) {
+    return axes.flatMap((axis) => {
+        const a = state[axis];
+        return a.kind === "read" ? a.value : [];
+    });
+}
+const EDGE = (resolve, r) => `edge ${resolve(r.source)} → ${resolve(r.target)}${r.title === undefined ? "" : ` ("${r.title}")`}`;
+/** Entry comparator by map key — deterministic suspension order. */
+const byFirst = (a, b) => (a[0] < b[0] ? -1 : 1);
+export function victimIndex(snap) {
+    // Lazy on purpose, the coherence lookups' own discipline: the landscape is
+    // a full LikeC4 workspace spin-up, and a diff that removes nothing must not
+    // pay for it. An absent landscape proves nothing; an unreadable one proves
+    // nothing either way — `landscape.invalid` is validate's finding to make,
+    // and inventing victims out of a parse error would point the reader at the
+    // wrong file (core/coherence/lookups.ts's doctrine, verbatim).
+    let drawn;
+    const landscape = () => (drawn ??= (async () => {
+        const path = landscapePath(snap.docsDir);
+        const doc = existsSync(path) ? await snap.context.loadLikeC4(path) : null;
+        const usable = doc !== null && doc.errors.length === 0 ? doc : null;
+        // The enumerated fleet rides into the resolver so a landscape that
+        // models CONTAINERS stays visible: without `known`, an edge into
+        // `payment.api` resolves to a service called "api" that has never
+        // existed and the join finds nobody — the exact defect DESIGN's
+        // serviceResolver-known row records.
+        return {
+            usable,
+            resolve: usable === null ? null : serviceResolver(usable.elements, new Set(snap.current.keys())),
+        };
+    })());
+    // Sorted, so victim order never depends on the enumeration's walk order.
+    const ids = [...snap.current.keys()].sort();
+    /**
+     * The use-case half, lazy for the same reason and one step further.
+     *
+     * `readUseCases` carries its own cheap gate — a byte scan for the reserved
+     * tag prefix — so a fleet that declares no use case never starts LikeC4 here
+     * at all, and a fleet that does pays for the `architecture/` project exactly
+     * once per `loam diff`, at the first removal that asks. The fleet set is the
+     * same one the landscape resolver above is built from, so the two halves
+     * cannot disagree about which service an element stands for.
+     */
+    let flows;
+    const useCases = () => (flows ??= readUseCases({ docsDir: snap.docsDir, known: new Set(snap.current.keys()) }));
+    /**
+     * The requirement half of one scan, `tupleVisible`'s own discipline applied
+     * to victims: an unreadable consumer axis contributes a SUSPENSION, never a
+     * silent nothing — "consuming nothing" and "loam refused to read the file"
+     * are opposite facts, and collapsing them is how a breaking removal used to
+     * grade down to a confident warning.
+     */
+    const scanRequirements = (unit) => {
+        const out = { victims: [], suspended: [] };
+        for (const other of ids.filter((id) => id !== unit.provider)) {
+            const state = snap.current.get(other);
+            for (const axis of unit.axes) {
+                const a = state[axis];
+                if (a.kind === "unreadable") {
+                    out.suspended.push(`${other} — ${a.path} could not be read, so its requirements could not be scanned`);
+                    continue;
+                }
+                if (a.kind !== "read")
+                    continue;
+                for (const r of a.value)
+                    if (unit.hit(r))
+                        out.victims.push(`${other}'s living requirement '${r.name}'`);
+            }
+        }
+        for (const [id, dirs] of [...snap.ambiguous].sort(byFirst)) {
+            if (id !== unit.provider)
+                out.suspended.push(`${id} — claimed by ${dirs.join(" and ")}, so its documents could not be scanned`);
+        }
+        return out;
+    };
+    const opConsumers = async (provider, op) => {
+        const { usable, resolve } = await landscape();
+        const scan = scanRequirements({ provider, axes: ["spec"], hit: (r) => r.operations.includes(op) });
+        const edges = [];
+        if (usable !== null && resolve !== null) {
+            for (const r of usable.relationships) {
+                if (r.op === op && resolve(r.target) === provider)
+                    edges.push(EDGE(resolve, r));
+            }
+        }
+        // Flows last in each list, deliberately: the edge and the requirement say
+        // WHICH document to open, and the flow says what the reader is about to
+        // break — so a `details[]` scanned top-down ends on the consequence.
+        const hops = hopsExercising(await useCases(), { provider, op });
+        return {
+            victims: [...edges, ...scan.victims, ...hops.breaks],
+            suspended: [...scan.suspended, ...hops.unsure],
+        };
+    };
+    const messageConsumers = async (provider, name) => {
+        const { usable, resolve } = await landscape();
+        const scan = scanRequirements({ provider, axes: ["spec", "archSpec"], hit: (r) => r.consumes.includes(name) });
+        const edges = [];
+        if (usable !== null && resolve !== null) {
+            for (const r of usable.relationships) {
+                // The message join is fleet-global, so every edge naming it counts —
+                // except one into the provider itself, whose consumption leaves with
+                // the same change (events/lookups.ts's exclusion, verbatim).
+                if (r.consumes === name && resolve(r.target) !== provider)
+                    edges.push(EDGE(resolve, r));
+            }
+        }
+        const hops = hopsConsuming(await useCases(), { provider, name });
+        return { victims: [...edges, ...scan.victims, ...hops], suspended: scan.suspended };
+    };
+    const declarers = (name) => ids.filter((id) => {
+        const axis = snap.current.get(id).asyncapi;
+        return axis.kind === "read" && axis.value.some((m) => m.name === name);
+    });
+    return { opConsumers, messageConsumers, declarers };
+}
+/** The map key a tuple is joined on between the two states. */
+function tupleKey(t) {
+    return `${t.kind}\0${t.consumer}\0${t.provider}\0${t.token}`;
+}
+/**
+ * Every cross-service join one state holds, keyed for the base/current join.
+ * Axis rules mirror the two consumer scans above: `Operations:` from spec.md
+ * only, `Consumes:` from both spec axes. Unreadable axes simply contribute
+ * nothing here — `semantic.ts` guards the GRADING so a join is never called
+ * added or removed off a side nobody could read.
+ */
+export function consumerTuples(states) {
+    const providersOf = (pick) => {
+        const map = new Map();
+        for (const id of [...states.keys()].sort()) {
+            for (const token of pick(states.get(id)))
+                map.set(token, [...(map.get(token) ?? []), id]);
+        }
+        return map;
+    };
+    const opProviders = providersOf((s) => (s.openapi.kind === "read" ? s.openapi.value.map((op) => op.id) : []));
+    const msgProviders = providersOf((s) => (s.asyncapi.kind === "read" ? s.asyncapi.value.map((m) => m.name) : []));
+    const out = new Map();
+    const add = (t) => {
+        out.set(tupleKey(t), t);
+    };
+    for (const consumer of [...states.keys()].sort()) {
+        const state = states.get(consumer);
+        for (const r of reqsOf(state, ["spec"])) {
+            for (const op of r.operations) {
+                for (const p of opProviders.get(op) ?? [])
+                    if (p !== consumer)
+                        add({ kind: "op", consumer, provider: p, token: op });
+            }
+        }
+        for (const r of reqsOf(state, ["spec", "archSpec"])) {
+            for (const name of r.consumes) {
+                for (const p of msgProviders.get(name) ?? [])
+                    if (p !== consumer)
+                        add({ kind: "message", consumer, provider: p, token: name });
+            }
+        }
+    }
+    return out;
+}
+/** May a tuple be graded off this side? Absence answers; unreadable does not; an ambiguous base identity answers nothing. */
+function tupleVisible(states, ambiguous, t) {
+    if (ambiguous.has(t.consumer) || ambiguous.has(t.provider))
+        return false;
+    const readable = (id, axes) => {
+        const state = states.get(id);
+        return state === undefined || axes.every((axis) => state[axis].kind !== "unreadable");
+    };
+    return (readable(t.consumer, t.kind === "op" ? ["spec"] : ["spec", "archSpec"]) &&
+        readable(t.provider, [t.kind === "op" ? "openapi" : "asyncapi"]));
+}
+/**
+ * The joins that appeared or went away between base and current, sorted for
+ * deterministic output (provider, kind, token, consumer). The visibility
+ * guard is the containment rule: a join is never called "added" off a base
+ * side nobody could read, nor "removed" off an unreadable working file — the
+ * suspended axis already carries that fact.
+ */
+export function consumerJoinChanges(input) {
+    const baseTuples = consumerTuples(input.base);
+    const currentTuples = consumerTuples(input.current);
+    const graded = [];
+    for (const [key, t] of currentTuples) {
+        if (!baseTuples.has(key) && tupleVisible(input.base, input.baseAmbiguous, t))
+            graded.push({ t, change: "added" });
+    }
+    for (const [key, t] of baseTuples) {
+        if (!currentTuples.has(key) && tupleVisible(input.current, input.currentAmbiguous, t))
+            graded.push({ t, change: "removed" });
+    }
+    return graded.sort((a, b) => {
+        const ka = `${a.t.provider}\0${a.t.kind}\0${a.t.token}\0${a.t.consumer}\0${a.change}`;
+        const kb = `${b.t.provider}\0${b.t.kind}\0${b.t.token}\0${b.t.consumer}\0${b.change}`;
+        return ka < kb ? -1 : 1;
+    });
+}
+//# sourceMappingURL=victims.js.map

package/dist/core/diff/victims.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"victims.js","sourceRoot":"","sources":["../../../src/core/diff/victims.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAA4B,MAAM,iBAAiB,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAoB,MAAM,sBAAsB,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AA4B1E,iFAAiF;AACjF,SAAS,MAAM,CAAC,KAAmB,EAAE,IAAsC;IACzE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,OAA+B,EAAE,CAAM,EAAU,EAAE,CAC/D,QAAQ,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;AAEtG,oEAAoE;AACpE,MAAM,OAAO,GAAG,CAAI,CAAc,EAAE,CAAc,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAQtF,MAAM,UAAU,WAAW,CAAC,IAM3B;IACC,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,0EAA0E;IAC1E,2EAA2E;IAC3E,+DAA+D;IAC/D,IAAI,KAAiC,CAAC;IACtC,MAAM,SAAS,GAAG,GAAmB,EAAE,CACrC,CAAC,KAAK,KAAK,CAAC,KAAK,IAAoB,EAAE;QACrC,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzC,MAAM,GAAG,GAAqB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5F,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QACpE,mEAAmE;QACnE,iEAAiE;QACjE,kEAAkE;QAClE,gEAAgE;QAChE,qCAAqC;QACrC,OAAO;YACL,MAAM;YACN,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;SACjG,CAAC;IACJ,CAAC,CAAC,EAAE,CAAC,CAAC;IAER,yEAAyE;IACzE,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAE5C;;;;;;;;;OASG;IACH,IAAI,KAAuC,CAAC;IAC5C,MAAM,QAAQ,GAAG,GAAyB,EAAE,CAC1C,CAAC,KAAK,KAAK,YAAY,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3F;;;;;;OAMG;IACH,MAAM,gBAAgB,GAAG,CAAC,IAAoG,EAAgB,EAAE;QAC9I,MAAM,GAAG,GAAiB,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;QACzD,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;YACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtB,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;oBAC5B,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI,8DAA8D,CAAC,CAAC;oBACvG,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;oBAAE,SAAS;gBAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK;oBAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,0BAA0B,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YAC1G,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3D,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ;gBAAE,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,iBAAiB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC;QAClI,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,KAAK,EAAE,QAAgB,EAAE,EAAU,EAAyB,EAAE;QAChF,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,gBAAgB,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACnG,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBACrC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QACD,0EAA0E;QAC1E,wEAAwE;QACxE,qEAAqE;QACrE,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAChE,OAAO;YACL,OAAO,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;YACpD,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;SAC/C,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,KAAK,EAAE,QAAgB,EAAE,IAAY,EAAyB,EAAE;QACvF,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,gBAAgB,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/G,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBACrC,qEAAqE;gBACrE,qEAAqE;gBACrE,6DAA6D;gBAC7D,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACjE,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACtF,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,IAAY,EAAY,EAAE,CAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC;QAC5C,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEL,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC;AACtD,CAAC;AAeD,+DAA+D;AAC/D,SAAS,QAAQ,CAAC,CAAgB;IAChC,OAAO,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,MAAyC;IACtE,MAAM,WAAW,GAAG,CAAC,IAAmC,EAAyB,EAAE;QACjF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9G,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjH,MAAM,GAAG,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC7C,MAAM,GAAG,GAAG,CAAC,CAAgB,EAAQ,EAAE;QACrC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACxC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC9B,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;oBAAE,IAAI,CAAC,KAAK,QAAQ;wBAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YACvH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC;YACpD,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC9B,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;oBAAE,IAAI,CAAC,KAAK,QAAQ;wBAAE,GAAG,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YACjI,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6HAA6H;AAC7H,SAAS,YAAY,CAAC,MAAyC,EAAE,SAA8B,EAAE,CAAgB;IAC/G,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAC;IACzE,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,IAAsD,EAAW,EAAE;QAC/F,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;IACxF,CAAC,CAAC;IACF,OAAO,CACL,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACvE,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CACjE,CAAC;AACJ,CAAC;AAQD;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAKnC;IACC,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACpD,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,aAAa,EAAE,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACpH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,gBAAgB,EAAE,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAC/H,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACtF,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACtF,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Who, in the CURRENT fleet, still depends on a thing the diff says was\n * removed or deprecated — the joins that turn \"an operation left the\n * contract\" into \"and these named consumers break\".\n *\n * THREE SOURCES answer that, and only the first two are copies of anything.\n *\n * The first two are deliberately a SECOND copy of the consumer join the\n * coherence gate asks, built on the same shared primitives, and both copies\n * say so:\n *\n *  - the operation half mirrors `core/coherence/lookups.ts`'s\n *    `edgeConsumers`/`requirementConsumers` (landscape edges with\n *    `metadata { op }` resolved through `serviceResolver` WITH the enumerated\n *    fleet — the container lesson recorded there — plus other services'\n *    living `Operations:` lines, spec.md only, exactly as that module scans);\n *  - the message half mirrors `core/coherence/events/lookups.ts`'s\n *    `messageConsumers` (every `consumes` edge naming the message except one\n *    INTO the provider, plus other services' `Consumes:` lines over BOTH spec\n *    axes — the outbox requirement lives in arch.spec.md as often as in\n *    spec.md, that module's lesson).\n *\n * The copies cannot be one module today: coherence's lookups are closures\n * over a feature's `DeltaScope` and its lazy caches; this one is an index\n * over an already-read fleet. Rule 13 (docs/DESIGN.md) governs — a THIRD\n * copy of this join forces the shared extraction, and whoever changes the\n * victim strings or the scan rules in either module owes the other the same\n * change. The victim string spellings are kept byte-compatible with the\n * coherence findings on purpose, so a reader meets one vocabulary.\n *\n * The THIRD source is not a copy and does not fall under that rule: the fleet's\n * USE CASES, joined in `core/usecases/operations.ts`. A hop of a\n * capability-tagged `dynamic view` that the model attributes to the operation\n * being removed is a business flow that stops working, and saying so — \"step 4\n * of Checkout breaks\" — is the only one of the three that names a consequence a\n * human weighs rather than a document they then have to open. It has its own\n * module because it asks a different question of a different reader (an\n * attribution over the whole `architecture/` PROJECT, not a scan of one\n * landscape file), and because the attributed/contested distinction it turns on\n * belongs beside `attributeStep`, not beside a requirement scan. Coherence has\n * no equivalent to keep in step with, so nothing here owes it a mirror.\n */\nimport { existsSync } from \"node:fs\";\nimport { type LoadedDoc, type Rel } from \"../c4/likec4.js\";\nimport { serviceResolver } from \"../c4/resolve/service.js\";\nimport { landscapePath } from \"../repo/paths.js\";\nimport { readUseCases, type UseCaseScan } from \"../usecases/fleet.js\";\nimport { hopsConsuming, hopsExercising } from \"../usecases/operations.js\";\nimport type { DocsDir } from \"../kernel/ids/dirs.js\";\nimport type { FleetContext } from \"../fleet-context.js\";\nimport type { Requirement } from \"../document/spec.js\";\nimport type { ServiceState } from \"./base-state.js\";\n\n/**\n * One consumer scan's answer, honest about its own coverage. `victims` is\n * positive evidence; `suspended` names the consumers whose relevant document\n * could not be read (or whose identity is ambiguous), because a scan that\n * skipped a file loam REFUSED to read must never let the caller assert\n * \"nobody names it\" — the fail-open shape this type exists to forbid.\n */\nexport interface ConsumerScan {\n  victims: string[];\n  suspended: string[];\n}\n\n/** The current-state consumer questions `semantic.ts` asks per removal. */\nexport interface VictimIndex {\n  /** Current consumers of `provider`'s operation `op`: landscape edges into the provider, then other services' living requirements, then the use-case hops the model attributes to it (contested hops ride as suspensions). */\n  opConsumers(provider: string, op: string): Promise<ConsumerScan>;\n  /** Current consumers of message `name` a `provider` is dropping: consumes-edges (not into the provider), then other services' `Consumes:` lines over both spec axes, then the use-case hops backed by such an edge. */\n  messageConsumers(provider: string, name: string): Promise<ConsumerScan>;\n  /** Current services whose asyncapi declares `name` — positive evidence only; a message still declared elsewhere is not orphaned by one producer dropping it. */\n  declarers(name: string): string[];\n}\n\n/** The requirements one current service contributes to a scan, per axis rule. */\nfunction reqsOf(state: ServiceState, axes: readonly (\"spec\" | \"archSpec\")[]): Requirement[] {\n  return axes.flatMap((axis) => {\n    const a = state[axis];\n    return a.kind === \"read\" ? a.value : [];\n  });\n}\n\nconst EDGE = (resolve: (id: string) => string, r: Rel): string =>\n  `edge ${resolve(r.source)} → ${resolve(r.target)}${r.title === undefined ? \"\" : ` (\"${r.title}\")`}`;\n\n/** Entry comparator by map key — deterministic suspension order. */\nconst byFirst = <T>(a: [string, T], b: [string, T]): number => (a[0] < b[0] ? -1 : 1);\n\n/** The landscape half of the index, loaded at most once and only when a removal actually asks. */\ninterface Drawn {\n  usable: LoadedDoc | null;\n  resolve: ((id: string) => string) | null;\n}\n\nexport function victimIndex(snap: {\n  docsDir: DocsDir;\n  context: FleetContext;\n  current: ReadonlyMap<string, ServiceState>;\n  /** Ids the working tree claims twice (current-state.ts) — their documents cannot be scanned, so they ride as suspended consumers. */\n  ambiguous: ReadonlyMap<string, string[]>;\n}): VictimIndex {\n  // Lazy on purpose, the coherence lookups' own discipline: the landscape is\n  // a full LikeC4 workspace spin-up, and a diff that removes nothing must not\n  // pay for it. An absent landscape proves nothing; an unreadable one proves\n  // nothing either way — `landscape.invalid` is validate's finding to make,\n  // and inventing victims out of a parse error would point the reader at the\n  // wrong file (core/coherence/lookups.ts's doctrine, verbatim).\n  let drawn: Promise<Drawn> | undefined;\n  const landscape = (): Promise<Drawn> =>\n    (drawn ??= (async (): Promise<Drawn> => {\n      const path = landscapePath(snap.docsDir);\n      const doc: LoadedDoc | null = existsSync(path) ? await snap.context.loadLikeC4(path) : null;\n      const usable = doc !== null && doc.errors.length === 0 ? doc : null;\n      // The enumerated fleet rides into the resolver so a landscape that\n      // models CONTAINERS stays visible: without `known`, an edge into\n      // `payment.api` resolves to a service called \"api\" that has never\n      // existed and the join finds nobody — the exact defect DESIGN's\n      // serviceResolver-known row records.\n      return {\n        usable,\n        resolve: usable === null ? null : serviceResolver(usable.elements, new Set(snap.current.keys())),\n      };\n    })());\n\n  // Sorted, so victim order never depends on the enumeration's walk order.\n  const ids = [...snap.current.keys()].sort();\n\n  /**\n   * The use-case half, lazy for the same reason and one step further.\n   *\n   * `readUseCases` carries its own cheap gate — a byte scan for the reserved\n   * tag prefix — so a fleet that declares no use case never starts LikeC4 here\n   * at all, and a fleet that does pays for the `architecture/` project exactly\n   * once per `loam diff`, at the first removal that asks. The fleet set is the\n   * same one the landscape resolver above is built from, so the two halves\n   * cannot disagree about which service an element stands for.\n   */\n  let flows: Promise<UseCaseScan> | undefined;\n  const useCases = (): Promise<UseCaseScan> =>\n    (flows ??= readUseCases({ docsDir: snap.docsDir, known: new Set(snap.current.keys()) }));\n\n  /**\n   * The requirement half of one scan, `tupleVisible`'s own discipline applied\n   * to victims: an unreadable consumer axis contributes a SUSPENSION, never a\n   * silent nothing — \"consuming nothing\" and \"loam refused to read the file\"\n   * are opposite facts, and collapsing them is how a breaking removal used to\n   * grade down to a confident warning.\n   */\n  const scanRequirements = (unit: { provider: string; axes: readonly (\"spec\" | \"archSpec\")[]; hit: (r: Requirement) => boolean }): ConsumerScan => {\n    const out: ConsumerScan = { victims: [], suspended: [] };\n    for (const other of ids.filter((id) => id !== unit.provider)) {\n      const state = snap.current.get(other)!;\n      for (const axis of unit.axes) {\n        const a = state[axis];\n        if (a.kind === \"unreadable\") {\n          out.suspended.push(`${other} — ${a.path} could not be read, so its requirements could not be scanned`);\n          continue;\n        }\n        if (a.kind !== \"read\") continue;\n        for (const r of a.value) if (unit.hit(r)) out.victims.push(`${other}'s living requirement '${r.name}'`);\n      }\n    }\n    for (const [id, dirs] of [...snap.ambiguous].sort(byFirst)) {\n      if (id !== unit.provider) out.suspended.push(`${id} — claimed by ${dirs.join(\" and \")}, so its documents could not be scanned`);\n    }\n    return out;\n  };\n\n  const opConsumers = async (provider: string, op: string): Promise<ConsumerScan> => {\n    const { usable, resolve } = await landscape();\n    const scan = scanRequirements({ provider, axes: [\"spec\"], hit: (r) => r.operations.includes(op) });\n    const edges: string[] = [];\n    if (usable !== null && resolve !== null) {\n      for (const r of usable.relationships) {\n        if (r.op === op && resolve(r.target) === provider) edges.push(EDGE(resolve, r));\n      }\n    }\n    // Flows last in each list, deliberately: the edge and the requirement say\n    // WHICH document to open, and the flow says what the reader is about to\n    // break — so a `details[]` scanned top-down ends on the consequence.\n    const hops = hopsExercising(await useCases(), { provider, op });\n    return {\n      victims: [...edges, ...scan.victims, ...hops.breaks],\n      suspended: [...scan.suspended, ...hops.unsure],\n    };\n  };\n\n  const messageConsumers = async (provider: string, name: string): Promise<ConsumerScan> => {\n    const { usable, resolve } = await landscape();\n    const scan = scanRequirements({ provider, axes: [\"spec\", \"archSpec\"], hit: (r) => r.consumes.includes(name) });\n    const edges: string[] = [];\n    if (usable !== null && resolve !== null) {\n      for (const r of usable.relationships) {\n        // The message join is fleet-global, so every edge naming it counts —\n        // except one into the provider itself, whose consumption leaves with\n        // the same change (events/lookups.ts's exclusion, verbatim).\n        if (r.consumes === name && resolve(r.target) !== provider) edges.push(EDGE(resolve, r));\n      }\n    }\n    const hops = hopsConsuming(await useCases(), { provider, name });\n    return { victims: [...edges, ...scan.victims, ...hops], suspended: scan.suspended };\n  };\n\n  const declarers = (name: string): string[] =>\n    ids.filter((id) => {\n      const axis = snap.current.get(id)!.asyncapi;\n      return axis.kind === \"read\" && axis.value.some((m) => m.name === name);\n    });\n\n  return { opConsumers, messageConsumers, declarers };\n}\n\n/**\n * One cross-service join: `consumer`'s living requirements name a `token` that\n * `provider`'s contract defines. The same \"who depends on what\" question the\n * index above answers per removal, asked here of a WHOLE state — base or\n * current — so `semantic.ts` can report joins that appeared or went away.\n */\nexport interface ConsumerTuple {\n  kind: \"op\" | \"message\";\n  consumer: string;\n  provider: string;\n  token: string;\n}\n\n/** The map key a tuple is joined on between the two states. */\nfunction tupleKey(t: ConsumerTuple): string {\n  return `${t.kind}\\0${t.consumer}\\0${t.provider}\\0${t.token}`;\n}\n\n/**\n * Every cross-service join one state holds, keyed for the base/current join.\n * Axis rules mirror the two consumer scans above: `Operations:` from spec.md\n * only, `Consumes:` from both spec axes. Unreadable axes simply contribute\n * nothing here — `semantic.ts` guards the GRADING so a join is never called\n * added or removed off a side nobody could read.\n */\nexport function consumerTuples(states: ReadonlyMap<string, ServiceState>): Map<string, ConsumerTuple> {\n  const providersOf = (pick: (s: ServiceState) => string[]): Map<string, string[]> => {\n    const map = new Map<string, string[]>();\n    for (const id of [...states.keys()].sort()) {\n      for (const token of pick(states.get(id)!)) map.set(token, [...(map.get(token) ?? []), id]);\n    }\n    return map;\n  };\n  const opProviders = providersOf((s) => (s.openapi.kind === \"read\" ? s.openapi.value.map((op) => op.id) : []));\n  const msgProviders = providersOf((s) => (s.asyncapi.kind === \"read\" ? s.asyncapi.value.map((m) => m.name) : []));\n  const out = new Map<string, ConsumerTuple>();\n  const add = (t: ConsumerTuple): void => {\n    out.set(tupleKey(t), t);\n  };\n  for (const consumer of [...states.keys()].sort()) {\n    const state = states.get(consumer)!;\n    for (const r of reqsOf(state, [\"spec\"])) {\n      for (const op of r.operations) {\n        for (const p of opProviders.get(op) ?? []) if (p !== consumer) add({ kind: \"op\", consumer, provider: p, token: op });\n      }\n    }\n    for (const r of reqsOf(state, [\"spec\", \"archSpec\"])) {\n      for (const name of r.consumes) {\n        for (const p of msgProviders.get(name) ?? []) if (p !== consumer) add({ kind: \"message\", consumer, provider: p, token: name });\n      }\n    }\n  }\n  return out;\n}\n\n/** May a tuple be graded off this side? Absence answers; unreadable does not; an ambiguous base identity answers nothing. */\nfunction tupleVisible(states: ReadonlyMap<string, ServiceState>, ambiguous: ReadonlySet<string>, t: ConsumerTuple): boolean {\n  if (ambiguous.has(t.consumer) || ambiguous.has(t.provider)) return false;\n  const readable = (id: string, axes: (\"spec\" | \"archSpec\" | \"openapi\" | \"asyncapi\")[]): boolean => {\n    const state = states.get(id);\n    return state === undefined || axes.every((axis) => state[axis].kind !== \"unreadable\");\n  };\n  return (\n    readable(t.consumer, t.kind === \"op\" ? [\"spec\"] : [\"spec\", \"archSpec\"]) &&\n    readable(t.provider, [t.kind === \"op\" ? \"openapi\" : \"asyncapi\"])\n  );\n}\n\n/** One graded cross-service join change between the two states. */\nexport interface ConsumerChange {\n  t: ConsumerTuple;\n  change: \"added\" | \"removed\";\n}\n\n/**\n * The joins that appeared or went away between base and current, sorted for\n * deterministic output (provider, kind, token, consumer). The visibility\n * guard is the containment rule: a join is never called \"added\" off a base\n * side nobody could read, nor \"removed\" off an unreadable working file — the\n * suspended axis already carries that fact.\n */\nexport function consumerJoinChanges(input: {\n  base: ReadonlyMap<string, ServiceState>;\n  baseAmbiguous: ReadonlySet<string>;\n  current: ReadonlyMap<string, ServiceState>;\n  currentAmbiguous: ReadonlySet<string>;\n}): ConsumerChange[] {\n  const baseTuples = consumerTuples(input.base);\n  const currentTuples = consumerTuples(input.current);\n  const graded: ConsumerChange[] = [];\n  for (const [key, t] of currentTuples) {\n    if (!baseTuples.has(key) && tupleVisible(input.base, input.baseAmbiguous, t)) graded.push({ t, change: \"added\" });\n  }\n  for (const [key, t] of baseTuples) {\n    if (!currentTuples.has(key) && tupleVisible(input.current, input.currentAmbiguous, t)) graded.push({ t, change: \"removed\" });\n  }\n  return graded.sort((a, b) => {\n    const ka = `${a.t.provider}\\0${a.t.kind}\\0${a.t.token}\\0${a.t.consumer}\\0${a.change}`;\n    const kb = `${b.t.provider}\\0${b.t.kind}\\0${b.t.token}\\0${b.t.consumer}\\0${b.change}`;\n    return ka < kb ? -1 : 1;\n  });\n}\n"]}