@nielspeter/eess-ts 0.2.1 → 0.5.0

package/dist/smells/sibling-files.d.ts

@@ -0,0 +1,47 @@
+import type { SourceFile } from 'ts-morph';
+import type { ArchProject } from '../core/project.js';
+import type { ExpressionMatcher } from '../helpers/matchers.js';
+/**
+ * Which files the sibling detector looks at, and how they are grouped.
+ *
+ * Separated from the builder because selecting and grouping files is not
+ * detecting inconsistency — the builder collects a fluent configuration and
+ * hands it here. The scope arrives as a value rather than being read off a
+ * builder, so the grouping is callable and testable without one.
+ */
+export interface SiblingScope {
+    readonly project: ArchProject;
+    readonly folders: readonly string[];
+    readonly ignorePaths: readonly string[];
+    readonly ignoreTests: boolean;
+    readonly minLines: number;
+    readonly pattern: ExpressionMatcher | undefined;
+}
+/** Partition files into matching and non-matching based on the pattern. */
+export declare function partitionByPattern(files: SourceFile[], pattern: ExpressionMatcher, minLines: number): {
+    matching: SourceFile[];
+    nonMatching: SourceFile[];
+};
+/** Group source files by parent folder, applying all filters. */
+export declare function groupFilesByFolder(scope: SiblingScope): Map<string, SourceFile[]>;
+/** Single source of the inert message. Pure — takes the assessment, returns text. */
+export declare function inertMessage(a: {
+    matching: number;
+    total: number;
+}, patternDesc: string): string;
+/**
+ * Dedupe key for the inert finding. `dedupeConfigFindings` keys on
+ * `${file} ${ruleId ?? rule} ${element}`; `file` is always `''` here and
+ * `rule`/`ruleId` fall back to `describe()`, which is scope-blind (reads
+ * `_pattern` only). So without a scope-aware `element`, two same-pattern/
+ * different-scope inert detectors with no explicit `.rule({id})` would
+ * collapse into one finding under `checkAll`.
+ *
+ * Folds in every field `groupFilesByFolder()`/`fileMatchesPattern()` read to
+ * decide what's examined — `_folders`, `_ignorePaths`, `_ignoreTests`,
+ * `_minLines` — sorted so option order cannot split one semantic scope into
+ * two keys. Two rules with identical scope correctly collapse to one finding
+ * (one edit fixes both); two rules differing in ANY of these stay distinct.
+ */
+export declare function inertElement(scope: SiblingScope): string;
+//# sourceMappingURL=sibling-files.d.ts.map

package/dist/smells/sibling-files.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sibling-files.d.ts","sourceRoot":"","sources":["../../src/smells/sibling-files.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAE1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AACrD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAA;AAO/D;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAA;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAA;IACvC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAA;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,CAAA;CAChD;AAsBD,2EAA2E;AAC3E,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,EAAE,iBAAiB,EAC1B,QAAQ,EAAE,MAAM,GACf;IAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,CAWvD;AAED,iEAAiE;AACjE,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,YAAY,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAoCjF;AAED,qFAAqF;AACrF,wBAAgB,YAAY,CAAC,CAAC,EAAE;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAWhG;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAKxD"}

package/dist/smells/sibling-files.js

