@lbroth/rothunter 1.0.0-rc.1

package/dist/detectors/duplicate-function.js

@@ -0,0 +1,199 @@
+import { UnionFind, bucketBy, representativeHash } from '../utils/clustering.js';
+/** Functions shorter than this many body characters (after collapse) are too small to mean anything. */
+const MIN_BODY_CHARS = 16;
+// Below 0.65 Jaccard a 30%+ different body is a different function in practice.
+const NEAR_DUP_THRESHOLD = 0.65;
+/** Minimum shingle-set size on both sides for near-dup pairing (avoids 1-line bodies). */
+const NEAR_DUP_MIN_SHINGLES = 6;
+const LAYER_PRIORITY = ['strict', 'normalized-names', 'structural', 'near-duplicate'];
+export class DuplicateFunctionDetector {
+    id = 'duplicate-function';
+    name = 'Duplicate function detector';
+    async run(symbols) {
+        const fnLike = symbols.filter((s) => s.kind === 'function' && s.structure?.kind === 'function');
+        // Skip trivial bodies — a single `return x;` collides across unrelated helpers.
+        const nonTrivial = fnLike.filter((s) => {
+            const fn = s.structure;
+            return fn.bodyNormalized.length >= MIN_BODY_CHARS;
+        });
+        const strictBuckets = bucketBy(nonTrivial, (s) => s.hashStrict);
+        const normalizedBuckets = bucketBy(nonTrivial, (s) => s.hashNormalizedNames);
+        const structuralBuckets = bucketBy(nonTrivial, (s) => s.hashStructural);
+        const indexOf = new Map(nonTrivial.map((s, i) => [s.id, i]));
+        const uf = new UnionFind(nonTrivial.length);
+        const edgeLayer = new Map();
+        const unionBucket = (bucket, matchedBy) => {
+            if (bucket.length < 2)
+                return;
+            const firstIdx = indexOf.get(bucket[0].id);
+            if (firstIdx == null)
+                return;
+            for (let i = 1; i < bucket.length; i++) {
+                const nextIdx = indexOf.get(bucket[i].id);
+                if (nextIdx == null)
+                    continue;
+                uf.union(firstIdx, nextIdx);
+            }
+            for (const s of bucket) {
+                const idx = indexOf.get(s.id);
+                if (idx == null)
+                    continue;
+                const root = uf.find(idx);
+                const set = edgeLayer.get(root) ?? new Set();
+                set.add(matchedBy);
+                edgeLayer.set(root, set);
+            }
+        };
+        for (const b of strictBuckets.values())
+            unionBucket(b, 'strict');
+        for (const b of normalizedBuckets.values())
+            unionBucket(b, 'normalized-names');
+        for (const b of structuralBuckets.values())
+            unionBucket(b, 'structural');
+        // Layer 4 — pairwise Jaccard on body shingles, GATED on signature compatibility.
+        // Picks up "this is almost the same function with one extra line + a few
+        // renames" cases the exact-hash layers miss. Two functions with the same
+        // body shape but different parameter or return types (e.g. `addNumbers` vs
+        // `concatStrings`) must NOT cluster, hence the signature gate.
+        // O(N²) but bounded by typeLike size, and the signature filter is cheap.
+        const signatures = nonTrivial.map((s) => signatureKey(s.structure));
+        for (let i = 0; i < nonTrivial.length; i++) {
+            const a = nonTrivial[i].structure;
+            const aIdx = indexOf.get(nonTrivial[i].id);
+            if (aIdx == null)
+                continue;
+            if (a.bodyShingles.size < NEAR_DUP_MIN_SHINGLES)
+                continue;
+            for (let j = i + 1; j < nonTrivial.length; j++) {
+                const b = nonTrivial[j].structure;
+                const bIdx = indexOf.get(nonTrivial[j].id);
+                if (bIdx == null)
+                    continue;
+                if (b.bodyShingles.size < NEAR_DUP_MIN_SHINGLES)
+                    continue;
+                if (signatures[i] !== signatures[j])
+                    continue; // signature gate
+                if (uf.find(aIdx) === uf.find(bIdx))
+                    continue;
+                const sim = jaccard(a.bodyShingles, b.bodyShingles);
+                if (sim < NEAR_DUP_THRESHOLD)
+                    continue;
+                uf.union(aIdx, bIdx);
+                const root = uf.find(aIdx);
+                const set = edgeLayer.get(root) ?? new Set();
+                set.add('near-duplicate');
+                edgeLayer.set(root, set);
+            }
+        }
+        const finalSignals = new Map();
+        for (let i = 0; i < nonTrivial.length; i++) {
+            const root = uf.find(i);
+            const merged = finalSignals.get(root) ?? new Set();
+            for (const [k, v] of edgeLayer) {
+                if (uf.find(k) === root)
+                    for (const s of v)
+                        merged.add(s);
+            }
+            finalSignals.set(root, merged);
+        }
+        const componentsByRoot = new Map();
+        for (let i = 0; i < nonTrivial.length; i++) {
+            const root = uf.find(i);
+            const group = componentsByRoot.get(root) ?? [];
+            group.push(nonTrivial[i]);
+            componentsByRoot.set(root, group);
+        }
+        const clusters = [];
+        for (const [root, group] of componentsByRoot) {
+            if (group.length < 2)
+                continue;
+            const files = new Set(group.map((g) => g.file));
+            if (files.size === 1 && group.length === 2)
+                continue;
+            const signals = finalSignals.get(root) ?? new Set();
+            if (signals.size === 0)
+                continue;
+            const primary = LAYER_PRIORITY.find((p) => signals.has(p)) ?? 'structural';
+            clusters.push({
+                hash: representativeHash(group, primary, {
+                    strict: (s) => s.hashStrict,
+                    'normalized-names': (s) => s.hashNormalizedNames,
+                    structural: (s) => s.hashStructural,
+                    'near-duplicate': (s) => s.hashStrict ?? s.hashStructural,
+                }),
+                symbols: group,
+                matchedBy: primary,
+                layer: primary === 'near-duplicate' ? 2 : primary === 'normalized-names' ? 2 : 1,
+                signals,
+            });
+        }
+        return clusters.map((c) => this.toFinding(c));
+    }
+    toFinding(c) {
+        const baseConfidence = c.matchedBy === 'strict'
+            ? 0.97
+            : c.matchedBy === 'structural'
+                ? 0.82
+                : c.matchedBy === 'normalized-names'
+                    ? 0.72
+                    : 0.68; // near-duplicate
+        const distinctNames = new Set(c.symbols.map((s) => s.name)).size;
+        const sameName = distinctNames === 1;
+        const names = Array.from(new Set(c.symbols.map((s) => s.name))).join(', ');
+        const title = sameName
+            ? `'${c.symbols[0]?.name}' is defined ${c.symbols.length} times`
+            : `${c.symbols.length} functions appear equivalent: ${names}`;
+        return {
+            detectorId: this.id,
+            severity: c.symbols.length >= 3 ? 'high' : 'medium',
+            confidence: baseConfidence,
+            layer: c.layer,
+            title,
+            description: this.buildDescription(c),
+            evidence: c.symbols.map((s) => ({
+                file: s.file,
+                range: s.range,
+                snippet: s.source,
+            })),
+            suggestion: 'Consolidate into a single shared definition (e.g., a shared utils module) and import from one place.',
+            fingerprint: `dup-fn:${c.matchedBy}:${c.hash}`,
+        };
+    }
+    buildDescription(c) {
+        const where = c.symbols
+            .map((s) => `- ${s.file}:${s.range.startLine} (function ${s.name})`)
+            .join('\n');
+        const matchedByLabel = {
+            strict: 'Same signature + same body (verbatim after whitespace/comment collapse)',
+            structural: 'Same skeleton — identifiers anonymised, signature shape and body shape match',
+            'normalized-names': 'Same signature + body after parameter-name normalisation (snake/camel + synonyms)',
+            'near-duplicate': `Near-duplicate body (Jaccard ≥ ${NEAR_DUP_THRESHOLD} on 4-token shingles)`,
+        };
+        const extra = c.signals.size > 1
+            ? `\nAlso matches at: ${Array.from(c.signals).filter((s) => s !== c.matchedBy).join(', ')}.`
+            : '';
+        return `Match level: ${matchedByLabel[c.matchedBy]} (layer ${c.layer}).${extra}\nLocations:\n${where}`;
+    }
+}
+/**
+ * Stable signature string used as the Layer-4 compatibility gate. Two functions
+ * cluster as near-duplicates only when their async/generator flags + parameter
+ * types (in order) + return type all match — modulo whitespace normalisation.
+ */
+function signatureKey(fn) {
+    const flags = `${fn.async ? 'a' : ''}${fn.generator ? 'g' : ''}`;
+    const params = fn.params.map((p) => p.type.replace(/\s+/g, '')).join(',');
+    return `${flags}(${params})=>${fn.returnType.replace(/\s+/g, '')}`;
+}
+function jaccard(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersect = 0;
+    const [small, large] = a.size <= b.size ? [a, b] : [b, a];
+    for (const x of small)
+        if (large.has(x))
+            intersect++;
+    const union = a.size + b.size - intersect;
+    return union === 0 ? 0 : intersect / union;
+}
+//# sourceMappingURL=duplicate-function.js.map

