@nielspeter/eess-ts 0.2.1 → 0.5.0

package/dist/smells/clusters.js

@@ -0,0 +1,124 @@
+import { ArchConfigError } from '@nielspeter/eess';
+/**
+ * Group reported pairs into connected components.
+ *
+ * A pair is the wrong unit of report and it is not a close call. Measured on a
+ * ~5,600-file production monorepo: 407 clusters produced **4,770** pair
+ * findings, the eight largest clusters alone produced 49% of them, one cluster
+ * of 89 members produced 398, and the worst single function was named 29 times.
+ *
+ * Every one of those findings can be true and the output is still unreadable,
+ * because N mutually-similar bodies carry ONE observation and emit N^2/2 lines
+ * of it. The observation is "these 89 share a shape", which is also the unit a
+ * reader can act on. That is what this returns.
+ */
+export function clusterPairs(pairs) {
+    const parent = new Map();
+    const find = (x) => {
+        let root = parent.get(x) ?? x;
+        if (root === x) {
+            parent.set(x, x);
+            return x;
+        }
+        root = find(root);
+        parent.set(x, root);
+        return root;
+    };
+    const union = (a, b) => {
+        const ra = find(a);
+        const rb = find(b);
+        if (ra !== rb)
+            parent.set(ra, rb);
+    };
+    for (const pair of pairs)
+        union(pair.a, pair.b);
+    // First-seen order throughout, so the report is stable across runs. Map
+    // iteration order is insertion order, and `pairs` arrives in the order the
+    // comparison found them, which is the source-file walk order.
+    const byRoot = new Map();
+    const seen = new Set();
+    for (const pair of pairs) {
+        const root = find(pair.a);
+        let entry = byRoot.get(root);
+        if (!entry) {
+            entry = { members: [], pairs: [] };
+            byRoot.set(root, entry);
+        }
+        entry.pairs.push(pair);
+        for (const fn of [pair.a, pair.b]) {
+            if (seen.has(fn))
+                continue;
+            seen.add(fn);
+            entry.members.push(fn);
+        }
+    }
+    // Narrowed here, at the one place clusters are constructed, rather than at
+    // every place they are read. An entry exists only because a pair created it,
+    // and both of that pair's ends are pushed, so `members` always holds at least
+    // two — but the compiler cannot see that through `push`. A cluster that
+    // somehow held fewer is a broken invariant in THIS function, and dropping it
+    // silently at emission is what the type change exists to prevent, so it is
+    // reported as a configuration finding rather than filtered away.
+    return [...byRoot.values()].map((entry) => {
+        const [first, second, ...rest] = entry.members;
+        if (!first || !second) {
+            throw new ArchConfigError('duplicateBodies', 'a similarity cluster was built with fewer than two members, which cannot happen: ' +
+                'every cluster is created from a pair and both of its ends are recorded. ' +
+                'This is a defect in clusterPairs, not in the code being analysed.');
+        }
+        // Annotated, never cast (ADR-005): the annotation makes the compiler CHECK
+        // the literal is a valid `NonEmptyMembers`, where a cast would only assert
+        // it.
+        const members = [first, second, ...rest];
+        return {
+            members,
+            pairs: entry.pairs,
+            peakSimilarity: entry.pairs.reduce((best, p) => Math.max(best, p.similarity), 0),
+        };
+    });
+}
+/**
+ * How likely a cluster is to be worth acting on, highest first.
+ *
+ * Not a filter and deliberately not a score change — the similarity number is
+ * left exactly as it was. This decides only what a reader sees first, because at
+ * 4,770 findings the order IS the product.
+ *
+ * The signal is the one the fingerprint throws away: a body's identifiers are
+ * ignored by design (that is what makes the score a type-2 clone score), and so
+ * is the DECLARATION's own name, which is where the evidence was. Measured over
+ * that same corpus, bucketed by how the two names relate:
+ *
+ * | bucket                        | share | reading                    |
+ * | ----------------------------- | ----- | -------------------------- |
+ * | different file, different name | 56%  | convergent idiom           |
+ * | same class                     | 20%  | siblings, often extractable |
+ * | different file, SAME name      | 14%  | a COPY of one function     |
+ * | same file, different class     | 10%  | co-located                 |
+ *
+ * Two pairs from that run, both scored 100%: `timestampPrefix` in two files (a
+ * literal copy) and two unrelated SDK wrapper methods (a shared idiom). Same
+ * number on screen, opposite verdicts, and the thing that separates them costs
+ * nothing to compute.
+ *
+ * **It is a ranking and not a filter on purpose.** Dropping the different-name
+ * bucket would discard real same-class duplication — one repository in that
+ * corpus has six `exists*` methods differing only in a table name. Dropping
+ * cross-file would have discarded the finding that led to bug 0227.
+ */
+export function clusterRank(cluster) {
+    const bare = (fn) => (fn.getName() ?? '<anonymous>').split('.').pop() ?? '';
+    const file = (fn) => fn.getSourceFile().getFilePath();
+    let best = 0;
+    for (const pair of cluster.pairs) {
+        const sameFile = file(pair.a) === file(pair.b);
+        const sameName = bare(pair.a) === bare(pair.b);
+        // A copy of one function into another file is the most actionable thing
+        // this detector can find, and the cheapest to verify.
+        const score = !sameFile && sameName ? 3 : sameFile ? 2 : 1;
+        if (score > best)
+            best = score;
+    }
+    return best;
+}
+//# sourceMappingURL=clusters.js.map

