@ecoma-io/archkeep 0.22.2 → 0.24.0

package/package.json

@@ -1,22 +1,49 @@
 {
   "name": "@ecoma-io/archkeep",
-  "version": "0.22.2",
-  "description": "Architecture enforcement for polyglot repositories — dependency graphs and module boundaries for Go, Rust, Python, TypeScript, JavaScript, Vue, Java and Kotlin",
+  "version": "0.24.0",
+  "description": "Architecture authority for human and agentic software development — deterministic, evidence-backed enforcement of declared architecture.",
   "keywords": [
     "architecture",
-    "enforcement",
+    "software-architecture",
+    "architecture-governance",
+    "architecture-enforcement",
+    "architecture-as-code",
+    "architecture-drift",
+    "architecture-compliance",
+    "architecture-rules",
+    "dependency-analysis",
+    "dependency-governance",
     "dependency-graph",
-    "monorepo",
-    "module-boundaries",
-    "polyglot",
     "static-analysis",
-    "language-server",
-    "nx",
-    "nx-plugin",
-    "golang",
-    "rust",
-    "python",
-    "typescript"
+    "code-analysis",
+    "code-governance",
+    "architecture-fitness",
+    "fitness-functions",
+    "architecture-decision",
+    "architecture-decision-record",
+    "adr",
+    "architecture-evidence",
+    "evidence-based",
+    "deterministic-analysis",
+    "deterministic-verdicts",
+    "drift-detection",
+    "change-impact-analysis",
+    "architecture-debt",
+    "architecture-health",
+    "architecture-discovery",
+    "architecture-reconciliation",
+    "polyglot",
+    "monorepo",
+    "multi-repo",
+    "cross-repo",
+    "coding-agents",
+    "ai-agents",
+    "agentic-development",
+    "developer-tools",
+    "developer-experience",
+    "software-governance",
+    "engineering-governance",
+    "continuous-compliance"
   ],
   "type": "module",
   "license": "Apache-2.0",

package/src/analysis/jvm/packages.mjs

@@ -190,20 +190,3 @@ export function resolveJvmPackagePrefix(specifier, index) {
   }
   return null;
 }
-
-/**
- * The owning project of a resolved prefix, when exactly one project claims
- * the matched name.
- *
- * @param {{ owners: { project: string }[], prefix: string }} resolution
- * @returns {{ target: string, ambiguous?: undefined } |
- *            { target: null, ambiguous: true, projects: string[] }} A single
- *   target when the owners agree; otherwise every distinct claimant, for the
- *   caller's failure record.
- */
-export function projectOfResolution(resolution) {
-  const projects = [...new Set(resolution.owners.map((owner) => owner.project))];
-  return projects.length === 1
-    ? { target: projects[0] }
-    : { target: null, ambiguous: true, projects };
-}

package/src/analysis/manifest-util.mjs

@@ -67,8 +67,12 @@ export function resolveWithinWorkspace(baseDir, relative) {
   return segments.join("/");
 }
 
