@endora-commerce/platform 0.100.0

package/dist/lifecycle/services/deactivation-ledger.js

@@ -0,0 +1,171 @@
+/** `<moduleId>:<name>`, the key every lookup in this file uses. */
+function keyOf(moduleId, name) {
+    return `${moduleId}:${name}`;
+}
+/**
+ * Assign an outcome to every cross-module edge, and report the ones that get
+ * none.
+ *
+ * Rule order is load-bearing and reads top to bottom as "what could make this
+ * edge lie to an operator?": a capture survives every other answer the edge
+ * might have had, because it is about *when* the name is read rather than what
+ * it answers; a gated port resolved too early takes the platform down rather
+ * than the request; only then do the declarations and the gate get to speak.
+ */
+export function buildDeactivationLedger(input) {
+    const entries = [];
+    const unassigned = [];
+    let excluded = 0;
+    const degrades = new Map();
+    // Beside it rather than merged into it: the two declarations produce
+    // different outcomes and the operator's row says different things. A
+    // `refuses-without` entry with no sentence is refused by the schema and
+    // reported by `check-port-dependencies.ts`; it is classified here anyway, so
+    // that a declaration this file cannot render still cannot silently become
+    // some *other* classification.
+    const refuses = new Map();
+    for (const edge of input.nonBinding) {
+        if (edge.kind === 'degrades-without' && edge.whenAbsent !== null) {
+            degrades.set(keyOf(edge.moduleId, edge.name), edge.whenAbsent);
+        }
+        if (edge.kind === 'refuses-without') {
+            refuses.set(keyOf(edge.moduleId, edge.name), edge.whenAbsent);
+        }
+    }
+    /** One group per (dependent, owner, name); a name read from six files is one edge. */
+    const groups = new Map();
+    const acknowledged = new Set(input.acknowledged.map((edge) => keyOf(edge.moduleId, edge.name)));
+    for (const read of input.reads) {
+        if (read.moduleId === read.dependsOn)
+            continue;
+        if (input.neverAbsentOwners.has(read.dependsOn) &&
+            !acknowledged.has(keyOf(read.moduleId, read.name))) {
+            continue;
+        }
+        if (input.excludedNames.has(read.name)) {
+            excluded += 1;
+            continue;
+        }
+        const key = `${read.moduleId}:${read.dependsOn}:${read.name}`;
+        const group = groups.get(key) ?? { read, sites: new Set(), captured: false };
+        group.sites.add(read.site);
+        group.captured = group.captured || read.captured;
+        groups.set(key, group);
+    }
+    const classified = new Set();
+    for (const { read, sites, captured } of groups.values()) {
+        classified.add(`${read.moduleId}:${read.dependsOn}`);
+        const declared = degrades.get(keyOf(read.moduleId, read.name));
+        const edge = { moduleId: read.moduleId, dependsOn: read.dependsOn, name: read.name };
+        if (captured) {
+            unassigned.push({
+                ...edge,
+                shape: 'captured-registration',
+                detail: `read once at construction, so it keeps answering after \`${read.dependsOn}\` ` +
+                    `is switched off`,
+            });
+            continue;
+        }
+        if (read.gated && [...sites].some((site) => site !== 'call')) {
+            unassigned.push({
+                ...edge,
+                shape: 'gated-port-before-first-request',
+                detail: `a gate with a real "no" answer is asked at ${[...sites].sort().join(', ')}`,
+            });
+            continue;
+        }
+        if (declared !== undefined) {
+            entries.push({ ...edge, outcome: 'degrades', whenAbsent: declared });
+            continue;
+        }
+        // Before the bare gate below, and the order is what the kind buys: the
+        // outcome is the same either way, so the only difference this branch makes
+        // is that the operator's row carries the dependent's own sentence instead
+        // of the platform's translated default.
+        const refusal = refuses.get(keyOf(read.moduleId, read.name));
+        if (refusal !== undefined) {
+            entries.push({ ...edge, outcome: 'fails-closed', whenAbsent: refusal });
+            continue;
+        }
+        if (read.gated) {
+            entries.push({ ...edge, outcome: 'fails-closed', whenAbsent: null });
+            continue;
+        }
+        const policy = input.contributionPolicies[keyOf(read.dependsOn, read.name)];
+        if (policy === undefined) {
+            unassigned.push({
+                ...edge,
+                shape: 'registry-without-policy',
+                detail: `\`${read.dependsOn}\` states nothing about what an absent owner's entry does`,
+            });
+            continue;
+        }
+        // A push happens once, from a boot hook, and reads nothing back; a host
+        // that honours an absent owner's entry answers the same to everybody. Both
+        // are "nothing happens". A *read* under a skip policy is not: the caller
+        // gets nothing back, which is the seam failing closed at enumeration.
+        const pushOnly = [...sites].every((site) => site === 'boot');
+        entries.push({
+            ...edge,
+            outcome: policy === 'honour' || pushOnly ? 'contributes' : 'fails-closed',
+            whenAbsent: null,
+        });
+    }
+    // Whatever a manifest declares and no container read backs. Deactivation
+    // drops no tables, so a foreign key into the owner's schema stays valid and
+    // nothing stops — which is also where a declaration backed by nothing at all
+    // lands, and that is a separate finding with its own owner.
+    for (const [moduleId, dependencies] of input.declaredDependencies) {
+        for (const dependsOn of dependencies) {
+            if (dependsOn === moduleId)
+                continue;
+            if (input.neverAbsentOwners.has(dependsOn))
+                continue;
+            if (classified.has(`${moduleId}:${dependsOn}`))
+                continue;
+            entries.push({ moduleId, dependsOn, name: null, outcome: 'schema-only', whenAbsent: null });
+        }
+    }
+    return { entries, unassigned, excluded };
+}
+/**
+ * The rows an operator is shown before switching `moduleId` off, and the rows
+ * the refusal carries when they have not acknowledged them.
+ *
+ * One row per dependent, whatever the number of edges between the two: an
+ * operator is choosing about modules, not about registrations. Where a
+ * dependent both pulls and contributes, **the pull decides** — a contribution
+ * costs nothing and saying so beside a capability that stops would be a
+ * consequence list that reads as reassurance.
+ *
+ * **The sentence follows the effect that wins**, and it has to, now that
+ * `fails-closed` can carry one. A dependent that degrades on one edge and
+ * refuses on another gets `unavailable`, and pairing that word with the
+ * degrade's *"keeps working with less"* sentence would be a row that
+ * contradicts itself in six words. A declared sentence is still kept when the
+ * winning effect has none of its own, because it is then the only specific
+ * thing the platform knows about that dependent.
+ */
+export function deactivationConsequencesFor(entries, moduleId, isPresent) {
+    const rows = new Map();
+    for (const entry of entries) {
+        if (entry.dependsOn !== moduleId)
+            continue;
+        if (entry.outcome !== 'fails-closed' && entry.outcome !== 'degrades')
+            continue;
+        if (!isPresent(entry.moduleId))
+            continue;
+        const existing = rows.get(entry.moduleId);
+        const effect = entry.outcome === 'degrades' ? 'degraded' : 'unavailable';
+        const winning = existing?.effect === 'unavailable' || effect === 'unavailable' ? 'unavailable' : 'degraded';
+        rows.set(entry.moduleId, {
+            moduleId: entry.moduleId,
+            effect: winning,
+            description: effect === winning
+                ? (entry.whenAbsent ?? existing?.description ?? null)
+                : (existing?.description ?? entry.whenAbsent ?? null),
+        });
+    }
+    return [...rows.values()].sort((a, b) => a.moduleId.localeCompare(b.moduleId));
+}
+//# sourceMappingURL=deactivation-ledger.js.map