package/dist/smells/clusters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clusters.js","sourceRoot":"","sources":["../../src/smells/clusters.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAoClD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,KAA6B;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA8B,CAAA;IACpD,MAAM,IAAI,GAAG,CAAC,CAAe,EAAgB,EAAE;QAC7C,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAChB,OAAO,CAAC,CAAA;QACV,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACnB,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,CAAC,CAAe,EAAE,CAAe,EAAQ,EAAE;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,IAAI,EAAE,KAAK,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IACnC,CAAC,CAAA;IACD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;IAE/C,wEAAwE;IACxE,2EAA2E;IAC3E,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmE,CAAA;IACzF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAA;IACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACzB,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAA;YAClC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACzB,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAQ;YAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACZ,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,8EAA8E;IAC9E,wEAAwE;IACxE,6EAA6E;IAC7E,2EAA2E;IAC3E,iEAAiE;IACjE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACxC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAA;QAC9C,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,IAAI,eAAe,CACvB,iBAAiB,EACjB,mFAAmF;gBACjF,0EAA0E;gBAC1E,mEAAmE,CACtE,CAAA;QACH,CAAC;QACD,2EAA2E;QAC3E,2EAA2E;QAC3E,MAAM;QACN,MAAM,OAAO,GAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAA;QACzD,OAAO;YACL,OAAO;YACP,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,cAAc,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;SACjF,CAAA;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,UAAU,WAAW,CAAC,OAAuB;IACjD,MAAM,IAAI,GAAG,CAAC,EAAgB,EAAU,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,aAAa,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAA;IACjG,MAAM,IAAI,GAAG,CAAC,EAAgB,EAAU,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,CAAA;IAC3E,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC9C,wEAAwE;QACxE,sDAAsD;QACtD,MAAM,KAAK,GAAG,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1D,IAAI,KAAK,GAAG,IAAI;YAAE,IAAI,GAAG,KAAK,CAAA;IAChC,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/smells/duplicate-bodies.d.ts

@@ -1,24 +1,111 @@
+import type { RuleDescription } from '@nielspeter/eess';
 import { SmellBuilder } from './smell-builder.js';