package/dist/detectors/duplicate-function.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-function.js","sourceRoot":"","sources":["../../src/detectors/duplicate-function.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAYjF,wGAAwG;AACxG,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,gFAAgF;AAChF,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC,0FAA0F;AAC1F,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,MAAM,cAAc,GAAgB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,YAAY,EAAE,gBAAgB,CAAC,CAAC;AAEnG,MAAM,OAAO,yBAAyB;IACpC,EAAE,GAAG,oBAAoB,CAAC;IAC1B,IAAI,GAAG,6BAA6B,CAAC;IAErC,KAAK,CAAC,GAAG,CAAC,OAAuB;QAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,KAAK,UAAU,CACjE,CAAC;QAEF,gFAAgF;QAChF,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,SAA8B,CAAC;YAC5C,OAAO,EAAE,CAAC,cAAc,CAAC,MAAM,IAAI,cAAc,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,MAAM,aAAa,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAChE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC;QAC7E,MAAM,iBAAiB,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAExE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;QAEpD,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAE,SAAoB,EAAQ,EAAE;YACzE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO;YAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;YAC5C,IAAI,QAAQ,IAAI,IAAI;gBAAE,OAAO;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;gBAC3C,IAAI,OAAO,IAAI,IAAI;oBAAE,SAAS;gBAC9B,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9B,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9B,IAAI,GAAG,IAAI,IAAI;oBAAE,SAAS;gBAC1B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;gBACxD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACnB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACjE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC/E,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAEzE,iFAAiF;QACjF,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,+DAA+D;QAC/D,yEAAyE;QACzE,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,SAA8B,CAAC,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,SAA8B,CAAC;YACxD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;YAC5C,IAAI,IAAI,IAAI,IAAI;gBAAE,SAAS;YAC3B,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,qBAAqB;gBAAE,SAAS;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,SAA8B,CAAC;gBACxD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;gBAC5C,IAAI,IAAI,IAAI,IAAI;oBAAE,SAAS;gBAC3B,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,qBAAqB;oBAAE,SAAS;gBAC1D,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC;oBAAE,SAAS,CAAC,iBAAiB;gBAChE,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;gBACpD,IAAI,GAAG,GAAG,kBAAkB;oBAAE,SAAS;gBACvC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;gBACxD,GAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;gBAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAA0B,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;YAC9D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5D,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/C,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC;YAC3B,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAChD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAErD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;YAC/D,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YACjC,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC;YAE3E,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE;oBACvC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU;oBAC3B,kBAAkB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB;oBAChD,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc;oBACnC,gBAAgB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,cAAc;iBAC1D,CAAC;gBACF,OAAO,EAAE,KAAK;gBACd,SAAS,EAAE,OAAO;gBAClB,KAAK,EAAE,OAAO,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAEO,SAAS,CAAC,CAAU;QAC1B,MAAM,cAAc,GAClB,CAAC,CAAC,SAAS,KAAK,QAAQ;YACtB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,YAAY;gBAC5B,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,kBAAkB;oBAClC,CAAC,CAAC,IAAI;oBACN,CAAC,CAAC,IAAI,CAAC,CAAC,iBAAiB;QACjC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjE,MAAM,QAAQ,GAAG,aAAa,KAAK,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,QAAQ;YACpB,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,gBAAgB,CAAC,CAAC,OAAO,CAAC,MAAM,QAAQ;YAChE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,iCAAiC,KAAK,EAAE,CAAC;QAEhE,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,EAAE;YACnB,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;YACnD,UAAU,EAAE,cAAc;YAC1B,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK;YACL,WAAW,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YACrC,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9B,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,OAAO,EAAE,CAAC,CAAC,MAAM;aAClB,CAAC,CAAC;YACH,UAAU,EACR,sGAAsG;YACxG,WAAW,EAAE,UAAU,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE;SAC/C,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,CAAU;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO;aACpB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,cAAc,CAAC,CAAC,IAAI,GAAG,CAAC;aACnE,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,cAAc,GAA8B;YAChD,MAAM,EAAE,yEAAyE;YACjF,UAAU,EAAE,8EAA8E;YAC1F,kBAAkB,EAAE,mFAAmF;YACvG,gBAAgB,EAAE,kCAAkC,kBAAkB,uBAAuB;SAC9F,CAAC;QACF,MAAM,KAAK,GACT,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;YAChB,CAAC,CAAC,sBAAsB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YAC5F,CAAC,CAAC,EAAE,CAAC;QACT,OAAO,gBAAgB,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,KAAK,KAAK,KAAK,iBAAiB,KAAK,EAAE,CAAC;IACzG,CAAC;CACF;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,EAAqB;IACzC,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACjE,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1E,OAAO,GAAG,KAAK,IAAI,MAAM,MAAM,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;AACrE,CAAC;AAED,SAAS,OAAO,CAAC,CAAsB,EAAE,CAAsB;IAC7D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,EAAE,CAAC;IACrD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;IAC1C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC;AAC7C,CAAC"}

