@opensip-cli/graph 0.1.11 → 0.1.12

package/dist/rules/__tests__/near-duplicate-function-body.test.js

@@ -0,0 +1,142 @@
+import { describe, expect, it } from 'vitest';
+import { makeCatalog, occ } from '../../__tests__/rules/_helpers.js';
+import { NEAR_DUP_SIGNATURE_K, bodySignature, estimateJaccard, } from '../../lang-adapter/near-duplicate-signature.js';
+import { buildIndexes } from '../../pipeline/indexes.js';
+import { nearDuplicateFunctionBodyRule } from '../near-duplicate-function-body.js';
+const PAYLOAD = 'abcdefghijklmnopqrstuvwxyz0123456789'.repeat(12);
+const BASE_BODY = `function work(items) { const payload = "${PAYLOAD}"; let total = 0; for (const item of items) { total += item.length + payload.length; } return total; }`;
+const NEAR_BODY = `function work(items) { const payload = "${PAYLOAD}"; let total = 0; for (const item of items) { total += item.length + payload.length + 1; } return total; }`;
+const UNRELATED = 'export function validateConfig(cfg) { if (!cfg.apiKey) throw new Error("missing"); return cfg; }';
+function withSignature(over, canonical) {
+    const signature = [...bodySignature(canonical)];
+    return occ({ ...over, bodySignature: signature, bodySize: canonical.length });
+}
+function evaluateNear(catalog, config = {}) {
+    return nearDuplicateFunctionBodyRule.evaluate(catalog, buildIndexes(catalog), config);
+}
+describe('near-duplicate-function-body', () => {
+    it('flags near-clone pairs above the similarity threshold', () => {
+        const sigA = bodySignature(BASE_BODY);
+        const sigB = bodySignature(NEAR_BODY);
+        expect(estimateJaccard(sigA, sigB)).toBeGreaterThanOrEqual(0.85);
+        const a = withSignature({
+            bodyHash: 'hash-a',
+            simpleName: 'processA',
+            filePath: 'src/a.ts',
+            line: 10,
+        }, BASE_BODY);
+        const b = withSignature({
+            bodyHash: 'hash-b',
+            simpleName: 'processB',
+            filePath: 'src/b.ts',
+            line: 20,
+            qualifiedName: 'src/b.processB',
+        }, NEAR_BODY);
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals.length).toBe(1);
+        expect(signals[0]?.ruleId).toBe('graph:near-duplicate-function-body');
+        expect(signals[0]?.metadata?.nearMembers).toEqual(expect.arrayContaining(['src/a.processA', 'src/b.processB']));
+    });
+    it('does not flag exact-duplicate pairs (duplicated-function-body owns those)', () => {
+        const a = withSignature({ bodyHash: 'same', simpleName: 'dupA' }, BASE_BODY);
+        const b = withSignature({
+            bodyHash: 'same',
+            simpleName: 'dupB',
+            filePath: 'src/b.ts',
+            qualifiedName: 'src/b.dupB',
+        }, BASE_BODY);
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals).toHaveLength(0);
+    });
+    it('skips test-file occurrences', () => {
+        const a = withSignature({ bodyHash: 'a', simpleName: 'a', inTestFile: true }, BASE_BODY);
+        const b = withSignature({
+            bodyHash: 'b',
+            simpleName: 'b',
+            filePath: 'src/b.ts',
+            qualifiedName: 'src/b.b',
+        }, NEAR_BODY);
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals).toHaveLength(0);
+    });
+    it('is graceful when bodySignature is absent', () => {
+        const a = occ({ bodyHash: 'a', simpleName: 'a' });
+        const b = occ({ bodyHash: 'b', simpleName: 'b', filePath: 'src/b.ts' });
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals).toHaveLength(0);
+    });
+    it('does not flag cross-language pairs (same-language gate)', () => {
+        const a = withSignature({ bodyHash: 'go-hash', simpleName: 'work', filePath: 'main.go', line: 1 }, BASE_BODY);
+        const b = withSignature({
+            bodyHash: 'ts-hash',
+            simpleName: 'work',
+            filePath: 'src/work.ts',
+            line: 1,
+            qualifiedName: 'src/work.work',
+        }, BASE_BODY);
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals).toHaveLength(0);
+    });
+    it('merges transitive near pairs via union-find', () => {
+        const body1 = BASE_BODY;
+        const body2 = NEAR_BODY;
+        const body3 = body2.replace('+ 1', '+ 2');
+        const a = withSignature({ bodyHash: 'h1', simpleName: 'a', line: 1 }, body1);
+        const b = withSignature({
+            bodyHash: 'h2',
+            simpleName: 'b',
+            filePath: 'src/b.ts',
+            line: 2,
+            qualifiedName: 'src/b.b',
+        }, body2);
+        const c = withSignature({
+            bodyHash: 'h3',
+            simpleName: 'c',
+            filePath: 'src/c.ts',
+            line: 3,
+            qualifiedName: 'src/c.c',
+        }, body3);
+        expect(estimateJaccard(bodySignature(body1), bodySignature(body2))).toBeGreaterThanOrEqual(0.85);
+        expect(estimateJaccard(bodySignature(body2), bodySignature(body3))).toBeGreaterThanOrEqual(0.85);
+        const signals = evaluateNear(makeCatalog([a, b, c]), {
+            minNearDuplicateSimilarity: 0.85,
+        });
+        expect(signals.length).toBe(1);
+        expect((signals[0]?.metadata?.nearMembers).length).toBeGreaterThanOrEqual(2);
+    });
+    it('skips sub-threshold pairs', () => {
+        const a = withSignature({ bodyHash: 'a', simpleName: 'a' }, BASE_BODY);
+        const b = withSignature({
+            bodyHash: 'b',
+            simpleName: 'b',
+            filePath: 'src/b.ts',
+            qualifiedName: 'src/b.b',
+        }, UNRELATED);
+        const signals = evaluateNear(makeCatalog([a, b]), {
+            minNearDuplicateSimilarity: 0.85,
+        });
+        expect(signals).toHaveLength(0);
+    });
+    it('requires signature length === NEAR_DUP_SIGNATURE_K', () => {
+        const a = occ({ bodyHash: 'a', simpleName: 'a', bodySignature: [1, 2, 3] });
+        const b = occ({
+            bodyHash: 'b',
+            simpleName: 'b',
+            filePath: 'src/b.ts',
+            bodySignature: [1, 2, 3],
+        });
+        const signals = evaluateNear(makeCatalog([a, b]));
+        expect(signals).toHaveLength(0);
+        expect(NEAR_DUP_SIGNATURE_K).toBe(128);
+    });
+    it('emits nothing when nearDuplicateLshBands does not divide k (fractional rows)', () => {
+        // 128 / 7 is fractional → band slicing would be misaligned. The integer guard
+        // must reject it (the schema also refuses this value at config load).
+        const a = withSignature({ bodyHash: 'hash-a', simpleName: 'pA', filePath: 'src/a.ts' }, BASE_BODY);
+        const b = withSignature({ bodyHash: 'hash-b', simpleName: 'pB', filePath: 'src/b.ts', qualifiedName: 'src/b.pB' }, NEAR_BODY);
+        expect(evaluateNear(makeCatalog([a, b]), { nearDuplicateLshBands: 7 })).toHaveLength(0);
+        // ...but the same pair IS flagged with a valid divisor.
+        expect(evaluateNear(makeCatalog([a, b]), { nearDuplicateLshBands: 16 })).toHaveLength(1);
+    });
+});
+//# sourceMappingURL=near-duplicate-function-body.test.js.map

