@intentius/chant 0.124.46 → 0.124.49

package/dist/read-filter.js

@@ -0,0 +1,179 @@
+/**
+ * Typed filters for the contract reads (#4363): `--where <field><op><value>`
+ * and `--since <time>`, in place of an embedded SQL engine.
+ *
+ * Each read declares the fields it can be filtered on and their types
+ * ({@link FilterFields}). A clause naming a field the read doesn't declare, an
+ * operator its type doesn't take, or a value that isn't of its type is a
+ * {@link FilterError} before anything is read, so a typo never filters to an
+ * empty answer. Several `--where` clauses all have to hold.
+ *
+ * Operators: `=` and `!=` for every type; `<`, `<=`, `>` and `>=` for
+ * numbers, times and text (text compares by code point); `~` for text, which
+ * holds when the field contains the value. The value `null` matches a field
+ * that is null or absent, with `=` and `!=` only.
+ *
+ * A field of type `json` holds an object: a clause can name a key under it
+ * with dots (`labels.team=core`), and the value is compared as the type it
+ * holds there (a number with a number, a boolean with `true` or `false`, any
+ * other value as text). A JSON text is parsed first, so a ledger row that
+ * keeps the object as text filters the same way.
+ *
+ * A null or absent field matches only `=null` and `!=` with a value other
+ * than null; the other operators never hold for it.
+ *
+ * Pure: no I/O, so a bundle that filters rows loads nothing else.
+ */
+/** Every operator, longest first so `!=` is not read as `=`. */
+export const WHERE_OPERATORS = ["!=", "<=", ">=", "=", "<", ">", "~"];
+/** A clause or a `--since` that can't be applied. The message is for a person. */
+export class FilterError extends Error {
+}
+const ORDERED = ["<", "<=", ">", ">="];
+/**
+ * An instant from an ISO 8601 date or time, or from a span back from `now`:
+ * `<n>m`, `<n>h`, `<n>d` or `<n>w`. Epoch milliseconds, or null when `text`
+ * is neither.
+ */
+export function parseInstant(text, now = new Date()) {
+    const span = /^(\d+)([mhdw])$/.exec(text.trim());
+    if (span) {
+        const unit = { m: 60000, h: 3600000, d: 86400000, w: 604800000 }[span[2]];
+        return now.getTime() - Number(span[1]) * unit;
+    }
+    if (!/^\d{4}-\d{2}-\d{2}/.test(text.trim()))
+        return null;
+    const ms = Date.parse(text);
+    return Number.isNaN(ms) ? null : ms;
+}
+/** `--since <time>` as an ISO instant, or a {@link FilterError}. */
+export function parseSince(text, now = new Date()) {
+    const ms = parseInstant(text, now);
+    if (ms === null)
+        throw new FilterError(`--since takes an ISO 8601 date or time, or a span back from now such as 24h or 7d, not ${JSON.stringify(text)}`);
+    return new Date(ms).toISOString();
+}
+/** The declared field a dotted name starts at: the whole name, or its longest declared `json` prefix. */
+function resolveField(name, fields) {
+    if (Object.prototype.hasOwnProperty.call(fields, name))
+        return { base: name, path: [], type: fields[name] };
+    const parts = name.split(".");
+    for (let i = parts.length - 1; i > 0; i--) {
+        const base = parts.slice(0, i).join(".");
+        if (Object.prototype.hasOwnProperty.call(fields, base) && fields[base] === "json")
+            return { base, path: parts.slice(i), type: "json" };
+    }
+    return null;
+}
+/** Parse each `--where` against the fields a read declares. Throws a {@link FilterError}. */
+export function parseWhere(exprs, fields, now = new Date()) {
+    const names = Object.keys(fields).join(", ");
+    return exprs.map((expr) => {
+        const m = /^([A-Za-z_][\w.-]*)\s*(!=|<=|>=|=|<|>|~)(.*)$/s.exec(expr);
+        if (!m)
+            throw new FilterError(`--where takes <field><op><value>, with op one of ${WHERE_OPERATORS.join(" ")}, not ${JSON.stringify(expr)}`);
+        const [, field, op, rawValue] = m;
+        const raw = rawValue.trim();
+        const found = resolveField(field, fields);
+        if (!found)
+            throw new FilterError(`--where ${field}: no such field; this read filters on ${names}`);
+        const { base, path, type } = found;
+        if (type === "json" && path.length === 0)
+            throw new FilterError(`--where ${field}: holds an object; name a key under it, such as ${field}.<key>`);
+        const clause = (value) => ({ field, base, path, type, op, raw, value });
+        if (raw === "null") {
+            if (op !== "=" && op !== "!=")
+                throw new FilterError(`--where ${field}${op}null: null takes = or != only`);
+            return clause(null);
+        }
+        if (op === "~" && type !== "text" && type !== "json")
+            throw new FilterError(`--where ${field}~: ~ (contains) takes a text field; ${field} is ${type}`);
+        switch (type) {
+            case "number": {
+                const n = Number(raw);
+                if (raw === "" || !Number.isFinite(n))
+                    throw new FilterError(`--where ${field}: ${field} is a number, not ${JSON.stringify(raw)}`);
+                return clause(n);
+            }
+            case "boolean": {
+                if (ORDERED.includes(op))
+                    throw new FilterError(`--where ${field}${op}: a boolean takes = or != only`);
+                if (raw !== "true" && raw !== "false")
+                    throw new FilterError(`--where ${field}: ${field} is true or false, not ${JSON.stringify(raw)}`);
+                return clause(raw === "true");
+            }
+            case "time": {
+                const ms = parseInstant(raw, now);
+                if (ms === null)
+                    throw new FilterError(`--where ${field}: ${field} is a time; give an ISO 8601 date or time, or a span back from now such as 24h or 7d, not ${JSON.stringify(raw)}`);
+                return clause(ms);
+            }
+            default:
+                return clause(raw);
+        }
+    });
+}
+/** The value at a clause's field in `row`, parsing a JSON text on the way into a `json` field. */
+function valueAt(row, c) {
+    let v = row;
+    for (const key of c.base.split("."))
+        v = v !== null && typeof v === "object" ? v[key] : undefined;
+    for (const key of c.path) {
+        if (typeof v === "string") {
+            try {
+                v = JSON.parse(v);
+            }
+            catch {
+                return undefined;
+            }
+        }
+        v = v !== null && typeof v === "object" && !Array.isArray(v) ? v[key] : undefined;
+    }
+    return v;
+}
+function compare(a, b, op) {
+    switch (op) {
+        case "=": return a === b;
+        case "!=": return a !== b;
+        case "<": return a < b;
+        case "<=": return a <= b;
+        case ">": return a > b;
+        case ">=": return a >= b;
+        case "~": return String(a).includes(String(b));
+    }
+}
+/** Whether one clause holds for `row`. */
+export function clauseHolds(row, c) {
+    const v = valueAt(row, c);
+    if (c.value === null)
+        return c.op === "=" ? v === null || v === undefined : v !== null && v !== undefined;
+    if (v === null || v === undefined)
+        return c.op === "!=";
+    switch (c.type) {
+        case "number":
+            return typeof v === "number" && compare(v, c.value, c.op);
+        case "boolean":
+            return typeof v === "boolean" ? (c.op === "=") === (v === c.value) : false;
+        case "time": {
+            const ms = typeof v === "string" ? Date.parse(v) : typeof v === "number" ? v : NaN;
+            return !Number.isNaN(ms) && compare(ms, c.value, c.op);
+        }
+        case "text":
+            return typeof v === "string" && compare(v, c.value, c.op);
+        case "json": {
+            // Compared as the type the value holds there.
+            if (typeof v === "number" && c.op !== "~") {
+                const n = Number(c.raw);
+                return Number.isFinite(n) && compare(v, n, c.op);
+            }
+            if (typeof v === "boolean")
+                return (c.raw === "true" || c.raw === "false") && (c.op === "=" || c.op === "!=") ? (c.op === "=") === (String(v) === c.raw) : false;
+            const s = typeof v === "string" ? v : JSON.stringify(v);
+            return compare(s, c.raw, c.op);
+        }
+    }
+}
+/** Whether every clause holds for `row`. */
+export function matchesWhere(row, clauses) {
+    return clauses.every((c) => clauseHolds(row, c));
+}