@@ -0,0 +1,104 @@
+import path from 'node:path';
+import picomatch from 'picomatch';
+import { collectFunctions } from '../models/arch-function.js';
+import { searchFunctionBody } from '../helpers/body-traversal.js';
+/** Paths treated as tests when `.ignoreTests()` is on. */
+const TEST_PATTERNS = ['**/*.test.ts', '**/*.spec.ts', '**/__tests__/**'];
+/** Check if a source file contains any function matching the pattern. */
+function fileMatchesPattern(sf, pattern, minLines) {
+    // Detectors scan for a property of the code, not a user-declared subject
+    // set, so they always include object-literal functions. `functions()`
+    // keeps that opt-in because widening a selector silently changes every
+    // existing rule; a detector has no such contract to break, and a
+    // duplicated arrow under an object key — a resolver, a route handler, a
+    // reducer case — is exactly the copy-paste rot this exists to find.
+    for (const fn of collectFunctions(sf, { includeObjectLiteralFunctions: true })) {
+        const body = fn.getBody();
+        if (!body)
+            continue;
+        const lineCount = body.getText().split('\n').length;
+        if (lineCount < minLines)
+            continue;
+        if (searchFunctionBody(fn, pattern).found)
+            return true;
+    }
+    return false;
+}
+/** Partition files into matching and non-matching based on the pattern. */
+export function partitionByPattern(files, pattern, minLines) {
+    const matching = [];
+    const nonMatching = [];
+    for (const sf of files) {
+        if (fileMatchesPattern(sf, pattern, minLines)) {
+            matching.push(sf);
+        }
+        else {
+            nonMatching.push(sf);
+        }
+    }
+    return { matching, nonMatching };
+}
+/** Group source files by parent folder, applying all filters. */
+export function groupFilesByFolder(scope) {
+    const sourceFiles = scope.project.getSourceFiles();
+    const folderMatchers = scope.folders.map((g) => picomatch(g));
+    const ignoreMatchers = scope.ignorePaths.map((g) => picomatch(g));
+    const testMatchers = scope.ignoreTests ? TEST_PATTERNS.map((g) => picomatch(g)) : [];
+    const groups = new Map();
+    for (const sf of sourceFiles) {
+        const filePath = sf.getFilePath();
+        // Folder filter: if folders specified, file must match at least one
+        if (folderMatchers.length > 0 && !folderMatchers.some((m) => m(filePath))) {
+            continue;
+        }
+        // Ignore paths filter
+        if (ignoreMatchers.some((m) => m(filePath))) {
+            continue;
+        }
+        // Test file filter
+        if (testMatchers.some((m) => m(filePath))) {
+            continue;
+        }
+        const folder = path.dirname(filePath);
+        const existing = groups.get(folder);
+        if (existing) {
+            existing.push(sf);
+        }
+        else {
+            groups.set(folder, [sf]);
+        }
+    }
+    return groups;
+}
+/** Single source of the inert message. Pure — takes the assessment, returns text. */
+export function inertMessage(a, patternDesc) {
+    return (`This detector examined ${String(a.total)} sibling files, but only ${String(a.matching)} of them ` +
+        `hold the pattern '${patternDesc}', and no folder is within an edit of a majority — so as written it ` +
+        `cannot produce a finding today. It reports a file that diverges from what its siblings do; with no ` +
+        `majority reachable by adopting files, there is no divergence to report. ` +
+        `If this rule asserts a convention the codebase is still adopting, replace it with ` +
+        `crossProject().side(...).beComplete(), which fails the day a file falls short — until adoption is ` +
+        `complete, so expect that red. If the intent is to police divergence rather than the convention itself, ` +
+        `widen the folder so a majority forms, or choose a pattern the sibling files already share.`);
+}
+/**
+ * Dedupe key for the inert finding. `dedupeConfigFindings` keys on
+ * `${file} ${ruleId ?? rule} ${element}`; `file` is always `''` here and
+ * `rule`/`ruleId` fall back to `describe()`, which is scope-blind (reads
+ * `_pattern` only). So without a scope-aware `element`, two same-pattern/
+ * different-scope inert detectors with no explicit `.rule({id})` would
+ * collapse into one finding under `checkAll`.
+ *
+ * Folds in every field `groupFilesByFolder()`/`fileMatchesPattern()` read to
+ * decide what's examined — `_folders`, `_ignorePaths`, `_ignoreTests`,
+ * `_minLines` — sorted so option order cannot split one semantic scope into
+ * two keys. Two rules with identical scope correctly collapse to one finding
+ * (one edit fixes both); two rules differing in ANY of these stay distinct.
+ */
+export function inertElement(scope) {
+    const patternDesc = scope.pattern?.description ?? 'unknown pattern';
+    const folders = [...scope.folders].sort().join('|');
+    const ignorePaths = [...scope.ignorePaths].sort().join('|');
+    return `inert:${patternDesc}:${folders}:${ignorePaths}:${String(scope.ignoreTests)}:${String(scope.minLines)}`;
+}
+//# sourceMappingURL=sibling-files.js.map

package/dist/smells/sibling-files.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sibling-files.js","sourceRoot":"","sources":["../../src/smells/sibling-files.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAA;AAE5B,OAAO,SAAS,MAAM,WAAW,CAAA;AAGjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAA;AAEjE,0DAA0D;AAC1D,MAAM,aAAa,GAAG,CAAC,cAAc,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAA;AAmBzE,yEAAyE;AACzE,SAAS,kBAAkB,CAAC,EAAc,EAAE,OAA0B,EAAE,QAAgB;IACtF,yEAAyE;IACzE,sEAAsE;IACtE,uEAAuE;IACvE,iEAAiE;IACjE,wEAAwE;IACxE,oEAAoE;IACpE,KAAK,MAAM,EAAE,IAAI,gBAAgB,CAAC,EAAE,EAAE,EAAE,6BAA6B,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QAC/E,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI;YAAE,SAAQ;QAEnB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAA;QACnD,IAAI,SAAS,GAAG,QAAQ;YAAE,SAAQ;QAElC,IAAI,kBAAkB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,KAAK;YAAE,OAAO,IAAI,CAAA;IACxD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,kBAAkB,CAChC,KAAmB,EACnB,OAA0B,EAC1B,QAAgB;IAEhB,MAAM,QAAQ,GAAiB,EAAE,CAAA;IACjC,MAAM,WAAW,GAAiB,EAAE,CAAA;IACpC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,kBAAkB,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACtB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAA;AAClC,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,kBAAkB,CAAC,KAAmB;IACpD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,EAAE,CAAA;IAClD,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7D,MAAM,cAAc,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IACjE,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAEpF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAA;IAE9C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE,CAAA;QAEjC,oEAAoE;QACpE,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YAC1E,SAAQ;QACV,CAAC;QAED,sBAAsB;QACtB,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YAC5C,SAAQ;QACV,CAAC;QAED,mBAAmB;QACnB,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YAC1C,SAAQ;QACV,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,YAAY,CAAC,CAAsC,EAAE,WAAmB;IACtF,OAAO,CACL,0BAA0B,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,4BAA4B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW;QAClG,qBAAqB,WAAW,sEAAsE;QACtG,qGAAqG;QACrG,0EAA0E;QAC1E,oFAAoF;QACpF,oGAAoG;QACpG,yGAAyG;QACzG,4FAA4F,CAC7F,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,YAAY,CAAC,KAAmB;IAC9C,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,EAAE,WAAW,IAAI,iBAAiB,CAAA;IACnE,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACnD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC3D,OAAO,SAAS,WAAW,IAAI,OAAO,IAAI,WAAW,IAAI,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAA;AAChH,CAAC"}

