@intentius/chant 0.124.46 → 0.124.49

package/dist/terraform/folds.js

@@ -0,0 +1,38 @@
+/**
+ * Fold detection for the carve graph, shared by the scorer and the walks.
+ *
+ * A sub-resource whose type inlines into a parent (`foldParentOf`) carves with
+ * that parent when the parent is in the estate under the same name:
+ * `aws_s3_bucket_versioning.assets` goes with `aws_s3_bucket.assets`. The
+ * scorer drops it from the ranking and discounts its edge to the parent; the
+ * walks in `reach.ts` contract it into the parent before stepping, since an
+ * uncontracted walk counts the child as a separate dependent (#2325 measured a
+ * 100% overstatement on the sample estate). It lived privately in `score.ts`
+ * until the walks needed it.
+ */
+import { foldParentOf } from "./tier-map.js";
+/**
+ * Build the set of addresses that fold into a parent present in the estate, plus
+ * the reverse lookup (parent → its folded children), so a parent can discount
+ * inbound edges coming from its own folded sub-resources.
+ */
+export function computeFolds(graph) {
+    const byAddress = new Map(graph.nodes.map((n) => [n.address, n]));
+    const folded = new Set();
+    const childrenOf = new Map();
+    for (const node of graph.nodes) {
+        if (node.kind !== "resource" || !node.type)
+            continue;
+        const parentType = foldParentOf(node.type);
+        if (!parentType)
+            continue;
+        const parentAddress = `${parentType}.${node.name}`;
+        if (!byAddress.has(parentAddress))
+            continue; // sub-resource without its parent → score it on its own
+        folded.add(node.address);
+        if (!childrenOf.has(parentAddress))
+            childrenOf.set(parentAddress, new Set());
+        childrenOf.get(parentAddress).add(node.address);
+    }
+    return { folded, childrenOf };
+}

package/dist/terraform/graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/terraform/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAU,MAAM,SAAS,CAAC;AAErE;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;AAKpE,UAAU,MAAM;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AA4BD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAe/D;AAiBD;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,EAAE,CAiB/D;AA8LD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,cAAc,GAAG,OAAO,CAsFhF;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAEtE;AAED,0FAA0F;AAC1F,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAEvE"}
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/terraform/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAU,MAAM,SAAS,CAAC;AAErE;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;AAKpE,UAAU,MAAM;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AA4BD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAe/D;AAiBD;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,EAAE,CAiB/D;AAqMD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,cAAc,GAAG,OAAO,CAwFhF;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAEtE;AAED,0FAA0F;AAC1F,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAEvE"}

package/dist/terraform/graph.js