package/dist/detectors/duplicate-type.d.ts

@@ -0,0 +1,9 @@
+import type { Detector, Finding, SymbolRecord } from '../types.js';
+export declare class DuplicateTypeDetector implements Detector {
+    id: string;
+    name: string;
+    run(symbols: SymbolRecord[]): Promise<Finding[]>;
+    private toFinding;
+    private buildDescription;
+}
+//# sourceMappingURL=duplicate-type.d.ts.map

package/dist/detectors/duplicate-type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-type.d.ts","sourceRoot":"","sources":["../../src/detectors/duplicate-type.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAkB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAsBnF,qBAAa,qBAAsB,YAAW,QAAQ;IACpD,EAAE,SAAoB;IACtB,IAAI,SAA6B;IAE3B,GAAG,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAoGtD,OAAO,CAAC,SAAS;IA6BjB,OAAO,CAAC,gBAAgB;CAczB"}

package/dist/detectors/duplicate-type.js

@@ -0,0 +1,166 @@
+import { UnionFind, bucketBy, representativeHash } from '../utils/clustering.js';
+/** Minimum field count for a structural-only match to be considered non-trivial. */
+const STRUCTURAL_MIN_FIELDS = 4;
+/** Ranking: highest-precision layer wins when multiple fire on the same cluster. */
+const LAYER_PRIORITY = ['strict', 'normalized-names', 'structural'];
+export class DuplicateTypeDetector {
+    id = 'duplicate-type';
+    name = 'Duplicate type detector';
+    async run(symbols) {
+        const typeLike = symbols.filter((s) => (s.kind === 'interface' || s.kind === 'type-alias') &&
+            s.structure?.kind === 'object' &&
+            (s.structure.fields?.length ?? 0) > 0);
+        // Compute buckets per layer, sharing every typeLike symbol across all layers.
+        // Old behavior excluded a symbol from later layers once its first layer fired
+        // — that meant a 3-way cluster like Product/ProductDTO/Item lost Item, since
+        // Product and ProductDTO bound at strict (layer 1a) and the structural layer
+        // then ran on `remaining`, leaving Item alone.
+        const strictBuckets = bucketBy(typeLike, (s) => s.hashStrict);
+        const normalizedBuckets = bucketBy(typeLike, (s) => s.hashNormalizedNames);
+        const structuralBuckets = bucketBy(typeLike.filter((s) => !isStructurallyTrivial(s)), (s) => s.hashStructural);
+        // Union-find — two symbols belong to the same cluster if they collide on
+        // any of the three hashes.
+        const indexOf = new Map(typeLike.map((s, i) => [s.id, i]));
+        const uf = new UnionFind(typeLike.length);
+        const edgeLayer = new Map(); // root index → layers that touched
+        const unionBucket = (bucket, matchedBy) => {
+            if (bucket.length < 2)
+                return;
+            const first = indexOf.get(bucket[0].id);
+            if (first == null)
+                return;
+            for (let i = 1; i < bucket.length; i++) {
+                const next = indexOf.get(bucket[i].id);
+                if (next == null)
+                    continue;
+                uf.union(first, next);
+            }
+            // Tag every member with the layer signal.
+            for (const s of bucket) {
+                const idx = indexOf.get(s.id);
+                if (idx == null)
+                    continue;
+                const root = uf.find(idx);
+                const set = edgeLayer.get(root) ?? new Set();
+                set.add(matchedBy);
+                edgeLayer.set(root, set);
+            }
+        };
+        for (const b of strictBuckets.values())
+            unionBucket(b, 'strict');
+        for (const b of normalizedBuckets.values())
+            unionBucket(b, 'normalized-names');
+        for (const b of structuralBuckets.values())
+            unionBucket(b, 'structural');
+        // Re-aggregate edgeLayer keyed by the final canonical root after all unions.
+        const finalSignals = new Map();
+        for (let i = 0; i < typeLike.length; i++) {
+            const root = uf.find(i);
+            const merged = finalSignals.get(root) ?? new Set();
+            const seenAtThis = edgeLayer.get(uf.find(i));
+            if (seenAtThis)
+                for (const s of seenAtThis)
+                    merged.add(s);
+            // Also pick up signals tagged on intermediate roots that ended up under `root`.
+            for (const [k, v] of edgeLayer) {
+                if (uf.find(k) === root)
+                    for (const s of v)
+                        merged.add(s);
+            }
+            finalSignals.set(root, merged);
+        }
+        // Group symbols by root.
+        const componentsByRoot = new Map();
+        for (let i = 0; i < typeLike.length; i++) {
+            const root = uf.find(i);
+            const group = componentsByRoot.get(root) ?? [];
+            group.push(typeLike[i]);
+            componentsByRoot.set(root, group);
+        }
+        const clusters = [];
+        for (const [root, group] of componentsByRoot) {
+            if (group.length < 2)
+                continue;
+            // Same-file size-2 skip — both members in the same file is almost always intentional.
+            const files = new Set(group.map((g) => g.file));
+            if (files.size === 1 && group.length === 2)
+                continue;
+            const signals = finalSignals.get(root) ?? new Set();
+            if (signals.size === 0)
+                continue; // shouldn't happen but be safe
+            const primary = LAYER_PRIORITY.find((p) => signals.has(p)) ?? 'structural';
+            clusters.push({
+                hash: representativeHash(group, primary, {
+                    strict: (s) => s.hashStrict,
+                    'normalized-names': (s) => s.hashNormalizedNames,
+                    structural: (s) => s.hashStructural,
+                }),
+                symbols: group,
+                matchedBy: primary,
+                layer: primary === 'normalized-names' ? 2 : 1,
+                signals,
+            });
+        }
+        return clusters.map((c) => this.toFinding(c));
+    }
+    toFinding(c) {
+        const baseConfidence = c.matchedBy === 'strict' ? 1.0 : c.matchedBy === 'structural' ? 0.85 : 0.75;
+        const distinctNames = new Set(c.symbols.map((s) => s.name)).size;
+        const sameName = distinctNames === 1;
+        const names = Array.from(new Set(c.symbols.map((s) => s.name))).join(', ');
+        const title = sameName
+            ? `'${c.symbols[0]?.name}' is defined ${c.symbols.length} times`
+            : `${c.symbols.length} types appear equivalent: ${names}`;
+        return {
+            detectorId: this.id,
+            severity: c.symbols.length >= 3 ? 'high' : 'medium',
+            confidence: baseConfidence,
+            layer: c.layer,
+            title,
+            description: this.buildDescription(c),
+            evidence: c.symbols.map((s) => ({
+                file: s.file,
+                range: s.range,
+                snippet: s.source,
+            })),
+            suggestion: 'Consolidate into a single shared definition (e.g., a shared types package) and import from one place.',
+            fingerprint: `dup-type:${c.matchedBy}:${c.hash}`,
+        };
+    }
+    buildDescription(c) {
+        const where = c.symbols
+            .map((s) => `- ${s.file}:${s.range.startLine} (${s.kind} ${s.name})`)
+            .join('\n');
+        const matchedByLabel = {
+            strict: 'Same fields, same names, same types',
+            structural: 'Same field types, different names (anonymous structural match)',
+            'normalized-names': 'Same fields after normalizing naming convention (snake/camel + synonyms)',
+        };
+        const extra = c.signals.size > 1
+            ? `\nAlso matches at: ${Array.from(c.signals).filter((s) => s !== c.matchedBy).join(', ')}.`
+            : '';
+        return `Match level: ${matchedByLabel[c.matchedBy]} (layer ${c.layer}).${extra}\nLocations:\n${where}`;
+    }
+}
+function isStructurallyTrivial(s) {
+    const struct = s.structure;
+    const fields = struct && 'fields' in struct ? struct.fields ?? [] : [];
+    const kinds = new Set(fields.map(primitiveKindOf));
+    // A complex field (method / object / array / union with non-primitive) is a
+    // strong signal that the shape is meaningful. Allow it past the trivial gate
+    // with ≥3 fields instead of the usual 4-field minimum.
+    if (kinds.has('complex') && fields.length >= 3)
+        return false;
+    if (fields.length < STRUCTURAL_MIN_FIELDS)
+        return true;
+    return kinds.size < 2;
+}
+function primitiveKindOf(f) {
+    const t = f.type.replace(/\s+/g, '').toLowerCase();
+    if (/^(string|number|boolean|bigint|symbol|null|undefined|date)(\|.*)?$/.test(t)) {
+        const head = t.split('|')[0];
+        return head;
+    }
+    return 'complex';
+}
+//# sourceMappingURL=duplicate-type.js.map