package/dist/smells/similar-pairs.d.ts

@@ -0,0 +1,28 @@
+import type { ArchFunction } from '../models/arch-function.js';
+import type { Fingerprint } from './fingerprint.js';
+/** A function paired with its structural fingerprint. */
+interface FingerprintedFunction {
+    fn: ArchFunction;
+    fingerprint: Fingerprint;
+}
+/** Two bodies the detector considers similar enough to report, and by how much. */
+export interface SimilarPair {
+    a: ArchFunction;
+    b: ArchFunction;
+    similarity: number;
+    /**
+     * The fingerprints the score came from, carried so a REPORTED pair can be
+     * asked what varies between the two bodies without a second AST pass.
+     *
+     * Optional because a caller may construct a pair by hand — the message
+     * builder degrades to the bare percentage rather than assuming.
+     */
+    fingerprintA?: Fingerprint;
+    fingerprintB?: Fingerprint;
+}
+/** Build fingerprints for all collected functions. */
+export declare function fingerprintAll(functions: ArchFunction[]): FingerprintedFunction[];
+/** Compare all pairs of fingerprints, collect those above threshold. */
+export declare function findSimilarPairs(items: FingerprintedFunction[], minSimilarity: number, minDistinctVocabulary: number): SimilarPair[];
+export {};
+//# sourceMappingURL=similar-pairs.d.ts.map

package/dist/smells/similar-pairs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar-pairs.d.ts","sourceRoot":"","sources":["../../src/smells/similar-pairs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAA;AAC9D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAGnD,yDAAyD;AACzD,UAAU,qBAAqB;IAC7B,EAAE,EAAE,YAAY,CAAA;IAChB,WAAW,EAAE,WAAW,CAAA;CACzB;AAED,mFAAmF;AACnF,MAAM,WAAW,WAAW;IAC1B,CAAC,EAAE,YAAY,CAAA;IACf,CAAC,EAAE,YAAY,CAAA;IACf,UAAU,EAAE,MAAM,CAAA;IAClB;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,WAAW,CAAA;IAC1B,YAAY,CAAC,EAAE,WAAW,CAAA;CAC3B;AA4BD,sDAAsD;AACtD,wBAAgB,cAAc,CAAC,SAAS,EAAE,YAAY,EAAE,GAAG,qBAAqB,EAAE,CAQjF;AAED,wEAAwE;AACxE,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,qBAAqB,EAAE,EAC9B,aAAa,EAAE,MAAM,EACrB,qBAAqB,EAAE,MAAM,GAC5B,WAAW,EAAE,CAyEf"}

package/dist/smells/similar-pairs.js