@@ -266,6 +266,14 @@ function throughReferrers(refs, resolved) {
 function blockHasMeta(block, key) {
     return !!block && typeof block === "object" && key in block;
 }
+/** Which expansion meta-argument a block carries, as a spreadable `TfNode` field (#2325). */
+function expansionOf(block) {
+    if (blockHasMeta(block, "count"))
+        return { expansion: "count" };
+    if (blockHasMeta(block, "for_each"))
+        return { expansion: "for_each" };
+    return {};
+}
 /**
  * The literal string at a dotted path into a block, or undefined when the path
  * misses or lands on an interpolation. A dotted path walks nested blocks —
@@ -365,6 +373,7 @@ export function buildGraph(tree, exprRefs) {
                 name,
                 instances: 1,
                 hasDynamic: dynamic || touchesData,
+                ...expansionOf(block),
                 identity: literalIdentity(block, type),
                 dataSourceValues: dataSourceValues(block, type),
             });
@@ -384,6 +393,7 @@ export function buildGraph(tree, exprRefs) {
             name,
             instances: 1,
             hasDynamic: dynamic || touchesData,
+            ...expansionOf(block),
         });
     }
     // Output blocks: referrers without being nodes (#1638). Their pseudo-address

package/dist/terraform/reach.d.ts

@@ -0,0 +1,140 @@
+/**
+ * Transitive reachability over the carve graph (#2325).
+ *
+ * `inboundEdges`/`outboundEdges` in `graph.ts` answer one hop with a linear
+ * scan, which is right for the scorer's depth-1 counts and wrong as the step of
+ * a walk: calling it per node per step is O(V²E). This module builds one
+ * index per graph instead, and walks it with the same breadth-first walk
+ * `chant search` uses (`graph-walk.ts`).
+ *
+ * Four rules from the spike (docs/design/carve-dependency-blast-radius-spike.md)
+ * hold for every walk here and for the set functions in `cuts.ts` built on it:
+ *
+ *  - Folds contract first. A folded sub-resource is its parent for the walk, so
+ *    `aws_s3_bucket_versioning.assets` is never a dependent of
+ *    `aws_s3_bucket.assets`, and a node reading the child depends on the
+ *    parent.
+ *  - Outputs are terminal and counted apart. An `output.<name>` pseudo-address
+ *    has no inbound edges, so it never extends a path; it is reported in its
+ *    own list.
+ *  - Modules and unresolved `count`/`for_each` hide how much a node holds. A
+ *    `module.x` node is one node whatever it contains, and `count = 20` is one
+ *    node until `--state` resolves it. They are walked through and named, so a
+ *    caller can say `unknown` instead of a number.
+ *  - Cross-stack hops are told apart. On the CDK path an `Fn::ImportValue` edge
+ *    carries `crossStack: true`; what is reachable only through one is listed
+ *    separately.
+ *
+ * Pure, like the rest of the carve analysis. `src/cdk/graph.ts` emits the same
+ * `TfGraph`, so one implementation covers both sources.
+ */
+import { type Adjacency } from "../graph-walk.js";
+import type { TfEdge, TfGraph, TfNode } from "./types.js";
+/** An edge with both ends contracted to their fold parents. `edge` is the edge as the graph holds it. */
+export interface ContractedEdge extends TfEdge {
+    edge: TfEdge;
+}
+/** The index every walk over one graph shares. Built once per graph; see {@link carveIndex}. */
+export interface CarveIndex {
+    graph: TfGraph;
+    /** Every node by address, folded sub-resources included. */
+    nodes: Map<string, TfNode>;
+    /** The address a walk sees for `address`: its fold parent, or itself. */
+    rep(address: string): string;
+    /** A walked node's own blocks: itself first, then what folds into it, sorted. */
+    membersOf(address: string): string[];
+    /** Contracted edges by both ends. An edge internal to one fold is dropped. */
+    adj: Adjacency<ContractedEdge>;
+    /** The graph has at least one `crossStack` edge (a CDK assembly of several stacks). */
+    crossStack: boolean;
+}
+/**
+ * The fold-contracted adjacency index for a graph, built on first use and
+ * cached against the graph object. O(V+E) to build; every walk after that is
+ * O(V+E). A caller that mutates `graph.edges` after the first walk must pass a
+ * new graph object (`applyStateCounts` only touches node instance counts, which
+ * the index reads live).
+ */
+export declare function carveIndex(graph: TfGraph): CarveIndex;
+/** `output.<name>`: a pseudo-address `buildGraph` gives an output block's edges (#1638). */
+export declare function isOutputAddress(address: string): boolean;
+/**
+ * Whether a node stands for an amount of infrastructure the graph cannot see:
+ * a Terraform `module` block (one node, whatever it holds; state is not read
+ * inside modules), or a `count`/`for_each` block whose instance count no
+ * `.tfstate` resolved. A CDK L3 construct is also `kind: "module"`, but its
+ * members are listed and its address is a construct path, so it hides nothing.
+ */
+export declare function hidesContents(node: TfNode): boolean;
+/**
+ * Which way a walk steps: `in` follows who reads a node (its dependents), `out`
+ * what it reads, `both` either (weak connectivity, #3909). An output is
+ * terminal every way: it is reached, never stepped from.
+ */
+export type WalkDirection = "in" | "out" | "both";
+/**
+ * Walk from `seeds` (already contracted) and return every node reached with its
+ * shortest depth, seeds excluded. `sameStack` refuses `crossStack` edges.
+ */
+export declare function walkFrom(index: CarveIndex, seeds: Iterable<string>, direction: WalkDirection, opts?: {
+    sameStack?: boolean;
+}): Map<string, number>;
+/** What a walk from one node reached. Every list is sorted and holds contracted addresses. */
+export interface Reach {
+    /** The node the walk started from: the requested address, or its fold parent. */
+    address: string;
+    /** Resource and module nodes reached, the start excluded. */
+    resources: string[];
+    /** `output.<name>` pseudo-addresses reached; terminal, never in `resources`. */
+    outputs: string[];
+    /** The longest shortest path to anything reached, outputs included; 0 when nothing was. */
+    depth: number;
+    /** Of `resources`, those reached only through a `crossStack` edge. Empty off the CDK path. */
+    crossStack: string[];
+    /** Of `resources`, those that hide how much they hold (see {@link hidesContents}). */
+    hidden: string[];
+}
+/**
+ * Everything reachable from `address` (#2325). Direction `in` (the default)
+ * walks dependents: what a change to `address` reaches, its blast radius.
+ * Direction `out` walks dependencies: what `address` needs.
+ *
+ * Throws when `address` is not a node of the graph.
+ */
+export declare function reach(graph: TfGraph, address: string, opts?: {
+    direction?: WalkDirection;
+}): Reach;
+/** Code-point order, as `buildGraph` sorts: locale-independent. */
+export declare function cmp(a: string, b: string): number;
+/**
+ * How far a change to one node reaches, as `carve advise` reports it (#2326):
+ * its own axis beside the peelability score, never a penalty term. Every score
+ * term is a unit of work (an inbound edge is one data-source patch); a
+ * transitive dependent is not work, nobody patches it, and its count can run
+ * far past what a 0-100 score carries.
+ */
+export interface BlastRadius {
+    /**
+     * Resources and modules that depend on the node, directly or not, weighted by
+     * instance count when `--state` resolved it. `"unknown"` when one of them is
+     * a module or a `count`/`for_each` no state resolved: see `hiddenBy`.
+     */
+    resources: number | "unknown";
+    /** `output` blocks that read the node or one of its dependents. */
+    outputs: number;
+    /** Hops to the farthest dependent, outputs included; 0 when nothing depends on it. */
+    depth: number;
+    /**
+     * Of `resources`, those reachable only through a `crossStack` edge (a CDK
+     * `Fn::ImportValue`), weighted the same way. Present only when the graph has
+     * such an edge.
+     */
+    crossStack?: number | "unknown";
+    /** The dependents that make a count `"unknown"`. Present only when one does. */
+    hiddenBy?: string[];
+}
+/** The instances `addresses` stand for, or `"unknown"` when one of them hides its contents. */
+export declare function weigh(index: CarveIndex, addresses: readonly string[]): number | "unknown";
+/** The {@link BlastRadius} of `address`: its {@link reach} through dependents, counted. */
+export declare function blastRadius(graph: TfGraph, address: string): BlastRadius;
+//# sourceMappingURL=reach.d.ts.map

package/dist/terraform/reach.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reach.d.ts","sourceRoot":"","sources":["../../src/terraform/reach.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,EAAiC,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAE9E,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAEvD,yGAAyG;AACzG,MAAM,WAAW,cAAe,SAAQ,MAAM;IAC5C,IAAI,EAAE,MAAM,CAAC;CACd;AAED,gGAAgG;AAChG,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,OAAO,CAAC;IACf,4DAA4D;IAC5D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,yEAAyE;IACzE,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC;IAC7B,iFAAiF;IACjF,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IACrC,8EAA8E;IAC9E,GAAG,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC;IAC/B,uFAAuF;IACvF,UAAU,EAAE,OAAO,CAAC;CACrB;AAID;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,CAyBrD;AAED,4FAA4F;AAC5F,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAGnD;AAED;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,IAAI,GAAG,KAAK,GAAG,MAAM,CAAC;AAElD;;;GAGG;AACH,wBAAgB,QAAQ,CACtB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EACvB,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GACjC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAmBrB;AAED,8FAA8F;AAC9F,MAAM,WAAW,KAAK;IACpB,iFAAiF;IACjF,OAAO,EAAE,MAAM,CAAC;IAChB,6DAA6D;IAC7D,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,gFAAgF;IAChF,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,2FAA2F;IAC3F,KAAK,EAAE,MAAM,CAAC;IACd,8FAA8F;IAC9F,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,sFAAsF;IACtF,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,aAAa,CAAA;CAAO,GAAG,KAAK,CAqBtG;AAED,mEAAmE;AACnE,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9B,mEAAmE;IACnE,OAAO,EAAE,MAAM,CAAC;IAChB,sFAAsF;IACtF,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC,gFAAgF;IAChF,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,+FAA+F;AAC/F,wBAAgB,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS,CAQzF;AAED,2FAA2F;AAC3F,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,CAUxE"}

package/dist/terraform/reach.js

@@ -0,0 +1,170 @@
+/**
+ * Transitive reachability over the carve graph (#2325).
+ *
+ * `inboundEdges`/`outboundEdges` in `graph.ts` answer one hop with a linear
+ * scan, which is right for the scorer's depth-1 counts and wrong as the step of
+ * a walk: calling it per node per step is O(V²E). This module builds one
+ * index per graph instead, and walks it with the same breadth-first walk
+ * `chant search` uses (`graph-walk.ts`).
+ *
+ * Four rules from the spike (docs/design/carve-dependency-blast-radius-spike.md)
+ * hold for every walk here and for the set functions in `cuts.ts` built on it:
+ *
+ *  - Folds contract first. A folded sub-resource is its parent for the walk, so
+ *    `aws_s3_bucket_versioning.assets` is never a dependent of
+ *    `aws_s3_bucket.assets`, and a node reading the child depends on the
+ *    parent.
+ *  - Outputs are terminal and counted apart. An `output.<name>` pseudo-address
+ *    has no inbound edges, so it never extends a path; it is reported in its
+ *    own list.
+ *  - Modules and unresolved `count`/`for_each` hide how much a node holds. A
+ *    `module.x` node is one node whatever it contains, and `count = 20` is one
+ *    node until `--state` resolves it. They are walked through and named, so a
+ *    caller can say `unknown` instead of a number.
+ *  - Cross-stack hops are told apart. On the CDK path an `Fn::ImportValue` edge
+ *    carries `crossStack: true`; what is reachable only through one is listed
+ *    separately.
+ *
+ * Pure, like the rest of the carve analysis. `src/cdk/graph.ts` emits the same
+ * `TfGraph`, so one implementation covers both sources.
+ */
+import { adjacencyOf, walkBreadthFirst } from "../graph-walk.js";
+import { computeFolds } from "./folds.js";
+const indexes = new WeakMap();
+/**
+ * The fold-contracted adjacency index for a graph, built on first use and
+ * cached against the graph object. O(V+E) to build; every walk after that is
+ * O(V+E). A caller that mutates `graph.edges` after the first walk must pass a
+ * new graph object (`applyStateCounts` only touches node instance counts, which
+ * the index reads live).
+ */
+export function carveIndex(graph) {
+    const cached = indexes.get(graph);
+    if (cached)
+        return cached;
+    const nodes = new Map(graph.nodes.map((n) => [n.address, n]));
+    const parentOf = new Map();
+    const { childrenOf } = computeFolds(graph);
+    for (const [parent, children] of childrenOf)
+        for (const child of children)
+            parentOf.set(child, parent);
+    const rep = (address) => parentOf.get(address) ?? address;
+    const contracted = [];
+    for (const e of graph.edges) {
+        const from = rep(e.from);
+        const to = rep(e.to);
+        if (from === to)
+            continue; // a folded child reading its own parent is not an edge of the fold
+        contracted.push({ ...e, from, to, edge: e });
+    }
+    const index = {
+        graph,
+        nodes,
+        rep,
+        membersOf: (address) => [address, ...[...(childrenOf.get(address) ?? [])].sort()],
+        adj: adjacencyOf(contracted),
+        crossStack: graph.edges.some((e) => e.crossStack),
+    };
+    indexes.set(graph, index);
+    return index;
+}
+/** `output.<name>`: a pseudo-address `buildGraph` gives an output block's edges (#1638). */
+export function isOutputAddress(address) {
+    return address.startsWith("output.");
+}
+/**
+ * Whether a node stands for an amount of infrastructure the graph cannot see:
+ * a Terraform `module` block (one node, whatever it holds; state is not read
+ * inside modules), or a `count`/`for_each` block whose instance count no
+ * `.tfstate` resolved. A CDK L3 construct is also `kind: "module"`, but its
+ * members are listed and its address is a construct path, so it hides nothing.
+ */
+export function hidesContents(node) {
+    if (node.kind === "module" && node.address.startsWith("module."))
+        return true;
+    return node.expansion !== undefined && node.instancesFrom !== "state";
+}
+/**
+ * Walk from `seeds` (already contracted) and return every node reached with its
+ * shortest depth, seeds excluded. `sameStack` refuses `crossStack` edges.
+ */
+export function walkFrom(index, seeds, direction, opts = {}) {
+    const start = new Set(seeds);
+    const reached = new Map();
+    const stepsAlong = (edges, far) => (edges ?? []).filter((e) => !(opts.sameStack && e.crossStack)).map((e) => ({ far: e[far], hops: [] }));
+    walkBreadthFirst(start, {
+        steps: (id) => {
+            if (isOutputAddress(id) && !start.has(id))
+                return [];
+            const steps = [];
+            if (direction !== "out")
+                steps.push(...stepsAlong(index.adj.in.get(id), "from"));
+            if (direction !== "in")
+                steps.push(...stepsAlong(index.adj.out.get(id), "to"));
+            return steps;
+        },
+        arrive: ({ id, depth }) => {
+            if (!start.has(id) && !reached.has(id))
+                reached.set(id, depth);
+            return false;
+        },
+    });
+    return reached;
+}
+/**
+ * Everything reachable from `address` (#2325). Direction `in` (the default)
+ * walks dependents: what a change to `address` reaches, its blast radius.
+ * Direction `out` walks dependencies: what `address` needs.
+ *
+ * Throws when `address` is not a node of the graph.
+ */
+export function reach(graph, address, opts = {}) {
+    const index = carveIndex(graph);
+    if (!index.nodes.has(address))
+        throw new Error(`reach: ${address} is not a resource or module in this graph`);
+    const start = index.rep(address);
+    const direction = opts.direction ?? "in";
+    const reached = walkFrom(index, [start], direction);
+    const sorted = [...reached.keys()].sort(cmp);
+    const resources = sorted.filter((a) => !isOutputAddress(a));
+    let crossStack = [];
+    if (index.crossStack) {
+        const inStack = walkFrom(index, [start], direction, { sameStack: true });
+        crossStack = resources.filter((a) => !inStack.has(a));
+    }
+    return {
+        address: start,
+        resources,
+        outputs: sorted.filter(isOutputAddress),
+        depth: Math.max(0, ...reached.values()),
+        crossStack,
+        hidden: resources.filter((a) => hidesContents(index.nodes.get(a))),
+    };
+}
+/** Code-point order, as `buildGraph` sorts: locale-independent. */
+export function cmp(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/** The instances `addresses` stand for, or `"unknown"` when one of them hides its contents. */
+export function weigh(index, addresses) {
+    let total = 0;
+    for (const address of addresses) {
+        const node = index.nodes.get(address);
+        if (hidesContents(node))
+            return "unknown";
+        total += node.instances;
+    }
+    return total;
+}
+/** The {@link BlastRadius} of `address`: its {@link reach} through dependents, counted. */
+export function blastRadius(graph, address) {
+    const index = carveIndex(graph);
+    const r = reach(graph, address);
+    return {
+        resources: weigh(index, r.resources),
+        outputs: r.outputs.length,
+        depth: r.depth,
+        ...(index.crossStack ? { crossStack: weigh(index, r.crossStack) } : {}),
+        ...(r.hidden.length ? { hiddenBy: r.hidden } : {}),
+    };
+}

package/dist/terraform/score.d.ts

@@ -29,6 +29,7 @@
  * scorer. Everything else — the six penalty terms, the clamp, the bands — is
  * shared verbatim.
  */
+import { type BlastRadius } from "./reach.js";
 import { type TierInfo } from "./tier-map.js";
 import type { TfGraph, TfNode } from "./types.js";
 export type PeelabilityBand = "clean leaf" | "carvable w/ edits" | "leave in Terraform";
@@ -90,6 +91,12 @@ export interface Peelability {
     notes?: string[];
     /** The source units folded into this node (#1056). */
     members?: CarveUnitMember[];
+    /**
+     * How far a change to this node reaches through its dependents (#2326). Its
+     * own axis: it never feeds `score`, so `100 + sum(breakdown.penalties)`
+     * still reproduces the score.
+     */
+    radius?: BlastRadius;
 }
 /**
  * Source-specific scoring input for one node, layered on the shared model.
@@ -117,11 +124,18 @@ export interface ScoreOptions {
      */
     tierOf?: (type: string) => TierInfo | null;
     signalsFor?: (node: TfNode) => ScoreSignals;
+    /**
+     * Compute each node's blast radius (#2326). Default true; a caller that only
+     * wants the score (`boundaryReport`) turns it off rather than walk the graph
+     * once per node for a field it drops.
+     */
+    radius?: boolean;
 }
 export declare function bandFor(score: number): PeelabilityBand;
 /**
  * Score every carvable node in the estate, ranked most-peelable first. Folded
  * sub-resources are omitted (they carve with their parent, not on their own).
+ * Each carries its blast radius (#2326) beside the score, not in it.
  */
 export declare function scoreEstate(graph: TfGraph, opts?: ScoreOptions): Peelability[];
 //# sourceMappingURL=score.d.ts.map

package/dist/terraform/score.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"score.d.ts","sourceRoot":"","sources":["../../src/terraform/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAGH,OAAO,EAA6B,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAE/C,MAAM,MAAM,eAAe,GAAG,YAAY,GAAG,mBAAmB,GAAG,oBAAoB,CAAC;AAExF,MAAM,WAAW,oBAAoB;IACnC,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;OAKG;IACH,SAAS,EAAE;QACT,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,MAAM,CAAC;QAClB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;KACxB,CAAC;CACH;AAED;;;;;;GAMG;AACH,MAAM,WAAW,eAAe;IAC9B,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,GAAG,QAAQ,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,eAAe,CAAC;IACtB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,oBAAoB,CAAC;IAChC;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,sDAAsD;IACtD,OAAO,CAAC,EAAE,eAAe,EAAE,CAAC;CAC7B;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,CAAC,EAAE,eAAe,EAAE,CAAC;IAC5B;;;;;OAKG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,QAAQ,GAAG,IAAI,CAAC;IAC3C,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,YAAY,CAAC;CAC7C;AAUD,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,CAItD;AAyGD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,GAAE,YAAiB,GAAG,WAAW,EAAE,CAMlF"}
+{"version":3,"file":"score.d.ts","sourceRoot":"","sources":["../../src/terraform/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAIH,OAAO,EAAe,KAAK,WAAW,EAAE,MAAM,SAAS,CAAC;AACxD,OAAO,EAAe,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,KAAK,EAAU,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAEvD,MAAM,MAAM,eAAe,GAAG,YAAY,GAAG,mBAAmB,GAAG,oBAAoB,CAAC;AAExF,MAAM,WAAW,oBAAoB;IACnC,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;OAKG;IACH,SAAS,EAAE;QACT,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,MAAM,CAAC;QAClB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;KACxB,CAAC;CACH;AAED;;;;;;GAMG;AACH,MAAM,WAAW,eAAe;IAC9B,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,GAAG,QAAQ,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,eAAe,CAAC;IACtB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,oBAAoB,CAAC;IAChC;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,sDAAsD;IACtD,OAAO,CAAC,EAAE,eAAe,EAAE,CAAC;IAC5B;;;;OAIG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,CAAC,EAAE,eAAe,EAAE,CAAC;IAC5B;;;;;OAKG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,QAAQ,GAAG,IAAI,CAAC;IAC3C,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,YAAY,CAAC;IAC5C;;;;OAIG;IACH,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAUD,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,CAItD;AAmFD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,GAAE,YAAiB,GAAG,WAAW,EAAE,CAWlF"}

package/dist/terraform/score.js

@@ -29,8 +29,10 @@
  * scorer. Everything else — the six penalty terms, the clamp, the bands — is
  * shared verbatim.
  */
-import { inboundEdges, outboundEdges } from "./graph.js";
-import { foldParentOf, resolveTier } from "./tier-map.js";
+import { adjacencyOf } from "../graph-walk.js";
+import { computeFolds } from "./folds.js";
+import { blastRadius } from "./reach.js";
+import { resolveTier } from "./tier-map.js";
 const clamp = (n) => Math.max(0, Math.min(100, n));
 /**
  * `-12 * 0` is `-0`, and JSON has no notation for it — a report written to a
@@ -46,38 +48,13 @@ export function bandFor(score) {
 }
 /** Module tier: a module maps to a chant composite — reshaping, so tier 2 by default. */
 const MODULE_TIER = 2;
-/**
- * Build the set of addresses that fold into a parent present in the estate, plus
- * the reverse lookup (parent → its folded children), so a parent can discount
- * inbound edges coming from its own folded sub-resources.
- */
-function computeFolds(graph) {
-    const byAddress = new Map(graph.nodes.map((n) => [n.address, n]));
-    const folded = new Set();
-    const childrenOf = new Map();
-    for (const node of graph.nodes) {
-        if (node.kind !== "resource" || !node.type)
-            continue;
-        const parentType = foldParentOf(node.type);
-        if (!parentType)
-            continue;
-        const parentAddress = `${parentType}.${node.name}`;
-        if (!byAddress.has(parentAddress))
-            continue; // sub-resource without its parent → score it on its own
-        folded.add(node.address);
-        if (!childrenOf.has(parentAddress))
-            childrenOf.set(parentAddress, new Set());
-        childrenOf.get(parentAddress).add(node.address);
-    }
-    return { folded, childrenOf };
-}
-function scoreNode(node, graph, foldedChildren, opts) {
+function scoreNode(node, adj, foldedChildren, opts) {
     // Inbound excludes edges from this node's own folded sub-resources, and
     // counts output blocks separately — they cost less to bridge (#1638).
-    const inboundAll = inboundEdges(graph, node.address).filter((e) => !foldedChildren.has(e.from));
+    const inboundAll = (adj.in.get(node.address) ?? []).filter((e) => !foldedChildren.has(e.from));
     const inbound = inboundAll.filter((e) => e.fromKind !== "output").length;
     const outputs = inboundAll.length - inbound;
-    const outbound = outboundEdges(graph, node.address).length;
+    const outbound = (adj.out.get(node.address) ?? []).length;
     const signals = opts.signalsFor?.(node) ?? {};
     const extra = { ...(signals.penalties ?? {}) };
     const trimmings = {
@@ -141,11 +118,17 @@ function scoreNode(node, graph, foldedChildren, opts) {
 /**
  * Score every carvable node in the estate, ranked most-peelable first. Folded
  * sub-resources are omitted (they carve with their parent, not on their own).
+ * Each carries its blast radius (#2326) beside the score, not in it.
  */
 export function scoreEstate(graph, opts = {}) {
     const { folded, childrenOf } = computeFolds(graph);
+    // One edge index for the whole pass: a per-node edge filter is O(E) each, O(V·E) in all (#4391).
+    const adj = adjacencyOf(graph.edges);
     return graph.nodes
         .filter((n) => !folded.has(n.address))
-        .map((n) => scoreNode(n, graph, childrenOf.get(n.address) ?? new Set(), opts))
+        .map((n) => {
+        const scored = scoreNode(n, adj, childrenOf.get(n.address) ?? new Set(), opts);
+        return opts.radius === false ? scored : { ...scored, radius: blastRadius(graph, n.address) };
+    })
         .sort((a, b) => b.score - a.score || (a.address < b.address ? -1 : a.address > b.address ? 1 : 0));
 }

package/dist/terraform/state.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/terraform/state.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAevC,sEAAsE;AACtE,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACrC;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAU1F;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,SAAS,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAW9E;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,CAMrF"}
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/terraform/state.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAevC,sEAAsE;AACtE,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACrC;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAU1F;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,SAAS,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAW9E;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,CAQrF"}

package/dist/terraform/state.js

@@ -60,8 +60,10 @@ export function readStateInstanceCounts(statePath) {
 export function applyStateCounts(graph, counts) {
     for (const node of graph.nodes) {
         const n = counts.get(node.address);
-        if (n !== undefined)
-            node.instances = Math.max(1, n);
+        if (n === undefined)
+            continue;
+        node.instances = Math.max(1, n);
+        node.instancesFrom = "state";
     }
     return graph;
 }

package/dist/terraform/types.d.ts

@@ -27,6 +27,14 @@ export interface TfNode {
     instances: number;
     /** `count`, `for_each`, a `data` source, or an unresolved interpolation is present. */
     hasDynamic: boolean;
+    /**
+     * The block's own expansion meta-argument, when it has one (#2325). Unlike
+     * `hasDynamic`, which a `data` read also sets, this says the node stands for
+     * an unknown number of instances until state resolves it.
+     */
+    expansion?: "count" | "for_each";
+    /** `"state"` once `applyStateCounts` read this node's instance count from a `.tfstate` (#2325). */
+    instancesFrom?: "state";
     /**
      * The resource's physical name, when it is a plain literal in the HCL (e.g.
      * `bucket = "myapp-assets-prod"`). Used to build the live-import selector on

package/dist/terraform/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/terraform/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,+EAA+E;AAC/E,MAAM,WAAW,MAAM;IACrB,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,GAAG,QAAQ,CAAC;IAC5B,8DAA8D;IAC9D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,uFAAuF;IACvF,UAAU,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,8DAA8D;IAC9D,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;OAKG;IACH,GAAG,EAAE,MAAM,EAAE,CAAC;IACd;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACrD,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACjD,8FAA8F;IAC9F,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;IACnB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/terraform/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,+EAA+E;AAC/E,MAAM,WAAW,MAAM;IACrB,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,GAAG,QAAQ,CAAC;IAC5B,8DAA8D;IAC9D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,uFAAuF;IACvF,UAAU,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IACjC,mGAAmG;IACnG,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,8DAA8D;IAC9D,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;OAKG;IACH,GAAG,EAAE,MAAM,EAAE,CAAC;IACd;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACrD,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACjD,8FAA8F;IAC9F,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;IACnB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB"}

package/dist/wave-blocked.d.ts

@@ -66,7 +66,8 @@ export declare function writeWaveOutcomeFile(dir: string, wave: number, part: {
  * The outcome of each member of the waves before `wave`, as their jobs wrote
  * them under `dirs`, and the earliest such wave that holds every later
  * member, if any. For a member more than one job wrote (a re-run, or a split
- * wave's deciding job and the share that applied it), the newest. A file
+ * wave's deciding job and the share that applied it), the newest, and on a
+ * tie the share's rather than the deciding job's `decided`. A file
  * that does not parse, or is of another version, is skipped.
  */
 export declare function earlierWaveOutcomes(dirs: readonly string[], wave: number): {
@@ -76,4 +77,12 @@ export declare function earlierWaveOutcomes(dirs: readonly string[], wave: numbe
     }>;
     holdsAll?: number;
 };
+/**
+ * The newest outcome file named `name` under `dirs` (#4322), as
+ * {@link waveOutcomeFileName} names one job's: a split wave's share job
+ * reads its deciding job's, `outcome-wave-<k>.json`, to learn which runs that
+ * job decided and which it blocked. Undefined when there is none, or none
+ * that parses at this version.
+ */
+export declare function readWaveOutcomeFile(dirs: readonly string[], name: string): WaveOutcomeFile | undefined;
 //# sourceMappingURL=wave-blocked.d.ts.map

package/dist/wave-blocked.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"wave-blocked.d.ts","sourceRoot":"","sources":["../src/wave-blocked.ts"],"names":[],"mappings":"AAgDA,eAAO,MAAM,oBAAoB,IAAI,CAAC;AAEtC,MAAM,MAAM,gBAAgB,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,aAAa,GAAG,SAAS,CAAC;AAElI,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,gBAAgB,CAAC;IACzB,gGAAgG;IAChG,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,kEAAkE;IAClE,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAC3C,qEAAqE;IACrE,SAAS,CAAC,EAAE,IAAI,CAAC;CAClB;AAID,uFAAuF;AACvF,wBAAgB,aAAa,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,GAAG,OAAO,CAE7E;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAChD,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,EAC5B,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAChD,QAAQ,CAAC,EAAE,MAAM,GAChB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgBrB;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACrC,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAChD,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAC/C;IAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,CAgBnE;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAAG,OAAO,CAUrF;AAID,gIAAgI;AAChI,wBAAgB,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAIzE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GAAG,MAAM,GAAG,SAAS,CAUpF;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,MAAM,CAIvG;AAED,0FAA0F;AAC1F,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,EACxC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAC1C,EAAE,SAA2B,EAC7B,QAAQ,UAAQ,GACf,MAAM,CAWR;AA6BD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,IAAI,EAAE,MAAM,GACX;IAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAuB/F"}
+{"version":3,"file":"wave-blocked.d.ts","sourceRoot":"","sources":["../src/wave-blocked.ts"],"names":[],"mappings":"AAgDA,eAAO,MAAM,oBAAoB,IAAI,CAAC;AAEtC,MAAM,MAAM,gBAAgB,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,aAAa,GAAG,SAAS,CAAC;AAElI,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,gBAAgB,CAAC;IACzB,gGAAgG;IAChG,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,kEAAkE;IAClE,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAC3C,qEAAqE;IACrE,SAAS,CAAC,EAAE,IAAI,CAAC;CAClB;AAID,uFAAuF;AACvF,wBAAgB,aAAa,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,GAAG,OAAO,CAE7E;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAChD,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,EAC5B,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAChD,QAAQ,CAAC,EAAE,MAAM,GAChB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgBrB;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACrC,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAChD,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAC/C;IAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,CAgBnE;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAAG,OAAO,CAUrF;AAID,gIAAgI;AAChI,wBAAgB,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAIzE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GAAG,MAAM,GAAG,SAAS,CAUpF;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,MAAM,CAIvG;AAED,0FAA0F;AAC1F,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,EACxC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAC1C,EAAE,SAA2B,EAC7B,QAAQ,UAAQ,GACf,MAAM,CAWR;AA6BD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,IAAI,EAAE,MAAM,GACX;IAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAwB/F;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CActG"}