package/dist/run-event.d.ts

@@ -47,7 +47,7 @@ export type RunEventStepStatus = "ok" | "failed" | "skipped" | "cached" | "gated
 /** Why a step was skipped. */
 export type RunEventSkipReason = "receipt" | "resumed" | "refused" | "not-run";
 /** How a gate's approval passed, when it was more than one person's approval of that gate. */
-export type RunEventGateVia = "quorum" | "policy" | "point" | "alias" | "empty";
+export type RunEventGateVia = "quorum" | "policy" | "point" | "alias" | "empty" | "workspace";
 /** The run every event of a stream names: the same on every line. */
 export interface RunEventRun {
     /**

package/dist/run-event.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"run-event.d.ts","sourceRoot":"","sources":["../src/run-event.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAClE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAGtD,kEAAkE;AAClE,eAAO,MAAM,mBAAmB,oFAAoF,CAAC;AAErH,8DAA8D;AAC9D,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C,8EAA8E;AAC9E,eAAO,MAAM,eAAe,aAAa,CAAC;AAE1C,2FAA2F;AAC3F,MAAM,MAAM,YAAY,GAAG,IAAI,GAAG,WAAW,GAAG,UAAU,CAAC;AAE3D,gGAAgG;AAChG,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,IAAI,CAAC;AAEzD,gHAAgH;AAChH,MAAM,MAAM,oBAAoB,GAAG,IAAI,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;AAEzE;;;GAGG;AACH,MAAM,MAAM,kBAAkB,GAAG,IAAI,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;AAE9F,8BAA8B;AAC9B,MAAM,MAAM,kBAAkB,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAE/E,8FAA8F;AAC9F,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;AAEhF,qEAAqE;AACrE,MAAM,WAAW,WAAW;IAC1B;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,YAAY,CAAC;IACnB,+EAA+E;IAC/E,IAAI,EAAE,MAAM,CAAC;IACb,sFAAsF;IACtF,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,OAAO,EAAE,eAAe,CAAC;IACzB;;;;OAIG;IACH,SAAS,EAAE,SAAS,CAAC;CACtB;AAED,iDAAiD;AACjD,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,OAAO,EAAE,OAAO,mBAAmB,CAAC;IACpC,QAAQ,EAAE,OAAO,0BAA0B,CAAC;IAC5C,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,oEAAoE;IACpE,GAAG,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,WAAW,CAAC;IAClB,mGAAmG;IACnG,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC;CAC1B;AAED,qEAAqE;AACrE,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,MAAM,EAAE,oBAAoB,CAAC;IAC7B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,eAAe,CAAC;CAC3B;AAED,2GAA2G;AAC3G,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,qEAAqE;AACrE,eAAO,MAAM,uBAAuB,aAAa,CAAC;AAElD,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,oBAAoB,CAAC;CAC9B;AAED,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,iBAAiB,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,6BAA6B,GAAG,oBAAoB,GAAG,SAAS,GAAG,iBAAiB,CAAC;AAEjG,8GAA8G;AAC9G,eAAO,MAAM,8BAA8B,aAAa,CAAC;AAEzD,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,kBAAkB,CAAC;IACzB;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,6BAA6B,CAAC;IACtC,mFAAmF;IACnF,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,0HAA0H;AAC1H,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,oBAAoB,CAAC;CAC9B;AAED,sDAAsD;AACtD,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,kBAAkB,CAAC;IAC3B,kEAAkE;IAClE,IAAI,CAAC,EAAE,kBAAkB,GAAG,IAAI,CAAC;IACjC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,kCAAkC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,8FAA8F;AAC9F,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,EAAE,EAAE,MAAM,CAAC;IACX,8EAA8E;IAC9E,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,qDAAqD;IACrD,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,eAAe,CAAC;IACtB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,eAAe,GAAG,IAAI,CAAC;IAC5B,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,4EAA4E;AAC5E,MAAM,MAAM,YAAY,GACpB,gBAAgB,GAChB,iBAAiB,GACjB,iBAAiB,GACjB,kBAAkB,GAClB,sBAAsB,GACtB,uBAAuB,GACvB,kBAAkB,GAClB,mBAAmB,GACnB,iBAAiB,GACjB,kBAAkB,GAClB,mBAAmB,GACnB,oBAAoB,CAAC;AAEzB,MAAM,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;AAEhD,wFAAwF;AACxF,eAAO,MAAM,eAAe,uMAagB,CAAC;AAE7C,kCAAkC;AAClC,MAAM,MAAM,QAAQ,GAAG,YAAY,SAAS,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,YAAY,GAAG,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AAEtH,yFAAyF;AACzF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAEzD;AAED,yFAAyF;AACzF,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,WAAW,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,yCAAyC;IACzC,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC;IACnB,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,GAAG,QAAQ,CAiBhF;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,GAAG,QAAQ,CAI/G;AAED,6FAA6F;AAC7F,MAAM,WAAW,cAAc;IAC7B,qDAAqD;IACrD,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,QAAQ,CAAC;IACnC,qCAAqC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACpC,GAAG,EAAE,WAAW,CAAC;IACjB,yDAAyD;IACzD,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAC/B,2CAA2C;IAC3C,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;IACjB,0FAA0F;IAC1F,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,uGAAuG;AACvG,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,qBAAqB,GAAG,cAAc,CAYhF;AAID;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,gBAAgB,GAAG,YAAY,CA8BxE;AAID;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,UAAU,EAClB,GAAG,EAAE;IACH,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,EAAE,kBAAkB,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0EAA0E;IAC1E,IAAI,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CACrC,GACA,YAAY,EAAE,CAqDhB"}
+{"version":3,"file":"run-event.d.ts","sourceRoot":"","sources":["../src/run-event.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAClE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAGtD,kEAAkE;AAClE,eAAO,MAAM,mBAAmB,oFAAoF,CAAC;AAErH,8DAA8D;AAC9D,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C,8EAA8E;AAC9E,eAAO,MAAM,eAAe,aAAa,CAAC;AAE1C,2FAA2F;AAC3F,MAAM,MAAM,YAAY,GAAG,IAAI,GAAG,WAAW,GAAG,UAAU,CAAC;AAE3D,gGAAgG;AAChG,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,IAAI,CAAC;AAEzD,gHAAgH;AAChH,MAAM,MAAM,oBAAoB,GAAG,IAAI,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;AAEzE;;;GAGG;AACH,MAAM,MAAM,kBAAkB,GAAG,IAAI,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;AAE9F,8BAA8B;AAC9B,MAAM,MAAM,kBAAkB,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAE/E,8FAA8F;AAC9F,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,WAAW,CAAC;AAE9F,qEAAqE;AACrE,MAAM,WAAW,WAAW;IAC1B;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,YAAY,CAAC;IACnB,+EAA+E;IAC/E,IAAI,EAAE,MAAM,CAAC;IACb,sFAAsF;IACtF,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,OAAO,EAAE,eAAe,CAAC;IACzB;;;;OAIG;IACH,SAAS,EAAE,SAAS,CAAC;CACtB;AAED,iDAAiD;AACjD,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,OAAO,EAAE,OAAO,mBAAmB,CAAC;IACpC,QAAQ,EAAE,OAAO,0BAA0B,CAAC;IAC5C,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,oEAAoE;IACpE,GAAG,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,WAAW,CAAC;IAClB,mGAAmG;IACnG,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC;CAC1B;AAED,qEAAqE;AACrE,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,MAAM,EAAE,oBAAoB,CAAC;IAC7B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,eAAe,CAAC;CAC3B;AAED,2GAA2G;AAC3G,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,qEAAqE;AACrE,eAAO,MAAM,uBAAuB,aAAa,CAAC;AAElD,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,oBAAoB,CAAC;CAC9B;AAED,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,iBAAiB,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,6BAA6B,GAAG,oBAAoB,GAAG,SAAS,GAAG,iBAAiB,CAAC;AAEjG,8GAA8G;AAC9G,eAAO,MAAM,8BAA8B,aAAa,CAAC;AAEzD,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,kBAAkB,CAAC;IACzB;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,6BAA6B,CAAC;IACtC,mFAAmF;IACnF,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,0HAA0H;AAC1H,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,oBAAoB,CAAC;CAC9B;AAED,sDAAsD;AACtD,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,CAAC;IACnB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,aAAa,CAAC;IACpB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,kBAAkB,CAAC;IAC3B,kEAAkE;IAClE,IAAI,CAAC,EAAE,kBAAkB,GAAG,IAAI,CAAC;IACjC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,kCAAkC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,8FAA8F;AAC9F,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,EAAE,EAAE,MAAM,CAAC;IACX,8EAA8E;IAC9E,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,qDAAqD;IACrD,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,eAAe,CAAC;IACtB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,eAAe,GAAG,IAAI,CAAC;IAC5B,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,4EAA4E;AAC5E,MAAM,MAAM,YAAY,GACpB,gBAAgB,GAChB,iBAAiB,GACjB,iBAAiB,GACjB,kBAAkB,GAClB,sBAAsB,GACtB,uBAAuB,GACvB,kBAAkB,GAClB,mBAAmB,GACnB,iBAAiB,GACjB,kBAAkB,GAClB,mBAAmB,GACnB,oBAAoB,CAAC;AAEzB,MAAM,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;AAEhD,wFAAwF;AACxF,eAAO,MAAM,eAAe,uMAagB,CAAC;AAE7C,kCAAkC;AAClC,MAAM,MAAM,QAAQ,GAAG,YAAY,SAAS,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,YAAY,GAAG,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AAEtH,yFAAyF;AACzF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAEzD;AAED,yFAAyF;AACzF,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,WAAW,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,yCAAyC;IACzC,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC;IACnB,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,GAAG,QAAQ,CAiBhF;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,GAAG,QAAQ,CAI/G;AAED,6FAA6F;AAC7F,MAAM,WAAW,cAAc;IAC7B,qDAAqD;IACrD,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,QAAQ,CAAC;IACnC,qCAAqC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACpC,GAAG,EAAE,WAAW,CAAC;IACjB,yDAAyD;IACzD,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAC/B,2CAA2C;IAC3C,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;IACjB,0FAA0F;IAC1F,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,uGAAuG;AACvG,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,qBAAqB,GAAG,cAAc,CAYhF;AAID;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,gBAAgB,GAAG,YAAY,CA8BxE;AAID;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,UAAU,EAClB,GAAG,EAAE;IACH,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,EAAE,kBAAkB,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0EAA0E;IAC1E,IAAI,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CACrC,GACA,YAAY,EAAE,CAqDhB"}

package/dist/terraform/carve.d.ts

@@ -10,8 +10,9 @@
  * (via live import) and generating the TF patches live in the command/bridge
  * layers; this module just classifies the boundary.
  */
-import { type ScoreOptions } from "./score.js";
-import type { TfGraph } from "./types.js";
+import { type Peelability, type ScoreOptions } from "./score.js";
+import { type Adjacency } from "../graph-walk.js";
+import type { TfEdge, TfGraph, TfNode } from "./types.js";
 /** One resource in the carve set (the selected node plus its folded sub-resources). */
 export interface CarveMember {
     address: string;
@@ -77,7 +78,20 @@ export interface CarveReport {
  * that fold into it (same name, a `foldParentOf` child type whose parent is the
  * selection). Those are carried along and inlined, not left behind.
  */
-export declare function resolveCarveSet(graph: TfGraph, target: string): CarveMember[];
+export declare function resolveCarveSet(graph: TfGraph, target: string, index?: BoundaryIndex): CarveMember[];
+/**
+ * What `boundaryReport` looks up per target, built once per graph: nodes by
+ * address, the edges by both ends, and each fold parent's children in graph
+ * order. Without it each report scans the node and edge lists itself, which
+ * over a whole estate is O(V·E) (#4391).
+ */
+export interface BoundaryIndex {
+    byAddress: Map<string, TfNode>;
+    adjacency: Adjacency<TfEdge>;
+    /** `foldKey(parent type, name)` → resource nodes that fold into that parent. */
+    foldChildren: Map<string, TfNode[]>;
+}
+export declare function boundaryIndex(graph: TfGraph): BoundaryIndex;
 /**
  * Which source the graph came from, and so which vocabulary its bridge patches
  * are named in. Terraform is the default; `cdk` is the read-only cloud-assembly
@@ -89,6 +103,13 @@ export interface BoundaryOptions {
     dialect?: CarveDialect;
     /** Scoring hooks, so `peelability` is the same number the ranking reported. */
     score?: ScoreOptions;
+    /**
+     * The target's score, when the caller already holds it (`carve advise`).
+     * Without it the estate is scored to find it (#4391).
+     */
+    peelability?: Pick<Peelability, "score">;
+    /** `boundaryIndex(graph)`, shared across calls on one graph. */
+    index?: BoundaryIndex;
 }
 /**
  * Classify the boundary of carving `target`: the inbound edges that need an

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

@@ -1 +1 @@
-{"version":3,"file":"carve.d.ts","sourceRoot":"","sources":["../../src/terraform/carve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,EAAe,KAAK,YAAY,EAAE,MAAM,SAAS,CAAC;AACzD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAEvC,uFAAuF;AACvF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,iBAAiB,GAAG,SAAS,GAAG,UAAU,CAAC;AAEvD;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,iBAAiB,CAAC;IAC7B,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;OAKG;IACH,GAAG,EAAE,MAAM,EAAE,CAAC;IACd;;;;;;OAMG;IACH,MAAM,EAAE,gBAAgB,GAAG,mBAAmB,GAAG,YAAY,GAAG,oBAAoB,GAAG,gBAAgB,CAAC;IACxG,QAAQ,EAAE,aAAa,GAAG,UAAU,CAAC;IACrC,uEAAuE;IACvE,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,qCAAqC;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,iFAAiF;IACjF,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE,CAgB7E;AAED;;;;;GAKG;AACH,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG,KAAK,CAAC;AAE/C,MAAM,WAAW,eAAe;IAC9B,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,+EAA+E;IAC/E,KAAK,CAAC,EAAE,YAAY,CAAC;CACtB;AAQD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,WAAW,GAAG,IAAI,CA0D7G;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAajE"}
+{"version":3,"file":"carve.d.ts","sourceRoot":"","sources":["../../src/terraform/carve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,EAAe,KAAK,WAAW,EAAE,KAAK,YAAY,EAAE,MAAM,SAAS,CAAC;AAC3E,OAAO,EAAe,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAC5D,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAEvD,uFAAuF;AACvF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,iBAAiB,GAAG,SAAS,GAAG,UAAU,CAAC;AAEvD;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,iBAAiB,CAAC;IAC7B,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;OAKG;IACH,GAAG,EAAE,MAAM,EAAE,CAAC;IACd;;;;;;OAMG;IACH,MAAM,EAAE,gBAAgB,GAAG,mBAAmB,GAAG,YAAY,GAAG,oBAAoB,GAAG,gBAAgB,CAAC;IACxG,QAAQ,EAAE,aAAa,GAAG,UAAU,CAAC;IACrC,uEAAuE;IACvE,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,qCAAqC;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,iFAAiF;IACjF,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,aAAa,GAAG,WAAW,EAAE,CAYpG;AAID;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7B,gFAAgF;IAChF,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CACrC;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa,CAgB3D;AAED;;;;;GAKG;AACH,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG,KAAK,CAAC;AAE/C,MAAM,WAAW,eAAe;IAC9B,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,+EAA+E;IAC/E,KAAK,CAAC,EAAE,YAAY,CAAC;IACrB;;;OAGG;IACH,WAAW,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACzC,gEAAgE;IAChE,KAAK,CAAC,EAAE,aAAa,CAAC;CACvB;AAQD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,WAAW,GAAG,IAAI,CA0D7G;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAajE"}

package/dist/terraform/carve.js

@@ -13,29 +13,47 @@
 import { inboundEdges, outboundEdges } from "./graph.js";
 import { foldParentOf, resolveTier } from "./tier-map.js";
 import { scoreEstate } from "./score.js";
+import { adjacencyOf } from "../graph-walk.js";
 /**
  * The carve set for a selected address: the node itself plus any sub-resources
  * that fold into it (same name, a `foldParentOf` child type whose parent is the
  * selection). Those are carried along and inlined, not left behind.
  */
-export function resolveCarveSet(graph, target) {
-    const byAddress = new Map(graph.nodes.map((n) => [n.address, n]));
+export function resolveCarveSet(graph, target, index) {
+    const { byAddress, foldChildren } = index ?? boundaryIndex(graph);
     const selected = byAddress.get(target);
     if (!selected)
         return [];
     const members = [{ address: selected.address, type: selected.type }];
     if (selected.kind === "resource" && selected.type) {
-        for (const node of graph.nodes) {
-            if (node.kind !== "resource" || !node.type)
-                continue;
-            const parentType = foldParentOf(node.type);
-            if (parentType === selected.type && node.name === selected.name) {
-                members.push({ address: node.address, type: node.type, foldedInto: selected.address });
-            }
+        for (const node of foldChildren.get(foldKey(selected.type, selected.name)) ?? []) {
+            members.push({ address: node.address, type: node.type, foldedInto: selected.address });
         }
     }
     return members;
 }
+const foldKey = (parentType, name) => `${parentType}\u001f${name}`;
+export function boundaryIndex(graph) {
+    const foldChildren = new Map();
+    for (const node of graph.nodes) {
+        if (node.kind !== "resource" || !node.type)
+            continue;
+        const parentType = foldParentOf(node.type);
+        if (!parentType)
+            continue;
+        const key = foldKey(parentType, node.name);
+        const list = foldChildren.get(key);
+        if (list)
+            list.push(node);
+        else
+            foldChildren.set(key, [node]);
+    }
+    return {
+        byAddress: new Map(graph.nodes.map((n) => [n.address, n])),
+        adjacency: adjacencyOf(graph.edges),
+        foldChildren,
+    };
+}
 /** The bridge patch an inbound cut needs, per source. */
 function inboundBridge(dialect, fromOutput) {
     if (dialect === "cdk")
@@ -50,14 +68,14 @@ function inboundBridge(dialect, fromOutput) {
  */
 export function boundaryReport(graph, target, opts = {}) {
     const dialect = opts.dialect ?? "terraform";
-    const carveSet = resolveCarveSet(graph, target);
+    const carveSet = resolveCarveSet(graph, target, opts.index);
     if (carveSet.length === 0)
         return null;
     const inSet = new Set(carveSet.map((m) => m.address));
     const inbound = [];
     const outbound = [];
     for (const member of carveSet) {
-        for (const e of inboundEdges(graph, member.address)) {
+        for (const e of (opts.index ? (opts.index.adjacency.in.get(member.address) ?? []) : inboundEdges(graph, member.address))) {
             if (inSet.has(e.from))
                 continue; // internal edge
             inbound.push({
@@ -71,7 +89,7 @@ export function boundaryReport(graph, target, opts = {}) {
                 ...(e.crossStack ? { crossStack: true } : {}),
             });
         }
-        for (const e of outboundEdges(graph, member.address)) {
+        for (const e of (opts.index ? (opts.index.adjacency.out.get(member.address) ?? []) : outboundEdges(graph, member.address))) {
             if (inSet.has(e.to))
                 continue; // internal edge
             outbound.push({
@@ -86,12 +104,12 @@ export function boundaryReport(graph, target, opts = {}) {
             });
         }
     }
-    const score = scoreEstate(graph, opts.score).find((r) => r.address === target);
+    const score = opts.peelability ?? scoreEstate(graph, { ...opts.score, radius: false }).find((r) => r.address === target);
     const diagnostics = [];
     const tierOf = opts.score?.tierOf ?? resolveTier;
     if (carveSet[0].type &&
         tierOf(carveSet[0].type) === null &&
-        graph.nodes.find((n) => n.address === target)?.kind === "resource") {
+        (opts.index?.byAddress ?? new Map(graph.nodes.map((n) => [n.address, n]))).get(target)?.kind === "resource") {
         diagnostics.push(`No known native mapping for ${carveSet[0].type} — emit will have no target type.`);
     }
     return {

package/dist/terraform/cuts.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Cuts and reference-closed sets over the carve graph (#3909).
+ *
+ * `carve advise` scores one block at a time. A consumer splitting one root into
+ * several (terragucci's estate carving) needs the same question for a set:
+ * which edges cross its boundary and which way, and the smallest set around a
+ * seed whose crossings all run a way the caller allows. These are pure
+ * functions over `TfGraph`, on the index and walk in `reach.ts`, so the rules
+ * there hold here too: folds contract first, outputs are terminal and counted
+ * apart, modules and unresolved `count` are named as hiding their contents, a
+ * `depends_on` cycle terminates, and `crossStack` edges are counted apart.
+ *
+ * Nothing here ranks sets, reads state or plan times, writes HCL, or knows
+ * about roots or backends; that stays with the consumer.
+ */
+import type { TfEdge, TfGraph } from "./types.js";
+/** Cut edges of one direction, counted. */
+export interface CutCount {
+    /** Edges whose reading side is a resource or module block. */
+    resources: number;
+    /** Edges whose reading side is an `output` block. */
+    outputs: number;
+    /** Of all of them, the `crossStack` edges (a CDK `Fn::ImportValue`). */
+    crossStack: number;
+}
+/** A set of blocks, as the walks see it. */
+export interface BlockSet {
+    /** Resource and module addresses, each fold parent with the blocks folded into it. Sorted. */
+    resources: string[];
+    /** `output.<name>` pseudo-addresses in the set. Sorted. */
+    outputs: string[];
+}
+export interface Cuts extends BlockSet {
+    /** Edges where something outside reads something inside, as the graph holds them. */
+    inbound: TfEdge[];
+    /** Edges where something inside reads something outside. */
+    outbound: TfEdge[];
+    counts: {
+        inbound: CutCount;
+        outbound: CutCount;
+    };
+    /** Cuts run in both directions: the set can move only with wiring both ways. */
+    bothWays: boolean;
+}
+/** The cut directions a closure may leave: `inbound` (outside may read in), `outbound` (inside may read out), or `none`. */
+export type CutAllowance = "inbound" | "outbound" | "none";
+export interface Closure extends Cuts {
+    /** The seeds as the walk saw them, folds contracted. */
+    seeds: string[];
+    allow: CutAllowance;
+    /**
+     * How many resource instances the set stands for: each block once, or its
+     * instance count once `--state` resolved it. `"unknown"` where a module or an
+     * unresolved `count`/`for_each` hides how much it holds; `hiddenBy` names them.
+     */
+    instances: number | "unknown";
+    hiddenBy?: string[];
+}
+export interface Component extends BlockSet {
+    /** As {@link Closure.instances}. */
+    instances: number | "unknown";
+    hiddenBy?: string[];
+}
+/**
+ * The graph's weakly connected components (#3909): blocks joined by a
+ * reference either way, fold-contracted, each module one node. An output never
+ * joins two components, since outputs are terminal; it is listed in every
+ * component it reads into. Components are sorted by their first address.
+ */
+export declare function components(graph: TfGraph): Component[];
+/**
+ * Every edge crossing the boundary of `addresses` (#3909). A folded block in
+ * the set brings its parent and siblings, and a fold parent its folded blocks,
+ * before anything is counted, so an edge inside one fold is never a cut. An
+ * `output.<name>` in the set is inside it like any block.
+ *
+ * Throws when an address is not a block of the graph.
+ */
+export declare function cuts(graph: TfGraph, addresses: Iterable<string>): Cuts;
+/**
+ * The smallest superset of `seeds` whose remaining cuts all run in the
+ * direction `allow` permits, plus those cuts (#3909).
+ *
+ *  - `outbound`: nothing outside may read in, so the set takes every
+ *    dependent of the seeds, outputs included.
+ *  - `inbound`: nothing inside may read out, so the set takes everything the
+ *    seeds depend on.
+ *  - `none`: the seeds' whole components, with each output that reads only
+ *    into them.
+ *
+ * Outputs are terminal, so none of these walks passes through one. An output
+ * that reads both the set and something outside it is therefore a cut no
+ * closure removes: under `none` it stays outside and its read into the set is
+ * left as an inbound cut, for the caller to wire.
+ */
+export declare function closure(graph: TfGraph, seeds: Iterable<string>, allow: CutAllowance): Closure;
+//# sourceMappingURL=cuts.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cuts.d.ts","sourceRoot":"","sources":["../../src/terraform/cuts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAE/C,2CAA2C;AAC3C,MAAM,WAAW,QAAQ;IACvB,8DAA8D;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,qDAAqD;IACrD,OAAO,EAAE,MAAM,CAAC;IAChB,wEAAwE;IACxE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,4CAA4C;AAC5C,MAAM,WAAW,QAAQ;IACvB,8FAA8F;IAC9F,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,IAAK,SAAQ,QAAQ;IACpC,qFAAqF;IACrF,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE;QAAE,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,EAAE,QAAQ,CAAA;KAAE,CAAC;IAClD,gFAAgF;IAChF,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,4HAA4H;AAC5H,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;AAE3D,MAAM,WAAW,OAAQ,SAAQ,IAAI;IACnC,wDAAwD;IACxD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,YAAY,CAAC;IACpB;;;;OAIG;IACH,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9B,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,SAAU,SAAQ,QAAQ;IACzC,oCAAoC;IACpC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9B,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACrB;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,EAAE,CAatD;AAED;;;;;;;GAOG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,IAAI,CAGtE;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,YAAY,GAAG,OAAO,CAmB7F"}

package/dist/terraform/cuts.js

@@ -0,0 +1,138 @@
+/**
+ * Cuts and reference-closed sets over the carve graph (#3909).
+ *
+ * `carve advise` scores one block at a time. A consumer splitting one root into
+ * several (terragucci's estate carving) needs the same question for a set:
+ * which edges cross its boundary and which way, and the smallest set around a
+ * seed whose crossings all run a way the caller allows. These are pure
+ * functions over `TfGraph`, on the index and walk in `reach.ts`, so the rules
+ * there hold here too: folds contract first, outputs are terminal and counted
+ * apart, modules and unresolved `count` are named as hiding their contents, a
+ * `depends_on` cycle terminates, and `crossStack` edges are counted apart.
+ *
+ * Nothing here ranks sets, reads state or plan times, writes HCL, or knows
+ * about roots or backends; that stays with the consumer.
+ */
+import { carveIndex, cmp, hidesContents, isOutputAddress, walkFrom, weigh } from "./reach.js";
+/**
+ * The graph's weakly connected components (#3909): blocks joined by a
+ * reference either way, fold-contracted, each module one node. An output never
+ * joins two components, since outputs are terminal; it is listed in every
+ * component it reads into. Components are sorted by their first address.
+ */
+export function components(graph) {
+    const index = carveIndex(graph);
+    const assigned = new Set();
+    const found = [];
+    for (const address of [...index.nodes.keys()].sort(cmp)) {
+        const start = index.rep(address);
+        if (assigned.has(start))
+            continue;
+        const reached = walkFrom(index, [start], "both");
+        const reps = [start, ...[...reached.keys()].filter((a) => !isOutputAddress(a))];
+        for (const rep of reps)
+            assigned.add(rep);
+        found.push({ ...blockSet(index, reps, [...reached.keys()].filter(isOutputAddress)), ...holdings(index, reps) });
+    }
+    return found;
+}
+/**
+ * Every edge crossing the boundary of `addresses` (#3909). A folded block in
+ * the set brings its parent and siblings, and a fold parent its folded blocks,
+ * before anything is counted, so an edge inside one fold is never a cut. An
+ * `output.<name>` in the set is inside it like any block.
+ *
+ * Throws when an address is not a block of the graph.
+ */
+export function cuts(graph, addresses) {
+    const index = carveIndex(graph);
+    return cutsOf(index, contract(index, addresses));
+}
+/**
+ * The smallest superset of `seeds` whose remaining cuts all run in the
+ * direction `allow` permits, plus those cuts (#3909).
+ *
+ *  - `outbound`: nothing outside may read in, so the set takes every
+ *    dependent of the seeds, outputs included.
+ *  - `inbound`: nothing inside may read out, so the set takes everything the
+ *    seeds depend on.
+ *  - `none`: the seeds' whole components, with each output that reads only
+ *    into them.
+ *
+ * Outputs are terminal, so none of these walks passes through one. An output
+ * that reads both the set and something outside it is therefore a cut no
+ * closure removes: under `none` it stays outside and its read into the set is
+ * left as an inbound cut, for the caller to wire.
+ */
+export function closure(graph, seeds, allow) {
+    const index = carveIndex(graph);
+    const start = contract(index, seeds);
+    const direction = allow === "outbound" ? "in" : allow === "inbound" ? "out" : "both";
+    const members = new Set([...start, ...walkFrom(index, start, direction).keys()]);
+    if (allow === "none") {
+        for (const address of [...members]) {
+            if (!isOutputAddress(address) || start.has(address))
+                continue;
+            const reads = (index.adj.out.get(address) ?? []).map((e) => e.to);
+            if (!reads.every((to) => members.has(to)))
+                members.delete(address);
+        }
+    }
+    const found = cutsOf(index, members);
+    return {
+        ...found,
+        seeds: [...start].sort(cmp),
+        allow,
+        ...holdings(index, [...members].filter((a) => !isOutputAddress(a))),
+    };
+}
+/** The addresses as the walks see them: each fold child replaced by its parent. Throws on an unknown address. */
+function contract(index, addresses) {
+    const out = new Set();
+    for (const address of addresses) {
+        const known = index.nodes.has(address) || (isOutputAddress(address) && index.adj.out.has(address));
+        if (!known)
+            throw new Error(`carve: ${address} is not a resource, module or output in this graph`);
+        out.add(index.rep(address));
+    }
+    return out;
+}
+function cutsOf(index, members) {
+    const inbound = [];
+    const outbound = [];
+    for (const address of members) {
+        for (const e of index.adj.in.get(address) ?? [])
+            if (!members.has(e.from))
+                inbound.push(e.edge);
+        for (const e of index.adj.out.get(address) ?? [])
+            if (!members.has(e.to))
+                outbound.push(e.edge);
+    }
+    const byEnds = (a, b) => cmp(a.from, b.from) || cmp(a.to, b.to);
+    inbound.sort(byEnds);
+    outbound.sort(byEnds);
+    const reps = [...members];
+    return {
+        ...blockSet(index, reps.filter((a) => !isOutputAddress(a)), reps.filter(isOutputAddress)),
+        inbound,
+        outbound,
+        counts: { inbound: countOf(inbound), outbound: countOf(outbound) },
+        bothWays: inbound.length > 0 && outbound.length > 0,
+    };
+}
+function countOf(edges) {
+    const outputs = edges.filter((e) => e.fromKind === "output").length;
+    return { resources: edges.length - outputs, outputs, crossStack: edges.filter((e) => e.crossStack).length };
+}
+function blockSet(index, reps, outputs) {
+    return {
+        resources: reps.flatMap((rep) => index.membersOf(rep)).sort(cmp),
+        outputs: [...outputs].sort(cmp),
+    };
+}
+function holdings(index, reps) {
+    const instances = weigh(index, reps);
+    if (instances !== "unknown")
+        return { instances };
+    return { instances, hiddenBy: reps.filter((a) => hidesContents(index.nodes.get(a))).sort(cmp) };
+}

package/dist/terraform/folds.d.ts

@@ -0,0 +1,26 @@
+/**
+ * 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 type { TfGraph } from "./types.js";
+export interface Folds {
+    /** Every address that folds into a parent present in the estate. */
+    folded: Set<string>;
+    /** Parent address → the addresses folded into it. */
+    childrenOf: Map<string, Set<string>>;
+}
+/**
+ * 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 declare function computeFolds(graph: TfGraph): Folds;
+//# sourceMappingURL=folds.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"folds.d.ts","sourceRoot":"","sources":["../../src/terraform/folds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAEvC,MAAM,WAAW,KAAK;IACpB,oEAAoE;IACpE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB,qDAAqD;IACrD,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACtC;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,CAelD"}