@nielspeter/eess-ts 0.2.1 → 0.4.0

package/dist/conditions/slice.d.ts

@@ -1,9 +1,10 @@
 import type { Condition } from '@nielspeter/eess';
 import type { Slice } from '../models/slice.js';
+import type { ImportOptions } from '../core/import-options.js';
 /**
  * Assert that no circular dependencies exist between slices.
  *
- * Builds a directed dependency graph from import declarations,
+ * Builds a directed dependency graph from imports and re-exports,
  * then runs Tarjan's SCC algorithm to detect cycles.
  * Each cycle produces a violation listing the cycle path.
  *
@@ -13,10 +14,82 @@ import type { Slice } from '../models/slice.js';
  *   .should().beFreeOfCycles()
  *   .check()
  */
-export declare function beFreeOfCycles(): Condition<Slice>;
+/**
+ * `canonicalizeCycle` lived here, and sorting replaced it — bug 0056.
+ *
+ * It rotated an SCC to start at its lexicographically smallest member, for a real reason:
+ * Tarjan emits membership in traversal order, traversal follows the file walk, and the same
+ * cycle therefore had two identities on two machines. That is the concern
+ * [ts-archunit bug 0010](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0010-violation-identity-embeds-absolute-paths.md) introduced
+ * the `identity` field for — the original docstring cited it here, a little loosely, since
+ * 0010 itself is about absolute paths rather than about cycles.
+ *
+ * Rotation was necessary and **not sufficient**, and the reason is in its own docstring's
+ * final claim — *"Direction is NOT normalized, because `a -> b -> c -> a` and
+ * `a -> c -> b -> a` traverse different edges and are genuinely different cycles"*. That
+ * premise requires the array to be an edge-ordered PATH. It is not, for any component of
+ * three or more: measured, a real ring `a→b→c→d→a` came out as `a -> d -> c -> b -> a`,
+ * every arrow reversed. So the preserved "direction" was information about the traversal,
+ * not about the graph — and reordering two imports moved the element from `[a, c, b]` to
+ * `[a, b, c]`, reddening CI on a cosmetic edit.
+ *
+ * Sorting subsumes rotation for a set and adds the missing half. If a future change
+ * recovers a REAL path (bug 0055's fuller fix), direction becomes genuine information
+ * again — and then the right shape is a sorted member set for the identity with the path
+ * carried in the message, not a return to rotation.
+ *
+ * **`identity`/`element` moved off the member set entirely — plan 0104.** One violation
+ * per SCC (keyed by the sorted member set above) let `.excluding()` waive a whole tangled
+ * component with one pattern, so a brand-new edge between two already-waived members was
+ * silently absorbed — a second, doubly fail-open bug in the same family. Each internal
+ * edge of the component now gets its own violation, `identity`, and `element`
+ * (`cycle-edge::${from}->${to}`, `${from} -> ${to}`) — every such edge provably lies on
+ * some cycle, because the component's own connectivity supplies a return path. The sorted
+ * `members` set computed above still exists and is still load-bearing: it now serves the
+ * MESSAGE's "part of a cycle with: ..." context only, not identity or element.
+ */
+/**
+ * Every slice must be free of dependency cycles.
+ *
+ * **The graph counts eager static dependencies: `import` declarations AND
+ * re-exports.** Since v0.48.0 `export { x } from './b.js'` and `export * from
+ * './b.js'` are edges — they emit an import of the module, so it is evaluated — which
+ * means a **barrel cycle** (`a → barrel → a`) is detected. It was not before v0.48.0,
+ * and that was the commonest cycle shape there is.
+ *
+ * Not counted, each for a reason: **dynamic `import()`** (lazy, so it cannot deadlock
+ * initialization, and it is usually the deliberate *fix* for a cycle), **`require()`**
+ * (CJS; this is an ESM-only package), and **type positions** like
+ * `type X = import('./b.js').Y` (erased).
+ *
+ * Type-only imports and re-exports are dropped by default — see `ignoreTypeImports`
+ * below, and note the default differs from `notDependOn`/`respectLayerOrder` on
+ * purpose: a cycle asks whether the module is *evaluated*, those ask whether the code
+ * is *coupled*.
+ *
+ * **This docstring said the opposite until v0.49.1.** It described the re-export
+ * blindness as permanent, and it argued for its own importance on the ground that "this
+ * docstring is read when the rule fails, and a changelog is read once" — then v0.48.0
+ * updated the changelog and left this text standing, along with the same claim in two
+ * shipped preset `because` strings that are **printed inside every finding**. Found by
+ * review, not by the suite; nothing pins prose against behaviour.
+ */
+export declare function beFreeOfCycles(options?: ImportOptions): Condition<Slice>;
 /**
  * Assert that slices respect a layered dependency order.
  *
+ * **Which edges count:** every kind `notImportFrom()` and `onlyImportFrom()` count — plain
+ * imports, re-exports, `import('…')` and `type X = import('…').Y` — because this is a
+ * **coupling** question and a lazy import of a forbidden slice is still a forbidden
+ * dependency. `require()` is not counted (ESM-only package, ADR-004). Contrast
+ * `beFreeOfCycles`, which counts only the eager kinds because a cycle is a deadlock in
+ * initialization order.
+ *
+ * Stated here rather than only in `docs/slices.md` because this docstring is what an IDE
+ * and an agent read. The same omission stood from v0.48.0 to v0.49.1 and nothing pinned
+ * prose against behaviour then either
+ * ([ts-archunit bug 0059](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0059-slice-conditions-and-module-conditions-disagree-about-a-dependency.md)).
+ *
  * Given layers ['presentation', 'application', 'persistence', 'domain'],
  * layer N may depend on layers N+1, N+2, ... but NOT on layers N-1, N-2, ...
  * That is, dependencies must flow downward (toward higher indices) only.
@@ -31,10 +104,20 @@ export declare function beFreeOfCycles(): Condition<Slice>;
  *   .should().respectLayerOrder('presentation', 'application', 'persistence', 'domain')
  *   .check()
  */