package/dist/rules/__tests__/near-duplicate-function-body.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"near-duplicate-function-body.test.js","sourceRoot":"","sources":["../../../src/rules/__tests__/near-duplicate-function-body.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EACL,oBAAoB,EACpB,aAAa,EACb,eAAe,GAChB,MAAM,gDAAgD,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,6BAA6B,EAAE,MAAM,oCAAoC,CAAC;AAInF,MAAM,OAAO,GAAG,sCAAsC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAClE,MAAM,SAAS,GAAG,2CAA2C,OAAO,wGAAwG,CAAC;AAC7K,MAAM,SAAS,GAAG,2CAA2C,OAAO,4GAA4G,CAAC;AACjL,MAAM,SAAS,GACb,kGAAkG,CAAC;AAErG,SAAS,aAAa,CAAC,IAA+B,EAAE,SAAiB;IACvE,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;AAChF,CAAC;AAED,SAAS,YAAY,CACnB,OAAuC,EACvC,SAAuE,EAAE;IAEzE,OAAO,6BAA6B,CAAC,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;AACxF,CAAC;AAED,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,IAAI,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAEjE,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,QAAQ;YAClB,UAAU,EAAE,UAAU;YACtB,QAAQ,EAAE,UAAU;YACpB,IAAI,EAAE,EAAE;SACT,EACD,SAAS,CACV,CAAC;QACF,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,QAAQ;YAClB,UAAU,EAAE,UAAU;YACtB,QAAQ,EAAE,UAAU;YACpB,IAAI,EAAE,EAAE;YACR,aAAa,EAAE,gBAAgB;SAChC,EACD,SAAS,CACV,CAAC;QACF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;QACtE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC,OAAO,CAC/C,MAAM,CAAC,eAAe,CAAC,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC,CAC7D,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,SAAS,CAAC,CAAC;QAC7E,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,MAAM;YAChB,UAAU,EAAE,MAAM;YAClB,QAAQ,EAAE,UAAU;YACpB,aAAa,EAAE,YAAY;SAC5B,EACD,SAAS,CACV,CAAC;QACF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,SAAS,CAAC,CAAC;QACzF,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,GAAG;YACb,UAAU,EAAE,GAAG;YACf,QAAQ,EAAE,UAAU;YACpB,aAAa,EAAE,SAAS;SACzB,EACD,SAAS,CACV,CAAC;QACF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;QACxE,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,aAAa,CACrB,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,EACzE,SAAS,CACV,CAAC;QACF,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,SAAS;YACnB,UAAU,EAAE,MAAM;YAClB,QAAQ,EAAE,aAAa;YACvB,IAAI,EAAE,CAAC;YACP,aAAa,EAAE,eAAe;SAC/B,EACD,SAAS,CACV,CAAC;QACF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE1C,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7E,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,GAAG;YACf,QAAQ,EAAE,UAAU;YACpB,IAAI,EAAE,CAAC;YACP,aAAa,EAAE,SAAS;SACzB,EACD,KAAK,CACN,CAAC;QACF,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,GAAG;YACf,QAAQ,EAAE,UAAU;YACpB,IAAI,EAAE,CAAC;YACP,aAAa,EAAE,SAAS;SACzB,EACD,KAAK,CACN,CAAC;QAEF,MAAM,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,sBAAsB,CACxF,IAAI,CACL,CAAC;QACF,MAAM,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,sBAAsB,CACxF,IAAI,CACL,CAAC;QAEF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACnD,0BAA0B,EAAE,IAAI;SACjC,CAAC,CAAC;QACH,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAwB,CAAA,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;QACvE,MAAM,CAAC,GAAG,aAAa,CACrB;YACE,QAAQ,EAAE,GAAG;YACb,UAAU,EAAE,GAAG;YACf,QAAQ,EAAE,UAAU;YACpB,aAAa,EAAE,SAAS;SACzB,EACD,SAAS,CACV,CAAC;QACF,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAChD,0BAA0B,EAAE,IAAI;SACjC,CAAC,CAAC;QACH,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,GAAG,CAAC;YACZ,QAAQ,EAAE,GAAG;YACb,UAAU,EAAE,GAAG;YACf,QAAQ,EAAE,UAAU;YACpB,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,8EAA8E;QAC9E,sEAAsE;QACtE,MAAM,CAAC,GAAG,aAAa,CACrB,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAC9D,SAAS,CACV,CAAC;QACF,MAAM,CAAC,GAAG,aAAa,CACrB,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,EACzF,SAAS,CACV,CAAC;QACF,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,qBAAqB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxF,wDAAwD;QACxD,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,qBAAqB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/rules/_entry-points.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"_entry-points.d.ts","sourceRoot":"","sources":["../../src/rules/_entry-points.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAsB,OAAO,EAAE,MAAM,aAAa,CAAC;AAYxE,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,YAAY,GAAG,qBAAqB,GAAG,gBAAgB,CAAC;CAC1F;AAED,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,UAAU,EAAE,CAyB1F"}
+{"version":3,"file":"_entry-points.d.ts","sourceRoot":"","sources":["../../src/rules/_entry-points.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAsB,OAAO,EAAE,MAAM,aAAa,CAAC;AAYxE,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,YAAY,GAAG,qBAAqB,GAAG,gBAAgB,CAAC;CAC1F;AAED,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,UAAU,EAAE,CAyB1F"}

package/dist/rules/_entry-points.js

@@ -1,4 +1,3 @@
-// @fitness-ignore-file batch-operation-limits -- iterates bounded collection (catalog entries within a single graph build)
 /**
  * Entry-point inference (shared by orphan-subtree, test-only-reachable).
  *

package/dist/rules/_entry-points.js.map

@@ -1 +1 @@
-{"version":3,"file":"_entry-points.js","sourceRoot":"","sources":["../../src/rules/_entry-points.ts"],"names":[],"mappings":"AAAA,2HAA2H;AAC3H;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IAC9B,MAAM;IACN,KAAK;IACL,OAAO;IACP,UAAU;IACV,YAAY;IACZ,MAAM;IACN,WAAW;CACZ,CAAC,CAAC;AAOH,MAAM,UAAU,gBAAgB,CAAC,OAAgB,EAAE,OAAgB;IACjE,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,uEAAuE;IACvE,wEAAwE;IACxE,wEAAwE;IACxE,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;YACvD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,mEAAmE;IACnE,oEAAoE;IACpE,oDAAoD;IACpD,KAAK,OAAO,CAAC;IACb,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,GAAuB,EAAE,OAAgB;IACzD,kEAAkE;IAClE,4DAA4D;IAC5D,8DAA8D;IAC9D,iEAAiE;IACjE,gEAAgE;IAChE,gEAAgE;IAChE,8DAA8D;IAC9D,wBAAwB;IACxB,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,aAAa,CAAC;IACrD,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,YAAY,CAAC;IAC7D,IAAI,GAAG,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;QACtE,oEAAoE;QACpE,mEAAmE;QACnE,iEAAiE;QACjE,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,GAAuB,EAAE,OAAgB;IAClE,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,KAAK,GAAG,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAG,oCAAoC,CAAC;AAE/D;;;;;;;;;;;;;;GAcG;AACH,SAAS,wBAAwB,CAAC,OAAgB;IAChD,MAAM,WAAW,GAAG,+BAA+B,CAAC,OAAO,CAAC,CAAC;IAC7D,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,cAAc,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACpD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;iBAEiB;AACjB,SAAS,+BAA+B,CAAC,OAAgB;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,qDAAqD;YACrD,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YACzC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,sEAAsE;AACtE,SAAS,mBAAmB,CAAC,OAAgB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgC,CAAC;IACvD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,IAAI,GAAG,CAAC,UAAU,KAAK,UAAU;YAAE,SAAS;QAC5C,IAAI,CAAC,GAAG,CAAC,QAAQ;YAAE,SAAS;QAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6EAA6E;AAC7E,SAAS,KAAK,CAAC,QAAgB;IAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACxC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;kEACkE;AAClE,SAAS,eAAe,CAAC,GAAW,EAAE,SAAiB;IACrD,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG;YAAE,SAAS;QAC1C,IAAI,IAAI,KAAK,IAAI;YAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;;YAC7B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED;;uEAEuE;AACvE,SAAS,kBAAkB,CAAC,MAAc;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACzC,OAAO;QACL,MAAM;QACN,GAAG,IAAI,KAAK;QACZ,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,KAAK;QACZ,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,WAAW;QAClB,GAAG,IAAI,YAAY;QACnB,GAAG,IAAI,WAAW;KACnB,CAAC;AACJ,CAAC;AAED;4EAC4E;AAC5E,SAAS,mBAAmB,CAAC,IAAY;IACvC,MAAM,KAAK,GAAG,sCAAsC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrE,CAAC"}
+{"version":3,"file":"_entry-points.js","sourceRoot":"","sources":["../../src/rules/_entry-points.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IAC9B,MAAM;IACN,KAAK;IACL,OAAO;IACP,UAAU;IACV,YAAY;IACZ,MAAM;IACN,WAAW;CACZ,CAAC,CAAC;AAOH,MAAM,UAAU,gBAAgB,CAAC,OAAgB,EAAE,OAAgB;IACjE,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,uEAAuE;IACvE,wEAAwE;IACxE,wEAAwE;IACxE,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;YACvD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,mEAAmE;IACnE,oEAAoE;IACpE,oDAAoD;IACpD,KAAK,OAAO,CAAC;IACb,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,GAAuB,EAAE,OAAgB;IACzD,kEAAkE;IAClE,4DAA4D;IAC5D,8DAA8D;IAC9D,iEAAiE;IACjE,gEAAgE;IAChE,gEAAgE;IAChE,8DAA8D;IAC9D,wBAAwB;IACxB,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,aAAa,CAAC;IACrD,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,YAAY,CAAC;IAC7D,IAAI,GAAG,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;QACtE,oEAAoE;QACpE,mEAAmE;QACnE,iEAAiE;QACjE,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,GAAuB,EAAE,OAAgB;IAClE,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,KAAK,GAAG,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAG,oCAAoC,CAAC;AAE/D;;;;;;;;;;;;;;GAcG;AACH,SAAS,wBAAwB,CAAC,OAAgB;IAChD,MAAM,WAAW,GAAG,+BAA+B,CAAC,OAAO,CAAC,CAAC;IAC7D,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,cAAc,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACpD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;iBAEiB;AACjB,SAAS,+BAA+B,CAAC,OAAgB;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,qDAAqD;YACrD,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YACzC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,sEAAsE;AACtE,SAAS,mBAAmB,CAAC,OAAgB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgC,CAAC;IACvD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,IAAI,GAAG,CAAC,UAAU,KAAK,UAAU;YAAE,SAAS;QAC5C,IAAI,CAAC,GAAG,CAAC,QAAQ;YAAE,SAAS;QAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6EAA6E;AAC7E,SAAS,KAAK,CAAC,QAAgB;IAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACxC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;kEACkE;AAClE,SAAS,eAAe,CAAC,GAAW,EAAE,SAAiB;IACrD,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG;YAAE,SAAS;QAC1C,IAAI,IAAI,KAAK,IAAI;YAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;;YAC7B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED;;uEAEuE;AACvE,SAAS,kBAAkB,CAAC,MAAc;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACzC,OAAO;QACL,MAAM;QACN,GAAG,IAAI,KAAK;QACZ,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,KAAK;QACZ,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,WAAW;QAClB,GAAG,IAAI,YAAY;QACnB,GAAG,IAAI,WAAW;KACnB,CAAC;AACJ,CAAC;AAED;4EAC4E;AAC5E,SAAS,mBAAmB,CAAC,IAAY;IACvC,MAAM,KAAK,GAAG,sCAAsC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrE,CAAC"}

package/dist/rules/duplicated-function-body.d.ts

@@ -1,40 +1,18 @@
 /**
- * graph:duplicated-function-body — group catalog entries whose body
- * normalizes to the same hash and report duplicate bodies. The rule has
- * two complementary code paths under one slug:
+ * graph:duplicated-function-body — group catalog entries whose body normalizes to the
+ * same hash and report duplicate bodies. Two complementary paths under one slug:
  *
- *   1. **Per-instance (size-gated).** A "duplicate" is two or more
- *      functions whose normalized body is byte-identical
- *      (whitespace/comment normalization handled by hashFunctionBody).
- *      Two thresholds filter out non-actionable hits:
+ *   1. Per-instance (size-gated): N-1 signals per group of ≥2 byte-identical normalized
+ *      bodies passing a line floor (default 5) AND a normalized-char floor (default 200,
+ *      which drops thin `defineCheck`/pass-through wrappers).
+ *   2. Aggregate (cross-package): one signal per body hash in ≥ 3 distinct packages,
+ *      suppressing that hash's per-instance signals (lighter body-size-only floor, 80).
  *
- *        - minDuplicateBodyLines (default 5): the source span must be at
- *          least this many lines.
- *        - minDuplicateBodySize  (default 200): the *normalized* body
- *          (post comment-strip + whitespace-collapse) must be at least
- *          this many characters. This catches the common case of a
- *          `defineCheck({ ... analyze(content) { return analyzeFile(...) } })`
- *          wrapper where the source spans 8+ lines but the executable
- *          body is only ~80 characters once normalized — structurally
- *          identical to every other thin wrapper, but never an actionable
- *          refactor target.
- *
- *      Emits N-1 signals per group (one per non-primary occurrence).
- *
- *   2. **Aggregate (cross-package).** For each body hash present in
- *      ≥ minCrossPackageDuplicatePackages (default 3) DISTINCT packages
- *      (via `pkgOf`), the rule emits ONE aggregate signal naming the
- *      packages and SUPPRESSES the per-instance signals for that same hash
- *      (no double-reporting). Bodies that don't reach N packages flow
- *      through path (1) unchanged.
- *
- *      This path applies a LIGHTER, body-size-only floor
- *      (`minCrossPackageDuplicateBodySize`, default 80 chars — no line floor)
- *      rather than the per-instance floor: a *small* body copied across
- *      packages is exactly what this path exists to catch, so the floor is
- *      tuned only to drop TRIVIAL bodies (empty DI-constructor shims,
- *      one-line getters, thin delegators) that are never consolidation
- *      targets, while keeping genuinely-small shared utilities visible.
+ * The detection algorithm + curation policy now live in `@opensip-cli/clone-detection`
+ * (ADR-0064) so graph and yagni single-source them. This rule is a thin adapter: it maps
+ * the catalog to `CloneCandidate[]` (pre-resolving `bodyLines` from the feature table and
+ * `package` from `pkgOf`), calls `findDuplicateBodies`, and wraps each finding into a
+ * graph `Signal` with the unchanged message/severity/metadata — so output is byte-stable.
  */
 export declare const duplicatedFunctionBodyRule: import("../types.js").Rule;
 //# sourceMappingURL=duplicated-function-body.d.ts.map

package/dist/rules/duplicated-function-body.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"duplicated-function-body.d.ts","sourceRoot":"","sources":["../../src/rules/duplicated-function-body.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAoBH,eAAO,MAAM,0BAA0B,4BA0DrC,CAAC"}
+{"version":3,"file":"duplicated-function-body.d.ts","sourceRoot":"","sources":["../../src/rules/duplicated-function-body.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAeH,eAAO,MAAM,0BAA0B,4BAoBrC,CAAC"}

package/dist/rules/duplicated-function-body.js

@@ -1,262 +1,112 @@
 /**
- * graph:duplicated-function-body — group catalog entries whose body
- * normalizes to the same hash and report duplicate bodies. The rule has
- * two complementary code paths under one slug:
+ * graph:duplicated-function-body — group catalog entries whose body normalizes to the
+ * same hash and report duplicate bodies. Two complementary paths under one slug:
  *
- *   1. **Per-instance (size-gated).** A "duplicate" is two or more
- *      functions whose normalized body is byte-identical
- *      (whitespace/comment normalization handled by hashFunctionBody).
- *      Two thresholds filter out non-actionable hits:
+ *   1. Per-instance (size-gated): N-1 signals per group of ≥2 byte-identical normalized
+ *      bodies passing a line floor (default 5) AND a normalized-char floor (default 200,
+ *      which drops thin `defineCheck`/pass-through wrappers).
+ *   2. Aggregate (cross-package): one signal per body hash in ≥ 3 distinct packages,
+ *      suppressing that hash's per-instance signals (lighter body-size-only floor, 80).
  *
- *        - minDuplicateBodyLines (default 5): the source span must be at
- *          least this many lines.
- *        - minDuplicateBodySize  (default 200): the *normalized* body
- *          (post comment-strip + whitespace-collapse) must be at least
- *          this many characters. This catches the common case of a
- *          `defineCheck({ ... analyze(content) { return analyzeFile(...) } })`
- *          wrapper where the source spans 8+ lines but the executable
- *          body is only ~80 characters once normalized — structurally
- *          identical to every other thin wrapper, but never an actionable
- *          refactor target.
- *
- *      Emits N-1 signals per group (one per non-primary occurrence).
- *
- *   2. **Aggregate (cross-package).** For each body hash present in
- *      ≥ minCrossPackageDuplicatePackages (default 3) DISTINCT packages
- *      (via `pkgOf`), the rule emits ONE aggregate signal naming the
- *      packages and SUPPRESSES the per-instance signals for that same hash
- *      (no double-reporting). Bodies that don't reach N packages flow
- *      through path (1) unchanged.
- *
- *      This path applies a LIGHTER, body-size-only floor
- *      (`minCrossPackageDuplicateBodySize`, default 80 chars — no line floor)
- *      rather than the per-instance floor: a *small* body copied across
- *      packages is exactly what this path exists to catch, so the floor is
- *      tuned only to drop TRIVIAL bodies (empty DI-constructor shims,
- *      one-line getters, thin delegators) that are never consolidation
- *      targets, while keeping genuinely-small shared utilities visible.
+ * The detection algorithm + curation policy now live in `@opensip-cli/clone-detection`
+ * (ADR-0064) so graph and yagni single-source them. This rule is a thin adapter: it maps
+ * the catalog to `CloneCandidate[]` (pre-resolving `bodyLines` from the feature table and
+ * `package` from `pkgOf`), calls `findDuplicateBodies`, and wraps each finding into a
+ * graph `Signal` with the unchanged message/severity/metadata — so output is byte-stable.
  */
+import { findDuplicateBodies } from '@opensip-cli/clone-detection';
 import { pkgOf } from '../resolve-callee.js';
 import { createGraphSignal } from './create-graph-signal.js';
 import { defineRule } from './define-rule.js';
-const DEFAULT_MIN_LINES = 5;
-const DEFAULT_MIN_BODY_SIZE = 200;
-const DEFAULT_MIN_CROSS_PACKAGE_PACKAGES = 3;
-// Lighter than DEFAULT_MIN_BODY_SIZE (the per-instance floor) and applied with
-// NO line floor: the aggregate path is meant to catch genuinely-small shared
-// utilities copied across packages, so its floor only drops trivial bodies
-// (empty DI shims, one-line getters/delegators).
-const DEFAULT_MIN_CROSS_PACKAGE_BODY_SIZE = 80;
 const SLUG = 'graph:duplicated-function-body';
 export const duplicatedFunctionBodyRule = defineRule({
     slug: SLUG,
     defaultSeverity: 'warning',
     featureDeps: ['bodyLines'],
     evaluate({ catalog, config, features }) {
-        const minLines = config.minDuplicateBodyLines ?? DEFAULT_MIN_LINES;
-        const minBodySize = config.minDuplicateBodySize ?? DEFAULT_MIN_BODY_SIZE;
-        const minPackages = config.minCrossPackageDuplicatePackages ?? DEFAULT_MIN_CROSS_PACKAGE_PACKAGES;
-        const minCrossPackageBodySize = config.minCrossPackageDuplicateBodySize ?? DEFAULT_MIN_CROSS_PACKAGE_BODY_SIZE;
-        const signals = [];
-        // Aggregate path first: group every kind/test-eligible occurrence by
-        // body hash (no line floor) so we can detect cross-package spread and
-        // decide which hashes to suppress on the per-instance path below.
-        const aggregateBuckets = groupByHashUnfloored(catalog);
-        const suppressedHashes = new Set();
-        for (const [bodyHash, occs] of aggregateBuckets) {
-            const packages = [...new Set(occs.map((o) => pkgOf(o)))].sort();
-            if (packages.length < minPackages)
-                continue;
-            const anchor = lowestByQualifiedName(occs);
-            // Lighter, body-size-only floor (NO line floor): keeps the aggregate
-            // path catching genuinely-small shared utilities copied across packages,
-            // while dropping trivial bodies — empty DI-constructor shims, one-line
-            // getters, thin delegators — that are not consolidation targets. A body
-            // that fails this won't surface on the per-instance path either (its
-            // 200-char floor is stricter), so there is nothing to suppress.
-            if (anchor.bodySize !== undefined && anchor.bodySize < minCrossPackageBodySize)
-                continue;
-            // This hash is owned by the aggregate path; suppress its per-instance
-            // signals so a single duplicate group never double-reports.
-            suppressedHashes.add(bodyHash);
-            signals.push(createGraphSignal(SLUG, config, {
-                severity: 'low',
-                category: 'quality',
-                message: `This body is duplicated across ${String(packages.length)} packages (${packages.join(', ')}) in ${String(occs.length)} occurrences — hoist it into a shared package.`,
-                code: { file: anchor.filePath, line: anchor.line, column: anchor.column },
-                suggestion: 'Hoist the shared body into a single shared package and have every copy import it.',
-                metadata: {
-                    packages,
-                    packageCount: packages.length,
-                    occurrenceCount: occs.length,
-                    bodyHash,
-                },
-            }));
-        }
-        // Per-instance path: size-gated groups, skipping any hash already
-        // claimed by an aggregate signal so a group never double-reports.
-        const groups = groupByHash(catalog, minLines, minBodySize, features);
-        signals.push(...emitPerInstanceSignals(groups, suppressedHashes, config));
-        return signals;
+        const candidates = toCandidates(catalog, features);
+        const { aggregates, groups } = findDuplicateBodies(candidates, {
+            minLines: config.minDuplicateBodyLines,
+            minBodySize: config.minDuplicateBodySize,
+            minCrossPackagePackages: config.minCrossPackageDuplicatePackages,
+            minCrossPackageBodySize: config.minCrossPackageDuplicateBodySize,
+        });
+        // Aggregate (cross-package) signals first, then per-instance signals — same order
+        // as the prior loops, but built as bounded in-memory projections over rule findings.
+        return [
+            ...aggregates.map((agg) => aggregateSignal(agg, config)),
+            ...groups.flatMap((group) => groupSignals(group, config)),
+        ];
     },
 });
-/**
- * Per-instance duplicate signals: N-1 per size-gated group, skipping any hash
- * already claimed by an aggregate signal (no double-reporting). Extracted from
- * evaluate() to keep its cognitive complexity within budget.
- */
-function emitPerInstanceSignals(groups, suppressedHashes, config) {
-    const signals = [];
-    for (const group of groups) {
-        if (group.length < 2)
-            continue;
-        const primary = group[0];
-        /* v8 ignore next */
-        if (!primary)
-            continue;
-        if (suppressedHashes.has(primary.bodyHash))
-            continue;
-        for (let i = 1; i < group.length; i++) {
-            const occ = group[i];
-            /* v8 ignore next */
-            if (!occ)
-                continue;
-            signals.push(createGraphSignal(SLUG, config, {
-                severity: 'low',
-                category: 'quality',
-                message: `${occ.simpleName} has the same body as ${primary.qualifiedName} (${primary.filePath}:${String(primary.line)}).`,
-                code: { file: occ.filePath, line: occ.line, column: occ.column },
-                suggestion: 'Extract the shared body to a single function and have both call sites import it.',
-                metadata: {
-                    primary: primary.qualifiedName,
-                    duplicate: occ.qualifiedName,
-                    groupSize: group.length,
-                },
-            }));
-        }
-    }
-    return signals;
-}
-/**
- * A function's stable physical identity: where it is declared. The catalog's
- * `functions` record is keyed by simple name, and the same physical function
- * can surface more than once across that index (e.g. indexed under both its
- * simple and qualified name, or a recursive function whose self-reference is
- * walked as an extra occurrence). Two entries that share this identity are the
- * SAME function — they must never count as a duplicate of each other. Keying on
- * file + declaration position + simple name keeps genuinely-distinct functions
- * (same body, different file/line) in separate identities while collapsing
- * self-matches.
- */
-function identityOf(occ) {
-    return `${occ.filePath}:${String(occ.line)}:${String(occ.column)}:${occ.simpleName}`;
+function aggregateSignal(agg, config) {
+    return createGraphSignal(SLUG, config, {
+        severity: 'low',
+        category: 'quality',
+        message: `This body is duplicated across ${String(agg.packages.length)} packages (${agg.packages.join(', ')}) in ${String(agg.occurrenceCount)} occurrences — hoist it into a shared package.`,
+        code: { file: agg.anchor.filePath, line: agg.anchor.line, column: agg.anchor.column },
+        suggestion: 'Hoist the shared body into a single shared package and have every copy import it.',
+        metadata: {
+            packages: agg.packages,
+            packageCount: agg.packages.length,
+            occurrenceCount: agg.occurrenceCount,
+            bodyHash: agg.bodyHash,
+        },
+    });
 }
-/**
- * Add an occurrence to its body-hash bucket, deduping by physical identity so a
- * function never appears twice in its own bucket. Without this, a function that
- * surfaces more than once in the catalog index (self-reference, dual name
- * indexing) would form a phantom 2-member group and self-report as a duplicate.
- */
-function pushDeduped(buckets, seenByHash, occ) {
-    let bucket = buckets.get(occ.bodyHash);
-    let seen = seenByHash.get(occ.bodyHash);
-    if (!bucket) {
-        bucket = [];
-        buckets.set(occ.bodyHash, bucket);
-        seen = new Set();
-        seenByHash.set(occ.bodyHash, seen);
-    }
+function groupSignals(group, config) {
+    const primary = group.members[0];
     /* v8 ignore next */
-    if (!seen)
-        return;
-    const id = identityOf(occ);
-    if (seen.has(id))
-        return;
-    seen.add(id);
-    bucket.push(occ);
-}
-function groupByHash(catalog, minLines, minBodySize, features) {
-    // Walk the catalog directly; the byBodyHash index dedupes by hash,
-    // which is exactly what we need to NOT do here.
-    const buckets = new Map();
-    const seenByHash = new Map();
-    for (const name of Object.keys(catalog.functions)) {
-        const occs = catalog.functions[name];
-        /* v8 ignore next */
-        if (!occs)
-            continue;
-        for (const occ of occs) {
-            if (!isInterestingForDup(occ, minLines, minBodySize, features))
-                continue;
-            pushDeduped(buckets, seenByHash, occ);
-        }
-    }
-    return [...buckets.values()];
+    if (!primary)
+        return [];
+    return group.members.slice(1).map((occ) => createGraphSignal(SLUG, config, {
+        severity: 'low',
+        category: 'quality',
+        message: `${occ.simpleName} has the same body as ${primary.qualifiedName} (${primary.filePath}:${String(primary.line)}).`,
+        code: { file: occ.filePath, line: occ.line, column: occ.column },
+        suggestion: 'Extract the shared body to a single function and have both call sites import it.',
+        metadata: {
+            primary: primary.qualifiedName,
+            duplicate: occ.qualifiedName,
+            groupSize: group.members.length,
+        },
+    }));
 }
 /**
- * Group occurrences by body hash applying ONLY the kind/test-file
- * exclusions (no size/line floor) — the grouping the aggregate
- * cross-package path consumes. Returns a Map so callers keep the body
- * hash key for suppression bookkeeping.
+ * Map the catalog to `CloneCandidate[]` in the SAME iteration order the prior in-rule
+ * grouping used (`Object.keys(catalog.functions)` → each name's occurrences), so the
+ * substrate's bucket/primary selection and emission order are byte-identical.
+ * `bodyLines` is pre-resolved from the feature table (canonical span) with the inline
+ * `endLine − line + 1` fallback handled by the substrate; `package` is `pkgOf` (the
+ * nearest-package.json resolution the aggregate path keys on).
  */
-function groupByHashUnfloored(catalog) {
-    const buckets = new Map();
-    const seenByHash = new Map();
+function toCandidates(catalog, features) {
+    const candidates = [];
     for (const name of Object.keys(catalog.functions)) {
         const occs = catalog.functions[name];
         /* v8 ignore next */
         if (!occs)
             continue;
-        for (const occ of occs) {
-            if (!isEligibleKind(occ))
-                continue;
-            pushDeduped(buckets, seenByHash, occ);
-        }
+        for (const occ of occs)
+            candidates.push(toCandidate(occ, features));
     }
-    return buckets;
-}
-function lowestByQualifiedName(occs) {
-    return occs.reduce((lo, c) => (c.qualifiedName < lo.qualifiedName ? c : lo));
+    return candidates;
 }
-/**
- * The kind/test-file exclusions shared by both code paths. Inline arrows
- * / function expressions / module-init occurrences are never an
- * extract/hoist target:
- *  - test-suite arrows with identical 5-line bodies are common boilerplate
- *  - module-inits hash whatever is at top level; identical hashes mean
- *    twin files, not a dup-extraction opportunity
- *  - constructor/getter/setter/method dups are interesting; keep those
- *
- * Test-file occurrences are excluded on both paths.
- */
-function isEligibleKind(occ) {
-    if (occ.kind === 'arrow' || occ.kind === 'function-expression' || occ.kind === 'module-init') {
-        return false;
-    }
-    if (occ.inTestFile)
-        return false;
-    return true;
-}
-/**
- * The per-instance dup-body filter: the shared kind/test exclusions plus
- * the size/line floor. The bodySize threshold drops trivial wrappers — a
- * `defineCheck` or pass-through analyze that contains an `if`-guard plus a
- * delegating call. These have identical normalized bodies across many
- * files but are never the right refactor target. Catalogs from older runs
- * that lack `bodySize` skip the size check (treated as "passes").
- */
-function isInterestingForDup(occ, minLines, minBodySize, features) {
-    if (!isEligibleKind(occ))
-        return false;
-    // The bodyLines feature column is the canonical span (computed once in
-    // pipeline/features.ts). The inline `endLine − line + 1` here is the single
-    // sanctioned graceful-degrade fallback for features-absent calls (3/4-arg
-    // test evaluate), not a duplicate of the engine derivation.
-    const span = features?.function.get(occ.bodyHash)?.bodyLines ?? occ.endLine - occ.line + 1;
-    if (span < minLines)
-        return false;
-    if (occ.bodySize !== undefined && occ.bodySize < minBodySize)
-        return false;
-    return true;
+function toCandidate(occ, features) {
+    const bodyLines = features?.function.get(occ.bodyHash)?.bodyLines;
+    return {
+        bodyHash: occ.bodyHash,
+        kind: occ.kind,
+        inTestFile: occ.inTestFile,
+        filePath: occ.filePath,
+        line: occ.line,
+        column: occ.column,
+        endLine: occ.endLine,
+        simpleName: occ.simpleName,
+        qualifiedName: occ.qualifiedName,
+        package: pkgOf(occ),
+        ...(occ.bodySize === undefined ? {} : { bodySize: occ.bodySize }),
+        ...(bodyLines === undefined ? {} : { bodyLines }),
+    };
 }
 //# sourceMappingURL=duplicated-function-body.js.map