package/dist/lifecycle/services/deactivation-ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deactivation-ledger.js","sourceRoot":"","sources":["../../../src/lifecycle/services/deactivation-ledger.ts"],"names":[],"mappings":"AAuLA,mEAAmE;AACnE,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAY;IAC3C,OAAO,GAAG,QAAQ,IAAI,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAkB;IACxD,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,qEAAqE;IACrE,qEAAqE;IACrE,wEAAwE;IACxE,6EAA6E;IAC7E,0EAA0E;IAC1E,+BAA+B;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACjE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;YACpC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,sFAAsF;IACtF,MAAM,MAAM,GAAG,IAAI,GAAG,EAA4E,CAAC;IACnG,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAClE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,SAAS;YAAE,SAAS;QAC/C,IACE,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;YAC3C,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAClD,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,QAAQ,IAAI,CAAC,CAAC;YACd,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9D,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,EAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QACrF,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACxD,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QAErF,IAAI,QAAQ,EAAE,CAAC;YACb,UAAU,CAAC,IAAI,CAAC;gBACd,GAAG,IAAI;gBACP,KAAK,EAAE,uBAAuB;gBAC9B,MAAM,EACJ,4DAA4D,IAAI,CAAC,SAAS,KAAK;oBAC/E,iBAAiB;aACpB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,CAAC;YAC7D,UAAU,CAAC,IAAI,CAAC;gBACd,GAAG,IAAI;gBACP,KAAK,EAAE,iCAAiC;gBACxC,MAAM,EAAE,8CAA8C,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACrF,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;YACrE,SAAS;QACX,CAAC;QACD,uEAAuE;QACvE,2EAA2E;QAC3E,0EAA0E;QAC1E,wCAAwC;QACxC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7D,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;YACxE,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;YACrE,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC;gBACd,GAAG,IAAI;gBACP,KAAK,EAAE,yBAAyB;gBAChC,MAAM,EAAE,KAAK,IAAI,CAAC,SAAS,2DAA2D;aACvF,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,wEAAwE;QACxE,2EAA2E;QAC3E,yEAAyE;QACzE,sEAAsE;QACtE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC;YACX,GAAG,IAAI;YACP,OAAO,EAAE,MAAM,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc;YACzE,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;IACL,CAAC;IAED,yEAAyE;IACzE,4EAA4E;IAC5E,6EAA6E;IAC7E,4DAA4D;IAC5D,KAAK,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC;QAClE,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;YACrC,IAAI,SAAS,KAAK,QAAQ;gBAAE,SAAS;YACrC,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,SAAS;YACrD,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAAE,SAAS;YACzD,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAC3C,CAAC;AAcD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,2BAA2B,CACzC,OAA+B,EAC/B,QAAgB,EAChB,SAA2C;IAE3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,SAAS,KAAK,QAAQ;YAAE,SAAS;QAC3C,IAAI,KAAK,CAAC,OAAO,KAAK,cAAc,IAAI,KAAK,CAAC,OAAO,KAAK,UAAU;YAAE,SAAS;QAC/E,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC;YAAE,SAAS;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC;QACzE,MAAM,OAAO,GACX,QAAQ,EAAE,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC;QAC9F,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE;YACvB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,MAAM,EAAE,OAAO;YACf,WAAW,EACT,MAAM,KAAK,OAAO;gBAChB,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,QAAQ,EAAE,WAAW,IAAI,IAAI,CAAC;gBACrD,CAAC,CAAC,CAAC,QAAQ,EAAE,WAAW,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AACjF,CAAC"}