-import type { ArchViolation } from '../core/violation.js';
+import type { ArchViolation } from '@nielspeter/eess';
 import type { ArchProject } from '../core/project.js';
 export declare class DuplicateBodiesBuilder extends SmellBuilder {
     private _minSimilarity;
+    private _minDistinctVocabulary;
     constructor(project: ArchProject);
     /** Set the AST similarity threshold. Default: 0.85. */
     withMinSimilarity(threshold: number): this;
+    /**
+     * Minimum count of distinct identifier/literal text either body must carry
+     * before a pair is even compared — not raw line count, and not similarity.
+     * Two bodies can share a syntactic shape for no reason other than the shape
+     * being mandated (a wither, a getter, a boilerplate skeleton); below this
+     * threshold a "match" carries no information about what the code actually
+     * does. Default: 8 — see plan 0103's Phase 0 triage for how it was chosen.
+     * Tune down for a codebase with terser naming than this default assumes;
+     * tune up if short, low-vocabulary bodies keep surfacing as noise.
+     */
+    minDistinctVocabulary(n: number): this;
+    /**
+     * Named by id or by what the detector checks — the inherited version returns
+     * the sentinel `'unnamed'`, and `inconsistent-siblings.ts` already carries this
+     * override for that reason.
+     *
+     * It became load-bearing in plan 0099: the floor makes an over-filtered
+     * detector FAIL, and `dedupeConfigFindings` keys on `(file, ruleId ?? rule,
+     * element)`. With `file: ''` and `'unnamed'` in both other slots, three
+     * genuinely different detectors — different similarity, different
+     * `ignorePaths` — collapsed into one finding claiming they were "one option"
+     * and "one edit". Two were silently discarded and the survivor said
+     * `Rule: unnamed`.
+     */
+    describeRule(): RuleDescription;
     protected detect(): ArchViolation[];
     protected describe(): string;
     /** Check if a file path passes all glob-based filters. */
+    /**
+     * The three matcher sets travel together as one `filters` — they are one
+     * configuration, and four positional `picomatch.Matcher[]` arguments in a row
+     * are exactly the transposition risk the parameter cap exists to prevent.
+     */
     private passesFileFilters;
     /** Check if a function body meets the minimum line count. */
     private meetsMinLines;
     /** Collect all functions matching folder/path/test filters. */
+    /**
+     * Bodies entering pairwise comparison — plan 0096, and the ONE method both
+     * readers call.
+     *
+     * The seam is AFTER `minLines` and the path filters: a project can load 300
+     * files while every body sits under the threshold, and the count that notices
+     * has to be taken where the comparison receives its input, not where the files
+     * were read.
+     *
+     * No fingerprinting to count. `meetsMinLines` already returns false for a
+     * bodyless function, so `fingerprintAll(xs).length === xs.length` **always** —
+     * fingerprinting to answer "is it zero" is a full AST pass of dead work on
+     * what becomes the hot path of every consumer's `diagnose()` call.
+     */
+    private selected;
+    /** Units this detector examined — plan 0096. */
+    examinedUnits(): number;
     private collectFilteredFunctions;
-    /** Build fingerprints for all collected functions. */
-    private fingerprintAll;
-    /** Compare all pairs of fingerprints, collect those above threshold. */
-    private findSimilarPairs;
     /** Build violations from similar pairs. */
+    /**
+     * Report order for pairs — which, measured, never has anything to order.
+     *
+     * Extracted from {@link buildViolations} so that method is the violation shape
+     * and nothing else. Enforcement review of bug 0242 read this as a live defect
+     * (keyed on `a`, i.e. walk order, while the finding reports at the anchor).
+     * Probing it says otherwise: {@link buildViolations} is reached only from
+     * {@link buildClusterViolations} for a cluster of two or fewer members, and
+     * such a cluster carries exactly one pair. Instrumented to throw on more than
+     * one, the whole `packages/ts` suite (3604 tests) produced **zero** hits.
+     *
+     * So this cannot reorder anything today, and {@link orderedClusters} is what
+     * actually orders the output. The key is corrected anyway — being right if
+     * this ever becomes reachable costs one expression — but the correction fixes
+     * no observable behaviour, and saying otherwise would be the kind of unmeasured
+     * claim this repo keeps catching.
+     */
+    private orderedPairs;
+    /**
+     * One violation per CLUSTER of mutually-similar bodies, not per pair.
+     *
+     * A pair is the wrong unit and it is not a close call. Measured on a
+     * ~5,600-file production monorepo: 407 clusters emitted **4,770** pair
+     * findings — more findings than the 3,810 bodies that produced them. The
+     * eight largest clusters were 49% of the output, one cluster of 89 members
+     * emitted 398 lines, and the worst single function was named 29 times. Every
+     * one of those can be TRUE and the report is still unreadable, because N
+     * mutually-similar bodies carry one observation and emit N^2/2 lines of it.
+     *
+     * Two-member clusters — the common case — keep the exact message and identity
+     * they had before, so existing baselines for them are untouched. Only a group
+     * of three or more collapses, which is where the inflation lives.
+     */
+    /**
+     * Report order.
+     *
+     * Rank is presentation only — no pair is dropped and no score changes. At four
+     * thousand findings the ORDER is the product: what a reader sees first decides
+     * whether they read at all. `.groupByFolder()` still wins when asked for.
+     */
+    private orderedClusters;
+    private buildClusterViolations;
     private buildViolations;
 }
 //# sourceMappingURL=duplicate-bodies.d.ts.map

