@variance-authority/core 0.1.1 → 0.3.0

package/dist/relate/merkle.js.map

@@ -1 +1 @@
-{"version":3,"file":"merkle.js","sourceRoot":"","sources":["../../src/relate/merkle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAe,MAAM,mBAAmB,CAAC;AAC7E,OAAO,EACL,UAAU,EACV,UAAU,EACV,KAAK,GAIN,MAAM,YAAY,CAAC;AA+BpB;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,KAAmB;IAC3C,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACrC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;IAErC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,6EAA6E;IAC7E,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,cAAc,GAAc,EAAE,CAAC;IAErC,+EAA+E;IAC/E,iEAAiE;IACjE,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAE,CAAC;YACjD,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;YACpC,MAAM,GAAG,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAE1D,IAAI,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,GAAG,IAAI,CAAC;YACrE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,IAAI,SAAS,GAAG,IAAI,MAAM,EAAE,CAAC,CAAC;YAEzD,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC;YAC7D,KAAK,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,CAAE,EAAE,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7D,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAE3C,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAEtC,OAAO,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAE,SAAS,WAAW,CAAC,SAAS,CAAC,KAAK,CAAE,CAAE,EAAE,CAAC,CAAC;gBACrF,IAAI,cAAc,CAAC,SAAS,CAAC,KAAK,CAAE,CAAC,KAAK,IAAI;oBAAE,KAAK,GAAG,IAAI,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CACd,aAAa,CAAC,gBAAgB,EAAE;YAC9B,YAAY,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnD,YAAY,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACtD,CAAC,CACH,CAAC;QACF,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAE,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC;QAC/E,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,SAAS,CAAC,IAAI,CAAE,CAAE,CAAC,CAAC;QACjD,IAAI,cAAc,CAAC,SAAS,CAAC,IAAI,CAAE,CAAC,KAAK,IAAI;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AACzC,CAAC;AAED,8EAA8E;AAC9E,MAAM,MAAM,GAAG,UAAU,CAAC;AAE1B,kEAAkE;AAClE,MAAM,OAAO,GAAG,YAAY,CAAC;AAa7B;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,MAAe,EAAE,KAAc;IAC5D,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACtF,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAEjF,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC;QAC7B,UAAU,EAAE,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC;QACvC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;KAC5B,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CAAC,IAAuB,EAAE,IAA0B;IAChE,MAAM,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC;IAE1B,OAAO,IAAI;SACR,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;SACvC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;SACtC,IAAI,CAAC,UAAU,CAAC,CAAC;AACtB,CAAC;AASD;;;;;;;;GAQG;AACH,SAAS,QAAQ,CAAC,SAAoB,EAAE,OAAmB;IACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;IACrC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC;IAEnD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,gFAAgF;IAChF,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QAEjC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACpB,OAAO,IAAI,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,CAAC;QAE9B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YAC9C,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YAE5C,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,EAAE,CAAC;gBAC3B,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAEvC,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;oBACtB,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;oBACpB,OAAO,IAAI,CAAC,CAAC;oBACb,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,CAAC;gBAChC,CAAC;qBAAM,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,IAAI,KAAK,CAAC,IAAI,CAAE,GAAG,GAAG,CAAC,IAAI,CAAE;wBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;gBAC1D,CAAC;gBACD,SAAS;YACX,CAAC;YAED,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,SAAS,CAAC,GAAG,EAAE,CAAC;YAEhB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,CAAE,GAAG,GAAG,CAAC,MAAM,CAAE;gBAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAE,CAAC;YAEhF,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAExC,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,SAAS,CAAC;gBACR,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;gBACjC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,IAAI,MAAM,KAAK,IAAI;oBAAE,MAAM;YAC7B,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,aAAa,GAAwB;IAChD,SAAS;IACT,WAAW;IACX,SAAS;IACT,MAAM;IACN,OAAO;IACP,aAAa;CACd,CAAC;AAEF,8DAA8D;AAC9D,SAAS,YAAY,CAAC,OAAuC;IAC3D,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAElD,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC","sourcesContent":["/**\n * The graph, hashed the way a build system hashes an action's inputs.\n *\n * Reachability answers *what could this diff have moved*. It needs a diff, which\n * means it needs `git`, a ref that exists, a checkout deep enough to contain it,\n * and the assumption that the ref is where this branch actually diverged. Every\n * one of those is a thing CI gets wrong, and each failure narrows a run.\n *\n * A Merkle digest asks a different question and needs none of them: **is this\n * subject's entire input closure byte-identical to the one that produced the\n * baseline?** One digest per node, over the node's own content and the digests of\n * everything it rests on — the same construction `bazel` uses to key an action,\n * and the same idea as this project's own content addressing, applied one level\n * out from the document to the source that produced it.\n *\n * What the difference buys:\n *\n * | situation | reachability | closure digest |\n * |---|---|---|\n * | a change, then a revert | both commits are in the diff, so it widens | identical digest, nothing runs |\n * | rebase, squash, branch switch | the merge base moves and the diff with it | unaffected — no ref is consulted |\n * | a shallow clone with no merge base | cannot answer; runs everything | unaffected |\n * | a dependency changed two hops away | reached, and observed | different digest, and observed |\n * | *why* a subject is being observed | a chain of files | a digest that differs |\n *\n * Neither replaces the other. The trail is the explanation, and the digest is the\n * proof; a run wants the digest to decide and the trail to justify.\n *\n * ## Cycles\n *\n * A dependency graph has them and a Merkle tree cannot. Strongly connected\n * components are condensed and hashed as a unit, so every file in a cycle carries\n * the same digest — which is exactly the truth about a cycle: no member of one can\n * be called unchanged while another moved.\n *\n * ## The digest that must never lie\n *\n * A digest says *these inputs are the same*. A file whose content was not supplied,\n * or whose own imports could not be read, breaks that claim — its closure may have\n * moved with no digest in this structure changing. Those nodes are marked\n * **volatile**, the mark propagates to everything that rests on them, and a\n * volatile node is treated as changed however its digest compares. A cache that\n * cannot be trusted must not be silently trusted.\n */\n\nimport { digestCombine, digestString, type Digest } from '../format/hash.js';\nimport {\n  EDGE_KINDS,\n  NODE_KINDS,\n  keyOf,\n  type EdgeKind,\n  type NodeId,\n  type Relations,\n} from './graph.js';\n\nexport interface ClosureInput {\n  readonly relations: Relations;\n\n  /**\n   * Content digest per file, keyed by the file's path.\n   *\n   * A file with no entry is volatile: nothing here can tell whether it moved.\n   * Component nodes take no entry — a component has no bytes of its own, and its\n   * content is the file that declares it, which it already depends on.\n   */\n  readonly content: ReadonlyMap<string, Digest>;\n\n  /** Restrict the closure to these edge kinds. Every kind by default. */\n  readonly through?: Iterable<EdgeKind>;\n}\n\nexport interface Closure {\n  /** `keyOf(kind, name)` → the digest of everything that node rests on. */\n  readonly digests: ReadonlyMap<string, Digest>;\n\n  /**\n   * Nodes whose digest cannot prove sameness, and everything resting on them.\n   *\n   * Not an error. It is the honest half of the answer, and a caller that ignores\n   * it converts a missing input into a subject nobody observed.\n   */\n  readonly volatile: ReadonlySet<string>;\n}\n\n/**\n * Hash every node over its own content and its whole dependency closure.\n *\n * One pass of Tarjan's algorithm and one pass over the components it emits, which\n * is `O(n + m)` — the same cost as the traversal next door, for an answer that\n * survives a rebase.\n */\nexport function closureOf(input: ClosureInput): Closure {\n  const { relations, content } = input;\n  const allowed = allowedKinds(input.through);\n  const count = relations.names.length;\n\n  const { component, order } = condense(relations, allowed);\n  const digests = new Map<string, Digest>();\n  const unstable = new Set<string>();\n\n  // One digest per component, so every member of a cycle carries the same one.\n  const byComponent: Digest[] = [];\n  const shakyComponent: boolean[] = [];\n\n  // Tarjan emits a component only after everything it can reach, so a dependency\n  // digest is always already computed by the time it is read here.\n  for (const [id, members] of order.entries()) {\n    const terms: string[] = [];\n    const outward = new Set<string>();\n    let shaky = false;\n\n    for (const node of members) {\n      const kind = NODE_KINDS[relations.kinds[node]!]!;\n      const name = relations.names[node]!;\n      const own = kind === 'file' ? content.get(name) : SETTLED;\n\n      if (own === undefined || relations.unknown[node] === 1) shaky = true;\n      terms.push(`${kind}\\u0000${name}\\u0000${own ?? UNREAD}`);\n\n      const { offset, target, kind: edgeKind } = relations.depends;\n      for (let at = offset[node]!; at < offset[node + 1]!; at += 1) {\n        if (allowed[edgeKind[at]!] !== 1) continue;\n\n        const other = target[at]!;\n        if (component[other] === id) continue;\n\n        outward.add(`${EDGE_KINDS[edgeKind[at]!]!}\\u0000${byComponent[component[other]!]!}`);\n        if (shakyComponent[component[other]!] === true) shaky = true;\n      }\n    }\n\n    byComponent.push(\n      digestCombine('relate.closure', [\n        digestString([...terms].sort(byCodeUnit).join('\u0001')),\n        digestString([...outward].sort(byCodeUnit).join('\u0001')),\n      ]),\n    );\n    shakyComponent.push(shaky);\n  }\n\n  for (let node = 0; node < count; node += 1) {\n    const key = keyOf(NODE_KINDS[relations.kinds[node]!]!, relations.names[node]!);\n    digests.set(key, byComponent[component[node]!]!);\n    if (shakyComponent[component[node]!] === true) unstable.add(key);\n  }\n\n  return { digests, volatile: unstable };\n}\n\n/** The term a node with content contributes when the content is not known. */\nconst UNREAD = '(unread)';\n\n/** The term a node that has no content of its own contributes. */\nconst SETTLED = '(declared)';\n\nexport interface Drift {\n  /** Node keys whose closure is not provably the one it was. */\n  readonly changed: readonly string[];\n  /** The file paths among them. */\n  readonly files: readonly string[];\n  /** The component names among them. */\n  readonly components: readonly string[];\n  /** Node keys the earlier closure held and this one does not. */\n  readonly gone: readonly string[];\n}\n\n/**\n * What moved between two closures, without consulting a repository.\n *\n * Three ways a node lands in `changed`, and only the first is a difference: its\n * digest differs, it is **new**, or it is **volatile** — the last because a node\n * whose inputs were not fully read has a digest that can match by accident, and a\n * selector that believed it would skip a subject on the strength of a hash over\n * bytes nobody hashed.\n */\nexport function driftedBetween(before: Closure, after: Closure): Drift {\n  const changed: string[] = [];\n\n  for (const [key, digest] of after.digests) {\n    const was = before.digests.get(key);\n    if (was === digest && !after.volatile.has(key) && !before.volatile.has(key)) continue;\n    changed.push(key);\n  }\n\n  const gone = [...before.digests.keys()].filter((key) => !after.digests.has(key));\n\n  return {\n    changed: changed.sort(byCodeUnit),\n    files: named(changed, 'file'),\n    components: named(changed, 'component'),\n    gone: gone.sort(byCodeUnit),\n  };\n}\n\nfunction named(keys: readonly string[], kind: 'file' | 'component'): readonly string[] {\n  const prefix = `${kind}:`;\n\n  return keys\n    .filter((key) => key.startsWith(prefix))\n    .map((key) => key.slice(prefix.length))\n    .sort(byCodeUnit);\n}\n\ninterface Condensation {\n  /** Component index per node. */\n  readonly component: Int32Array;\n  /** Components in emission order — every one after everything it reaches. */\n  readonly order: readonly (readonly NodeId[])[];\n}\n\n/**\n * Tarjan's strongly connected components, iteratively.\n *\n * Iterative because the recursion depth is the longest dependency chain in the\n * repository, and a deep monorepo would overflow a call stack on a structure whose\n * whole point is to be cheap. The emission order is the useful half: a component\n * appears only once everything it can reach has, which is the order a Merkle fold\n * needs and costs nothing extra to get.\n */\nfunction condense(relations: Relations, allowed: Uint8Array): Condensation {\n  const count = relations.names.length;\n  const { offset, target, kind } = relations.depends;\n\n  const index = new Int32Array(count).fill(-1);\n  const low = new Int32Array(count);\n  const onStack = new Uint8Array(count);\n  const component = new Int32Array(count).fill(-1);\n\n  const pending: NodeId[] = [];\n  const order: NodeId[][] = [];\n\n  // Frames as two parallel arrays: the node, and how far through its edges it is.\n  const frameNode: number[] = [];\n  const frameEdge: number[] = [];\n  let counter = 0;\n\n  for (let root = 0; root < count; root += 1) {\n    if (index[root] !== -1) continue;\n\n    index[root] = counter;\n    low[root] = counter;\n    counter += 1;\n    pending.push(root);\n    onStack[root] = 1;\n    frameNode.push(root);\n    frameEdge.push(offset[root]!);\n\n    while (frameNode.length > 0) {\n      const node = frameNode[frameNode.length - 1]!;\n      const at = frameEdge[frameEdge.length - 1]!;\n\n      if (at < offset[node + 1]!) {\n        frameEdge[frameEdge.length - 1] = at + 1;\n        if (allowed[kind[at]!] !== 1) continue;\n\n        const next = target[at]!;\n        if (index[next] === -1) {\n          index[next] = counter;\n          low[next] = counter;\n          counter += 1;\n          pending.push(next);\n          onStack[next] = 1;\n          frameNode.push(next);\n          frameEdge.push(offset[next]!);\n        } else if (onStack[next] === 1) {\n          if (index[next]! < low[node]!) low[node] = index[next]!;\n        }\n        continue;\n      }\n\n      frameNode.pop();\n      frameEdge.pop();\n\n      const parent = frameNode[frameNode.length - 1];\n      if (parent !== undefined && low[node]! < low[parent]!) low[parent] = low[node]!;\n\n      if (low[node] !== index[node]) continue;\n\n      const members: NodeId[] = [];\n      for (;;) {\n        const member = pending.pop()!;\n        onStack[member] = 0;\n        component[member] = order.length;\n        members.push(member);\n        if (member === node) break;\n      }\n      order.push(members.sort((a, b) => a - b));\n    }\n  }\n\n  return { component, order };\n}\n\n/**\n * The edge kinds a closure walks when the caller does not say.\n *\n * Listed rather than derived from `EDGE_KINDS`, and the difference is the whole\n * point. A digest is a claim about *which inputs* were folded, so widening the\n * fold silently changes every digest that exists — one added edge kind, and the\n * next run finds nothing it can prove unchanged and re-observes the entire suite\n * while reporting a successful narrowing. Adding a kind here is a decision with a\n * cost, and it should read like one.\n */\nexport const CLOSURE_EDGES: readonly EdgeKind[] = [\n  'imports',\n  'reexports',\n  'dynamic',\n  'type',\n  'asset',\n  'declared-in',\n];\n\n/** Edge kinds as a lookup, so the inner loop tests a byte. */\nfunction allowedKinds(through: Iterable<EdgeKind> | undefined): Uint8Array {\n  const allowed = new Uint8Array(EDGE_KINDS.length);\n\n  for (const kind of through ?? CLOSURE_EDGES) {\n    const at = EDGE_KINDS.indexOf(kind);\n    if (at !== -1) allowed[at] = 1;\n  }\n\n  return allowed;\n}\n\nfunction byCodeUnit(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n"]}
+{"version":3,"file":"merkle.js","sourceRoot":"","sources":["../../src/relate/merkle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAe,MAAM,mBAAmB,CAAC;AAC7E,OAAO,EACL,UAAU,EACV,UAAU,EACV,KAAK,GAIN,MAAM,YAAY,CAAC;AA+BpB;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,KAAmB;IAC3C,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACrC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;IAErC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,6EAA6E;IAC7E,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,cAAc,GAAc,EAAE,CAAC;IAErC,+EAA+E;IAC/E,iEAAiE;IACjE,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAE,CAAC;YACjD,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;YACpC,MAAM,GAAG,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAE1D,IAAI,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,GAAG,IAAI,CAAC;YACrE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,IAAI,SAAS,GAAG,IAAI,MAAM,EAAE,CAAC,CAAC;YAEzD,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC;YAC7D,KAAK,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,CAAE,EAAE,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7D,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAE3C,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAEtC,OAAO,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAE,SAAS,WAAW,CAAC,SAAS,CAAC,KAAK,CAAE,CAAE,EAAE,CAAC,CAAC;gBACrF,IAAI,cAAc,CAAC,SAAS,CAAC,KAAK,CAAE,CAAC,KAAK,IAAI;oBAAE,KAAK,GAAG,IAAI,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CACd,aAAa,CAAC,gBAAgB,EAAE;YAC9B,YAAY,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnD,YAAY,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACtD,CAAC,CACH,CAAC;QACF,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAE,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC;QAC/E,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,SAAS,CAAC,IAAI,CAAE,CAAE,CAAC,CAAC;QACjD,IAAI,cAAc,CAAC,SAAS,CAAC,IAAI,CAAE,CAAC,KAAK,IAAI;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AACzC,CAAC;AAED,8EAA8E;AAC9E,MAAM,MAAM,GAAG,UAAU,CAAC;AAE1B,kEAAkE;AAClE,MAAM,OAAO,GAAG,YAAY,CAAC;AAa7B;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,MAAe,EAAE,KAAc;IAC5D,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACtF,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAEjF,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC;QAC7B,UAAU,EAAE,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC;QACvC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;KAC5B,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CAAC,IAAuB,EAAE,IAA0B;IAChE,MAAM,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC;IAE1B,OAAO,IAAI;SACR,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;SACvC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;SACtC,IAAI,CAAC,UAAU,CAAC,CAAC;AACtB,CAAC;AASD;;;;;;;;GAQG;AACH,SAAS,QAAQ,CAAC,SAAoB,EAAE,OAAmB;IACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;IACrC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC;IAEnD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,gFAAgF;IAChF,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QAEjC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACpB,OAAO,IAAI,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,CAAC;QAE9B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YAC9C,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YAE5C,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,EAAE,CAAC;gBAC3B,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAEvC,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;oBACtB,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;oBACpB,OAAO,IAAI,CAAC,CAAC;oBACb,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,CAAC;gBAChC,CAAC;qBAAM,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,IAAI,KAAK,CAAC,IAAI,CAAE,GAAG,GAAG,CAAC,IAAI,CAAE;wBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;gBAC1D,CAAC;gBACD,SAAS;YACX,CAAC;YAED,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,SAAS,CAAC,GAAG,EAAE,CAAC;YAEhB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,CAAE,GAAG,GAAG,CAAC,MAAM,CAAE;gBAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAE,CAAC;YAEhF,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAExC,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,SAAS,CAAC;gBACR,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;gBACjC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,IAAI,MAAM,KAAK,IAAI;oBAAE,MAAM;YAC7B,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAwB;IAChD,SAAS;IACT,WAAW;IACX,SAAS;IACT,OAAO;IACP,aAAa;CACd,CAAC;AAEF,8DAA8D;AAC9D,SAAS,YAAY,CAAC,OAAuC;IAC3D,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAElD,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC","sourcesContent":["/**\n * The graph, hashed the way a build system hashes an action's inputs.\n *\n * Reachability answers *what could this diff have moved*. It needs a diff, which\n * means it needs `git`, a ref that exists, a checkout deep enough to contain it,\n * and the assumption that the ref is where this branch actually diverged. Every\n * one of those is a thing CI gets wrong, and each failure narrows a run.\n *\n * A Merkle digest asks a different question and needs none of them: **is this\n * subject's entire input closure byte-identical to the one that produced the\n * baseline?** One digest per node, over the node's own content and the digests of\n * everything it rests on — the same construction `bazel` uses to key an action,\n * and the same idea as this project's own content addressing, applied one level\n * out from the document to the source that produced it.\n *\n * What the difference buys:\n *\n * | situation | reachability | closure digest |\n * |---|---|---|\n * | a change, then a revert | both commits are in the diff, so it widens | identical digest, nothing runs |\n * | rebase, squash, branch switch | the merge base moves and the diff with it | unaffected — no ref is consulted |\n * | a shallow clone with no merge base | cannot answer; runs everything | unaffected |\n * | a dependency changed two hops away | reached, and observed | different digest, and observed |\n * | *why* a subject is being observed | a chain of files | a digest that differs |\n *\n * Neither replaces the other. The trail is the explanation, and the digest is the\n * proof; a run wants the digest to decide and the trail to justify.\n *\n * ## Cycles\n *\n * A dependency graph has them and a Merkle tree cannot. Strongly connected\n * components are condensed and hashed as a unit, so every file in a cycle carries\n * the same digest — which is exactly the truth about a cycle: no member of one can\n * be called unchanged while another moved.\n *\n * ## The digest that must never lie\n *\n * A digest says *these inputs are the same*. A file whose content was not supplied,\n * or whose own imports could not be read, breaks that claim — its closure may have\n * moved with no digest in this structure changing. Those nodes are marked\n * **volatile**, the mark propagates to everything that rests on them, and a\n * volatile node is treated as changed however its digest compares. A cache that\n * cannot be trusted must not be silently trusted.\n */\n\nimport { digestCombine, digestString, type Digest } from '../format/hash.js';\nimport {\n  EDGE_KINDS,\n  NODE_KINDS,\n  keyOf,\n  type EdgeKind,\n  type NodeId,\n  type Relations,\n} from './graph.js';\n\nexport interface ClosureInput {\n  readonly relations: Relations;\n\n  /**\n   * Content digest per file, keyed by the file's path.\n   *\n   * A file with no entry is volatile: nothing here can tell whether it moved.\n   * Component nodes take no entry — a component has no bytes of its own, and its\n   * content is the file that declares it, which it already depends on.\n   */\n  readonly content: ReadonlyMap<string, Digest>;\n\n  /** Restrict the closure to these edge kinds. Every kind by default. */\n  readonly through?: Iterable<EdgeKind>;\n}\n\nexport interface Closure {\n  /** `keyOf(kind, name)` → the digest of everything that node rests on. */\n  readonly digests: ReadonlyMap<string, Digest>;\n\n  /**\n   * Nodes whose digest cannot prove sameness, and everything resting on them.\n   *\n   * Not an error. It is the honest half of the answer, and a caller that ignores\n   * it converts a missing input into a subject nobody observed.\n   */\n  readonly volatile: ReadonlySet<string>;\n}\n\n/**\n * Hash every node over its own content and its whole dependency closure.\n *\n * One pass of Tarjan's algorithm and one pass over the components it emits, which\n * is `O(n + m)` — the same cost as the traversal next door, for an answer that\n * survives a rebase.\n */\nexport function closureOf(input: ClosureInput): Closure {\n  const { relations, content } = input;\n  const allowed = allowedKinds(input.through);\n  const count = relations.names.length;\n\n  const { component, order } = condense(relations, allowed);\n  const digests = new Map<string, Digest>();\n  const unstable = new Set<string>();\n\n  // One digest per component, so every member of a cycle carries the same one.\n  const byComponent: Digest[] = [];\n  const shakyComponent: boolean[] = [];\n\n  // Tarjan emits a component only after everything it can reach, so a dependency\n  // digest is always already computed by the time it is read here.\n  for (const [id, members] of order.entries()) {\n    const terms: string[] = [];\n    const outward = new Set<string>();\n    let shaky = false;\n\n    for (const node of members) {\n      const kind = NODE_KINDS[relations.kinds[node]!]!;\n      const name = relations.names[node]!;\n      const own = kind === 'file' ? content.get(name) : SETTLED;\n\n      if (own === undefined || relations.unknown[node] === 1) shaky = true;\n      terms.push(`${kind}\\u0000${name}\\u0000${own ?? UNREAD}`);\n\n      const { offset, target, kind: edgeKind } = relations.depends;\n      for (let at = offset[node]!; at < offset[node + 1]!; at += 1) {\n        if (allowed[edgeKind[at]!] !== 1) continue;\n\n        const other = target[at]!;\n        if (component[other] === id) continue;\n\n        outward.add(`${EDGE_KINDS[edgeKind[at]!]!}\\u0000${byComponent[component[other]!]!}`);\n        if (shakyComponent[component[other]!] === true) shaky = true;\n      }\n    }\n\n    byComponent.push(\n      digestCombine('relate.closure', [\n        digestString([...terms].sort(byCodeUnit).join('\u0001')),\n        digestString([...outward].sort(byCodeUnit).join('\u0001')),\n      ]),\n    );\n    shakyComponent.push(shaky);\n  }\n\n  for (let node = 0; node < count; node += 1) {\n    const key = keyOf(NODE_KINDS[relations.kinds[node]!]!, relations.names[node]!);\n    digests.set(key, byComponent[component[node]!]!);\n    if (shakyComponent[component[node]!] === true) unstable.add(key);\n  }\n\n  return { digests, volatile: unstable };\n}\n\n/** The term a node with content contributes when the content is not known. */\nconst UNREAD = '(unread)';\n\n/** The term a node that has no content of its own contributes. */\nconst SETTLED = '(declared)';\n\nexport interface Drift {\n  /** Node keys whose closure is not provably the one it was. */\n  readonly changed: readonly string[];\n  /** The file paths among them. */\n  readonly files: readonly string[];\n  /** The component names among them. */\n  readonly components: readonly string[];\n  /** Node keys the earlier closure held and this one does not. */\n  readonly gone: readonly string[];\n}\n\n/**\n * What moved between two closures, without consulting a repository.\n *\n * Three ways a node lands in `changed`, and only the first is a difference: its\n * digest differs, it is **new**, or it is **volatile** — the last because a node\n * whose inputs were not fully read has a digest that can match by accident, and a\n * selector that believed it would skip a subject on the strength of a hash over\n * bytes nobody hashed.\n */\nexport function driftedBetween(before: Closure, after: Closure): Drift {\n  const changed: string[] = [];\n\n  for (const [key, digest] of after.digests) {\n    const was = before.digests.get(key);\n    if (was === digest && !after.volatile.has(key) && !before.volatile.has(key)) continue;\n    changed.push(key);\n  }\n\n  const gone = [...before.digests.keys()].filter((key) => !after.digests.has(key));\n\n  return {\n    changed: changed.sort(byCodeUnit),\n    files: named(changed, 'file'),\n    components: named(changed, 'component'),\n    gone: gone.sort(byCodeUnit),\n  };\n}\n\nfunction named(keys: readonly string[], kind: 'file' | 'component'): readonly string[] {\n  const prefix = `${kind}:`;\n\n  return keys\n    .filter((key) => key.startsWith(prefix))\n    .map((key) => key.slice(prefix.length))\n    .sort(byCodeUnit);\n}\n\ninterface Condensation {\n  /** Component index per node. */\n  readonly component: Int32Array;\n  /** Components in emission order — every one after everything it reaches. */\n  readonly order: readonly (readonly NodeId[])[];\n}\n\n/**\n * Tarjan's strongly connected components, iteratively.\n *\n * Iterative because the recursion depth is the longest dependency chain in the\n * repository, and a deep monorepo would overflow a call stack on a structure whose\n * whole point is to be cheap. The emission order is the useful half: a component\n * appears only once everything it can reach has, which is the order a Merkle fold\n * needs and costs nothing extra to get.\n */\nfunction condense(relations: Relations, allowed: Uint8Array): Condensation {\n  const count = relations.names.length;\n  const { offset, target, kind } = relations.depends;\n\n  const index = new Int32Array(count).fill(-1);\n  const low = new Int32Array(count);\n  const onStack = new Uint8Array(count);\n  const component = new Int32Array(count).fill(-1);\n\n  const pending: NodeId[] = [];\n  const order: NodeId[][] = [];\n\n  // Frames as two parallel arrays: the node, and how far through its edges it is.\n  const frameNode: number[] = [];\n  const frameEdge: number[] = [];\n  let counter = 0;\n\n  for (let root = 0; root < count; root += 1) {\n    if (index[root] !== -1) continue;\n\n    index[root] = counter;\n    low[root] = counter;\n    counter += 1;\n    pending.push(root);\n    onStack[root] = 1;\n    frameNode.push(root);\n    frameEdge.push(offset[root]!);\n\n    while (frameNode.length > 0) {\n      const node = frameNode[frameNode.length - 1]!;\n      const at = frameEdge[frameEdge.length - 1]!;\n\n      if (at < offset[node + 1]!) {\n        frameEdge[frameEdge.length - 1] = at + 1;\n        if (allowed[kind[at]!] !== 1) continue;\n\n        const next = target[at]!;\n        if (index[next] === -1) {\n          index[next] = counter;\n          low[next] = counter;\n          counter += 1;\n          pending.push(next);\n          onStack[next] = 1;\n          frameNode.push(next);\n          frameEdge.push(offset[next]!);\n        } else if (onStack[next] === 1) {\n          if (index[next]! < low[node]!) low[node] = index[next]!;\n        }\n        continue;\n      }\n\n      frameNode.pop();\n      frameEdge.pop();\n\n      const parent = frameNode[frameNode.length - 1];\n      if (parent !== undefined && low[node]! < low[parent]!) low[parent] = low[node]!;\n\n      if (low[node] !== index[node]) continue;\n\n      const members: NodeId[] = [];\n      for (;;) {\n        const member = pending.pop()!;\n        onStack[member] = 0;\n        component[member] = order.length;\n        members.push(member);\n        if (member === node) break;\n      }\n      order.push(members.sort((a, b) => a - b));\n    }\n  }\n\n  return { component, order };\n}\n\n/**\n * The edge kinds a closure walks when the caller does not say.\n *\n * Listed rather than derived from `EDGE_KINDS`, and the difference is the whole\n * point. A digest is a claim about *which inputs* were folded, so changing the\n * fold silently changes every digest that exists — one edge kind added or\n * removed, and the next run finds nothing it can prove unchanged and re-observes\n * the entire suite while reporting a successful narrowing. Changing this list is\n * a decision with a cost, and it should read like one.\n *\n * `type` is not in it: a type-only import is erased before a render, so a change\n * behind one is not an input the render folded.\n *\n * `depends-on` is not in it either, for the opposite reason. It runs between two\n * packages, and a package node is a name rather than a content digest — an\n * install that moved is a fact the diff carries, never one a hash of names could\n * reveal. Folding it would add a term that cannot change and a walk that cannot\n * answer.\n */\nexport const CLOSURE_EDGES: readonly EdgeKind[] = [\n  'imports',\n  'reexports',\n  'dynamic',\n  'asset',\n  'declared-in',\n];\n\n/** Edge kinds as a lookup, so the inner loop tests a byte. */\nfunction allowedKinds(through: Iterable<EdgeKind> | undefined): Uint8Array {\n  const allowed = new Uint8Array(EDGE_KINDS.length);\n\n  for (const kind of through ?? CLOSURE_EDGES) {\n    const at = EDGE_KINDS.indexOf(kind);\n    if (at !== -1) allowed[at] = 1;\n  }\n\n  return allowed;\n}\n\nfunction byCodeUnit(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n"]}

package/dist/relate/reach.d.ts

@@ -28,6 +28,11 @@
  * cycle terminates the same way any revisit does.
  */
 import { type EdgeKind, type NodeId, type Relations } from './graph.js';
+/**
+ * What one walk from a set of seeds reached: a mark over every node, the node
+ * each one was reached through, and the reached ids in the order they were
+ * found. `trailOf` reads the chain from any reached node back to its seed.
+ */
 export interface Reach {
     /** `1` where the node was reached, including the seeds themselves. */
     readonly mask: Uint8Array;
@@ -41,14 +46,23 @@ export interface Reach {
 }
 export interface ReachOptions {
     /**
-     * Edge kinds to walk. Every kind, when absent.
+     * Edge kinds to walk. `RUNTIME_EDGES` when absent: every kind but `type`.
      *
-     * The default is deliberately the widest one. Narrowing here is how a caller
-     * says *a type-only import cannot have moved a pixel*, which is true and is
-     * still not the default, because the cost of being wrong about it is a green
-     * run over a surface nobody looked at.
+     * A type-only import is erased before anything runs, so a change behind it
+     * moves no test and no pixel, and walking it selects work nothing can fail.
+     * A caller asking a question about source rather than about a runtime passes
+     * `EDGE_KINDS`, or any narrower list, and gets exactly those.
      */
     readonly through?: Iterable<EdgeKind>;
+    /**
+     * Nodes the walk never enters, seeds included.
+     *
+     * A module a test file mocks is replaced for that file's whole run, so a
+     * question asked from the file's point of view is asked of a graph with the
+     * module taken out — not one edge, the node. Marking it visited before the
+     * walk starts is exactly that removal, at no cost in the inner loop.
+     */
+    readonly avoid?: Iterable<NodeId>;
 }
 /** What depends on these nodes, transitively. Against the arrows. */
 export declare function dependentsOf(relations: Relations, seeds: Iterable<NodeId>, options?: ReachOptions): Reach;

package/dist/relate/reach.js

@@ -27,7 +27,7 @@
  * cycle as an error: the visited mask means every node is expanded once, so a
  * cycle terminates the same way any revisit does.
  */
-import { EDGE_KINDS } from './graph.js';
+import { EDGE_KINDS, RUNTIME_EDGES } from './graph.js';
 /** What depends on these nodes, transitively. Against the arrows. */
 export function dependentsOf(relations, seeds, options = {}) {
     return search(relations.dependents, relations.names.length, seeds, options);
@@ -66,8 +66,12 @@ function search(adjacency, nodes, seeds, options) {
     const mask = new Uint8Array(nodes);
     const via = new Int32Array(nodes).fill(-1);
     const queue = [];
+    const avoided = new Uint8Array(nodes);
+    for (const id of options.avoid ?? [])
+        if (id >= 0 && id < nodes)
+            avoided[id] = 1;
     for (const seed of seeds) {
-        if (seed < 0 || seed >= nodes || mask[seed] === 1)
+        if (seed < 0 || seed >= nodes || mask[seed] === 1 || avoided[seed] === 1)
             continue;
         mask[seed] = 1;
         queue.push(seed);
@@ -77,10 +81,10 @@ function search(adjacency, nodes, seeds, options) {
         const node = queue[head];
         const end = adjacency.offset[node + 1];
         for (let at = adjacency.offset[node]; at < end; at += 1) {
-            if (allowed !== undefined && allowed[adjacency.kind[at]] !== 1)
+            if (allowed[adjacency.kind[at]] !== 1)
                 continue;
             const next = adjacency.target[at];
-            if (mask[next] === 1)
+            if (mask[next] === 1 || avoided[next] === 1)
                 continue;
             mask[next] = 1;
             via[next] = node;
@@ -96,12 +100,10 @@ function search(adjacency, nodes, seeds, options) {
             reached.push(id);
     return { mask, via, reached };
 }
-/** A kind filter as a byte lookup, or `undefined` when every kind is walked. */
+/** A kind filter as a byte lookup. */
 function allowedKinds(through) {
-    if (through === undefined)
-        return undefined;
     const allowed = new Uint8Array(EDGE_KINDS.length);
-    for (const kind of through) {
+    for (const kind of through ?? RUNTIME_EDGES) {
         const at = EDGE_KINDS.indexOf(kind);
         if (at !== -1)
             allowed[at] = 1;

package/dist/relate/reach.js.map

@@ -1 +1 @@
-{"version":3,"file":"reach.js","sourceRoot":"","sources":["../../src/relate/reach.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,UAAU,EAA8D,MAAM,YAAY,CAAC;AA0BpG,qEAAqE;AACrE,MAAM,UAAU,YAAY,CAC1B,SAAoB,EACpB,KAAuB,EACvB,OAAO,GAAiB,EAAE;IAE1B,OAAO,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC9E,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,cAAc,CAC5B,SAAoB,EACpB,KAAuB,EACvB,OAAO,GAAiB,EAAE;IAE1B,OAAO,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAY,EAAE,EAAU;IAC9C,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,EAAE,GAAW,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE;QAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,MAAM,CACb,SAAoB,EACpB,KAAa,EACb,KAAuB,EACvB,OAAqB;IAErB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAE9C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,CAAC;QAExC,KAAK,IAAI,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;gBAAE,SAAS;YAE1E,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAE/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,sCAAsC;IACtC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,IAAI,CAAC;QAAE,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE3E,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED,gFAAgF;AAChF,SAAS,YAAY,CAAC,OAAuC;IAC3D,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE5C,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["/**\n * Walking the graph, and being able to say why the walk arrived.\n *\n * Two questions, one traversal each way:\n *\n * - **`dependentsOf`** — against the arrows. *What could this change have moved?*\n *   This is the one selection asks, and it is asked once per run over the whole\n *   seed set rather than once per seed, because a breadth-first search from many\n *   sources costs the same as one from a single source.\n * - **`dependenciesOf`** — along them. *What does this rest on?* The cache-key\n *   question, and the one a reviewer asks about a file they have not read.\n *\n * ## The trail is not an extra\n *\n * Both return the path each node was reached by, and that is load-bearing rather\n * than a convenience. A selector that says *observe 41 of 300* is asking to be\n * trusted; a selector that says *`Button` is affected because\n * `src/tokens.css` → `src/button.css` → `src/Button.tsx`* has shown its work, and\n * the operator can see the edge that is wrong when one is.\n *\n * Recording it costs one `Int32Array` and nothing in the inner loop — the parent\n * is written exactly where the visited mark already is.\n *\n * ## Cycles\n *\n * Import graphs have them, routinely and legitimately. Nothing here treats a\n * cycle as an error: the visited mask means every node is expanded once, so a\n * cycle terminates the same way any revisit does.\n */\n\nimport { EDGE_KINDS, type Adjacency, type EdgeKind, type NodeId, type Relations } from './graph.js';\n\nexport interface Reach {\n  /** `1` where the node was reached, including the seeds themselves. */\n  readonly mask: Uint8Array;\n  /**\n   * The node that reached each one, or `-1` for a seed and for anything\n   * unreached. Following it lands on a seed, which is what `trailOf` walks.\n   */\n  readonly via: Int32Array;\n  /** Reached nodes in id order, which is kind-major and then code unit. */\n  readonly reached: readonly NodeId[];\n}\n\nexport interface ReachOptions {\n  /**\n   * Edge kinds to walk. Every kind, when absent.\n   *\n   * The default is deliberately the widest one. Narrowing here is how a caller\n   * says *a type-only import cannot have moved a pixel*, which is true and is\n   * still not the default, because the cost of being wrong about it is a green\n   * run over a surface nobody looked at.\n   */\n  readonly through?: Iterable<EdgeKind>;\n}\n\n/** What depends on these nodes, transitively. Against the arrows. */\nexport function dependentsOf(\n  relations: Relations,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions = {},\n): Reach {\n  return search(relations.dependents, relations.names.length, seeds, options);\n}\n\n/** What these nodes depend on, transitively. Along the arrows. */\nexport function dependenciesOf(\n  relations: Relations,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions = {},\n): Reach {\n  return search(relations.depends, relations.names.length, seeds, options);\n}\n\n/**\n * The chain from a reached node back to the seed that reached it.\n *\n * In arrival order — seed first, `id` last — because that is the direction the\n * sentence reads: *the token file, then the stylesheet, then the component*.\n * Empty when the node was never reached.\n */\nexport function trailOf(reach: Reach, id: NodeId): readonly NodeId[] {\n  if (reach.mask[id] !== 1) return [];\n\n  const trail: NodeId[] = [];\n  for (let at: number = id; at !== -1; at = reach.via[at]!) trail.push(at);\n  return trail.reverse();\n}\n\n/**\n * Breadth-first over one direction, from every seed at once.\n *\n * A plain array as the queue with a moving head rather than `shift()`, which is\n * `O(n)` per call in every engine that does not special-case it and turns a\n * linear traversal quadratic on the graphs this exists for.\n *\n * Breadth-first rather than depth-first for the trail's sake: the parent\n * recorded is then the one on a *shortest* path, so the explanation a run prints\n * is the shortest true one rather than whichever the stack happened to unwind.\n */\nfunction search(\n  adjacency: Adjacency,\n  nodes: number,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions,\n): Reach {\n  const mask = new Uint8Array(nodes);\n  const via = new Int32Array(nodes).fill(-1);\n  const queue: NodeId[] = [];\n\n  for (const seed of seeds) {\n    if (seed < 0 || seed >= nodes || mask[seed] === 1) continue;\n    mask[seed] = 1;\n    queue.push(seed);\n  }\n\n  const allowed = allowedKinds(options.through);\n\n  for (let head = 0; head < queue.length; head += 1) {\n    const node = queue[head]!;\n    const end = adjacency.offset[node + 1]!;\n\n    for (let at = adjacency.offset[node]!; at < end; at += 1) {\n      if (allowed !== undefined && allowed[adjacency.kind[at]!] !== 1) continue;\n\n      const next = adjacency.target[at]!;\n      if (mask[next] === 1) continue;\n\n      mask[next] = 1;\n      via[next] = node;\n      queue.push(next);\n    }\n  }\n\n  // `queue` is in visit order, which depends on seed order. The result is in id\n  // order instead, so a report built from it is byte-stable whatever order the\n  // caller listed its changed files in.\n  const reached: NodeId[] = [];\n  for (let id = 0; id < nodes; id += 1) if (mask[id] === 1) reached.push(id);\n\n  return { mask, via, reached };\n}\n\n/** A kind filter as a byte lookup, or `undefined` when every kind is walked. */\nfunction allowedKinds(through: Iterable<EdgeKind> | undefined): Uint8Array | undefined {\n  if (through === undefined) return undefined;\n\n  const allowed = new Uint8Array(EDGE_KINDS.length);\n  for (const kind of through) {\n    const at = EDGE_KINDS.indexOf(kind);\n    if (at !== -1) allowed[at] = 1;\n  }\n  return allowed;\n}\n"]}
+{"version":3,"file":"reach.js","sourceRoot":"","sources":["../../src/relate/reach.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,UAAU,EAAE,aAAa,EAA8D,MAAM,YAAY,CAAC;AAwCnH,qEAAqE;AACrE,MAAM,UAAU,YAAY,CAC1B,SAAoB,EACpB,KAAuB,EACvB,OAAO,GAAiB,EAAE;IAE1B,OAAO,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC9E,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,cAAc,CAC5B,SAAoB,EACpB,KAAuB,EACvB,OAAO,GAAiB,EAAE;IAE1B,OAAO,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAY,EAAE,EAAU;IAC9C,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,EAAE,GAAW,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE;QAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,MAAM,CACb,SAAoB,EACpB,KAAa,EACb,KAAuB,EACvB,OAAqB;IAErB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACtC,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,KAAK,IAAI,EAAE;QAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK;YAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAEjF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACnF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAE9C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAE,CAAC;QAExC,KAAK,IAAI,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEjD,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEtD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,sCAAsC;IACtC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,IAAI,CAAC;QAAE,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE3E,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED,sCAAsC;AACtC,SAAS,YAAY,CAAC,OAAuC;IAC3D,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["/**\n * Walking the graph, and being able to say why the walk arrived.\n *\n * Two questions, one traversal each way:\n *\n * - **`dependentsOf`** — against the arrows. *What could this change have moved?*\n *   This is the one selection asks, and it is asked once per run over the whole\n *   seed set rather than once per seed, because a breadth-first search from many\n *   sources costs the same as one from a single source.\n * - **`dependenciesOf`** — along them. *What does this rest on?* The cache-key\n *   question, and the one a reviewer asks about a file they have not read.\n *\n * ## The trail is not an extra\n *\n * Both return the path each node was reached by, and that is load-bearing rather\n * than a convenience. A selector that says *observe 41 of 300* is asking to be\n * trusted; a selector that says *`Button` is affected because\n * `src/tokens.css` → `src/button.css` → `src/Button.tsx`* has shown its work, and\n * the operator can see the edge that is wrong when one is.\n *\n * Recording it costs one `Int32Array` and nothing in the inner loop — the parent\n * is written exactly where the visited mark already is.\n *\n * ## Cycles\n *\n * Import graphs have them, routinely and legitimately. Nothing here treats a\n * cycle as an error: the visited mask means every node is expanded once, so a\n * cycle terminates the same way any revisit does.\n */\n\nimport { EDGE_KINDS, RUNTIME_EDGES, type Adjacency, type EdgeKind, type NodeId, type Relations } from './graph.js';\n\n/**\n * What one walk from a set of seeds reached: a mark over every node, the node\n * each one was reached through, and the reached ids in the order they were\n * found. `trailOf` reads the chain from any reached node back to its seed.\n */\nexport interface Reach {\n  /** `1` where the node was reached, including the seeds themselves. */\n  readonly mask: Uint8Array;\n  /**\n   * The node that reached each one, or `-1` for a seed and for anything\n   * unreached. Following it lands on a seed, which is what `trailOf` walks.\n   */\n  readonly via: Int32Array;\n  /** Reached nodes in id order, which is kind-major and then code unit. */\n  readonly reached: readonly NodeId[];\n}\n\nexport interface ReachOptions {\n  /**\n   * Edge kinds to walk. `RUNTIME_EDGES` when absent: every kind but `type`.\n   *\n   * A type-only import is erased before anything runs, so a change behind it\n   * moves no test and no pixel, and walking it selects work nothing can fail.\n   * A caller asking a question about source rather than about a runtime passes\n   * `EDGE_KINDS`, or any narrower list, and gets exactly those.\n   */\n  readonly through?: Iterable<EdgeKind>;\n  /**\n   * Nodes the walk never enters, seeds included.\n   *\n   * A module a test file mocks is replaced for that file's whole run, so a\n   * question asked from the file's point of view is asked of a graph with the\n   * module taken out — not one edge, the node. Marking it visited before the\n   * walk starts is exactly that removal, at no cost in the inner loop.\n   */\n  readonly avoid?: Iterable<NodeId>;\n}\n\n/** What depends on these nodes, transitively. Against the arrows. */\nexport function dependentsOf(\n  relations: Relations,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions = {},\n): Reach {\n  return search(relations.dependents, relations.names.length, seeds, options);\n}\n\n/** What these nodes depend on, transitively. Along the arrows. */\nexport function dependenciesOf(\n  relations: Relations,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions = {},\n): Reach {\n  return search(relations.depends, relations.names.length, seeds, options);\n}\n\n/**\n * The chain from a reached node back to the seed that reached it.\n *\n * In arrival order — seed first, `id` last — because that is the direction the\n * sentence reads: *the token file, then the stylesheet, then the component*.\n * Empty when the node was never reached.\n */\nexport function trailOf(reach: Reach, id: NodeId): readonly NodeId[] {\n  if (reach.mask[id] !== 1) return [];\n\n  const trail: NodeId[] = [];\n  for (let at: number = id; at !== -1; at = reach.via[at]!) trail.push(at);\n  return trail.reverse();\n}\n\n/**\n * Breadth-first over one direction, from every seed at once.\n *\n * A plain array as the queue with a moving head rather than `shift()`, which is\n * `O(n)` per call in every engine that does not special-case it and turns a\n * linear traversal quadratic on the graphs this exists for.\n *\n * Breadth-first rather than depth-first for the trail's sake: the parent\n * recorded is then the one on a *shortest* path, so the explanation a run prints\n * is the shortest true one rather than whichever the stack happened to unwind.\n */\nfunction search(\n  adjacency: Adjacency,\n  nodes: number,\n  seeds: Iterable<NodeId>,\n  options: ReachOptions,\n): Reach {\n  const mask = new Uint8Array(nodes);\n  const via = new Int32Array(nodes).fill(-1);\n  const queue: NodeId[] = [];\n\n  const avoided = new Uint8Array(nodes);\n  for (const id of options.avoid ?? []) if (id >= 0 && id < nodes) avoided[id] = 1;\n\n  for (const seed of seeds) {\n    if (seed < 0 || seed >= nodes || mask[seed] === 1 || avoided[seed] === 1) continue;\n    mask[seed] = 1;\n    queue.push(seed);\n  }\n\n  const allowed = allowedKinds(options.through);\n\n  for (let head = 0; head < queue.length; head += 1) {\n    const node = queue[head]!;\n    const end = adjacency.offset[node + 1]!;\n\n    for (let at = adjacency.offset[node]!; at < end; at += 1) {\n      if (allowed[adjacency.kind[at]!] !== 1) continue;\n\n      const next = adjacency.target[at]!;\n      if (mask[next] === 1 || avoided[next] === 1) continue;\n\n      mask[next] = 1;\n      via[next] = node;\n      queue.push(next);\n    }\n  }\n\n  // `queue` is in visit order, which depends on seed order. The result is in id\n  // order instead, so a report built from it is byte-stable whatever order the\n  // caller listed its changed files in.\n  const reached: NodeId[] = [];\n  for (let id = 0; id < nodes; id += 1) if (mask[id] === 1) reached.push(id);\n\n  return { mask, via, reached };\n}\n\n/** A kind filter as a byte lookup. */\nfunction allowedKinds(through: Iterable<EdgeKind> | undefined): Uint8Array {\n  const allowed = new Uint8Array(EDGE_KINDS.length);\n  for (const kind of through ?? RUNTIME_EDGES) {\n    const at = EDGE_KINDS.indexOf(kind);\n    if (at !== -1) allowed[at] = 1;\n  }\n  return allowed;\n}\n"]}

package/dist/relate/records.d.ts

@@ -19,12 +19,26 @@
  */
 import type { Digest } from '../format/hash.js';
 import { type EdgeKind, type Node, type Relations } from './graph.js';
-import { type Reach } from './reach.js';
+import { type Reach, type ReachOptions } from './reach.js';
 export interface FileEdge {
     /** Repository-relative, already resolved. A specifier is not an edge. */
     readonly to: string;
     readonly kind: EdgeKind;
 }
+/**
+ * A file's import of something the install provides.
+ *
+ * The name a specifier asked for, never a version and never a resolution:
+ * which copy a resolver handed this importer is unanswerable without
+ * reproducing that resolver, and a selector that guessed would skip on the
+ * guess. Names over-include, which is the safe direction.
+ */
+export interface PackageEdge {
+    /** The package name the specifier asked for — `@mui/material`, not a path. */
+    readonly to: string;
+    /** The import's own kind, so a `type` import of a package is erased like any other. */
+    readonly kind: EdgeKind;
+}
 export interface FileRecord {
     /** Repository-relative, so a graph is portable between machines and CI. */
     readonly file: string;
@@ -42,6 +56,21 @@ export interface FileRecord {
     readonly edges?: readonly FileEdge[];
     /** Component names this file declares, from `indexSource` or better. */
     readonly declares?: readonly string[];
+    /**
+     * Packages this file imports, by the name it imports them by.
+     *
+     * The far end of the line. Nothing resolves these to a path — under pnpm's
+     * store or Yarn PnP there may not be one, and under a custom resolver the path
+     * would be a lie about a different machine — so the name stands for the
+     * dependency, and what the install currently has under that name is a question
+     * for the lockfile ([`sense/lock`](../../../sense/src/lock/index.ts)).
+     *
+     * A file that imports `@mui/material` is moved by `@mui/material` moving; a
+     * file that does not, is not. That is the whole rule, and it is why this is
+     * read from the imports rather than from a manifest: a `package.json` says what
+     * a workspace may use, and the imports say what a file does use.
+     */
+    readonly packages?: readonly PackageEdge[];
     /**
      * Specifiers that were read but did not resolve.
      *
@@ -73,18 +102,51 @@ export interface FileRecord {
  * declares it, so one walk against the arrows from a changed file reaches every
  * importer and every component in the same pass.
  */
-export declare function relationsOfFiles(records: Iterable<FileRecord>): Relations;
+export declare function relationsOfFiles(records: Iterable<FileRecord>, options?: RelationsOptions): Relations;
+export interface RelationsOptions {
+    /** Per file, the files its run never reaches; see {@link Relations.shadows}. */
+    readonly shadows?: ReadonlyMap<string, readonly string[]>;
+    /**
+     * `[dependent, dependency]` pairs between packages, from a lockfile
+     * ([`packageRelations`](../../../sense/src/lock/lockfile.ts)).
+     *
+     * Optional, and a graph without them is not wrong, only shorter-sighted: it
+     * answers a change to a package some file imports directly, and says nothing
+     * about a change three levels down. Supplying them is what turns *`jsdom`
+     * moved* into *every test whose environment is built on it*.
+     */
+    readonly depends?: Iterable<readonly [string, string]>;
+}
 export interface Hole {
     /** The file whose outgoing edges could not be enumerated. */
     readonly file: string;
     /** Why, in the words of whoever read it. Absent when nobody said. */
     readonly because?: string;
 }
+/**
+ * What one backwards walk over the file graph found, and what widened it.
+ *
+ * Every field is part of one answer and none of them stands alone: `files` is
+ * the answer, `missing` and `opaque` are the two ways it is not the whole truth,
+ * and `reach` is what an explanation is read back out of. A caller that took
+ * `files` and dropped the rest would be a caller that cannot say whether the
+ * list is narrow because the diff was small or because the scan never ran.
+ */
 export interface Reached {
     /** Files the change could have moved, including the changed files themselves. */
     readonly files: readonly string[];
     /** Components declared in any of them. */
     readonly components: readonly string[];
+    /**
+     * Packages the change could have moved, including the changed packages
+     * themselves and everything the install resolved beneath them.
+     *
+     * Reported rather than used: the answer a caller acts on is in `files`, and
+     * this is the trail of package names that got there. Empty for a walk seeded
+     * only with files, because a package is downstream of every file that imports
+     * it and a walk against the arrows never descends.
+     */
+    readonly packages: readonly string[];
     /**
      * Changed paths the graph does not hold.
      *
@@ -104,9 +166,29 @@ export interface Reached {
      * computed require()`` is something to fix.
      */
     readonly opaque: readonly Hole[];
+    /**
+     * Files the graph reached and their own shadows cut: every trail from a
+     * changed file to each one crossed a module the file replaces for its run.
+     * Listed so the report can say a test was left out and by whose word.
+     */
+    readonly shadowed: readonly string[];
     /** The traversal, kept so a caller can ask how any one file was reached. */
     readonly reach: Reach;
 }
+export interface MovedOptions extends ReachOptions {
+    /**
+     * Per file, the files it takes out of its own graph: what a test mocks.
+     *
+     * A row is a fact about one file's run and nothing else's, so it is kept
+     * beside the records rather than in them — the records say what the text
+     * imports, this says what the run never reaches. A file with a row is moved
+     * only if some trail from a changed file arrives at it without crossing a
+     * file in its row, and what is reached only *through* it goes with it: the
+     * component a story declares, the test a setup file's mocks hold for. The
+     * graph's own table when absent ({@link Relations.shadows}).
+     */
+    readonly shadows?: ReadonlyMap<string, readonly string[]>;
+}
 /**
  * What a set of changed files could have moved.
  *
@@ -116,9 +198,18 @@ export interface Reached {
  * too, and the cost is a collection rather than a green run over an unwatched
  * surface.
  *
- * One breadth-first search, whatever the number of changed files.
+ * A seed is a path, or a node naming its own kind. The second form is how a
+ * changed *package* enters: a bare string keeps meaning a file, because that is
+ * what every caller written before packages existed meant by one, and a caller
+ * with a lockfile in hand passes `{ kind: 'package', name: 'jsdom' }` into the
+ * same walk. There is no second selector, and there is no order between the two
+ * — a commit that bumps a dependency and edits a file is one seed set and one
+ * traversal.
+ *
+ * One breadth-first search, whatever the number of changed files, over the
+ * runtime edges unless the caller names others.
  */
-export declare function movedBy(relations: Relations, changed: Iterable<string>): Reached;
+export declare function movedBy(relations: Relations, changed: Iterable<string | Node>, options?: MovedOptions): Reached;
 /**
  * How one file or component was reached, as the chain that reached it.
  *

package/dist/relate/records.js

@@ -18,9 +18,10 @@
  * absent is not empty, and here absent is not even absent, it is *unread*).
  */
 import { idOf, nodeAt, relationsOf, } from './graph.js';
-import { dependentsOf, trailOf } from './reach.js';
+import { dependenciesOf, dependentsOf, trailOf } from './reach.js';
 const file = (name) => ({ kind: 'file', name });
 const component = (name) => ({ kind: 'component', name });
+const pkg = (name) => ({ kind: 'package', name });
 /**
  * Fold file records into the graph.
  *
@@ -34,7 +35,7 @@ const component = (name) => ({ kind: 'component', name });
  * declares it, so one walk against the arrows from a changed file reaches every
  * importer and every component in the same pass.
  */
-export function relationsOfFiles(records) {
+export function relationsOfFiles(records, options = {}) {
     const relations = [];
     const isolated = [];
     const unknown = [];
@@ -44,6 +45,9 @@ export function relationsOfFiles(records) {
         for (const edge of record.edges ?? []) {
             relations.push({ from, to: file(edge.to), kind: edge.kind });
         }
+        for (const edge of record.packages ?? []) {
+            relations.push({ from, to: pkg(edge.to), kind: edge.kind });
+        }
         for (const name of record.declares ?? []) {
             relations.push({ from: component(name), to: from, kind: 'declared-in' });
         }
@@ -52,7 +56,14 @@ export function relationsOfFiles(records) {
         if (record.unknown !== undefined)
             unknown.push([from, record.unknown]);
     }
-    return relationsOf({ relations, isolated, unknown });
+    // The lock's own edges arrive here rather than as records, because they are
+    // not a file's reading of anything: one lockfile answers for the whole
+    // install, and folding them in beside the imports is what lets a bump three
+    // packages deep walk up to the file that imports the one at the top.
+    for (const [from, to] of options.depends ?? []) {
+        relations.push({ from: pkg(from), to: pkg(to), kind: 'depends-on' });
+    }
+    return relationsOf({ relations, isolated, unknown, ...(options.shadows === undefined ? {} : { shadows: options.shadows }) });
 }
 /**
  * What a set of changed files could have moved.
@@ -63,15 +74,25 @@ export function relationsOfFiles(records) {
  * too, and the cost is a collection rather than a green run over an unwatched
  * surface.
  *
- * One breadth-first search, whatever the number of changed files.
+ * A seed is a path, or a node naming its own kind. The second form is how a
+ * changed *package* enters: a bare string keeps meaning a file, because that is
+ * what every caller written before packages existed meant by one, and a caller
+ * with a lockfile in hand passes `{ kind: 'package', name: 'jsdom' }` into the
+ * same walk. There is no second selector, and there is no order between the two
+ * — a commit that bumps a dependency and edits a file is one seed set and one
+ * traversal.
+ *
+ * One breadth-first search, whatever the number of changed files, over the
+ * runtime edges unless the caller names others.
  */
-export function movedBy(relations, changed) {
+export function movedBy(relations, changed, options = {}) {
     const seeds = [];
     const missing = [];
-    for (const path of changed) {
-        const id = idOf(relations, 'file', path);
+    for (const entry of changed) {
+        const node = typeof entry === 'string' ? file(entry) : entry;
+        const id = idOf(relations, node.kind, node.name);
         if (id === undefined)
-            missing.push(path);
+            missing.push(node.name);
         else
             seeds.push(id);
     }
@@ -83,16 +104,75 @@ export function movedBy(relations, changed) {
         const because = relations.reasons.get(id);
         opaque.push({ file: relations.names[id], ...(because === undefined ? {} : { because }) });
     }
-    const reach = dependentsOf(relations, seeds);
-    const files = [];
-    const components = [];
+    const reach = unshadowed(relations, seeds, options);
+    const found = { file: [], component: [], package: [] };
     for (const id of reach.reached) {
         const node = nodeAt(relations, id);
         if (node === undefined)
             continue;
-        (node.kind === 'file' ? files : components).push(node.name);
+        found[node.kind].push(node.name);
+    }
+    return {
+        files: found.file,
+        components: found.component,
+        packages: found.package,
+        missing: missing.sort(byCodeUnit),
+        opaque,
+        shadowed: reach.shadowed,
+        reach,
+    };
+}
+/**
+ * The walk against the arrows with every file left out whose own shadows cut
+ * every trail to it, and with nothing reached through such a file.
+ *
+ * The walk records one parent per node, so it cannot say whether *another*
+ * trail avoided the shadows. Asking the other way can: a walk along the arrows
+ * from the file, entering none of its shadows, either finds a seed or does not.
+ * It runs only for a reached file whose row names a reached node — a mock of
+ * something the change never touched cuts nothing, and costs nothing. A file
+ * found shadowed is then avoided and the walk repeated, so a component or a
+ * file reached only through it is not reached either; the repeat ends when a
+ * walk finds no new shadowed file, and a row once decided is not asked again.
+ */
+function unshadowed(relations, seeds, options) {
+    const shadowed = [];
+    const avoid = new Set(options.avoid ?? []);
+    const shadows = options.shadows ?? relations.shadows;
+    let reach = dependentsOf(relations, seeds, options);
+    if (shadows.size === 0)
+        return { ...reach, shadowed };
+    const seeded = new Uint8Array(relations.names.length);
+    for (const seed of seeds)
+        seeded[seed] = 1;
+    const decided = new Set();
+    for (;;) {
+        let found = 0;
+        for (const [name, row] of shadows) {
+            const id = idOf(relations, 'file', name);
+            if (id === undefined || reach.mask[id] !== 1 || seeded[id] === 1 || decided.has(id))
+                continue;
+            const cut = [];
+            for (const shadow of row) {
+                const target = idOf(relations, 'file', shadow);
+                if (target !== undefined && reach.mask[target] === 1)
+                    cut.push(target);
+            }
+            if (cut.length === 0)
+                continue;
+            decided.add(id);
+            const forward = dependenciesOf(relations, [id], { ...options, avoid: cut });
+            if (forward.reached.some((node) => seeded[node] === 1))
+                continue;
+            avoid.add(id);
+            shadowed.push(name);
+            found += 1;
+        }
+        if (found === 0)
+            break;
+        reach = dependentsOf(relations, seeds, { ...options, avoid });
     }
-    return { files, components, missing: missing.sort(byCodeUnit), opaque, reach };
+    return { ...reach, shadowed: shadowed.sort(byCodeUnit) };
 }
 /**
  * How one file or component was reached, as the chain that reached it.

package/dist/relate/records.js.map

@@ -1 +1 @@
-{"version":3,"file":"records.js","sourceRoot":"","sources":["../../src/relate/records.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EACL,IAAI,EACJ,MAAM,EACN,WAAW,GAMZ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,YAAY,EAAE,OAAO,EAAc,MAAM,YAAY,CAAC;AAiD/D,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAC9D,MAAM,SAAS,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AAExE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAA6B;IAC5D,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAW,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAgC,EAAE,CAAC;IAEhD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACtC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YACzC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,4EAA4E;QAC5E,sEAAsE;QACtE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,WAAW,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;AACvD,CAAC;AAwCD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,OAAO,CAAC,SAAoB,EAAE,OAAyB;IACrE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACpC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxD,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,SAAS;QAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AACjF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,SAAoB,EAAE,KAAc,EAAE,IAAU;IACtE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAChC,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC","sourcesContent":["/**\n * One file's outgoing edges, and the fold that turns a pile of them into a graph.\n *\n * A record is what reading **one** file produced, and that is the unit on\n * purpose. It makes the expensive half — open, parse, resolve — cacheable by\n * content digest and parallelizable per file, and it leaves the graph a pure\n * function of the records, so the structure can be rebuilt, sharded or merged\n * without touching a disk. `core` performs no I/O (ADR-0006); whoever owns the\n * disk produces these and hands them over.\n *\n * ## An empty record and an unreadable one are different facts\n *\n * A file with no imports and a file nothing could parse both produce a record\n * with no edges, and treating them alike is the one mistake that turns this from\n * a saving into a silent hole: the second one may import anything, including\n * whatever just changed. So `unknown` carries the *reason* the edges are not\n * known, and every consumer seeds its traversal with those files (ADR-0002 —\n * absent is not empty, and here absent is not even absent, it is *unread*).\n */\n\nimport type { Digest } from '../format/hash.js';\nimport {\n  idOf,\n  nodeAt,\n  relationsOf,\n  type EdgeKind,\n  type Node,\n  type NodeId,\n  type Relation,\n  type Relations,\n} from './graph.js';\nimport { dependentsOf, trailOf, type Reach } from './reach.js';\n\nexport interface FileEdge {\n  /** Repository-relative, already resolved. A specifier is not an edge. */\n  readonly to: string;\n  readonly kind: EdgeKind;\n}\n\nexport interface FileRecord {\n  /** Repository-relative, so a graph is portable between machines and CI. */\n  readonly file: string;\n\n  /**\n   * The content digest this record was read from.\n   *\n   * Two jobs. It lets a second scan skip the parse for a file that has not moved,\n   * which is the difference between a scan that costs a second and one nobody\n   * leaves enabled. And it is the leaf of the Merkle fold in\n   * [`merkle.ts`](./merkle.ts) — a file with no digest is one nothing can prove\n   * unchanged, and is marked as such rather than assumed still.\n   */\n  readonly digest?: Digest;\n\n  /** Resolved outgoing edges. Absent and empty mean the same thing here. */\n  readonly edges?: readonly FileEdge[];\n\n  /** Component names this file declares, from `indexSource` or better. */\n  readonly declares?: readonly string[];\n\n  /**\n   * Specifiers that were read but did not resolve.\n   *\n   * Kept for the report rather than for the graph. A bare specifier that failed\n   * to resolve is usually a package that is not installed; a **relative** one\n   * that failed is a hole, and whoever produced the record says so by also\n   * setting `unknown`.\n   */\n  readonly unresolved?: readonly string[];\n\n  /**\n   * Why this file's outgoing edges could not be enumerated, when they could not.\n   *\n   * Present means *this file may depend on anything*. The sentence is carried\n   * rather than a flag, because it ends up in the paragraph explaining why a run\n   * observed more than the operator expected.\n   */\n  readonly unknown?: string;\n}\n\nconst file = (name: string): Node => ({ kind: 'file', name });\nconst component = (name: string): Node => ({ kind: 'component', name });\n\n/**\n * Fold file records into the graph.\n *\n * Every record contributes its own node even when it has no edges, so a changed\n * file that imports nothing is still findable — otherwise the one file in the\n * diff would be missing from the structure that exists to answer questions about\n * it.\n *\n * A declaration becomes an edge from the **component to the file**, which is the\n * direction the convention requires: the component depends on the file that\n * declares it, so one walk against the arrows from a changed file reaches every\n * importer and every component in the same pass.\n */\nexport function relationsOfFiles(records: Iterable<FileRecord>): Relations {\n  const relations: Relation[] = [];\n  const isolated: Node[] = [];\n  const unknown: (readonly [Node, string])[] = [];\n\n  for (const record of records) {\n    const from = file(record.file);\n    isolated.push(from);\n\n    for (const edge of record.edges ?? []) {\n      relations.push({ from, to: file(edge.to), kind: edge.kind });\n    }\n    for (const name of record.declares ?? []) {\n      relations.push({ from: component(name), to: from, kind: 'declared-in' });\n    }\n    // The sentence travels with the node. Reduced to a flag here, the paragraph\n    // this record exists to produce could name a count and never a cause.\n    if (record.unknown !== undefined) unknown.push([from, record.unknown]);\n  }\n\n  return relationsOf({ relations, isolated, unknown });\n}\n\nexport interface Hole {\n  /** The file whose outgoing edges could not be enumerated. */\n  readonly file: string;\n  /** Why, in the words of whoever read it. Absent when nobody said. */\n  readonly because?: string;\n}\n\nexport interface Reached {\n  /** Files the change could have moved, including the changed files themselves. */\n  readonly files: readonly string[];\n  /** Components declared in any of them. */\n  readonly components: readonly string[];\n\n  /**\n   * Changed paths the graph does not hold.\n   *\n   * Never silently ignored. A `README.md` belongs here and means nothing; a\n   * source file belongs here only because the scan never reached it, and the\n   * caller — which knows where it told the scan to look — is the one that can\n   * tell those apart.\n   */\n  readonly missing: readonly string[];\n\n  /**\n   * Files seeded because their own edges are unknown, rather than because\n   * anything reached them, each with the reason it could not be read.\n   *\n   * Counted separately so that \"we widened\" never hides inside \"we found\", and\n   * carrying its sentence so the widening is a work item rather than a tax: *four\n   * files could not be read* is something to live with, and ``src/legacy.js — a\n   * computed require()`` is something to fix.\n   */\n  readonly opaque: readonly Hole[];\n\n  /** The traversal, kept so a caller can ask how any one file was reached. */\n  readonly reach: Reach;\n}\n\n/**\n * What a set of changed files could have moved.\n *\n * The seed set is the changed files **and every file whose edges are unknown**,\n * which is the rule the whole structure rests on. An unreadable file might import\n * the one that changed; seeding it means everything depending on *it* is observed\n * too, and the cost is a collection rather than a green run over an unwatched\n * surface.\n *\n * One breadth-first search, whatever the number of changed files.\n */\nexport function movedBy(relations: Relations, changed: Iterable<string>): Reached {\n  const seeds: NodeId[] = [];\n  const missing: string[] = [];\n\n  for (const path of changed) {\n    const id = idOf(relations, 'file', path);\n    if (id === undefined) missing.push(path);\n    else seeds.push(id);\n  }\n\n  const opaque: Hole[] = [];\n  for (let id = 0; id < relations.unknown.length; id += 1) {\n    if (relations.unknown[id] !== 1) continue;\n    seeds.push(id);\n\n    const because = relations.reasons.get(id);\n    opaque.push({ file: relations.names[id]!, ...(because === undefined ? {} : { because }) });\n  }\n\n  const reach = dependentsOf(relations, seeds);\n  const files: string[] = [];\n  const components: string[] = [];\n\n  for (const id of reach.reached) {\n    const node = nodeAt(relations, id);\n    if (node === undefined) continue;\n    (node.kind === 'file' ? files : components).push(node.name);\n  }\n\n  return { files, components, missing: missing.sort(byCodeUnit), opaque, reach };\n}\n\n/**\n * How one file or component was reached, as the chain that reached it.\n *\n * The sentence a run prints when somebody asks why a subject was observed. Empty\n * when the node was not reached at all.\n */\nexport function explain(relations: Relations, moved: Reached, node: Node): readonly string[] {\n  const id = idOf(relations, node.kind, node.name);\n  if (id === undefined) return [];\n  return trailOf(moved.reach, id).map((step) => relations.names[step]!);\n}\n\nfunction byCodeUnit(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n"]}
+{"version":3,"file":"records.js","sourceRoot":"","sources":["../../src/relate/records.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EACL,IAAI,EACJ,MAAM,EACN,WAAW,GAOZ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,OAAO,EAAiC,MAAM,YAAY,CAAC;AAgFlG,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAC9D,MAAM,SAAS,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AACxE,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAEhE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAA6B,EAAE,OAAO,GAAqB,EAAE;IAC5F,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAW,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAgC,EAAE,CAAC;IAEhD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACtC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YACzC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YACzC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,4EAA4E;QAC5E,sEAAsE;QACtE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,4EAA4E;IAC5E,uEAAuE;IACvE,4EAA4E;IAC5E,qEAAqE;IACrE,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;QAC/C,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,OAAO,WAAW,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AAC/H,CAAC;AAkGD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,OAAO,CACrB,SAAoB,EACpB,OAAgC,EAChC,OAAO,GAAiB,EAAE;IAE1B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxD,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,SAAS;QAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACpD,MAAM,KAAK,GAA+B,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAEnF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,IAAI;QACjB,UAAU,EAAE,KAAK,CAAC,SAAS;QAC3B,QAAQ,EAAE,KAAK,CAAC,OAAO;QACvB,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC,MAAM;QACN,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,UAAU,CACjB,SAAoB,EACpB,KAAwB,EACxB,OAAqB;IAErB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,CAAC;IACrD,IAAI,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACpD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,CAAC;IAEtD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,CAAC;QACR,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACzC,IAAI,EAAE,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE9F,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,MAAM,MAAM,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC/C,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC/B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,OAAO,GAAG,cAAc,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5E,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAAE,SAAS;YAEjE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACd,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;QACD,IAAI,KAAK,KAAK,CAAC;YAAE,MAAM;QACvB,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,SAAoB,EAAE,KAAc,EAAE,IAAU;IACtE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAChC,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC","sourcesContent":["/**\n * One file's outgoing edges, and the fold that turns a pile of them into a graph.\n *\n * A record is what reading **one** file produced, and that is the unit on\n * purpose. It makes the expensive half — open, parse, resolve — cacheable by\n * content digest and parallelizable per file, and it leaves the graph a pure\n * function of the records, so the structure can be rebuilt, sharded or merged\n * without touching a disk. `core` performs no I/O (ADR-0006); whoever owns the\n * disk produces these and hands them over.\n *\n * ## An empty record and an unreadable one are different facts\n *\n * A file with no imports and a file nothing could parse both produce a record\n * with no edges, and treating them alike is the one mistake that turns this from\n * a saving into a silent hole: the second one may import anything, including\n * whatever just changed. So `unknown` carries the *reason* the edges are not\n * known, and every consumer seeds its traversal with those files (ADR-0002 —\n * absent is not empty, and here absent is not even absent, it is *unread*).\n */\n\nimport type { Digest } from '../format/hash.js';\nimport {\n  idOf,\n  nodeAt,\n  relationsOf,\n  type EdgeKind,\n  type Node,\n  type NodeId,\n  type NodeKind,\n  type Relation,\n  type Relations,\n} from './graph.js';\nimport { dependenciesOf, dependentsOf, trailOf, type Reach, type ReachOptions } from './reach.js';\n\nexport interface FileEdge {\n  /** Repository-relative, already resolved. A specifier is not an edge. */\n  readonly to: string;\n  readonly kind: EdgeKind;\n}\n\n/**\n * A file's import of something the install provides.\n *\n * The name a specifier asked for, never a version and never a resolution:\n * which copy a resolver handed this importer is unanswerable without\n * reproducing that resolver, and a selector that guessed would skip on the\n * guess. Names over-include, which is the safe direction.\n */\nexport interface PackageEdge {\n  /** The package name the specifier asked for — `@mui/material`, not a path. */\n  readonly to: string;\n  /** The import's own kind, so a `type` import of a package is erased like any other. */\n  readonly kind: EdgeKind;\n}\n\nexport interface FileRecord {\n  /** Repository-relative, so a graph is portable between machines and CI. */\n  readonly file: string;\n\n  /**\n   * The content digest this record was read from.\n   *\n   * Two jobs. It lets a second scan skip the parse for a file that has not moved,\n   * which is the difference between a scan that costs a second and one nobody\n   * leaves enabled. And it is the leaf of the Merkle fold in\n   * [`merkle.ts`](./merkle.ts) — a file with no digest is one nothing can prove\n   * unchanged, and is marked as such rather than assumed still.\n   */\n  readonly digest?: Digest;\n\n  /** Resolved outgoing edges. Absent and empty mean the same thing here. */\n  readonly edges?: readonly FileEdge[];\n\n  /** Component names this file declares, from `indexSource` or better. */\n  readonly declares?: readonly string[];\n\n  /**\n   * Packages this file imports, by the name it imports them by.\n   *\n   * The far end of the line. Nothing resolves these to a path — under pnpm's\n   * store or Yarn PnP there may not be one, and under a custom resolver the path\n   * would be a lie about a different machine — so the name stands for the\n   * dependency, and what the install currently has under that name is a question\n   * for the lockfile ([`sense/lock`](../../../sense/src/lock/index.ts)).\n   *\n   * A file that imports `@mui/material` is moved by `@mui/material` moving; a\n   * file that does not, is not. That is the whole rule, and it is why this is\n   * read from the imports rather than from a manifest: a `package.json` says what\n   * a workspace may use, and the imports say what a file does use.\n   */\n  readonly packages?: readonly PackageEdge[];\n\n  /**\n   * Specifiers that were read but did not resolve.\n   *\n   * Kept for the report rather than for the graph. A bare specifier that failed\n   * to resolve is usually a package that is not installed; a **relative** one\n   * that failed is a hole, and whoever produced the record says so by also\n   * setting `unknown`.\n   */\n  readonly unresolved?: readonly string[];\n\n  /**\n   * Why this file's outgoing edges could not be enumerated, when they could not.\n   *\n   * Present means *this file may depend on anything*. The sentence is carried\n   * rather than a flag, because it ends up in the paragraph explaining why a run\n   * observed more than the operator expected.\n   */\n  readonly unknown?: string;\n}\n\nconst file = (name: string): Node => ({ kind: 'file', name });\nconst component = (name: string): Node => ({ kind: 'component', name });\nconst pkg = (name: string): Node => ({ kind: 'package', name });\n\n/**\n * Fold file records into the graph.\n *\n * Every record contributes its own node even when it has no edges, so a changed\n * file that imports nothing is still findable — otherwise the one file in the\n * diff would be missing from the structure that exists to answer questions about\n * it.\n *\n * A declaration becomes an edge from the **component to the file**, which is the\n * direction the convention requires: the component depends on the file that\n * declares it, so one walk against the arrows from a changed file reaches every\n * importer and every component in the same pass.\n */\nexport function relationsOfFiles(records: Iterable<FileRecord>, options: RelationsOptions = {}): Relations {\n  const relations: Relation[] = [];\n  const isolated: Node[] = [];\n  const unknown: (readonly [Node, string])[] = [];\n\n  for (const record of records) {\n    const from = file(record.file);\n    isolated.push(from);\n\n    for (const edge of record.edges ?? []) {\n      relations.push({ from, to: file(edge.to), kind: edge.kind });\n    }\n    for (const edge of record.packages ?? []) {\n      relations.push({ from, to: pkg(edge.to), kind: edge.kind });\n    }\n    for (const name of record.declares ?? []) {\n      relations.push({ from: component(name), to: from, kind: 'declared-in' });\n    }\n    // The sentence travels with the node. Reduced to a flag here, the paragraph\n    // this record exists to produce could name a count and never a cause.\n    if (record.unknown !== undefined) unknown.push([from, record.unknown]);\n  }\n\n  // The lock's own edges arrive here rather than as records, because they are\n  // not a file's reading of anything: one lockfile answers for the whole\n  // install, and folding them in beside the imports is what lets a bump three\n  // packages deep walk up to the file that imports the one at the top.\n  for (const [from, to] of options.depends ?? []) {\n    relations.push({ from: pkg(from), to: pkg(to), kind: 'depends-on' });\n  }\n\n  return relationsOf({ relations, isolated, unknown, ...(options.shadows === undefined ? {} : { shadows: options.shadows }) });\n}\n\nexport interface RelationsOptions {\n  /** Per file, the files its run never reaches; see {@link Relations.shadows}. */\n  readonly shadows?: ReadonlyMap<string, readonly string[]>;\n\n  /**\n   * `[dependent, dependency]` pairs between packages, from a lockfile\n   * ([`packageRelations`](../../../sense/src/lock/lockfile.ts)).\n   *\n   * Optional, and a graph without them is not wrong, only shorter-sighted: it\n   * answers a change to a package some file imports directly, and says nothing\n   * about a change three levels down. Supplying them is what turns *`jsdom`\n   * moved* into *every test whose environment is built on it*.\n   */\n  readonly depends?: Iterable<readonly [string, string]>;\n}\n\nexport interface Hole {\n  /** The file whose outgoing edges could not be enumerated. */\n  readonly file: string;\n  /** Why, in the words of whoever read it. Absent when nobody said. */\n  readonly because?: string;\n}\n\n/**\n * What one backwards walk over the file graph found, and what widened it.\n *\n * Every field is part of one answer and none of them stands alone: `files` is\n * the answer, `missing` and `opaque` are the two ways it is not the whole truth,\n * and `reach` is what an explanation is read back out of. A caller that took\n * `files` and dropped the rest would be a caller that cannot say whether the\n * list is narrow because the diff was small or because the scan never ran.\n */\nexport interface Reached {\n  /** Files the change could have moved, including the changed files themselves. */\n  readonly files: readonly string[];\n  /** Components declared in any of them. */\n  readonly components: readonly string[];\n\n  /**\n   * Packages the change could have moved, including the changed packages\n   * themselves and everything the install resolved beneath them.\n   *\n   * Reported rather than used: the answer a caller acts on is in `files`, and\n   * this is the trail of package names that got there. Empty for a walk seeded\n   * only with files, because a package is downstream of every file that imports\n   * it and a walk against the arrows never descends.\n   */\n  readonly packages: readonly string[];\n\n  /**\n   * Changed paths the graph does not hold.\n   *\n   * Never silently ignored. A `README.md` belongs here and means nothing; a\n   * source file belongs here only because the scan never reached it, and the\n   * caller — which knows where it told the scan to look — is the one that can\n   * tell those apart.\n   */\n  readonly missing: readonly string[];\n\n  /**\n   * Files seeded because their own edges are unknown, rather than because\n   * anything reached them, each with the reason it could not be read.\n   *\n   * Counted separately so that \"we widened\" never hides inside \"we found\", and\n   * carrying its sentence so the widening is a work item rather than a tax: *four\n   * files could not be read* is something to live with, and ``src/legacy.js — a\n   * computed require()`` is something to fix.\n   */\n  readonly opaque: readonly Hole[];\n\n  /**\n   * Files the graph reached and their own shadows cut: every trail from a\n   * changed file to each one crossed a module the file replaces for its run.\n   * Listed so the report can say a test was left out and by whose word.\n   */\n  readonly shadowed: readonly string[];\n\n  /** The traversal, kept so a caller can ask how any one file was reached. */\n  readonly reach: Reach;\n}\n\nexport interface MovedOptions extends ReachOptions {\n  /**\n   * Per file, the files it takes out of its own graph: what a test mocks.\n   *\n   * A row is a fact about one file's run and nothing else's, so it is kept\n   * beside the records rather than in them — the records say what the text\n   * imports, this says what the run never reaches. A file with a row is moved\n   * only if some trail from a changed file arrives at it without crossing a\n   * file in its row, and what is reached only *through* it goes with it: the\n   * component a story declares, the test a setup file's mocks hold for. The\n   * graph's own table when absent ({@link Relations.shadows}).\n   */\n  readonly shadows?: ReadonlyMap<string, readonly string[]>;\n}\n\n/**\n * What a set of changed files could have moved.\n *\n * The seed set is the changed files **and every file whose edges are unknown**,\n * which is the rule the whole structure rests on. An unreadable file might import\n * the one that changed; seeding it means everything depending on *it* is observed\n * too, and the cost is a collection rather than a green run over an unwatched\n * surface.\n *\n * A seed is a path, or a node naming its own kind. The second form is how a\n * changed *package* enters: a bare string keeps meaning a file, because that is\n * what every caller written before packages existed meant by one, and a caller\n * with a lockfile in hand passes `{ kind: 'package', name: 'jsdom' }` into the\n * same walk. There is no second selector, and there is no order between the two\n * — a commit that bumps a dependency and edits a file is one seed set and one\n * traversal.\n *\n * One breadth-first search, whatever the number of changed files, over the\n * runtime edges unless the caller names others.\n */\nexport function movedBy(\n  relations: Relations,\n  changed: Iterable<string | Node>,\n  options: MovedOptions = {},\n): Reached {\n  const seeds: NodeId[] = [];\n  const missing: string[] = [];\n\n  for (const entry of changed) {\n    const node = typeof entry === 'string' ? file(entry) : entry;\n    const id = idOf(relations, node.kind, node.name);\n    if (id === undefined) missing.push(node.name);\n    else seeds.push(id);\n  }\n\n  const opaque: Hole[] = [];\n  for (let id = 0; id < relations.unknown.length; id += 1) {\n    if (relations.unknown[id] !== 1) continue;\n    seeds.push(id);\n\n    const because = relations.reasons.get(id);\n    opaque.push({ file: relations.names[id]!, ...(because === undefined ? {} : { because }) });\n  }\n\n  const reach = unshadowed(relations, seeds, options);\n  const found: Record<NodeKind, string[]> = { file: [], component: [], package: [] };\n\n  for (const id of reach.reached) {\n    const node = nodeAt(relations, id);\n    if (node === undefined) continue;\n    found[node.kind].push(node.name);\n  }\n\n  return {\n    files: found.file,\n    components: found.component,\n    packages: found.package,\n    missing: missing.sort(byCodeUnit),\n    opaque,\n    shadowed: reach.shadowed,\n    reach,\n  };\n}\n\n/**\n * The walk against the arrows with every file left out whose own shadows cut\n * every trail to it, and with nothing reached through such a file.\n *\n * The walk records one parent per node, so it cannot say whether *another*\n * trail avoided the shadows. Asking the other way can: a walk along the arrows\n * from the file, entering none of its shadows, either finds a seed or does not.\n * It runs only for a reached file whose row names a reached node — a mock of\n * something the change never touched cuts nothing, and costs nothing. A file\n * found shadowed is then avoided and the walk repeated, so a component or a\n * file reached only through it is not reached either; the repeat ends when a\n * walk finds no new shadowed file, and a row once decided is not asked again.\n */\nfunction unshadowed(\n  relations: Relations,\n  seeds: readonly NodeId[],\n  options: MovedOptions,\n): Reach & { readonly shadowed: readonly string[] } {\n  const shadowed: string[] = [];\n  const avoid = new Set<NodeId>(options.avoid ?? []);\n  const shadows = options.shadows ?? relations.shadows;\n  let reach = dependentsOf(relations, seeds, options);\n  if (shadows.size === 0) return { ...reach, shadowed };\n\n  const seeded = new Uint8Array(relations.names.length);\n  for (const seed of seeds) seeded[seed] = 1;\n  const decided = new Set<NodeId>();\n\n  for (;;) {\n    let found = 0;\n    for (const [name, row] of shadows) {\n      const id = idOf(relations, 'file', name);\n      if (id === undefined || reach.mask[id] !== 1 || seeded[id] === 1 || decided.has(id)) continue;\n\n      const cut: NodeId[] = [];\n      for (const shadow of row) {\n        const target = idOf(relations, 'file', shadow);\n        if (target !== undefined && reach.mask[target] === 1) cut.push(target);\n      }\n      if (cut.length === 0) continue;\n      decided.add(id);\n\n      const forward = dependenciesOf(relations, [id], { ...options, avoid: cut });\n      if (forward.reached.some((node) => seeded[node] === 1)) continue;\n\n      avoid.add(id);\n      shadowed.push(name);\n      found += 1;\n    }\n    if (found === 0) break;\n    reach = dependentsOf(relations, seeds, { ...options, avoid });\n  }\n\n  return { ...reach, shadowed: shadowed.sort(byCodeUnit) };\n}\n\n/**\n * How one file or component was reached, as the chain that reached it.\n *\n * The sentence a run prints when somebody asks why a subject was observed. Empty\n * when the node was not reached at all.\n */\nexport function explain(relations: Relations, moved: Reached, node: Node): readonly string[] {\n  const id = idOf(relations, node.kind, node.name);\n  if (id === undefined) return [];\n  return trailOf(moved.reach, id).map((step) => relations.names[step]!);\n}\n\nfunction byCodeUnit(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n"]}