package/dist/lifecycle/services/dep-graph.d.ts

@@ -0,0 +1,119 @@
+import type { ModuleManifest } from '@endora-commerce/contracts';
+/**
+ * Dependency graph derived from a snapshot of every loaded manifest.
+ *
+ * Built once at boot and rebuilt on every state-changing lifecycle
+ * operation. Pure in-memory; no I/O. The orchestrator drives every
+ * lifecycle command through this graph for validation.
+ */
+export declare class ModuleDepGraph {
+    /** moduleId → set of ids it directly depends on. */
+    private readonly forward;
+    /** moduleId → set of ids that directly depend on it. */
+    private readonly reverse;
+    /** Full manifest set, for callers that want metadata, not just edges. */
+    private readonly manifests;
+    constructor(manifests: Iterable<ModuleManifest>);
+    has(id: string): boolean;
+    manifest(id: string): ModuleManifest | undefined;
+    ids(): string[];
+    /**
+     * Detect a cycle. Returns a representative cycle (path of ids) when
+     * the graph is cyclic, `null` when it is a DAG. Uses iterative DFS so
+     * graphs with thousands of nodes don't blow the stack.
+     */
+    hasCycle(): {
+        cycle: string[];
+    } | null;
+    /**
+     * Topological order (dependency-first). Throws if the graph contains a
+     * cycle — callers should call `hasCycle()` first when they want to
+     * surface a friendly error.
+     */
+    topologicalOrder(): string[];
+    /**
+     * Reverse topological order (dependents first). Useful for cascade
+     * disable / hard-uninstall ordering.
+     */
+    reverseTopologicalOrder(): string[];
+    /** Direct dependents of `id` (one-hop reverse edges). */
+    dependentsOf(id: string): string[];
+    /** Transitive closure of dependents (all who reach `id` through reverse edges). */
+    transitiveDependentsOf(id: string): string[];
+    /** Direct deps of `id` not present in `installed`. */
+    unresolvedDependenciesOf(id: string, installed: ReadonlySet<string>): string[];
+}
+/**
+ * Strongly connected components of a directed graph (Tarjan), iterative so a
+ * large graph cannot blow the stack.
+ *
+ * **The platform owns this walk because two of its readers must not be able to
+ * disagree about what a cycle is** (feature 080, D-160.11). It was
+ * `backend/src/db/migration-order.ts`'s private helper, which made the
+ * orchestrator's install refusal — *"with this module, [a, b] depend on each
+ * other in a loop"* — a reach out of the platform into the host application,
+ * for a pure graph walk. The host still reads it: `migration-order.ts` builds
+ * the ordering graph's condensation from exactly this function, so the member
+ * list an operator reads in a refused install is the member list the migration
+ * order reports, by construction and not by two implementations agreeing.
+ *
+ * `neighboursOf` is the caller's, so an edge into a node the caller did not
+ * declare is the caller's decision to skip or to keep.
+ */
+export declare function stronglyConnectedComponents(nodes: readonly string[], neighboursOf: (id: string) => readonly string[]): string[][];
+/**
+ * A stable topological sort of a condensation — Kahn's algorithm, the ready set
+ * drained by the smallest module id in the component.
+ *
+ * **The platform owns this walk for the reason it owns
+ * {@link stronglyConnectedComponents}** (D-160.11), and feature 113 is what made
+ * the reason bite: the migration order and the demo runner both order modules by
+ * the manifest `dependencies` graph, and `contracts/module-demo-data-layer.md`
+ * §4.1 says the runner *"MUST NOT maintain an order of its own"*. Two
+ * implementations of one order are two answers waiting to disagree — and they
+ * would disagree silently, because nothing compares a demo run's order to a
+ * migration run's.
+ *
+ * It was `backend/src/db/migration-order.ts`' private `sortComponents`, moved
+ * here unchanged. The `first` parameter is that file's `'core'` rule made a
+ * parameter rather than a constant: `'core'` declares nothing and nothing
+ * declares it, so it is always ready at the start, and saying "it goes first"
+ * beats relying on an accident of alphabetical ordering. A caller with no such
+ * node passes nothing and gets the plain smallest-id-first drain.
+ *
+ * It always succeeds: the condensation is acyclic, so the ready set cannot
+ * empty early and there is no unresolvable order.
+ *
+ * `neighboursOf` is the caller's, exactly as above, and an edge into a node no
+ * component holds is skipped — the caller decided what its graph contains.
+ */
+export declare function sortComponentsTopologically(components: readonly string[][], neighboursOf: (id: string) => readonly string[], first?: string): string[][];
+/**
+ * The modules of a dependency map, dependencies before dependents, ties broken
+ * by module id.
+ *
+ * The one order two readers share: the migration order builds it through the
+ * two functions above with its own `'core'` node, and the demo runner takes it
+ * whole (feature 113, §4.1). A dependency **cycle** is not an error here — its
+ * members come out as one contiguous block in id order, and reporting it is the
+ * caller's ({@link moduleDependencyCycles}), for the reason feature 081 gives: a
+ * manifest can arrive from an installed package, and one stranger's declaration
+ * must not stop a shop's own work.
+ *
+ * An edge naming a module the map does not hold is skipped, which is §4.4's
+ * *"an entry naming a module that is not installed orders nothing"*.
+ */
+export declare function orderModulesByDependencies(moduleDependencies: ReadonlyMap<string, readonly string[]>): string[];
+/**
+ * Every dependency cycle in a module dependency map — one strongly connected
+ * component of more than one module per entry, members sorted.
+ *
+ * The one derivation behind three reactions (feature 081, FR-012): a red unit
+ * test for a cycle in this repository's own manifests, a `warn` at boot for one
+ * on a running platform, and the orchestrator refusing an install whose arrival
+ * closes a loop. An edge naming a module the map does not hold is skipped — a
+ * *migration* claiming such a module is refused by the ordering's own step 1,
+ * and a dependency on a module that is not there is not a cycle.
+ */
+export declare function moduleDependencyCycles(moduleDependencies: ReadonlyMap<string, readonly string[]>): string[][];
+//# sourceMappingURL=dep-graph.d.ts.map