package/dist/detectors/duplicate-type.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-type.js","sourceRoot":"","sources":["../../src/detectors/duplicate-type.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAejF,oFAAoF;AACpF,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,oFAAoF;AACpF,MAAM,cAAc,GAAgB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,YAAY,CAAC,CAAC;AAEjF,MAAM,OAAO,qBAAqB;IAChC,EAAE,GAAG,gBAAgB,CAAC;IACtB,IAAI,GAAG,yBAAyB,CAAC;IAEjC,KAAK,CAAC,GAAG,CAAC,OAAuB;QAC/B,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAC7B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;YACnD,CAAC,CAAC,SAAS,EAAE,IAAI,KAAK,QAAQ;YAC9B,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CACxC,CAAC;QAEF,8EAA8E;QAC9E,8EAA8E;QAC9E,6EAA6E;QAC7E,6EAA6E;QAC7E,+CAA+C;QAC/C,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAC9D,MAAM,iBAAiB,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC;QAC3E,MAAM,iBAAiB,GAAG,QAAQ,CAChC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CACxB,CAAC;QAEF,yEAAyE;QACzE,2BAA2B;QAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC,CAAC,mCAAmC;QAExF,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAE,SAAoB,EAAQ,EAAE;YACzE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO;YAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,KAAK,IAAI,IAAI;gBAAE,OAAO;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,IAAI,IAAI,IAAI;oBAAE,SAAS;gBAC3B,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACxB,CAAC;YACD,0CAA0C;YAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9B,IAAI,GAAG,IAAI,IAAI;oBAAE,SAAS;gBAC1B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;gBACxD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACnB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACjE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC/E,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE;YAAE,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAEzE,6EAA6E;QAC7E,MAAM,YAAY,GAAG,IAAI,GAAG,EAA0B,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;YAC9D,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,UAAU;gBAAE,KAAK,MAAM,CAAC,IAAI,UAAU;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1D,gFAAgF;YAChF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,KAAK,MAAM,CAAC,IAAI,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5D,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,yBAAyB;QACzB,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;YACzB,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC/B,sFAAsF;YACtF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAChD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAErD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;YAC/D,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS,CAAC,+BAA+B;YACjE,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC;YAE3E,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE;oBACvC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU;oBAC3B,kBAAkB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB;oBAChD,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc;iBACpC,CAAC;gBACF,OAAO,EAAE,KAAK;gBACd,SAAS,EAAE,OAAO;gBAClB,KAAK,EAAE,OAAO,KAAK,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAEO,SAAS,CAAC,CAAU;QAC1B,MAAM,cAAc,GAClB,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9E,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjE,MAAM,QAAQ,GAAG,aAAa,KAAK,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,QAAQ;YACpB,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,gBAAgB,CAAC,CAAC,OAAO,CAAC,MAAM,QAAQ;YAChE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,6BAA6B,KAAK,EAAE,CAAC;QAE5D,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,EAAE;YACnB,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;YACnD,UAAU,EAAE,cAAc;YAC1B,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK;YACL,WAAW,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YACrC,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9B,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,OAAO,EAAE,CAAC,CAAC,MAAM;aAClB,CAAC,CAAC;YACH,UAAU,EACR,uGAAuG;YACzG,WAAW,EAAE,YAAY,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE;SACjD,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,CAAU;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO;aACpB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACpE,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,cAAc,GAA8B;YAChD,MAAM,EAAE,qCAAqC;YAC7C,UAAU,EAAE,gEAAgE;YAC5E,kBAAkB,EAAE,0EAA0E;SAC/F,CAAC;QACF,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;YAC9B,CAAC,CAAC,sBAAsB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YAC5F,CAAC,CAAC,EAAE,CAAC;QACP,OAAO,gBAAgB,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,KAAK,KAAK,KAAK,iBAAiB,KAAK,EAAE,CAAC;IACzG,CAAC;CACF;AAED,SAAS,qBAAqB,CAAC,CAAe;IAC5C,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC;IAC3B,MAAM,MAAM,GAAG,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACvE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;IACnD,4EAA4E;IAC5E,6EAA6E;IAC7E,uDAAuD;IACvD,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,IAAI,MAAM,CAAC,MAAM,GAAG,qBAAqB;QAAE,OAAO,IAAI,CAAC;IACvD,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,eAAe,CAAC,CAAiB;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACnD,IAAI,oEAAoE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACjF,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/detectors/hot-hub-file.d.ts