package/dist/smells/duplicate-bodies.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"duplicate-bodies.d.ts","sourceRoot":"","sources":["../../src/smells/duplicate-bodies.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AAIjD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AAYrD,qBAAa,sBAAuB,SAAQ,YAAY;IACtD,OAAO,CAAC,cAAc,CAAO;gBAEjB,OAAO,EAAE,WAAW;IAIhC,uDAAuD;IACvD,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IAK1C,SAAS,CAAC,MAAM,IAAI,aAAa,EAAE;IAOnC,SAAS,CAAC,QAAQ,IAAI,MAAM;IAK5B,0DAA0D;IAC1D,OAAO,CAAC,iBAAiB;IAYzB,6DAA6D;IAC7D,OAAO,CAAC,aAAa;IAOrB,+DAA+D;IAC/D,OAAO,CAAC,wBAAwB;IAuBhC,sDAAsD;IACtD,OAAO,CAAC,cAAc;IAUtB,wEAAwE;IACxE,OAAO,CAAC,gBAAgB;IA0BxB,2CAA2C;IAC3C,OAAO,CAAC,eAAe;CAsCxB"}
+{"version":3,"file":"duplicate-bodies.d.ts","sourceRoot":"","sources":["../../src/smells/duplicate-bodies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAIvD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AAOjD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AASrD,qBAAa,sBAAuB,SAAQ,YAAY;IACtD,OAAO,CAAC,cAAc,CAAO;IAC7B,OAAO,CAAC,sBAAsB,CAAI;gBAEtB,OAAO,EAAE,WAAW;IAIhC,uDAAuD;IACvD,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IAM1C;;;;;;;;;OASG;IACH,qBAAqB,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAMtC;;;;;;;;;;;;OAYG;IACM,YAAY,IAAI,eAAe;IAOxC,SAAS,CAAC,MAAM,IAAI,aAAa,EAAE;IAOnC,SAAS,CAAC,QAAQ,IAAI,MAAM;IAqB5B,0DAA0D;IAC1D;;;;OAIG;IACH,OAAO,CAAC,iBAAiB;IAoBzB,6DAA6D;IAC7D,OAAO,CAAC,aAAa;IAOrB,+DAA+D;IAC/D;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,QAAQ;IAIhB,gDAAgD;IAChD,aAAa,IAAI,MAAM;IAIvB,OAAO,CAAC,wBAAwB;IAmChC,2CAA2C;IAC3C;;;;;;;;;;;;;;;;OAgBG;IACH,OAAO,CAAC,YAAY;IAepB;;;;;;;;;;;;;;OAcG;IACH;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;IA8BvB,OAAO,CAAC,sBAAsB;IAe9B,OAAO,CAAC,eAAe;CAIxB"}

package/dist/smells/duplicate-bodies.js

@@ -1,37 +1,103 @@
 import picomatch from 'picomatch';
 import path from 'node:path';
+import { selectionMemo } from '@nielspeter/eess/internal';
 import { SmellBuilder } from './smell-builder.js';
 import { collectFunctions } from '../models/arch-function.js';
-import { buildFingerprint, computeSimilarity } from './fingerprint.js';
+import { fingerprintAll, findSimilarPairs } from './similar-pairs.js';
+import { anchorFile, clusterViolation, pairViolation } from './duplicate-report.js';
+import { clusterPairs, clusterRank } from './clusters.js';
+import { relativeToRoot } from '../core/project-relative.js';
 /** Test file patterns for ignoreTests(). */
 const TEST_PATTERNS = ['**/*.test.ts', '**/*.spec.ts', '**/__tests__/**'];
+const selectionOf = selectionMemo();
 export class DuplicateBodiesBuilder extends SmellBuilder {
     _minSimilarity = 0.85;
+    _minDistinctVocabulary = 8;
     constructor(project) {
         super(project);
     }
     /** Set the AST similarity threshold. Default: 0.85. */
     withMinSimilarity(threshold) {
-        this._minSimilarity = threshold;
-        return this;
+        const next = this.copy();
+        next._minSimilarity = threshold;
+        return next;
+    }
+    /**
+     * Minimum count of distinct identifier/literal text either body must carry
+     * before a pair is even compared — not raw line count, and not similarity.
+     * Two bodies can share a syntactic shape for no reason other than the shape
+     * being mandated (a wither, a getter, a boilerplate skeleton); below this
+     * threshold a "match" carries no information about what the code actually
+     * does. Default: 8 — see plan 0103's Phase 0 triage for how it was chosen.
+     * Tune down for a codebase with terser naming than this default assumes;
+     * tune up if short, low-vocabulary bodies keep surfacing as noise.
+     */
+    minDistinctVocabulary(n) {
+        const next = this.copy();
+        next._minDistinctVocabulary = n;
+        return next;
+    }
+    /**
+     * Named by id or by what the detector checks — the inherited version returns
+     * the sentinel `'unnamed'`, and `inconsistent-siblings.ts` already carries this
+     * override for that reason.
+     *
+     * It became load-bearing in plan 0099: the floor makes an over-filtered
+     * detector FAIL, and `dedupeConfigFindings` keys on `(file, ruleId ?? rule,
+     * element)`. With `file: ''` and `'unnamed'` in both other slots, three
+     * genuinely different detectors — different similarity, different
+     * `ignorePaths` — collapsed into one finding claiming they were "one option"
+     * and "one edit". Two were silently discarded and the survivor said
+     * `Rule: unnamed`.
+     */
+    describeRule() {
+        return {
+            ...super.describeRule(),
+            rule: this._metadata?.id ?? this.describe(),
+        };
     }
     detect() {
-        const functions = this.collectFilteredFunctions();
-        const fingerprinted = this.fingerprintAll(functions);
-        const pairs = this.findSimilarPairs(fingerprinted);
-        return this.buildViolations(pairs);
+        const functions = this.selected();
+        const fingerprinted = fingerprintAll(functions);
+        const pairs = findSimilarPairs(fingerprinted, this._minSimilarity, this._minDistinctVocabulary);
+        return this.buildClusterViolations(pairs);
     }
     describe() {
         const scope = this._folders.length > 0 ? this._folders.join(', ') : 'all files';
-        return `No duplicate function bodies in ${scope} (similarity >= ${String(this._minSimilarity)})`;
+        // EVERY narrowing that distinguishes two instances, not just similarity.
+        //
+        // This is the `Rule:` line a reader sees, and since plan 0099 it is also the
+        // dedupe identity for a detector with no `.rule({ id })`. Rendering only
+        // folders and similarity meant three detectors differing in `minLines` shared
+        // one key: measured, 3 findings collapsed to 1 claiming they were "one edit",
+        // and fixing the surviving threshold left the other two dead and green.
+        const filters = [
+            `minLines >= ${String(this._minLines)}`,
+            `minDistinctVocabulary >= ${String(this._minDistinctVocabulary)}`,
+        ];
+        if (this._ignorePaths.length > 0)
+            filters.push(`ignoring ${this._ignorePaths.join(', ')}`);
+        if (this._ignoreTests)
+            filters.push('ignoring tests');
+        return (`No duplicate function bodies in ${scope} ` +
+            `(similarity >= ${String(this._minSimilarity)}, ${filters.join(', ')})`);
     }
     /** Check if a file path passes all glob-based filters. */
-    passesFileFilters(filePath, folderMatchers, ignoreMatchers, testMatchers) {
-        if (folderMatchers.length > 0 && !folderMatchers.some((m) => m(filePath)))
+    /**
+     * The three matcher sets travel together as one `filters` — they are one
+     * configuration, and four positional `picomatch.Matcher[]` arguments in a row
+     * are exactly the transposition risk the parameter cap exists to prevent.
+     */
+    passesFileFilters(filePath, filters, fromRoot) {
+        const { folderMatchers, ignoreMatchers, testMatchers } = filters;
+        // Both forms, for every set — bug 0036. A project-relative `inFolder()` or
+        // `ignorePaths()` glob could never match an absolute path.
+        const hits = (ms) => ms.some((m) => m(filePath)) || (fromRoot !== undefined && ms.some((m) => m(fromRoot)));
+        if (folderMatchers.length > 0 && !hits(folderMatchers))
             return false;
-        if (ignoreMatchers.some((m) => m(filePath)))
+        if (hits(ignoreMatchers))
             return false;
-        if (testMatchers.some((m) => m(filePath)))
+        if (hits(testMatchers))
             return false;
         return true;
     }
@@ -44,6 +110,27 @@ export class DuplicateBodiesBuilder extends SmellBuilder {
         return lineCount >= this._minLines;
     }
     /** Collect all functions matching folder/path/test filters. */
+    /**
+     * Bodies entering pairwise comparison — plan 0096, and the ONE method both
+     * readers call.
+     *
+     * The seam is AFTER `minLines` and the path filters: a project can load 300
+     * files while every body sits under the threshold, and the count that notices
+     * has to be taken where the comparison receives its input, not where the files
+     * were read.
+     *
+     * No fingerprinting to count. `meetsMinLines` already returns false for a
+     * bodyless function, so `fingerprintAll(xs).length === xs.length` **always** —
+     * fingerprinting to answer "is it zero" is a full AST pass of dead work on
+     * what becomes the hot path of every consumer's `diagnose()` call.
+     */
+    selected() {
+        return selectionOf(this, () => this.collectFilteredFunctions());
+    }
+    /** Units this detector examined — plan 0096. */
+    examinedUnits() {
+        return this.selected().length;
+    }
     collectFilteredFunctions() {
         const sourceFiles = this.project.getSourceFiles();
         const folderMatchers = this._folders.map((g) => picomatch(g));
@@ -51,10 +138,16 @@ export class DuplicateBodiesBuilder extends SmellBuilder {
         const testMatchers = this._ignoreTests ? TEST_PATTERNS.map((g) => picomatch(g)) : [];
         const allFunctions = [];
         for (const sf of sourceFiles) {
-            if (!this.passesFileFilters(sf.getFilePath(), folderMatchers, ignoreMatchers, testMatchers)) {
+            if (!this.passesFileFilters(sf.getFilePath(), { folderMatchers, ignoreMatchers, testMatchers }, relativeToRoot(sf, sf.getFilePath(), this.project.tsConfigPath))) {
                 continue;
             }
-            for (const fn of collectFunctions(sf)) {
+            // 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 })) {
                 if (this.meetsMinLines(fn)) {
                     allFunctions.push(fn);
                 }
@@ -62,70 +155,107 @@ export class DuplicateBodiesBuilder extends SmellBuilder {
         }
         return allFunctions;
     }
-    /** Build fingerprints for all collected functions. */
-    fingerprintAll(functions) {
-        const result = [];
-        for (const fn of functions) {
-            const body = fn.getBody();
-            if (!body)
-                continue;
-            result.push({ fn, fingerprint: buildFingerprint(body) });
-        }
-        return result;
+    /** Build violations from similar pairs. */
+    /**
+     * Report order for pairs — which, measured, never has anything to order.
+     *
+     * Extracted from {@link buildViolations} so that method is the violation shape
+     * and nothing else. Enforcement review of bug 0242 read this as a live defect
+     * (keyed on `a`, i.e. walk order, while the finding reports at the anchor).
+     * Probing it says otherwise: {@link buildViolations} is reached only from
+     * {@link buildClusterViolations} for a cluster of two or fewer members, and
+     * such a cluster carries exactly one pair. Instrumented to throw on more than
+     * one, the whole `packages/ts` suite (3604 tests) produced **zero** hits.
+     *
+     * So this cannot reorder anything today, and {@link orderedClusters} is what
+     * actually orders the output. The key is corrected anyway — being right if
+     * this ever becomes reachable costs one expression — but the correction fixes
+     * no observable behaviour, and saying otherwise would be the kind of unmeasured
+     * claim this repo keeps catching.
+     */
+    orderedPairs(pairs) {
+        if (!this._groupByFolder)
+            return pairs;
+        // Keyed on the ANCHOR's folder, not on `a`'s. Which endpoint is `a` is the
+        // source walk; the anchor is where the finding says it is (bug 0242). While
+        // those agreed this was invisible, and after the anchor moved a finding
+        // reported in one folder would sort into another folder's group — the one
+        // thing this option exists to prevent.
+        const keyed = pairs.map((pair) => ({
+            pair,
+            folder: path.dirname(anchorFile([pair.a, pair.b])),
+        }));
+        keyed.sort((x, y) => (x.folder < y.folder ? -1 : x.folder > y.folder ? 1 : 0));
+        return keyed.map((k) => k.pair);
     }
-    /** Compare all pairs of fingerprints, collect those above threshold. */
-    findSimilarPairs(items) {
-        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: 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 < this._minSimilarity) {
-                    continue;
-                }
-                const similarity = computeSimilarity(a.fingerprint, b.fingerprint);
-                if (similarity >= this._minSimilarity) {
-                    pairs.push({ a: a.fn, b: b.fn, similarity });
-                }
-            }
-        }
-        return pairs;
+    /**
+     * One violation per CLUSTER of mutually-similar bodies, not per pair.
+     *
+     * A pair is the wrong unit and it is not a close call. Measured on a
+     * ~5,600-file production monorepo: 407 clusters emitted **4,770** pair
+     * findings — more findings than the 3,810 bodies that produced them. The
+     * eight largest clusters were 49% of the output, one cluster of 89 members
+     * emitted 398 lines, and the worst single function was named 29 times. Every
+     * one of those can be TRUE and the report is still unreadable, because N
+     * mutually-similar bodies carry one observation and emit N^2/2 lines of it.
+     *
+     * Two-member clusters — the common case — keep the exact message and identity
+     * they had before, so existing baselines for them are untouched. Only a group
+     * of three or more collapses, which is where the inflation lives.
+     */
+    /**
+     * Report order.
+     *
+     * Rank is presentation only — no pair is dropped and no score changes. At four
+     * thousand findings the ORDER is the product: what a reader sees first decides
+     * whether they read at all. `.groupByFolder()` still wins when asked for.
+     */
+    orderedClusters(clusters) {
+        // Decorated once, then sorted. `anchorFile` asks ts-morph for a path and a
+        // line per member, and a comparator runs O(n log n) times — on the 407
+        // clusters this module's own comments measure, computing it inside the
+        // comparator is tens of thousands of avoidable calls.
+        const keyed = clusters.map((cluster) => {
+            // The ANCHOR's folder, not `members[0]`'s: `members[0]` is the source walk
+            // and the finding is reported at the path-then-line minimum (bug 0242), so
+            // grouping on the walk would file a finding under a folder it is not
+            // reported in — the one thing `.groupByFolder()` exists to prevent.
+            const anchor = anchorFile(cluster.members);
+            return { cluster, anchor, folder: path.dirname(anchor), rank: clusterRank(cluster) };
+        });
+        // Plain `<`, not `localeCompare`: the latter's result depends on the
+        // runtime's ICU build and default locale, which is this record's own failure
+        // class — a report that reads differently on two machines — in the
+        // expression fixing it. `comparePositions` next door uses `<` too.
+        const text = (x, y) => (x < y ? -1 : x > y ? 1 : 0);
+        keyed.sort((x, y) => {
+            const primary = this._groupByFolder ? text(x.folder, y.folder) : y.rank - x.rank;
+            // The tie-break is what makes the SEQUENCE deterministic, and without it
+            // the default path had none: `clusterRank` returns one of four values over
+            // hundreds of clusters, and `Array#sort` is stable, so equal ranks kept
+            // walk order. Found by architecture review of bug 0242's fix; the branch
+            // had disclosed it in a test comment and nowhere else.
+            return primary !== 0 ? primary : text(x.anchor, y.anchor);
+        });
+        return keyed.map((k) => k.cluster);
     }
-    /** Build violations from similar pairs. */
-    buildViolations(pairs) {
-        const ruleDescription = this.describe();
+    buildClusterViolations(pairs) {
         const violations = [];
-        // Optionally sort pairs by folder for grouped output
-        const sortedPairs = this._groupByFolder
-            ? [...pairs].sort((x, y) => {
-                const folderA = path.dirname(x.a.getSourceFile().getFilePath());
-                const folderB = path.dirname(y.a.getSourceFile().getFilePath());
-                return folderA.localeCompare(folderB);
-            })
-            : pairs;
-        for (const pair of sortedPairs) {
-            const nameA = pair.a.getName() ?? '<anonymous>';
-            const fileA = pair.a.getSourceFile().getFilePath();
-            const lineA = pair.a.getStartLineNumber();
-            const nameB = pair.b.getName() ?? '<anonymous>';
-            const fileB = pair.b.getSourceFile().getFilePath();
-            const lineB = pair.b.getStartLineNumber();
-            const pct = Math.round(pair.similarity * 100);
-            violations.push({
-                rule: ruleDescription,
-                element: nameA,
-                file: fileA,
-                line: lineA,
-                message: `${nameA} (${fileA}:${String(lineA)}) is ${String(pct)}% similar to ${nameB} (${fileB}:${String(lineB)})`,
-                because: this._reason,
-            });
+        for (const cluster of this.orderedClusters(clusterPairs(pairs))) {
+            // A two-member cluster IS the pair, so it keeps the message and the
+            // baseline identity that already shipped. Only three-or-more collapses,
+            // which is where the inflation lives.
+            if (cluster.members.length <= 2) {
+                violations.push(...this.buildViolations(cluster.pairs));
+                continue;
+            }
+            violations.push(clusterViolation(cluster, { rule: this.describe(), because: this._reason }));
         }
         return violations;
     }
+    buildViolations(pairs) {
+        const context = { rule: this.describe(), because: this._reason };
+        return this.orderedPairs([...pairs]).map((pair) => pairViolation(pair, context));
+    }
 }
 //# sourceMappingURL=duplicate-bodies.js.map

package/dist/smells/duplicate-bodies.js.map

@@ -1 +1 @@
-{"version":3,"file":"duplicate-bodies.js","sourceRoot":"","sources":["../../src/smells/duplicate-bodies.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,WAAW,CAAA;AACjC,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AAC7D,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AAYtE,4CAA4C;AAC5C,MAAM,aAAa,GAAG,CAAC,cAAc,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAA;AAEzE,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAC9C,cAAc,GAAG,IAAI,CAAA;IAE7B,YAAY,OAAoB;QAC9B,KAAK,CAAC,OAAO,CAAC,CAAA;IAChB,CAAC;IAED,uDAAuD;IACvD,iBAAiB,CAAC,SAAiB;QACjC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;QAC/B,OAAO,IAAI,CAAA;IACb,CAAC;IAES,MAAM;QACd,MAAM,SAAS,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAA;QACjD,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAA;QAClD,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAA;IACpC,CAAC;IAES,QAAQ;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAA;QAC/E,OAAO,mCAAmC,KAAK,mBAAmB,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAA;IAClG,CAAC;IAED,0DAA0D;IAClD,iBAAiB,CACvB,QAAgB,EAChB,cAAmC,EACnC,cAAmC,EACnC,YAAiC;QAEjC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QACvF,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QACzD,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QACvD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,6DAA6D;IACrD,aAAa,CAAC,EAAgB;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAA;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAA;QACnD,OAAO,SAAS,IAAI,IAAI,CAAC,SAAS,CAAA;IACpC,CAAC;IAED,+DAA+D;IACvD,wBAAwB;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAA;QACjD,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QACjE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAEpF,MAAM,YAAY,GAAmB,EAAE,CAAA;QAEvC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,CAAC,EAAE,CAAC;gBAC5F,SAAQ;YACV,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,gBAAgB,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3B,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAA;IACrB,CAAC;IAED,sDAAsD;IAC9C,cAAc,CAAC,SAAyB;QAC9C,MAAM,MAAM,GAA4B,EAAE,CAAA;QAC1C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAA;YACzB,IAAI,CAAC,IAAI;gBAAE,SAAQ;YACnB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1D,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,wEAAwE;IAChE,gBAAgB,CACtB,KAA8B;QAE9B,MAAM,KAAK,GAAoE,EAAE,CAAA;QAEjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;gBAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;gBAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAE,SAAQ;gBACtB,oFAAoF;gBACpF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;gBAC3E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;gBAC3E,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;oBAC9D,SAAQ;gBACV,CAAC;gBACD,MAAM,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAA;gBAClE,IAAI,UAAU,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBACtC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,CAAA;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED,2CAA2C;IACnC,eAAe,CACrB,KAAsE;QAEtE,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAA;QACvC,MAAM,UAAU,GAAoB,EAAE,CAAA;QAEtC,qDAAqD;QACrD,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc;YACrC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,CAAC,CAAA;gBAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,CAAC,CAAA;gBAC/D,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;YACvC,CAAC,CAAC;YACJ,CAAC,CAAC,KAAK,CAAA;QAET,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,aAAa,CAAA;YAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,CAAA;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,CAAA;YAEzC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,aAAa,CAAA;YAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,CAAA;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,CAAA;YAEzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAA;YAE7C,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,eAAe;gBACrB,OAAO,EAAE,KAAK;gBACd,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,GAAG,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,MAAM,CAAC,GAAG,CAAC,gBAAgB,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG;gBAClH,OAAO,EAAE,IAAI,CAAC,OAAO;aACtB,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,UAAU,CAAA;IACnB,CAAC;CACF"}
+{"version":3,"file":"duplicate-bodies.js","sourceRoot":"","sources":["../../src/smells/duplicate-bodies.ts"],"names":[],"mappings":"AACA,OAAO,SAAS,MAAM,WAAW,CAAA;AACjC,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AAC7D,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAA;AAErE,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AACnF,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAA;AAKzD,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAA;AAE5D,4CAA4C;AAC5C,MAAM,aAAa,GAAG,CAAC,cAAc,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAA;AAEzE,MAAM,WAAW,GAAG,aAAa,EAAgB,CAAA;AAEjD,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAC9C,cAAc,GAAG,IAAI,CAAA;IACrB,sBAAsB,GAAG,CAAC,CAAA;IAElC,YAAY,OAAoB;QAC9B,KAAK,CAAC,OAAO,CAAC,CAAA;IAChB,CAAC;IAED,uDAAuD;IACvD,iBAAiB,CAAC,SAAiB;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;QAC/B,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;;;OASG;IACH,qBAAqB,CAAC,CAAS;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACxB,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAA;QAC/B,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;;;;;;OAYG;IACM,YAAY;QACnB,OAAO;YACL,GAAG,KAAK,CAAC,YAAY,EAAE;YACvB,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;SAC5C,CAAA;IACH,CAAC;IAES,MAAM;QACd,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAA;QACjC,MAAM,aAAa,GAAG,cAAc,CAAC,SAAS,CAAC,CAAA;QAC/C,MAAM,KAAK,GAAG,gBAAgB,CAAC,aAAa,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,sBAAsB,CAAC,CAAA;QAC/F,OAAO,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAA;IAC3C,CAAC;IAES,QAAQ;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAA;QAC/E,yEAAyE;QACzE,EAAE;QACF,6EAA6E;QAC7E,yEAAyE;QACzE,8EAA8E;QAC9E,8EAA8E;QAC9E,wEAAwE;QACxE,MAAM,OAAO,GAAG;YACd,eAAe,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;YACvC,4BAA4B,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,EAAE;SAClE,CAAA;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1F,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAA;QACrD,OAAO,CACL,mCAAmC,KAAK,GAAG;YAC3C,kBAAkB,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACxE,CAAA;IACH,CAAC;IAED,0DAA0D;IAC1D;;;;OAIG;IACK,iBAAiB,CACvB,QAAgB,EAChB,OAIC,EACD,QAAiB;QAEjB,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,OAAO,CAAA;QAChE,2EAA2E;QAC3E,2DAA2D;QAC3D,MAAM,IAAI,GAAG,CAAC,EAAuB,EAAW,EAAE,CAChD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QACxF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC;YAAE,OAAO,KAAK,CAAA;QACpE,IAAI,IAAI,CAAC,cAAc,CAAC;YAAE,OAAO,KAAK,CAAA;QACtC,IAAI,IAAI,CAAC,YAAY,CAAC;YAAE,OAAO,KAAK,CAAA;QACpC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,6DAA6D;IACrD,aAAa,CAAC,EAAgB;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAA;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAA;QACnD,OAAO,SAAS,IAAI,IAAI,CAAC,SAAS,CAAA;IACpC,CAAC;IAED,+DAA+D;IAC/D;;;;;;;;;;;;;OAaG;IACK,QAAQ;QACd,OAAO,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC,CAAA;IACjE,CAAC;IAED,gDAAgD;IAChD,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAA;IAC/B,CAAC;IAEO,wBAAwB;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAA;QACjD,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QACjE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAEpF,MAAM,YAAY,GAAmB,EAAE,CAAA;QAEvC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IACE,CAAC,IAAI,CAAC,iBAAiB,CACrB,EAAE,CAAC,WAAW,EAAE,EAChB,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,EAChD,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAChE,EACD,CAAC;gBACD,SAAQ;YACV,CAAC;YAED,yEAAyE;YACzE,sEAAsE;YACtE,uEAAuE;YACvE,iEAAiE;YACjE,wEAAwE;YACxE,oEAAoE;YACpE,KAAK,MAAM,EAAE,IAAI,gBAAgB,CAAC,EAAE,EAAE,EAAE,6BAA6B,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC/E,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3B,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAA;IACrB,CAAC;IAED,2CAA2C;IAC3C;;;;;;;;;;;;;;;;OAgBG;IACK,YAAY,CAAC,KAAoB;QACvC,IAAI,CAAC,IAAI,CAAC,cAAc;YAAE,OAAO,KAAK,CAAA;QACtC,2EAA2E;QAC3E,4EAA4E;QAC5E,wEAAwE;QACxE,0EAA0E;QAC1E,uCAAuC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACjC,IAAI;YACJ,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SACnD,CAAC,CAAC,CAAA;QACH,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9E,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH;;;;;;OAMG;IACK,eAAe,CAAC,QAA0B;QAChD,2EAA2E;QAC3E,uEAAuE;QACvE,uEAAuE;QACvE,sDAAsD;QACtD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;YACrC,2EAA2E;YAC3E,2EAA2E;YAC3E,qEAAqE;YACrE,oEAAoE;YACpE,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,OAAO,CAAC,EAAE,CAAA;QACtF,CAAC,CAAC,CAAA;QACF,qEAAqE;QACrE,6EAA6E;QAC7E,mEAAmE;QACnE,mEAAmE;QACnE,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3E,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClB,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YAChF,yEAAyE;YACzE,2EAA2E;YAC3E,wEAAwE;YACxE,yEAAyE;YACzE,uDAAuD;YACvD,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;QAC3D,CAAC,CAAC,CAAA;QACF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACpC,CAAC;IAEO,sBAAsB,CAAC,KAAoB;QACjD,MAAM,UAAU,GAAoB,EAAE,CAAA;QACtC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAChE,oEAAoE;YACpE,wEAAwE;YACxE,sCAAsC;YACtC,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAChC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;gBACvD,SAAQ;YACV,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QAC9F,CAAC;QACD,OAAO,UAAU,CAAA;IACnB,CAAC;IAEO,eAAe,CAAC,KAA6B;QACnD,MAAM,OAAO,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAA;QAChE,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;IAClF,CAAC;CACF"}