@@ -0,0 +1,134 @@
+import { buildFingerprint, computeSimilarity } from './fingerprint.js';
+/**
+ * The pairwise comparison behind `smells.duplicateBodies()`.
+ *
+ * Separated from the builder because it is the algorithm, not the DSL: the
+ * builder's job is to collect a fluent configuration and hand it here. The
+ * thresholds arrive as arguments rather than being read off a builder, so the
+ * comparison is callable and testable without one.
+ */
+/**
+ * Does one function's body enclose the other's?
+ *
+ * Only meaningful within one source file; two bodies in different files can
+ * never nest. Compared on the BODY spans rather than the declarations, because
+ * that is what was fingerprinted.
+ */
+function containsOther(a, b) {
+    const bodyA = a.getBody();
+    const bodyB = b.getBody();
+    if (!bodyA || !bodyB)
+        return false;
+    if (bodyA.getSourceFile() !== bodyB.getSourceFile())
+        return false;
+    const [startA, endA] = [bodyA.getStart(), bodyA.getEnd()];
+    const [startB, endB] = [bodyB.getStart(), bodyB.getEnd()];
+    return (startA <= startB && endA >= endB) || (startB <= startA && endB >= endA);
+}
+/** Build fingerprints for all collected functions. */
+export function fingerprintAll(functions) {
+    const result = [];
+    for (const fn of functions) {
+        const body = fn.getBody();
+        if (!body)
+            continue;
+        result.push({ fn, fingerprint: buildFingerprint(body) });
+    }
+    return result;
+}
+/** Compare all pairs of fingerprints, collect those above threshold. */
+export function findSimilarPairs(items, minSimilarity, minDistinctVocabulary) {
+    const pairs = [];
+    for (let i = 0; i < items.length; i++) {
+        for (let j = i + 1; j < items.length; j++) {
+            const a = items[i];
+            const b = items[j];
+            if (!a || !b)
+                continue;
+            // Fast rejection 1: if node counts differ too much, similarity cannot reach threshold
+            const maxCount = Math.max(a.fingerprint.nodeCount, b.fingerprint.nodeCount);
+            const minCount = Math.min(a.fingerprint.nodeCount, b.fingerprint.nodeCount);
+            if (maxCount > 0 && minCount / maxCount < minSimilarity) {
+                continue;
+            }
+            // Fast rejection 2 (plan 0103): neither body has enough distinct vocabulary
+            // for a match to be evidence of anything. `Math.min`, not sum or average —
+            // ONE small-vocabulary side is enough to make the pair uninformative
+            // regardless of the other side's size.
+            const minDistinct = Math.min(a.fingerprint.distinctVocabulary, b.fingerprint.distinctVocabulary);
+            if (minDistinct < minDistinctVocabulary) {
+                continue;
+            }
+            // A body compared against a body NESTED INSIDE IT can never be
+            // actionable: "extract the shared logic into one function" is impossible
+            // when one function already contains the other. The detector generates
+            // these itself, because it collects object-literal functions by design —
+            // so `const rule = () => ({ evaluate })` yields both the outer arrow and
+            // the `evaluate` inside it, and they are similar by construction.
+            //
+            // Measured on this repo: 10 of 173 pairs, every one of them noise.
+            if (containsOther(a.fn, b.fn))
+                continue;
+            // Bug 0230 — the PAIRWISE floor, where the two above are per-body.
+            // Plan 0103 asks "does this body carry enough vocabulary to be
+            // evidence?"; nothing asked "do these two carry any of the SAME
+            // vocabulary?". `computeSimilarity` cannot answer it and must not — it
+            // scores syntax kinds only, which is what makes it a type-2 clone score
+            // — so a pair could reach 1.00 on shape with an empty intersection.
+            // Shipped, on this repo: `asDeclared` against `InconsistentSiblings-
+            // Builder.scope`, two functions that each gather six of their own fields
+            // into a record and have not one identifier in common. "Extract the
+            // shared logic into one function" names something that does not exist.
+            //
+            // `=== 0`, never a threshold. Measured over all 89 pairs this repo
+            // produces: two share nothing, none share one or two, and the nearest
+            // real finding shares four. The gap is empty, so no tuned number is
+            // needed — and a non-zero floor would start suppressing copy-paste.
+            //
+            // Guarded by `minDistinct > 0`, and that is not a special case for a
+            // test. "These share no vocabulary" is evidence of unrelatedness only if
+            // there was vocabulary to share: two bodies that are pure control flow
+            // (`return true`) share their entire content, because the shape IS the
+            // content. Whether such a pair is worth reporting is the CALLER's
+            // decision, spelled `minDistinctVocabulary(0)`, and rejection 2 above
+            // has already applied it. Overriding it here would make that option
+            // silently mean something else.
+            if (minDistinct > 0 && sharedVocabulary(a.fingerprint, b.fingerprint) === 0)
+                continue;
+            const similarity = computeSimilarity(a.fingerprint, b.fingerprint);
+            if (similarity >= minSimilarity) {
+                pairs.push({
+                    a: a.fn,
+                    b: b.fn,
+                    similarity,
+                    fingerprintA: a.fingerprint,
+                    fingerprintB: b.fingerprint,
+                });
+            }
+        }
+    }
+    return pairs;
+}
+/**
+ * How many distinct identifiers/literals both bodies use.
+ *
+ * Reads `Fingerprint.texts`, which `computeSimilarity` deliberately ignores:
+ * the score is over syntax kinds so that a renamed copy still scores as a
+ * clone. That is right for scoring and wrong for deciding whether two bodies
+ * are related at all, which is what this answers.
+ */
+function sharedVocabulary(a, b) {
+    const theirs = new Set();
+    for (const text of b.texts)
+        if (text !== undefined)
+            theirs.add(text);
+    const counted = new Set();
+    for (const text of a.texts) {
+        if (text === undefined || counted.has(text))
+            continue;
+        if (theirs.has(text))
+            counted.add(text);
+    }
+    return counted.size;
+}
+//# sourceMappingURL=similar-pairs.js.map