@@ -0,0 +1,11 @@
+import type { ImportGraph } from '../graph/import-graph.js';
+import type { Finding } from '../types.js';
+export interface HotHubFileDetectorInput {
+    graph: ImportGraph;
+    /** Threshold for incoming-import count. Default 20. */
+    threshold?: number;
+    /** Max findings to emit. Default 10 (this is an INFO signal, not a buglist). */
+    maxFindings?: number;
+}
+export declare function detectHotHubFiles(input: HotHubFileDetectorInput): Finding[];
+//# sourceMappingURL=hot-hub-file.d.ts.map

package/dist/detectors/hot-hub-file.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hot-hub-file.d.ts","sourceRoot":"","sources":["../../src/detectors/hot-hub-file.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAG3C,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,WAAW,CAAC;IACnB,uDAAuD;IACvD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAgBD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,uBAAuB,GAAG,OAAO,EAAE,CA2B3E"}

package/dist/detectors/hot-hub-file.js

@@ -0,0 +1,42 @@
+import { stableHash } from '../utils/hash.js';
+// Files imported by >threshold others — refactor blast-radius signal. INFO.
+//
+// TODO(under-implemented): minimal detector compared to peers. Open items:
+//   1. Threshold tuning — current 20 is a static guess. Should scale with
+//      workspace size (e.g. p95 of incoming-import distribution + bonus
+//      for files with no outgoing imports → pure leaf hubs are worst).
+//   2. Severity scaling — currently always 'low'. Bump to 'medium' at
+//      2x threshold, 'high' at 4x (a barrel re-export pulled by 100 files
+//      is a much bigger blast radius than one pulled by 21).
+//   3. Suggestion enrichment — detect barrel-export shape (file body is
+//      mostly `export { … } from './x'`) and tailor the suggestion
+//      (delete the barrel) vs utility-module shape (suggest splitting).
+//   4. Per-workspace blast-radius — in multi-workspace mode, weight by
+//      how many workspaces import the file, not just file count.
+export function detectHotHubFiles(input) {
+    const threshold = input.threshold ?? 20;
+    const maxFindings = input.maxFindings ?? 10;
+    const ranked = [...input.graph.incoming.entries()]
+        .map(([file, callers]) => ({ file, count: callers.size }))
+        .filter((x) => x.count >= threshold)
+        .sort((a, b) => b.count - a.count)
+        .slice(0, maxFindings);
+    return ranked.map(({ file, count }) => ({
+        detectorId: 'hot-hub-file',
+        severity: 'low',
+        confidence: 1,
+        layer: 1,
+        title: `Import hub: ${file} (${count} importers)`,
+        description: `\`${file}\` is imported by ${count} other files. Hubs concentrate change-blast-radius — every refactor of this file ripples across the whole workspace.`,
+        evidence: [
+            {
+                file,
+                range: { startLine: 1, endLine: 1 },
+                snippet: `// ${file} — imported by ${count} files`,
+            },
+        ],
+        suggestion: 'If this is a barrel re-export, consider deleting it and asking importers to use the original module — barrels confuse tree-shaking and slow incremental builds. If it is a utility module, split it along its natural responsibilities.',
+        fingerprint: `hot-hub-file:${stableHash(file)}`,
+    }));
+}
+//# sourceMappingURL=hot-hub-file.js.map