-/** A pattern carrying any of these is a glob; anything else is a literal. */
-const GLOB_METACHARACTERS = /[*?[{\\]/;
+/**
+ * A pattern carrying any of these is routed to the glob matcher; everything
+ * else compares equal. `(` rides for extglob — `+(x).txt` matches `x.txt`
+ * (measured on Node v24) — the character #671 proved the table was missing.
+ */
+const GLOB_METACHARACTERS = /[*?[{(\\]/;
 
 /**
  * Does a file's basename match any of a manifest-name pattern list — the
@@ -82,9 +86,14 @@ const GLOB_METACHARACTERS = /[*?[{\\]/;
  * the equality scan it replaced was nanoseconds, because each call compiles
  * its pattern again. The matcher is injected so `../../providers/native/
  * model.mjs`'s validated one and raw `path.posix.matchesGlob` ride the same
- * fast path without this module reaching for either; semantics are
- * unchanged, because a metacharacter-free pattern answers identically
- * either way and every other pattern still reaches the glob.
+ * fast path without this module reaching for either. The rule the table has
+ * to hold: every pattern carrying a character that can alter the glob's
+ * answer is routed to it, and everything else compares equal — a pattern
+ * the table does not carry is literal outside constructs the table already
+ * routes, so the two answers agree, and routing a literal anyway (an
+ * unbalanced `a(b`) costs only the matcher call. #671: `(` was missing
+ * from the table, so an extglob manifest pattern like `+(x).csproj` was
+ * compared by equality and missed every file the pattern named.
  *
  * @param {string} base The basename under test.
  * @param {readonly string[]} patterns

package/src/analysis/markdown.mjs

@@ -0,0 +1,340 @@
+/**
+ * The markdown document track: machine-readable markers inside tracked
+ * documents, resolved to graph edges the existing tag rows judge.
+ *
+ * A boundary law can declare a `markdown` block (`../config.mjs`'s
+ * `findMarkdownViolations` owns the shape): a set of document globs and a set
+ * of marker rows, each a regular expression whose first capture group names an
+ * exported symbol — the `<!-- @api Button -->` an architecture-intent
+ * document pairs with the component it documents. This module turns those
+ * markers into `{source, target, type}` edges: source is the project that owns
+ * the document, target is the project that exports the named symbol, and the
+ * type is the row's declared edge kind (`resolvedExportOwner`, the one kind
+ * today). Everything downstream of the fold is machinery that already existed:
+ * `../providers/native/graph.mjs`'s `mergeDeclaredEdges` folds the edges into
+ * the graph the way it folds the declared manifest track, and
+ * `../rules/edge-constraints.mjs`'s `judgeEdge` — the same function
+ * `declaredEdgeViolationsForCheck` runs `implicit` edges through — decides
+ * each one against `depConstraints`. No rule knows this track exists, which is
+ * the point: a document pairing is a project-to-project claim, and the claims
+ * a workspace already wrote are the ones that should judge it.
+ *
+ * ## What this module deliberately is not
+ *
+ * It does not render markdown, lint prose, or index free text. The only bytes
+ * read past the extension are lines matched by a configured marker row —
+ * declared, machine-readable claims, the same contract the declared manifest
+ * track reads a pom or a csproj under. A document whose every line matches no
+ * row contributes nothing, and a workspace that declares no `markdown` block
+ * pays nothing at all: the fold is unreachable without the block, so a
+ * config-absent run is byte-identical to one this module never existed for.
+ *
+ * ## The export index, and why re-exports cannot own a symbol
+ *
+ * Resolution asks "which project publishes `Button`", and the engine has no
+ * export table to ask — so the fold builds one, scanning every project-owned
+ * TypeScript-language file's top-level exports once (`./typescript.mjs`'s
+ * `exportedNamesOf`; `.vue` single-file components are not scanned, because
+ * their public surface is the TypeScript barrel that re-exports it, and the
+ * barrel is scanned). Names are kept in two tiers: a name a file DECLARES is
+ * its project's, and wins over any number of projects that merely RE-EXPORT
+ * it — an umbrella barrel re-exporting a library must not turn that library's
+ * every symbol into an ambiguous claim. A name in neither tier is a document
+ * claim the graph cannot honor, and the marker's file fails whole: a pairing
+ * the tree cannot establish must never read as a clean one (`../../../AGENTS.md`,
+ * "an empty result is a claim, not a shrug") — the same refusal posture the
+ * declared manifest track holds for a pom it cannot read, and for the same
+ * reason: the run would otherwise report a verdict computed over a track that
+ * silently dropped a declared edge.
+ */
+
+import { safeMatchesGlob } from "../rules/match.mjs";
+import { exportedNamesOf } from "./typescript.mjs";
+import { languageOf } from "./registry.mjs";
+import { fileFailure } from "./source-util.mjs";
+
+/** The extension a file must carry to be a candidate document. */
+const MARKDOWN_EXTENSION = ".md";
+
+/**
+ * The document track's fold, over an already-built context: every marker the
+ * law's rows match in every document the law's globs include, resolved against
+ * the workspace's exports.
+ *
+ * Edges are returned deduped by `(source, target, type)` — two markers in two
+ * documents naming the same symbol are one dependency at project grain, the
+ * same grain every other track reports at — and the caller folds them into the
+ * graph with `../providers/native/graph.mjs`'s `mergeDeclaredEdges`, which
+ * enforces the same key against the edges already there.
+ *
+ * Failures are WHOLE-FILE failures on the document that earned them, never
+ * positioned rows: a marker the tree cannot resolve means the document's
+ * pairing claim went unjudged, so the file has no verdict to claim and the
+ * run's coverage says so (`unchecked`), with the reason naming the line and
+ * the name. A positioned row would read as a resolved no — a verdict the run
+ * does not hold.
+ *
+ * @param {{ tracked: string[], owned: {file: string, project: string}[],
+ *   readFile: (path: string) => string|null, workspace: object,
+ *   markdown: {include: string[], markers: {pattern: string, edge: string}[]} }} input
+ *   `tracked` in the caller's file order (the run's determinism basis),
+ *   `owned` the context's file→project map, `readFile` the workspace's own
+ *   reader, `markdown` the loaded policy's markdown block.
+ * @returns {{ edges: {source: string, target: string, type: string}[],
+ *   claims: {source: string, target: string, type: string, file: string,
+ *   line: number, column: number, name: string}[],
+ *   failures: {sourceFile: string, reason: string}[], documents: number,
+ *   judged: number, resolved: number, selfPaired: number,
+ *   includeCounts: number[], rowMatches: number[] }}
+ *   `edges` is the deduped graph fold; `claims` is the same resolution at
+ *   marker grain — one record per resolved marker, carrying the document
+ *   position the caller's verdicts must point at, which the deduped list
+ *   deliberately does not. `documents` counts the files the include globs
+ *   selected and read. `judged` counts markers extracted, `resolved` the
+ *   ones that became an edge, `selfPaired` the ones whose document and symbol
+ *   live in the same project (a legal claim that draws no edge — a project
+ *   cannot depend on itself, the rule every track holds), `includeCounts` the
+ *   per-pattern document counts and `rowMatches` the per-row match counts the
+ *   caller's dead-law gate reads.
+ */
+export function foldMarkdownTrack({ tracked, owned, readFile, workspace, markdown }) {
+  const documents = markdownIncludedFiles({ include: markdown.include, tracked });
+  const includeCounts = markdown.include.map(
+    (pattern) => documents.filter((file) => matchesInclude(file, pattern)).length,
+  );
+  /** @type {{ row: number, file: string, line: number, column: number, name: string }[]} */
+  const markers = [];
+  /** @type {{sourceFile: string, reason: string}[]} */
+  const failures = [];
+  const rowMatches = markdown.markers.map(() => 0);
+  /** @type {(RegExp|null)[]} */
+  const compiled = markdown.markers.map((row) => {
+    try {
+      return new RegExp(row.pattern, "u");
+    } catch {
+      // Load-time validation refuses an uncompilable pattern; this arm exists
+      // so a hand-built config in a test degrades to "this row matches
+      // nothing" instead of throwing past every caller that guards.
+      return null;
+    }
+  });
+
+  for (const file of documents) {
+    const text = readFile(file);
+    if (text === null) {
+      failures.push(
+        fileFailure(
+          file,
+          "cannot be read — the markdown track matched it, so its markers cannot be extracted " +
+            "and its document claims cannot be judged",
+        ),
+      );
+      continue;
+    }
+    const lines = text.split("\n");
+    for (const [rowIndex, regex] of compiled.entries()) {
+      if (regex === null) continue;
+      for (const [at, line] of lines.entries()) {
+        const match = regex.exec(line);
+        if (match === null) continue;
+        rowMatches[rowIndex] += 1;
+        const name = match[1] ?? "";
+        if (name.trim() === "") {
+          failures.push(
+            fileFailure(
+              file,
+              `line ${at + 1}: the marker matches markdown.markers[${rowIndex}] but captures an ` +
+                `empty name — the row's first capture group must carry the exported symbol the ` +
+                `document claims`,
+            ),
+          );
+          continue;
+        }
+        markers.push({ row: rowIndex, file, line: at + 1, column: (match.index ?? 0) + 1, name });
+      }
+    }
+  }
+
+  const edges = [];
+  /** @type {{source: string, target: string, type: string, file: string,
+   * line: number, column: number, name: string}[]} */
+  const claims = [];
+  let resolved = 0;
+  let selfPaired = 0;
+  if (markers.length > 0) {
+    const projectOfFile = new Map(owned.map(({ file, project }) => [file, project]));
+    const index = exportIndexOf({ owned, readFile, workspace });
+    for (const marker of markers) {
+      // Declared beats re-exported: see this file's header. Candidates are
+      // sorted because a Set's insertion order is file order, and a message
+      // that names two projects must not name them in a different order on a
+      // different checkout.
+      const declaredOwners = index.declared.get(marker.name);
+      const candidates = declaredOwners ?? index.reexported.get(marker.name) ?? new Set();
+      if (candidates.size === 0) {
+        failures.push(
+          fileFailure(
+            marker.file,
+            `line ${marker.line}: the marker names '${marker.name}', which no tracked project ` +
+              `exports — the pairing this document claims cannot be resolved to a project, so ` +
+              `its edge was not drawn. Exports are scanned from TypeScript-language project ` +
+              `files; either the symbol does not exist, is not exported from a project file, or ` +
+              `its name is misspelt here`,
+          ),
+        );
+        continue;
+      }
+      if (candidates.size > 1) {
+        failures.push(
+          fileFailure(
+            marker.file,
+            `line ${marker.line}: the marker names '${marker.name}', which more than one project ` +
+              `exports — ${[...candidates]
+                .sort()
+                .map((name) => `'${name}'`)
+                .join(", ")} — and a ` +
+              `claim this tree cannot read one way must not be read as kept. Qualify the marker ` +
+              `or narrow the export surface so the name resolves to one project`,
+          ),
+        );
+        continue;
+      }
+      const source = projectOfFile.get(marker.file);
+      const [target] = candidates;
+      if (source === undefined) {
+        failures.push(
+          fileFailure(
+            marker.file,
+            `line ${marker.line}: the document is owned by no project, so the edge its marker ` +
+              `claims has no source — include the document's directory in a project, or narrow ` +
+              `markdown.include to documents that live inside one`,
+          ),
+        );
+        continue;
+      }
+      if (source === target) {
+        // A document pairing its own project's symbol: a legal claim that
+        // carries no boundary weight — no project depends on itself, the rule
+        // `buildDependencies` holds for every track — but a claim the row DID
+        // match and resolve, so it counts as judged rather than vanishing.
+        selfPaired += 1;
+        continue;
+      }
+      resolved += 1;
+      const edge = { source, target, type: markdown.markers[marker.row].edge };
+      edges.push(edge);
+      claims.push({
+        ...edge,
+        file: marker.file,
+        line: marker.line,
+        column: marker.column,
+        name: marker.name,
+      });
+    }
+  }
+
+  return {
+    edges: dedupeEdges(edges),
+    claims,
+    failures,
+    documents: documents.length,
+    judged: markers.length,
+    resolved,
+    selfPaired,
+    includeCounts,
+    rowMatches,
+  };
+}
+
+/**
+ * The tracked documents the law's globs select — tracked order preserved, and
+ * restricted to markdown files: the track reads documents, and a glob whose
+ * every match is some other kind of file selects nothing (loudly — the
+ * caller's dead-law gate counts what each pattern actually matched).
+ *
+ * Exported for the dead-law gate and its tests, which need the same selection
+ * the fold makes without re-deriving it a second way.
+ *
+ * @param {{include: string[], tracked: string[]}} input
+ * @returns {string[]}
+ */
+export function markdownIncludedFiles({ include, tracked }) {
+  return tracked.filter(
+    (file) =>
+      file.endsWith(MARKDOWN_EXTENSION) && include.some((pattern) => matchesInclude(file, pattern)),
+  );
+}
+
+/**
+ * Whether a tracked file matches one include pattern — `./rules/match.mjs`'s
+ * `safeMatchesGlob`, the one matcher `boundarySuppressions` and
+ * `coverage.exempt` rows use, so a glob spells the same language here it does
+ * everywhere else in the policy.
+ *
+ * @param {string} file Workspace-relative path.
+ * @param {string} pattern Workspace-relative glob.
+ * @returns {boolean}
+ */
+function matchesInclude(file, pattern) {
+  return safeMatchesGlob(file, pattern);
+}
+
+/**
+ * The workspace's export index, built once per fold: every project-owned
+ * TypeScript-language file's exported names, keyed by name to the set of
+ * projects that declare or re-export them.
+ *
+ * A file whose read fails contributes nothing — and no failure of its own:
+ * that file's analysis already reports the read to the caller's own funnel,
+ * and a second row naming the same bytes would count one hole twice. A file
+ * whose parse fails contributes what TypeScript could read, the posture
+ * `exportedNamesOf` itself holds.
+ *
+ * @param {{ owned: {file: string, project: string}[], readFile: (path: string) => string|null,
+ *   workspace: object }} input
+ * @returns {{ declared: Map<string, Set<string>>, reexported: Map<string, Set<string>> }}
+ */
+function exportIndexOf({ owned, readFile, workspace }) {
+  /** @type {Map<string, Set<string>>} */
+  const declared = new Map();
+  /** @type {Map<string, Set<string>>} */
+  const reexported = new Map();
+  const add = (map, names, project) => {
+    for (const name of names) {
+      if (name === "") continue;
+      const holders = map.get(name) ?? new Set();
+      holders.add(project);
+      map.set(name, holders);
+    }
+  };
+  for (const { file, project } of owned) {
+    // `.vue` single-file components are TypeScript too, but their script
+    // blocks live behind the SFC parser (`./vue.mjs`), and this index needs
+    // only what a barrel already re-exports — see this file's header.
+    if (languageOf(file) !== "typescript") continue;
+    const text = readFile(file);
+    if (text === null) continue;
+    const names = exportedNamesOf({ sourceFile: file, text, workspace });
+    add(declared, names.declared, project);
+    add(reexported, names.reexported, project);
+  }
+  return { declared, reexported };
+}
+
+/**
+ * One edge per `(source, target, type)` — the same canonical key
+ * `buildDependencies` reduces import sites by, applied here so the fold's own
+ * answer is canonical before the merge adds its dedup on top.
+ *
+ * @param {{source: string, target: string, type: string}[]} edges
+ * @returns {{source: string, target: string, type: string}[]}
+ */
+function dedupeEdges(edges) {
+  const seen = new Set();
+  return edges.filter((edge) => {
+    const key = JSON.stringify([edge.source, edge.target, edge.type]);
+    if (seen.has(key)) return false;
+    seen.add(key);
+    return true;
+  });
+}

package/src/analysis/source-util.mjs

@@ -153,10 +153,11 @@ function ownershipIndexOf(projects) {
 /**
  * Root comparisons `projectOwning` has performed since the module loaded.
  *
- * Nothing in production reads it. It exists so the complexity test counts
- * deterministic operations instead of milliseconds — the wall-clock this
- * repository does not trust in a test (cf. #359, #369). Every comparison the
- * lookup makes is counted: one per binary-search step, one per equality probe.
+ * A test-support export: nothing in production reads it. It exists so the
+ * complexity test counts deterministic operations instead of milliseconds —
+ * the wall-clock this repository does not trust in a test (cf. #359, #369).
+ * Every comparison the lookup makes is counted: one per binary-search step,
+ * one per equality probe.
  */
 let rootComparisons = 0;
 export const ownershipRootComparisons = () => rootComparisons;

package/src/analysis/typescript.mjs

@@ -1121,3 +1121,149 @@ export function analyzeTypeScript({ sourceFile, text, workspace, lang }) {
   }
   return result;
 }
+
+/**
+ * The names one TypeScript-language file EXPORTS, split by how the export was
+ * written — the two facts `../analysis/markdown.mjs`'s resolution needs when a
+ * document marker names a symbol and the engine must answer "which project
+ * publishes this".
+ *
+ * The split is load-bearing rather than bookkeeping. A name a file DECLARES
+ * here (`export const Button`, `export { Button }` over a local binding,
+ * `export default`) is a symbol whose home this file's project is: a marker
+ * naming it resolves to that project even when five other projects re-export
+ * it, because the re-exporters are downstream of the declaration, not
+ * alternative homes for it. A name a file RE-EXPORTS from another module
+ * (`export { Button } from "@scope/ui-button"`, `export * as ui from …`) is a
+ * name this module passes through, and the project that declares it owns the
+ * resolution. Resolution prefers the declared tier for exactly this reason —
+ * an umbrella barrel that re-exports a whole library must not turn every one
+ * of its symbols into an ambiguous claim.
+ *
+ * Only top-level statements are read, and `export * from "…"` is deliberately
+ * absent from both tiers: a star names no symbol, and enumerating one would
+ * mean resolving the starred module — a module-resolution walk this function's
+ * caller never needs, because a star's targets are themselves scanned as the
+ * files they are. A project whose public surface is star-re-exported from
+ * another project's files resolves those markers through the declaring files'
+ * own projects, which is the honest answer at project grain.
+ *
+ * Never throws: a malformed file yields whatever TypeScript could parse plus a
+ * failure per syntax error, the same posture `analyzeTypeScript` above holds —
+ * one unreadable file must not blank the index every marker resolves against.
+ *
+ * @param {{ sourceFile: string, text: string, workspace: object, lang?: string }} request
+ *   The same request shape `analyzeTypeScript` takes; `lang` is a Vue block's
+ *   `<script lang>` and is omitted for a real file.
+ * @returns {{ declared: string[], reexported: string[], failures: object[] }}
+ */
+export function exportedNamesOf({ sourceFile, text, workspace, lang }) {
+  /** @type {string[]} */
+  const declared = [];
+  /** @type {string[]} */
+  const reexported = [];
+  /** @type {object[]} */
+  const failures = [];
+  try {
+    const parsed = ts.createSourceFile(
+      `${workspace.root}/${sourceFile}`,
+      text,
+      ts.ScriptTarget.Latest,
+      false,
+      scriptKindFor(sourceFile, lang),
+    );
+    failures.push(...parseFailures(parsed, sourceFile));
+
+    const hasModifier = (node, kind) =>
+      (node.modifiers ?? []).some((modifier) => modifier.kind === kind);
+
+    for (const statement of parsed.statements) {
+      // `export { a, b as c }` with no `from` — a local binding list. The
+      // EXPORTED name is the alias side: plain `a` exports `a`, `b as c`
+      // exports `c`. Element name text is read defensively so a
+      // string-literal alias (`export { a as "x y" }`) is carried as written
+      // rather than undefined.
+      if (ts.isExportDeclaration(statement) && statement.exportClause) {
+        const clause = statement.exportClause;
+        if (ts.isNamedExports(clause)) {
+          const target = statement.moduleSpecifier ? reexported : declared;
+          for (const element of clause.elements) {
+            target.push(element.name?.text ?? "");
+          }
+        } else if (clause.name) {
+          // `export * as ns from "…"` — a re-export wearing a new name.
+          reexported.push(clause.name.text);
+        }
+        continue;
+      }
+      if (ts.isExportAssignment(statement)) {
+        // `export default <expression>` and `export = <identifier>` — the
+        // module's own default/exports binding, declared here whatever it
+        // wraps. The `export =` form carries the identifier it aliases; a
+        // default is the name every consumer writes, not the expression's.
+        declared.push(
+          statement.isExportEquals && ts.isIdentifier(statement.expression)
+            ? statement.expression.text
+            : "default",
+        );
+        continue;
+      }
+      const exported = hasModifier(statement, ts.SyntaxKind.ExportKeyword);
+      if (!exported) continue;
+      if (hasModifier(statement, ts.SyntaxKind.DefaultKeyword)) {
+        declared.push("default");
+        continue;
+      }
+      // The one-name statements — function, class, enum, namespace, type,
+      // interface — all carry the exported identifier as `.name`. Enumerated
+      // kind by kind so the type checker's statement union narrows to the
+      // members that actually have one; a future statement kind with a name
+      // is a new arm here, which is the point.
+      const named =
+        ts.isFunctionDeclaration(statement) ||
+        ts.isClassDeclaration(statement) ||
+        ts.isEnumDeclaration(statement) ||
+        ts.isTypeAliasDeclaration(statement) ||
+        ts.isInterfaceDeclaration(statement) ||
+        ts.isModuleDeclaration(statement);
+      if (named) {
+        const name = statement.name?.text ?? "";
+        if (name !== "") {
+          declared.push(name);
+          continue;
+        }
+      }
+      if (ts.isVariableStatement(statement)) {
+        for (const declaration of statement.declarationList.declarations) {
+          bindingNames(declaration.name, declared);
+        }
+      }
+    }
+  } catch (cause) {
+    failures.push(fileFailure(sourceFile, `export scan failed: ${cause?.message ?? cause}`));
+  }
+  return { declared, reexported, failures };
+}
+
+/**
+ * Every identifier a binding pattern introduces, in source order — `a`,
+ * `{ a, b: c }`'s `a` and `c`, `[x, ...rest]`'s `x` and `rest`. Computed
+ * properties (`{ [key]: value }`) introduce nothing nameable and are skipped,
+ * the same call a minifier would make: a name no source text carries is a name
+ * no marker can claim.
+ *
+ * @param {ts.Node} node A binding name or pattern.
+ * @param {string[]} out Accumulator, mutated in place.
+ */
+function bindingNames(node, out) {
+  if (ts.isIdentifier(node) || ts.isStringLiteral(node)) {
+    out.push(node.text);
+    return;
+  }
+  if (ts.isObjectBindingPattern(node) || ts.isArrayBindingPattern(node)) {
+    for (const element of node.elements) {
+      if (ts.isOmittedExpression(element)) continue;
+      bindingNames(element.name ?? element, out);
+    }
+  }
+}

package/src/architecture-intent/judge.mjs

@@ -129,7 +129,7 @@ function directEdges(graph) {
  * three copies of the same filter is how one of them drifts.
  *
  * `../../src/rules/reachability.mjs`'s `buildReachability` itself stays
- * type-agnostic on purpose: `../../src/commands/edge-constraints.mjs`'s
+ * type-agnostic on purpose: `../rules/edge-constraints.mjs`'s
  * `declaredEdgeViolationsForCheck` and `../../src/rules/index.mjs`'s
  * `evaluate()` both deliberately hand it the UNFILTERED graph, because
  * `depConstraints`' `notDependOnLibsWithTags` is a different, tag-based

package/src/architecture-intent/model.mjs

@@ -41,8 +41,10 @@ import { readFile as readFileFromDisk } from "node:fs/promises";
 import { resolve } from "node:path";
 
 import { containmentViolation } from "../containment.mjs";
+import { isEnoent } from "../errors.mjs";
 
 import { isValidSelector, splitSelector } from "./selectors.mjs";
+import { describe, isPlainObject } from "../values.mjs";
 import { GOVERNANCE_ROW_KEYS, rowSchemaViolations } from "../governance/row-schema.mjs";
 
 /** The base name of the root file this module reads. */
@@ -121,17 +123,6 @@ const ROW_KEYS = Object.freeze(["from", "to", "reason", "optional", "decisionRef
 /** A boundary `name`, matched exactly by the loaders — names can never contain `:`, so a name can never collide with a `name:`-prefixed selector. */
 const NAME_PATTERN = /^[a-zA-Z0-9_-]+$/u;
 
-/** A value's type, for an error message that shows what was actually there. */
-function describe(value) {
-  if (Array.isArray(value)) return `an array (${JSON.stringify(value)})`;
-  if (value === null) return "null";
-  return `${typeof value} (${JSON.stringify(value) ?? String(value)})`;
-}
-
-/** @type {(value: unknown) => value is Record<string, unknown>} */
-const isPlainObject = (value) =>
-  value !== null && typeof value === "object" && !Array.isArray(value);
-
 /** `key` on `obj` that is not one of `allowed` — for the reject-by-name rule. */
 function unknownKeys(obj, allowed) {
   return Object.keys(obj).filter((key) => !allowed.includes(key));
@@ -675,7 +666,7 @@ export async function loadIntent(root, { read = readFileFromDisk, tracked } = {}
     // neighbours on the identical tree are both loud: an escaping symlink
     // throws at the containment check above, and EACCES throws below. Only
     // this one was silent (`../../../../AGENTS.md`).
-    if (cause?.code === "ENOENT") {
+    if (isEnoent(cause)) {
       if (tracked === undefined) return undefined;
       throw new Error(
         `${INTENT_FILE}: is tracked but could not be read: ${cause?.message ?? cause} — ` +