package/dist/smells/similar-pairs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar-pairs.js","sourceRoot":"","sources":["../../src/smells/similar-pairs.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AAwBtE;;;;;;;GAOG;AAEH;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,CAAe,EAAE,CAAe;IACrD,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,CAAA;IACzB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,CAAA;IACzB,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAA;IAClC,IAAI,KAAK,CAAC,aAAa,EAAE,KAAK,KAAK,CAAC,aAAa,EAAE;QAAE,OAAO,KAAK,CAAA;IACjE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACzD,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACzD,OAAO,CAAC,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,CAAA;AACjF,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,cAAc,CAAC,SAAyB;IACtD,MAAM,MAAM,GAA4B,EAAE,CAAA;IAC1C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI;YAAE,SAAQ;QACnB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC1D,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,gBAAgB,CAC9B,KAA8B,EAC9B,aAAqB,EACrB,qBAA6B;IAE7B,MAAM,KAAK,GAAkB,EAAE,CAAA;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAQ;YACtB,sFAAsF;YACtF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;YAC3E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;YAC3E,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,QAAQ,GAAG,aAAa,EAAE,CAAC;gBACxD,SAAQ;YACV,CAAC;YACD,4EAA4E;YAC5E,2EAA2E;YAC3E,qEAAqE;YACrE,uCAAuC;YACvC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,CAAC,WAAW,CAAC,kBAAkB,EAChC,CAAC,CAAC,WAAW,CAAC,kBAAkB,CACjC,CAAA;YACD,IAAI,WAAW,GAAG,qBAAqB,EAAE,CAAC;gBACxC,SAAQ;YACV,CAAC;YACD,+DAA+D;YAC/D,yEAAyE;YACzE,uEAAuE;YACvE,yEAAyE;YACzE,yEAAyE;YACzE,kEAAkE;YAClE,EAAE;YACF,mEAAmE;YACnE,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAQ;YACvC,mEAAmE;YACnE,+DAA+D;YAC/D,gEAAgE;YAChE,uEAAuE;YACvE,wEAAwE;YACxE,oEAAoE;YACpE,qEAAqE;YACrE,yEAAyE;YACzE,oEAAoE;YACpE,uEAAuE;YACvE,EAAE;YACF,mEAAmE;YACnE,sEAAsE;YACtE,oEAAoE;YACpE,oEAAoE;YACpE,EAAE;YACF,qEAAqE;YACrE,yEAAyE;YACzE,uEAAuE;YACvE,uEAAuE;YACvE,kEAAkE;YAClE,sEAAsE;YACtE,oEAAoE;YACpE,gCAAgC;YAChC,IAAI,WAAW,GAAG,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC;gBAAE,SAAQ;YACrF,MAAM,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAA;YAClE,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;gBAChC,KAAK,CAAC,IAAI,CAAC;oBACT,CAAC,EAAE,CAAC,CAAC,EAAE;oBACP,CAAC,EAAE,CAAC,CAAC,EAAE;oBACP,UAAU;oBACV,YAAY,EAAE,CAAC,CAAC,WAAW;oBAC3B,YAAY,EAAE,CAAC,CAAC,WAAW;iBAC5B,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CAAC,CAAc,EAAE,CAAc;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK;QAAE,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACpE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QACrD,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACzC,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,CAAA;AACrB,CAAC"}

package/dist/smells/smell-builder.d.ts

@@ -1,14 +1,8 @@
 import type { ArchProject } from '../core/project.js';