package/dist/detectors/hot-hub-file.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hot-hub-file.js","sourceRoot":"","sources":["../../src/detectors/hot-hub-file.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAU9C,4EAA4E;AAC5E,EAAE;AACF,2EAA2E;AAC3E,0EAA0E;AAC1E,wEAAwE;AACxE,uEAAuE;AACvE,sEAAsE;AACtE,0EAA0E;AAC1E,6DAA6D;AAC7D,wEAAwE;AACxE,mEAAmE;AACnE,wEAAwE;AACxE,uEAAuE;AACvE,iEAAiE;AACjE,MAAM,UAAU,iBAAiB,CAAC,KAA8B;IAC9D,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;IACxC,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;IAC5C,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;SAC/C,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;SACzD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC;SACnC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,UAAU,EAAE,cAAc;QAC1B,QAAQ,EAAE,KAAK;QACf,UAAU,EAAE,CAAC;QACb,KAAK,EAAE,CAAC;QACR,KAAK,EAAE,eAAe,IAAI,KAAK,KAAK,aAAa;QACjD,WAAW,EACT,KAAK,IAAI,qBAAqB,KAAK,sHAAsH;QAC3J,QAAQ,EAAE;YACR;gBACE,IAAI;gBACJ,KAAK,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACnC,OAAO,EAAE,MAAM,IAAI,kBAAkB,KAAK,QAAQ;aACnD;SACF;QACD,UAAU,EACR,yOAAyO;QAC3O,WAAW,EAAE,gBAAgB,UAAU,CAAC,IAAI,CAAC,EAAE;KAChD,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/detectors/long-file.d.ts