+export declare function respectLayerOrder(layers: string[], options: ImportOptions): Condition<Slice>;
 export declare function respectLayerOrder(...layers: string[]): Condition<Slice>;
 /**
  * Assert that no slice depends on any of the listed slices.
  *
+ * **Which edges count:** every kind `notImportFrom()` and `onlyImportFrom()` count — plain
+ * imports, re-exports, `import('…')` and `type X = import('…').Y` — because this is a
+ * **coupling** question: a lazy import of a forbidden slice is still a forbidden dependency.
+ * `require()` is not counted (ESM-only, ADR-004). Contrast `beFreeOfCycles`, which counts
+ * only the eager kinds because a cycle is a deadlock in initialization order. Dynamic and
+ * type-expression edges were invisible here until
+ * [ts-archunit bug 0059](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0059-slice-conditions-and-module-conditions-disagree-about-a-dependency.md);
+ * this note exists because that docstring said nothing either way.
+ *
  * Use for explicit isolation rules, e.g., "no slice may depend on legacy".
  *
  * @param forbiddenSlices - Names of slices that must not be depended upon
@@ -45,5 +128,6 @@ export declare function respectLayerOrder(...layers: string[]): Condition<Slice>
  *   .should().notDependOn('legacy', 'deprecated')
  *   .check()
  */
+export declare function notDependOn(forbiddenSlices: string[], options: ImportOptions): Condition<Slice>;
 export declare function notDependOn(...forbiddenSlices: string[]): Condition<Slice>;
 //# sourceMappingURL=slice.d.ts.map

package/dist/conditions/slice.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"slice.d.ts","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAEnE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAQ/C;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,IAAI,SAAS,CAAC,KAAK,CAAC,CAmDjD;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAsCvE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,GAAG,eAAe,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CA6B1E"}
+{"version":3,"file":"slice.d.ts","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAEnE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAC/C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAQ9D;;;;;;;;;;;;GAYG;AACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,cAAc,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAwIxE;AAoDD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AAC7F,wBAAgB,iBAAiB,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AAmDxE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,WAAW,CAAC,eAAe,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AAChG,wBAAgB,WAAW,CAAC,GAAG,eAAe,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA"}

package/dist/conditions/slice.js

@@ -1,9 +1,12 @@
-import { buildSliceDependencyGraph, buildFileToSliceMap, findSliceDependencyDetails, } from '../helpers/slice-graph.js';
+import { splitGlobArgs } from '../core/import-options.js';
+import { edgeDiscriminator, edgeVerb } from '../core/module-edges.js';
+import { sliceGraph, buildFileToSliceMap } from '../helpers/slice-graph.js';
 import { tarjanSCC } from '../helpers/tarjan.js';
+import { byCodepoint } from '@nielspeter/eess';
 /**
  * Assert that no circular dependencies exist between slices.
  *
- * Builds a directed dependency graph from import declarations,
+ * Builds a directed dependency graph from imports and re-exports,
  * then runs Tarjan's SCC algorithm to detect cycles.
  * Each cycle produces a violation listing the cycle path.
  *
@@ -13,12 +16,89 @@ import { tarjanSCC } from '../helpers/tarjan.js';
  *   .should().beFreeOfCycles()
  *   .check()
  */