-import type { ArchViolation } from '../core/violation.js';
-import { TerminalBuilder } from '@nielspeter/eess';
-/**
- * Base class for smell detector builders.
- * Extends TerminalBuilder for shared terminal methods (check/warn/excluding/because/rule).
- *
- * SmellBuilder does NOT extend RuleBuilder — smell detectors have a
- * different chain grammar (no .that()/.should()) and execution model
- * (pairwise comparison rather than individual element evaluation).
- */
+import type { CollectResult } from '../core/terminal-builder.js';
+import type { ArchViolation } from '@nielspeter/eess';
+import type { GlobNode } from '@nielspeter/eess';
+import { TerminalBuilder } from '../core/terminal-builder.js';
 export declare abstract class SmellBuilder extends TerminalBuilder {
     protected readonly project: ArchProject;
     protected _folders: string[];
@@ -16,8 +10,27 @@ export declare abstract class SmellBuilder extends TerminalBuilder {
     protected _ignoreTests: boolean;
     protected _ignorePaths: string[];
     protected _groupByFolder: boolean;
+    /**
+     * This family's own narrowing, named — plan 0099 / ADR-010 part 4.
+     *
+     * `_minLines` defaults to 5 and neither `agentGuardrails` nor `strictBoundaries`
+     * exposes a knob for it, so a user whose bodies are all shorter is told their
+     * rule enforces nothing by a filter they never wrote and cannot reach. Naming it
+     * is the difference between an actionable finding and one that sends an agent
+     * hunting for filters that do not exist.
+     */
+    /** This family counts function bodies, not subjects — plan 0099. */
+    protected examinedUnitNoun(): string;
+    protected narrowingHint(): string | undefined;
     constructor(project: ArchProject);
-    /** Scope detection to files matching the glob pattern. */
+    /**
+     * Scope detection to files matching the glob pattern.
+     *
+     * Note the name: this matches the **whole file path**, not the directory
+     * portion (`passesFileFilters` applies the matcher to `sf.getFilePath()`).
+     * So its declared kind is `file-path`, which is why plan 0069 derives `kind`
+     * from the string a matcher is applied to rather than from the method name.
+     */
     inFolder(glob: string): this;
     /** Ignore functions/files shorter than N lines. Default: 5. */
     minLines(n: number): this;
@@ -25,12 +38,44 @@ export declare abstract class SmellBuilder extends TerminalBuilder {
     ignoreTests(): this;
     /** Exclude files matching the given glob patterns. */
     ignorePaths(...globs: string[]): this;
+    /** The project this detector was built against. See `RuleBuilder.getProject`. */
+    getProject(): ArchProject;
+    /**
+     * The globs this detector was scoped with.
+     *
+     * `inFolder` is `discovery`: it defines the population to scan, so a glob
+     * matching nothing means the detector scans nothing. `ignorePaths` is
+     * `exclusion` and is never a fault — an exclusion matching zero files is
+     * remedy-optional (proposal 006).
+     *
+     * Repeated `inFolder()` calls OR together (`folderMatchers.some`), so they
+     * form one `any` node rather than one node each.
+     */
+    globs(): readonly GlobNode[];
     /** Group violation output by directory. */
     groupByFolder(): this;
+    /**
+     * An independent copy, carrying both scope lists.
+     *
+     * Without this, `ignorePaths()` on a copy would push into the array the
+     * original still points at — and a leaked *ignore* is a false green: the
+     * next detector off the same held builder would silently skip those files.
+     */
+    protected copy(): this;
     /** Delegate to detect() for the terminal builder pipeline. */
-    protected collectViolations(): ArchViolation[];
+    protected collectViolations(): CollectResult;
     /** Subclasses implement: run detection, return violations. */
     protected abstract detect(): ArchViolation[];
+    /**
+     * Subclasses implement: units this detector examined — plan 0098.
+     *
+     * Declared here rather than left to the subclasses because
+     * `collectViolations()` is the seam and it cannot see a hook the subclass
+     * merely happens to have. Plan 0096 added `examinedUnits()` to both detectors
+     * and this class could not reach either; a new detector would have compiled
+     * with no evidence at all.
+     */
+    abstract examinedUnits(): number;
     /** Subclasses implement: human-readable rule description. */
     protected abstract describe(): string;
 }

package/dist/smells/smell-builder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"smell-builder.d.ts","sourceRoot":"","sources":["../../src/smells/smell-builder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAElD;;;;;;;GAOG;AACH,8BAAsB,YAAa,SAAQ,eAAe;IAO5C,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,WAAW;IANnD,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAK;IACjC,SAAS,CAAC,SAAS,SAAI;IACvB,SAAS,CAAC,YAAY,UAAQ;IAC9B,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,CAAK;IACrC,SAAS,CAAC,cAAc,UAAQ;gBAED,OAAO,EAAE,WAAW;IAInD,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAK5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAKzB,+DAA+D;IAC/D,WAAW,IAAI,IAAI;IAKnB,sDAAsD;IACtD,WAAW,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAKrC,2CAA2C;IAC3C,aAAa,IAAI,IAAI;IAKrB,8DAA8D;IAC9D,SAAS,CAAC,iBAAiB,IAAI,aAAa,EAAE;IAI9C,8DAA8D;IAC9D,SAAS,CAAC,QAAQ,CAAC,MAAM,IAAI,aAAa,EAAE;IAE5C,6DAA6D;IAC7D,SAAS,CAAC,QAAQ,CAAC,QAAQ,IAAI,MAAM;CACtC"}
+{"version":3,"file":"smell-builder.d.ts","sourceRoot":"","sources":["../../src/smells/smell-builder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAA;AAChE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AAGhD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAA;AAc7D,8BAAsB,YAAa,SAAQ,eAAe;IAiD5C,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,WAAW;IAhDnD,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAK;IACjC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAoB;IAC/C,SAAS,CAAC,YAAY,UAAQ;IAC9B,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,CAAK;IACrC,SAAS,CAAC,cAAc,UAAQ;IAEhC;;;;;;;;OAQG;IACH,oEAAoE;cACjD,gBAAgB,IAAI,MAAM;cAI1B,aAAa,IAAI,MAAM,GAAG,SAAS;gBA4BvB,OAAO,EAAE,WAAW;IAInD;;;;;;;OAOG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAM5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAMzB,+DAA+D;IAC/D,WAAW,IAAI,IAAI;IAMnB,sDAAsD;IACtD,WAAW,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAMrC,iFAAiF;IACjF,UAAU,IAAI,WAAW;IAIzB;;;;;;;;;;OAUG;IACM,KAAK,IAAI,SAAS,QAAQ,EAAE;IAuBrC,2CAA2C;IAC3C,aAAa,IAAI,IAAI;IAMrB;;;;;;OAMG;cACgB,IAAI,IAAI,IAAI;IAO/B,8DAA8D;IAC9D,SAAS,CAAC,iBAAiB,IAAI,aAAa;IAI5C,8DAA8D;IAC9D,SAAS,CAAC,QAAQ,CAAC,MAAM,IAAI,aAAa,EAAE;IAE5C;;;;;;;;OAQG;IACH,QAAQ,CAAC,aAAa,IAAI,MAAM;IAEhC,6DAA6D;IAC7D,SAAS,CAAC,QAAQ,CAAC,QAAQ,IAAI,MAAM;CACtC"}

package/dist/smells/smell-builder.js

@@ -1,4 +1,7 @@
-import { TerminalBuilder } from '@nielspeter/eess';
+import { stampGlobs } from '@nielspeter/eess/internal';
+import { globAnyOf, collectResult } from '@nielspeter/eess';
+import { TerminalBuilder } from '../core/terminal-builder.js';
+import { isProjectRelative } from '../core/project-relative.js';
 /**
  * Base class for smell detector builders.
  * Extends TerminalBuilder for shared terminal methods (check/warn/excluding/because/rule).
@@ -7,45 +10,140 @@ import { TerminalBuilder } from '@nielspeter/eess';
  * different chain grammar (no .that()/.should()) and execution model
  * (pairwise comparison rather than individual element evaluation).
  */
+/** The `minLines` threshold applied when the author sets none. */
+const DEFAULT_MIN_LINES = 5;
 export class SmellBuilder extends TerminalBuilder {
     project;
     _folders = [];
-    _minLines = 5;
+    _minLines = DEFAULT_MIN_LINES;
     _ignoreTests = false;
     _ignorePaths = [];
     _groupByFolder = false;
+    /**
+     * This family's own narrowing, named — plan 0099 / ADR-010 part 4.
+     *
+     * `_minLines` defaults to 5 and neither `agentGuardrails` nor `strictBoundaries`
+     * exposes a knob for it, so a user whose bodies are all shorter is told their
+     * rule enforces nothing by a filter they never wrote and cannot reach. Naming it
+     * is the difference between an actionable finding and one that sends an agent
+     * hunting for filters that do not exist.
+     */
+    /** This family counts function bodies, not subjects — plan 0099. */
+    examinedUnitNoun() {
+        return 'function bodies';
+    }
+    narrowingHint() {
+        const applied = [`minLines(${String(this._minLines)})`];
+        if (this._folders.length > 0)
+            applied.push(`inFolder(${this._folders.join(', ')})`);
+        if (this._ignorePaths.length > 0)
+            applied.push(`ignorePaths(${this._ignorePaths.join(', ')})`);
+        if (this._ignoreTests)
+            applied.push('ignoreTests()');
+        // The "you did not write it" clause is TRUE only while the value is still the
+        // default. Rendered with an author-written `.minLines(500)` it said
+        // "minLines(500) — minLines defaults to 5, a default you did not write",
+        // which is false on the path that produced it: an agent goes hunting for
+        // where 5 comes from and never touches the 500 that is the actual fault.
+        // ADR-009 rule 2, on an unsuppressable hard failure.
+        // States the filters as FACT, and does not claim they caused the emptiness.
+        //
+        // "Its own narrowing removed them" asserts removal. Measured on a types-only
+        // corpus with the default threshold: there were zero function bodies, so
+        // `minLines` removed nothing — the sentence named a false cause and pointed at
+        // a knob that `agentGuardrails` and `strictBoundaries` expose no setter for,
+        // on an unsuppressable hard failure. `narrowingHint()`'s own docstring
+        // promises the caller "names the possibility rather than asserting a cause it
+        // cannot verify"; this is the family honouring that rather than the base
+        // softening it afterwards.
+        const wroteItThemselves = this._minLines !== DEFAULT_MIN_LINES;
+        return wroteItThemselves
+            ? `Its narrowing was: ${applied.join(', ')}.`
+            : `Its narrowing was: ${applied.join(', ')}` +
+                ` — minLines defaults to ${String(DEFAULT_MIN_LINES)}, a default you did not write.`;
+    }
     constructor(project) {
         super();
         this.project = project;
     }
-    /** Scope detection to files matching the glob pattern. */
+    /**
+     * Scope detection to files matching the glob pattern.
+     *
+     * Note the name: this matches the **whole file path**, not the directory
+     * portion (`passesFileFilters` applies the matcher to `sf.getFilePath()`).
+     * So its declared kind is `file-path`, which is why plan 0069 derives `kind`
+     * from the string a matcher is applied to rather than from the method name.
+     */
     inFolder(glob) {
-        this._folders.push(glob);
-        return this;
+        const next = this.copy();
+        next._folders.push(glob);
+        return next;
     }
     /** Ignore functions/files shorter than N lines. Default: 5. */
     minLines(n) {
-        this._minLines = n;
-        return this;
+        const next = this.copy();
+        next._minLines = n;
+        return next;
     }
     /** Exclude test files (*.test.ts, *.spec.ts, __tests__/**). */
     ignoreTests() {
-        this._ignoreTests = true;
-        return this;
+        const next = this.copy();
+        next._ignoreTests = true;
+        return next;
     }
     /** Exclude files matching the given glob patterns. */
     ignorePaths(...globs) {
-        this._ignorePaths.push(...globs);
-        return this;
+        const next = this.copy();
+        next._ignorePaths.push(...globs);
+        return next;
+    }
+    /** The project this detector was built against. See `RuleBuilder.getProject`. */
+    getProject() {
+        return this.project;
+    }
+    /**
+     * The globs this detector was scoped with.
+     *
+     * `inFolder` is `discovery`: it defines the population to scan, so a glob
+     * matching nothing means the detector scans nothing. `ignorePaths` is
+     * `exclusion` and is never a fault — an exclusion matching zero files is
+     * remedy-optional (proposal 006).
+     *
+     * Repeated `inFolder()` calls OR together (`folderMatchers.some`), so they
+     * form one `any` node rather than one node each.
+     */
+    globs() {
+        const trees = [];
+        if (this._folders.length > 0) {
+            trees.push(stampGlobs(globAnyOf(this._folders, 'file-path', this._folders.every((g) => isProjectRelative(g)) ? 'normalized' : 'absolute'), 'discovery', (g) => `inFolder("${g.glob}")`));
+        }
+        for (const glob of this._ignorePaths) {
+            trees.push(stampGlobs(globAnyOf([glob], 'file-path'), 'exclusion', (g) => `ignorePaths("${g.glob}")`));
+        }
+        return trees;
     }
     /** Group violation output by directory. */
     groupByFolder() {
-        this._groupByFolder = true;
-        return this;
+        const next = this.copy();
+        next._groupByFolder = true;
+        return next;
+    }
+    /**
+     * An independent copy, carrying both scope lists.
+     *
+     * Without this, `ignorePaths()` on a copy would push into the array the
+     * original still points at — and a leaked *ignore* is a false green: the
+     * next detector off the same held builder would silently skip those files.
+     */
+    copy() {
+        const clone = super.copy();
+        clone._folders = [...this._folders];
+        clone._ignorePaths = [...this._ignorePaths];
+        return clone;
     }
     /** Delegate to detect() for the terminal builder pipeline. */
     collectViolations() {
-        return this.detect();
+        return collectResult(this.detect(), { examined: this.examinedUnits() });
     }
 }
 //# sourceMappingURL=smell-builder.js.map

package/dist/smells/smell-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"smell-builder.js","sourceRoot":"","sources":["../../src/smells/smell-builder.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAElD;;;;;;;GAOG;AACH,MAAM,OAAgB,YAAa,SAAQ,eAAe;IAOzB;IANrB,QAAQ,GAAa,EAAE,CAAA;IACvB,SAAS,GAAG,CAAC,CAAA;IACb,YAAY,GAAG,KAAK,CAAA;IACpB,YAAY,GAAa,EAAE,CAAA;IAC3B,cAAc,GAAG,KAAK,CAAA;IAEhC,YAA+B,OAAoB;QACjD,KAAK,EAAE,CAAA;QADsB,YAAO,GAAP,OAAO,CAAa;IAEnD,CAAC;IAED,0DAA0D;IAC1D,QAAQ,CAAC,IAAY;QACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,+DAA+D;IAC/D,QAAQ,CAAC,CAAS;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;QAClB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,+DAA+D;IAC/D,WAAW;QACT,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,sDAAsD;IACtD,WAAW,CAAC,GAAG,KAAe;QAC5B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;QAChC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,2CAA2C;IAC3C,aAAa;QACX,IAAI,CAAC,cAAc,GAAG,IAAI,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED,8DAA8D;IACpD,iBAAiB;QACzB,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;CAOF"}
+{"version":3,"file":"smell-builder.js","sourceRoot":"","sources":["../../src/smells/smell-builder.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAA;AACtD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAA;AAC7D,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAA;AAE/D;;;;;;;GAOG;AACH,kEAAkE;AAClE,MAAM,iBAAiB,GAAG,CAAC,CAAA;AAE3B,MAAM,OAAgB,YAAa,SAAQ,eAAe;IAiDzB;IAhDrB,QAAQ,GAAa,EAAE,CAAA;IACvB,SAAS,GAAW,iBAAiB,CAAA;IACrC,YAAY,GAAG,KAAK,CAAA;IACpB,YAAY,GAAa,EAAE,CAAA;IAC3B,cAAc,GAAG,KAAK,CAAA;IAEhC;;;;;;;;OAQG;IACH,oEAAoE;IACjD,gBAAgB;QACjC,OAAO,iBAAiB,CAAA;IAC1B,CAAC;IAEkB,aAAa;QAC9B,MAAM,OAAO,GAAG,CAAC,YAAY,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QACvD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACnF,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC9F,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;QACpD,8EAA8E;QAC9E,oEAAoE;QACpE,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,qDAAqD;QACrD,4EAA4E;QAC5E,EAAE;QACF,6EAA6E;QAC7E,yEAAyE;QACzE,+EAA+E;QAC/E,6EAA6E;QAC7E,uEAAuE;QACvE,8EAA8E;QAC9E,yEAAyE;QACzE,2BAA2B;QAC3B,MAAM,iBAAiB,GAAG,IAAI,CAAC,SAAS,KAAK,iBAAiB,CAAA;QAC9D,OAAO,iBAAiB;YACtB,CAAC,CAAC,sBAAsB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YAC7C,CAAC,CAAC,sBAAsB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACxC,2BAA2B,MAAM,CAAC,iBAAiB,CAAC,gCAAgC,CAAA;IAC5F,CAAC;IAED,YAA+B,OAAoB;QACjD,KAAK,EAAE,CAAA;QADsB,YAAO,GAAP,OAAO,CAAa;IAEnD,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,IAAY;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,+DAA+D;IAC/D,QAAQ,CAAC,CAAS;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;QAClB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,+DAA+D;IAC/D,WAAW;QACT,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,sDAAsD;IACtD,WAAW,CAAC,GAAG,KAAe;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;QAChC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,iFAAiF;IACjF,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED;;;;;;;;;;OAUG;IACM,KAAK;QACZ,MAAM,KAAK,GAAe,EAAE,CAAA;QAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CACR,UAAU,CACR,SAAS,CACP,IAAI,CAAC,QAAQ,EACb,WAAW,EACX,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,UAAU,CAC7E,EACD,WAAW,EACX,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,IAAI,IAAI,CAC/B,CACF,CAAA;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CACR,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,IAAI,IAAI,CAAC,CAC3F,CAAA;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,2CAA2C;IAC3C,aAAa;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;OAMG;IACgB,IAAI;QACrB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAA;QAC1B,KAAK,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAA;QACnC,KAAK,CAAC,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAC3C,OAAO,KAAK,CAAA;IACd,CAAC;IAED,8DAA8D;IACpD,iBAAiB;QACzB,OAAO,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,CAAA;IACzE,CAAC;CAkBF"}