@@ -0,0 +1,12 @@
+import type { Finding } from '../types.js';
+import type { FileWalkingDetectorInput } from '../types/detector-input.js';
+export interface LongFileDetectorInput extends FileWalkingDetectorInput {
+    /** LOW threshold in non-blank/non-comment lines. Default 400. */
+    lowThreshold?: number;
+    /** MED threshold. Default 700. */
+    medThreshold?: number;
+    /** HIGH threshold. Default 1200. */
+    highThreshold?: number;
+}
+export declare function detectLongFiles(input: LongFileDetectorInput): Finding[];
+//# sourceMappingURL=long-file.d.ts.map

package/dist/detectors/long-file.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"long-file.d.ts","sourceRoot":"","sources":["../../src/detectors/long-file.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAG3C,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAE3E,MAAM,WAAW,qBAAsB,SAAQ,wBAAwB;IACvE,iEAAiE;IAC/D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kCAAkC;IAClC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAID,wBAAgB,eAAe,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO,EAAE,CAmCvE"}

package/dist/detectors/long-file.js

@@ -0,0 +1,82 @@
+import { makeSourceReader } from '../utils/source-reader.js';
+import { stableHash } from '../utils/hash.js';
+// Effective LOC (non-blank, non-pure-comment) over 400 (low) / 700 (med) /
+// 1200 (high). Generated + .d.ts excluded.
+export function detectLongFiles(input) {
+    const low = input.lowThreshold ?? 400;
+    const med = input.medThreshold ?? 700;
+    const high = input.highThreshold ?? 1200;
+    const read = makeSourceReader(input.workspaceRoot, input.project);
+    const findings = [];
+    for (const rel of input.files) {
+        if (!isAnalysable(rel))
+            continue;
+        const raw = read(rel);
+        if (raw == null)
+            continue;
+        const loc = countEffectiveLines(raw);
+        if (loc < low)
+            continue;
+        const severity = loc >= high ? 'high' : loc >= med ? 'medium' : 'low';
+        findings.push({
+            detectorId: 'long-file',
+            severity,
+            confidence: 0.99,
+            layer: 1,
+            title: `Long file: ${rel} (${loc} LOC)`,
+            description: `${loc} non-blank lines of code (excluding pure-comment lines). Files this size are hard to navigate, hard to test, and accumulate unrelated concerns. Common root cause: feature-by-feature additions without periodic refactoring.`,
+            evidence: [
+                {
+                    file: rel,
+                    range: { startLine: 1, endLine: Math.min(raw.split('\n').length, loc) },
+                    snippet: `// ${rel} — ${loc} effective lines of code`,
+                },
+            ],
+            suggestion: 'Split the file along its natural concerns (e.g. one class per file, separate I/O from logic, extract pure helpers to a sibling `*-utils.ts`). Use the symbol-graph view to spot internal clusters that are good split candidates.',
+            fingerprint: `long-file:${stableHash(rel)}`,
+        });
+    }
+    return findings;
+}
+function countEffectiveLines(raw) {
+    let count = 0;
+    let inBlockComment = false;
+    for (const line of raw.split('\n')) {
+        let t = line.trim();
+        if (inBlockComment) {
+            const endIdx = t.indexOf('*/');
+            if (endIdx === -1)
+                continue;
+            inBlockComment = false;
+            t = t.slice(endIdx + 2).trim();
+        }
+        if (t === '')
+            continue;
+        // Strip leading block-comment that ends on same line.
+        while (t.startsWith('/*')) {
+            const endIdx = t.indexOf('*/');
+            if (endIdx === -1) {
+                inBlockComment = true;
+                t = '';
+                break;
+            }
+            t = t.slice(endIdx + 2).trim();
+        }
+        if (t === '')
+            continue;
+        if (t.startsWith('//'))
+            continue;
+        if (t.startsWith('*'))
+            continue; // continuation of JSDoc
+        count += 1;
+    }
+    return count;
+}
+function isAnalysable(file) {
+    return /\.(?:ts|tsx|mts|cts|js|jsx|mjs|cjs)$/.test(file)
+        && !/\.d\.ts$/.test(file)
+        && !/(^|\/)node_modules\//.test(file)
+        && !/(^|\/)dist\//.test(file)
+        && !/\.generated\.(?:ts|js)$/.test(file);
+}
+//# sourceMappingURL=long-file.js.map

