@nielspeter/eess-ts 0.2.1 → 0.5.0

package/dist/helpers/slice-graph.d.ts

@@ -1,10 +1,12 @@
 import type { SourceFile } from 'ts-morph';
 import type { Slice } from '../models/slice.js';
+import type { ImportOptions } from '../core/import-options.js';
+import type { ModuleEdge } from '../core/module-edges.js';
 /**
  * An edge in the slice dependency graph.
- * Represents: a file in `from` imports a file in `to`.
+ * Represents: a file in `from` depends on a file in `to`.
  */
-export interface SliceEdge {
+interface SliceEdge {
     from: string;
     to: string;
 }
@@ -13,20 +15,110 @@ export interface SliceEdge {
  * Shared by buildSliceDependencyGraph and findSliceDependencyDetails.
  */
 export declare function buildFileToSliceMap(slices: Slice[]): Map<string, string>;
-export declare function buildSliceDependencyGraph(slices: Slice[], fileToSlice?: Map<string, string>): SliceEdge[];
+/**
+ * Which erasure question a condition is asking.
+ *
+ * Both live on this graph and they are **not the same question**, which only became
+ * visible when `ModuleEdge` learned to tell them apart
+ * ([ts-archunit plan 0087](https://github.com/nielspeter/ts-archunit/blob/main/plans/completed/0087-an-inline-type-import-still-requests-the-module.md)):
+ *
+ * - `'module-request'` — will importing this file cause the target to be *evaluated*?
+ *   That is what a **cycle** is: a deadlock in module-initialization order. Used by
+ *   `beFreeOfCycles`.
+ * - `'type-bindings'` — does this file *reference* the target's types? That is
+ *   **coupling**, which is what `notDependOn` and `respectLayerOrder` are about, and
+ *   it matches what `dependOn`/`notImportFrom` have always meant by
+ *   `ignoreTypeImports`.
+ *
+ * They diverge for exactly two spellings, and only under `verbatimModuleSyntax: true`:
+ * `import { type X } from 's'` and `export { type X } from 's'` emit `import {} from 's'`
+ * / `export {} from 's'`. Those are eager edges — so a cycle question must count them —
+ * while the bindings crossing them are still purely type-level, so a coupling question
+ * told to ignore type imports must not.
+ *
+ * Getting this backwards is a false positive on one side and a false negative on the
+ * other, in the same release.
+ */
+type ErasureQuestion = 'module-request' | 'type-bindings';
+/**
+ * Build a directed dependency graph between slices.
+ *
+ * For each file in each slice, resolve its dependencies. If the target file
+ * belongs to a different slice, add a directed edge from the depending slice
+ * to the depended-upon slice.
+ *
+ * @param slices - The resolved slices
+ * @param fileToSlice - Pre-built file-to-slice map (optional, built internally if not provided)
+ * @param options - `ignoreTypeImports` drops edges that are erased at compile time
+ * @returns Unique directed edges between slices
+ */
+/**
+ * A built graph, and the only way to ask it for the sites behind one of its edges.
+ *
+ * `question` and `options` must be the same for the graph and for the details walk, and
+ * for a while they were four literals across two call sites kept in step by convention.
+ * The failure is silent and specific: the conditions emit **one violation per detail**, so
+ * a graph that counts an edge the details walk cannot see reports nothing at all, and a
+ * details walk that counts more reports the wrong site.
+ *
+ * A review measured the live half of that. Passing `'type-bindings'` to `beFreeOfCycles`'s
+ * details call — the one mutation of eight that stayed **green** — turned the cycle finding
+ * into *"feature dynamically imports legacy at index.ts:1"*, pointing the reader at the one
+ * construct that BREAKS cycles and telling them to remove it. ADR-009 rule 2, from a
+ * mismatch no test could see.
+ *
+ * So the pairing is no longer expressible: `detailsFor` reads what the graph was built
+ * with. This also retires the older `options`-mismatch hazard the docstrings managed with
+ * prose.
+ */
+interface SliceGraph {
+    readonly edges: SliceEdge[];
+    detailsFor(fromSliceName: string, toSliceName: string): SliceDependencySite[];
+}
+/**
+ * Build the graph, and bind the details walk to the same question and options.
+ *
+ * Prefer this over the two loose functions; they remain exported because
+ * `tests/` and the reverse-graph work call them directly with an explicit question.
+ */
+export declare function sliceGraph(slices: Slice[], fileToSlice: Map<string, string> | undefined, options: ImportOptions | undefined, question: ErasureQuestion): SliceGraph;
 /**
  * Find which specific files cause a dependency from one slice to another.
  * Used for detailed violation messages.
  *
+ * **`options` must be the options the graph was built with**, and that is not a style
+ * preference. `respectLayerOrder` and `notDependOn` push one violation *per detail*,
+ * so a graph that counts an edge this function cannot see finds the dependency and
+ * reports **nothing** — a false green produced by two filters disagreeing rather than
+ * by either one being absent. `beFreeOfCycles` fails differently and more quietly: it
+ * still reports the cycle, at `unknown:0`, which is a finding whose remedy nobody can
+ * act on.
+ *
  * @param slices - The resolved slices
  * @param fromSliceName - Source slice name
  * @param toSliceName - Target slice name
  * @param fileToSlice - Pre-built file-to-slice map (optional, built internally if not provided)
+ * @param options - Must match the options passed to `buildSliceDependencyGraph`
  * @returns Array of { sourceFile, importPath, importLine }
  */
-export declare function findSliceDependencyDetails(slices: Slice[], fromSliceName: string, toSliceName: string, fileToSlice?: Map<string, string>): Array<{
-    sourceFile: SourceFile;
-    importPath: string;
-    importLine: number;
-}>;
+export interface SliceDependencySite {
+    readonly sourceFile: SourceFile;
+    readonly importPath: string;
+    readonly importLine: number;
+    /**
+     * The edge itself, so a caller can build an identity and a message from what the
+     * dependency *is* rather than from where it sits.
+     *
+     * Added by [ts-archunit plan 0088](https://github.com/nielspeter/ts-archunit/blob/main/plans/0088-a-slice-finding-identifies-itself.md): the
+     * dependency conditions identify a finding by `basename::kind::specifier::names` and
+     * deliberately **not** by line, because a line moves when anything above it is edited
+     * (see `ArchViolation.identity`). The slice conditions could not follow that scheme
+     * while this function returned only a line number.
+     *
+     * It also unblocks naming the offending edge's KIND in the message — `edgeVerb()` has
+     * returned `'re-exports'` since v0.28.0 and no slice condition could use it.
+     */
+    readonly edge: ModuleEdge;
+}
+export {};
 //# sourceMappingURL=slice-graph.d.ts.map

package/dist/helpers/slice-graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"slice-graph.d.ts","sourceRoot":"","sources":["../../src/helpers/slice-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAC1C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAG/C;;;GAGG;AAEH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;CACX;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAQxE;AAsCD,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,KAAK,EAAE,EACf,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,SAAS,EAAE,CAcb;AAED;;;;;;;;;GASG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,KAAK,EAAE,EACf,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,KAAK,CAAC;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAwB3E"}
+{"version":3,"file":"slice-graph.d.ts","sourceRoot":"","sources":["../../src/helpers/slice-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAC1C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAC/C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAC9D,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,yBAAyB,CAAA;AAGzE;;;GAGG;AACH,UAAU,SAAS;IACjB,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;CACX;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAQxE;AAqCD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,KAAK,eAAe,GAAG,gBAAgB,GAAG,eAAe,CAAA;AAyGzD;;;;;;;;;;;GAWG;AACH;;;;;;;;;;;;;;;;;;GAkBG;AACH,UAAU,UAAU;IAClB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAA;IAC3B,UAAU,CAAC,aAAa,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,mBAAmB,EAAE,CAAA;CAC9E;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,KAAK,EAAE,EACf,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,EAC5C,OAAO,EAAE,aAAa,GAAG,SAAS,EAClC,QAAQ,EAAE,eAAe,GACxB,UAAU,CAMZ;AAuBD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;CAC1B"}

package/dist/helpers/slice-graph.js

@@ -1,4 +1,4 @@
-import { getDependencyDecls } from '../core/module-dependencies.js';
+import { edgesOf, FORWARD_EDGE_KINDS } from '../core/module-edges.js';
 /**
  * Build a reverse lookup map: file path -> slice name.
  * Shared by buildSliceDependencyGraph and findSliceDependencyDetails.
@@ -13,25 +13,115 @@ export function buildFileToSliceMap(slices) {
     return fileToSlice;
 }
 /**
- * Build a directed dependency graph between slices.
+ * The edge kinds a **cycle** question counts: the eager static ones.
  *
- * For each file in each slice, resolve its imports. If an imported file
- * belongs to a different slice, add a directed edge from the importing
- * slice to the imported slice.
+ * A cycle question asks "what does this slice depend on when the program starts", which
+ * is what makes a cycle a cycle. Of `module-edges.ts`' five kinds, two qualify — and
+ * each exclusion is a decision with a reason, not an omission:
  *
- * @param slices - The resolved slices
- * @param fileToSlice - Pre-built file-to-slice map (optional, built internally if not provided)
- * @returns Unique directed edges between slices
+ * - `import` and `reexport` — **counted.** Both are eager: `export { x } from './b.js'`
+ *   emits an import of `./b.js`, so that module is evaluated whether or not anything
+ *   reads `x`. A barrel file is built out of re-exports, and `a → barrel → a` is the
+ *   cycle real codebases actually have
+ *   ([ts-archunit plan 0085](https://github.com/nielspeter/ts-archunit/blob/main/plans/completed/0085-the-slice-graph-cannot-see-a-re-export.md)).
+ * - `dynamic` — **not counted.** `import('./b.js')` is lazy, so it cannot deadlock
+ *   module initialization, and it is most often the *deliberate* fix for a cycle.
+ *   Reporting it as one would fail the rule for applying its own remedy.
+ * - `require` — **not counted.** CJS, and this is an ESM-only package (ADR-004). Named
+ *   here rather than left implicit, so the next reader knows it was considered. The
+ *   surviving gap is `require` in an `allowJs` project: recorded, not fixed.
+ * - `type-expression` — **not counted**, and excluded by *kind* rather than by
+ *   `typeOnly`. `type X = import('./b.js').Y` is erased, so it must stay out even
+ *   under `ignoreTypeImports: false` — filtering it on the flag alone would make that
+ *   option add a class of edge this graph has never had.
+ *
+ * **This set is the cycle question's answer and nothing else's.** It governed all three
+ * slice conditions 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),
+ * which is how the cycle rationale came to justify a false negative on two conditions
+ * that are not about cycles: `slices(p).should().notDependOn('legacy')` reported **0**
+ * while `modules(p).should().notImportFromCondition('**\/legacy/**')` reported **1**, on
+ * the same file, the same edge and the same run. See `kindsFor` below.
  */
+const EAGER_STATIC_KINDS = new Set([
+    'import',
+    'reexport',
+]);
 /**
- * Collect unique slice edges from a single file's imports.
+ * The edges leaving one file, as a slice graph counts them.
+ *
+ * Reads `edgesOf()` — the one definition of a module edge (plan 0071, from bug 0022,
+ * where five sites collecting `getImportDeclarations()` disagreed with the reverse
+ * graph about re-exports). The slice graph was the call site that never adopted it, so
+ * `export { x } from './banned.js'` was a dependency to `notImportFrom` and invisible
+ * to `beFreeOfCycles` **in the same run**. `edgesOf()` is cached per file and
+ * invalidated on modification, so this also replaces a per-call resolution walk.
+ *
+ * `ignoreTypeImports` drops the erased edges. A type-only import or re-export creates
+ * no runtime dependency, so counting it invents cycles that cannot exist at runtime —
+ *
+ * Which erasure the filter reads depends on the `question`: `'module-request'` reads
+ * `erasesModuleRequest`, `'type-bindings'` reads `typeOnly`. Those differ for two
+ * spellings under `verbatimModuleSyntax: true` — `import { type X } from 's'` emits
+ * `import {} from 's'`, so the specifiers are erased and the module request is not
+ * ([ts-archunit plan 0087](https://github.com/nielspeter/ts-archunit/blob/main/plans/completed/0087-an-inline-type-import-still-requests-the-module.md),
+ * shipped in v0.49.0; this paragraph described it as unshipped until v0.49.1).
+ *
+ * [ts-archunit plan 0084](https://github.com/nielspeter/ts-archunit/blob/main/plans/completed/0084-cycle-detection-that-ignores-type-only-imports.md),
+ * which is worth remembering for what it cost: this repo's own `arch/no-cycles` rule
+ * sat at `.warn()` for months with a comment saying "switch to .check() when
+ * beFreeOfCycles ignores import type", and while it could not fail it let a new cycle
+ * in overnight.
+ */
+function sliceEdgesOf(file, options, question) {
+    const ignoreErased = options?.ignoreTypeImports === true;
+    const { counts, erased } = QUESTIONS[question];
+    return edgesOf(file).filter((edge) => counts(edge.kind) && !(ignoreErased && erased(edge)));
+}
+/**
+ * Which edge kinds the question counts — the fix for
+ * [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).
+ *
+ * The erasure predicate was already a function of the question
+ * ([ts-archunit plan 0087](https://github.com/nielspeter/ts-archunit/blob/main/plans/completed/0087-an-inline-type-import-still-requests-the-module.md));
+ * the KIND set was not, so one answer — the cycle one — was serving both questions.
+ *
+ * - `'module-request'` → the eager static kinds above. A cycle is a deadlock in
+ *   initialization order, and `import('./b.js')` is lazy: it cannot deadlock, and it is
+ *   most often the deliberate *fix* for a cycle. Reporting it would fail the rule for
+ *   applying its own remedy.
+ * - `'type-bindings'` → whatever `FORWARD_EDGE_KINDS` says, which is the constant
+ *   `notImportFrom` and `dependOn` already read. A lazy import of `legacy` is still a
+ *   forbidden dependency: it is coupling, it breaks when `legacy` is deleted, and nobody
+ *   is applying a remedy by writing it.
+ *
+ * **Reusing `FORWARD_EDGE_KINDS` rather than writing a second list is the point.** It is
+ * what makes the two families agree *by construction* instead of by two lists someone
+ * must keep in step — which is exactly how
+ * [ts-archunit bug 0022](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0022-forward-import-conditions-are-blind-to-reexports-and-dynamic-imports.md)
+ * happened one layer down, and how this bug re-opened it one layer up. That constant is
+ * a total `Record<ModuleEdgeKind, boolean>`, so a sixth edge kind is a compile error
+ * there rather than a silent omission here.
  */
-function collectEdgesFromFile(file, sliceName, fileToSlice, edgeSet, edges) {
-    for (const importDecl of getDependencyDecls(file)) {
-        const resolved = importDecl.getModuleSpecifierSourceFile();
-        if (!resolved)
+const QUESTIONS = {
+    'module-request': {
+        counts: (kind) => EAGER_STATIC_KINDS.has(kind),
+        erased: (edge) => edge.erasesModuleRequest,
+    },
+    'type-bindings': {
+        counts: (kind) => FORWARD_EDGE_KINDS[kind],
+        erased: (edge) => edge.typeOnly,
+    },
+};
+/**
+ * Collect unique slice edges from a single file's dependencies.
+ */
+function collectEdgesFromFile(file, sliceName, fileToSlice, edgeSet, edges, options, question) {
+    for (const edge of sliceEdgesOf(file, options, question)) {
+        // A local `export { x }` with no `from` has no specifier, and a specifier the
+        // compiler could not resolve points outside the program.
+        if (edge.resolvedPath === undefined)
             continue;
-        const targetSlice = fileToSlice.get(resolved.getFilePath());
+        const targetSlice = fileToSlice.get(edge.resolvedPath);
         if (targetSlice && targetSlice !== sliceName) {
             const edgeKey = `${sliceName}->${targetSlice}`;
             if (!edgeSet.has(edgeKey)) {
@@ -41,45 +131,47 @@ function collectEdgesFromFile(file, sliceName, fileToSlice, edgeSet, edges) {
         }
     }
 }
-export function buildSliceDependencyGraph(slices, fileToSlice) {
+/**
+ * Build the graph, and bind the details walk to the same question and options.
+ *
+ * Prefer this over the two loose functions; they remain exported because
+ * `tests/` and the reverse-graph work call them directly with an explicit question.
+ */
+export function sliceGraph(slices, fileToSlice, options, question) {
+    const map = fileToSlice ?? buildFileToSliceMap(slices);
+    return {
+        edges: buildSliceDependencyGraph(slices, map, options, question),
+        detailsFor: (from, to) => findSliceDependencyDetails(slices, from, to, map, options, question),
+    };
+}
+function buildSliceDependencyGraph(slices, fileToSlice, options, question) {
     const map = fileToSlice ?? buildFileToSliceMap(slices);
     // Collect unique edges
     const edgeSet = new Set();
     const edges = [];
     for (const slice of slices) {
         for (const file of slice.files) {
-            collectEdgesFromFile(file, slice.name, map, edgeSet, edges);
+            collectEdgesFromFile(file, slice.name, map, edgeSet, edges, options, question);
         }
     }
     return edges;
 }
-/**
- * Find which specific files cause a dependency from one slice to another.
- * Used for detailed violation messages.
- *
- * @param slices - The resolved slices
- * @param fromSliceName - Source slice name
- * @param toSliceName - Target slice name
- * @param fileToSlice - Pre-built file-to-slice map (optional, built internally if not provided)
- * @returns Array of { sourceFile, importPath, importLine }
- */
-export function findSliceDependencyDetails(slices, fromSliceName, toSliceName, fileToSlice) {
+function findSliceDependencyDetails(slices, fromSliceName, toSliceName, fileToSlice, options, question) {
     const map = fileToSlice ?? buildFileToSliceMap(slices);
     const fromSlice = slices.find((s) => s.name === fromSliceName);
     if (!fromSlice)
         return [];
     const details = [];
     for (const file of fromSlice.files) {
-        for (const importDecl of getDependencyDecls(file)) {
-            const resolved = importDecl.getModuleSpecifierSourceFile();
-            if (!resolved)
+        for (const edge of sliceEdgesOf(file, options, question)) {
+            if (edge.resolvedPath === undefined)
                 continue;
-            const targetSlice = map.get(resolved.getFilePath());
-            if (targetSlice === toSliceName) {
+            if (map.get(edge.resolvedPath) === toSliceName) {
                 details.push({
                     sourceFile: file,
-                    importPath: resolved.getFilePath(),
-                    importLine: importDecl.getStartLineNumber(),
+                    importPath: edge.resolvedPath,
+                    importLine: edge.line,
+                    edge,
                 });
             }
         }

package/dist/helpers/slice-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"slice-graph.js","sourceRoot":"","sources":["../../src/helpers/slice-graph.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAA;AAYnE;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAe;IACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;QACjD,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC;AAED;;;;;;;;;;GAUG;AACH;;GAEG;AACH,SAAS,oBAAoB,CAC3B,IAAgB,EAChB,SAAiB,EACjB,WAAgC,EAChC,OAAoB,EACpB,KAAkB;IAElB,KAAK,MAAM,UAAU,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,UAAU,CAAC,4BAA4B,EAAE,CAAA;QAC1D,IAAI,CAAC,QAAQ;YAAE,SAAQ;QAEvB,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAA;QAC3D,IAAI,WAAW,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,GAAG,SAAS,KAAK,WAAW,EAAE,CAAA;YAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACpB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAA;YAClD,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,yBAAyB,CACvC,MAAe,EACf,WAAiC;IAEjC,MAAM,GAAG,GAAG,WAAW,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAA;IAEtD,uBAAuB;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAgB,EAAE,CAAA;IAE7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;QAC7D,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,0BAA0B,CACxC,MAAe,EACf,aAAqB,EACrB,WAAmB,EACnB,WAAiC;IAEjC,MAAM,GAAG,GAAG,WAAW,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAA;IAEtD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAA;IAC9D,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,CAAA;IAEzB,MAAM,OAAO,GAA8E,EAAE,CAAA;IAC7F,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,MAAM,UAAU,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAG,UAAU,CAAC,4BAA4B,EAAE,CAAA;YAC1D,IAAI,CAAC,QAAQ;gBAAE,SAAQ;YAEvB,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAA;YACnD,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC;oBACX,UAAU,EAAE,IAAI;oBAChB,UAAU,EAAE,QAAQ,CAAC,WAAW,EAAE;oBAClC,UAAU,EAAE,UAAU,CAAC,kBAAkB,EAAE;iBAC5C,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC"}
+{"version":3,"file":"slice-graph.js","sourceRoot":"","sources":["../../src/helpers/slice-graph.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAA;AAWrE;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAe;IACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;QACjD,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,kBAAkB,GAAgC,IAAI,GAAG,CAAiB;IAC9E,QAAQ;IACR,UAAU;CACX,CAAC,CAAA;AA4BF;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,SAAS,YAAY,CACnB,IAAgB,EAChB,OAAkC,EAClC,QAAyB;IAEzB,MAAM,YAAY,GAAG,OAAO,EAAE,iBAAiB,KAAK,IAAI,CAAA;IACxD,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAA;IAC9C,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAC7F,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,SAAS,GAGX;IACF,gBAAgB,EAAE;QAChB,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC;QAC9C,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB;KAC3C;IACD,eAAe,EAAE;QACf,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC;QAC1C,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ;KAChC;CACF,CAAA;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,IAAgB,EAChB,SAAiB,EACjB,WAAgC,EAChC,OAAoB,EACpB,KAAkB,EAClB,OAAkC,EAClC,QAAyB;IAEzB,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;QACzD,8EAA8E;QAC9E,yDAAyD;QACzD,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;YAAE,SAAQ;QAE7C,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACtD,IAAI,WAAW,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,GAAG,SAAS,KAAK,WAAW,EAAE,CAAA;YAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACpB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAA;YAClD,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAsCD;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CACxB,MAAe,EACf,WAA4C,EAC5C,OAAkC,EAClC,QAAyB;IAEzB,MAAM,GAAG,GAAG,WAAW,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAA;IACtD,OAAO;QACL,KAAK,EAAE,yBAAyB,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;QAChE,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,0BAA0B,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;KAC/F,CAAA;AACH,CAAC;AAED,SAAS,yBAAyB,CAChC,MAAe,EACf,WAA4C,EAC5C,OAAkC,EAClC,QAAyB;IAEzB,MAAM,GAAG,GAAG,WAAW,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAA;IAEtD,uBAAuB;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAgB,EAAE,CAAA;IAE7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAA;QAChF,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAyCD,SAAS,0BAA0B,CACjC,MAAe,EACf,aAAqB,EACrB,WAAmB,EACnB,WAA4C,EAC5C,OAAkC,EAClC,QAAyB;IAEzB,MAAM,GAAG,GAAG,WAAW,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAA;IAEtD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAA;IAC9D,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,CAAA;IAEzB,MAAM,OAAO,GAA0B,EAAE,CAAA;IACzC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;YACzD,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;gBAAE,SAAQ;YAE7C,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,WAAW,EAAE,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC;oBACX,UAAU,EAAE,IAAI;oBAChB,UAAU,EAAE,IAAI,CAAC,YAAY;oBAC7B,UAAU,EAAE,IAAI,CAAC,IAAI;oBACrB,IAAI;iBACL,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC"}

package/dist/helpers/tarjan.d.ts

@@ -3,19 +3,5 @@
  * Keys are node indices, values are arrays of neighbor indices.
  */
 export type AdjacencyList = Map<number, number[]>;
-/**
- * Find all strongly connected components in a directed graph
- * using Tarjan's algorithm.
- *
- * Returns only components with size > 1 (i.e., actual cycles).
- * Each component is an array of node indices forming a cycle.
- *
- * Time complexity: O(V + E)
- * Space complexity: O(V)
- *
- * @param nodeCount - Total number of nodes (0-indexed)
- * @param edges - Adjacency list: node index -> list of neighbor indices
- * @returns Array of strongly connected components (size > 1)
- */
 export declare function tarjanSCC(nodeCount: number, edges: AdjacencyList): number[][];
 //# sourceMappingURL=tarjan.d.ts.map

package/dist/helpers/tarjan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tarjan.d.ts","sourceRoot":"","sources":["../../src/helpers/tarjan.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;AAEjD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,EAAE,EAAE,CAyD7E"}
+{"version":3,"file":"tarjan.d.ts","sourceRoot":"","sources":["../../src/helpers/tarjan.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;AAsCjD,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,EAAE,EAAE,CAqD7E"}

package/dist/helpers/tarjan.js

@@ -12,6 +12,25 @@
  * @param edges - Adjacency list: node index -> list of neighbor indices
  * @returns Array of strongly connected components (size > 1)
  */
+/**
+ * Read an index that the algorithm guarantees is in range.
+ *
+ * `noUncheckedIndexedAccess` types every element access as `T | undefined`, and
+ * the original code answered that with `!` — which ADR-005 bars, and which turns
+ * a genuinely impossible state into silence if it ever stops being impossible.
+ * A named accessor narrows for real and fails LOUDLY instead: every index here
+ * comes from `edges`, so an out-of-range one means the caller's adjacency list
+ * disagrees with `nodeCount`, which is worth an error rather than a `-1` that
+ * reads as "unvisited" and quietly changes the result.
+ */
+function at(values, i, what) {
+    const value = values[i];
+    if (value === undefined) {
+        throw new RangeError(`tarjanSCC: ${what}[${String(i)}] is outside the graph (${String(values.length)} nodes) — ` +
+            'the adjacency list names a node that nodeCount does not cover.');
+    }
+    return value;
+}
 export function tarjanSCC(nodeCount, edges) {
     const index = new Array(nodeCount).fill(-1);
     const lowlink = new Array(nodeCount).fill(-1);
@@ -27,34 +46,28 @@ export function tarjanSCC(nodeCount, edges) {
         onStack[v] = true;
         const neighbors = edges.get(v) ?? [];
         for (const w of neighbors) {
-            // lv/lw/iw are always defined here (v and w are bounded indices into
-            // pre-filled arrays); the guards satisfy noUncheckedIndexedAccess.
-            const lv = lowlink[v];
             if (index[w] === -1) {
                 // w has not been visited
                 strongConnect(w);
-                const lw = lowlink[w];
-                if (lv !== undefined && lw !== undefined)
-                    lowlink[v] = Math.min(lv, lw);
+                lowlink[v] = Math.min(at(lowlink, v, 'lowlink'), at(lowlink, w, 'lowlink'));
             }
             else if (onStack[w]) {
                 // w is on the stack, so it's in the current SCC
-                const iw = index[w];
-                if (lv !== undefined && iw !== undefined)
-                    lowlink[v] = Math.min(lv, iw);
+                lowlink[v] = Math.min(at(lowlink, v, 'lowlink'), at(index, w, 'index'));
             }
         }
         // If v is a root node, pop the SCC
         if (lowlink[v] === index[v]) {
             const scc = [];
-            let popped = stack.pop();
-            while (popped !== undefined) {
-                onStack[popped] = false;
-                scc.push(popped);
-                if (popped === v)
+            let w;
+            do {
+                const popped = stack.pop();
+                if (popped === undefined)
                     break;
-                popped = stack.pop();
-            }
+                w = popped;
+                onStack[w] = false;
+                scc.push(w);
+            } while (w !== v);
             // Only report cycles (size > 1)
             if (scc.length > 1) {
                 sccs.push(scc);

package/dist/helpers/tarjan.js.map

@@ -1 +1 @@
-{"version":3,"file":"tarjan.js","sourceRoot":"","sources":["../../src/helpers/tarjan.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB,EAAE,KAAoB;IAC/D,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACnD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACrD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACzD,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,MAAM,IAAI,GAAe,EAAE,CAAA;IAE3B,SAAS,aAAa,CAAC,CAAS;QAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACvB,OAAO,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACzB,YAAY,EAAE,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAEjB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACpC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,qEAAqE;YACrE,mEAAmE;YACnE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACrB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACpB,yBAAyB;gBACzB,aAAa,CAAC,CAAC,CAAC,CAAA;gBAChB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBACrB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;oBAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YACzE,CAAC;iBAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,gDAAgD;gBAChD,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;gBACnB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;oBAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YACzE,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAa,EAAE,CAAA;YACxB,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YACxB,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,MAAM,CAAC,GAAG,KAAK,CAAA;gBACvB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAChB,IAAI,MAAM,KAAK,CAAC;oBAAE,MAAK;gBACvB,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YACtB,CAAC;YAED,gCAAgC;YAChC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,aAAa,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}
+{"version":3,"file":"tarjan.js","sourceRoot":"","sources":["../../src/helpers/tarjan.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;GAaG;AACH;;;;;;;;;;GAUG;AACH,SAAS,EAAE,CAAC,MAAyB,EAAE,CAAS,EAAE,IAAY;IAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACvB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,UAAU,CAClB,cAAc,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,2BAA2B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY;YACzF,gEAAgE,CACnE,CAAA;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,SAAiB,EAAE,KAAoB;IAC/D,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACnD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACrD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACzD,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,MAAM,IAAI,GAAe,EAAE,CAAA;IAE3B,SAAS,aAAa,CAAC,CAAS;QAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACvB,OAAO,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACzB,YAAY,EAAE,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAEjB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACpC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACpB,yBAAyB;gBACzB,aAAa,CAAC,CAAC,CAAC,CAAA;gBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAA;YAC7E,CAAC;iBAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,gDAAgD;gBAChD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;YACzE,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAa,EAAE,CAAA;YACxB,IAAI,CAAS,CAAA;YACb,GAAG,CAAC;gBACF,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;gBAC1B,IAAI,MAAM,KAAK,SAAS;oBAAE,MAAK;gBAC/B,CAAC,GAAG,MAAM,CAAA;gBACV,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;gBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAC;YAEjB,gCAAgC;YAChC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,aAAa,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/index.d.ts

@@ -1,13 +1,14 @@
 export { project, workspace, resetProjectCache } from './core/project.js';
+export { checkAll } from './core/check-all.js';
 export type { ArchProject } from './core/project.js';
 export type { Predicate } from '@nielspeter/eess';
-export { not, and, or } from '@nielspeter/eess';
+export { not, and, or } from './core/combinators.js';
 export type { Condition, ConditionContext } from '@nielspeter/eess';
-export type { ArchViolation } from './core/violation.js';
+export type { ArchViolation } from '@nielspeter/eess';
 export { createViolation, getElementName, getElementFile, getElementLine, } from './core/violation.js';
-export { RuleBuilder } from '@nielspeter/eess';
-export { TerminalBuilder } from '@nielspeter/eess';
-export { ArchRuleError } from '@nielspeter/eess';
+export { RuleBuilder } from './core/rule-builder.js';
+export { TerminalBuilder } from './core/terminal-builder.js';
+export { ArchRuleError, isArchRuleError, ArchConfigError, isArchConfigError, } from '@nielspeter/eess';
 export type { RuleMetadata } from '@nielspeter/eess';
 export type { RuleDescription } from '@nielspeter/eess';
 export { generateCodeFrame } from '@nielspeter/eess';
@@ -15,10 +16,14 @@ export type { CodeFrameOptions } from '@nielspeter/eess';
 export { formatViolations, formatViolationsPlain } from '@nielspeter/eess';
 export type { FormatOptions } from '@nielspeter/eess';
 export { definePredicate, defineCondition } from '@nielspeter/eess';
+export { globNode, globAnyOf } from '@nielspeter/eess';
+export type { DeclaredGlob, DeclaredGlobs, GlobBase, GlobKind, GlobNode, GlobPosition, GlobSite, GlobTree, OpaqueGlob, } from '@nielspeter/eess';
+export type { DiagnosableRule, DiagnosticFinding } from './core/diagnose.js';
+export { diagnose } from './core/diagnose.js';
 export type { Named, Located, Exportable } from './predicates/index.js';
-export { haveNameMatching, haveNameStartingWith, haveNameEndingWith, resideInFile, resideInFolder, areExported, areNotExported, } from './predicates/index.js';
+export { haveNameMatching, haveNameStartingWith, haveNameEndingWith, resideInFile, resideInFolder, havePathMatching, areExported, areNotExported, } from './predicates/index.js';
 export { resideInFile as conditionResideInFile, resideInFolder as conditionResideInFolder, haveNameMatching as conditionHaveNameMatching, beExported, notExist, } from './conditions/structural.js';
-export { importFrom, notImportFrom as predicateNotImportFrom, exportSymbolNamed, havePathMatching, } from './predicates/module.js';
+export { importFrom, notImportFrom as predicateNotImportFrom, exportSymbolNamed, } from './predicates/module.js';
 export type { ImportOptions } from './core/import-options.js';
 export { isTypeOnlyImport } from './core/import-options.js';
 export { onlyImportFrom, notImportFrom as conditionNotImportFrom, onlyHaveTypeImportsFrom, notHaveAliasedImports, dependOn, } from './conditions/dependency.js';
@@ -28,7 +33,9 @@ export { extend, implement, haveDecorator, haveDecoratorMatching, areAbstract, h
 export { shouldExtend, shouldImplement, shouldHaveMethodNamed, shouldNotHaveMethodMatching, acceptParameterOfType as classAcceptParameterOfType, notAcceptParameterOfType as classNotAcceptParameterOfType, } from './conditions/class.js';
 export { functions, FunctionRuleBuilder } from './builders/function-rule-builder.js';
 export type { ArchFunction } from './models/arch-function.js';
-export { collectFunctions, fromFunctionDeclaration, fromArrowVariableDeclaration, fromMethodDeclaration, } from './models/arch-function.js';
+export { collectFunctions, fromFunctionDeclaration, fromFunctionInitializerDeclaration, fromArrowVariableDeclaration, fromMethodDeclaration, } from './models/arch-function.js';
+export type { FunctionCollectionOptions } from './models/arch-function.js';
+export type { ObjectLiteralFunction } from './core/object-literal-functions.js';
 export { arePublic, areProtected, arePrivate, areAsync, areNotAsync, haveParameterCount, haveParameterCountGreaterThan, haveParameterCountLessThan, haveParameterNamed, haveReturnType, haveRestParameter, haveOptionalParameter, haveParameterOfType, haveParameterNameMatching, } from './predicates/function.js';
 export { notExist as functionNotExist, beExported as functionBeExported, beAsync as functionBeAsync, haveNameMatching as functionHaveNameMatching, acceptParameterOfType as functionAcceptParameterOfType, notAcceptParameterOfType as functionNotAcceptParameterOfType, haveReturnTypeMatching as functionHaveReturnTypeMatching, } from './conditions/function.js';
 export { types, TypeRuleBuilder } from './builders/type-rule-builder.js';
@@ -52,23 +59,25 @@ export { beFreeOfCycles, respectLayerOrder, notDependOn } from './conditions/sli
 export { slices, SliceRuleBuilder } from './builders/slice-rule-builder.js';
 export type { CheckOptions, OutputFormat } from '@nielspeter/eess';
 export { formatViolationsJson } from '@nielspeter/eess';
+export type { ArchJsonReport, ArchJsonViolation, ArchJsonSuppression, ArchJsonUntestedAllowlist, } from '@nielspeter/eess';
 export { formatViolationsGitHub } from '@nielspeter/eess';
 export { detectFormat, isCI } from '@nielspeter/eess';
-export { withBaseline, generateBaseline, Baseline } from '@nielspeter/eess';
-export type { BaselineEntry, BaselineFile } from '@nielspeter/eess';
-export { diffAware, DiffFilter } from '@nielspeter/eess';
-export { parseExclusionComments, isExcludedByComment } from '@nielspeter/eess';
-export type { ExclusionComment, ExclusionWarning, ParseResult } from '@nielspeter/eess';
+export { withBaseline, generateBaseline, Baseline } from './helpers/baseline.js';
+export type { BaselineDelta } from './helpers/baseline.js';
+export type { BaselineEntry, BaselineFile, BaselineOptions } from './helpers/baseline.js';
+export { diffAware, DiffFilter } from './helpers/diff-aware.js';
+export { parseExclusionComments, isExcludedByComment } from './core/exclusion-comments.js';
+export type { ExclusionComment, ExclusionWarning, ParseResult } from './core/exclusion-comments.js';
 export { silent } from '@nielspeter/eess';
 export type { SilentExclusion } from '@nielspeter/eess';
-export { collectViolations } from '@nielspeter/eess';
+export { collectViolations } from './helpers/baseline-generator.js';
 export { calls, CallRuleBuilder } from './builders/call-rule-builder.js';
 export type { ArchCall } from './models/arch-call.js';
-export { collectCalls, fromCallExpression } from './models/arch-call.js';
+export { fromCallExpression } from './models/arch-call.js';
 export { onObject, withMethod, withArgMatching, withStringArg } from './predicates/call.js';
 export { haveCallbackContaining as callHaveCallbackContaining, notHaveCallbackContaining as callNotHaveCallbackContaining, notExist as callNotExist, haveArgumentWithProperty, notHaveArgumentWithProperty, haveArgumentContaining as callHaveArgumentContaining, notHaveArgumentContaining as callNotHaveArgumentContaining, } from './conditions/call.js';
-export { within } from './helpers/within.js';
-export type { ScopedContext } from './helpers/within.js';
+export { within } from './builders/within.js';
+export type { ScopedContext } from './builders/within.js';
 export { ScopedFunctionRuleBuilder } from './builders/scoped-function-rule-builder.js';
 export { extractCallbacks } from './helpers/callback-extractor.js';
 export type { ExtractedCallback } from './helpers/callback-extractor.js';
@@ -77,16 +86,22 @@ export type { ArchPattern, PropertyConstraint } from './helpers/pattern.js';
 export { followPattern } from './conditions/pattern.js';
 export { smells } from './smells/index.js';
 export { SmellBuilder } from './smells/smell-builder.js';
-export { tsconfig, TsconfigBuilder } from './tsconfig/tsconfig-builder.js';
-export { isStrictFamily, resolveFlag, STRICT_FAMILY_SIZE, type StrictFamilyFlag, } from './tsconfig/strict-family.js';
+export { tsconfig } from './tsconfig/index.js';
+export { TsconfigBuilder } from './tsconfig/tsconfig-builder.js';
 export { DuplicateBodiesBuilder } from './smells/duplicate-bodies.js';
 export { InconsistentSiblingsBuilder } from './smells/inconsistent-siblings.js';
 export type { Fingerprint } from './smells/fingerprint.js';
 export { buildFingerprint, computeSimilarity } from './smells/fingerprint.js';
+export { variationBetween } from './smells/variation.js';
+export type { Variation, VariationAxis } from './smells/variation.js';
 export type { Layer, LayerPair } from './models/cross-layer.js';
 export type { PairCondition } from './core/pair-condition.js';
 export { crossLayer, CrossLayerBuilder } from './builders/cross-layer-builder.js';
 export { haveMatchingCounterpart, haveConsistentExports, satisfyPairCondition, } from './conditions/cross-layer.js';
+export { crossProject, CrossProjectBuilder, byName, byArg, byPropertyNames, } from './builders/correspondence-builder.js';
+export type { KeyFn, KeysSource } from './builders/correspondence-builder.js';
+export { setCorrespondence } from '@nielspeter/eess';
+export type { CorrespondenceResult } from '@nielspeter/eess';
 export { haveCyclomaticComplexity, haveMoreLinesThan, haveMoreMethodsThan, haveComplexity, haveMoreFunctionLinesThan, } from './predicates/metrics.js';
 export { cyclomaticComplexity, linesOfCode } from './helpers/complexity.js';
 export { noEval, noFunctionConstructor, noProcessEnv, noConsoleLog, noConsole, noJsonParse, functionNoEval, functionNoFunctionConstructor, functionNoProcessEnv, functionNoConsoleLog, functionNoConsole, functionNoJsonParse, moduleNoEval, moduleNoProcessEnv, moduleNoConsoleLog, } from './rules/security.js';
@@ -100,4 +115,25 @@ export { areHtmlElements, areComponents, withAttribute as jsxWithAttribute, with
 export { notExist as jsxNotExist, haveAttribute as jsxHaveAttribute, notHaveAttribute as jsxNotHaveAttribute, haveAttributeMatching as jsxHaveAttributeMatching, notHaveAttributeMatching as jsxNotHaveAttributeMatching, } from './conditions/jsx.js';
 export { defineConfig } from './cli/config.js';
 export type { CliConfig } from './cli/config.js';
+export { orphanExclusions } from './core/orphan-exclusions.js';
+export type { OrphanExclusion } from './core/orphan-exclusions.js';
+export type { Selection, ElementInfo, RuleBuilderLike, EdgeCoverage, GlobLeaf, ReportMode, } from '@nielspeter/eess';
+export { rootFromTsConfigPath, rootOf, relativeToRoot } from './core/project-relative.js';
+export { syntacticFault } from './core/glob-diagnosis.js';
+export { dispatchRule, finishPreset } from '@nielspeter/eess';
+export { collectResult, mergeCollectResults, hasEvidence, EMITTER_NO_RECEIPT, EMITTER_PASS_WITHOUT_EVIDENCE, EMITTER_EXPIRED_DECLARATION, EMITTER_CONTRADICTORY_EVIDENCE, EMITTER_SOURCE_EMPTY, } from '@nielspeter/eess';
+export type { Evidence } from '@nielspeter/eess';
+export type { RuleSeverity, PresetBaseOptions, PresetReportOptions, ReportOptions, } from '@nielspeter/eess';
+export { assertsCardinality, reportViolations } from '@nielspeter/eess';
+export type { BaselineFilter, DiffFilterLike, Matcher, UntestedReason } from '@nielspeter/eess';
+export type { CollectResult } from './core/terminal-builder.js';
+export type { DiskSet, OnDisk } from './core/disk-set.js';
+export { diskSet } from './core/disk-set.js';
+export type { GlobFault } from './core/glob-diagnosis.js';
+export { pathUniverse } from './core/path-universe.js';
+export type { PathUniverse } from '@nielspeter/eess';
+export { validateOverrides } from './presets/shared.js';
+export { STRICT_FAMILY_SIZE } from './tsconfig/strict-family.js';
+export type { StrictFamilyFlag } from './tsconfig/strict-family.js';
+export type { PresetDelivery } from './presets/shared.js';
 //# sourceMappingURL=index.d.ts.map