package/dist/lifecycle/services/dep-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-graph.d.ts","sourceRoot":"","sources":["../../../src/lifecycle/services/dep-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,oDAAoD;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAkC;IAC1D,wDAAwD;IACxD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAkC;IAC1D,yEAAyE;IACzE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqC;gBAEnD,SAAS,EAAE,QAAQ,CAAC,cAAc,CAAC;IAc/C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIxB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIhD,GAAG,IAAI,MAAM,EAAE;IAIf;;;;OAIG;IACH,QAAQ,IAAI;QAAE,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,IAAI;IA+CtC;;;;OAIG;IACH,gBAAgB,IAAI,MAAM,EAAE;IAkC5B;;;OAGG;IACH,uBAAuB,IAAI,MAAM,EAAE;IAInC,yDAAyD;IACzD,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAIlC,mFAAmF;IACnF,sBAAsB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAY5C,sDAAsD;IACtD,wBAAwB,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE;CAO/E;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,YAAY,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,SAAS,MAAM,EAAE,GAC9C,MAAM,EAAE,EAAE,CAsDZ;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,2BAA2B,CACzC,UAAU,EAAE,SAAS,MAAM,EAAE,EAAE,EAC/B,YAAY,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,SAAS,MAAM,EAAE,EAC/C,KAAK,CAAC,EAAE,MAAM,GACb,MAAM,EAAE,EAAE,CAuCZ;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,0BAA0B,CACxC,kBAAkB,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GACzD,MAAM,EAAE,CAMV;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CACpC,kBAAkB,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GACzD,MAAM,EAAE,EAAE,CAOZ"}