package/dist/detectors/long-file.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"long-file.js","sourceRoot":"","sources":["../../src/detectors/long-file.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAY9C,2EAA2E;AAC3E,2CAA2C;AAC3C,MAAM,UAAU,eAAe,CAAC,KAA4B;IAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC;IACtC,MAAM,GAAG,GAAG,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC;IACtC,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC;IACzC,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,GAAG,IAAI,IAAI;YAAE,SAAS;QAC1B,MAAM,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,GAAG;YAAE,SAAS;QACxB,MAAM,QAAQ,GAA8B,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;QACjG,QAAQ,CAAC,IAAI,CAAC;YACZ,UAAU,EAAE,WAAW;YACvB,QAAQ;YACR,UAAU,EAAE,IAAI;YAChB,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,cAAc,GAAG,KAAK,GAAG,OAAO;YACvC,WAAW,EACT,GAAG,GAAG,+NAA+N;YACvO,QAAQ,EAAE;gBACR;oBACE,IAAI,EAAE,GAAG;oBACT,KAAK,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;oBACvE,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,0BAA0B;iBACtD;aACF;YACD,UAAU,EACR,mOAAmO;YACrO,WAAW,EAAE,aAAa,UAAU,CAAC,GAAG,CAAC,EAAE;SAC5C,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAW;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,cAAc,GAAG,KAAK,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACpB,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,CAAC,CAAC;gBAAE,SAAS;YAC5B,cAAc,GAAG,KAAK,CAAC;YACvB,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,EAAE;YAAE,SAAS;QACvB,sDAAsD;QACtD,OAAO,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;gBAClB,cAAc,GAAG,IAAI,CAAC;gBACtB,CAAC,GAAG,EAAE,CAAC;gBACP,MAAM;YACR,CAAC;YACD,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,EAAE;YAAE,SAAS;QACvB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,SAAS;QACjC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,wBAAwB;QACzD,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,sCAAsC,CAAC,IAAI,CAAC,IAAI,CAAC;WACnD,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;WACtB,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC;WAClC,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC;WAC1B,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC"}

package/dist/detectors/long-function.d.ts

@@ -0,0 +1,12 @@
+import type { Finding, SymbolRecord } from '../types.js';
+export interface LongFunctionDetectorInput {
+    symbols: ReadonlyArray<SymbolRecord>;
+    /** LOW threshold. Default 60 source lines. */
+    lowThreshold?: number;
+    /** MED threshold. Default 120 source lines. */
+    medThreshold?: number;
+    /** HIGH threshold. Default 200 source lines. */
+    highThreshold?: number;
+}
+export declare function detectLongFunctions(input: LongFunctionDetectorInput): Finding[];
+//# sourceMappingURL=long-function.d.ts.map

package/dist/detectors/long-function.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"long-function.d.ts","sourceRoot":"","sources":["../../src/detectors/long-function.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAGzD,MAAM,WAAW,yBAAyB;IACxC,OAAO,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC;IACrC,8CAA8C;IAC9C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,+CAA+C;IAC/C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,gDAAgD;IAChD,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAID,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,yBAAyB,GAAG,OAAO,EAAE,CAiC/E"}