-export function beFreeOfCycles() {
+/**
+ * `canonicalizeCycle` lived here, and sorting replaced it — bug 0056.
+ *
+ * It rotated an SCC to start at its lexicographically smallest member, for a real reason:
+ * Tarjan emits membership in traversal order, traversal follows the file walk, and the same
+ * cycle therefore had two identities on two machines. That is the concern
+ * [ts-archunit bug 0010](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0010-violation-identity-embeds-absolute-paths.md) introduced
+ * the `identity` field for — the original docstring cited it here, a little loosely, since
+ * 0010 itself is about absolute paths rather than about cycles.
+ *
+ * Rotation was necessary and **not sufficient**, and the reason is in its own docstring's
+ * final claim — *"Direction is NOT normalized, because `a -> b -> c -> a` and
+ * `a -> c -> b -> a` traverse different edges and are genuinely different cycles"*. That
+ * premise requires the array to be an edge-ordered PATH. It is not, for any component of
+ * three or more: measured, a real ring `a→b→c→d→a` came out as `a -> d -> c -> b -> a`,
+ * every arrow reversed. So the preserved "direction" was information about the traversal,
+ * not about the graph — and reordering two imports moved the element from `[a, c, b]` to
+ * `[a, b, c]`, reddening CI on a cosmetic edit.
+ *
+ * Sorting subsumes rotation for a set and adds the missing half. If a future change
+ * recovers a REAL path (bug 0055's fuller fix), direction becomes genuine information
+ * again — and then the right shape is a sorted member set for the identity with the path
+ * carried in the message, not a return to rotation.
+ *
+ * **`identity`/`element` moved off the member set entirely — plan 0104.** One violation
+ * per SCC (keyed by the sorted member set above) let `.excluding()` waive a whole tangled
+ * component with one pattern, so a brand-new edge between two already-waived members was
+ * silently absorbed — a second, doubly fail-open bug in the same family. Each internal
+ * edge of the component now gets its own violation, `identity`, and `element`
+ * (`cycle-edge::${from}->${to}`, `${from} -> ${to}`) — every such edge provably lies on
+ * some cycle, because the component's own connectivity supplies a return path. The sorted
+ * `members` set computed above still exists and is still load-bearing: it now serves the
+ * MESSAGE's "part of a cycle with: ..." context only, not identity or element.
+ */
+/**
+ * Every slice must be free of dependency cycles.
+ *
+ * **The graph counts eager static dependencies: `import` declarations AND
+ * re-exports.** Since v0.48.0 `export { x } from './b.js'` and `export * from
+ * './b.js'` are edges — they emit an import of the module, so it is evaluated — which
+ * means a **barrel cycle** (`a → barrel → a`) is detected. It was not before v0.48.0,
+ * and that was the commonest cycle shape there is.
+ *
+ * Not counted, each for a reason: **dynamic `import()`** (lazy, so it cannot deadlock
+ * initialization, and it is usually the deliberate *fix* for a cycle), **`require()`**
+ * (CJS; this is an ESM-only package), and **type positions** like
+ * `type X = import('./b.js').Y` (erased).
+ *
+ * Type-only imports and re-exports are dropped by default — see `ignoreTypeImports`
+ * below, and note the default differs from `notDependOn`/`respectLayerOrder` on
+ * purpose: a cycle asks whether the module is *evaluated*, those ask whether the code
+ * is *coupled*.
+ *
+ * **This docstring said the opposite until v0.49.1.** It described the re-export
+ * blindness as permanent, and it argued for its own importance on the ground that "this
+ * docstring is read when the rule fails, and a changelog is read once" — then v0.48.0
+ * updated the changelog and left this text standing, along with the same claim in two
+ * shipped preset `because` strings that are **printed inside every finding**. Found by
+ * review, not by the suite; nothing pins prose against behaviour.
+ */
+export function beFreeOfCycles(options) {
+    // Resolved PER FIELD, once, and passed down as a complete object.
+    //
+    // This was a whole-object default — `options: ImportOptions = { ignoreTypeImports: true }`
+    // — while the read downstream was `options?.ignoreTypeImports === true`. So ANY object
+    // defeated it: `beFreeOfCycles({})` typechecks, because the field is optional, and
+    // silently gave the pre-0.47 graph. Measured: `()` reported no cycle and `({})`
+    // reported one, on a project whose only cross-slice edge was an `import type`.
+    //
+    // It gets worse with a second field, which is the point of a shared options bag:
+    // `beFreeOfCycles({ someOtherOption: true })` would revert a documented default while
+    // the caller's intent was unrelated. Bug 0057.
+    const resolved = { ignoreTypeImports: options?.ignoreTypeImports ?? true };
     return {
         description: 'be free of cycles',
         evaluate(slices, context) {
             const fileToSlice = buildFileToSliceMap(slices);
-            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            // 'module-request': a cycle is a deadlock in module-initialization order, so
+            // what matters is whether the target is EVALUATED, not whether the bindings are
+            // type-level. Under `verbatimModuleSyntax`, `import { type X } from 's'` emits
+            // `import {} from 's'` and can close a cycle (plan 0087).
+            const graph = sliceGraph(slices, fileToSlice, resolved, 'module-request');
+            const edges = graph.edges;
             // Map slice names to indices for Tarjan's
             const sliceNames = slices.map((s) => s.name);
             const nameToIndex = new Map(sliceNames.map((name, i) => [name, i]));
@@ -39,49 +119,154 @@ export function beFreeOfCycles() {
             const sccs = tarjanSCC(slices.length, adjacency);
             const violations = [];
             for (const scc of sccs) {
-                const cycleNames = scc.map((i) => sliceNames[i]);
-                const cyclePath = [...cycleNames, cycleNames[0]].join(' -> ');
-                // Find one concrete file causing the cycle for the violation location
-                const fromSlice = cycleNames[0] ?? '';
-                const toSlice = cycleNames[1] ?? fromSlice;
-                const details = findSliceDependencyDetails(slices, fromSlice, toSlice, fileToSlice);
-                const firstDetail = details[0];
-                violations.push({
-                    rule: context.rule,
-                    element: `[${cycleNames.join(', ')}]`,
-                    file: firstDetail ? firstDetail.sourceFile.getFilePath() : 'unknown',
-                    line: firstDetail ? firstDetail.importLine : 0,
-                    message: `Cycle detected: ${cyclePath}`,
-                    because: context.because,
-                });
+                // **SORTED, not rotated** — bug 0056. `tarjanSCC` returns MEMBERSHIP in DFS-pop
+                // order, so the sequence is an artefact of traversal: reordering two imports moved
+                // the element from `[a, c, b]` to `[a, b, c]`, which reddened CI on a cosmetic edit
+                // and printed "it may be stale after a rename" about a rename that never happened.
+                // Unchanged by plan 0104: `members`/sorting now serves the MESSAGE only — identity
+                // and element moved to the edge, below — but the order-independence this sort buys
+                // still matters there too (`internalEdges` is itself sorted the same way).
+                const members = [...new Set(scc.map((i) => sliceNames[i] ?? ''))].sort(byCodepoint);
+                const inCycle = new Set(members);
+                // **Every internal edge, not just one** — plan 0104. Provably meaningful, not a
+                // heuristic: for a strongly connected component, any edge `u -> v` where both `u`
+                // and `v` are members lies on SOME cycle, because the component's own connectivity
+                // supplies a return path `v -> ... -> u`. So every edge this filter finds is a real,
+                // substantiated cycle-membership fact — bug 0055 already established there is no
+                // single, order-independent answer to "the" closing edge, so this reports the
+                // provable superset instead of guessing at one. SORTED for the same portability
+                // reason the old single-`realEdge` selection needed (bug 0010): `edges` is built by
+                // walking the file list, so an unsorted iteration order would make which edge is
+                // "first" — and therefore, before this plan, the only reported one — depend on
+                // filesystem order.
+                // INVARIANT (review: architect): every `scc` reaching this point has 2+
+                // members (`tarjanSCC` only returns components of size > 1) and `adjacency`
+                // is built from the same `edges` array this filter reads, so `internalEdges`
+                // is never empty here — a size-2+ strongly connected component always has at
+                // least one internal edge by construction. Not asserted at runtime: an empty
+                // result would silently emit zero violations for a real cycle, so if this
+                // invariant is ever wrong it fails open rather than throwing.
+                const internalEdges = edges
+                    .filter((e) => inCycle.has(e.from) && inCycle.has(e.to))
+                    .sort((a, b) => byCodepoint(a.from, b.from) || byCodepoint(a.to, b.to));
+                for (const edge of internalEdges) {
+                    // Through the graph, so the question and the options cannot diverge from the
+                    // ones it was built with. Passing 'type-bindings' here used to be writable, and
+                    // it turned this finding into "dynamically imports ... at line 1" — pointing the
+                    // reader at the construct that FIXES cycles. Called once per edge rather than
+                    // once per SCC: each call walks `fromSlice.files`, which is cheap — the AST work
+                    // underneath is cached per file by `edgesOf` (module-edges.ts) regardless of call
+                    // count (Out of scope: performance, reasoned not benchmarked).
+                    const details = graph.detailsFor(edge.from, edge.to);
+                    // Same reason as the old single-edge lookup, one level down: `details` follows
+                    // the slice's file order, and each edge computes its OWN site — never a hoisted
+                    // one shared across edges in the same SCC, which would silently reintroduce a
+                    // shared-location regression this plan's own test inventory guards against.
+                    const site = [...details].sort((a, b) => byCodepoint(a.sourceFile.getFilePath(), b.sourceFile.getFilePath()) ||
+                        a.importLine - b.importLine)[0];
+                    violations.push({
+                        rule: context.rule,
+                        // The edge ITSELF, not the component — plan 0104. `.excluding('helpers -> builders')`
+                        // now names exactly this fact and nothing else in the component. Deliberately
+                        // NOT decorated with the member list: folding membership in here would move
+                        // every edge's element whenever the component's shape changes, even for edges
+                        // that did not themselves change — see plan 0104's "Why per-edge" for the case
+                        // analysis this avoids.
+                        element: `${edge.from} -> ${edge.to}`,
+                        file: site ? site.sourceFile.getFilePath() : 'unknown',
+                        line: site ? site.importLine : 0,
+                        // A pure function of the two slice names — no path, no line, no message text.
+                        // Distinct prefix from the old `cycle::` scheme (bug 0056) so an old-format
+                        // baseline entry cannot accidentally collide with a new-format one — see
+                        // `HASH_VERSION`'s bump in `src/helpers/baseline.ts`.
+                        identity: `cycle-edge::${edge.from}->${edge.to}`,
+                        // "Cycle detected" stays the leading words —
+                        // tests/presets/cycle-claims-match-behaviour.test.ts filters on
+                        // `message.startsWith('Cycle detected')` and must keep matching. The named
+                        // edge is a real, substantiated fact for THIS finding (not an "e.g." example of
+                        // the component, as the pre-plan-0104 message had it) — every edge pushed here
+                        // provably closes some cycle, per the proof above.
+                        message: site
+                            ? `Cycle detected: "${edge.from}" ${edgeVerb(site.edge.kind)} "${edge.to}" at ` +
+                                `${site.sourceFile.getBaseName()}:${String(site.importLine)}, part of a cycle with: ` +
+                                `${members.join(', ')}`
+                            : // Unreachable given `graph`'s options/question binding — kept for the same
+                                // defensive reason the pre-plan-0104 code kept its own `'unknown'`/`0`
+                                // fallback.
+                                `Cycle detected: "${edge.from}" depends on "${edge.to}", part of a cycle with: ` +
+                                    `${members.join(', ')} (location unknown)`,
+                        because: context.because,
+                    });
+                }
             }
             return violations;
         },
     };
 }
 /**
- * Assert that slices respect a layered dependency order.
- *
- * Given layers ['presentation', 'application', 'persistence', 'domain'],
- * layer N may depend on layers N+1, N+2, ... but NOT on layers N-1, N-2, ...
- * That is, dependencies must flow downward (toward higher indices) only.
+ * A dependency site's identity, following the scheme the dependency conditions already use.
  *
- * A layer not present in the slice set is silently skipped.
+ * `basename::kind::specifier::sorted-names`, prefixed with the slice pair — and
+ * **deliberately no line number**, which is the correction plan 0088's own sketch needed.
+ * `ArchViolation.identity` exists precisely to survive "a coordinate — `at line 12` moves
+ * when anything above it is edited", and `src/conditions/dependency.ts` omits the line for
+ * that reason. Copying the scheme rather than inventing a second one is the point: these
+ * two families report the same underlying edges.
  *
- * @param layers - Ordered layer names, from highest (e.g., UI) to lowest (e.g., domain)
- *
- * @example
- * slices(project)
- *   .assignedFrom(layers)
- *   .should().respectLayerOrder('presentation', 'application', 'persistence', 'domain')
- *   .check()
+ * Why this distinguishes what a count could not: a barrel with thirty re-exports into one
+ * forbidden slice previously produced thirty findings sharing ONE hash, because `element`
+ * was the basename and the message named only the slice pair — so one baseline entry
+ * accepted all thirty. Each edge carries different `names`, so each site is now its own
+ * finding. (Measured before the fix: 3 sites, 3 lines, 1 hash.)
  */
-export function respectLayerOrder(...layers) {
+function siteIdentity(from, to, site) {
+    return [
+        `${from}->${to}`,
+        // The FULL PATH, not the basename — and this is a deliberate divergence from the
+        // dependency family, whose scheme this otherwise copies.
+        //
+        // `getBaseName()` collides, measured: two sibling feature folders each with an
+        // `index.ts` re-exporting the same name from the same specifier produce one identity
+        // for two distinct violations — so one baseline entry accepts both. That is the very
+        // defect plan 0088 was written to fix, in a different shape, and it is the commonest
+        // layout there is. `src/conditions/dependency.ts` has the same collision
+        // ([ts-archunit bug 0063](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0063-a-dependency-identity-collides-across-files-sharing-a-basename.md)),
+        // which is how it got here: the shape was right to copy, this component was not.
+        //
+        // An absolute path is safe here — `hashViolation` normalises the repository root out of
+        // identity text (`src/core/identity-root.ts`), which is what makes a baseline portable
+        // between a laptop and CI.
+        site.sourceFile.getFilePath(),
+        site.edge.kind,
+        site.edge.specifier,
+        // Names when the edge carries them, the source-order ordinal when it does not — see
+        // `edgeDiscriminator`.
+        //
+        // This comment used to say the gap was unreachable here, on the reasoning that before
+        // bug 0059 the family only saw `import` and `reexport`, "both of which carry names".
+        // That was false: it is the SPELLING that carries names, not the kind. Measured on
+        // `main` through `notDependOn`, two default imports of one module from one file gave
+        // two findings and ONE identity, as did two bare side-effect imports. The collision
+        // was live in this family, not merely reachable — which is why the fix is in
+        // `edgeDiscriminator` where both families read it, rather than in either caller.
+        edgeDiscriminator(site.edge),
+    ].join('::');
+}
+export function respectLayerOrder(...args) {
+    const { globs: layers, options } = splitGlobArgs(args);
+    // `?? false` explicitly, not "undefined is falsy". Layering is a COUPLING question, so
+    // type edges count by default — the opposite of `beFreeOfCycles`, and stated so a
+    // future default change is a one-line edit rather than an audit (bug 0057).
+    const resolved = { ignoreTypeImports: options?.ignoreTypeImports ?? false };
     return {
         description: `respect layer order [${layers.join(' -> ')}]`,
         evaluate(slices, context) {
             const fileToSlice = buildFileToSliceMap(slices);
-            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            // 'type-bindings': layering and isolation are about COUPLING, so
+            // `ignoreTypeImports` here means what it means on `dependOn`/`notImportFrom` —
+            // ignore type-level references. Deliberately NOT the cycle question (plan 0087).
+            const graph = sliceGraph(slices, fileToSlice, resolved, 'type-bindings');
+            const edges = graph.edges;
             // Map layer names to their position (lower index = higher layer)
             const layerIndex = new Map(layers.map((name, i) => [name, i]));
             const violations = [];
@@ -93,14 +278,15 @@ export function respectLayerOrder(...layers) {
                     continue;
                 // Violation: depending on a higher layer (lower index)
                 if (toIdx < fromIdx) {
-                    const details = findSliceDependencyDetails(slices, edge.from, edge.to, fileToSlice);
+                    const details = graph.detailsFor(edge.from, edge.to);
                     for (const detail of details) {
                         violations.push({
                             rule: context.rule,
                             element: detail.sourceFile.getBaseName(),
                             file: detail.sourceFile.getFilePath(),
                             line: detail.importLine,
-                            message: `Layer "${edge.from}" depends on higher layer "${edge.to}" (allowed: ${layers.slice(fromIdx + 1).join(', ') || 'none'})`,
+                            identity: siteIdentity(edge.from, edge.to, detail),
+                            message: `Layer "${edge.from}" ${edgeVerb(detail.edge.kind)} higher layer "${edge.to}" (allowed: ${layers.slice(fromIdx + 1).join(', ') || 'none'})`,
                             because: context.because,
                         });
                     }
@@ -110,37 +296,32 @@ export function respectLayerOrder(...layers) {
         },
     };
 }
-/**
- * Assert that no slice depends on any of the listed slices.
- *
- * Use for explicit isolation rules, e.g., "no slice may depend on legacy".
- *
- * @param forbiddenSlices - Names of slices that must not be depended upon
- *
- * @example
- * slices(project)
- *   .matching('src/features/*\/')
- *   .should().notDependOn('legacy', 'deprecated')
- *   .check()
- */
-export function notDependOn(...forbiddenSlices) {
+export function notDependOn(...args) {
+    const { globs: forbiddenSlices, options } = splitGlobArgs(args);
+    // `?? false` — see `respectLayerOrder` above. Isolation is a coupling question.
+    const resolved = { ignoreTypeImports: options?.ignoreTypeImports ?? false };
     const forbiddenSet = new Set(forbiddenSlices);
     return {
         description: `not depend on [${forbiddenSlices.join(', ')}]`,
         evaluate(slices, context) {
             const fileToSlice = buildFileToSliceMap(slices);
-            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            // 'type-bindings': layering and isolation are about COUPLING, so
+            // `ignoreTypeImports` here means what it means on `dependOn`/`notImportFrom` —
+            // ignore type-level references. Deliberately NOT the cycle question (plan 0087).
+            const graph = sliceGraph(slices, fileToSlice, resolved, 'type-bindings');
+            const edges = graph.edges;
             const violations = [];
             for (const edge of edges) {
                 if (forbiddenSet.has(edge.to)) {
-                    const details = findSliceDependencyDetails(slices, edge.from, edge.to, fileToSlice);
+                    const details = graph.detailsFor(edge.from, edge.to);
                     for (const detail of details) {
                         violations.push({
                             rule: context.rule,
                             element: detail.sourceFile.getBaseName(),
                             file: detail.sourceFile.getFilePath(),
                             line: detail.importLine,
-                            message: `Slice "${edge.from}" depends on forbidden slice "${edge.to}"`,
+                            identity: siteIdentity(edge.from, edge.to, detail),
+                            message: `Slice "${edge.from}" ${edgeVerb(detail.edge.kind)} forbidden slice "${edge.to}"`,
                             because: context.because,
                         });
                     }

package/dist/conditions/slice.js.map

@@ -1 +1 @@
-{"version":3,"file":"slice.js","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,yBAAyB,EACzB,mBAAmB,EACnB,0BAA0B,GAC3B,MAAM,2BAA2B,CAAA;AAClC,OAAO,EAAE,SAAS,EAAsB,MAAM,sBAAsB,CAAA;AAEpE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc;IAC5B,OAAO;QACL,WAAW,EAAE,mBAAmB;QAChC,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,0CAA0C;YAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YAC5C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAEnE,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;YAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACtC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACvC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBACjC,CAAC;YACH,CAAC;YAED,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;YAEhD,MAAM,UAAU,GAAoB,EAAE,CAAA;YACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;gBAChD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAE7D,sEAAsE;gBACtE,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;gBACrC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;gBAC1C,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,CAAC,CAAA;gBACnF,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBAE9B,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,OAAO,CAAC,IAAI;oBAClB,OAAO,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;oBACrC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS;oBACpE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBAC9C,OAAO,EAAE,mBAAmB,SAAS,EAAE;oBACvC,OAAO,EAAE,OAAO,CAAC,OAAO;iBACzB,CAAC,CAAA;YACJ,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAG,MAAgB;IACnD,OAAO;QACL,WAAW,EAAE,wBAAwB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG;QAC3D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,iEAAiE;YACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAE9D,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAErC,wCAAwC;gBACxC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,uDAAuD;gBACvD,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAA;oBACnF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,8BAA8B,IAAI,CAAC,EAAE,eAAe,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;4BACjI,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,GAAG,eAAyB;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAA;IAC7C,OAAO;QACL,WAAW,EAAE,kBAAkB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QAC5D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC9B,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAA;oBACnF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,iCAAiC,IAAI,CAAC,EAAE,GAAG;4BACvE,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC"}
+{"version":3,"file":"slice.js","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAEzD,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AACrE,OAAO,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAA;AAC3E,OAAO,EAAE,SAAS,EAAsB,MAAM,sBAAsB,CAAA;AACpE,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAE9C;;;;;;;;;;;;GAYG;AACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,cAAc,CAAC,OAAuB;IACpD,kEAAkE;IAClE,EAAE;IACF,2FAA2F;IAC3F,uFAAuF;IACvF,mFAAmF;IACnF,gFAAgF;IAChF,+EAA+E;IAC/E,EAAE;IACF,iFAAiF;IACjF,sFAAsF;IACtF,+CAA+C;IAC/C,MAAM,QAAQ,GAAkB,EAAE,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,IAAI,IAAI,EAAE,CAAA;IACzF,OAAO;QACL,WAAW,EAAE,mBAAmB;QAChC,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,6EAA6E;YAC7E,gFAAgF;YAChF,+EAA+E;YAC/E,0DAA0D;YAC1D,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAA;YACzE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;YAEzB,0CAA0C;YAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YAC5C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAEnE,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;YAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACtC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACvC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBACjC,CAAC;YACH,CAAC;YAED,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;YAEhD,MAAM,UAAU,GAAoB,EAAE,CAAA;YACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,gFAAgF;gBAChF,mFAAmF;gBACnF,oFAAoF;gBACpF,mFAAmF;gBACnF,mFAAmF;gBACnF,mFAAmF;gBACnF,2EAA2E;gBAC3E,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;gBACnF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;gBAEhC,gFAAgF;gBAChF,kFAAkF;gBAClF,mFAAmF;gBACnF,qFAAqF;gBACrF,iFAAiF;gBACjF,8EAA8E;gBAC9E,gFAAgF;gBAChF,oFAAoF;gBACpF,iFAAiF;gBACjF,+EAA+E;gBAC/E,oBAAoB;gBACpB,wEAAwE;gBACxE,4EAA4E;gBAC5E,6EAA6E;gBAC7E,6EAA6E;gBAC7E,6EAA6E;gBAC7E,0EAA0E;gBAC1E,8DAA8D;gBAC9D,MAAM,aAAa,GAAG,KAAK;qBACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;qBACvD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAEzE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;oBACjC,6EAA6E;oBAC7E,gFAAgF;oBAChF,iFAAiF;oBACjF,8EAA8E;oBAC9E,iFAAiF;oBACjF,kFAAkF;oBAClF,+DAA+D;oBAC/D,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;oBACpD,+EAA+E;oBAC/E,gFAAgF;oBAChF,8EAA8E;oBAC9E,4EAA4E;oBAC5E,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC;wBACnE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAC9B,CAAC,CAAC,CAAC,CAAA;oBAEJ,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,OAAO,CAAC,IAAI;wBAClB,sFAAsF;wBACtF,8EAA8E;wBAC9E,4EAA4E;wBAC5E,8EAA8E;wBAC9E,+EAA+E;wBAC/E,wBAAwB;wBACxB,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,EAAE;wBACrC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS;wBACtD,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBAChC,8EAA8E;wBAC9E,4EAA4E;wBAC5E,yEAAyE;wBACzE,sDAAsD;wBACtD,QAAQ,EAAE,eAAe,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE;wBAChD,6CAA6C;wBAC7C,gEAAgE;wBAChE,2EAA2E;wBAC3E,gFAAgF;wBAChF,+EAA+E;wBAC/E,mDAAmD;wBACnD,OAAO,EAAE,IAAI;4BACX,CAAC,CAAC,oBAAoB,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,OAAO;gCAC7E,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,0BAA0B;gCACrF,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;4BACzB,CAAC,CAAC,2EAA2E;gCAC3E,uEAAuE;gCACvE,YAAY;gCACZ,oBAAoB,IAAI,CAAC,IAAI,iBAAiB,IAAI,CAAC,EAAE,2BAA2B;oCAChF,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB;wBAC9C,OAAO,EAAE,OAAO,CAAC,OAAO;qBACzB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,YAAY,CAAC,IAAY,EAAE,EAAU,EAAE,IAAyB;IACvE,OAAO;QACL,GAAG,IAAI,KAAK,EAAE,EAAE;QAChB,iFAAiF;QACjF,yDAAyD;QACzD,EAAE;QACF,+EAA+E;QAC/E,qFAAqF;QACrF,qFAAqF;QACrF,qFAAqF;QACrF,yEAAyE;QACzE,mKAAmK;QACnK,iFAAiF;QACjF,EAAE;QACF,wFAAwF;QACxF,uFAAuF;QACvF,2BAA2B;QAC3B,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE;QAC7B,IAAI,CAAC,IAAI,CAAC,IAAI;QACd,IAAI,CAAC,IAAI,CAAC,SAAS;QACnB,oFAAoF;QACpF,uBAAuB;QACvB,EAAE;QACF,sFAAsF;QACtF,qFAAqF;QACrF,mFAAmF;QACnF,qFAAqF;QACrF,oFAAoF;QACpF,6EAA6E;QAC7E,iFAAiF;QACjF,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC;KAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACd,CAAC;AAiCD,MAAM,UAAU,iBAAiB,CAAC,GAAG,IAA0C;IAC7E,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;IACtD,uFAAuF;IACvF,kFAAkF;IAClF,4EAA4E;IAC5E,MAAM,QAAQ,GAAkB,EAAE,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,IAAI,KAAK,EAAE,CAAA;IAC1F,OAAO;QACL,WAAW,EAAE,wBAAwB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG;QAC3D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,iEAAiE;YACjE,+EAA+E;YAC/E,iFAAiF;YACjF,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAA;YACxE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;YAEzB,iEAAiE;YACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAE9D,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAErC,wCAAwC;gBACxC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,uDAAuD;gBACvD,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;oBACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,QAAQ,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC;4BAClD,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,EAAE,eAAe,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;4BACpJ,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AA0BD,MAAM,UAAU,WAAW,CAAC,GAAG,IAA0C;IACvE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;IAC/D,gFAAgF;IAChF,MAAM,QAAQ,GAAkB,EAAE,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,IAAI,KAAK,EAAE,CAAA;IAC1F,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAA;IAC7C,OAAO;QACL,WAAW,EAAE,kBAAkB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QAC5D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,iEAAiE;YACjE,+EAA+E;YAC/E,iFAAiF;YACjF,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAA;YACxE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;YAEzB,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC9B,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;oBACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,QAAQ,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC;4BAClD,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,GAAG;4BAC1F,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/conditions/structural.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"structural.d.ts","sourceRoot":"","sources":["../../src/conditions/structural.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AAE/B,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAKnE;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAQvE;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAezE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAM5E;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAyBzD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CASvD"}
+{"version":3,"file":"structural.d.ts","sourceRoot":"","sources":["../../src/conditions/structural.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AAE/B,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAOnE;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAcvE;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAgBzE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAM5E;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAyBzD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAavD"}

package/dist/conditions/structural.js

@@ -2,6 +2,8 @@ import { Node } from 'ts-morph';
 import picomatch from 'picomatch';
 import { createViolation, getElementFile, getElementName } from '../core/violation.js';
 import { elementCondition } from './helpers.js';
+import { globNode } from '@nielspeter/eess';
+import { marksAssertsCardinality } from '@nielspeter/eess';
 /**
  * Elements must reside in a file matching the glob pattern.
  *
@@ -13,7 +15,13 @@ import { elementCondition } from './helpers.js';
  */
 export function resideInFile(glob) {
     const isMatch = picomatch(glob);
-    return elementCondition(`reside in file matching '${glob}'`, (element) => isMatch(getElementFile(element)), (element) => `${getElementName(element)} resides in '${getElementFile(element)}' which does not match '${glob}'`);
+    return elementCondition(`reside in file matching '${glob}'`, (element) => isMatch(getElementFile(element)), (element) => `${getElementName(element)} resides in '${getElementFile(element)}' which does not match '${glob}'`, 
+    // The generic element twin of `function.ts`'s condition and of the
+    // `identity.ts:78` predicate — same absolute path, so the same kind. Plan
+    // 0073's table listed only the `function.ts` pair; these two are exported from
+    // `index.ts:86` and used by the class, module and type builders, so they were
+    // the more reachable half of the hole.
+    globNode({ glob, kind: 'file-path' }));
 }
 /**
  * Elements must reside in a folder matching the glob pattern.
@@ -35,7 +43,7 @@ export function resideInFolder(glob) {
         const filePath = getElementFile(element);
         const folder = filePath.substring(0, filePath.lastIndexOf('/'));
         return `${getElementName(element)} resides in folder '${folder}' which does not match '${glob}'`;
-    });
+    }, globNode({ glob, kind: 'parent-dir' }));
 }
 /**
  * Elements must have a name matching the regex pattern.
@@ -92,11 +100,15 @@ export function beExported() {
  *   .because('use shared parseOrder() utility instead')
  */
 export function notExist() {
-    return {
+    // Satisfied by an EMPTY selection — registered rather than tagged, because a
+    // symbol keyed on this object is readable off it and forgeable (bug 0050).
+    return marksAssertsCardinality({
         description: 'not exist',
+        // Zero subjects is this condition's PASSING state, so an empty selection
+        // and an unsatisfiable selector glob are both correct here (plan 0074).
         evaluate(elements, context) {
             return elements.map((element) => createViolation(element, `${getElementName(element)} should not exist`, context));
         },
-    };
+    });
 }
 //# sourceMappingURL=structural.js.map

package/dist/conditions/structural.js.map

@@ -1 +1 @@
-{"version":3,"file":"structural.js","sourceRoot":"","sources":["../../src/conditions/structural.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AAC/B,OAAO,SAAS,MAAM,WAAW,CAAA;AAGjC,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACtF,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAA;AAE/C;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAiB,IAAY;IACvD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC/B,OAAO,gBAAgB,CACrB,4BAA4B,IAAI,GAAG,EACnC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAC7C,CAAC,OAAO,EAAE,EAAE,CACV,GAAG,cAAc,CAAC,OAAO,CAAC,gBAAgB,cAAc,CAAC,OAAO,CAAC,2BAA2B,IAAI,GAAG,CACtG,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAiB,IAAY;IACzD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC/B,OAAO,gBAAgB,CACrB,8BAA8B,IAAI,GAAG,EACrC,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,OAAO,OAAO,CAAC,MAAM,CAAC,CAAA;IACxB,CAAC,EACD,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,uBAAuB,MAAM,2BAA2B,IAAI,GAAG,CAAA;IAClG,CAAC,CACF,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAiB,KAAa;IAC5D,OAAO,gBAAgB,CACrB,sBAAsB,MAAM,CAAC,KAAK,CAAC,EAAE,EACrC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAChD,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,cAAc,CAAC,OAAO,CAAC,kCAAkC,MAAM,CAAC,KAAK,CAAC,EAAE,CACzF,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU;IACxB,OAAO,gBAAgB,CACrB,aAAa,EACb,CAAC,OAAO,EAAE,EAAE;QACV,mDAAmD;QACnD,IACE,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC;YAChC,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC;YACpC,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC;YACpC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAC/B,CAAC;YACD,OAAO,OAAO,CAAC,UAAU,EAAE,CAAA;QAC7B,CAAC;QACD,uDAAuD;QACvD,IAAI,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAA;YACnD,IAAI,YAAY,EAAE,CAAC;gBACjB,OAAO,YAAY,CAAC,UAAU,EAAE,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC,EACD,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,cAAc,CAAC,OAAO,CAAC,kBAAkB,CAC1D,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,QAAQ;IACtB,OAAO;QACL,WAAW,EAAE,WAAW;QACxB,QAAQ,CAAC,QAAa,EAAE,OAAyB;YAC/C,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAC9B,eAAe,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,mBAAmB,EAAE,OAAO,CAAC,CACjF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC"}
+{"version":3,"file":"structural.js","sourceRoot":"","sources":["../../src/conditions/structural.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AAC/B,OAAO,SAAS,MAAM,WAAW,CAAA;AAGjC,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACtF,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AAC3C,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAA;AAE1D;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAiB,IAAY;IACvD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC/B,OAAO,gBAAgB,CACrB,4BAA4B,IAAI,GAAG,EACnC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAC7C,CAAC,OAAO,EAAE,EAAE,CACV,GAAG,cAAc,CAAC,OAAO,CAAC,gBAAgB,cAAc,CAAC,OAAO,CAAC,2BAA2B,IAAI,GAAG;IACrG,mEAAmE;IACnE,0EAA0E;IAC1E,+EAA+E;IAC/E,8EAA8E;IAC9E,uCAAuC;IACvC,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CACtC,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAiB,IAAY;IACzD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC/B,OAAO,gBAAgB,CACrB,8BAA8B,IAAI,GAAG,EACrC,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,OAAO,OAAO,CAAC,MAAM,CAAC,CAAA;IACxB,CAAC,EACD,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,uBAAuB,MAAM,2BAA2B,IAAI,GAAG,CAAA;IAClG,CAAC,EACD,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CACvC,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAiB,KAAa;IAC5D,OAAO,gBAAgB,CACrB,sBAAsB,MAAM,CAAC,KAAK,CAAC,EAAE,EACrC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAChD,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,cAAc,CAAC,OAAO,CAAC,kCAAkC,MAAM,CAAC,KAAK,CAAC,EAAE,CACzF,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU;IACxB,OAAO,gBAAgB,CACrB,aAAa,EACb,CAAC,OAAO,EAAE,EAAE;QACV,mDAAmD;QACnD,IACE,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC;YAChC,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC;YACpC,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC;YACpC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAC/B,CAAC;YACD,OAAO,OAAO,CAAC,UAAU,EAAE,CAAA;QAC7B,CAAC;QACD,uDAAuD;QACvD,IAAI,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAA;YACnD,IAAI,YAAY,EAAE,CAAC;gBACjB,OAAO,YAAY,CAAC,UAAU,EAAE,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC,EACD,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,cAAc,CAAC,OAAO,CAAC,kBAAkB,CAC1D,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,QAAQ;IACtB,6EAA6E;IAC7E,2EAA2E;IAC3E,OAAO,uBAAuB,CAAC;QAC7B,WAAW,EAAE,WAAW;QACxB,yEAAyE;QACzE,wEAAwE;QACxE,QAAQ,CAAC,QAAa,EAAE,OAAyB;YAC/C,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAC9B,eAAe,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,mBAAmB,EAAE,OAAO,CAAC,CACjF,CAAA;QACH,CAAC;KACF,CAAC,CAAA;AACJ,CAAC"}

package/dist/core/check-all.d.ts

@@ -0,0 +1,19 @@
+import type { RuleBuilderLike } from '@nielspeter/eess';
+import type { CheckOptions } from '@nielspeter/eess';
+/**
+ * Run an array of rules (e.g. a spread preset) and throw one aggregated
+ * `ArchRuleError` if any **error-severity** violation is found. Warn-severity
+ * violations are reported but never throw — the same severity contract as the
+ * CLI `check`. This is the test-file terminal for the returning form:
+ *
+ * ```ts
+ * checkAll(layeredArchitecture(p, opts))
+ * checkAll([...recommended(p), ...layeredArchitecture(p, opts)])
+ * ```
+ *
+ * Each builder's `.violations()` already carries its stamped severity
+ * (via `.asSeverity()`), so aggregation and severity are preserved across the
+ * whole array — one readable error listing every error-severity violation.
+ */
+export declare function checkAll(rules: RuleBuilderLike[], options?: CheckOptions): void;
+//# sourceMappingURL=check-all.d.ts.map

package/dist/core/check-all.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"check-all.d.ts","sourceRoot":"","sources":["../../src/core/check-all.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAiB,eAAe,EAAE,MAAM,kBAAkB,CAAA;AACtE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAA;AASpD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,IAAI,CAmF/E"}