package/dist/lifecycle/services/dep-graph.js

@@ -0,0 +1,334 @@
+/**
+ * Dependency graph derived from a snapshot of every loaded manifest.
+ *
+ * Built once at boot and rebuilt on every state-changing lifecycle
+ * operation. Pure in-memory; no I/O. The orchestrator drives every
+ * lifecycle command through this graph for validation.
+ */
+export class ModuleDepGraph {
+    /** moduleId → set of ids it directly depends on. */
+    forward = new Map();
+    /** moduleId → set of ids that directly depend on it. */
+    reverse = new Map();
+    /** Full manifest set, for callers that want metadata, not just edges. */
+    manifests = new Map();
+    constructor(manifests) {
+        for (const m of manifests) {
+            this.manifests.set(m.id, m);
+            this.forward.set(m.id, new Set(m.dependencies));
+            if (!this.reverse.has(m.id))
+                this.reverse.set(m.id, new Set());
+        }
+        for (const [id, deps] of this.forward) {
+            for (const dep of deps) {
+                if (!this.reverse.has(dep))
+                    this.reverse.set(dep, new Set());
+                this.reverse.get(dep).add(id);
+            }
+        }
+    }
+    has(id) {
+        return this.manifests.has(id);
+    }
+    manifest(id) {
+        return this.manifests.get(id);
+    }
+    ids() {
+        return [...this.manifests.keys()].sort();
+    }
+    /**
+     * Detect a cycle. Returns a representative cycle (path of ids) when
+     * the graph is cyclic, `null` when it is a DAG. Uses iterative DFS so
+     * graphs with thousands of nodes don't blow the stack.
+     */
+    hasCycle() {
+        const color = new Map();
+        for (const id of this.manifests.keys())
+            color.set(id, 0);
+        for (const start of this.manifests.keys()) {
+            if (color.get(start) !== 0)
+                continue;
+            const stack = [
+                { id: start, iter: (this.forward.get(start) ?? new Set()).values() },
+            ];
+            const path = [start];
+            color.set(start, 1);
+            while (stack.length > 0) {
+                const top = stack[stack.length - 1];
+                const next = top.iter.next();
+                if (next.done) {
+                    color.set(top.id, 2);
+                    path.pop();
+                    stack.pop();
+                    continue;
+                }
+                const child = next.value;
+                if (!this.manifests.has(child)) {
+                    // Dependency points to a non-existent module — caller handles
+                    // (different validation step); skip for cycle detection.
+                    continue;
+                }
+                const c = color.get(child);
+                if (c === 1) {
+                    // Found a back-edge → cycle. Slice `path` from `child` to top.
+                    const startIdx = path.indexOf(child);
+                    return { cycle: [...path.slice(startIdx), child] };
+                }
+                if (c === 0) {
+                    color.set(child, 1);
+                    path.push(child);
+                    stack.push({
+                        id: child,
+                        iter: (this.forward.get(child) ?? new Set()).values(),
+                    });
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Topological order (dependency-first). Throws if the graph contains a
+     * cycle — callers should call `hasCycle()` first when they want to
+     * surface a friendly error.
+     */
+    topologicalOrder() {
+        const cycle = this.hasCycle();
+        if (cycle) {
+            throw new Error(`[dep-graph] cannot topologically sort: cycle detected ` +
+                `[${cycle.cycle.join(' → ')}]`);
+        }
+        // Kahn's algorithm: indegree[X] = number of X's unmet deps. Start
+        // from nodes with no deps (indegree 0); each pop removes that node
+        // from the dependents' indegree counts. Result is dependency-first.
+        const indegree = new Map();
+        for (const id of this.manifests.keys()) {
+            indegree.set(id, this.forward.get(id)?.size ?? 0);
+        }
+        const queue = [];
+        for (const [id, deg] of indegree)
+            if (deg === 0)
+                queue.push(id);
+        queue.sort();
+        const out = [];
+        while (queue.length > 0) {
+            const id = queue.shift();
+            out.push(id);
+            for (const dependent of this.reverse.get(id) ?? []) {
+                const next = (indegree.get(dependent) ?? 0) - 1;
+                indegree.set(dependent, next);
+                if (next === 0) {
+                    queue.push(dependent);
+                    queue.sort();
+                }
+            }
+        }
+        return out;
+    }
+    /**
+     * Reverse topological order (dependents first). Useful for cascade
+     * disable / hard-uninstall ordering.
+     */
+    reverseTopologicalOrder() {
+        return this.topologicalOrder().slice().reverse();
+    }
+    /** Direct dependents of `id` (one-hop reverse edges). */
+    dependentsOf(id) {
+        return [...(this.reverse.get(id) ?? new Set())].sort();
+    }
+    /** Transitive closure of dependents (all who reach `id` through reverse edges). */
+    transitiveDependentsOf(id) {
+        const seen = new Set();
+        const stack = [...(this.reverse.get(id) ?? [])];
+        while (stack.length > 0) {
+            const cur = stack.pop();
+            if (seen.has(cur))
+                continue;
+            seen.add(cur);
+            for (const next of this.reverse.get(cur) ?? [])
+                stack.push(next);
+        }
+        return [...seen].sort();
+    }
+    /** Direct deps of `id` not present in `installed`. */
+    unresolvedDependenciesOf(id, installed) {
+        const out = [];
+        for (const dep of this.forward.get(id) ?? []) {
+            if (!installed.has(dep))
+                out.push(dep);
+        }
+        return out.sort();
+    }
+}
+/**
+ * Strongly connected components of a directed graph (Tarjan), iterative so a
+ * large graph cannot blow the stack.
+ *
+ * **The platform owns this walk because two of its readers must not be able to
+ * disagree about what a cycle is** (feature 080, D-160.11). It was
+ * `backend/src/db/migration-order.ts`'s private helper, which made the
+ * orchestrator's install refusal — *"with this module, [a, b] depend on each
+ * other in a loop"* — a reach out of the platform into the host application,
+ * for a pure graph walk. The host still reads it: `migration-order.ts` builds
+ * the ordering graph's condensation from exactly this function, so the member
+ * list an operator reads in a refused install is the member list the migration
+ * order reports, by construction and not by two implementations agreeing.
+ *
+ * `neighboursOf` is the caller's, so an edge into a node the caller did not
+ * declare is the caller's decision to skip or to keep.
+ */
+export function stronglyConnectedComponents(nodes, neighboursOf) {
+    const index = new Map();
+    const lowLink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const components = [];
+    let counter = 0;
+    const discover = (id) => {
+        index.set(id, counter);
+        lowLink.set(id, counter);
+        counter += 1;
+        stack.push(id);
+        onStack.add(id);
+    };
+    for (const root of nodes) {
+        if (index.has(root))
+            continue;
+        discover(root);
+        // `edge` is how far through the node's neighbour list the walk has got.
+        const work = [{ id: root, edge: 0 }];
+        while (work.length > 0) {
+            const frame = work[work.length - 1];
+            const neighbours = neighboursOf(frame.id);
+            if (frame.edge < neighbours.length) {
+                const next = neighbours[frame.edge];
+                frame.edge += 1;
+                if (!index.has(next)) {
+                    discover(next);
+                    work.push({ id: next, edge: 0 });
+                }
+                else if (onStack.has(next)) {
+                    lowLink.set(frame.id, Math.min(lowLink.get(frame.id), index.get(next)));
+                }
+                continue;
+            }
+            work.pop();
+            if (lowLink.get(frame.id) === index.get(frame.id)) {
+                const component = [];
+                for (;;) {
+                    const member = stack.pop();
+                    onStack.delete(member);
+                    component.push(member);
+                    if (member === frame.id)
+                        break;
+                }
+                components.push(component.sort());
+            }
+            const parent = work[work.length - 1];
+            if (parent)
+                lowLink.set(parent.id, Math.min(lowLink.get(parent.id), lowLink.get(frame.id)));
+        }
+    }
+    return components;
+}
+/**
+ * A stable topological sort of a condensation — Kahn's algorithm, the ready set
+ * drained by the smallest module id in the component.
+ *
+ * **The platform owns this walk for the reason it owns
+ * {@link stronglyConnectedComponents}** (D-160.11), and feature 113 is what made
+ * the reason bite: the migration order and the demo runner both order modules by
+ * the manifest `dependencies` graph, and `contracts/module-demo-data-layer.md`
+ * §4.1 says the runner *"MUST NOT maintain an order of its own"*. Two
+ * implementations of one order are two answers waiting to disagree — and they
+ * would disagree silently, because nothing compares a demo run's order to a
+ * migration run's.
+ *
+ * It was `backend/src/db/migration-order.ts`' private `sortComponents`, moved
+ * here unchanged. The `first` parameter is that file's `'core'` rule made a
+ * parameter rather than a constant: `'core'` declares nothing and nothing
+ * declares it, so it is always ready at the start, and saying "it goes first"
+ * beats relying on an accident of alphabetical ordering. A caller with no such
+ * node passes nothing and gets the plain smallest-id-first drain.
+ *
+ * It always succeeds: the condensation is acyclic, so the ready set cannot
+ * empty early and there is no unresolvable order.
+ *
+ * `neighboursOf` is the caller's, exactly as above, and an edge into a node no
+ * component holds is skipped — the caller decided what its graph contains.
+ */
+export function sortComponentsTopologically(components, neighboursOf, first) {
+    const componentOf = new Map();
+    components.forEach((members, position) => {
+        for (const member of members)
+            componentOf.set(member, position);
+    });
+    const successors = components.map(() => []);
+    const indegree = components.map(() => 0);
+    components.forEach((members, position) => {
+        for (const member of members) {
+            for (const dependency of neighboursOf(member)) {
+                // The edge means "mine follow theirs", so the dependency's component is
+                // emitted first: the arrow in the sort points at us. A repeated edge is
+                // counted twice on both sides and cancels out.
+                const target = componentOf.get(dependency);
+                if (target === undefined || target === position)
+                    continue;
+                successors[target].push(position);
+                indegree[position] += 1;
+            }
+        }
+    });
+    const firstComponent = first === undefined ? undefined : componentOf.get(first);
+    const sortKey = (position) => position === firstComponent ? '' : components[position][0];
+    const ready = components.map((_, position) => position).filter((p) => indegree[p] === 0);
+    const ordered = [];
+    while (ready.length > 0) {
+        ready.sort((left, right) => (sortKey(left) < sortKey(right) ? -1 : 1));
+        const next = ready.shift();
+        ordered.push(components[next]);
+        for (const successor of successors[next]) {
+            indegree[successor] -= 1;
+            if (indegree[successor] === 0)
+                ready.push(successor);
+        }
+    }
+    return ordered;
+}
+/**
+ * The modules of a dependency map, dependencies before dependents, ties broken
+ * by module id.
+ *
+ * The one order two readers share: the migration order builds it through the
+ * two functions above with its own `'core'` node, and the demo runner takes it
+ * whole (feature 113, §4.1). A dependency **cycle** is not an error here — its
+ * members come out as one contiguous block in id order, and reporting it is the
+ * caller's ({@link moduleDependencyCycles}), for the reason feature 081 gives: a
+ * manifest can arrive from an installed package, and one stranger's declaration
+ * must not stop a shop's own work.
+ *
+ * An edge naming a module the map does not hold is skipped, which is §4.4's
+ * *"an entry naming a module that is not installed orders nothing"*.
+ */
+export function orderModulesByDependencies(moduleDependencies) {
+    const nodes = [...moduleDependencies.keys()];
+    const neighboursOf = (id) => (moduleDependencies.get(id) ?? []).filter((dependency) => moduleDependencies.has(dependency));
+    const components = stronglyConnectedComponents(nodes, neighboursOf);
+    return sortComponentsTopologically(components, neighboursOf).flat();
+}
+/**
+ * Every dependency cycle in a module dependency map — one strongly connected
+ * component of more than one module per entry, members sorted.
+ *
+ * The one derivation behind three reactions (feature 081, FR-012): a red unit
+ * test for a cycle in this repository's own manifests, a `warn` at boot for one
+ * on a running platform, and the orchestrator refusing an install whose arrival
+ * closes a loop. An edge naming a module the map does not hold is skipped — a
+ * *migration* claiming such a module is refused by the ordering's own step 1,
+ * and a dependency on a module that is not there is not a cycle.
+ */
+export function moduleDependencyCycles(moduleDependencies) {
+    const nodes = [...moduleDependencies.keys()];
+    const neighboursOf = (id) => (moduleDependencies.get(id) ?? []).filter((dependency) => moduleDependencies.has(dependency));
+    return stronglyConnectedComponents(nodes, neighboursOf).filter((members) => members.length > 1);
+}
+//# sourceMappingURL=dep-graph.js.map

package/dist/lifecycle/services/dep-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-graph.js","sourceRoot":"","sources":["../../../src/lifecycle/services/dep-graph.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IACzB,oDAAoD;IACnC,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC1D,wDAAwD;IACvC,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC1D,yEAAyE;IACxD,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;IAE/D,YAAY,SAAmC;QAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC7D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,GAAG;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,QAAQ;QAEN,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC;gBAAE,SAAS;YACrC,MAAM,KAAK,GAA6C;gBACtD,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE;aACrE,CAAC;YACF,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;YAC/B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;oBACrB,IAAI,CAAC,GAAG,EAAE,CAAC;oBACX,KAAK,CAAC,GAAG,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,8DAA8D;oBAC9D,yDAAyD;oBACzD,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,+DAA+D;oBAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACrC,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;gBACrD,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACjB,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,KAAK;wBACT,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE;qBACtD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,gBAAgB;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CACb,wDAAwD;gBACtD,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CACjC,CAAC;QACJ,CAAC;QACD,kEAAkE;QAClE,mEAAmE;QACnE,oEAAoE;QACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ;YAAE,IAAI,GAAG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChE,KAAK,CAAC,IAAI,EAAE,CAAC;QACb,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gBAC9B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,uBAAuB;QACrB,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;IACnD,CAAC;IAED,yDAAyD;IACzD,YAAY,CAAC,EAAU;QACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACzD,CAAC;IAED,mFAAmF;IACnF,sBAAsB,CAAC,EAAU;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,sDAAsD;IACtD,wBAAwB,CAAC,EAAU,EAAE,SAA8B;QACjE,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;CACF;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAwB,EACxB,YAA+C;IAE/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAQ,EAAE;QACpC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9B,QAAQ,CAAC,IAAI,CAAC,CAAC;QACf,wEAAwE;QACxE,MAAM,IAAI,GAAmC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAErE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YACrC,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,KAAK,CAAC,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;gBACrC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;gBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBACnC,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;gBAC5E,CAAC;gBACD,SAAS;YACX,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,SAAS,CAAC;oBACR,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBAC5B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACvB,IAAI,MAAM,KAAK,KAAK,CAAC,EAAE;wBAAE,MAAM;gBACjC,CAAC;gBACD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACrC,IAAI,MAAM;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,2BAA2B,CACzC,UAA+B,EAC/B,YAA+C,EAC/C,KAAc;IAEd,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;QACvC,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAe,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;QACvC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,UAAU,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9C,wEAAwE;gBACxE,wEAAwE;gBACxE,+CAA+C;gBAC/C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC3C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,QAAQ;oBAAE,SAAS;gBAC1D,UAAU,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,QAAQ,CAAC,QAAQ,CAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,cAAc,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChF,MAAM,OAAO,GAAG,CAAC,QAAgB,EAAU,EAAE,CAC3C,QAAQ,KAAK,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAE,CAAC;IAE/D,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAE,CAAC,CAAC;QAChC,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,IAAI,CAAE,EAAE,CAAC;YAC1C,QAAQ,CAAC,SAAS,CAAE,IAAI,CAAC,CAAC;YAC1B,IAAI,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,0BAA0B,CACxC,kBAA0D;IAE1D,MAAM,KAAK,GAAG,CAAC,GAAG,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,CAAC,EAAU,EAAqB,EAAE,CACrD,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;IAChG,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACpE,OAAO,2BAA2B,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC;AACtE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CACpC,kBAA0D;IAE1D,MAAM,KAAK,GAAG,CAAC,GAAG,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,CAAC,EAAU,EAAqB,EAAE,CACrD,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;IAChG,OAAO,2BAA2B,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,MAAM,CAC5D,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAChC,CAAC;AACJ,CAAC"}